/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/parallel-misc-1.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.mcr-reduction-c7b2d19 [2022-03-15 18:53:29,844 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-03-15 18:53:29,845 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-03-15 18:53:29,889 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-03-15 18:53:29,890 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-03-15 18:53:29,890 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-03-15 18:53:29,891 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-03-15 18:53:29,893 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-03-15 18:53:29,894 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-03-15 18:53:29,895 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-03-15 18:53:29,895 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-03-15 18:53:29,896 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-03-15 18:53:29,896 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-03-15 18:53:29,897 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-03-15 18:53:29,898 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-03-15 18:53:29,899 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-03-15 18:53:29,915 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-03-15 18:53:29,922 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-03-15 18:53:29,932 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-03-15 18:53:29,933 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-03-15 18:53:29,934 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-03-15 18:53:29,939 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-03-15 18:53:29,939 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-03-15 18:53:29,940 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-03-15 18:53:29,941 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-03-15 18:53:29,942 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-03-15 18:53:29,942 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-03-15 18:53:29,942 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-03-15 18:53:29,943 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-03-15 18:53:29,943 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-03-15 18:53:29,943 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-03-15 18:53:29,944 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-03-15 18:53:29,944 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-03-15 18:53:29,945 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-03-15 18:53:29,945 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-03-15 18:53:29,946 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-03-15 18:53:29,946 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-03-15 18:53:29,946 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-03-15 18:53:29,946 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-03-15 18:53:29,947 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-03-15 18:53:29,947 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-03-15 18:53:29,950 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 18:53:29,969 INFO L113 SettingsManager]: Loading preferences was successful [2022-03-15 18:53:29,970 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-03-15 18:53:29,971 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-03-15 18:53:29,971 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-03-15 18:53:29,971 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-03-15 18:53:29,971 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-03-15 18:53:29,971 INFO L138 SettingsManager]: * Use SBE=true [2022-03-15 18:53:29,971 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-03-15 18:53:29,972 INFO L138 SettingsManager]: * sizeof long=4 [2022-03-15 18:53:29,972 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-03-15 18:53:29,972 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-03-15 18:53:29,972 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-03-15 18:53:29,972 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-03-15 18:53:29,973 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-03-15 18:53:29,973 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-03-15 18:53:29,973 INFO L138 SettingsManager]: * sizeof long double=12 [2022-03-15 18:53:29,973 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-03-15 18:53:29,973 INFO L138 SettingsManager]: * Use constant arrays=true [2022-03-15 18:53:29,973 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-03-15 18:53:29,973 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-03-15 18:53:29,973 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-03-15 18:53:29,974 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-03-15 18:53:29,974 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-03-15 18:53:29,974 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-15 18:53:29,974 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-03-15 18:53:29,974 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-03-15 18:53:29,974 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-03-15 18:53:29,974 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-03-15 18:53:29,974 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-03-15 18:53:29,974 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2022-03-15 18:53:29,974 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2022-03-15 18:53:29,975 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-03-15 18:53:29,975 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 18:53:30,158 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-03-15 18:53:30,180 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-03-15 18:53:30,181 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-03-15 18:53:30,182 INFO L271 PluginConnector]: Initializing CDTParser... [2022-03-15 18:53:30,183 INFO L275 PluginConnector]: CDTParser initialized [2022-03-15 18:53:30,184 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/parallel-misc-1.wvr.c [2022-03-15 18:53:30,235 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/18a003a2b/bf5298769848486b95f5cfdb473a9171/FLAG903911588 [2022-03-15 18:53:30,614 INFO L306 CDTParser]: Found 1 translation units. [2022-03-15 18:53:30,614 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-misc-1.wvr.c [2022-03-15 18:53:30,623 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/18a003a2b/bf5298769848486b95f5cfdb473a9171/FLAG903911588 [2022-03-15 18:53:30,639 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/18a003a2b/bf5298769848486b95f5cfdb473a9171 [2022-03-15 18:53:30,641 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-03-15 18:53:30,643 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-03-15 18:53:30,647 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-03-15 18:53:30,647 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-03-15 18:53:30,649 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-03-15 18:53:30,649 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 06:53:30" (1/1) ... [2022-03-15 18:53:30,651 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@8e5b45d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 06:53:30, skipping insertion in model container [2022-03-15 18:53:30,651 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 06:53:30" (1/1) ... [2022-03-15 18:53:30,656 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-03-15 18:53:30,682 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-03-15 18:53:30,910 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/parallel-misc-1.wvr.c[2755,2768] [2022-03-15 18:53:30,917 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-15 18:53:30,921 INFO L203 MainTranslator]: Completed pre-run [2022-03-15 18:53:30,936 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/parallel-misc-1.wvr.c[2755,2768] [2022-03-15 18:53:30,939 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-15 18:53:30,953 INFO L208 MainTranslator]: Completed translation [2022-03-15 18:53:30,954 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 06:53:30 WrapperNode [2022-03-15 18:53:30,955 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-03-15 18:53:30,956 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-03-15 18:53:30,956 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-03-15 18:53:30,956 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-03-15 18:53:30,961 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 06:53:30" (1/1) ... [2022-03-15 18:53:30,978 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 06:53:30" (1/1) ... [2022-03-15 18:53:31,008 INFO L137 Inliner]: procedures = 23, calls = 41, calls flagged for inlining = 17, calls inlined = 31, statements flattened = 277 [2022-03-15 18:53:31,008 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-03-15 18:53:31,009 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-03-15 18:53:31,009 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-03-15 18:53:31,009 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-03-15 18:53:31,027 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 06:53:30" (1/1) ... [2022-03-15 18:53:31,027 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 06:53:30" (1/1) ... [2022-03-15 18:53:31,030 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 06:53:30" (1/1) ... [2022-03-15 18:53:31,030 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 06:53:30" (1/1) ... [2022-03-15 18:53:31,037 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 06:53:30" (1/1) ... [2022-03-15 18:53:31,054 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 06:53:30" (1/1) ... [2022-03-15 18:53:31,056 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 06:53:30" (1/1) ... [2022-03-15 18:53:31,058 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-03-15 18:53:31,059 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-03-15 18:53:31,059 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-03-15 18:53:31,059 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-03-15 18:53:31,061 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 06:53:30" (1/1) ... [2022-03-15 18:53:31,076 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-15 18:53:31,083 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 18:53:31,093 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 18:53:31,119 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 18:53:31,135 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-03-15 18:53:31,136 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-03-15 18:53:31,136 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-03-15 18:53:31,136 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-03-15 18:53:31,136 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-03-15 18:53:31,136 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-03-15 18:53:31,136 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-03-15 18:53:31,136 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-03-15 18:53:31,136 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-03-15 18:53:31,136 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-03-15 18:53:31,136 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-03-15 18:53:31,136 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-03-15 18:53:31,137 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-03-15 18:53:31,138 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 18:53:31,229 INFO L234 CfgBuilder]: Building ICFG [2022-03-15 18:53:31,230 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-03-15 18:53:31,681 INFO L275 CfgBuilder]: Performing block encoding [2022-03-15 18:53:31,690 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-03-15 18:53:31,690 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-03-15 18:53:31,691 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 06:53:31 BoogieIcfgContainer [2022-03-15 18:53:31,692 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-03-15 18:53:31,693 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-03-15 18:53:31,693 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-03-15 18:53:31,697 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-03-15 18:53:31,697 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.03 06:53:30" (1/3) ... [2022-03-15 18:53:31,698 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7520e82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 06:53:31, skipping insertion in model container [2022-03-15 18:53:31,698 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 06:53:30" (2/3) ... [2022-03-15 18:53:31,698 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7520e82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 06:53:31, skipping insertion in model container [2022-03-15 18:53:31,698 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 06:53:31" (3/3) ... [2022-03-15 18:53:31,699 INFO L111 eAbstractionObserver]: Analyzing ICFG parallel-misc-1.wvr.c [2022-03-15 18:53:31,703 WARN L150 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-03-15 18:53:31,703 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-03-15 18:53:31,703 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-03-15 18:53:31,703 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-03-15 18:53:31,761 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,762 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,762 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,762 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,762 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,762 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,762 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,763 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,763 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,763 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,763 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,763 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,763 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,763 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,763 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,764 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,764 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,764 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,764 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,764 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,764 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,764 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,764 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,764 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,764 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,765 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,765 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,765 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,765 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,765 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,765 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,765 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,765 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,765 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,766 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,766 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,766 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,766 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,766 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,766 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,766 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,766 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,767 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,767 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,767 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,767 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,768 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,768 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,768 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,768 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,768 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,768 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,769 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,773 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,774 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,774 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,774 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,775 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,775 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,775 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,775 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,775 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,775 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,775 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,775 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,776 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,776 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,776 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,776 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,776 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,776 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,776 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,777 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,777 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,777 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,777 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,777 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,777 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,778 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,778 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,778 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,778 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,778 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,778 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,778 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,778 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,779 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,779 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,779 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,779 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,779 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,779 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,779 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,780 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,780 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,780 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,780 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,780 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,780 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,780 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,780 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,780 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,781 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,781 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,781 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,781 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,781 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,781 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,781 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,781 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,781 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,782 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ret8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,782 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,782 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ret8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,782 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,782 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,782 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,782 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,782 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,782 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,783 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,783 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ret2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,783 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,783 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ret2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,783 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ret8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,783 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ret8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,788 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ret8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,788 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ret8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,789 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ret2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,789 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ret2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,789 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ret8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,789 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ret8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,789 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ret2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,790 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ret2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,790 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ret2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,790 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ret2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,790 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,790 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,790 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,791 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,791 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,791 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,791 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,791 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,791 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ret2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,791 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ret2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,791 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ret2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,791 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ret2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,792 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,792 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,792 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,792 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,792 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,792 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,792 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,793 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,793 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,793 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,793 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,793 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,793 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,793 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,793 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,793 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,793 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,794 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,794 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,794 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,794 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,794 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,794 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,794 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,794 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,794 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,794 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,795 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,795 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,795 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,795 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,795 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,795 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,795 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,795 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,795 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,795 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,796 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,796 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,796 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,796 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,796 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,796 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,797 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,797 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,797 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,797 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,797 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,797 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,798 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,798 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,798 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,798 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,798 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,798 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,799 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,799 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,799 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,799 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,799 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,799 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,799 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,799 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,799 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,800 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,800 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,800 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,800 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,800 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,800 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,800 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,800 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,801 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,801 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,801 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,801 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,801 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,801 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,802 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,802 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,802 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,802 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,802 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,802 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,803 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,803 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,803 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,803 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,803 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,803 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,803 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,803 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,804 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,804 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,804 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,804 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,804 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,804 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,804 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,804 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,804 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,805 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,805 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,805 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,805 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,805 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,805 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,806 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,806 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,806 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,806 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,806 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,806 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,806 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,806 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,806 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,806 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,807 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ret5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,807 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,807 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ret5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,807 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,807 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ret4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,807 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,807 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ret4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,807 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ret5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,808 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ret5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,808 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ret4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,808 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ret4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,809 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ret5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,809 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ret5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,809 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ret4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,809 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ret4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,809 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ret5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,809 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ret5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,809 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,809 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,812 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,812 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,812 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ret4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,812 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ret4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,812 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,813 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,813 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,813 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,813 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,813 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,813 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,813 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,813 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,813 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,815 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,815 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,815 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,815 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,815 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,815 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,815 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,816 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,816 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,816 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,816 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,816 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,816 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,816 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,816 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,816 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,817 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,817 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,817 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,817 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,817 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,817 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,817 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,817 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,817 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,818 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,818 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,818 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,818 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,818 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,818 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,818 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,818 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,818 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,818 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,819 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,819 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,819 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,819 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,819 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,819 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,819 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,819 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,820 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,820 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,820 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,820 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,820 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,821 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,821 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,821 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,821 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,821 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,821 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,822 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,822 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,822 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,822 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,822 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,822 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,822 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,822 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,822 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,823 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,823 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,823 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,823 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,823 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,823 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,823 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,823 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,824 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,824 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,824 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,824 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,824 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,825 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,825 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,825 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,825 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,825 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,825 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,825 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,826 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,826 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,826 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,826 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,826 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,826 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,826 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,826 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,827 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,827 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,827 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,833 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,833 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,833 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,833 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,834 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,834 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,834 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,834 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,834 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,834 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,834 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,834 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,835 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,835 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,835 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,835 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,835 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,835 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ret16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,835 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,835 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ret16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,835 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,836 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,836 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,836 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,836 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,836 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,836 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,836 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ret10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,836 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,836 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ret10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,836 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ret16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,837 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ret16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,837 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ret16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,837 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ret16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,837 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ret10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,838 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ret10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,838 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ret16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,838 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ret16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,838 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ret10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,838 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ret10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,838 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ret10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,839 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ret10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,839 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,839 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,839 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,839 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,839 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,839 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,839 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,839 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,840 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ret10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,840 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ret10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,840 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ret10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,840 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ret10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,840 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,840 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,840 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,840 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,841 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,841 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,841 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,841 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,841 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,841 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,841 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,841 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,841 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,841 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,842 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,842 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,842 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,842 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,842 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,842 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,842 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,842 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,842 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,842 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,842 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,843 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,843 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,843 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,843 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,843 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,843 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,843 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,843 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,843 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,843 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,844 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,844 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,844 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,844 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,844 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,844 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,844 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,844 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,845 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,845 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,845 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,845 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,845 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,845 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,845 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,846 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,846 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,846 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,846 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,846 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,846 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,846 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,846 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,846 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,846 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,847 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,847 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,847 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,859 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,859 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,860 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,860 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,860 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,860 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,860 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,860 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,860 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,861 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,861 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,861 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,861 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,861 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,861 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,861 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,862 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,862 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,862 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,862 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,862 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,862 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,862 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,862 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,862 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,863 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,863 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,863 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,863 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,863 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,863 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,863 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,863 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,863 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,863 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,864 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,864 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,864 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,864 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,864 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,864 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,864 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,864 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,864 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,864 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,864 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,865 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,865 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,865 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,865 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,865 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,865 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,865 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,865 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,865 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ret13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,865 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,865 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ret13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,866 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,866 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ret12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,866 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,866 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ret12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,866 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ret13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,866 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ret13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,866 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ret12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,867 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ret12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,867 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ret13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,867 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ret13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,867 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ret12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,867 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ret12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,867 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ret13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,867 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ret13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,867 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,868 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,868 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,868 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,868 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ret12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,868 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ret12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,868 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,868 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,868 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,868 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,868 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,868 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,869 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,869 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,869 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,869 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,871 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,871 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,871 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,872 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,872 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ret4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,872 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,872 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,872 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ret8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,872 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,872 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ret5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,872 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ret2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,872 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,872 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,872 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,873 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,873 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,873 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,874 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,874 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,874 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,875 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,875 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,875 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,875 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ret13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,875 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,875 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,875 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,875 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,875 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,875 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,875 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,875 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ret10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,875 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ret12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,876 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ret16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:31,877 INFO L148 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-03-15 18:53:31,908 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-03-15 18:53:31,914 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 18:53:31,915 INFO L340 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-03-15 18:53:31,930 INFO L126 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-03-15 18:53:31,937 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 375 places, 396 transitions, 808 flow [2022-03-15 18:53:31,942 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 375 places, 396 transitions, 808 flow [2022-03-15 18:53:31,943 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 375 places, 396 transitions, 808 flow [2022-03-15 18:53:32,086 INFO L129 PetriNetUnfolder]: 28/394 cut-off events. [2022-03-15 18:53:32,086 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-03-15 18:53:32,097 INFO L84 FinitePrefix]: Finished finitePrefix Result has 403 conditions, 394 events. 28/394 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 924 event pairs, 0 based on Foata normal form. 0/365 useless extension candidates. Maximal degree in co-relation 271. Up to 2 conditions per place. [2022-03-15 18:53:32,113 INFO L116 LiptonReduction]: Number of co-enabled transitions 37700 [2022-03-15 18:53:41,869 INFO L131 LiptonReduction]: Checked pairs total: 32001 [2022-03-15 18:53:41,869 INFO L133 LiptonReduction]: Total number of compositions: 486 [2022-03-15 18:53:41,884 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 24 places, 21 transitions, 58 flow [2022-03-15 18:53:41,895 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 33 states, 32 states have (on average 2.375) internal successors, (76), 32 states have internal predecessors, (76), 0 states have call successors, (0), 0 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 18:53:41,896 INFO L276 IsEmpty]: Start isEmpty. Operand has 33 states, 32 states have (on average 2.375) internal successors, (76), 32 states have internal predecessors, (76), 0 states have call successors, (0), 0 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 18:53:41,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-03-15 18:53:41,900 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 18:53:41,900 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 18:53:41,900 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 18:53:41,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 18:53:41,903 INFO L85 PathProgramCache]: Analyzing trace with hash 154848836, now seen corresponding path program 1 times [2022-03-15 18:53:41,915 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 18:53:41,915 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593835752] [2022-03-15 18:53:41,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:53:41,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 18:53:42,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:53:42,239 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 18:53:42,239 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 18:53:42,239 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593835752] [2022-03-15 18:53:42,245 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1593835752] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 18:53:42,246 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 18:53:42,246 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-15 18:53:42,247 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1320312436] [2022-03-15 18:53:42,247 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 18:53:42,252 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 18:53:42,266 INFO L252 McrAutomatonBuilder]: Finished intersection with 21 states and 29 transitions. [2022-03-15 18:53:42,266 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 18:53:42,732 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 3 new interpolants: [450#(and (or (< ~sum1~0 (+ ~bag2~0 ~sum2~0 1)) (< (+ ~bag2~0 ~sum2~0 2147483648) 0) (< 2147483647 (+ ~bag2~0 ~sum2~0))) (or (not (<= (+ ~bag2~0 ~sum2~0) 2147483647)) (<= (+ ~bag2~0 ~sum2~0) ~sum1~0) (not (<= 0 (+ ~bag2~0 ~sum2~0 2147483648))))), 451#(and (or (not (<= (+ ~bag1~0 ~sum1~0) 2147483647)) (not (<= 0 (+ ~bag2~0 ~sum2~0 2147483648))) (< (+ ~bag1~0 ~sum1~0) (+ ~bag2~0 ~sum2~0 1))) (or (not (<= (+ ~bag2~0 ~sum2~0) 2147483647)) (not (<= 0 (+ ~bag1~0 ~sum1~0 2147483648))) (<= (+ ~bag2~0 ~sum2~0) (+ ~bag1~0 ~sum1~0)))), 449#(and (or (not (<= (+ ~bag1~0 ~sum1~0) 2147483647)) (not (<= 0 (+ ~bag1~0 ~sum1~0 2147483648))) (< (+ ~bag1~0 ~sum1~0) (+ ~sum2~0 1))) (or (< (+ ~bag1~0 ~sum1~0 2147483648) 0) (<= ~sum2~0 (+ ~bag1~0 ~sum1~0)) (< 2147483647 (+ ~bag1~0 ~sum1~0))))] [2022-03-15 18:53:42,733 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-03-15 18:53:42,733 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 18:53:42,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-03-15 18:53:42,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-03-15 18:53:42,750 INFO L87 Difference]: Start difference. First operand has 33 states, 32 states have (on average 2.375) internal successors, (76), 32 states have internal predecessors, (76), 0 states have call successors, (0), 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 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 8 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:53:42,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 18:53:42,901 INFO L93 Difference]: Finished difference Result 96 states and 262 transitions. [2022-03-15 18:53:42,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-15 18:53:42,902 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 8 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-03-15 18:53:42,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 18:53:42,908 INFO L225 Difference]: With dead ends: 96 [2022-03-15 18:53:42,908 INFO L226 Difference]: Without dead ends: 91 [2022-03-15 18:53:42,909 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2022-03-15 18:53:42,912 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 62 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 18:53:42,913 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [62 Valid, 0 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 18:53:42,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2022-03-15 18:53:42,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 45. [2022-03-15 18:53:42,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 44 states have (on average 2.477272727272727) internal successors, (109), 44 states have internal predecessors, (109), 0 states have call successors, (0), 0 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 18:53:42,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 109 transitions. [2022-03-15 18:53:42,942 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 109 transitions. Word has length 12 [2022-03-15 18:53:42,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 18:53:42,942 INFO L470 AbstractCegarLoop]: Abstraction has 45 states and 109 transitions. [2022-03-15 18:53:42,942 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 8 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:53:42,943 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 109 transitions. [2022-03-15 18:53:42,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-03-15 18:53:42,943 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 18:53:42,943 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 18:53:42,943 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-03-15 18:53:42,943 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 18:53:42,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 18:53:42,944 INFO L85 PathProgramCache]: Analyzing trace with hash -1626357471, now seen corresponding path program 1 times [2022-03-15 18:53:42,945 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 18:53:42,945 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884485853] [2022-03-15 18:53:42,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:53:42,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 18:53:42,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:53:43,027 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 18:53:43,028 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 18:53:43,028 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884485853] [2022-03-15 18:53:43,028 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [884485853] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 18:53:43,028 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 18:53:43,028 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-03-15 18:53:43,028 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [910534131] [2022-03-15 18:53:43,028 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 18:53:43,030 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 18:53:43,034 INFO L252 McrAutomatonBuilder]: Finished intersection with 27 states and 41 transitions. [2022-03-15 18:53:43,034 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 18:53:43,385 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [649#(or (<= ~N~0 ~j~0) (< (+ ~j~0 1) ~N~0)), 648#(< ~j~0 ~N~0)] [2022-03-15 18:53:43,386 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-15 18:53:43,386 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 18:53:43,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-15 18:53:43,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-03-15 18:53:43,387 INFO L87 Difference]: Start difference. First operand 45 states and 109 transitions. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 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 18:53:43,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 18:53:43,464 INFO L93 Difference]: Finished difference Result 89 states and 201 transitions. [2022-03-15 18:53:43,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-03-15 18:53:43,465 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 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 13 [2022-03-15 18:53:43,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 18:53:43,465 INFO L225 Difference]: With dead ends: 89 [2022-03-15 18:53:43,466 INFO L226 Difference]: Without dead ends: 83 [2022-03-15 18:53:43,466 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-03-15 18:53:43,467 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 52 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 0 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.1s IncrementalHoareTripleChecker+Time [2022-03-15 18:53:43,467 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [52 Valid, 0 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 18:53:43,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2022-03-15 18:53:43,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 69. [2022-03-15 18:53:43,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 68 states have (on average 2.485294117647059) internal successors, (169), 68 states have internal predecessors, (169), 0 states have call successors, (0), 0 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 18:53:43,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 169 transitions. [2022-03-15 18:53:43,472 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 169 transitions. Word has length 13 [2022-03-15 18:53:43,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 18:53:43,472 INFO L470 AbstractCegarLoop]: Abstraction has 69 states and 169 transitions. [2022-03-15 18:53:43,472 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 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 18:53:43,472 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 169 transitions. [2022-03-15 18:53:43,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-03-15 18:53:43,472 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 18:53:43,473 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 18:53:43,473 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-03-15 18:53:43,473 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 18:53:43,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 18:53:43,473 INFO L85 PathProgramCache]: Analyzing trace with hash -1854786436, now seen corresponding path program 1 times [2022-03-15 18:53:43,474 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 18:53:43,474 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013242423] [2022-03-15 18:53:43,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:53:43,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 18:53:43,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:53:43,542 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 18:53:43,542 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 18:53:43,542 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013242423] [2022-03-15 18:53:43,542 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1013242423] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 18:53:43,542 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 18:53:43,542 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-15 18:53:43,543 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [311269176] [2022-03-15 18:53:43,543 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 18:53:43,544 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 18:53:43,547 INFO L252 McrAutomatonBuilder]: Finished intersection with 23 states and 31 transitions. [2022-03-15 18:53:43,548 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 18:53:43,664 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [884#(or (< ~i~0 ~N~0) (< ~j~0 ~N~0)), 883#(< ~i~0 ~N~0)] [2022-03-15 18:53:43,665 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-15 18:53:43,665 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 18:53:43,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-15 18:53:43,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-03-15 18:53:43,665 INFO L87 Difference]: Start difference. First operand 69 states and 169 transitions. Second operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:53:43,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 18:53:43,782 INFO L93 Difference]: Finished difference Result 91 states and 203 transitions. [2022-03-15 18:53:43,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-15 18:53:43,784 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-03-15 18:53:43,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 18:53:43,786 INFO L225 Difference]: With dead ends: 91 [2022-03-15 18:53:43,787 INFO L226 Difference]: Without dead ends: 73 [2022-03-15 18:53:43,787 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-03-15 18:53:43,789 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 30 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 18:53:43,790 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 0 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 18:53:43,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-03-15 18:53:43,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 55. [2022-03-15 18:53:43,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 54 states have (on average 2.4814814814814814) internal successors, (134), 54 states have internal predecessors, (134), 0 states have call successors, (0), 0 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 18:53:43,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 134 transitions. [2022-03-15 18:53:43,799 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 134 transitions. Word has length 14 [2022-03-15 18:53:43,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 18:53:43,800 INFO L470 AbstractCegarLoop]: Abstraction has 55 states and 134 transitions. [2022-03-15 18:53:43,800 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:53:43,800 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 134 transitions. [2022-03-15 18:53:43,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-03-15 18:53:43,800 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 18:53:43,800 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 18:53:43,800 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-03-15 18:53:43,801 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 18:53:43,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 18:53:43,801 INFO L85 PathProgramCache]: Analyzing trace with hash -1383485876, now seen corresponding path program 2 times [2022-03-15 18:53:43,803 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 18:53:43,803 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544959255] [2022-03-15 18:53:43,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:53:43,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 18:53:43,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:53:43,914 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 18:53:43,914 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 18:53:43,914 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544959255] [2022-03-15 18:53:43,924 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [544959255] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 18:53:43,924 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 18:53:43,925 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-15 18:53:43,925 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1198938112] [2022-03-15 18:53:43,925 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 18:53:43,926 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 18:53:43,931 INFO L252 McrAutomatonBuilder]: Finished intersection with 30 states and 47 transitions. [2022-03-15 18:53:43,932 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 18:53:44,077 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 61 treesize of output 29 [2022-03-15 18:53:44,122 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 12 treesize of output 4 [2022-03-15 18:53:44,128 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-03-15 18:53:44,463 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 7 new interpolants: [1099#(or (not (<= (+ ~bag1~0 ~sum1~0) 2147483647)) (not (<= 0 (+ ~bag1~0 ~sum1~0 2147483648))) (< (+ ~bag2~0 ~sum2~0 2147483648) 0) (< ~i~0 ~N~0) (< ~j~0 ~N~0) (< 2147483647 (+ ~bag2~0 ~sum2~0))), 1098#(or (< (+ ~sum1~0 4294967295) 0) (< 4294967295 ~sum1~0) (< (+ ~i~0 1) ~N~0) (<= ~N~0 ~i~0)), 1100#(or (not (<= (+ ~bag2~0 ~sum2~0) 2147483647)) (< (+ ~sum1~0 4294967295) 0) (not (<= 0 (+ ~bag2~0 ~sum2~0 2147483648))) (< 4294967295 ~sum1~0) (< (+ ~i~0 1) ~N~0) (< ~j~0 ~N~0)), 1097#(or (< (+ ~sum1~0 4294967295) 0) (< 4294967295 ~sum1~0) (< (+ ~i~0 1) ~N~0)), 1096#(or (not (<= (+ ~bag1~0 ~sum1~0) 2147483647)) (not (<= 0 (+ ~bag1~0 ~sum1~0 2147483648))) (< ~i~0 ~N~0)), 1101#(or (not (<= (+ ~bag2~0 ~sum2~0) 2147483647)) (< (+ ~sum1~0 4294967295) 0) (not (<= 0 (+ ~bag2~0 ~sum2~0 2147483648))) (< 4294967295 ~sum1~0) (< (+ ~i~0 1) ~N~0) (< ~j~0 ~N~0) (<= ~N~0 ~i~0)), 1095#(or (not (<= (+ ~bag2~0 ~sum2~0) 2147483647)) (not (<= 0 (+ ~bag2~0 ~sum2~0 2147483648))) (< ~j~0 ~N~0))] [2022-03-15 18:53:44,463 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-03-15 18:53:44,464 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 18:53:44,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-03-15 18:53:44,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2022-03-15 18:53:44,464 INFO L87 Difference]: Start difference. First operand 55 states and 134 transitions. Second operand has 12 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 11 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:53:44,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 18:53:44,739 INFO L93 Difference]: Finished difference Result 85 states and 196 transitions. [2022-03-15 18:53:44,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-03-15 18:53:44,739 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 11 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-03-15 18:53:44,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 18:53:44,740 INFO L225 Difference]: With dead ends: 85 [2022-03-15 18:53:44,740 INFO L226 Difference]: Without dead ends: 78 [2022-03-15 18:53:44,740 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 4 SyntacticMatches, 5 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=227, Unknown=0, NotChecked=0, Total=306 [2022-03-15 18:53:44,741 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 71 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 18:53:44,741 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [71 Valid, 0 Invalid, 267 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 235 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 18:53:44,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-03-15 18:53:44,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 54. [2022-03-15 18:53:44,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 53 states have (on average 2.547169811320755) internal successors, (135), 53 states have internal predecessors, (135), 0 states have call successors, (0), 0 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 18:53:44,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 135 transitions. [2022-03-15 18:53:44,744 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 135 transitions. Word has length 14 [2022-03-15 18:53:44,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 18:53:44,744 INFO L470 AbstractCegarLoop]: Abstraction has 54 states and 135 transitions. [2022-03-15 18:53:44,744 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 11 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:53:44,744 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 135 transitions. [2022-03-15 18:53:44,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-03-15 18:53:44,745 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 18:53:44,745 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 18:53:44,745 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-03-15 18:53:44,745 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 18:53:44,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 18:53:44,745 INFO L85 PathProgramCache]: Analyzing trace with hash -392071956, now seen corresponding path program 1 times [2022-03-15 18:53:44,746 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 18:53:44,746 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203591881] [2022-03-15 18:53:44,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:53:44,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 18:53:44,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:53:44,843 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:53:44,843 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 18:53:44,843 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203591881] [2022-03-15 18:53:44,843 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [203591881] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 18:53:44,843 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [787677436] [2022-03-15 18:53:44,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:53:44,844 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 18:53:44,844 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 18:53:44,846 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 18:53:44,849 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 18:53:44,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:53:44,957 INFO L263 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 10 conjunts are in the unsatisfiable core [2022-03-15 18:53:44,961 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 18:53:45,049 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 18:53:45,049 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 18:53:45,087 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 18:53:45,087 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [787677436] provided 1 perfect and 1 imperfect interpolant sequences [2022-03-15 18:53:45,087 INFO L191 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-03-15 18:53:45,087 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 4] total 10 [2022-03-15 18:53:45,088 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [590803898] [2022-03-15 18:53:45,088 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 18:53:45,090 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 18:53:45,094 INFO L252 McrAutomatonBuilder]: Finished intersection with 28 states and 42 transitions. [2022-03-15 18:53:45,094 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 18:53:45,311 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 18:53:45,311 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-03-15 18:53:45,311 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 18:53:45,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-03-15 18:53:45,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2022-03-15 18:53:45,312 INFO L87 Difference]: Start difference. First operand 54 states and 135 transitions. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 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 18:53:45,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 18:53:45,353 INFO L93 Difference]: Finished difference Result 58 states and 145 transitions. [2022-03-15 18:53:45,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-03-15 18:53:45,353 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 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 14 [2022-03-15 18:53:45,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 18:53:45,354 INFO L225 Difference]: With dead ends: 58 [2022-03-15 18:53:45,354 INFO L226 Difference]: Without dead ends: 58 [2022-03-15 18:53:45,354 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2022-03-15 18:53:45,354 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 23 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 18:53:45,355 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 0 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 18:53:45,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-03-15 18:53:45,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 56. [2022-03-15 18:53:45,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 55 states have (on average 2.5454545454545454) internal successors, (140), 55 states have internal predecessors, (140), 0 states have call successors, (0), 0 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 18:53:45,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 140 transitions. [2022-03-15 18:53:45,365 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 140 transitions. Word has length 14 [2022-03-15 18:53:45,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 18:53:45,365 INFO L470 AbstractCegarLoop]: Abstraction has 56 states and 140 transitions. [2022-03-15 18:53:45,365 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 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 18:53:45,365 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 140 transitions. [2022-03-15 18:53:45,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-03-15 18:53:45,368 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 18:53:45,368 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 18:53:45,399 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 18:53:45,583 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 18:53:45,584 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 18:53:45,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 18:53:45,584 INFO L85 PathProgramCache]: Analyzing trace with hash 537424122, now seen corresponding path program 1 times [2022-03-15 18:53:45,585 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 18:53:45,585 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440857146] [2022-03-15 18:53:45,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:53:45,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 18:53:45,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:53:45,664 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 18:53:45,664 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 18:53:45,664 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440857146] [2022-03-15 18:53:45,665 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [440857146] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 18:53:45,665 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [801982556] [2022-03-15 18:53:45,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:53:45,665 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 18:53:45,665 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 18:53:45,666 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 18:53:45,667 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 18:53:45,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:53:45,791 INFO L263 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 10 conjunts are in the unsatisfiable core [2022-03-15 18:53:45,792 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 18:53:45,847 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 18:53:45,847 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 18:53:45,893 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 18:53:45,893 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [801982556] provided 1 perfect and 1 imperfect interpolant sequences [2022-03-15 18:53:45,893 INFO L191 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-03-15 18:53:45,893 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 4] total 8 [2022-03-15 18:53:45,894 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [63862763] [2022-03-15 18:53:45,894 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 18:53:45,896 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 18:53:45,902 INFO L252 McrAutomatonBuilder]: Finished intersection with 31 states and 48 transitions. [2022-03-15 18:53:45,902 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 18:53:46,173 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 18:53:46,173 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-03-15 18:53:46,173 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 18:53:46,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-03-15 18:53:46,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2022-03-15 18:53:46,174 INFO L87 Difference]: Start difference. First operand 56 states and 140 transitions. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 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 18:53:46,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 18:53:46,216 INFO L93 Difference]: Finished difference Result 52 states and 130 transitions. [2022-03-15 18:53:46,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-03-15 18:53:46,217 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 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 15 [2022-03-15 18:53:46,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 18:53:46,217 INFO L225 Difference]: With dead ends: 52 [2022-03-15 18:53:46,217 INFO L226 Difference]: Without dead ends: 52 [2022-03-15 18:53:46,217 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 36 SyntacticMatches, 4 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-03-15 18:53:46,218 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 50 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 18:53:46,218 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [50 Valid, 0 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 18:53:46,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-03-15 18:53:46,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2022-03-15 18:53:46,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 51 states have (on average 2.549019607843137) internal successors, (130), 51 states have internal predecessors, (130), 0 states have call successors, (0), 0 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 18:53:46,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 130 transitions. [2022-03-15 18:53:46,223 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 130 transitions. Word has length 15 [2022-03-15 18:53:46,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 18:53:46,223 INFO L470 AbstractCegarLoop]: Abstraction has 52 states and 130 transitions. [2022-03-15 18:53:46,223 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 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 18:53:46,223 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 130 transitions. [2022-03-15 18:53:46,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-15 18:53:46,224 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 18:53:46,224 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 18:53:46,252 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 18:53:46,439 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,SelfDestructingSolverStorable5 [2022-03-15 18:53:46,439 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 18:53:46,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 18:53:46,440 INFO L85 PathProgramCache]: Analyzing trace with hash 1236864756, now seen corresponding path program 1 times [2022-03-15 18:53:46,441 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 18:53:46,441 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183035376] [2022-03-15 18:53:46,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:53:46,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 18:53:46,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:53:47,074 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:53:47,074 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 18:53:47,074 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183035376] [2022-03-15 18:53:47,074 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [183035376] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 18:53:47,074 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2109864763] [2022-03-15 18:53:47,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:53:47,074 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 18:53:47,074 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 18:53:47,075 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 18:53:47,099 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 18:53:47,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:53:47,175 INFO L263 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 71 conjunts are in the unsatisfiable core [2022-03-15 18:53:47,178 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 18:53:47,220 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 11 treesize of output 7 [2022-03-15 18:53:47,267 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 18:53:47,411 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 18:53:47,412 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 20 treesize of output 22 [2022-03-15 18:53:47,612 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 179 treesize of output 151 [2022-03-15 18:53:47,694 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:53:47,694 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 18:53:48,319 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 18:53:48,319 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 146 treesize of output 86 [2022-03-15 18:53:48,323 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 370 treesize of output 330 [2022-03-15 18:53:48,333 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 312 treesize of output 288 [2022-03-15 18:53:48,338 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 288 treesize of output 268 [2022-03-15 18:53:48,638 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:53:48,638 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2109864763] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 18:53:48,638 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 18:53:48,638 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 24 [2022-03-15 18:53:48,639 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1535054449] [2022-03-15 18:53:48,639 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 18:53:48,641 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 18:53:48,663 INFO L252 McrAutomatonBuilder]: Finished intersection with 30 states and 44 transitions. [2022-03-15 18:53:48,663 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 18:53:49,880 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 5 new interpolants: [1938#(and (or (not (<= 0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) 2147483648))) (< (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0) (+ ~sum1~0 1)) (<= ~N~0 ~j~0) (< (+ ~j~0 1) ~N~0) (not (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0) 2147483647)) (not (<= 0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 2147483648))) (not (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4)))) 2147483647))) (or (< 2147483647 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))))) (< 2147483647 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0)) (< (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) 2147483648) 0) (<= ~N~0 ~j~0) (< (+ ~j~0 1) ~N~0) (< (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 2147483648) 0) (<= ~sum1~0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0)))), 1936#(and (or (not (<= (+ ~bag1~0 ~sum1~0) 2147483647)) (not (<= 0 (+ ~bag1~0 ~sum1~0 2147483648))) (<= (+ ~j~0 1) ~N~0) (<= (+ ~bag1~0 ~sum1~0) (+ ~bag2~0 ~sum2~0)) (< ~i~0 ~N~0)) (or (not (<= (+ ~bag1~0 ~sum1~0) 2147483647)) (not (<= 0 (+ ~bag1~0 ~sum1~0 2147483648))) (<= (+ ~j~0 1) ~N~0) (< ~i~0 ~N~0) (<= (+ ~bag2~0 ~sum2~0) (+ ~bag1~0 ~sum1~0)))), 1939#(and (or (not (<= (+ ~bag1~0 ~sum1~0) 2147483647)) (not (<= 0 (+ ~bag1~0 ~sum1~0 2147483648))) (<= ~bag2~0 ~sum2~0) (< ~i~0 ~N~0) (not (= (+ ~A~0.offset (* ~j~0 4)) 0))) (or (not (<= (+ ~bag1~0 ~sum1~0) 2147483647)) (not (<= 0 (+ ~bag1~0 ~sum1~0 2147483648))) (= ~sum2~0 0) (< ~i~0 ~N~0) (not (= (+ ~A~0.offset (* ~j~0 4)) 0))) (or (not (<= (+ ~bag1~0 ~sum1~0) 2147483647)) (not (<= 0 (+ ~bag1~0 ~sum1~0 2147483648))) (<= (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0) (+ ~bag1~0 ~sum1~0)) (< ~i~0 ~N~0) (not (= (+ ~A~0.offset (* ~j~0 4)) 0))) (or (not (<= (+ ~bag1~0 ~sum1~0) 2147483647)) (not (<= 0 (+ ~bag1~0 ~sum1~0 2147483648))) (= ~A~0.offset 0) (< ~i~0 ~N~0)) (or (not (<= (+ ~bag1~0 ~sum1~0) 2147483647)) (not (<= 0 (+ ~bag1~0 ~sum1~0 2147483648))) (< ~i~0 ~N~0) (<= ~N~0 1) (<= (+ ~A~0.offset (* ~j~0 4)) 0)) (or (not (<= (+ ~bag1~0 ~sum1~0) 2147483647)) (not (<= 0 (+ ~bag1~0 ~sum1~0 2147483648))) (<= (+ ~bag1~0 ~sum1~0) (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0)) (< ~i~0 ~N~0) (not (= (+ ~A~0.offset (* ~j~0 4)) 0))) (or (not (<= (+ ~bag1~0 ~sum1~0) 2147483647)) (not (<= 0 (+ ~bag1~0 ~sum1~0 2147483648))) (< 0 (+ ~A~0.offset (* ~j~0 4) 1)) (<= 1 ~N~0) (< ~i~0 ~N~0))), 1935#(and (or (not (<= (+ ~bag1~0 ~sum1~0) 2147483647)) (not (<= 0 (+ ~bag1~0 ~sum1~0 2147483648))) (<= (+ ~bag1~0 ~sum1~0) ~sum2~0) (< ~i~0 ~N~0)) (or (not (<= (+ ~bag1~0 ~sum1~0) 2147483647)) (not (<= 0 (+ ~bag1~0 ~sum1~0 2147483648))) (< ~i~0 ~N~0) (< ~sum2~0 (+ ~bag1~0 ~sum1~0 1)))), 1937#(and (or (not (<= (+ ~bag2~0 ~sum2~0) 2147483647)) (not (<= 0 (+ ~bag2~0 ~sum2~0 2147483648))) (< (+ ~bag2~0 ~sum2~0) (+ ~sum1~0 1)) (< ~j~0 ~N~0)) (or (not (<= (+ ~bag2~0 ~sum2~0) 2147483647)) (not (<= 0 (+ ~bag2~0 ~sum2~0 2147483648))) (<= ~sum1~0 (+ ~bag2~0 ~sum2~0)) (< ~j~0 ~N~0)))] [2022-03-15 18:53:49,880 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-03-15 18:53:49,880 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 18:53:49,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-03-15 18:53:49,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=801, Unknown=6, NotChecked=0, Total=930 [2022-03-15 18:53:49,881 INFO L87 Difference]: Start difference. First operand 52 states and 130 transitions. Second operand has 16 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 15 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:53:52,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 18:53:52,983 INFO L93 Difference]: Finished difference Result 266 states and 648 transitions. [2022-03-15 18:53:52,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-03-15 18:53:52,983 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 15 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-03-15 18:53:52,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 18:53:52,985 INFO L225 Difference]: With dead ends: 266 [2022-03-15 18:53:52,985 INFO L226 Difference]: Without dead ends: 256 [2022-03-15 18:53:52,986 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 18 SyntacticMatches, 4 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 716 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=454, Invalid=2732, Unknown=6, NotChecked=0, Total=3192 [2022-03-15 18:53:52,986 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 165 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 602 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 696 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 602 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-15 18:53:52,987 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [165 Valid, 0 Invalid, 696 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 602 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-03-15 18:53:52,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2022-03-15 18:53:52,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 77. [2022-03-15 18:53:52,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 76 states have (on average 2.6315789473684212) internal successors, (200), 76 states have internal predecessors, (200), 0 states have call successors, (0), 0 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 18:53:52,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 200 transitions. [2022-03-15 18:53:52,990 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 200 transitions. Word has length 16 [2022-03-15 18:53:52,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 18:53:52,990 INFO L470 AbstractCegarLoop]: Abstraction has 77 states and 200 transitions. [2022-03-15 18:53:52,990 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 15 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:53:52,990 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 200 transitions. [2022-03-15 18:53:52,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-15 18:53:52,990 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 18:53:52,991 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 18:53:53,015 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 18:53:53,213 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 18:53:53,213 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 18:53:53,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 18:53:53,214 INFO L85 PathProgramCache]: Analyzing trace with hash 379039484, now seen corresponding path program 2 times [2022-03-15 18:53:53,214 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 18:53:53,214 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143569413] [2022-03-15 18:53:53,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:53:53,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 18:53:53,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:53:53,696 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:53:53,696 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 18:53:53,696 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143569413] [2022-03-15 18:53:53,697 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2143569413] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 18:53:53,697 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1133031481] [2022-03-15 18:53:53,697 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 18:53:53,697 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 18:53:53,697 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 18:53:53,698 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 18:53:53,699 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 18:53:53,780 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 18:53:53,780 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 18:53:53,782 INFO L263 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 66 conjunts are in the unsatisfiable core [2022-03-15 18:53:53,784 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 18:53:53,817 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 11 treesize of output 7 [2022-03-15 18:53:53,870 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 18:53:54,028 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 18:53:54,029 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 25 treesize of output 27 [2022-03-15 18:53:54,153 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 189 treesize of output 161 [2022-03-15 18:53:54,233 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:53:54,233 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 18:53:54,488 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_180 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_180) c_~A~0.base) (+ c_~A~0.offset (* c_~j~0 4))))) (or (not (<= (+ c_~bag2~0 .cse0) 2147483647)) (not (<= 0 (+ c_~bag2~0 .cse0 2147483648))) (let ((.cse1 (+ c_~bag2~0 .cse0 c_~sum2~0))) (and (<= .cse1 c_~sum1~0) (<= c_~sum1~0 .cse1)))))) is different from false [2022-03-15 18:53:54,516 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_180 (Array Int Int))) (let ((.cse2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_180) c_~A~0.base) (+ c_~A~0.offset (* c_~j~0 4))))) (or (let ((.cse1 (+ c_~bag2~0 .cse2 c_~sum2~0)) (.cse0 (+ c_~bag1~0 c_~sum1~0))) (and (<= .cse0 .cse1) (<= .cse1 .cse0))) (not (<= (+ c_~bag2~0 .cse2) 2147483647)) (not (<= 0 (+ c_~bag2~0 .cse2 2147483648)))))) is different from false [2022-03-15 18:53:54,541 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_180 (Array Int Int))) (let ((.cse2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_180) c_~A~0.base) (+ c_~A~0.offset (* c_~j~0 4))))) (or (let ((.cse1 (+ c_~bag2~0 .cse2 c_~sum2~0)) (.cse0 (+ c_~bag1~0 c_~sum1~0 (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* c_~i~0 4)))))) (and (<= .cse0 .cse1) (<= .cse1 .cse0))) (not (<= (+ c_~bag2~0 .cse2) 2147483647)) (not (<= 0 (+ c_~bag2~0 .cse2 2147483648)))))) is different from false [2022-03-15 18:53:54,622 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_180 (Array Int Int)) (v_ArrVal_179 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_179))) (let ((.cse1 (select (select (store .cse2 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_180) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (<= .cse0 .cse1) (<= .cse1 .cse0))) (not (<= .cse1 2147483647)) (not (<= 0 (+ .cse1 2147483648))))))) is different from false [2022-03-15 18:53:54,632 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 18:53:54,632 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 144 treesize of output 84 [2022-03-15 18:53:54,636 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 754 treesize of output 674 [2022-03-15 18:53:54,652 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 362 treesize of output 346 [2022-03-15 18:53:54,659 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 346 treesize of output 314 [2022-03-15 18:53:54,766 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-03-15 18:53:54,766 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1133031481] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 18:53:54,766 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 18:53:54,766 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 23 [2022-03-15 18:53:54,766 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1632051917] [2022-03-15 18:53:54,766 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 18:53:54,768 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 18:53:54,772 INFO L252 McrAutomatonBuilder]: Finished intersection with 30 states and 44 transitions. [2022-03-15 18:53:54,772 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 18:53:56,131 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 5 new interpolants: [2529#(and (or (not (<= (+ ~bag1~0 ~sum1~0) 2147483647)) (not (<= 0 (+ ~bag1~0 ~sum1~0 2147483648))) (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0) (+ ~bag1~0 ~sum1~0)) (< ~i~0 ~N~0)) (or (not (<= (+ ~bag1~0 ~sum1~0) 2147483647)) (not (<= 0 (+ ~bag1~0 ~sum1~0 2147483648))) (= ~A~0.offset 0) (< ~i~0 ~N~0)) (or (not (<= (+ ~bag1~0 ~sum1~0) 2147483647)) (not (<= 0 (+ ~bag1~0 ~sum1~0 2147483648))) (<= 0 ~bag2~0) (< ~i~0 ~N~0)) (or (not (<= (+ ~bag1~0 ~sum1~0) 2147483647)) (not (<= 0 (+ ~bag1~0 ~sum1~0 2147483648))) (<= 0 (+ ~bag2~0 ~sum2~0)) (< ~i~0 ~N~0) (<= (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) 1) ~bag2~0) (<= (+ ~bag2~0 1) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))))) (or (not (<= (+ ~bag1~0 ~sum1~0) 2147483647)) (not (<= 0 (+ ~bag1~0 ~sum1~0 2147483648))) (< ~i~0 ~N~0) (<= (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) 1) ~bag2~0) (<= (+ ~bag2~0 1) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4)))) (<= (+ ~bag2~0 ~sum2~0) 0)) (or (not (<= (+ ~bag1~0 ~sum1~0) 2147483647)) (not (<= 0 (+ ~bag1~0 ~sum1~0 2147483648))) (<= (+ ~bag1~0 ~sum1~0) (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0)) (< ~i~0 ~N~0)) (or (not (<= (+ ~bag1~0 ~sum1~0) 2147483647)) (not (<= 0 (+ ~bag1~0 ~sum1~0 2147483648))) (<= ~bag2~0 0) (< ~i~0 ~N~0)) (or (not (<= (+ ~bag1~0 ~sum1~0) 2147483647)) (not (<= 0 (+ ~bag1~0 ~sum1~0 2147483648))) (< ~i~0 ~N~0) (= (+ ~A~0.offset (* ~j~0 4)) 0))), 2530#(and (or (not (<= (+ ~bag2~0 ~sum2~0) 2147483647)) (not (<= 0 (+ ~bag2~0 ~sum2~0 2147483648))) (< (+ ~bag2~0 ~sum2~0) (+ ~sum1~0 1)) (< ~j~0 ~N~0)) (or (not (<= (+ ~bag2~0 ~sum2~0) 2147483647)) (not (<= 0 (+ ~bag2~0 ~sum2~0 2147483648))) (<= ~sum1~0 (+ ~bag2~0 ~sum2~0)) (< ~j~0 ~N~0))), 2527#(and (or (not (<= (+ ~bag1~0 ~sum1~0) 2147483647)) (not (<= 0 (+ ~bag1~0 ~sum1~0 2147483648))) (<= (+ ~bag1~0 ~sum1~0) ~sum2~0) (< ~i~0 ~N~0)) (or (not (<= (+ ~bag1~0 ~sum1~0) 2147483647)) (not (<= 0 (+ ~bag1~0 ~sum1~0 2147483648))) (< ~i~0 ~N~0) (< ~sum2~0 (+ ~bag1~0 ~sum1~0 1)))), 2531#(and (or (not (<= 0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) 2147483648))) (< (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0) (+ ~sum1~0 1)) (<= ~N~0 ~j~0) (< (+ ~j~0 1) ~N~0) (not (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0) 2147483647)) (not (<= 0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 2147483648))) (not (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4)))) 2147483647))) (or (< 2147483647 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))))) (< 2147483647 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0)) (< (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) 2147483648) 0) (<= ~N~0 ~j~0) (< (+ ~j~0 1) ~N~0) (< (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 2147483648) 0) (<= ~sum1~0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0)))), 2528#(and (or (not (<= (+ ~bag1~0 ~sum1~0) 2147483647)) (not (<= 0 (+ ~bag1~0 ~sum1~0 2147483648))) (< ~i~0 ~N~0) (<= (+ ~bag2~0 ~sum2~0) (+ ~bag1~0 ~sum1~0))) (or (not (<= (+ ~bag1~0 ~sum1~0) 2147483647)) (not (<= 0 (+ ~bag1~0 ~sum1~0 2147483648))) (<= (+ ~bag1~0 ~sum1~0) (+ ~bag2~0 ~sum2~0)) (< ~i~0 ~N~0)))] [2022-03-15 18:53:56,131 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-03-15 18:53:56,131 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 18:53:56,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-03-15 18:53:56,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=563, Unknown=4, NotChecked=204, Total=870 [2022-03-15 18:53:56,132 INFO L87 Difference]: Start difference. First operand 77 states and 200 transitions. Second operand has 16 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 15 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:53:59,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 18:53:59,787 INFO L93 Difference]: Finished difference Result 326 states and 853 transitions. [2022-03-15 18:53:59,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2022-03-15 18:53:59,787 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 15 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-03-15 18:53:59,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 18:53:59,789 INFO L225 Difference]: With dead ends: 326 [2022-03-15 18:53:59,789 INFO L226 Difference]: Without dead ends: 321 [2022-03-15 18:53:59,791 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 21 SyntacticMatches, 3 SemanticMatches, 65 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 1014 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=606, Invalid=3312, Unknown=4, NotChecked=500, Total=4422 [2022-03-15 18:53:59,791 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 179 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 661 mSolverCounterSat, 122 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 783 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 122 IncrementalHoareTripleChecker+Valid, 661 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-15 18:53:59,791 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [179 Valid, 0 Invalid, 783 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [122 Valid, 661 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-03-15 18:53:59,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2022-03-15 18:53:59,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 78. [2022-03-15 18:53:59,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 77 states have (on average 2.6103896103896105) internal successors, (201), 77 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 18:53:59,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 201 transitions. [2022-03-15 18:53:59,795 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 201 transitions. Word has length 16 [2022-03-15 18:53:59,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 18:53:59,795 INFO L470 AbstractCegarLoop]: Abstraction has 78 states and 201 transitions. [2022-03-15 18:53:59,795 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 15 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:53:59,795 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 201 transitions. [2022-03-15 18:53:59,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-15 18:53:59,796 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 18:53:59,796 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 18:53:59,819 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-03-15 18:54:00,007 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 18:54:00,007 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 18:54:00,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 18:54:00,008 INFO L85 PathProgramCache]: Analyzing trace with hash -428963974, now seen corresponding path program 3 times [2022-03-15 18:54:00,009 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 18:54:00,009 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929256895] [2022-03-15 18:54:00,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:54:00,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 18:54:00,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:54:00,331 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:54:00,332 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 18:54:00,332 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929256895] [2022-03-15 18:54:00,332 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [929256895] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 18:54:00,332 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2124420124] [2022-03-15 18:54:00,332 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 18:54:00,332 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 18:54:00,332 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 18:54:00,333 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 18:54:00,334 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 18:54:00,407 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-03-15 18:54:00,407 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 18:54:00,408 INFO L263 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 66 conjunts are in the unsatisfiable core [2022-03-15 18:54:00,410 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 18:54:00,445 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 11 treesize of output 7 [2022-03-15 18:54:00,484 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 18:54:00,546 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 18:54:00,693 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 46 treesize of output 22 [2022-03-15 18:54:00,767 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:54:00,768 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 18:54:01,123 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 18:54:01,123 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2124420124] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 18:54:01,123 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 18:54:01,123 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 7] total 21 [2022-03-15 18:54:01,123 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [751075770] [2022-03-15 18:54:01,123 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 18:54:01,125 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 18:54:01,129 INFO L252 McrAutomatonBuilder]: Finished intersection with 35 states and 56 transitions. [2022-03-15 18:54:01,129 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 18:54:02,901 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 4 new interpolants: [3202#(and (or (not (<= 0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) 2147483648))) (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0) (+ ~bag1~0 ~sum1~0)) (<= ~N~0 ~j~0) (not (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4)))) 2147483647))) (or (<= (+ ~bag1~0 ~sum1~0) (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0)) (not (<= 0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) 2147483648))) (<= ~N~0 ~j~0) (not (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4)))) 2147483647)))), 3201#(and (or (not (<= 0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) 2147483648))) (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0) ~sum1~0) (<= ~N~0 ~j~0) (< (+ ~j~0 1) ~N~0) (not (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0) 2147483647)) (not (<= 0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 2147483648))) (not (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4)))) 2147483647))) (or (< 2147483647 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))))) (< 2147483647 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0)) (< (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) 2147483648) 0) (< ~sum1~0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 1)) (<= ~N~0 ~j~0) (< (+ ~j~0 1) ~N~0) (< (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 2147483648) 0))), 3200#(and (or (not (<= (+ ~bag2~0 ~sum2~0) 2147483647)) (< ~sum1~0 (+ ~bag2~0 ~sum2~0 1)) (not (<= 0 (+ ~bag2~0 ~sum2~0 2147483648))) (< ~j~0 ~N~0)) (or (not (<= (+ ~bag2~0 ~sum2~0) 2147483647)) (<= (+ ~bag2~0 ~sum2~0) ~sum1~0) (not (<= 0 (+ ~bag2~0 ~sum2~0 2147483648))) (< ~j~0 ~N~0))), 3203#(and (or (< (+ ~bag1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) 2147483648) 0) (<= ~sum2~0 (+ ~bag1~0 ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (< 2147483647 (+ ~bag1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))) (or (< (+ ~bag1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) 2147483648) 0) (<= (+ ~bag1~0 ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) ~sum2~0) (< 2147483647 (+ ~bag1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))))] [2022-03-15 18:54:02,901 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-03-15 18:54:02,901 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 18:54:02,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-03-15 18:54:02,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=555, Unknown=3, NotChecked=0, Total=650 [2022-03-15 18:54:02,902 INFO L87 Difference]: Start difference. First operand 78 states and 201 transitions. Second operand has 15 states, 14 states have (on average 2.7142857142857144) internal successors, (38), 14 states have internal predecessors, (38), 0 states have call successors, (0), 0 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 18:54:04,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 18:54:04,390 INFO L93 Difference]: Finished difference Result 335 states and 838 transitions. [2022-03-15 18:54:04,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-03-15 18:54:04,391 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.7142857142857144) internal successors, (38), 14 states have internal predecessors, (38), 0 states have call successors, (0), 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 16 [2022-03-15 18:54:04,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 18:54:04,392 INFO L225 Difference]: With dead ends: 335 [2022-03-15 18:54:04,392 INFO L226 Difference]: Without dead ends: 320 [2022-03-15 18:54:04,393 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 31 SyntacticMatches, 2 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 535 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=270, Invalid=1889, Unknown=3, NotChecked=0, Total=2162 [2022-03-15 18:54:04,393 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 164 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 812 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 884 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 812 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-15 18:54:04,393 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [164 Valid, 0 Invalid, 884 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 812 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-03-15 18:54:04,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2022-03-15 18:54:04,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 84. [2022-03-15 18:54:04,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 83 states have (on average 2.6265060240963853) internal successors, (218), 83 states have internal predecessors, (218), 0 states have call successors, (0), 0 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 18:54:04,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 218 transitions. [2022-03-15 18:54:04,397 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 218 transitions. Word has length 16 [2022-03-15 18:54:04,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 18:54:04,397 INFO L470 AbstractCegarLoop]: Abstraction has 84 states and 218 transitions. [2022-03-15 18:54:04,398 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.7142857142857144) internal successors, (38), 14 states have internal predecessors, (38), 0 states have call successors, (0), 0 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 18:54:04,398 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 218 transitions. [2022-03-15 18:54:04,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-15 18:54:04,398 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 18:54:04,398 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 18:54:04,417 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 18:54:04,613 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 18:54:04,613 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 18:54:04,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 18:54:04,614 INFO L85 PathProgramCache]: Analyzing trace with hash 924060741, now seen corresponding path program 1 times [2022-03-15 18:54:04,614 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 18:54:04,614 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507828437] [2022-03-15 18:54:04,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:54:04,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 18:54:04,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:54:04,919 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:54:04,919 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 18:54:04,919 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507828437] [2022-03-15 18:54:04,919 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [507828437] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 18:54:04,919 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2004332528] [2022-03-15 18:54:04,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:54:04,919 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 18:54:04,919 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 18:54:04,920 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 18:54:04,921 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 18:54:05,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:54:05,011 INFO L263 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 68 conjunts are in the unsatisfiable core [2022-03-15 18:54:05,013 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 18:54:05,040 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 11 treesize of output 7 [2022-03-15 18:54:05,073 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 18:54:05,144 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 18:54:05,304 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 35 treesize of output 19 [2022-03-15 18:54:05,359 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:54:05,359 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 18:54:05,726 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 18:54:05,726 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2004332528] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 18:54:05,726 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 18:54:05,726 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 7] total 21 [2022-03-15 18:54:05,726 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [605083553] [2022-03-15 18:54:05,726 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 18:54:05,728 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 18:54:05,732 INFO L252 McrAutomatonBuilder]: Finished intersection with 35 states and 56 transitions. [2022-03-15 18:54:05,732 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 18:54:07,664 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 4 new interpolants: [3862#(and (or (not (<= (+ ~bag2~0 ~sum2~0) 2147483647)) (not (<= 0 (+ ~bag2~0 ~sum2~0 2147483648))) (<= (+ ~bag1~0 ~sum1~0) (+ ~bag2~0 ~sum2~0)) (< ~j~0 ~N~0)) (or (not (<= (+ ~bag2~0 ~sum2~0) 2147483647)) (not (<= 0 (+ ~bag2~0 ~sum2~0 2147483648))) (<= (+ ~bag2~0 ~sum2~0) (+ ~bag1~0 ~sum1~0)) (< ~j~0 ~N~0))), 3861#(and (or (not (<= (+ ~bag2~0 ~sum2~0) 2147483647)) (< ~sum1~0 (+ ~bag2~0 ~sum2~0 1)) (not (<= 0 (+ ~bag2~0 ~sum2~0 2147483648))) (< ~j~0 ~N~0)) (or (not (<= (+ ~bag2~0 ~sum2~0) 2147483647)) (<= (+ ~bag2~0 ~sum2~0) ~sum1~0) (not (<= 0 (+ ~bag2~0 ~sum2~0 2147483648))) (< ~j~0 ~N~0))), 3864#(and (or (<= (+ ~bag1~0 ~sum1~0) (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0)) (not (<= 0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) 2147483648))) (<= ~N~0 ~j~0) (< (+ ~j~0 1) ~N~0) (not (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0) 2147483647)) (not (<= 0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 2147483648))) (not (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4)))) 2147483647))) (or (not (<= 0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) 2147483648))) (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0) (+ ~bag1~0 ~sum1~0)) (<= ~N~0 ~j~0) (< (+ ~j~0 1) ~N~0) (not (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0) 2147483647)) (not (<= 0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 2147483648))) (not (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4)))) 2147483647)))), 3863#(and (or (not (<= 0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) 2147483648))) (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0) ~sum1~0) (<= ~N~0 ~j~0) (< (+ ~j~0 1) ~N~0) (not (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0) 2147483647)) (not (<= 0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 2147483648))) (not (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4)))) 2147483647))) (or (< 2147483647 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))))) (< 2147483647 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0)) (< (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) 2147483648) 0) (< ~sum1~0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 1)) (<= ~N~0 ~j~0) (< (+ ~j~0 1) ~N~0) (< (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 2147483648) 0)))] [2022-03-15 18:54:07,664 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-03-15 18:54:07,664 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 18:54:07,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-03-15 18:54:07,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=558, Unknown=6, NotChecked=0, Total=650 [2022-03-15 18:54:07,665 INFO L87 Difference]: Start difference. First operand 84 states and 218 transitions. Second operand has 14 states, 13 states have (on average 2.923076923076923) internal successors, (38), 13 states have internal predecessors, (38), 0 states have call successors, (0), 0 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 18:54:09,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 18:54:09,143 INFO L93 Difference]: Finished difference Result 314 states and 800 transitions. [2022-03-15 18:54:09,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-03-15 18:54:09,143 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.923076923076923) internal successors, (38), 13 states have internal predecessors, (38), 0 states have call successors, (0), 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 16 [2022-03-15 18:54:09,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 18:54:09,144 INFO L225 Difference]: With dead ends: 314 [2022-03-15 18:54:09,144 INFO L226 Difference]: Without dead ends: 304 [2022-03-15 18:54:09,145 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 30 SyntacticMatches, 2 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 448 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=221, Invalid=1665, Unknown=6, NotChecked=0, Total=1892 [2022-03-15 18:54:09,145 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 161 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 770 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 834 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 770 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-15 18:54:09,145 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [161 Valid, 0 Invalid, 834 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 770 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-15 18:54:09,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2022-03-15 18:54:09,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 90. [2022-03-15 18:54:09,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 89 states have (on average 2.640449438202247) internal successors, (235), 89 states have internal predecessors, (235), 0 states have call successors, (0), 0 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 18:54:09,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 235 transitions. [2022-03-15 18:54:09,150 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 235 transitions. Word has length 16 [2022-03-15 18:54:09,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 18:54:09,150 INFO L470 AbstractCegarLoop]: Abstraction has 90 states and 235 transitions. [2022-03-15 18:54:09,150 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.923076923076923) internal successors, (38), 13 states have internal predecessors, (38), 0 states have call successors, (0), 0 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 18:54:09,150 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 235 transitions. [2022-03-15 18:54:09,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-15 18:54:09,151 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 18:54:09,151 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 18:54:09,182 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 18:54:09,359 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 18:54:09,359 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 18:54:09,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 18:54:09,360 INFO L85 PathProgramCache]: Analyzing trace with hash -299104085, now seen corresponding path program 4 times [2022-03-15 18:54:09,360 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 18:54:09,360 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197551775] [2022-03-15 18:54:09,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:54:09,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 18:54:09,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:54:09,423 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 18:54:09,423 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 18:54:09,423 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197551775] [2022-03-15 18:54:09,423 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1197551775] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 18:54:09,423 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1102909953] [2022-03-15 18:54:09,423 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 18:54:09,424 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 18:54:09,424 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 18:54:09,425 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 18:54:09,443 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 18:54:09,509 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 18:54:09,509 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 18:54:09,510 INFO L263 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 12 conjunts are in the unsatisfiable core [2022-03-15 18:54:09,513 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 18:54:09,657 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 18:54:09,657 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 18:54:09,786 INFO L353 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-03-15 18:54:09,787 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 352 treesize of output 264 [2022-03-15 18:54:09,938 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 18:54:09,938 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1102909953] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 18:54:09,938 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 18:54:09,938 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2022-03-15 18:54:09,938 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [691611978] [2022-03-15 18:54:09,938 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 18:54:09,940 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 18:54:09,945 INFO L252 McrAutomatonBuilder]: Finished intersection with 36 states and 56 transitions. [2022-03-15 18:54:09,945 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 18:54:10,585 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 3 new interpolants: [4505#(or (<= ~N~0 ~j~0) (< (+ ~j~0 1) ~N~0)), 4504#(< ~j~0 ~N~0), 4506#(or (< (+ 2 ~j~0) ~N~0) (<= ~N~0 (+ ~j~0 1)))] [2022-03-15 18:54:10,585 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-03-15 18:54:10,585 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 18:54:10,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-03-15 18:54:10,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2022-03-15 18:54:10,586 INFO L87 Difference]: Start difference. First operand 90 states and 235 transitions. Second operand has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 8 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:54:10,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 18:54:10,688 INFO L93 Difference]: Finished difference Result 136 states and 323 transitions. [2022-03-15 18:54:10,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-03-15 18:54:10,688 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 8 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-03-15 18:54:10,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 18:54:10,689 INFO L225 Difference]: With dead ends: 136 [2022-03-15 18:54:10,689 INFO L226 Difference]: Without dead ends: 126 [2022-03-15 18:54:10,689 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=231, Unknown=0, NotChecked=0, Total=306 [2022-03-15 18:54:10,690 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 74 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 18:54:10,690 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [74 Valid, 0 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 18:54:10,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2022-03-15 18:54:10,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 112. [2022-03-15 18:54:10,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 111 states have (on average 2.5405405405405403) internal successors, (282), 111 states have internal predecessors, (282), 0 states have call successors, (0), 0 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 18:54:10,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 282 transitions. [2022-03-15 18:54:10,692 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 282 transitions. Word has length 17 [2022-03-15 18:54:10,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 18:54:10,692 INFO L470 AbstractCegarLoop]: Abstraction has 112 states and 282 transitions. [2022-03-15 18:54:10,692 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 8 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:54:10,692 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 282 transitions. [2022-03-15 18:54:10,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-15 18:54:10,693 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 18:54:10,693 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 18:54:10,709 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 18:54:10,907 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 18:54:10,907 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 18:54:10,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 18:54:10,908 INFO L85 PathProgramCache]: Analyzing trace with hash -1673346231, now seen corresponding path program 5 times [2022-03-15 18:54:10,908 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 18:54:10,909 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274669121] [2022-03-15 18:54:10,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:54:10,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 18:54:10,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:54:10,962 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 18:54:10,962 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 18:54:10,962 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274669121] [2022-03-15 18:54:10,962 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1274669121] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 18:54:10,962 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1260467455] [2022-03-15 18:54:10,963 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 18:54:10,963 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 18:54:10,963 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 18:54:10,968 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 18:54:10,969 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 18:54:11,046 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 18:54:11,046 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 18:54:11,047 INFO L263 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 12 conjunts are in the unsatisfiable core [2022-03-15 18:54:11,048 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 18:54:11,124 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 18:54:11,124 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 18:54:11,180 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 18:54:11,180 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1260467455] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 18:54:11,180 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 18:54:11,180 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2022-03-15 18:54:11,180 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1544340532] [2022-03-15 18:54:11,180 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 18:54:11,182 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 18:54:11,186 INFO L252 McrAutomatonBuilder]: Finished intersection with 31 states and 45 transitions. [2022-03-15 18:54:11,186 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 18:54:11,354 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 18:54:11,354 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-03-15 18:54:11,354 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 18:54:11,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-03-15 18:54:11,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2022-03-15 18:54:11,355 INFO L87 Difference]: Start difference. First operand 112 states and 282 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:54:11,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 18:54:11,469 INFO L93 Difference]: Finished difference Result 150 states and 370 transitions. [2022-03-15 18:54:11,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-03-15 18:54:11,469 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-03-15 18:54:11,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 18:54:11,470 INFO L225 Difference]: With dead ends: 150 [2022-03-15 18:54:11,470 INFO L226 Difference]: Without dead ends: 150 [2022-03-15 18:54:11,470 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 36 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=211, Unknown=0, NotChecked=0, Total=306 [2022-03-15 18:54:11,470 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 49 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 18:54:11,470 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [49 Valid, 0 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 18:54:11,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2022-03-15 18:54:11,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 130. [2022-03-15 18:54:11,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 129 states have (on average 2.604651162790698) internal successors, (336), 129 states have internal predecessors, (336), 0 states have call successors, (0), 0 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 18:54:11,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 336 transitions. [2022-03-15 18:54:11,477 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 336 transitions. Word has length 17 [2022-03-15 18:54:11,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 18:54:11,477 INFO L470 AbstractCegarLoop]: Abstraction has 130 states and 336 transitions. [2022-03-15 18:54:11,477 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:54:11,477 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 336 transitions. [2022-03-15 18:54:11,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-03-15 18:54:11,477 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 18:54:11,478 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 18:54:11,494 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 18:54:11,685 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,SelfDestructingSolverStorable11 [2022-03-15 18:54:11,685 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 18:54:11,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 18:54:11,686 INFO L85 PathProgramCache]: Analyzing trace with hash -1018018052, now seen corresponding path program 6 times [2022-03-15 18:54:11,699 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 18:54:11,699 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502792754] [2022-03-15 18:54:11,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:54:11,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 18:54:11,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:54:11,744 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 18:54:11,744 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 18:54:11,744 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502792754] [2022-03-15 18:54:11,744 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1502792754] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 18:54:11,744 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1607952761] [2022-03-15 18:54:11,744 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 18:54:11,744 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 18:54:11,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 18:54:11,745 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 18:54:11,746 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 18:54:11,835 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-03-15 18:54:11,835 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 18:54:11,837 INFO L263 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 12 conjunts are in the unsatisfiable core [2022-03-15 18:54:11,843 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 18:54:11,895 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 18:54:11,896 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 18:54:11,939 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 18:54:11,940 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1607952761] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 18:54:11,940 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 18:54:11,940 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2022-03-15 18:54:11,940 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1481425397] [2022-03-15 18:54:11,940 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 18:54:11,942 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 18:54:11,946 INFO L252 McrAutomatonBuilder]: Finished intersection with 32 states and 46 transitions. [2022-03-15 18:54:11,947 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 18:54:12,130 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [5513#(< ~i~0 ~N~0)] [2022-03-15 18:54:12,131 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-03-15 18:54:12,131 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 18:54:12,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-03-15 18:54:12,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2022-03-15 18:54:12,131 INFO L87 Difference]: Start difference. First operand 130 states and 336 transitions. Second operand has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:54:12,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 18:54:12,236 INFO L93 Difference]: Finished difference Result 110 states and 266 transitions. [2022-03-15 18:54:12,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-15 18:54:12,236 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-03-15 18:54:12,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 18:54:12,236 INFO L225 Difference]: With dead ends: 110 [2022-03-15 18:54:12,236 INFO L226 Difference]: Without dead ends: 77 [2022-03-15 18:54:12,237 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2022-03-15 18:54:12,237 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 33 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 18:54:12,237 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [33 Valid, 0 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 18:54:12,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2022-03-15 18:54:12,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2022-03-15 18:54:12,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 76 states have (on average 2.5789473684210527) internal successors, (196), 76 states have internal predecessors, (196), 0 states have call successors, (0), 0 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 18:54:12,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 196 transitions. [2022-03-15 18:54:12,239 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 196 transitions. Word has length 18 [2022-03-15 18:54:12,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 18:54:12,239 INFO L470 AbstractCegarLoop]: Abstraction has 77 states and 196 transitions. [2022-03-15 18:54:12,239 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:54:12,239 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 196 transitions. [2022-03-15 18:54:12,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-03-15 18:54:12,240 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 18:54:12,240 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 18:54:12,256 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 18:54:12,447 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,SelfDestructingSolverStorable12 [2022-03-15 18:54:12,447 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 18:54:12,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 18:54:12,448 INFO L85 PathProgramCache]: Analyzing trace with hash -1707066863, now seen corresponding path program 7 times [2022-03-15 18:54:12,448 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 18:54:12,448 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805767939] [2022-03-15 18:54:12,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:54:12,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 18:54:12,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:54:12,510 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 18:54:12,511 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 18:54:12,511 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1805767939] [2022-03-15 18:54:12,511 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1805767939] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 18:54:12,511 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1194719625] [2022-03-15 18:54:12,511 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 18:54:12,511 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 18:54:12,511 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 18:54:12,512 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 18:54:12,514 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 18:54:12,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:54:12,599 INFO L263 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 12 conjunts are in the unsatisfiable core [2022-03-15 18:54:12,602 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 18:54:12,768 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-03-15 18:54:12,768 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 18:54:12,838 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 260 treesize of output 212 [2022-03-15 18:54:12,946 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-03-15 18:54:12,947 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1194719625] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 18:54:12,947 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 18:54:12,947 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 15 [2022-03-15 18:54:12,947 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [597156839] [2022-03-15 18:54:12,947 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 18:54:12,949 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 18:54:12,955 INFO L252 McrAutomatonBuilder]: Finished intersection with 33 states and 47 transitions. [2022-03-15 18:54:12,955 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 18:54:13,312 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [5865#(or (<= ~N~0 ~j~0) (<= (+ 2 ~j~0) ~N~0))] [2022-03-15 18:54:13,312 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-03-15 18:54:13,312 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 18:54:13,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-03-15 18:54:13,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=177, Unknown=0, NotChecked=0, Total=240 [2022-03-15 18:54:13,313 INFO L87 Difference]: Start difference. First operand 77 states and 196 transitions. Second operand has 8 states, 8 states have (on average 3.25) internal successors, (26), 7 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 18:54:13,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 18:54:13,411 INFO L93 Difference]: Finished difference Result 95 states and 246 transitions. [2022-03-15 18:54:13,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-03-15 18:54:13,411 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 7 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 19 [2022-03-15 18:54:13,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 18:54:13,412 INFO L225 Difference]: With dead ends: 95 [2022-03-15 18:54:13,412 INFO L226 Difference]: Without dead ends: 95 [2022-03-15 18:54:13,412 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 38 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=113, Invalid=267, Unknown=0, NotChecked=0, Total=380 [2022-03-15 18:54:13,413 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 96 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 18:54:13,413 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [96 Valid, 0 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 18:54:13,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2022-03-15 18:54:13,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2022-03-15 18:54:13,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 94 states have (on average 2.617021276595745) internal successors, (246), 94 states have internal predecessors, (246), 0 states have call successors, (0), 0 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 18:54:13,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 246 transitions. [2022-03-15 18:54:13,418 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 246 transitions. Word has length 19 [2022-03-15 18:54:13,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 18:54:13,418 INFO L470 AbstractCegarLoop]: Abstraction has 95 states and 246 transitions. [2022-03-15 18:54:13,418 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 7 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 18:54:13,418 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 246 transitions. [2022-03-15 18:54:13,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-03-15 18:54:13,419 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 18:54:13,419 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 18:54:13,435 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 18:54:13,623 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,SelfDestructingSolverStorable13 [2022-03-15 18:54:13,623 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 18:54:13,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 18:54:13,624 INFO L85 PathProgramCache]: Analyzing trace with hash -1366671058, now seen corresponding path program 8 times [2022-03-15 18:54:13,635 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 18:54:13,635 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436635452] [2022-03-15 18:54:13,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:54:13,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 18:54:13,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:54:14,629 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:54:14,629 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 18:54:14,629 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436635452] [2022-03-15 18:54:14,629 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1436635452] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 18:54:14,629 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [412632373] [2022-03-15 18:54:14,629 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 18:54:14,629 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 18:54:14,629 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 18:54:14,630 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 18:54:14,631 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 18:54:14,721 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 18:54:14,721 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 18:54:14,723 INFO L263 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 83 conjunts are in the unsatisfiable core [2022-03-15 18:54:14,728 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 18:54:14,787 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 13 treesize of output 9 [2022-03-15 18:54:14,830 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 18:54:15,013 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 18:54:15,013 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 33 treesize of output 33 [2022-03-15 18:54:15,268 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 18:54:15,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, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 238 treesize of output 174 [2022-03-15 18:54:15,385 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:54:15,386 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 18:54:16,357 WARN L838 $PredicateComparison]: unable to prove that (and (or (not (<= (+ c_~bag2~0 c_~sum2~0) 2147483647)) (not (<= 0 (+ c_~bag2~0 c_~sum2~0 2147483648))) (forall ((v_ArrVal_414 (Array Int Int))) (let ((.cse5 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_414) c_~A~0.base)) (.cse6 (* c_~j~0 4))) (let ((.cse0 (select .cse5 (+ c_~A~0.offset .cse6)))) (or (< (+ c_~bag2~0 .cse0 2147483648) 0) (< 2147483647 (+ c_~bag2~0 .cse0)) (let ((.cse3 (select .cse5 (+ c_~A~0.offset .cse6 4)))) (let ((.cse1 (let ((.cse4 (+ c_~bag2~0 .cse0 .cse3 c_~sum2~0))) (and (< .cse4 (+ c_~bag1~0 c_~sum1~0 1)) (<= (+ c_~bag1~0 c_~sum1~0) .cse4)))) (.cse2 (+ .cse0 .cse3 2147483648))) (and (or (not (<= 0 (+ c_~bag2~0 .cse0 c_~sum2~0 2147483648))) .cse1 (< .cse2 0) (not (<= (+ c_~bag2~0 .cse0 c_~sum2~0) 2147483647)) (< 2147483647 (+ .cse0 .cse3))) (or (<= c_~bag2~0 .cse3) .cse1 (not (<= 0 .cse2))))))))))) (forall ((v_ArrVal_414 (Array Int Int))) (let ((.cse10 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_414) c_~A~0.base)) (.cse11 (* c_~j~0 4))) (let ((.cse7 (select .cse10 (+ c_~A~0.offset .cse11))) (.cse8 (select .cse10 (+ c_~A~0.offset .cse11 4)))) (or (not (<= 0 (+ c_~bag2~0 .cse7 .cse8 2147483648))) (not (<= (+ c_~bag2~0 .cse7) 2147483647)) (not (<= (+ c_~bag2~0 .cse7 .cse8) 2147483647)) (not (<= 0 (+ c_~bag2~0 .cse7 2147483648))) (let ((.cse9 (+ c_~bag2~0 .cse7 .cse8 c_~sum2~0))) (and (< .cse9 (+ c_~bag1~0 c_~sum1~0 1)) (<= (+ c_~bag1~0 c_~sum1~0) .cse9)))))))) is different from false [2022-03-15 18:54:16,527 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_414 (Array Int Int))) (let ((.cse4 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_414) c_~A~0.base)) (.cse5 (* c_~j~0 4))) (let ((.cse3 (select .cse4 (+ c_~A~0.offset .cse5 4))) (.cse2 (select .cse4 (+ c_~A~0.offset .cse5)))) (or (let ((.cse1 (+ c_~bag2~0 .cse2 .cse3 c_~sum2~0)) (.cse0 (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* c_~i~0 4))))) (and (<= (+ c_~bag1~0 c_~sum1~0 .cse0) .cse1) (< .cse1 (+ c_~bag1~0 c_~sum1~0 .cse0 1)))) (not (<= 0 (+ c_~bag2~0 .cse2 .cse3 2147483648))) (not (<= (+ c_~bag2~0 .cse2) 2147483647)) (not (<= (+ c_~bag2~0 .cse2 .cse3) 2147483647)) (not (<= 0 (+ c_~bag2~0 .cse2 2147483648))))))) (or (not (<= (+ c_~bag2~0 c_~sum2~0) 2147483647)) (not (<= 0 (+ c_~bag2~0 c_~sum2~0 2147483648))) (forall ((v_ArrVal_414 (Array Int Int))) (let ((.cse12 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_414) c_~A~0.base)) (.cse13 (* c_~j~0 4))) (let ((.cse6 (select .cse12 (+ c_~A~0.offset .cse13)))) (or (< (+ c_~bag2~0 .cse6 2147483648) 0) (< 2147483647 (+ c_~bag2~0 .cse6)) (let ((.cse9 (select .cse12 (+ c_~A~0.offset .cse13 4)))) (let ((.cse7 (let ((.cse11 (+ c_~bag2~0 .cse6 .cse9 c_~sum2~0)) (.cse10 (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* c_~i~0 4))))) (and (<= (+ c_~bag1~0 c_~sum1~0 .cse10) .cse11) (< .cse11 (+ c_~bag1~0 c_~sum1~0 .cse10 1))))) (.cse8 (+ .cse6 .cse9 2147483648))) (and (or .cse7 (not (<= 0 (+ c_~bag2~0 .cse6 c_~sum2~0 2147483648))) (< .cse8 0) (not (<= (+ c_~bag2~0 .cse6 c_~sum2~0) 2147483647)) (< 2147483647 (+ .cse6 .cse9))) (or .cse7 (<= c_~bag2~0 .cse9) (not (<= 0 .cse8)))))))))))) is different from false [2022-03-15 18:54:16,868 WARN L838 $PredicateComparison]: unable to prove that (and (or (not (<= (+ c_~bag2~0 c_~sum2~0) 2147483647)) (not (<= 0 (+ c_~bag2~0 c_~sum2~0 2147483648))) (forall ((v_ArrVal_414 (Array Int Int))) (let ((.cse9 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_414) c_~A~0.base)) (.cse10 (* c_~j~0 4))) (let ((.cse0 (select .cse9 (+ c_~A~0.offset .cse10)))) (or (< (+ c_~bag2~0 .cse0 2147483648) 0) (let ((.cse3 (select .cse9 (+ c_~A~0.offset .cse10 4)))) (let ((.cse1 (let ((.cse7 (select |c_#memory_int| c_~A~0.base)) (.cse8 (* c_~i~0 4))) (let ((.cse6 (+ c_~bag2~0 .cse0 .cse3 c_~sum2~0)) (.cse4 (select .cse7 (+ c_~A~0.offset .cse8 4))) (.cse5 (select .cse7 (+ c_~A~0.offset .cse8)))) (and (<= (+ c_~bag1~0 c_~sum1~0 .cse4 .cse5) .cse6) (< .cse6 (+ c_~bag1~0 c_~sum1~0 .cse4 .cse5 1)))))) (.cse2 (+ .cse0 .cse3 2147483648))) (and (or .cse1 (not (<= 0 (+ c_~bag2~0 .cse0 c_~sum2~0 2147483648))) (< .cse2 0) (not (<= (+ c_~bag2~0 .cse0 c_~sum2~0) 2147483647)) (< 2147483647 (+ .cse0 .cse3))) (or .cse1 (<= c_~bag2~0 .cse3) (not (<= 0 .cse2)))))) (< 2147483647 (+ c_~bag2~0 .cse0))))))) (forall ((v_ArrVal_414 (Array Int Int))) (let ((.cse18 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_414) c_~A~0.base)) (.cse19 (* c_~j~0 4))) (let ((.cse12 (select .cse18 (+ c_~A~0.offset .cse19 4))) (.cse11 (select .cse18 (+ c_~A~0.offset .cse19)))) (or (not (<= 0 (+ c_~bag2~0 .cse11 .cse12 2147483648))) (not (<= (+ c_~bag2~0 .cse11) 2147483647)) (not (<= (+ c_~bag2~0 .cse11 .cse12) 2147483647)) (let ((.cse16 (select |c_#memory_int| c_~A~0.base)) (.cse17 (* c_~i~0 4))) (let ((.cse15 (+ c_~bag2~0 .cse11 .cse12 c_~sum2~0)) (.cse13 (select .cse16 (+ c_~A~0.offset .cse17 4))) (.cse14 (select .cse16 (+ c_~A~0.offset .cse17)))) (and (<= (+ c_~bag1~0 c_~sum1~0 .cse13 .cse14) .cse15) (< .cse15 (+ c_~bag1~0 c_~sum1~0 .cse13 .cse14 1))))) (not (<= 0 (+ c_~bag2~0 .cse11 2147483648)))))))) is different from false [2022-03-15 18:54:17,400 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_414 (Array Int Int)) (v_ArrVal_413 (Array Int Int))) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_413))) (let ((.cse6 (+ 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse8 (select (store .cse7 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_414) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse0 (select .cse8 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse1 (select .cse8 .cse6))) (let ((.cse2 (+ .cse0 .cse1))) (or (< (+ .cse0 2147483648) 0) (< (+ .cse0 .cse1 2147483648) 0) (< 2147483647 .cse2) (< 2147483647 .cse0) (let ((.cse5 (select .cse7 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse3 (select .cse5 .cse6)) (.cse4 (select .cse5 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (< .cse2 (+ .cse3 .cse4 1)) (<= (+ .cse3 .cse4) .cse2)))))))))) (forall ((v_ArrVal_414 (Array Int Int)) (v_ArrVal_413 (Array Int Int))) (let ((.cse15 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_413))) (let ((.cse14 (+ 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse17 (select (store .cse15 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_414) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse10 (select .cse17 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse16 (select .cse17 .cse14))) (let ((.cse9 (+ .cse10 .cse16))) (or (not (<= .cse9 2147483647)) (not (<= .cse10 2147483647)) (let ((.cse13 (select .cse15 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse11 (select .cse13 .cse14)) (.cse12 (select .cse13 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (< .cse9 (+ .cse11 .cse12 1)) (<= (+ .cse11 .cse12) .cse9)))) (not (<= 0 (+ .cse10 .cse16 2147483648))) (not (<= 0 (+ .cse10 2147483648)))))))))) is different from false [2022-03-15 18:54:17,422 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 18:54:17,422 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 348 treesize of output 192 [2022-03-15 18:54:17,435 INFO L353 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-03-15 18:54:17,436 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 692 treesize of output 584 [2022-03-15 18:54:17,449 INFO L353 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-03-15 18:54:17,450 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 566 treesize of output 486 [2022-03-15 18:54:17,457 INFO L353 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-03-15 18:54:17,457 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 486 treesize of output 422 [2022-03-15 18:54:17,689 INFO L353 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-03-15 18:54:17,690 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 344 treesize of output 1 [2022-03-15 18:54:17,712 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 6 not checked. [2022-03-15 18:54:17,712 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [412632373] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 18:54:17,713 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 18:54:17,713 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 10] total 33 [2022-03-15 18:54:17,713 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1644722012] [2022-03-15 18:54:17,713 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 18:54:17,715 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 18:54:17,722 INFO L252 McrAutomatonBuilder]: Finished intersection with 39 states and 59 transitions. [2022-03-15 18:54:17,722 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 18:54:20,166 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 7 new interpolants: [6355#(and (or (not (<= 0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) 2147483648))) (< (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0) (+ ~sum1~0 1)) (<= ~N~0 ~j~0) (< (+ ~j~0 1) ~N~0) (not (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0) 2147483647)) (not (<= 0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 2147483648))) (not (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4)))) 2147483647))) (or (< 2147483647 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))))) (< 2147483647 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0)) (< (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) 2147483648) 0) (<= ~N~0 ~j~0) (< (+ ~j~0 1) ~N~0) (< (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 2147483648) 0) (<= ~sum1~0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0)))), 6350#(and (or (not (<= (+ ~bag1~0 ~sum1~0) 2147483647)) (not (<= 0 (+ ~bag1~0 ~sum1~0 2147483648))) (<= (+ ~bag1~0 ~sum1~0) ~sum2~0) (< ~i~0 ~N~0)) (or (not (<= (+ ~bag1~0 ~sum1~0) 2147483647)) (not (<= 0 (+ ~bag1~0 ~sum1~0 2147483648))) (< ~i~0 ~N~0) (< ~sum2~0 (+ ~bag1~0 ~sum1~0 1)))), 6354#(and (or (not (<= (+ ~bag2~0 ~sum2~0) 2147483647)) (not (<= 0 (+ ~bag2~0 ~sum2~0 2147483648))) (< (+ ~bag2~0 ~sum2~0) (+ ~sum1~0 1)) (< ~j~0 ~N~0)) (or (not (<= (+ ~bag2~0 ~sum2~0) 2147483647)) (not (<= 0 (+ ~bag2~0 ~sum2~0 2147483648))) (<= ~sum1~0 (+ ~bag2~0 ~sum2~0)) (< ~j~0 ~N~0))), 6352#(and (or (not (<= (+ ~bag1~0 ~sum1~0) 2147483647)) (not (<= 0 (+ ~bag1~0 ~sum1~0 2147483648))) (<= (* ~N~0 4) (+ 3 ~A~0.offset (* ~j~0 4))) (<= (+ ~A~0.offset (* ~j~0 4)) 4) (< ~i~0 ~N~0)) (or (not (<= (+ ~bag1~0 ~sum1~0) 2147483647)) (not (<= 0 (+ ~bag1~0 ~sum1~0 2147483648))) (= ~A~0.offset 0) (< ~i~0 ~N~0)) (or (not (<= (+ ~bag1~0 ~sum1~0) 2147483647)) (not (<= 0 (+ ~bag1~0 ~sum1~0 2147483648))) (not (<= (+ ~A~0.offset (* ~j~0 4)) 3)) (< ~i~0 ~N~0) (<= 2 ~N~0)) (or (not (<= (+ ~bag1~0 ~sum1~0) 2147483647)) (not (<= 0 (+ ~bag1~0 ~sum1~0 2147483648))) (<= (* ~N~0 4) (+ 3 ~A~0.offset (* ~j~0 4))) (<= (+ ~bag1~0 ~sum1~0) (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0)) (< ~i~0 ~N~0) (not (= 4 (+ ~A~0.offset (* ~j~0 4))))) (or (not (<= (+ ~bag1~0 ~sum1~0) 2147483647)) (not (<= 0 (+ ~bag1~0 ~sum1~0 2147483648))) (<= (* ~N~0 4) (+ 3 ~A~0.offset (* ~j~0 4))) (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0) (+ ~bag1~0 ~sum1~0)) (< ~i~0 ~N~0) (not (= 4 (+ ~A~0.offset (* ~j~0 4)))))), 6356#(and (or (< 2147483647 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))))) (not (<= (+ ~bag2~0 ~sum2~0) 2147483647)) (< (+ 2 ~j~0) ~N~0) (< 2147483647 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)))) (<= ~sum1~0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)))) (<= ~N~0 (+ ~j~0 1)) (not (<= 0 (+ ~bag2~0 ~sum2~0 2147483648))) (< (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)) 2147483648) 0) (< (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) 2147483648) 0) (< (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)) 2147483648) 0) (< 2147483647 (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4))))) (or (< (+ 2 ~j~0) ~N~0) (<= ~N~0 (+ ~j~0 1)) (not (<= 0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) 2147483648))) (not (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4))) 2147483647)) (not (<= 0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)) 2147483648))) (not (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4))) 2147483647)) (not (<= 0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)) 2147483648))) (< (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4))) (+ ~sum1~0 1)) (not (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4)))) 2147483647))) (or (< 2147483647 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))))) (< (+ 2 ~j~0) ~N~0) (< 2147483647 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)))) (<= ~sum1~0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)))) (<= ~N~0 (+ ~j~0 1)) (< (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)) 2147483648) 0) (< (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) 2147483648) 0) (< (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)) 2147483648) 0) (< 2147483647 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4))))) (or (< 2147483647 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))))) (not (<= (+ ~bag2~0 ~sum2~0) 2147483647)) (< (+ 2 ~j~0) ~N~0) (not (<= 0 (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)) 2147483648))) (<= ~N~0 (+ ~j~0 1)) (not (<= 0 (+ ~bag2~0 ~sum2~0 2147483648))) (< (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) 2147483648) 0) (not (<= (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4))) 2147483647)) (not (<= 0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)) 2147483648))) (not (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4))) 2147483647)) (< (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4))) (+ ~sum1~0 1)))), 6353#(and (or (not (<= (+ ~bag1~0 ~sum1~0) 2147483647)) (not (<= 0 (+ ~bag1~0 ~sum1~0 2147483648))) (< ~i~0 ~N~0) (<= (+ ~bag2~0 ~sum2~0) 0)) (or (not (<= (+ ~bag1~0 ~sum1~0) 2147483647)) (not (<= 0 (+ ~bag1~0 ~sum1~0 2147483648))) (<= 0 (+ ~bag2~0 ~sum2~0)) (< ~i~0 ~N~0)) (or (not (<= (+ ~bag1~0 ~sum1~0) 2147483647)) (not (<= 0 (+ ~bag1~0 ~sum1~0 2147483648))) (= ~A~0.offset 0) (< ~i~0 ~N~0)) (or (not (<= (+ ~bag1~0 ~sum1~0) 2147483647)) (not (<= 0 (+ ~bag1~0 ~sum1~0 2147483648))) (< ~i~0 ~N~0) (<= 2 ~N~0)) (or (not (<= (+ ~bag1~0 ~sum1~0) 2147483647)) (not (<= 0 (+ ~bag1~0 ~sum1~0 2147483648))) (<= 0 ~bag2~0) (< ~i~0 ~N~0)) (or (not (<= (+ ~bag1~0 ~sum1~0) 2147483647)) (not (<= 0 (+ ~bag1~0 ~sum1~0 2147483648))) (<= (+ ~bag1~0 ~sum1~0) (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) (select (select |#memory_int| ~A~0.base) 4))) (< ~i~0 ~N~0) (not (= (+ ~A~0.offset (* ~j~0 4)) 0))) (or (not (<= (+ ~bag1~0 ~sum1~0) 2147483647)) (not (<= 0 (+ ~bag1~0 ~sum1~0 2147483648))) (<= 0 ~j~0) (< ~i~0 ~N~0)) (or (not (<= (+ ~bag1~0 ~sum1~0) 2147483647)) (not (<= 0 (+ ~bag1~0 ~sum1~0 2147483648))) (< ~i~0 ~N~0) (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) (select (select |#memory_int| ~A~0.base) 4)) (+ ~bag1~0 ~sum1~0)) (not (= (+ ~A~0.offset (* ~j~0 4)) 0))) (or (not (<= (+ ~bag1~0 ~sum1~0) 2147483647)) (not (<= 0 (+ ~bag1~0 ~sum1~0 2147483648))) (< ~i~0 ~N~0) (<= ~N~0 2)) (or (not (<= (+ ~bag1~0 ~sum1~0) 2147483647)) (not (<= 0 (+ ~bag1~0 ~sum1~0 2147483648))) (<= ~bag2~0 0) (< ~i~0 ~N~0))), 6351#(and (or (not (<= (+ ~bag1~0 ~sum1~0) 2147483647)) (not (<= 0 (+ ~bag1~0 ~sum1~0 2147483648))) (<= (+ ~j~0 1) ~N~0) (<= (+ ~bag1~0 ~sum1~0) (+ ~bag2~0 ~sum2~0)) (< ~i~0 ~N~0)) (or (not (<= (+ ~bag1~0 ~sum1~0) 2147483647)) (not (<= 0 (+ ~bag1~0 ~sum1~0 2147483648))) (<= (+ ~j~0 1) ~N~0) (< ~i~0 ~N~0) (<= (+ ~bag2~0 ~sum2~0) (+ ~bag1~0 ~sum1~0))))] [2022-03-15 18:54:20,167 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-03-15 18:54:20,167 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 18:54:20,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-03-15 18:54:20,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=1274, Unknown=4, NotChecked=300, Total=1722 [2022-03-15 18:54:20,167 INFO L87 Difference]: Start difference. First operand 95 states and 246 transitions. Second operand has 22 states, 21 states have (on average 2.142857142857143) internal successors, (45), 21 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 18:54:29,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 18:54:29,377 INFO L93 Difference]: Finished difference Result 512 states and 1285 transitions. [2022-03-15 18:54:29,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2022-03-15 18:54:29,378 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 2.142857142857143) internal successors, (45), 21 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 20 [2022-03-15 18:54:29,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 18:54:29,379 INFO L225 Difference]: With dead ends: 512 [2022-03-15 18:54:29,380 INFO L226 Difference]: Without dead ends: 502 [2022-03-15 18:54:29,381 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 22 SyntacticMatches, 6 SemanticMatches, 91 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 2138 ImplicationChecksByTransitivity, 9.5s TimeCoverageRelationStatistics Valid=1114, Invalid=6730, Unknown=4, NotChecked=708, Total=8556 [2022-03-15 18:54:29,381 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 288 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 1026 mSolverCounterSat, 172 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 288 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 172 IncrementalHoareTripleChecker+Valid, 1026 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-03-15 18:54:29,381 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [288 Valid, 0 Invalid, 1198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [172 Valid, 1026 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-03-15 18:54:29,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 502 states. [2022-03-15 18:54:29,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 502 to 138. [2022-03-15 18:54:29,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 137 states have (on average 2.6496350364963503) internal successors, (363), 137 states have internal predecessors, (363), 0 states have call successors, (0), 0 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 18:54:29,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 363 transitions. [2022-03-15 18:54:29,386 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 363 transitions. Word has length 20 [2022-03-15 18:54:29,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 18:54:29,386 INFO L470 AbstractCegarLoop]: Abstraction has 138 states and 363 transitions. [2022-03-15 18:54:29,386 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 2.142857142857143) internal successors, (45), 21 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 18:54:29,386 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 363 transitions. [2022-03-15 18:54:29,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-03-15 18:54:29,387 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 18:54:29,387 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 18:54:29,407 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 18:54:29,599 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,SelfDestructingSolverStorable14 [2022-03-15 18:54:29,599 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 18:54:29,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 18:54:29,600 INFO L85 PathProgramCache]: Analyzing trace with hash 2105516582, now seen corresponding path program 9 times [2022-03-15 18:54:29,600 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 18:54:29,600 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880176143] [2022-03-15 18:54:29,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:54:29,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 18:54:29,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:54:30,415 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:54:30,416 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 18:54:30,416 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880176143] [2022-03-15 18:54:30,416 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1880176143] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 18:54:30,416 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1317138420] [2022-03-15 18:54:30,416 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 18:54:30,416 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 18:54:30,416 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 18:54:30,417 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 18:54:30,418 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 18:54:30,520 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-03-15 18:54:30,520 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 18:54:30,522 INFO L263 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 82 conjunts are in the unsatisfiable core [2022-03-15 18:54:30,523 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 18:54:30,868 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 18:54:30,869 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 31 treesize of output 31 [2022-03-15 18:54:31,113 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 18:54:31,114 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 18:54:31,117 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 18:54:31,117 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 234 treesize of output 171 [2022-03-15 18:54:31,242 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:54:31,243 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 18:54:33,198 INFO L353 Elim1Store]: treesize reduction 47, result has 53.0 percent of original size [2022-03-15 18:54:33,199 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 1131 treesize of output 748 [2022-03-15 18:54:33,214 INFO L353 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-03-15 18:54:33,215 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 695 treesize of output 631 [2022-03-15 18:54:33,226 INFO L353 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-03-15 18:54:33,227 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 631 treesize of output 509 [2022-03-15 18:54:34,766 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:54:34,767 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1317138420] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 18:54:34,767 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 18:54:34,767 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 11] total 33 [2022-03-15 18:54:34,767 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [715594579] [2022-03-15 18:54:34,767 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 18:54:34,769 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 18:54:34,776 INFO L252 McrAutomatonBuilder]: Finished intersection with 39 states and 59 transitions. [2022-03-15 18:54:34,776 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 18:54:37,813 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 7 new interpolants: [7399#(and (or (< (+ ~bag1~0 ~sum1~0 2147483648) 0) (<= (+ ~bag1~0 ~sum1~0) (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 (select (select |#memory_int| ~A~0.base) 4))) (< ~i~0 ~N~0) (not (= (+ ~A~0.offset (* ~j~0 4)) 0)) (< 2147483647 (+ ~bag1~0 ~sum1~0))) (or (not (<= (+ ~bag1~0 ~sum1~0) 2147483647)) (not (<= 0 (+ ~bag1~0 ~sum1~0 2147483648))) (= ~A~0.offset 0) (< ~i~0 ~N~0)) (or (< (+ ~bag1~0 ~sum1~0 2147483648) 0) (< ~i~0 ~N~0) (not (= (+ ~A~0.offset (* ~j~0 4)) 0)) (< 2147483647 (+ ~bag1~0 ~sum1~0)) (<= (* ~bag2~0 2) ~sum2~0)) (or (not (<= (+ ~bag1~0 ~sum1~0) 2147483647)) (not (<= 0 (+ ~bag1~0 ~sum1~0 2147483648))) (< ~i~0 ~N~0) (<= 2 ~N~0) (< 0 (+ ~A~0.offset (* ~j~0 4)))) (or (< (+ ~bag1~0 ~sum1~0 2147483648) 0) (<= (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 (select (select |#memory_int| ~A~0.base) 4)) (+ ~bag1~0 ~sum1~0)) (< ~i~0 ~N~0) (not (= (+ ~A~0.offset (* ~j~0 4)) 0)) (< 2147483647 (+ ~bag1~0 ~sum1~0))) (or (not (<= (+ ~bag1~0 ~sum1~0) 2147483647)) (not (<= 0 (+ ~bag1~0 ~sum1~0 2147483648))) (< ~i~0 ~N~0) (<= ~N~0 2) (<= (+ ~A~0.offset (* ~j~0 4)) 0)) (or (< (+ ~bag1~0 ~sum1~0 2147483648) 0) (< ~i~0 ~N~0) (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 (select (select |#memory_int| ~A~0.base) 4)) (+ ~bag1~0 ~sum1~0)) (not (= (+ ~A~0.offset (* ~j~0 4)) 0)) (< 2147483647 (+ ~bag1~0 ~sum1~0))) (or (< (+ ~bag1~0 ~sum1~0 2147483648) 0) (< ~i~0 ~N~0) (not (= (+ ~A~0.offset (* ~j~0 4)) 0)) (< 2147483647 (+ ~bag1~0 ~sum1~0)) (<= ~sum2~0 (* ~bag2~0 2))) (or (< (+ ~bag1~0 ~sum1~0 2147483648) 0) (<= (+ ~bag1~0 ~sum1~0) (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 (select (select |#memory_int| ~A~0.base) 4))) (< ~i~0 ~N~0) (not (= (+ ~A~0.offset (* ~j~0 4)) 0)) (< 2147483647 (+ ~bag1~0 ~sum1~0))) (or (< (+ ~bag1~0 ~sum1~0 2147483648) 0) (< ~i~0 ~N~0) (<= ~N~0 2) (not (= (+ ~A~0.offset (* ~j~0 4)) 0)) (< 2147483647 (+ ~bag1~0 ~sum1~0)))), 7398#(and (or (not (<= (+ ~bag1~0 ~sum1~0) 2147483647)) (not (<= 0 (+ ~bag1~0 ~sum1~0 2147483648))) (<= (* ~N~0 4) (+ 3 ~A~0.offset (* ~j~0 4))) (<= (+ 5 ~A~0.offset (* ~j~0 4)) (* ~N~0 4)) (< ~i~0 ~N~0) (<= 2 ~N~0)) (or (not (<= (+ ~bag1~0 ~sum1~0) 2147483647)) (not (<= 0 (+ ~bag1~0 ~sum1~0 2147483648))) (<= (* ~N~0 4) (+ 3 ~A~0.offset (* ~j~0 4))) (<= (+ 5 ~A~0.offset (* ~j~0 4)) (* ~N~0 4)) (< ~i~0 ~N~0) (<= ~N~0 2)) (or (not (<= (+ ~bag1~0 ~sum1~0) 2147483647)) (not (<= 0 (+ ~bag1~0 ~sum1~0 2147483648))) (= ~A~0.offset 0) (< ~i~0 ~N~0)) (or (not (<= (+ ~bag1~0 ~sum1~0) 2147483647)) (not (<= 0 (+ ~bag1~0 ~sum1~0 2147483648))) (<= (* ~N~0 4) (+ 3 ~A~0.offset (* ~j~0 4))) (<= (+ ~bag1~0 ~sum1~0) (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0)) (<= (+ 5 ~A~0.offset (* ~j~0 4)) (* ~N~0 4)) (< ~i~0 ~N~0)) (or (not (<= (+ ~bag1~0 ~sum1~0) 2147483647)) (not (<= 0 (+ ~bag1~0 ~sum1~0 2147483648))) (<= (* ~N~0 4) (+ 3 ~A~0.offset (* ~j~0 4))) (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0) (+ ~bag1~0 ~sum1~0)) (<= (+ 5 ~A~0.offset (* ~j~0 4)) (* ~N~0 4)) (< ~i~0 ~N~0))), 7400#(and (or (not (<= (+ ~bag2~0 ~sum2~0) 2147483647)) (not (<= 0 (+ ~bag2~0 ~sum2~0 2147483648))) (< (+ ~bag2~0 ~sum2~0) (+ ~sum1~0 1)) (< ~j~0 ~N~0)) (or (not (<= (+ ~bag2~0 ~sum2~0) 2147483647)) (not (<= 0 (+ ~bag2~0 ~sum2~0 2147483648))) (<= ~sum1~0 (+ ~bag2~0 ~sum2~0)) (< ~j~0 ~N~0))), 7402#(and (or (< 2147483647 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))))) (not (<= (+ ~bag2~0 ~sum2~0) 2147483647)) (< (+ 2 ~j~0) ~N~0) (< 2147483647 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)))) (<= ~sum1~0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)))) (<= ~N~0 (+ ~j~0 1)) (not (<= 0 (+ ~bag2~0 ~sum2~0 2147483648))) (< (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)) 2147483648) 0) (< (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) 2147483648) 0) (< (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)) 2147483648) 0) (< 2147483647 (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4))))) (or (< (+ 2 ~j~0) ~N~0) (<= ~N~0 (+ ~j~0 1)) (not (<= 0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) 2147483648))) (not (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4))) 2147483647)) (not (<= 0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)) 2147483648))) (not (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4))) 2147483647)) (not (<= 0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)) 2147483648))) (< (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4))) (+ ~sum1~0 1)) (not (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4)))) 2147483647))) (or (< 2147483647 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))))) (< (+ 2 ~j~0) ~N~0) (< 2147483647 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)))) (<= ~sum1~0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)))) (<= ~N~0 (+ ~j~0 1)) (< (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)) 2147483648) 0) (< (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) 2147483648) 0) (< (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)) 2147483648) 0) (< 2147483647 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4))))) (or (< 2147483647 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))))) (not (<= (+ ~bag2~0 ~sum2~0) 2147483647)) (< (+ 2 ~j~0) ~N~0) (not (<= 0 (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)) 2147483648))) (<= ~N~0 (+ ~j~0 1)) (not (<= 0 (+ ~bag2~0 ~sum2~0 2147483648))) (< (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) 2147483648) 0) (not (<= (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4))) 2147483647)) (not (<= 0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)) 2147483648))) (not (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4))) 2147483647)) (< (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4))) (+ ~sum1~0 1)))), 7401#(and (or (not (<= 0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) 2147483648))) (< (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0) (+ ~sum1~0 1)) (<= ~N~0 ~j~0) (< (+ ~j~0 1) ~N~0) (not (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0) 2147483647)) (not (<= 0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 2147483648))) (not (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4)))) 2147483647))) (or (< 2147483647 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))))) (< 2147483647 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0)) (< (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) 2147483648) 0) (<= ~N~0 ~j~0) (< (+ ~j~0 1) ~N~0) (< (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 2147483648) 0) (<= ~sum1~0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0)))), 7397#(and (or (not (<= (+ ~bag1~0 ~sum1~0) 2147483647)) (not (<= 0 (+ ~bag1~0 ~sum1~0 2147483648))) (<= (+ ~j~0 1) ~N~0) (<= (+ ~bag1~0 ~sum1~0) (+ ~bag2~0 ~sum2~0)) (< ~i~0 ~N~0)) (or (not (<= (+ ~bag1~0 ~sum1~0) 2147483647)) (not (<= 0 (+ ~bag1~0 ~sum1~0 2147483648))) (<= (+ ~j~0 1) ~N~0) (< ~i~0 ~N~0) (<= (+ ~bag2~0 ~sum2~0) (+ ~bag1~0 ~sum1~0)))), 7396#(and (or (not (<= (+ ~bag1~0 ~sum1~0) 2147483647)) (not (<= 0 (+ ~bag1~0 ~sum1~0 2147483648))) (<= (+ ~bag1~0 ~sum1~0) ~sum2~0) (< ~i~0 ~N~0)) (or (not (<= (+ ~bag1~0 ~sum1~0) 2147483647)) (not (<= 0 (+ ~bag1~0 ~sum1~0 2147483648))) (< ~i~0 ~N~0) (< ~sum2~0 (+ ~bag1~0 ~sum1~0 1))))] [2022-03-15 18:54:37,814 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-03-15 18:54:37,814 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 18:54:37,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-03-15 18:54:37,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=206, Invalid=1513, Unknown=3, NotChecked=0, Total=1722 [2022-03-15 18:54:37,814 INFO L87 Difference]: Start difference. First operand 138 states and 363 transitions. Second operand has 22 states, 21 states have (on average 2.142857142857143) internal successors, (45), 21 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 18:54:46,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 18:54:46,358 INFO L93 Difference]: Finished difference Result 561 states and 1442 transitions. [2022-03-15 18:54:46,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2022-03-15 18:54:46,358 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 2.142857142857143) internal successors, (45), 21 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 20 [2022-03-15 18:54:46,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 18:54:46,360 INFO L225 Difference]: With dead ends: 561 [2022-03-15 18:54:46,360 INFO L226 Difference]: Without dead ends: 551 [2022-03-15 18:54:46,361 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 23 SyntacticMatches, 6 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2076 ImplicationChecksByTransitivity, 9.3s TimeCoverageRelationStatistics Valid=990, Invalid=6663, Unknown=3, NotChecked=0, Total=7656 [2022-03-15 18:54:46,362 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 273 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 915 mSolverCounterSat, 180 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 273 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1095 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 180 IncrementalHoareTripleChecker+Valid, 915 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-03-15 18:54:46,362 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [273 Valid, 0 Invalid, 1095 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [180 Valid, 915 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-03-15 18:54:46,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 551 states. [2022-03-15 18:54:46,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 551 to 149. [2022-03-15 18:54:46,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 148 states have (on average 2.6486486486486487) internal successors, (392), 148 states have internal predecessors, (392), 0 states have call successors, (0), 0 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 18:54:46,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 392 transitions. [2022-03-15 18:54:46,367 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 392 transitions. Word has length 20 [2022-03-15 18:54:46,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 18:54:46,367 INFO L470 AbstractCegarLoop]: Abstraction has 149 states and 392 transitions. [2022-03-15 18:54:46,367 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 2.142857142857143) internal successors, (45), 21 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 18:54:46,367 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 392 transitions. [2022-03-15 18:54:46,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-03-15 18:54:46,367 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 18:54:46,367 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 18:54:46,384 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 18:54:46,580 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-03-15 18:54:46,581 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 18:54:46,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 18:54:46,581 INFO L85 PathProgramCache]: Analyzing trace with hash -245138540, now seen corresponding path program 10 times [2022-03-15 18:54:46,582 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 18:54:46,582 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038574710] [2022-03-15 18:54:46,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:54:46,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 18:54:46,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:54:48,807 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:54:48,807 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 18:54:48,807 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038574710] [2022-03-15 18:54:48,807 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1038574710] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 18:54:48,807 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1002170888] [2022-03-15 18:54:48,807 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 18:54:48,807 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 18:54:48,808 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 18:54:48,808 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 18:54:48,842 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 18:54:48,906 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 18:54:48,906 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 18:54:48,908 INFO L263 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 90 conjunts are in the unsatisfiable core [2022-03-15 18:54:48,909 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 18:54:49,170 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 18:54:49,171 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 21 treesize of output 23 [2022-03-15 18:54:49,502 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 18:54:49,503 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 232 treesize of output 168 [2022-03-15 18:54:49,611 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:54:49,611 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 18:54:51,338 INFO L353 Elim1Store]: treesize reduction 94, result has 8.7 percent of original size [2022-03-15 18:54:51,338 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 374 treesize of output 248 [2022-03-15 18:54:51,350 INFO L353 Elim1Store]: treesize reduction 49, result has 7.5 percent of original size [2022-03-15 18:54:51,350 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 232 treesize of output 158 [2022-03-15 18:54:51,486 INFO L353 Elim1Store]: treesize reduction 102, result has 1.0 percent of original size [2022-03-15 18:54:51,487 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 733 treesize of output 1 [2022-03-15 18:54:51,665 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:54:51,665 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1002170888] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 18:54:51,665 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 18:54:51,666 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 12] total 34 [2022-03-15 18:54:51,666 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2586544] [2022-03-15 18:54:51,666 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 18:54:51,668 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 18:54:51,676 INFO L252 McrAutomatonBuilder]: Finished intersection with 46 states and 76 transitions. [2022-03-15 18:54:51,676 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 18:54:55,219 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 9 new interpolants: [8511#(and (or (not (<= (+ ~bag1~0 ~sum1~0) 2147483647)) (not (<= 0 (+ ~bag1~0 ~sum1~0 2147483648))) (<= (+ ~j~0 1) ~N~0) (<= (+ ~bag1~0 ~sum1~0) (+ ~bag2~0 ~sum2~0)) (< ~i~0 ~N~0)) (or (not (<= (+ ~bag1~0 ~sum1~0) 2147483647)) (not (<= 0 (+ ~bag1~0 ~sum1~0 2147483648))) (<= (+ ~j~0 1) ~N~0) (< ~i~0 ~N~0) (<= (+ ~bag2~0 ~sum2~0) (+ ~bag1~0 ~sum1~0)))), 8504#(and (or (not (<= (+ ~bag2~0 ~sum2~0) 2147483647)) (not (<= 0 (+ ~bag2~0 ~sum2~0 2147483648))) (< (+ ~bag2~0 ~sum2~0) (+ ~sum1~0 1)) (< ~j~0 ~N~0)) (or (not (<= (+ ~bag2~0 ~sum2~0) 2147483647)) (not (<= 0 (+ ~bag2~0 ~sum2~0 2147483648))) (<= ~sum1~0 (+ ~bag2~0 ~sum2~0)) (< ~j~0 ~N~0))), 8512#(and (or (< (+ ~bag1~0 ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) 2147483648) 0) (<= (+ ~bag2~0 ~sum2~0) (+ ~bag1~0 ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (<= (+ ~j~0 1) ~N~0) (< (+ ~bag1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) 2147483648) 0) (< (+ ~i~0 1) ~N~0) (< 2147483647 (+ ~bag1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (< 2147483647 (+ ~bag1~0 ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))) (or (< (+ ~bag1~0 ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) 2147483648) 0) (<= (+ ~j~0 1) ~N~0) (< (+ ~bag1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) 2147483648) 0) (<= (+ ~bag1~0 ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (+ ~bag2~0 ~sum2~0)) (< (+ ~i~0 1) ~N~0) (< 2147483647 (+ ~bag1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (< 2147483647 (+ ~bag1~0 ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))))), 8508#(and (or (<= (* ~N~0 4) (+ 7 ~A~0.offset (* ~j~0 4))) (not (<= 0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) 2147483648))) (<= ~N~0 ~j~0) (<= (+ ~bag1~0 ~sum1~0) (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)))) (not (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4)))) 2147483647)) (<= (+ 9 ~A~0.offset (* ~j~0 4)) (* ~N~0 4))) (or (= ~A~0.offset 0) (not (<= 0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) 2147483648))) (<= ~N~0 ~j~0) (not (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4)))) 2147483647))) (or (<= (* ~N~0 4) (+ 7 ~A~0.offset (* ~j~0 4))) (not (<= 0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) 2147483648))) (<= ~N~0 ~j~0) (not (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4)))) 2147483647)) (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4))) (+ ~bag1~0 ~sum1~0)) (<= (+ 9 ~A~0.offset (* ~j~0 4)) (* ~N~0 4)))), 8506#(and (or (< 2147483647 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))))) (not (<= (+ ~bag2~0 ~sum2~0) 2147483647)) (< (+ 2 ~j~0) ~N~0) (< 2147483647 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)))) (<= ~sum1~0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)))) (<= ~N~0 (+ ~j~0 1)) (not (<= 0 (+ ~bag2~0 ~sum2~0 2147483648))) (< (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)) 2147483648) 0) (< (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) 2147483648) 0) (< (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)) 2147483648) 0) (< 2147483647 (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4))))) (or (< (+ 2 ~j~0) ~N~0) (<= ~N~0 (+ ~j~0 1)) (not (<= 0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) 2147483648))) (not (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4))) 2147483647)) (not (<= 0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)) 2147483648))) (not (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4))) 2147483647)) (not (<= 0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)) 2147483648))) (< (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4))) (+ ~sum1~0 1)) (not (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4)))) 2147483647))) (or (< 2147483647 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))))) (< (+ 2 ~j~0) ~N~0) (< 2147483647 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)))) (<= ~sum1~0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)))) (<= ~N~0 (+ ~j~0 1)) (< (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)) 2147483648) 0) (< (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) 2147483648) 0) (< (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)) 2147483648) 0) (< 2147483647 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4))))) (or (< 2147483647 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))))) (not (<= (+ ~bag2~0 ~sum2~0) 2147483647)) (< (+ 2 ~j~0) ~N~0) (not (<= 0 (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)) 2147483648))) (<= ~N~0 (+ ~j~0 1)) (not (<= 0 (+ ~bag2~0 ~sum2~0 2147483648))) (< (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) 2147483648) 0) (not (<= (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4))) 2147483647)) (not (<= 0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)) 2147483648))) (not (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4))) 2147483647)) (< (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4))) (+ ~sum1~0 1)))), 8507#(and (or (<= ~sum1~0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)))) (<= (* ~N~0 4) (+ 7 ~A~0.offset (* ~j~0 4))) (not (<= 0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) 2147483648))) (<= ~N~0 ~j~0) (not (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4)))) 2147483647)) (<= (+ 9 ~A~0.offset (* ~j~0 4)) (* ~N~0 4))) (or (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4))) ~sum1~0) (<= (* ~N~0 4) (+ 7 ~A~0.offset (* ~j~0 4))) (not (<= 0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) 2147483648))) (<= ~N~0 ~j~0) (not (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4)))) 2147483647)) (<= (+ 9 ~A~0.offset (* ~j~0 4)) (* ~N~0 4))) (or (= ~A~0.offset 0) (not (<= 0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) 2147483648))) (<= ~N~0 ~j~0) (not (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4)))) 2147483647)))), 8510#(and (or (< (+ ~bag1~0 ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) 2147483648) 0) (< (+ ~bag1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) 2147483648) 0) (< (+ ~i~0 1) ~N~0) (< ~sum2~0 (+ ~bag1~0 ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) 1)) (< 2147483647 (+ ~bag1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (< 2147483647 (+ ~bag1~0 ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))) (or (< (+ ~bag1~0 ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) 2147483648) 0) (< (+ ~bag1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) 2147483648) 0) (<= (+ ~bag1~0 ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) ~sum2~0) (< (+ ~i~0 1) ~N~0) (< 2147483647 (+ ~bag1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (< 2147483647 (+ ~bag1~0 ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))))), 8509#(and (or (not (<= (+ ~bag1~0 ~sum1~0) 2147483647)) (not (<= 0 (+ ~bag1~0 ~sum1~0 2147483648))) (<= (+ ~bag1~0 ~sum1~0) ~sum2~0) (< ~i~0 ~N~0)) (or (not (<= (+ ~bag1~0 ~sum1~0) 2147483647)) (not (<= 0 (+ ~bag1~0 ~sum1~0 2147483648))) (< ~i~0 ~N~0) (< ~sum2~0 (+ ~bag1~0 ~sum1~0 1)))), 8505#(and (or (not (<= 0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) 2147483648))) (< (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0) (+ ~sum1~0 1)) (<= ~N~0 ~j~0) (< (+ ~j~0 1) ~N~0) (not (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0) 2147483647)) (not (<= 0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 2147483648))) (not (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4)))) 2147483647))) (or (< 2147483647 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))))) (< 2147483647 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0)) (< (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) 2147483648) 0) (<= ~N~0 ~j~0) (< (+ ~j~0 1) ~N~0) (< (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 2147483648) 0) (<= ~sum1~0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0))))] [2022-03-15 18:54:55,220 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-03-15 18:54:55,220 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 18:54:55,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-03-15 18:54:55,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=271, Invalid=1707, Unknown=2, NotChecked=0, Total=1980 [2022-03-15 18:54:55,221 INFO L87 Difference]: Start difference. First operand 149 states and 392 transitions. Second operand has 24 states, 23 states have (on average 2.347826086956522) internal successors, (54), 23 states have internal predecessors, (54), 0 states have call successors, (0), 0 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 18:55:11,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 18:55:11,205 INFO L93 Difference]: Finished difference Result 770 states and 1977 transitions. [2022-03-15 18:55:11,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2022-03-15 18:55:11,205 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 2.347826086956522) internal successors, (54), 23 states have internal predecessors, (54), 0 states have call successors, (0), 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 20 [2022-03-15 18:55:11,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 18:55:11,208 INFO L225 Difference]: With dead ends: 770 [2022-03-15 18:55:11,208 INFO L226 Difference]: Without dead ends: 740 [2022-03-15 18:55:11,211 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 25 SyntacticMatches, 8 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6736 ImplicationChecksByTransitivity, 15.5s TimeCoverageRelationStatistics Valid=2846, Invalid=17744, Unknown=2, NotChecked=0, Total=20592 [2022-03-15 18:55:11,212 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 368 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 2347 mSolverCounterSat, 264 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 368 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2611 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 264 IncrementalHoareTripleChecker+Valid, 2347 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-03-15 18:55:11,212 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [368 Valid, 0 Invalid, 2611 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [264 Valid, 2347 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-03-15 18:55:11,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 740 states. [2022-03-15 18:55:11,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 740 to 158. [2022-03-15 18:55:11,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 157 states have (on average 2.656050955414013) internal successors, (417), 157 states have internal predecessors, (417), 0 states have call successors, (0), 0 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 18:55:11,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 417 transitions. [2022-03-15 18:55:11,219 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 417 transitions. Word has length 20 [2022-03-15 18:55:11,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 18:55:11,219 INFO L470 AbstractCegarLoop]: Abstraction has 158 states and 417 transitions. [2022-03-15 18:55:11,219 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 2.347826086956522) internal successors, (54), 23 states have internal predecessors, (54), 0 states have call successors, (0), 0 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 18:55:11,219 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 417 transitions. [2022-03-15 18:55:11,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-03-15 18:55:11,220 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 18:55:11,220 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 18:55:11,239 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 18:55:11,435 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,SelfDestructingSolverStorable16 [2022-03-15 18:55:11,435 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 18:55:11,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 18:55:11,436 INFO L85 PathProgramCache]: Analyzing trace with hash 990763809, now seen corresponding path program 1 times [2022-03-15 18:55:11,436 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 18:55:11,437 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554919719] [2022-03-15 18:55:11,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:55:11,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 18:55:11,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:55:12,002 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:55:12,003 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 18:55:12,003 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554919719] [2022-03-15 18:55:12,003 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [554919719] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 18:55:12,003 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [325132296] [2022-03-15 18:55:12,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:55:12,013 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 18:55:12,013 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 18:55:12,014 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 18:55:12,015 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 18:55:12,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:55:12,113 INFO L263 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 98 conjunts are in the unsatisfiable core [2022-03-15 18:55:12,115 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 18:55:12,448 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 18:55:12,449 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 50 treesize of output 48 [2022-03-15 18:55:12,784 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 18:55:12,784 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 94 treesize of output 54 [2022-03-15 18:55:12,961 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:55:12,961 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 18:55:14,807 INFO L353 Elim1Store]: treesize reduction 64, result has 37.9 percent of original size [2022-03-15 18:55:14,808 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 1135 treesize of output 770 [2022-03-15 18:55:14,826 INFO L353 Elim1Store]: treesize reduction 41, result has 22.6 percent of original size [2022-03-15 18:55:14,827 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 728 treesize of output 591 [2022-03-15 18:55:14,844 INFO L353 Elim1Store]: treesize reduction 41, result has 22.6 percent of original size [2022-03-15 18:55:14,844 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 578 treesize of output 513 [2022-03-15 18:55:18,609 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:55:18,609 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [325132296] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 18:55:18,609 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 18:55:18,610 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 38 [2022-03-15 18:55:18,610 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [834319107] [2022-03-15 18:55:18,610 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 18:55:18,613 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 18:55:18,622 INFO L252 McrAutomatonBuilder]: Finished intersection with 46 states and 76 transitions. [2022-03-15 18:55:18,622 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 18:55:23,193 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 6 new interpolants: [9952#(and (or (not (<= 0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) 2147483648))) (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0) ~sum1~0) (<= ~N~0 ~j~0) (< (+ ~j~0 1) ~N~0) (not (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0) 2147483647)) (not (<= 0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 2147483648))) (not (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4)))) 2147483647))) (or (< 2147483647 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))))) (< 2147483647 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0)) (< (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) 2147483648) 0) (< ~sum1~0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 1)) (<= ~N~0 ~j~0) (< (+ ~j~0 1) ~N~0) (< (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 2147483648) 0))), 9951#(and (or (not (<= (+ ~bag2~0 ~sum2~0) 2147483647)) (< ~sum1~0 (+ ~bag2~0 ~sum2~0 1)) (not (<= 0 (+ ~bag2~0 ~sum2~0 2147483648))) (< ~j~0 ~N~0)) (or (not (<= (+ ~bag2~0 ~sum2~0) 2147483647)) (<= (+ ~bag2~0 ~sum2~0) ~sum1~0) (not (<= 0 (+ ~bag2~0 ~sum2~0 2147483648))) (< ~j~0 ~N~0))), 9956#(and (or (<= ~N~0 (+ ~j~0 1)) (not (<= 0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) 2147483648))) (not (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4))) 2147483647)) (<= (+ ~bag1~0 ~sum1~0) (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)))) (not (<= 0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)) 2147483648))) (not (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4)))) 2147483647))) (or (<= ~N~0 (+ ~j~0 1)) (not (<= 0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) 2147483648))) (not (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4))) 2147483647)) (not (<= 0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)) 2147483648))) (not (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4)))) 2147483647)) (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4))) (+ ~bag1~0 ~sum1~0))) (or (< 2147483647 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))))) (not (<= (+ ~bag2~0 ~sum2~0) 2147483647)) (not (<= 0 (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)) 2147483648))) (<= ~N~0 (+ ~j~0 1)) (not (<= 0 (+ ~bag2~0 ~sum2~0 2147483648))) (< (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) 2147483648) 0) (not (<= (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4))) 2147483647)) (<= (+ ~bag1~0 ~sum1~0) (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4))))) (or (< 2147483647 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))))) (not (<= (+ ~bag2~0 ~sum2~0) 2147483647)) (not (<= 0 (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)) 2147483648))) (<= ~N~0 (+ ~j~0 1)) (not (<= 0 (+ ~bag2~0 ~sum2~0 2147483648))) (< (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) 2147483648) 0) (not (<= (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4))) 2147483647)) (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4))) (+ ~bag1~0 ~sum1~0)))), 9953#(and (or (< 2147483647 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))))) (< (+ 2 ~j~0) ~N~0) (< 2147483647 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)))) (<= ~N~0 (+ ~j~0 1)) (< (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)) 2147483648) 0) (< (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) 2147483648) 0) (< (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)) 2147483648) 0) (< ~sum1~0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)) 1)) (< (+ ~bag2~0 ~sum2~0 2147483648) 0) (< 2147483647 (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)))) (< 2147483647 (+ ~bag2~0 ~sum2~0))) (or (< 2147483647 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))))) (not (<= (+ ~bag2~0 ~sum2~0) 2147483647)) (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4))) ~sum1~0) (< (+ 2 ~j~0) ~N~0) (not (<= 0 (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)) 2147483648))) (<= ~N~0 (+ ~j~0 1)) (not (<= 0 (+ ~bag2~0 ~sum2~0 2147483648))) (< (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) 2147483648) 0) (not (<= (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4))) 2147483647)) (not (<= 0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)) 2147483648))) (not (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4))) 2147483647))) (or (< (+ 2 ~j~0) ~N~0) (< 2147483647 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)))) (<= ~N~0 (+ ~j~0 1)) (not (<= 0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) 2147483648))) (< (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)) 2147483648) 0) (< ~sum1~0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)) 1)) (< (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)) 2147483648) 0) (< 2147483647 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)))) (not (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4)))) 2147483647))) (or (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4))) ~sum1~0) (< (+ 2 ~j~0) ~N~0) (<= ~N~0 (+ ~j~0 1)) (not (<= 0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) 2147483648))) (not (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4))) 2147483647)) (not (<= 0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)) 2147483648))) (not (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4))) 2147483647)) (not (<= 0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)) 2147483648))) (not (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4)))) 2147483647)))), 9955#(and (or (not (<= 0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) 2147483648))) (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0) (+ ~bag1~0 ~sum1~0)) (<= ~N~0 ~j~0) (not (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4)))) 2147483647))) (or (<= (+ ~bag1~0 ~sum1~0) (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0)) (not (<= 0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) 2147483648))) (<= ~N~0 ~j~0) (not (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4)))) 2147483647)))), 9954#(and (or (< (+ ~bag1~0 ~sum1~0 2147483648) 0) (<= ~sum2~0 (+ ~bag1~0 ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (< 2147483647 (+ ~bag1~0 ~sum1~0))) (or (< (+ ~bag1~0 ~sum1~0 2147483648) 0) (<= (+ ~bag1~0 ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) ~sum2~0) (< 2147483647 (+ ~bag1~0 ~sum1~0))))] [2022-03-15 18:55:23,194 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-03-15 18:55:23,194 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 18:55:23,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-03-15 18:55:23,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=211, Invalid=1855, Unknown=4, NotChecked=0, Total=2070 [2022-03-15 18:55:23,195 INFO L87 Difference]: Start difference. First operand 158 states and 417 transitions. Second operand has 21 states, 20 states have (on average 2.55) internal successors, (51), 20 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 18:55:42,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 18:55:42,184 INFO L93 Difference]: Finished difference Result 789 states and 2120 transitions. [2022-03-15 18:55:42,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2022-03-15 18:55:42,185 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 2.55) internal successors, (51), 20 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 20 [2022-03-15 18:55:42,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 18:55:42,188 INFO L225 Difference]: With dead ends: 789 [2022-03-15 18:55:42,188 INFO L226 Difference]: Without dead ends: 769 [2022-03-15 18:55:42,189 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4530 ImplicationChecksByTransitivity, 18.3s TimeCoverageRelationStatistics Valid=1585, Invalid=14413, Unknown=4, NotChecked=0, Total=16002 [2022-03-15 18:55:42,189 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 370 mSDsluCounter, 350 mSDsCounter, 0 mSdLazyCounter, 2886 mSolverCounterSat, 307 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 370 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 3193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 307 IncrementalHoareTripleChecker+Valid, 2886 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-03-15 18:55:42,189 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [370 Valid, 0 Invalid, 3193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [307 Valid, 2886 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2022-03-15 18:55:42,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 769 states. [2022-03-15 18:55:42,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 769 to 177. [2022-03-15 18:55:42,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 176 states have (on average 2.784090909090909) internal successors, (490), 176 states have internal predecessors, (490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:55:42,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 490 transitions. [2022-03-15 18:55:42,197 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 490 transitions. Word has length 20 [2022-03-15 18:55:42,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 18:55:42,197 INFO L470 AbstractCegarLoop]: Abstraction has 177 states and 490 transitions. [2022-03-15 18:55:42,197 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 2.55) internal successors, (51), 20 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 18:55:42,197 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 490 transitions. [2022-03-15 18:55:42,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-03-15 18:55:42,197 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 18:55:42,197 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 18:55:42,223 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 18:55:42,407 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 18:55:42,407 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 18:55:42,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 18:55:42,408 INFO L85 PathProgramCache]: Analyzing trace with hash 955360954, now seen corresponding path program 11 times [2022-03-15 18:55:42,408 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 18:55:42,408 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848888075] [2022-03-15 18:55:42,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:55:42,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 18:55:42,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:55:43,095 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:55:43,095 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 18:55:43,095 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [848888075] [2022-03-15 18:55:43,095 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [848888075] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 18:55:43,095 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [738148254] [2022-03-15 18:55:43,096 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 18:55:43,096 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 18:55:43,096 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 18:55:43,097 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 18:55:43,097 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 18:55:43,186 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-03-15 18:55:43,187 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 18:55:43,188 INFO L263 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 88 conjunts are in the unsatisfiable core [2022-03-15 18:55:43,190 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 18:55:43,258 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 13 treesize of output 9 [2022-03-15 18:55:43,309 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 18:55:43,431 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 18:55:43,432 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 20 treesize of output 22 [2022-03-15 18:55:43,870 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 18:55:43,870 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 232 treesize of output 168 [2022-03-15 18:55:43,983 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:55:43,983 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 18:55:46,104 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 18:55:46,104 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 245 treesize of output 137 [2022-03-15 18:55:46,111 INFO L353 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-03-15 18:55:46,111 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 506 treesize of output 446 [2022-03-15 18:55:46,120 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 18:55:46,120 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 314 treesize of output 282 [2022-03-15 18:55:46,129 INFO L353 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-03-15 18:55:46,130 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 396 treesize of output 348 [2022-03-15 18:55:46,682 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:55:46,682 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [738148254] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 18:55:46,682 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 18:55:46,682 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 35 [2022-03-15 18:55:46,682 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1641883198] [2022-03-15 18:55:46,683 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 18:55:46,685 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 18:55:46,695 INFO L252 McrAutomatonBuilder]: Finished intersection with 54 states and 95 transitions. [2022-03-15 18:55:46,695 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 18:55:51,817 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 12 new interpolants: [11413#(and (or (not (<= (+ ~bag1~0 ~sum1~0) 2147483647)) (not (<= 0 (+ ~bag1~0 ~sum1~0 2147483648))) (<= (+ ~bag1~0 ~sum1~0) ~sum2~0) (< ~i~0 ~N~0)) (or (not (<= (+ ~bag1~0 ~sum1~0) 2147483647)) (not (<= 0 (+ ~bag1~0 ~sum1~0 2147483648))) (< ~i~0 ~N~0) (< ~sum2~0 (+ ~bag1~0 ~sum1~0 1)))), 11414#(and (or (< (+ ~bag1~0 ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) 2147483648) 0) (< (+ ~bag1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) 2147483648) 0) (< (+ ~i~0 1) ~N~0) (< ~sum2~0 (+ ~bag1~0 ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) 1)) (< 2147483647 (+ ~bag1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (< 2147483647 (+ ~bag1~0 ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))) (or (< (+ ~bag1~0 ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) 2147483648) 0) (< (+ ~bag1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) 2147483648) 0) (<= (+ ~bag1~0 ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) ~sum2~0) (< (+ ~i~0 1) ~N~0) (< 2147483647 (+ ~bag1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (< 2147483647 (+ ~bag1~0 ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))))), 11418#(and (or (< (+ ~bag1~0 ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) 2147483648) 0) (< (+ ~bag1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) 2147483648) 0) (<= (+ ~bag1~0 ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (+ ~bag2~0 ~sum2~0)) (< (+ ~i~0 1) ~N~0) (<= ~N~0 ~i~0) (< 2147483647 (+ ~bag1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (< 2147483647 (+ ~bag1~0 ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))) (or (< (+ ~bag1~0 ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) 2147483648) 0) (<= (+ ~bag2~0 ~sum2~0) (+ ~bag1~0 ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (< (+ ~bag1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) 2147483648) 0) (< (+ ~i~0 1) ~N~0) (<= ~N~0 ~i~0) (< 2147483647 (+ ~bag1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (< 2147483647 (+ ~bag1~0 ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))))), 11424#(and (or (not (<= 0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) 2147483648))) (<= ~N~0 ~j~0) (< 3 (+ (* ~i~0 4) ~A~0.offset)) (not (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4)))) 2147483647))) (or (not (<= 0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) 2147483648))) (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0) (+ ~bag1~0 ~sum1~0)) (<= ~N~0 ~j~0) (not (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4)))) 2147483647))) (or (not (<= 0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) 2147483648))) (<= ~i~0 1) (<= ~N~0 ~j~0) (not (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4)))) 2147483647))) (or (not (<= 0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) 2147483648))) (<= 0 ~j~0) (<= ~N~0 ~j~0) (not (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4)))) 2147483647))) (or (not (<= 0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) 2147483648))) (<= ~j~0 0) (<= ~N~0 ~j~0) (not (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4)))) 2147483647))) (or (<= (+ ~bag1~0 ~sum1~0) (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0)) (not (<= 0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) 2147483648))) (<= ~N~0 ~j~0) (not (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4)))) 2147483647))) (or (= ~A~0.offset 0) (not (<= 0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) 2147483648))) (<= ~N~0 ~j~0) (not (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4)))) 2147483647))) (or (< 2147483647 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))))) (< (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) 2147483648) 0) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) |thread1Thread1of1ForFork0_plus_~b#1|) (<= ~N~0 ~j~0))), 11420#(and (or (not (<= 0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) 2147483648))) (< (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0) (+ ~sum1~0 1)) (<= ~N~0 ~j~0) (< (+ ~j~0 1) ~N~0) (not (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0) 2147483647)) (not (<= 0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 2147483648))) (not (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4)))) 2147483647))) (or (< 2147483647 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))))) (< 2147483647 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0)) (< (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) 2147483648) 0) (<= ~N~0 ~j~0) (< (+ ~j~0 1) ~N~0) (< (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 2147483648) 0) (<= ~sum1~0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0)))), 11419#(and (or (not (<= (+ ~bag2~0 ~sum2~0) 2147483647)) (not (<= 0 (+ ~bag2~0 ~sum2~0 2147483648))) (< (+ ~bag2~0 ~sum2~0) (+ ~sum1~0 1)) (< ~j~0 ~N~0)) (or (not (<= (+ ~bag2~0 ~sum2~0) 2147483647)) (not (<= 0 (+ ~bag2~0 ~sum2~0 2147483648))) (<= ~sum1~0 (+ ~bag2~0 ~sum2~0)) (< ~j~0 ~N~0))), 11415#(and (or (not (<= (+ ~bag1~0 ~sum1~0) 2147483647)) (not (<= 0 (+ ~bag1~0 ~sum1~0 2147483648))) (< ~i~0 ~N~0) (<= (+ ~bag2~0 ~sum2~0) (+ ~bag1~0 ~sum1~0))) (or (not (<= (+ ~bag1~0 ~sum1~0) 2147483647)) (not (<= 0 (+ ~bag1~0 ~sum1~0 2147483648))) (<= (+ ~bag1~0 ~sum1~0) (+ ~bag2~0 ~sum2~0)) (< ~i~0 ~N~0))), 11416#(and (or (< (+ ~bag1~0 ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) 2147483648) 0) (<= (+ ~bag2~0 ~sum2~0) (+ ~bag1~0 ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (< (+ ~bag1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) 2147483648) 0) (< (+ ~i~0 1) ~N~0) (< 2147483647 (+ ~bag1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (< 2147483647 (+ ~bag1~0 ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))) (or (< (+ ~bag1~0 ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) 2147483648) 0) (< (+ ~bag1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) 2147483648) 0) (<= (+ ~bag1~0 ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (+ ~bag2~0 ~sum2~0)) (< (+ ~i~0 1) ~N~0) (< 2147483647 (+ ~bag1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (< 2147483647 (+ ~bag1~0 ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))))), 11421#(and (or (< 2147483647 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))))) (not (<= (+ ~bag2~0 ~sum2~0) 2147483647)) (< (+ 2 ~j~0) ~N~0) (< 2147483647 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)))) (<= ~sum1~0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)))) (<= ~N~0 (+ ~j~0 1)) (not (<= 0 (+ ~bag2~0 ~sum2~0 2147483648))) (< (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)) 2147483648) 0) (< (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) 2147483648) 0) (< (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)) 2147483648) 0) (< 2147483647 (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4))))) (or (< (+ 2 ~j~0) ~N~0) (<= ~N~0 (+ ~j~0 1)) (not (<= 0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) 2147483648))) (not (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4))) 2147483647)) (not (<= 0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)) 2147483648))) (not (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4))) 2147483647)) (not (<= 0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)) 2147483648))) (< (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4))) (+ ~sum1~0 1)) (not (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4)))) 2147483647))) (or (< 2147483647 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))))) (< (+ 2 ~j~0) ~N~0) (< 2147483647 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)))) (<= ~sum1~0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)))) (<= ~N~0 (+ ~j~0 1)) (< (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)) 2147483648) 0) (< (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) 2147483648) 0) (< (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)) 2147483648) 0) (< 2147483647 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4))))) (or (< 2147483647 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))))) (not (<= (+ ~bag2~0 ~sum2~0) 2147483647)) (< (+ 2 ~j~0) ~N~0) (not (<= 0 (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)) 2147483648))) (<= ~N~0 (+ ~j~0 1)) (not (<= 0 (+ ~bag2~0 ~sum2~0 2147483648))) (< (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) 2147483648) 0) (not (<= (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4))) 2147483647)) (not (<= 0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)) 2147483648))) (not (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4))) 2147483647)) (< (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4))) (+ ~sum1~0 1)))), 11422#(and (or (<= ~sum1~0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)))) (not (<= 0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) 2147483648))) (<= ~N~0 ~j~0) (not (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4)))) 2147483647))) (or (not (<= 0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) 2147483648))) (<= 0 ~j~0) (<= ~N~0 ~j~0) (not (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4)))) 2147483647))) (or (not (<= 0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) 2147483648))) (<= ~j~0 0) (<= ~N~0 ~j~0) (not (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4)))) 2147483647))) (or (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4))) ~sum1~0) (not (<= 0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) 2147483648))) (<= ~N~0 ~j~0) (not (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4)))) 2147483647))) (or (= ~A~0.offset 0) (not (<= 0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) 2147483648))) (<= ~N~0 ~j~0) (not (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4)))) 2147483647)))), 11417#(and (or (< (+ ~bag1~0 ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) 2147483648) 0) (< (+ ~bag1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) 2147483648) 0) (< (+ ~i~0 1) ~N~0) (<= ~N~0 ~i~0) (< ~sum2~0 (+ ~bag1~0 ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) 1)) (< 2147483647 (+ ~bag1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (< 2147483647 (+ ~bag1~0 ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))) (or (< (+ ~bag1~0 ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) 2147483648) 0) (< (+ ~bag1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) 2147483648) 0) (<= (+ ~bag1~0 ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) ~sum2~0) (< (+ ~i~0 1) ~N~0) (<= ~N~0 ~i~0) (< 2147483647 (+ ~bag1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (< 2147483647 (+ ~bag1~0 ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))))), 11423#(and (or (not (<= 0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) 2147483648))) (<= ~N~0 ~j~0) (not (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4)))) 2147483647)) (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4))) (+ ~bag1~0 ~sum1~0))) (or (not (<= 0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) 2147483648))) (<= 0 ~j~0) (<= ~N~0 ~j~0) (not (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4)))) 2147483647))) (or (not (<= 0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) 2147483648))) (<= ~j~0 0) (<= ~N~0 ~j~0) (not (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4)))) 2147483647))) (or (= ~A~0.offset 0) (not (<= 0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) 2147483648))) (<= ~N~0 ~j~0) (not (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4)))) 2147483647))) (or (not (<= 0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) 2147483648))) (<= ~N~0 ~j~0) (<= (+ ~bag1~0 ~sum1~0) (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)))) (not (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4)))) 2147483647))))] [2022-03-15 18:55:51,817 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-03-15 18:55:51,817 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 18:55:51,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-03-15 18:55:51,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=219, Invalid=2130, Unknown=3, NotChecked=0, Total=2352 [2022-03-15 18:55:51,818 INFO L87 Difference]: Start difference. First operand 177 states and 490 transitions. Second operand has 27 states, 26 states have (on average 2.5) internal successors, (65), 26 states have internal predecessors, (65), 0 states have call successors, (0), 0 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 18:56:05,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 18:56:05,091 INFO L93 Difference]: Finished difference Result 959 states and 2584 transitions. [2022-03-15 18:56:05,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2022-03-15 18:56:05,091 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 2.5) internal successors, (65), 26 states have internal predecessors, (65), 0 states have call successors, (0), 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 20 [2022-03-15 18:56:05,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 18:56:05,095 INFO L225 Difference]: With dead ends: 959 [2022-03-15 18:56:05,095 INFO L226 Difference]: Without dead ends: 944 [2022-03-15 18:56:05,096 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 30 SyntacticMatches, 7 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6427 ImplicationChecksByTransitivity, 12.6s TimeCoverageRelationStatistics Valid=2016, Invalid=18573, Unknown=3, NotChecked=0, Total=20592 [2022-03-15 18:56:05,096 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 366 mSDsluCounter, 398 mSDsCounter, 0 mSdLazyCounter, 3718 mSolverCounterSat, 241 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 366 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 3959 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 241 IncrementalHoareTripleChecker+Valid, 3718 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-03-15 18:56:05,096 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [366 Valid, 0 Invalid, 3959 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [241 Valid, 3718 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2022-03-15 18:56:05,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 944 states. [2022-03-15 18:56:05,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 944 to 183. [2022-03-15 18:56:05,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 182 states have (on average 2.8076923076923075) internal successors, (511), 182 states have internal predecessors, (511), 0 states have call successors, (0), 0 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 18:56:05,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 511 transitions. [2022-03-15 18:56:05,103 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 511 transitions. Word has length 20 [2022-03-15 18:56:05,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 18:56:05,103 INFO L470 AbstractCegarLoop]: Abstraction has 183 states and 511 transitions. [2022-03-15 18:56:05,103 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 2.5) internal successors, (65), 26 states have internal predecessors, (65), 0 states have call successors, (0), 0 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 18:56:05,103 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 511 transitions. [2022-03-15 18:56:05,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-03-15 18:56:05,104 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 18:56:05,104 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 18:56:05,120 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 18:56:05,319 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 18:56:05,319 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 18:56:05,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 18:56:05,323 INFO L85 PathProgramCache]: Analyzing trace with hash 986256967, now seen corresponding path program 2 times [2022-03-15 18:56:05,324 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 18:56:05,324 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521876416] [2022-03-15 18:56:05,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:56:05,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 18:56:05,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:56:05,882 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:56:05,883 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 18:56:05,883 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521876416] [2022-03-15 18:56:05,883 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1521876416] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 18:56:05,883 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2058826969] [2022-03-15 18:56:05,883 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 18:56:05,883 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 18:56:05,883 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 18:56:05,884 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 18:56:05,885 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 18:56:05,986 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 18:56:05,986 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 18:56:05,988 INFO L263 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 102 conjunts are in the unsatisfiable core [2022-03-15 18:56:06,000 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 18:56:06,007 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 18:56:06,008 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 18:56:06,009 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 5 treesize of output 3 [2022-03-15 18:56:06,248 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 18:56:06,249 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 41 treesize of output 41 [2022-03-15 18:56:06,624 INFO L353 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-03-15 18:56:06,625 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 102 treesize of output 52 [2022-03-15 18:56:06,791 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:56:06,792 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 18:56:08,657 INFO L353 Elim1Store]: treesize reduction 64, result has 37.9 percent of original size [2022-03-15 18:56:08,658 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 1163 treesize of output 798 [2022-03-15 18:56:08,675 INFO L353 Elim1Store]: treesize reduction 41, result has 22.6 percent of original size [2022-03-15 18:56:08,675 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 752 treesize of output 529 [2022-03-15 18:56:12,576 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:56:12,576 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2058826969] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 18:56:12,577 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 18:56:12,577 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 36 [2022-03-15 18:56:12,577 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [716093865] [2022-03-15 18:56:12,577 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 18:56:12,579 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 18:56:12,588 INFO L252 McrAutomatonBuilder]: Finished intersection with 54 states and 95 transitions. [2022-03-15 18:56:12,588 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 18:56:18,779 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 9 new interpolants: [13095#(and (or (not (<= 0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) 2147483648))) (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0) (+ ~bag1~0 ~sum1~0)) (<= ~N~0 ~j~0) (<= (+ 2 ~j~0) ~N~0) (<= (+ ~i~0 1) ~N~0) (not (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4)))) 2147483647))) (or (<= (+ ~bag1~0 ~sum1~0) (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0)) (not (<= 0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) 2147483648))) (<= ~N~0 ~j~0) (<= (+ 2 ~j~0) ~N~0) (<= (+ ~i~0 1) ~N~0) (not (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4)))) 2147483647)))), 13096#(and (or (<= ~N~0 (+ ~j~0 1)) (<= (+ 3 ~j~0) ~N~0) (not (<= 0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) 2147483648))) (not (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4))) 2147483647)) (not (<= 0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)) 2147483648))) (<= (+ ~i~0 1) ~N~0) (not (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4)))) 2147483647)) (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4))) (+ ~bag1~0 ~sum1~0))) (or (< 2147483647 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))))) (not (<= (+ ~bag2~0 ~sum2~0) 2147483647)) (not (<= 0 (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)) 2147483648))) (<= ~N~0 (+ ~j~0 1)) (<= (+ 3 ~j~0) ~N~0) (not (<= 0 (+ ~bag2~0 ~sum2~0 2147483648))) (< (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) 2147483648) 0) (not (<= (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4))) 2147483647)) (<= (+ ~bag1~0 ~sum1~0) (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)))) (<= (+ ~i~0 1) ~N~0)) (or (<= ~N~0 (+ ~j~0 1)) (<= (+ 3 ~j~0) ~N~0) (not (<= 0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) 2147483648))) (not (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4))) 2147483647)) (<= (+ ~bag1~0 ~sum1~0) (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)))) (not (<= 0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)) 2147483648))) (<= (+ ~i~0 1) ~N~0) (not (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4)))) 2147483647))) (or (< 2147483647 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))))) (not (<= (+ ~bag2~0 ~sum2~0) 2147483647)) (not (<= 0 (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)) 2147483648))) (<= ~N~0 (+ ~j~0 1)) (<= (+ 3 ~j~0) ~N~0) (not (<= 0 (+ ~bag2~0 ~sum2~0 2147483648))) (< (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) 2147483648) 0) (not (<= (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4))) 2147483647)) (<= (+ ~i~0 1) ~N~0) (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4))) (+ ~bag1~0 ~sum1~0)))), 13097#(and (or (<= (* ~N~0 4) (+ 7 ~A~0.offset (* ~j~0 4))) (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4))) (+ ~bag1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (not (<= 0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) 2147483648))) (<= ~N~0 ~j~0) (<= (+ 5 (* ~i~0 4) ~A~0.offset) (* ~N~0 4)) (not (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4)))) 2147483647)) (<= (+ 9 ~A~0.offset (* ~j~0 4)) (* ~N~0 4))) (or (<= (* ~N~0 4) (+ 7 ~A~0.offset (* ~j~0 4))) (not (<= 0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) 2147483648))) (<= ~N~0 ~j~0) (<= (+ 5 (* ~i~0 4) ~A~0.offset) (* ~N~0 4)) (<= (+ ~bag1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)))) (not (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4)))) 2147483647)) (<= (+ 9 ~A~0.offset (* ~j~0 4)) (* ~N~0 4))) (or (not (<= 0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) 2147483648))) (= ~sum1~0 0) (<= ~N~0 ~j~0) (<= (+ 5 (* ~i~0 4) ~A~0.offset) (* ~N~0 4)) (not (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4)))) 2147483647))) (or (= ~A~0.offset 0) (not (<= 0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) 2147483648))) (<= ~N~0 ~j~0) (not (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4)))) 2147483647)))), 13093#(and (or (not (<= 0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) 2147483648))) (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0) ~sum1~0) (<= ~N~0 ~j~0) (< (+ ~j~0 1) ~N~0) (not (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0) 2147483647)) (not (<= 0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 2147483648))) (not (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4)))) 2147483647))) (or (< 2147483647 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))))) (< 2147483647 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0)) (< (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) 2147483648) 0) (< ~sum1~0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 1)) (<= ~N~0 ~j~0) (< (+ ~j~0 1) ~N~0) (< (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 2147483648) 0))), 13099#(and (or (not (<= (+ ~bag1~0 ~sum1~0) 2147483647)) (not (<= 0 (+ ~bag1~0 ~sum1~0 2147483648))) (<= (+ 2 ~i~0) ~N~0) (not (<= (+ ~bag1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) 2147483647)) (not (<= 0 (+ ~bag1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) 2147483648))) (< (+ ~bag1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) ~cap1~0) (<= (+ ~bag1~0 ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) ~sum2~0) (not (< ~i~0 ~N~0))) (or (not (<= (+ ~bag1~0 ~sum1~0) 2147483647)) (not (<= 0 (+ ~bag1~0 ~sum1~0 2147483648))) (<= (+ 2 ~i~0) ~N~0) (not (<= (+ ~bag1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) 2147483647)) (not (<= 0 (+ ~bag1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) 2147483648))) (< (+ ~bag1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) ~cap1~0) (<= ~sum2~0 (+ ~bag1~0 ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (not (< ~i~0 ~N~0)))), 13098#(and (or (not (<= (+ ~bag1~0 ~sum1~0) 2147483647)) (not (<= 0 (+ ~bag1~0 ~sum1~0 2147483648))) (<= (+ 2 ~i~0) ~N~0) (<= ~sum2~0 (+ ~bag1~0 ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))) (or (not (<= (+ ~bag1~0 ~sum1~0) 2147483647)) (not (<= 0 (+ ~bag1~0 ~sum1~0 2147483648))) (<= (+ 2 ~i~0) ~N~0) (<= (+ ~bag1~0 ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) ~sum2~0))), 13094#(and (or (< 2147483647 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))))) (< (+ 2 ~j~0) ~N~0) (< 2147483647 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)))) (<= ~N~0 (+ ~j~0 1)) (< (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)) 2147483648) 0) (< (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) 2147483648) 0) (< (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)) 2147483648) 0) (< ~sum1~0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)) 1)) (< (+ ~bag2~0 ~sum2~0 2147483648) 0) (< 2147483647 (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)))) (< 2147483647 (+ ~bag2~0 ~sum2~0))) (or (< 2147483647 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))))) (not (<= (+ ~bag2~0 ~sum2~0) 2147483647)) (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4))) ~sum1~0) (< (+ 2 ~j~0) ~N~0) (not (<= 0 (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)) 2147483648))) (<= ~N~0 (+ ~j~0 1)) (not (<= 0 (+ ~bag2~0 ~sum2~0 2147483648))) (< (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) 2147483648) 0) (not (<= (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4))) 2147483647)) (not (<= 0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)) 2147483648))) (not (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4))) 2147483647))) (or (< (+ 2 ~j~0) ~N~0) (< 2147483647 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)))) (<= ~N~0 (+ ~j~0 1)) (not (<= 0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) 2147483648))) (< (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)) 2147483648) 0) (< ~sum1~0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)) 1)) (< (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)) 2147483648) 0) (< 2147483647 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)))) (not (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4)))) 2147483647))) (or (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4))) ~sum1~0) (< (+ 2 ~j~0) ~N~0) (<= ~N~0 (+ ~j~0 1)) (not (<= 0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) 2147483648))) (not (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4))) 2147483647)) (not (<= 0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)) 2147483648))) (not (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4))) 2147483647)) (not (<= 0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)) 2147483648))) (not (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4)))) 2147483647)))), 13092#(and (or (not (<= (+ ~bag2~0 ~sum2~0) 2147483647)) (< ~sum1~0 (+ ~bag2~0 ~sum2~0 1)) (not (<= 0 (+ ~bag2~0 ~sum2~0 2147483648))) (< ~j~0 ~N~0)) (or (not (<= (+ ~bag2~0 ~sum2~0) 2147483647)) (<= (+ ~bag2~0 ~sum2~0) ~sum1~0) (not (<= 0 (+ ~bag2~0 ~sum2~0 2147483648))) (< ~j~0 ~N~0))), 13100#(and (or (not (<= (+ ~bag1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) 2147483647)) (not (<= 0 (+ ~bag1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) 2147483648))) (< (+ ~bag1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) ~cap1~0) (<= (+ ~A~0.offset (* ~j~0 4) 1) (* ~N~0 4)) (<= (+ 5 (* ~i~0 4) ~A~0.offset) (* ~N~0 4)) (not (< ~i~0 ~N~0)) (<= (+ ~bag1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (+ ~bag2~0 ~sum2~0))) (or (not (<= (+ ~bag1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) 2147483647)) (= ~A~0.offset 0) (not (<= 0 (+ ~bag1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) 2147483648))) (< (+ ~bag1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) ~cap1~0) (not (< ~i~0 ~N~0))) (or (not (<= (+ ~bag1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) 2147483647)) (not (<= 0 (+ ~bag1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) 2147483648))) (< (+ ~bag1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) ~cap1~0) (= ~sum1~0 0) (<= (+ 5 (* ~i~0 4) ~A~0.offset) (* ~N~0 4)) (not (< ~i~0 ~N~0))) (or (not (<= (+ ~bag1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) 2147483647)) (not (<= 0 (+ ~bag1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) 2147483648))) (<= (+ ~bag2~0 ~sum2~0) (+ ~bag1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (< (+ ~bag1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) ~cap1~0) (<= (+ ~A~0.offset (* ~j~0 4) 1) (* ~N~0 4)) (<= (+ 5 (* ~i~0 4) ~A~0.offset) (* ~N~0 4)) (not (< ~i~0 ~N~0))))] [2022-03-15 18:56:18,779 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-03-15 18:56:18,779 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 18:56:18,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-03-15 18:56:18,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=234, Invalid=1925, Unknown=3, NotChecked=0, Total=2162 [2022-03-15 18:56:18,780 INFO L87 Difference]: Start difference. First operand 183 states and 511 transitions. Second operand has 24 states, 23 states have (on average 2.6956521739130435) internal successors, (62), 23 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 18:56:45,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 18:56:45,554 INFO L93 Difference]: Finished difference Result 888 states and 2226 transitions. [2022-03-15 18:56:45,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2022-03-15 18:56:45,555 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 2.6956521739130435) internal successors, (62), 23 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 20 [2022-03-15 18:56:45,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 18:56:45,557 INFO L225 Difference]: With dead ends: 888 [2022-03-15 18:56:45,558 INFO L226 Difference]: Without dead ends: 868 [2022-03-15 18:56:45,559 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 30 SyntacticMatches, 9 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6362 ImplicationChecksByTransitivity, 27.1s TimeCoverageRelationStatistics Valid=2497, Invalid=17522, Unknown=3, NotChecked=0, Total=20022 [2022-03-15 18:56:45,559 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 490 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 1398 mSolverCounterSat, 251 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 490 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1649 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 251 IncrementalHoareTripleChecker+Valid, 1398 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-03-15 18:56:45,559 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [490 Valid, 0 Invalid, 1649 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [251 Valid, 1398 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-03-15 18:56:45,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 868 states. [2022-03-15 18:56:45,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 868 to 193. [2022-03-15 18:56:45,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 192 states have (on average 2.8333333333333335) internal successors, (544), 192 states have internal predecessors, (544), 0 states have call successors, (0), 0 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 18:56:45,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 544 transitions. [2022-03-15 18:56:45,574 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 544 transitions. Word has length 20 [2022-03-15 18:56:45,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 18:56:45,574 INFO L470 AbstractCegarLoop]: Abstraction has 193 states and 544 transitions. [2022-03-15 18:56:45,574 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 2.6956521739130435) internal successors, (62), 23 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 18:56:45,574 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 544 transitions. [2022-03-15 18:56:45,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-03-15 18:56:45,575 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 18:56:45,575 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 18:56:45,591 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 18:56:45,791 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 18:56:45,791 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 18:56:45,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 18:56:45,792 INFO L85 PathProgramCache]: Analyzing trace with hash -572249217, now seen corresponding path program 3 times [2022-03-15 18:56:45,792 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 18:56:45,792 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603451467] [2022-03-15 18:56:45,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:56:45,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 18:56:45,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:56:46,389 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:56:46,390 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 18:56:46,390 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603451467] [2022-03-15 18:56:46,390 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [603451467] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 18:56:46,390 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [207298390] [2022-03-15 18:56:46,390 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 18:56:46,390 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 18:56:46,390 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 18:56:46,391 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 18:56:46,392 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 18:56:46,487 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-03-15 18:56:46,488 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 18:56:46,489 INFO L263 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 93 conjunts are in the unsatisfiable core [2022-03-15 18:56:46,490 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 18:56:46,653 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 18:56:46,654 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 18:56:47,115 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 18:56:47,116 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 51 [2022-03-15 18:56:47,249 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 18:56:47,249 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 18:56:48,586 INFO L353 Elim1Store]: treesize reduction 50, result has 51.5 percent of original size [2022-03-15 18:56:48,586 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 1137 treesize of output 826 [2022-03-15 18:56:48,620 INFO L353 Elim1Store]: treesize reduction 50, result has 51.5 percent of original size [2022-03-15 18:56:48,620 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 766 treesize of output 541 [2022-03-15 18:57:06,610 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 18:57:06,610 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [207298390] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 18:57:06,610 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 18:57:06,610 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 11] total 34 [2022-03-15 18:57:06,610 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [644973131] [2022-03-15 18:57:06,611 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 18:57:06,613 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 18:57:06,624 INFO L252 McrAutomatonBuilder]: Finished intersection with 62 states and 114 transitions. [2022-03-15 18:57:06,624 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 18:57:21,994 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 13 new interpolants: [14714#(and (or (not (<= (+ ~bag2~0 ~sum2~0) 2147483647)) (< ~sum1~0 (+ ~bag2~0 ~sum2~0 1)) (not (<= 0 (+ ~bag2~0 ~sum2~0 2147483648))) (< ~j~0 ~N~0)) (or (not (<= (+ ~bag2~0 ~sum2~0) 2147483647)) (<= (+ ~bag2~0 ~sum2~0) ~sum1~0) (not (<= 0 (+ ~bag2~0 ~sum2~0 2147483648))) (< ~j~0 ~N~0))), 14718#(and (or (< (+ ~bag1~0 ~sum1~0 2147483648) 0) (not (<= (+ ~bag1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) 2147483647)) (not (<= 0 (+ ~bag1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) 2147483648))) (< (+ ~bag1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) ~cap1~0) (<= ~sum2~0 (+ ~bag1~0 ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (not (< ~i~0 ~N~0)) (< 2147483647 (+ ~bag1~0 ~sum1~0))) (or (< (+ ~bag1~0 ~sum1~0 2147483648) 0) (not (<= (+ ~bag1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) 2147483647)) (not (<= 0 (+ ~bag1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) 2147483648))) (< (+ ~bag1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) ~cap1~0) (<= (+ ~bag1~0 ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) ~sum2~0) (not (< ~i~0 ~N~0)) (< 2147483647 (+ ~bag1~0 ~sum1~0)))), 14719#(and (or (not (<= (+ ~bag1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) 2147483647)) (= ~A~0.offset 0) (not (<= 0 (+ ~bag1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) 2147483648))) (< (+ ~bag1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) ~cap1~0) (not (< ~i~0 ~N~0))) (or (not (<= (+ ~bag1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) 2147483647)) (not (<= 0 (+ ~bag1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) 2147483648))) (< (+ ~bag1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) ~cap1~0) (<= (+ ~bag1~0 ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (+ ~bag2~0 ~sum2~0)) (<= (+ ~A~0.offset (* ~j~0 4) 1) (* ~N~0 4)) (not (< ~i~0 ~N~0))) (or (not (<= (+ ~bag1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) 2147483647)) (<= (+ ~bag2~0 ~sum2~0) (+ ~bag1~0 ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (not (<= 0 (+ ~bag1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) 2147483648))) (< (+ ~bag1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) ~cap1~0) (<= (+ ~A~0.offset (* ~j~0 4) 1) (* ~N~0 4)) (not (< ~i~0 ~N~0)))), 14726#(and (or (not (<= (+ ~bag1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) 2147483647)) (= ~A~0.offset 0) (not (<= 0 (+ ~bag1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) 2147483648))) (not (<= 0 (+ |thread1Thread1of1ForFork0_plus_~b#1| |thread1Thread1of1ForFork0_plus_~a#1| 2147483648))) (not (< (+ |thread1Thread1of1ForFork0_plus_~b#1| |thread1Thread1of1ForFork0_plus_~a#1|) ~cap1~0)) (not (<= (+ |thread1Thread1of1ForFork0_plus_~b#1| |thread1Thread1of1ForFork0_plus_~a#1|) 2147483647))) (or (= (* ~N~0 4) (+ (* ~i~0 4) ~A~0.offset 8)) (not (<= (+ ~bag1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) 2147483647)) (not (<= 0 (+ ~bag1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) 2147483648))) (not (<= 0 (+ |thread1Thread1of1ForFork0_plus_~b#1| |thread1Thread1of1ForFork0_plus_~a#1| 2147483648))) (not (< (+ |thread1Thread1of1ForFork0_plus_~b#1| |thread1Thread1of1ForFork0_plus_~a#1|) ~cap1~0)) (not (<= (+ |thread1Thread1of1ForFork0_plus_~b#1| |thread1Thread1of1ForFork0_plus_~a#1|) 2147483647)) (<= (* ~N~0 4) (+ 7 (* ~i~0 4) ~A~0.offset))) (or (not (<= (+ ~bag1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) 2147483647)) (not (<= 0 (+ ~bag1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) 2147483648))) (not (<= 0 (+ |thread1Thread1of1ForFork0_plus_~b#1| |thread1Thread1of1ForFork0_plus_~a#1| 2147483648))) (not (< (+ |thread1Thread1of1ForFork0_plus_~b#1| |thread1Thread1of1ForFork0_plus_~a#1|) ~cap1~0)) (not (<= (+ |thread1Thread1of1ForFork0_plus_~b#1| |thread1Thread1of1ForFork0_plus_~a#1|) 2147483647)) (<= ~sum2~0 0) (<= (* ~N~0 4) (+ 7 (* ~i~0 4) ~A~0.offset))) (or (<= (* ~N~0 4) (+ 7 (* ~i~0 4) ~A~0.offset)) (<= ~cap1~0 (+ |thread1Thread1of1ForFork0_plus_~b#1| |thread1Thread1of1ForFork0_plus_~a#1|)) (<= (+ ~bag1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) 1) ~cap1~0) (< 2147483647 (+ ~bag1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (< (+ |thread1Thread1of1ForFork0_plus_~b#1| |thread1Thread1of1ForFork0_plus_~a#1| 2147483648) 0)) (or (not (<= (+ ~bag1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) 2147483647)) (not (<= 0 (+ ~bag1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) 2147483648))) (not (<= 0 (+ |thread1Thread1of1ForFork0_plus_~b#1| |thread1Thread1of1ForFork0_plus_~a#1| 2147483648))) (not (< (+ |thread1Thread1of1ForFork0_plus_~b#1| |thread1Thread1of1ForFork0_plus_~a#1|) ~cap1~0)) (not (<= (+ |thread1Thread1of1ForFork0_plus_~b#1| |thread1Thread1of1ForFork0_plus_~a#1|) 2147483647)) (<= (* ~N~0 4) (+ 7 (* ~i~0 4) ~A~0.offset)) (<= (+ ~bag1~0 ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) (* ~sum2~0 2)))) (or (not (<= (+ ~bag1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) 2147483647)) (not (<= 0 (+ ~bag1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) 2147483648))) (not (<= 0 (+ |thread1Thread1of1ForFork0_plus_~b#1| |thread1Thread1of1ForFork0_plus_~a#1| 2147483648))) (not (< (+ |thread1Thread1of1ForFork0_plus_~b#1| |thread1Thread1of1ForFork0_plus_~a#1|) ~cap1~0)) (not (<= (+ |thread1Thread1of1ForFork0_plus_~b#1| |thread1Thread1of1ForFork0_plus_~a#1|) 2147483647)) (<= (* ~N~0 4) (+ 7 (* ~i~0 4) ~A~0.offset)) (<= (+ ~bag2~0 ~bag1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) 1) ~cap1~0)) (or (not (<= (+ ~bag1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) 2147483647)) (not (<= 0 (+ ~bag1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) 2147483648))) (not (<= 0 (+ |thread1Thread1of1ForFork0_plus_~b#1| |thread1Thread1of1ForFork0_plus_~a#1| 2147483648))) (not (< (+ |thread1Thread1of1ForFork0_plus_~b#1| |thread1Thread1of1ForFork0_plus_~a#1|) ~cap1~0)) (not (<= (+ |thread1Thread1of1ForFork0_plus_~b#1| |thread1Thread1of1ForFork0_plus_~a#1|) 2147483647)) (<= (* ~N~0 4) (+ 7 (* ~i~0 4) ~A~0.offset)) (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0) (+ ~bag1~0 ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))))), 14722#(and (or (< 2147483647 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))))) (not (<= (+ ~bag2~0 ~sum2~0) 2147483647)) (not (<= 0 (+ ~bag2~0 ~sum2~0 2147483648))) (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0) (+ ~bag1~0 ~sum1~0)) (< (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) 2147483648) 0) (<= ~N~0 ~j~0) (<= (+ 2 ~j~0) ~N~0)) (or (not (<= 0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) 2147483648))) (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0) (+ ~bag1~0 ~sum1~0)) (<= ~cap2~0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))))) (<= ~N~0 ~j~0) (<= (+ 2 ~j~0) ~N~0) (not (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4)))) 2147483647))) (or (< 2147483647 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))))) (not (<= (+ ~bag2~0 ~sum2~0) 2147483647)) (<= (+ ~bag1~0 ~sum1~0) (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0)) (not (<= 0 (+ ~bag2~0 ~sum2~0 2147483648))) (< (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) 2147483648) 0) (<= ~N~0 ~j~0) (<= (+ 2 ~j~0) ~N~0)) (or (<= (+ ~bag1~0 ~sum1~0) (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0)) (not (<= 0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) 2147483648))) (<= ~cap2~0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))))) (<= ~N~0 ~j~0) (<= (+ 2 ~j~0) ~N~0) (not (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4)))) 2147483647)))), 14721#(and (or (not (<= (+ ~bag1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) 2147483647)) (= ~A~0.offset 0) (not (<= 0 (+ ~bag1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) 2147483648))) (not (<= (+ ~bag1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) 2147483647)) (not (<= 0 (+ |thread1Thread1of1ForFork0_plus_~b#1| |thread1Thread1of1ForFork0_plus_~a#1| 2147483648))) (not (< (+ |thread1Thread1of1ForFork0_plus_~b#1| |thread1Thread1of1ForFork0_plus_~a#1|) ~cap1~0)) (< (+ ~bag1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) ~cap1~0) (not (< (+ ~i~0 1) ~N~0))) (or (not (<= (+ ~bag1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) 2147483647)) (not (<= 0 (+ ~bag1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) 2147483648))) (not (<= (+ ~bag1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) 2147483647)) (not (<= 0 (+ |thread1Thread1of1ForFork0_plus_~b#1| |thread1Thread1of1ForFork0_plus_~a#1| 2147483648))) (not (< (+ |thread1Thread1of1ForFork0_plus_~b#1| |thread1Thread1of1ForFork0_plus_~a#1|) ~cap1~0)) (< (+ ~bag1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) ~cap1~0) (<= (+ ~A~0.offset (* ~j~0 4) 1) (* ~N~0 4)) (not (< (+ ~i~0 1) ~N~0)) (<= (+ ~bag2~0 ~sum2~0) (+ ~bag1~0 ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))) (or (not (<= (+ ~bag1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) 2147483647)) (not (<= 0 (+ ~bag1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) 2147483648))) (not (<= (+ ~bag1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) 2147483647)) (not (<= 0 (+ |thread1Thread1of1ForFork0_plus_~b#1| |thread1Thread1of1ForFork0_plus_~a#1| 2147483648))) (not (< (+ |thread1Thread1of1ForFork0_plus_~b#1| |thread1Thread1of1ForFork0_plus_~a#1|) ~cap1~0)) (< (+ ~bag1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) ~cap1~0) (<= (+ ~A~0.offset (* ~j~0 4) 1) (* ~N~0 4)) (<= (+ ~bag1~0 ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (+ ~bag2~0 ~sum2~0)) (not (< (+ ~i~0 1) ~N~0)))), 14725#(and (or (not (<= (+ ~bag1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) 2147483647)) (= ~A~0.offset 0) (not (<= 0 (+ ~bag1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) 2147483648))) (not (<= 0 (+ |thread1Thread1of1ForFork0_plus_~b#1| |thread1Thread1of1ForFork0_plus_~a#1| 2147483648))) (not (< (+ |thread1Thread1of1ForFork0_plus_~b#1| |thread1Thread1of1ForFork0_plus_~a#1|) ~cap1~0)) (not (<= (+ |thread1Thread1of1ForFork0_plus_~b#1| |thread1Thread1of1ForFork0_plus_~a#1|) 2147483647))) (or (not (<= (+ ~bag1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) 2147483647)) (<= (+ ~bag2~0 ~sum2~0) (+ ~bag1~0 ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (not (<= 0 (+ ~bag1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) 2147483648))) (not (<= 0 (+ |thread1Thread1of1ForFork0_plus_~b#1| |thread1Thread1of1ForFork0_plus_~a#1| 2147483648))) (not (< (+ |thread1Thread1of1ForFork0_plus_~b#1| |thread1Thread1of1ForFork0_plus_~a#1|) ~cap1~0)) (not (<= (+ |thread1Thread1of1ForFork0_plus_~b#1| |thread1Thread1of1ForFork0_plus_~a#1|) 2147483647)) (<= (* ~N~0 4) (+ 7 (* ~i~0 4) ~A~0.offset))) (or (not (<= (+ ~bag1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) 2147483647)) (not (<= 0 (+ ~bag1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) 2147483648))) (not (<= 0 (+ |thread1Thread1of1ForFork0_plus_~b#1| |thread1Thread1of1ForFork0_plus_~a#1| 2147483648))) (<= (+ ~bag1~0 ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (+ ~bag2~0 ~sum2~0)) (not (< (+ |thread1Thread1of1ForFork0_plus_~b#1| |thread1Thread1of1ForFork0_plus_~a#1|) ~cap1~0)) (not (<= (+ |thread1Thread1of1ForFork0_plus_~b#1| |thread1Thread1of1ForFork0_plus_~a#1|) 2147483647)) (<= (* ~N~0 4) (+ 7 (* ~i~0 4) ~A~0.offset))) (or (<= (+ ~bag1~0 ~cap2~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) 1) (+ ~bag2~0 ~cap1~0)) (not (<= (+ ~bag1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) 2147483647)) (not (<= 0 (+ ~bag1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) 2147483648))) (not (<= 0 (+ |thread1Thread1of1ForFork0_plus_~b#1| |thread1Thread1of1ForFork0_plus_~a#1| 2147483648))) (not (< (+ |thread1Thread1of1ForFork0_plus_~b#1| |thread1Thread1of1ForFork0_plus_~a#1|) ~cap1~0)) (not (<= (+ |thread1Thread1of1ForFork0_plus_~b#1| |thread1Thread1of1ForFork0_plus_~a#1|) 2147483647)) (<= ~sum2~0 0) (<= (* ~N~0 4) (+ 7 (* ~i~0 4) ~A~0.offset))) (or (<= (+ ~bag1~0 ~cap2~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) 1) (+ ~bag2~0 ~cap1~0)) (not (<= (+ ~bag1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) 2147483647)) (not (<= 0 (+ ~bag1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) 2147483648))) (not (<= 0 (+ |thread1Thread1of1ForFork0_plus_~b#1| |thread1Thread1of1ForFork0_plus_~a#1| 2147483648))) (not (< (+ |thread1Thread1of1ForFork0_plus_~b#1| |thread1Thread1of1ForFork0_plus_~a#1|) ~cap1~0)) (not (<= (+ |thread1Thread1of1ForFork0_plus_~b#1| |thread1Thread1of1ForFork0_plus_~a#1|) 2147483647)) (<= (+ ~bag1~0 ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (+ ~bag2~0 (* ~sum2~0 2))) (<= (* ~N~0 4) (+ 7 (* ~i~0 4) ~A~0.offset))) (or (<= (* ~N~0 4) (+ 3 ~A~0.offset (* ~j~0 4))) (not (<= (+ ~bag1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) 2147483647)) (= (* ~j~0 4) (+ (* ~i~0 4) 4)) (not (<= 0 (+ ~bag1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) 2147483648))) (not (<= 0 (+ |thread1Thread1of1ForFork0_plus_~b#1| |thread1Thread1of1ForFork0_plus_~a#1| 2147483648))) (not (< (+ |thread1Thread1of1ForFork0_plus_~b#1| |thread1Thread1of1ForFork0_plus_~a#1|) ~cap1~0)) (<= (+ 5 ~A~0.offset (* ~j~0 4)) (* ~N~0 4)) (not (<= (+ |thread1Thread1of1ForFork0_plus_~b#1| |thread1Thread1of1ForFork0_plus_~a#1|) 2147483647)) (<= (* ~N~0 4) (+ 7 (* ~i~0 4) ~A~0.offset)))), 14717#(and (or (< (+ ~bag1~0 ~sum1~0 2147483648) 0) (<= ~sum2~0 (+ ~bag1~0 ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (< 2147483647 (+ ~bag1~0 ~sum1~0))) (or (< (+ ~bag1~0 ~sum1~0 2147483648) 0) (<= (+ ~bag1~0 ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) ~sum2~0) (< 2147483647 (+ ~bag1~0 ~sum1~0)))), 14716#(and (or (< 2147483647 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))))) (not (<= (+ ~bag2~0 ~sum2~0) 2147483647)) (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4))) ~sum1~0) (< (+ 2 ~j~0) ~N~0) (not (<= 0 (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)) 2147483648))) (<= ~N~0 (+ ~j~0 1)) (< (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4)))) ~cap2~0) (not (<= 0 (+ ~bag2~0 ~sum2~0 2147483648))) (not (<= 0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)) 2147483648))) (<= ~cap2~0 (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)))) (not (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4))) 2147483647))) (or (< (+ 2 ~j~0) ~N~0) (<= ~N~0 (+ ~j~0 1)) (not (<= 0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) 2147483648))) (<= ~cap2~0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))))) (< ~sum1~0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)) 1)) (< (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)) 2147483648) 0) (not (<= 0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)) 2147483648))) (< 2147483647 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)))) (not (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4))) 2147483647)) (not (<= 0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 2147483648))) (not (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4)))) 2147483647))) (or (< 2147483647 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))))) (not (<= (+ ~bag2~0 ~sum2~0) 2147483647)) (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4))) ~sum1~0) (< (+ 2 ~j~0) ~N~0) (<= ~N~0 (+ ~j~0 1)) (< (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4)))) ~cap2~0) (not (<= 0 (+ ~bag2~0 ~sum2~0 2147483648))) (< (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) 2147483648) 0) (< (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)) 2147483648) 0) (not (<= 0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)) 2147483648))) (< 2147483647 (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)))) (not (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0) 2147483647)) (not (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4))) 2147483647)) (not (<= 0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 2147483648)))) (or (< (+ 2 ~j~0) ~N~0) (<= ~N~0 (+ ~j~0 1)) (not (<= 0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) 2147483648))) (not (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4))) 2147483647)) (<= ~cap2~0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))))) (< ~sum1~0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)) 1)) (not (<= 0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)) 2147483648))) (<= ~cap2~0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)))) (not (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4))) 2147483647)) (not (<= 0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)) 2147483648))) (not (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4)))) 2147483647))) (or (< 2147483647 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))))) (not (<= (+ ~bag2~0 ~sum2~0) 2147483647)) (< (+ 2 ~j~0) ~N~0) (not (<= 0 (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)) 2147483648))) (<= ~N~0 (+ ~j~0 1)) (< (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4)))) ~cap2~0) (not (<= 0 (+ ~bag2~0 ~sum2~0 2147483648))) (< ~sum1~0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)) 1)) (not (<= 0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)) 2147483648))) (<= ~cap2~0 (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)))) (not (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4))) 2147483647))) (or (< 2147483647 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))))) (not (<= (+ ~bag2~0 ~sum2~0) 2147483647)) (< (+ 2 ~j~0) ~N~0) (<= ~N~0 (+ ~j~0 1)) (< (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4)))) ~cap2~0) (not (<= 0 (+ ~bag2~0 ~sum2~0 2147483648))) (< (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) 2147483648) 0) (< (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)) 2147483648) 0) (< ~sum1~0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)) 1)) (not (<= 0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)) 2147483648))) (< 2147483647 (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)))) (not (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0) 2147483647)) (not (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4))) 2147483647)) (not (<= 0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 2147483648)))) (or (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4))) ~sum1~0) (< (+ 2 ~j~0) ~N~0) (<= ~N~0 (+ ~j~0 1)) (not (<= 0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) 2147483648))) (<= ~cap2~0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))))) (< (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)) 2147483648) 0) (not (<= 0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)) 2147483648))) (< 2147483647 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)))) (not (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4))) 2147483647)) (not (<= 0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 2147483648))) (not (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4)))) 2147483647))) (or (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4))) ~sum1~0) (< (+ 2 ~j~0) ~N~0) (<= ~N~0 (+ ~j~0 1)) (not (<= 0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) 2147483648))) (not (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4))) 2147483647)) (<= ~cap2~0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))))) (not (<= 0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)) 2147483648))) (<= ~cap2~0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)))) (not (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4))) 2147483647)) (not (<= 0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)) 2147483648))) (not (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4)))) 2147483647)))), 14720#(and (or (< (+ ~bag1~0 ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) 2147483648) 0) (not (<= (+ ~bag1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) 2147483647)) (< (+ ~bag1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) 2147483648) 0) (< (+ ~bag1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) ~cap1~0) (not (< (+ ~i~0 1) ~N~0)) (<= ~cap1~0 (+ |thread1Thread1of1ForFork0_plus_~b#1| |thread1Thread1of1ForFork0_plus_~a#1|)) (< 2147483647 (+ ~bag1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (< (+ |thread1Thread1of1ForFork0_plus_~b#1| |thread1Thread1of1ForFork0_plus_~a#1| 2147483648) 0) (< 2147483647 (+ ~bag1~0 ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (<= (+ ~bag1~0 ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) ~sum2~0)) (or (< (+ ~bag1~0 ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) 2147483648) 0) (< (+ ~bag1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) 2147483648) 0) (<= ~N~0 (+ ~i~0 1)) (< (+ ~bag1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) ~cap1~0) (<= ~sum2~0 (+ ~bag1~0 ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (<= ~cap1~0 (+ |thread1Thread1of1ForFork0_plus_~b#1| |thread1Thread1of1ForFork0_plus_~a#1|)) (< 2147483647 (+ ~bag1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (< (+ |thread1Thread1of1ForFork0_plus_~b#1| |thread1Thread1of1ForFork0_plus_~a#1| 2147483648) 0) (< 2147483647 (+ ~bag1~0 ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (< 2147483647 (+ ~bag1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))))), 14724#(and (or (< 2147483647 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))))) (not (<= (+ ~bag2~0 ~sum2~0) 2147483647)) (<= (* ~N~0 4) (+ 7 ~A~0.offset (* ~j~0 4))) (not (<= 0 (+ ~bag2~0 ~sum2~0 2147483648))) (< (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) 2147483648) 0) (<= (+ ~bag1~0 ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)))) (<= ~N~0 ~j~0) (<= (+ 9 ~A~0.offset (* ~j~0 4)) (* ~N~0 4))) (or (<= (* ~N~0 4) (+ 7 ~A~0.offset (* ~j~0 4))) (not (<= 0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) 2147483648))) (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) (* ~sum2~0 2) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4))) (+ ~bag1~0 ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (<= (+ ~cap2~0 1) (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)))) (<= ~cap2~0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))))) (<= ~N~0 ~j~0) (not (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4)))) 2147483647)) (<= (+ 9 ~A~0.offset (* ~j~0 4)) (* ~N~0 4))) (or (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4))) (+ ~bag1~0 ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (<= (* ~N~0 4) (+ 7 ~A~0.offset (* ~j~0 4))) (not (<= 0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) 2147483648))) (<= ~cap2~0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))))) (<= ~N~0 ~j~0) (not (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4)))) 2147483647)) (<= (+ 9 ~A~0.offset (* ~j~0 4)) (* ~N~0 4))) (or (= ~A~0.offset 0) (not (<= 0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) 2147483648))) (<= ~cap2~0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))))) (<= ~N~0 ~j~0) (not (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4)))) 2147483647))) (or (<= (* ~N~0 4) (+ 7 ~A~0.offset (* ~j~0 4))) (not (<= 0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) 2147483648))) (<= (+ ~cap2~0 1) (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)))) (<= ~cap2~0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))))) (<= ~N~0 ~j~0) (not (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4)))) 2147483647)) (<= (+ 9 ~A~0.offset (* ~j~0 4)) (* ~N~0 4)) (<= 0 ~sum2~0)) (or (< 2147483647 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))))) (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4))) (+ ~bag1~0 ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (<= (* ~N~0 4) (+ 7 ~A~0.offset (* ~j~0 4))) (< (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) 2147483648) 0) (< (+ ~bag2~0 ~sum2~0 2147483648) 0) (<= ~N~0 ~j~0) (< 2147483647 (+ ~bag2~0 ~sum2~0)) (<= (+ 9 ~A~0.offset (* ~j~0 4)) (* ~N~0 4))) (or (< 2147483647 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))))) (not (<= (+ ~bag2~0 ~sum2~0) 2147483647)) (= ~A~0.offset 0) (not (<= 0 (+ ~bag2~0 ~sum2~0 2147483648))) (< (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) 2147483648) 0) (<= ~N~0 ~j~0)) (or (< 2147483647 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))))) (not (<= (+ ~bag2~0 ~sum2~0) 2147483647)) (<= (* ~N~0 4) (+ 7 ~A~0.offset (* ~j~0 4))) (<= (+ ~cap2~0 1) (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)))) (< (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4)))) ~cap2~0) (not (<= 0 (+ ~bag2~0 ~sum2~0 2147483648))) (< (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) 2147483648) 0) (<= ~N~0 ~j~0) (<= (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) (* ~sum2~0 2) (* ~bag2~0 2) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4))) (+ ~bag1~0 ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (<= (+ 9 ~A~0.offset (* ~j~0 4)) (* ~N~0 4))) (or (< 2147483647 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))))) (<= (* ~N~0 4) (+ 7 ~A~0.offset (* ~j~0 4))) (<= (+ ~cap2~0 1) (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)))) (< (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4)))) ~cap2~0) (< (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) 2147483648) 0) (<= 0 (+ ~bag2~0 ~sum2~0)) (< (+ ~bag2~0 ~sum2~0 2147483648) 0) (<= ~N~0 ~j~0) (<= (+ 9 ~A~0.offset (* ~j~0 4)) (* ~N~0 4))) (or (<= (* ~N~0 4) (+ 7 ~A~0.offset (* ~j~0 4))) (not (<= 0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) 2147483648))) (<= ~cap2~0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))))) (<= (+ ~bag1~0 ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)))) (<= ~N~0 ~j~0) (not (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4)))) 2147483647)) (<= (+ 9 ~A~0.offset (* ~j~0 4)) (* ~N~0 4)))), 14723#(and (or (< 2147483647 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))))) (not (<= (+ ~bag2~0 ~sum2~0) 2147483647)) (not (<= 0 (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)) 2147483648))) (<= ~N~0 (+ ~j~0 1)) (< (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4)))) ~cap2~0) (<= (+ 3 ~j~0) ~N~0) (not (<= 0 (+ ~bag2~0 ~sum2~0 2147483648))) (<= (+ ~bag1~0 ~sum1~0) (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)))) (<= ~cap2~0 (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4))))) (or (< 2147483647 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))))) (not (<= (+ ~bag2~0 ~sum2~0) 2147483647)) (<= ~N~0 (+ ~j~0 1)) (< (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4)))) ~cap2~0) (<= (+ 3 ~j~0) ~N~0) (not (<= 0 (+ ~bag2~0 ~sum2~0 2147483648))) (< (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) 2147483648) 0) (< (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)) 2147483648) 0) (< 2147483647 (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)))) (not (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0) 2147483647)) (not (<= 0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 2147483648))) (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4))) (+ ~bag1~0 ~sum1~0))) (or (< 2147483647 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))))) (not (<= (+ ~bag2~0 ~sum2~0) 2147483647)) (not (<= 0 (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)) 2147483648))) (<= ~N~0 (+ ~j~0 1)) (< (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4)))) ~cap2~0) (<= (+ 3 ~j~0) ~N~0) (not (<= 0 (+ ~bag2~0 ~sum2~0 2147483648))) (<= ~cap2~0 (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)))) (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4))) (+ ~bag1~0 ~sum1~0))) (or (<= ~N~0 (+ ~j~0 1)) (<= (+ 3 ~j~0) ~N~0) (not (<= 0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) 2147483648))) (<= ~cap2~0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))))) (< (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)) 2147483648) 0) (<= (+ ~bag1~0 ~sum1~0) (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)))) (< 2147483647 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)))) (not (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0) 2147483647)) (not (<= 0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 2147483648))) (not (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4)))) 2147483647))) (or (< 2147483647 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))))) (not (<= (+ ~bag2~0 ~sum2~0) 2147483647)) (<= ~N~0 (+ ~j~0 1)) (< (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4)))) ~cap2~0) (<= (+ 3 ~j~0) ~N~0) (not (<= 0 (+ ~bag2~0 ~sum2~0 2147483648))) (< (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) 2147483648) 0) (< (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)) 2147483648) 0) (<= (+ ~bag1~0 ~sum1~0) (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)))) (< 2147483647 (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)))) (not (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0) 2147483647)) (not (<= 0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 2147483648)))) (or (<= ~N~0 (+ ~j~0 1)) (<= (+ 3 ~j~0) ~N~0) (not (<= 0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) 2147483648))) (not (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4))) 2147483647)) (<= ~cap2~0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))))) (<= ~cap2~0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)))) (not (<= 0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)) 2147483648))) (not (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4)))) 2147483647)) (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4))) (+ ~bag1~0 ~sum1~0))) (or (<= ~N~0 (+ ~j~0 1)) (<= (+ 3 ~j~0) ~N~0) (not (<= 0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) 2147483648))) (not (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4))) 2147483647)) (<= ~cap2~0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))))) (<= ~cap2~0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)))) (<= (+ ~bag1~0 ~sum1~0) (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)))) (not (<= 0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)) 2147483648))) (not (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4)))) 2147483647))) (or (<= ~N~0 (+ ~j~0 1)) (<= (+ 3 ~j~0) ~N~0) (not (<= 0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) 2147483648))) (<= ~cap2~0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))))) (< (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)) 2147483648) 0) (< 2147483647 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)))) (not (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0) 2147483647)) (not (<= 0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 2147483648))) (not (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4)))) 2147483647)) (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4))) (+ ~bag1~0 ~sum1~0)))), 14715#(and (or (not (<= 0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) 2147483648))) (< ~sum1~0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 1)) (<= ~cap2~0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))))) (<= ~N~0 ~j~0) (< (+ ~j~0 1) ~N~0) (not (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0) 2147483647)) (not (<= 0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 2147483648))) (not (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4)))) 2147483647))) (or (not (<= 0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) 2147483648))) (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0) ~sum1~0) (<= ~cap2~0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))))) (<= ~N~0 ~j~0) (< (+ ~j~0 1) ~N~0) (not (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0) 2147483647)) (not (<= 0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 2147483648))) (not (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4)))) 2147483647))) (or (< 2147483647 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))))) (not (<= (+ ~bag2~0 ~sum2~0) 2147483647)) (not (<= 0 (+ ~bag2~0 ~sum2~0 2147483648))) (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0) ~sum1~0) (< (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) 2147483648) 0) (<= ~N~0 ~j~0) (< (+ ~j~0 1) ~N~0) (not (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0) 2147483647)) (not (<= 0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 2147483648)))) (or (< 2147483647 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))))) (not (<= (+ ~bag2~0 ~sum2~0) 2147483647)) (not (<= 0 (+ ~bag2~0 ~sum2~0 2147483648))) (< (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) 2147483648) 0) (< ~sum1~0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 1)) (<= ~N~0 ~j~0) (< (+ ~j~0 1) ~N~0) (not (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0) 2147483647)) (not (<= 0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 2147483648)))))] [2022-03-15 18:57:21,994 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-03-15 18:57:21,994 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 18:57:21,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-03-15 18:57:21,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=206, Invalid=2039, Unknown=11, NotChecked=0, Total=2256 [2022-03-15 18:57:21,995 INFO L87 Difference]: Start difference. First operand 193 states and 544 transitions. Second operand has 28 states, 27 states have (on average 2.7777777777777777) internal successors, (75), 27 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:02:58,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:02:58,871 INFO L93 Difference]: Finished difference Result 2479 states and 6394 transitions. [2022-03-15 19:02:58,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 354 states. [2022-03-15 19:02:58,871 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 2.7777777777777777) internal successors, (75), 27 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 20 [2022-03-15 19:02:58,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:02:58,879 INFO L225 Difference]: With dead ends: 2479 [2022-03-15 19:02:58,879 INFO L226 Difference]: Without dead ends: 2359 [2022-03-15 19:02:58,887 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 441 GetRequests, 39 SyntacticMatches, 7 SemanticMatches, 395 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64387 ImplicationChecksByTransitivity, 331.7s TimeCoverageRelationStatistics Valid=16789, Invalid=140412, Unknown=11, NotChecked=0, Total=157212 [2022-03-15 19:02:58,888 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 758 mSDsluCounter, 775 mSDsCounter, 0 mSdLazyCounter, 5384 mSolverCounterSat, 601 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 758 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 5985 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 601 IncrementalHoareTripleChecker+Valid, 5384 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.0s IncrementalHoareTripleChecker+Time [2022-03-15 19:02:58,888 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [758 Valid, 0 Invalid, 5985 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [601 Valid, 5384 Invalid, 0 Unknown, 0 Unchecked, 7.0s Time] [2022-03-15 19:02:58,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2359 states. [2022-03-15 19:02:58,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2359 to 323. [2022-03-15 19:02:58,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 323 states, 322 states have (on average 3.080745341614907) internal successors, (992), 322 states have internal predecessors, (992), 0 states have call successors, (0), 0 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:02:58,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 992 transitions. [2022-03-15 19:02:58,911 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 992 transitions. Word has length 20 [2022-03-15 19:02:58,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:02:58,911 INFO L470 AbstractCegarLoop]: Abstraction has 323 states and 992 transitions. [2022-03-15 19:02:58,911 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 2.7777777777777777) internal successors, (75), 27 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:02:58,911 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 992 transitions. [2022-03-15 19:02:58,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-03-15 19:02:58,912 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:02:58,912 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:02:58,929 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-03-15 19:02:59,127 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:02:59,128 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:02:59,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:02:59,128 INFO L85 PathProgramCache]: Analyzing trace with hash -1006957484, now seen corresponding path program 12 times [2022-03-15 19:02:59,129 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:02:59,129 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785305237] [2022-03-15 19:02:59,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:02:59,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:02:59,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:02:59,647 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:02:59,647 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:02:59,647 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785305237] [2022-03-15 19:02:59,647 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1785305237] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:02:59,647 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1396156051] [2022-03-15 19:02:59,647 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 19:02:59,647 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:02:59,647 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:02:59,648 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:02:59,649 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:02:59,746 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-03-15 19:02:59,746 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:02:59,747 INFO L263 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 83 conjunts are in the unsatisfiable core [2022-03-15 19:02:59,749 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:02:59,797 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 13 treesize of output 9 [2022-03-15 19:02:59,862 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:02:59,926 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:03:00,322 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:03:00,322 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 243 treesize of output 179 [2022-03-15 19:03:00,443 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:03:00,444 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:03:01,579 WARN L838 $PredicateComparison]: unable to prove that (and (or (not (<= (+ c_~bag2~0 c_~sum2~0) 2147483647)) (not (<= 0 (+ c_~bag2~0 c_~sum2~0 2147483648))) (forall ((v_ArrVal_667 (Array Int Int))) (let ((.cse7 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_667) c_~A~0.base)) (.cse9 (* c_~j~0 4))) (let ((.cse0 (select .cse7 (+ c_~A~0.offset .cse9)))) (or (< 2147483647 (+ .cse0 c_~bag2~0)) (let ((.cse1 (select .cse7 (+ c_~A~0.offset .cse9 4)))) (let ((.cse2 (let ((.cse8 (* c_~i~0 4))) (let ((.cse6 (+ .cse0 c_~bag2~0 .cse1 c_~sum2~0)) (.cse4 (select .cse7 (+ c_~A~0.offset .cse8))) (.cse5 (select .cse7 (+ c_~A~0.offset .cse8 4)))) (and (<= (+ .cse4 .cse5 c_~bag1~0 c_~sum1~0) .cse6) (< .cse6 (+ .cse4 .cse5 c_~bag1~0 c_~sum1~0 1)))))) (.cse3 (+ .cse0 .cse1 2147483648))) (and (or (< 2147483647 (+ .cse0 .cse1)) (not (<= (+ .cse0 c_~bag2~0 c_~sum2~0) 2147483647)) .cse2 (< .cse3 0) (not (<= 0 (+ .cse0 c_~bag2~0 c_~sum2~0 2147483648)))) (or .cse2 (<= c_~bag2~0 .cse1) (not (<= 0 .cse3)))))) (< (+ .cse0 c_~bag2~0 2147483648) 0)))))) (forall ((v_ArrVal_667 (Array Int Int))) (let ((.cse15 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_667) c_~A~0.base)) (.cse17 (* c_~j~0 4))) (let ((.cse10 (select .cse15 (+ c_~A~0.offset .cse17))) (.cse11 (select .cse15 (+ c_~A~0.offset .cse17 4)))) (or (not (<= (+ .cse10 c_~bag2~0) 2147483647)) (not (<= (+ .cse10 c_~bag2~0 .cse11) 2147483647)) (let ((.cse16 (* c_~i~0 4))) (let ((.cse14 (+ .cse10 c_~bag2~0 .cse11 c_~sum2~0)) (.cse12 (select .cse15 (+ c_~A~0.offset .cse16))) (.cse13 (select .cse15 (+ c_~A~0.offset .cse16 4)))) (and (<= (+ .cse12 .cse13 c_~bag1~0 c_~sum1~0) .cse14) (< .cse14 (+ .cse12 .cse13 c_~bag1~0 c_~sum1~0 1))))) (not (<= 0 (+ .cse10 c_~bag2~0 2147483648))) (not (<= 0 (+ .cse10 c_~bag2~0 .cse11 2147483648)))))))) is different from false [2022-03-15 19:03:01,962 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 2 not checked. [2022-03-15 19:03:01,962 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1396156051] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:03:01,962 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:03:01,962 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 9] total 30 [2022-03-15 19:03:01,963 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1667775853] [2022-03-15 19:03:01,963 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:03:01,966 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:03:01,979 INFO L252 McrAutomatonBuilder]: Finished intersection with 62 states and 114 transitions. [2022-03-15 19:03:01,980 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:03:09,933 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 15 new interpolants: [18696#(and (or (< (+ ~bag1~0 ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) 2147483648) 0) (< (+ ~bag1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) 2147483648) 0) (< (+ ~i~0 1) ~N~0) (< ~sum2~0 (+ ~bag1~0 ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) 1)) (< 2147483647 (+ ~bag1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (< 2147483647 (+ ~bag1~0 ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))) (or (< (+ ~bag1~0 ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) 2147483648) 0) (< (+ ~bag1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) 2147483648) 0) (<= (+ ~bag1~0 ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) ~sum2~0) (< (+ ~i~0 1) ~N~0) (< 2147483647 (+ ~bag1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (< 2147483647 (+ ~bag1~0 ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))))), 18708#(and (or (not (<= 0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) 2147483648))) (<= ~i~0 1) (<= ~N~0 ~j~0) (not (= (+ ~A~0.offset (* ~j~0 4) 4) 4)) (not (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4)))) 2147483647))) (or (< 0 (+ ~A~0.offset (* ~j~0 4) 1)) (not (<= 0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) 2147483648))) (<= ~N~0 ~j~0) (<= 2 ~N~0) (not (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4)))) 2147483647))) (or (not (<= 0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) 2147483648))) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) |thread1Thread1of1ForFork0_plus_~b#1|) (<= ~N~0 ~j~0) (not (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4)))) 2147483647))) (or (not (<= 0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) 2147483648))) (<= ~N~0 ~j~0) (<= ~N~0 2) (not (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4)))) 2147483647)) (<= (+ ~A~0.offset (* ~j~0 4)) 0)) (or (not (<= 0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) 2147483648))) (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0) (+ ~bag1~0 ~sum1~0)) (<= ~N~0 ~j~0) (not (= (+ ~A~0.offset (* ~j~0 4) 4) 4)) (not (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4)))) 2147483647))) (or (<= (+ ~bag1~0 ~sum1~0) (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0)) (not (<= 0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) 2147483648))) (<= ~N~0 ~j~0) (not (= (+ ~A~0.offset (* ~j~0 4) 4) 4)) (not (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4)))) 2147483647))) (or (not (<= 0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) 2147483648))) (<= ~N~0 ~j~0) (< 3 (+ (* ~i~0 4) ~A~0.offset)) (not (= (+ ~A~0.offset (* ~j~0 4) 4) 4)) (not (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4)))) 2147483647))) (or (= ~A~0.offset 0) (not (<= 0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) 2147483648))) (<= ~N~0 ~j~0) (not (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4)))) 2147483647)))), 18697#(and (or (not (<= (+ ~bag1~0 ~sum1~0) 2147483647)) (not (<= 0 (+ ~bag1~0 ~sum1~0 2147483648))) (<= (+ ~j~0 1) ~N~0) (<= (+ ~bag1~0 ~sum1~0) (+ ~bag2~0 ~sum2~0)) (< ~i~0 ~N~0)) (or (not (<= (+ ~bag1~0 ~sum1~0) 2147483647)) (not (<= 0 (+ ~bag1~0 ~sum1~0 2147483648))) (<= (+ ~j~0 1) ~N~0) (< ~i~0 ~N~0) (<= (+ ~bag2~0 ~sum2~0) (+ ~bag1~0 ~sum1~0)))), 18695#(and (or (not (<= (+ ~bag1~0 ~sum1~0) 2147483647)) (not (<= 0 (+ ~bag1~0 ~sum1~0 2147483648))) (<= (+ ~bag1~0 ~sum1~0) ~sum2~0) (< ~i~0 ~N~0)) (or (not (<= (+ ~bag1~0 ~sum1~0) 2147483647)) (not (<= 0 (+ ~bag1~0 ~sum1~0 2147483648))) (< ~i~0 ~N~0) (< ~sum2~0 (+ ~bag1~0 ~sum1~0 1)))), 18702#(and (or (not (<= 0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) 2147483648))) (< (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0) (+ ~sum1~0 1)) (<= ~N~0 ~j~0) (< (+ ~j~0 1) ~N~0) (not (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0) 2147483647)) (not (<= 0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 2147483648))) (not (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4)))) 2147483647))) (or (< 2147483647 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))))) (< 2147483647 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0)) (< (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) 2147483648) 0) (<= ~N~0 ~j~0) (< (+ ~j~0 1) ~N~0) (< (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 2147483648) 0) (<= ~sum1~0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0)))), 18707#(and (or (< 0 (+ ~A~0.offset (* ~j~0 4) 1)) (not (<= 0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) 2147483648))) (<= ~N~0 ~j~0) (<= 2 ~N~0) (not (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4)))) 2147483647))) (or (not (<= 0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) 2147483648))) (<= ~N~0 ~j~0) (<= ~N~0 2) (not (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4)))) 2147483647)) (<= (+ ~A~0.offset (* ~j~0 4)) 0)) (or (not (<= 0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) 2147483648))) (<= ~N~0 ~j~0) (not (= (+ ~A~0.offset (* ~j~0 4) 4) 4)) (not (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4)))) 2147483647)) (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4))) (+ ~bag1~0 ~sum1~0))) (or (not (<= 0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) 2147483648))) (<= ~N~0 ~j~0) (<= (+ ~bag1~0 ~sum1~0) (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)))) (not (= (+ ~A~0.offset (* ~j~0 4) 4) 4)) (not (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4)))) 2147483647))) (or (= ~A~0.offset 0) (not (<= 0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) 2147483648))) (<= ~N~0 ~j~0) (not (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4)))) 2147483647)))), 18705#(and (or (< (+ ~bag1~0 ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) 2147483648) 0) (< (+ ~bag1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) 2147483648) 0) (<= ~N~0 (+ ~i~0 1)) (< (+ ~bag1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) 2147483648) 0) (< 2147483647 (+ ~bag1~0 ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (< 2147483647 (+ ~bag1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (< (+ 2 ~i~0) ~N~0) (< 2147483647 (+ ~bag1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (<= (+ ~bag1~0 ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) ~sum2~0)) (or (< (+ ~bag1~0 ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) 2147483648) 0) (< (+ ~bag1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) 2147483648) 0) (<= ~N~0 (+ ~i~0 1)) (< (+ ~bag1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) 2147483648) 0) (< 2147483647 (+ ~bag1~0 ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (< ~sum2~0 (+ ~bag1~0 ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) 1)) (< 2147483647 (+ ~bag1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (< (+ 2 ~i~0) ~N~0) (< 2147483647 (+ ~bag1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))))), 18698#(and (or (< (+ ~bag1~0 ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) 2147483648) 0) (<= (+ ~bag2~0 ~sum2~0) (+ ~bag1~0 ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (<= (+ ~j~0 1) ~N~0) (< (+ ~bag1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) 2147483648) 0) (< (+ ~i~0 1) ~N~0) (< 2147483647 (+ ~bag1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (< 2147483647 (+ ~bag1~0 ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))) (or (< (+ ~bag1~0 ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) 2147483648) 0) (<= (+ ~j~0 1) ~N~0) (< (+ ~bag1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) 2147483648) 0) (<= (+ ~bag1~0 ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (+ ~bag2~0 ~sum2~0)) (< (+ ~i~0 1) ~N~0) (< 2147483647 (+ ~bag1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (< 2147483647 (+ ~bag1~0 ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))))), 18700#(and (or (< (+ ~bag1~0 ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) 2147483648) 0) (<= (+ ~j~0 1) ~N~0) (< (+ ~bag1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) 2147483648) 0) (<= (+ ~bag1~0 ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (+ ~bag2~0 ~sum2~0)) (< (+ ~i~0 1) ~N~0) (<= ~N~0 ~i~0) (< 2147483647 (+ ~bag1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (< 2147483647 (+ ~bag1~0 ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))) (or (< (+ ~bag1~0 ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) 2147483648) 0) (<= (+ ~bag2~0 ~sum2~0) (+ ~bag1~0 ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (<= (+ ~j~0 1) ~N~0) (< (+ ~bag1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) 2147483648) 0) (< (+ ~i~0 1) ~N~0) (<= ~N~0 ~i~0) (< 2147483647 (+ ~bag1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (< 2147483647 (+ ~bag1~0 ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))))), 18704#(and (or (< 0 (+ ~A~0.offset (* ~j~0 4) 1)) (not (<= 0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) 2147483648))) (<= ~N~0 ~j~0) (<= 2 ~N~0) (not (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4)))) 2147483647))) (or (<= ~sum1~0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)))) (not (<= 0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) 2147483648))) (<= ~N~0 ~j~0) (not (= (+ ~A~0.offset (* ~j~0 4) 4) 4)) (not (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4)))) 2147483647))) (or (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4))) ~sum1~0) (not (<= 0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) 2147483648))) (<= ~N~0 ~j~0) (not (= (+ ~A~0.offset (* ~j~0 4) 4) 4)) (not (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4)))) 2147483647))) (or (not (<= 0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) 2147483648))) (<= ~N~0 ~j~0) (<= ~N~0 2) (not (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4)))) 2147483647)) (<= (+ ~A~0.offset (* ~j~0 4)) 0)) (or (= ~A~0.offset 0) (not (<= 0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) 2147483648))) (<= ~N~0 ~j~0) (not (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4)))) 2147483647)))), 18699#(and (or (< (+ ~bag1~0 ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) 2147483648) 0) (< (+ ~bag1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) 2147483648) 0) (< (+ ~i~0 1) ~N~0) (<= ~N~0 ~i~0) (< ~sum2~0 (+ ~bag1~0 ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) 1)) (< 2147483647 (+ ~bag1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (< 2147483647 (+ ~bag1~0 ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))) (or (< (+ ~bag1~0 ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) 2147483648) 0) (< (+ ~bag1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) 2147483648) 0) (<= (+ ~bag1~0 ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) ~sum2~0) (< (+ ~i~0 1) ~N~0) (<= ~N~0 ~i~0) (< 2147483647 (+ ~bag1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (< 2147483647 (+ ~bag1~0 ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))))), 18706#(and (or (<= (+ ~j~0 1) ~N~0) (< (+ ~bag1~0 ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) 2147483648) 0) (< (+ ~bag1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) 2147483648) 0) (<= ~N~0 (+ ~i~0 1)) (<= (+ ~bag1~0 ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (+ ~bag2~0 ~sum2~0)) (< (+ ~bag1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) 2147483648) 0) (< 2147483647 (+ ~bag1~0 ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (< 2147483647 (+ ~bag1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (< (+ 2 ~i~0) ~N~0) (< 2147483647 (+ ~bag1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))) (or (<= (+ ~j~0 1) ~N~0) (< (+ ~bag1~0 ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) 2147483648) 0) (< (+ ~bag1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) 2147483648) 0) (<= ~N~0 (+ ~i~0 1)) (< (+ ~bag1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) 2147483648) 0) (< 2147483647 (+ ~bag1~0 ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (<= (+ ~bag2~0 ~sum2~0) (+ ~bag1~0 ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (< 2147483647 (+ ~bag1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (< (+ 2 ~i~0) ~N~0) (< 2147483647 (+ ~bag1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))))), 18701#(and (or (not (<= (+ ~bag2~0 ~sum2~0) 2147483647)) (not (<= 0 (+ ~bag2~0 ~sum2~0 2147483648))) (< (+ ~bag2~0 ~sum2~0) (+ ~sum1~0 1)) (< ~j~0 ~N~0)) (or (not (<= (+ ~bag2~0 ~sum2~0) 2147483647)) (not (<= 0 (+ ~bag2~0 ~sum2~0 2147483648))) (<= ~sum1~0 (+ ~bag2~0 ~sum2~0)) (< ~j~0 ~N~0))), 18709#(and (or (<= (* ~N~0 4) (+ (* ~i~0 4) 3 ~A~0.offset)) (not (<= 0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) 2147483648))) (= (+ (* ~i~0 4) ~A~0.offset) 4) (<= ~N~0 ~j~0) (not (= (+ ~A~0.offset (* ~j~0 4) 4) 4)) (not (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4)))) 2147483647))) (or (<= (* ~N~0 4) (+ (* ~i~0 4) 3 ~A~0.offset)) (not (<= 0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) 2147483648))) (<= ~N~0 ~j~0) (<= ~N~0 2) (not (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4)))) 2147483647)) (<= (+ ~A~0.offset (* ~j~0 4)) 0)) (or (<= (* ~N~0 4) (+ (* ~i~0 4) 3 ~A~0.offset)) (not (<= 0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) 2147483648))) (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0) (+ ~bag1~0 ~sum1~0)) (<= ~N~0 ~j~0) (not (= (+ ~A~0.offset (* ~j~0 4) 4) 4)) (not (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4)))) 2147483647))) (or (<= (* ~N~0 4) (+ (* ~i~0 4) 3 ~A~0.offset)) (<= (+ ~bag1~0 ~sum1~0) (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0)) (not (<= 0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) 2147483648))) (<= ~N~0 ~j~0) (not (= (+ ~A~0.offset (* ~j~0 4) 4) 4)) (not (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4)))) 2147483647))) (or (<= (* ~N~0 4) (+ (* ~i~0 4) 3 ~A~0.offset)) (not (<= 0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) 2147483648))) (<= ~N~0 ~j~0) (<= 2 ~N~0) (not (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4)))) 2147483647))) (or (= ~A~0.offset 0) (not (<= 0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) 2147483648))) (<= ~N~0 ~j~0) (not (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4)))) 2147483647)))), 18703#(and (or (< 2147483647 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))))) (not (<= (+ ~bag2~0 ~sum2~0) 2147483647)) (< (+ 2 ~j~0) ~N~0) (< 2147483647 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)))) (<= ~sum1~0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)))) (<= ~N~0 (+ ~j~0 1)) (not (<= 0 (+ ~bag2~0 ~sum2~0 2147483648))) (< (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)) 2147483648) 0) (< (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) 2147483648) 0) (< (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)) 2147483648) 0) (< 2147483647 (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4))))) (or (< (+ 2 ~j~0) ~N~0) (<= ~N~0 (+ ~j~0 1)) (not (<= 0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) 2147483648))) (not (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4))) 2147483647)) (not (<= 0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)) 2147483648))) (not (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4))) 2147483647)) (not (<= 0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)) 2147483648))) (< (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4))) (+ ~sum1~0 1)) (not (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4)))) 2147483647))) (or (< 2147483647 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))))) (< (+ 2 ~j~0) ~N~0) (< 2147483647 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)))) (<= ~sum1~0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)))) (<= ~N~0 (+ ~j~0 1)) (< (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)) 2147483648) 0) (< (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) 2147483648) 0) (< (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)) 2147483648) 0) (< 2147483647 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4))))) (or (< 2147483647 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))))) (not (<= (+ ~bag2~0 ~sum2~0) 2147483647)) (< (+ 2 ~j~0) ~N~0) (not (<= 0 (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)) 2147483648))) (<= ~N~0 (+ ~j~0 1)) (not (<= 0 (+ ~bag2~0 ~sum2~0 2147483648))) (< (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) 2147483648) 0) (not (<= (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4))) 2147483647)) (not (<= 0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)) 2147483648))) (not (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4))) 2147483647)) (< (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4))) (+ ~sum1~0 1))))] [2022-03-15 19:03:09,934 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-03-15 19:03:09,934 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:03:09,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-03-15 19:03:09,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=1826, Unknown=1, NotChecked=86, Total=2070 [2022-03-15 19:03:09,935 INFO L87 Difference]: Start difference. First operand 323 states and 992 transitions. Second operand has 28 states, 27 states have (on average 2.814814814814815) internal successors, (76), 27 states have internal predecessors, (76), 0 states have call successors, (0), 0 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:04:20,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:04:20,338 INFO L93 Difference]: Finished difference Result 2632 states and 7372 transitions. [2022-03-15 19:04:20,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 252 states. [2022-03-15 19:04:20,339 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 2.814814814814815) internal successors, (76), 27 states have internal predecessors, (76), 0 states have call successors, (0), 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 20 [2022-03-15 19:04:20,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:04:20,348 INFO L225 Difference]: With dead ends: 2632 [2022-03-15 19:04:20,348 INFO L226 Difference]: Without dead ends: 2597 [2022-03-15 19:04:20,352 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 336 GetRequests, 37 SyntacticMatches, 9 SemanticMatches, 290 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 33119 ImplicationChecksByTransitivity, 67.9s TimeCoverageRelationStatistics Valid=7339, Invalid=77054, Unknown=1, NotChecked=578, Total=84972 [2022-03-15 19:04:20,353 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 905 mSDsluCounter, 707 mSDsCounter, 0 mSdLazyCounter, 4107 mSolverCounterSat, 584 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 905 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 4691 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 584 IncrementalHoareTripleChecker+Valid, 4107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2022-03-15 19:04:20,353 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [905 Valid, 0 Invalid, 4691 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [584 Valid, 4107 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2022-03-15 19:04:20,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2597 states. [2022-03-15 19:04:20,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2597 to 432. [2022-03-15 19:04:20,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 432 states, 431 states have (on average 3.176334106728538) internal successors, (1369), 431 states have internal predecessors, (1369), 0 states have call successors, (0), 0 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:04:20,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 432 states and 1369 transitions. [2022-03-15 19:04:20,371 INFO L78 Accepts]: Start accepts. Automaton has 432 states and 1369 transitions. Word has length 20 [2022-03-15 19:04:20,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:04:20,371 INFO L470 AbstractCegarLoop]: Abstraction has 432 states and 1369 transitions. [2022-03-15 19:04:20,371 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 2.814814814814815) internal successors, (76), 27 states have internal predecessors, (76), 0 states have call successors, (0), 0 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:04:20,371 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 1369 transitions. [2022-03-15 19:04:20,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-03-15 19:04:20,372 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:04:20,372 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:04:20,400 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2022-03-15 19:04:20,587 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:04:20,587 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:04:20,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:04:20,588 INFO L85 PathProgramCache]: Analyzing trace with hash 1231724520, now seen corresponding path program 2 times [2022-03-15 19:04:20,589 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:04:20,589 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960287502] [2022-03-15 19:04:20,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:04:20,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:04:20,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:04:21,266 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:04:21,266 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:04:21,266 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960287502] [2022-03-15 19:04:21,266 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [960287502] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:04:21,267 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [452734916] [2022-03-15 19:04:21,267 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 19:04:21,267 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:04:21,267 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:04:21,268 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:04:21,270 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:04:21,367 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 19:04:21,368 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:04:21,370 INFO L263 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 87 conjunts are in the unsatisfiable core [2022-03-15 19:04:21,371 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:04:21,598 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:04:21,599 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 19 treesize of output 21 [2022-03-15 19:04:21,897 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:04:21,897 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 113 treesize of output 65 [2022-03-15 19:04:22,045 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:04:22,045 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:04:23,429 INFO L353 Elim1Store]: treesize reduction 50, result has 51.5 percent of original size [2022-03-15 19:04:23,430 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 376 treesize of output 294 [2022-03-15 19:04:23,447 INFO L353 Elim1Store]: treesize reduction 26, result has 50.9 percent of original size [2022-03-15 19:04:23,448 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 242 treesize of output 190 [2022-03-15 19:04:24,541 INFO L353 Elim1Store]: treesize reduction 102, result has 1.0 percent of original size [2022-03-15 19:04:24,542 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 737 treesize of output 1 [2022-03-15 19:04:24,700 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:04:24,701 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [452734916] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:04:24,701 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:04:24,701 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 33 [2022-03-15 19:04:24,701 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [84366396] [2022-03-15 19:04:24,701 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:04:24,704 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:04:24,714 INFO L252 McrAutomatonBuilder]: Finished intersection with 46 states and 76 transitions. [2022-03-15 19:04:24,714 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:04:29,666 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 6 new interpolants: [22850#(and (or (not (<= 0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) 2147483648))) (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0) (+ ~bag1~0 ~sum1~0)) (<= ~N~0 ~j~0) (<= (+ 2 ~j~0) ~N~0) (<= (+ ~i~0 1) ~N~0) (not (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4)))) 2147483647))) (or (<= (+ ~bag1~0 ~sum1~0) (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0)) (not (<= 0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) 2147483648))) (<= ~N~0 ~j~0) (<= (+ 2 ~j~0) ~N~0) (<= (+ ~i~0 1) ~N~0) (not (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4)))) 2147483647)))), 22847#(and (or (not (<= (+ ~bag2~0 ~sum2~0) 2147483647)) (< ~sum1~0 (+ ~bag2~0 ~sum2~0 1)) (not (<= 0 (+ ~bag2~0 ~sum2~0 2147483648))) (< ~j~0 ~N~0)) (or (not (<= (+ ~bag2~0 ~sum2~0) 2147483647)) (<= (+ ~bag2~0 ~sum2~0) ~sum1~0) (not (<= 0 (+ ~bag2~0 ~sum2~0 2147483648))) (< ~j~0 ~N~0))), 22852#(and (or (< (+ ~bag1~0 ~sum1~0 2147483648) 0) (<= (+ 2 ~i~0) ~N~0) (<= (+ ~bag1~0 ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) ~sum2~0) (< 2147483647 (+ ~bag1~0 ~sum1~0))) (or (< (+ ~bag1~0 ~sum1~0 2147483648) 0) (<= (+ 2 ~i~0) ~N~0) (<= ~sum2~0 (+ ~bag1~0 ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (< 2147483647 (+ ~bag1~0 ~sum1~0)))), 22849#(and (or (< 2147483647 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))))) (< (+ 2 ~j~0) ~N~0) (< 2147483647 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)))) (<= ~N~0 (+ ~j~0 1)) (< (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)) 2147483648) 0) (< (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) 2147483648) 0) (< ~sum1~0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)) 1)) (< (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)) 2147483648) 0) (< 2147483647 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4))))) (or (< 2147483647 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))))) (not (<= (+ ~bag2~0 ~sum2~0) 2147483647)) (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4))) ~sum1~0) (< (+ 2 ~j~0) ~N~0) (not (<= 0 (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)) 2147483648))) (<= ~N~0 (+ ~j~0 1)) (not (<= 0 (+ ~bag2~0 ~sum2~0 2147483648))) (< (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) 2147483648) 0) (not (<= (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4))) 2147483647)) (not (<= 0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)) 2147483648))) (not (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4))) 2147483647))) (or (< 2147483647 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))))) (not (<= (+ ~bag2~0 ~sum2~0) 2147483647)) (< (+ 2 ~j~0) ~N~0) (not (<= 0 (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)) 2147483648))) (<= ~N~0 (+ ~j~0 1)) (not (<= 0 (+ ~bag2~0 ~sum2~0 2147483648))) (< (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) 2147483648) 0) (not (<= (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4))) 2147483647)) (< ~sum1~0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)) 1)) (not (<= 0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)) 2147483648))) (not (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4))) 2147483647))) (or (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4))) ~sum1~0) (< (+ 2 ~j~0) ~N~0) (<= ~N~0 (+ ~j~0 1)) (not (<= 0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) 2147483648))) (not (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4))) 2147483647)) (not (<= 0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)) 2147483648))) (not (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4))) 2147483647)) (not (<= 0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)) 2147483648))) (not (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4)))) 2147483647)))), 22848#(and (or (not (<= 0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) 2147483648))) (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0) ~sum1~0) (<= ~N~0 ~j~0) (< (+ ~j~0 1) ~N~0) (not (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0) 2147483647)) (not (<= 0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 2147483648))) (not (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4)))) 2147483647))) (or (not (<= 0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) 2147483648))) (< ~sum1~0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 1)) (<= ~N~0 ~j~0) (< (+ ~j~0 1) ~N~0) (not (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0) 2147483647)) (not (<= 0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 2147483648))) (not (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4)))) 2147483647)))), 22851#(and (or (<= ~N~0 (+ ~j~0 1)) (<= (+ 3 ~j~0) ~N~0) (not (<= 0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) 2147483648))) (not (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4))) 2147483647)) (not (<= 0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)) 2147483648))) (<= (+ ~i~0 1) ~N~0) (not (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4)))) 2147483647)) (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4))) (+ ~bag1~0 ~sum1~0))) (or (< 2147483647 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))))) (not (<= (+ ~bag2~0 ~sum2~0) 2147483647)) (not (<= 0 (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)) 2147483648))) (<= ~N~0 (+ ~j~0 1)) (<= (+ 3 ~j~0) ~N~0) (not (<= 0 (+ ~bag2~0 ~sum2~0 2147483648))) (< (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) 2147483648) 0) (not (<= (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4))) 2147483647)) (<= (+ ~bag1~0 ~sum1~0) (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)))) (<= (+ ~i~0 1) ~N~0)) (or (<= ~N~0 (+ ~j~0 1)) (<= (+ 3 ~j~0) ~N~0) (not (<= 0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) 2147483648))) (not (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4))) 2147483647)) (<= (+ ~bag1~0 ~sum1~0) (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)))) (not (<= 0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)) 2147483648))) (<= (+ ~i~0 1) ~N~0) (not (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4)))) 2147483647))) (or (< 2147483647 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))))) (not (<= (+ ~bag2~0 ~sum2~0) 2147483647)) (not (<= 0 (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)) 2147483648))) (<= ~N~0 (+ ~j~0 1)) (<= (+ 3 ~j~0) ~N~0) (not (<= 0 (+ ~bag2~0 ~sum2~0 2147483648))) (< (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) 2147483648) 0) (not (<= (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4))) 2147483647)) (<= (+ ~i~0 1) ~N~0) (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4))) (+ ~bag1~0 ~sum1~0))))] [2022-03-15 19:04:29,666 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-03-15 19:04:29,666 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:04:29,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-03-15 19:04:29,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=1446, Unknown=2, NotChecked=0, Total=1640 [2022-03-15 19:04:29,667 INFO L87 Difference]: Start difference. First operand 432 states and 1369 transitions. Second operand has 20 states, 19 states have (on average 2.6842105263157894) internal successors, (51), 19 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:04:42,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:04:42,254 INFO L93 Difference]: Finished difference Result 1064 states and 3109 transitions. [2022-03-15 19:04:42,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2022-03-15 19:04:42,255 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 2.6842105263157894) internal successors, (51), 19 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 20 [2022-03-15 19:04:42,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:04:42,259 INFO L225 Difference]: With dead ends: 1064 [2022-03-15 19:04:42,259 INFO L226 Difference]: Without dead ends: 1054 [2022-03-15 19:04:42,260 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 31 SyntacticMatches, 6 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3101 ImplicationChecksByTransitivity, 12.9s TimeCoverageRelationStatistics Valid=1350, Invalid=9360, Unknown=2, NotChecked=0, Total=10712 [2022-03-15 19:04:42,260 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 332 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 972 mSolverCounterSat, 233 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 332 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 233 IncrementalHoareTripleChecker+Valid, 972 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-03-15 19:04:42,260 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [332 Valid, 0 Invalid, 1205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [233 Valid, 972 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-03-15 19:04:42,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1054 states. [2022-03-15 19:04:42,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1054 to 436. [2022-03-15 19:04:42,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 436 states, 435 states have (on average 3.167816091954023) internal successors, (1378), 435 states have internal predecessors, (1378), 0 states have call successors, (0), 0 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:04:42,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 436 states and 1378 transitions. [2022-03-15 19:04:42,271 INFO L78 Accepts]: Start accepts. Automaton has 436 states and 1378 transitions. Word has length 20 [2022-03-15 19:04:42,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:04:42,271 INFO L470 AbstractCegarLoop]: Abstraction has 436 states and 1378 transitions. [2022-03-15 19:04:42,271 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.6842105263157894) internal successors, (51), 19 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:04:42,271 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 1378 transitions. [2022-03-15 19:04:42,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-03-15 19:04:42,272 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:04:42,272 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:04:42,289 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:04:42,483 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:04:42,483 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:04:42,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:04:42,484 INFO L85 PathProgramCache]: Analyzing trace with hash 1227217678, now seen corresponding path program 3 times [2022-03-15 19:04:42,484 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:04:42,484 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334496276] [2022-03-15 19:04:42,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:04:42,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:04:42,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:04:43,842 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:04:43,842 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:04:43,842 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334496276] [2022-03-15 19:04:43,842 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1334496276] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:04:43,842 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1370222138] [2022-03-15 19:04:43,842 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 19:04:43,842 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:04:43,842 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:04:43,843 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:04:43,844 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:04:43,954 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-03-15 19:04:43,954 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:04:43,957 INFO L263 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 89 conjunts are in the unsatisfiable core [2022-03-15 19:04:43,958 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:04:44,165 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:04:44,165 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:04:44,481 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:04:44,481 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 113 treesize of output 65 [2022-03-15 19:04:44,678 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:04:44,678 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:04:45,966 INFO L353 Elim1Store]: treesize reduction 64, result has 37.9 percent of original size [2022-03-15 19:04:45,966 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 376 treesize of output 280 [2022-03-15 19:04:45,978 INFO L353 Elim1Store]: treesize reduction 41, result has 22.6 percent of original size [2022-03-15 19:04:45,979 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 242 treesize of output 176 [2022-03-15 19:04:46,320 INFO L353 Elim1Store]: treesize reduction 102, result has 1.0 percent of original size [2022-03-15 19:04:46,320 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 737 treesize of output 1 [2022-03-15 19:04:46,484 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:04:46,485 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1370222138] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:04:46,485 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:04:46,485 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 33 [2022-03-15 19:04:46,485 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [281087967] [2022-03-15 19:04:46,485 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:04:46,487 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:04:46,497 INFO L252 McrAutomatonBuilder]: Finished intersection with 54 states and 95 transitions. [2022-03-15 19:04:46,497 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:04:51,985 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 9 new interpolants: [25064#(and (or (not (<= (+ ~bag2~0 ~sum2~0) 2147483647)) (< ~sum1~0 (+ ~bag2~0 ~sum2~0 1)) (not (<= 0 (+ ~bag2~0 ~sum2~0 2147483648))) (< ~j~0 ~N~0)) (or (not (<= (+ ~bag2~0 ~sum2~0) 2147483647)) (<= (+ ~bag2~0 ~sum2~0) ~sum1~0) (not (<= 0 (+ ~bag2~0 ~sum2~0 2147483648))) (< ~j~0 ~N~0))), 25069#(and (or (< (+ ~bag1~0 ~sum1~0 2147483648) 0) (<= ~sum2~0 (+ ~bag1~0 ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (< 2147483647 (+ ~bag1~0 ~sum1~0))) (or (< (+ ~bag1~0 ~sum1~0 2147483648) 0) (<= (+ ~bag1~0 ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) ~sum2~0) (< 2147483647 (+ ~bag1~0 ~sum1~0)))), 25072#(and (or (not (<= (+ ~bag1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) 2147483647)) (not (<= 0 (+ ~bag1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) 2147483648))) (<= (+ ~bag1~0 ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (+ ~bag2~0 ~sum2~0)) (not (< ~i~0 ~N~0))) (or (not (<= (+ ~bag1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) 2147483647)) (= ~A~0.offset 0) (not (<= 0 (+ ~bag1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) 2147483648))) (not (< ~i~0 ~N~0))) (or (not (<= (+ ~bag1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) 2147483647)) (<= (+ ~bag2~0 ~sum2~0) (+ ~bag1~0 ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (not (<= 0 (+ ~bag1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) 2147483648))) (not (< ~i~0 ~N~0)))), 25068#(and (or (<= ~N~0 (+ ~j~0 1)) (not (<= 0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) 2147483648))) (not (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4))) 2147483647)) (<= (+ ~bag1~0 ~sum1~0) (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)))) (not (<= 0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)) 2147483648))) (not (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4)))) 2147483647))) (or (<= ~N~0 (+ ~j~0 1)) (not (<= 0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) 2147483648))) (not (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4))) 2147483647)) (not (<= 0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)) 2147483648))) (not (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4)))) 2147483647)) (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4))) (+ ~bag1~0 ~sum1~0))) (or (< 2147483647 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))))) (not (<= (+ ~bag2~0 ~sum2~0) 2147483647)) (not (<= 0 (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)) 2147483648))) (<= ~N~0 (+ ~j~0 1)) (not (<= 0 (+ ~bag2~0 ~sum2~0 2147483648))) (< (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) 2147483648) 0) (not (<= (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4))) 2147483647)) (<= (+ ~bag1~0 ~sum1~0) (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4))))) (or (< 2147483647 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))))) (not (<= (+ ~bag2~0 ~sum2~0) 2147483647)) (not (<= 0 (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)) 2147483648))) (<= ~N~0 (+ ~j~0 1)) (not (<= 0 (+ ~bag2~0 ~sum2~0 2147483648))) (< (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) 2147483648) 0) (not (<= (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4))) 2147483647)) (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4))) (+ ~bag1~0 ~sum1~0)))), 25070#(and (or (< (+ ~bag1~0 ~sum1~0 2147483648) 0) (< (+ ~bag1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) 2147483648) 0) (<= ~sum2~0 (+ ~bag1~0 ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (<= ~N~0 ~i~0) (< 2147483647 (+ ~bag1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (< 2147483647 (+ ~bag1~0 ~sum1~0))) (or (< (+ ~bag1~0 ~sum1~0 2147483648) 0) (not (<= (+ ~bag1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) 2147483647)) (not (<= 0 (+ ~bag1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) 2147483648))) (<= (+ ~bag1~0 ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) ~sum2~0) (not (< ~i~0 ~N~0)) (< 2147483647 (+ ~bag1~0 ~sum1~0)))), 25066#(and (or (< 2147483647 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))))) (< (+ 2 ~j~0) ~N~0) (< 2147483647 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)))) (<= ~N~0 (+ ~j~0 1)) (< (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)) 2147483648) 0) (< (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) 2147483648) 0) (< (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)) 2147483648) 0) (< ~sum1~0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)) 1)) (< (+ ~bag2~0 ~sum2~0 2147483648) 0) (< 2147483647 (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)))) (< 2147483647 (+ ~bag2~0 ~sum2~0))) (or (< 2147483647 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))))) (not (<= (+ ~bag2~0 ~sum2~0) 2147483647)) (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4))) ~sum1~0) (< (+ 2 ~j~0) ~N~0) (not (<= 0 (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)) 2147483648))) (<= ~N~0 (+ ~j~0 1)) (not (<= 0 (+ ~bag2~0 ~sum2~0 2147483648))) (< (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) 2147483648) 0) (not (<= (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4))) 2147483647)) (not (<= 0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)) 2147483648))) (not (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4))) 2147483647))) (or (< (+ 2 ~j~0) ~N~0) (< 2147483647 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)))) (<= ~N~0 (+ ~j~0 1)) (not (<= 0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) 2147483648))) (< (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)) 2147483648) 0) (< ~sum1~0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)) 1)) (< (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)) 2147483648) 0) (< 2147483647 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)))) (not (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4)))) 2147483647))) (or (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4))) ~sum1~0) (< (+ 2 ~j~0) ~N~0) (<= ~N~0 (+ ~j~0 1)) (not (<= 0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) 2147483648))) (not (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4))) 2147483647)) (not (<= 0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)) 2147483648))) (not (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4))) 2147483647)) (not (<= 0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)) 2147483648))) (not (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4)))) 2147483647)))), 25071#(and (or (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4))) (+ ~bag1~0 ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (not (<= 0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) 2147483648))) (<= ~N~0 ~j~0) (not (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4)))) 2147483647))) (or (= ~A~0.offset 0) (not (<= 0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) 2147483648))) (<= ~N~0 ~j~0) (not (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4)))) 2147483647))) (or (not (<= 0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) 2147483648))) (<= (+ ~bag1~0 ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)))) (<= ~N~0 ~j~0) (not (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4)))) 2147483647)))), 25065#(and (or (not (<= 0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) 2147483648))) (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0) ~sum1~0) (<= ~N~0 ~j~0) (< (+ ~j~0 1) ~N~0) (not (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0) 2147483647)) (not (<= 0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 2147483648))) (not (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4)))) 2147483647))) (or (< 2147483647 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))))) (< 2147483647 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0)) (< (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) 2147483648) 0) (< ~sum1~0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 1)) (<= ~N~0 ~j~0) (< (+ ~j~0 1) ~N~0) (< (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 2147483648) 0))), 25067#(and (or (not (<= 0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) 2147483648))) (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0) (+ ~bag1~0 ~sum1~0)) (<= ~N~0 ~j~0) (not (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4)))) 2147483647))) (or (<= (+ ~bag1~0 ~sum1~0) (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0)) (not (<= 0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) 2147483648))) (<= ~N~0 ~j~0) (not (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4)))) 2147483647))))] [2022-03-15 19:04:51,985 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-03-15 19:04:51,985 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:04:51,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-03-15 19:04:51,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=1705, Unknown=1, NotChecked=0, Total=1892 [2022-03-15 19:04:51,986 INFO L87 Difference]: Start difference. First operand 436 states and 1378 transitions. Second operand has 23 states, 22 states have (on average 2.8181818181818183) internal successors, (62), 22 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:05:07,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:05:07,944 INFO L93 Difference]: Finished difference Result 1092 states and 2803 transitions. [2022-03-15 19:05:07,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2022-03-15 19:05:07,944 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 2.8181818181818183) internal successors, (62), 22 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 20 [2022-03-15 19:05:07,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:05:07,948 INFO L225 Difference]: With dead ends: 1092 [2022-03-15 19:05:07,948 INFO L226 Difference]: Without dead ends: 1015 [2022-03-15 19:05:07,948 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 40 SyntacticMatches, 2 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3217 ImplicationChecksByTransitivity, 15.7s TimeCoverageRelationStatistics Valid=1458, Invalid=10751, Unknown=1, NotChecked=0, Total=12210 [2022-03-15 19:05:07,949 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 414 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 1989 mSolverCounterSat, 269 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 414 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 269 IncrementalHoareTripleChecker+Valid, 1989 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-03-15 19:05:07,949 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [414 Valid, 0 Invalid, 2258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [269 Valid, 1989 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-03-15 19:05:07,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1015 states. [2022-03-15 19:05:07,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1015 to 379. [2022-03-15 19:05:07,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 379 states, 378 states have (on average 3.013227513227513) internal successors, (1139), 378 states have internal predecessors, (1139), 0 states have call successors, (0), 0 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:05:07,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 1139 transitions. [2022-03-15 19:05:07,971 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 1139 transitions. Word has length 20 [2022-03-15 19:05:07,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:05:07,972 INFO L470 AbstractCegarLoop]: Abstraction has 379 states and 1139 transitions. [2022-03-15 19:05:07,972 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 2.8181818181818183) internal successors, (62), 22 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:05:07,972 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 1139 transitions. [2022-03-15 19:05:07,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-03-15 19:05:07,973 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:05:07,973 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:05:07,993 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:05:08,191 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,SelfDestructingSolverStorable23 [2022-03-15 19:05:08,192 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:05:08,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:05:08,192 INFO L85 PathProgramCache]: Analyzing trace with hash 1396550696, now seen corresponding path program 4 times [2022-03-15 19:05:08,193 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:05:08,193 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657905441] [2022-03-15 19:05:08,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:05:08,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:05:08,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:05:08,577 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:05:08,577 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:05:08,577 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657905441] [2022-03-15 19:05:08,577 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1657905441] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:05:08,577 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [25718929] [2022-03-15 19:05:08,577 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 19:05:08,577 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:05:08,577 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:05:08,578 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:05:08,579 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:05:08,678 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 19:05:08,679 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:05:08,681 INFO L263 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 85 conjunts are in the unsatisfiable core [2022-03-15 19:05:08,682 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:05:09,150 INFO L353 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-03-15 19:05:09,150 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 123 treesize of output 65 [2022-03-15 19:05:09,307 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:05:09,307 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:05:10,000 INFO L353 Elim1Store]: treesize reduction 91, result has 9.0 percent of original size [2022-03-15 19:05:10,000 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 506 treesize of output 326 [2022-03-15 19:05:10,234 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 19:05:10,235 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [25718929] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:05:10,235 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:05:10,235 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 9] total 29 [2022-03-15 19:05:10,235 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [693943328] [2022-03-15 19:05:10,235 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:05:10,237 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:05:10,248 INFO L252 McrAutomatonBuilder]: Finished intersection with 62 states and 114 transitions. [2022-03-15 19:05:10,249 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:05:15,816 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 11 new interpolants: [27209#(and (or (< 2147483647 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))))) (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4))) (+ ~bag1~0 ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (< (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) 2147483648) 0)) (or (< 2147483647 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))))) (< (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) 2147483648) 0) (<= (+ ~bag1~0 ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4))))) (or (< 2147483647 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))))) (= ~A~0.offset 0) (< (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) 2147483648) 0))), 27210#(and (or (< (+ ~bag1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) 2147483648) 0) (<= (+ ~bag1~0 ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (+ ~bag2~0 ~sum2~0)) (< 2147483647 (+ ~bag1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))) (or (<= (+ ~bag2~0 ~sum2~0) (+ ~bag1~0 ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (< (+ ~bag1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) 2147483648) 0) (< 2147483647 (+ ~bag1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))) (or (= ~A~0.offset 0) (< (+ ~bag1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) 2147483648) 0) (< 2147483647 (+ ~bag1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))))), 27205#(and (or (< (+ ~bag1~0 ~sum1~0 2147483648) 0) (< (+ ~bag1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) 2147483648) 0) (<= ~sum2~0 (+ ~bag1~0 ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (< 2147483647 (+ ~bag1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (< 2147483647 (+ ~bag1~0 ~sum1~0))) (or (< (+ ~bag1~0 ~sum1~0 2147483648) 0) (< (+ ~bag1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) 2147483648) 0) (<= (+ ~bag1~0 ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) ~sum2~0) (< 2147483647 (+ ~bag1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (< 2147483647 (+ ~bag1~0 ~sum1~0)))), 27211#(and (or (< (+ ~bag1~0 ~sum1~0 2147483648) 0) (= ~A~0.offset 0) (< 2147483647 (+ (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (< (+ (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) 2147483648) 0) (< 2147483647 (+ ~bag1~0 ~sum1~0))) (or (< (+ ~bag1~0 ~sum1~0 2147483648) 0) (< 2147483647 (+ (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (< (+ (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) 2147483648) 0) (<= (+ ~bag2~0 ~sum2~0) (+ ~bag1~0 ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (< 2147483647 (+ ~bag1~0 ~sum1~0))) (or (< (+ ~bag1~0 ~sum1~0 2147483648) 0) (< 2147483647 (+ (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (<= (+ ~bag1~0 ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (+ ~bag2~0 ~sum2~0)) (< (+ (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) 2147483648) 0) (< 2147483647 (+ ~bag1~0 ~sum1~0)))), 27204#(and (or (< (+ ~bag1~0 ~sum1~0 2147483648) 0) (<= ~sum2~0 (+ ~bag1~0 ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (< 2147483647 (+ ~bag1~0 ~sum1~0))) (or (< (+ ~bag1~0 ~sum1~0 2147483648) 0) (<= (+ ~bag1~0 ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) ~sum2~0) (< 2147483647 (+ ~bag1~0 ~sum1~0)))), 27208#(and (or (< 2147483647 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))))) (< (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) 2147483648) 0) (< (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)) 2147483648) 0) (< (+ ~bag2~0 ~sum2~0 2147483648) 0) (< 2147483647 (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)))) (< 2147483647 (+ ~bag2~0 ~sum2~0)) (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4))) (+ ~bag1~0 ~sum1~0))) (or (< 2147483647 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))))) (< (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) 2147483648) 0) (< (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)) 2147483648) 0) (< 2147483647 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)))) (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4))) (+ ~bag1~0 ~sum1~0))) (or (< 2147483647 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))))) (< (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) 2147483648) 0) (< (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)) 2147483648) 0) (< (+ ~bag2~0 ~sum2~0 2147483648) 0) (<= (+ ~bag1~0 ~sum1~0) (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)))) (< 2147483647 (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)))) (< 2147483647 (+ ~bag2~0 ~sum2~0))) (or (< 2147483647 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))))) (< (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) 2147483648) 0) (< (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)) 2147483648) 0) (<= (+ ~bag1~0 ~sum1~0) (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)))) (< 2147483647 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)))))), 27203#(and (or (< 2147483647 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))))) (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4))) ~sum1~0) (< 2147483647 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)))) (< (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)) 2147483648) 0) (< (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) 2147483648) 0) (< (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)) 2147483648) 0) (< (+ ~bag2~0 ~sum2~0 2147483648) 0) (< 2147483647 (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)))) (< 2147483647 (+ ~bag2~0 ~sum2~0))) (or (< 2147483647 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))))) (< 2147483647 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)))) (< (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)) 2147483648) 0) (< (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) 2147483648) 0) (< ~sum1~0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)) 1)) (< (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)) 2147483648) 0) (< 2147483647 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4))))) (or (< 2147483647 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))))) (< 2147483647 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)))) (< (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)) 2147483648) 0) (< (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) 2147483648) 0) (< (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)) 2147483648) 0) (< ~sum1~0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)) 1)) (< (+ ~bag2~0 ~sum2~0 2147483648) 0) (< 2147483647 (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)))) (< 2147483647 (+ ~bag2~0 ~sum2~0))) (or (< 2147483647 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))))) (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4))) ~sum1~0) (< 2147483647 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)))) (< (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)) 2147483648) 0) (< (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) 2147483648) 0) (< (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)) 2147483648) 0) (< 2147483647 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)))))), 27201#(and (or (< ~sum1~0 (+ ~bag2~0 ~sum2~0 1)) (< (+ ~bag2~0 ~sum2~0 2147483648) 0) (< 2147483647 (+ ~bag2~0 ~sum2~0))) (or (not (<= (+ ~bag2~0 ~sum2~0) 2147483647)) (<= (+ ~bag2~0 ~sum2~0) ~sum1~0) (not (<= 0 (+ ~bag2~0 ~sum2~0 2147483648))))), 27202#(and (or (< 2147483647 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))))) (< 2147483647 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0)) (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0) ~sum1~0) (< (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) 2147483648) 0) (< (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 2147483648) 0)) (or (< 2147483647 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))))) (< 2147483647 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0)) (< (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) 2147483648) 0) (< ~sum1~0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 1)) (< (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 2147483648) 0))), 27207#(and (or (< 2147483647 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))))) (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0) (+ ~bag1~0 ~sum1~0)) (< (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) 2147483648) 0)) (or (< 2147483647 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))))) (<= (+ ~bag1~0 ~sum1~0) (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0)) (< (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) 2147483648) 0))), 27206#(and (or (< (+ ~bag1~0 ~sum1~0 2147483648) 0) (< (+ ~bag1~0 ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) 2147483648) 0) (< 2147483647 (+ (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (< (+ (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) 2147483648) 0) (< 2147483647 (+ ~bag1~0 ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (< 2147483647 (+ ~bag1~0 ~sum1~0)) (<= (+ ~bag1~0 ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) ~sum2~0)) (or (< (+ ~bag1~0 ~sum1~0 2147483648) 0) (< (+ ~bag1~0 ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) 2147483648) 0) (< 2147483647 (+ (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (<= ~sum2~0 (+ ~bag1~0 ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (< (+ (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) 2147483648) 0) (< 2147483647 (+ ~bag1~0 ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (< 2147483647 (+ ~bag1~0 ~sum1~0))))] [2022-03-15 19:05:15,816 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-03-15 19:05:15,816 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:05:15,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-03-15 19:05:15,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=1477, Unknown=0, NotChecked=0, Total=1640 [2022-03-15 19:05:15,817 INFO L87 Difference]: Start difference. First operand 379 states and 1139 transitions. Second operand has 24 states, 23 states have (on average 3.0) internal successors, (69), 23 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:05:17,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:05:17,834 INFO L93 Difference]: Finished difference Result 682 states and 1975 transitions. [2022-03-15 19:05:17,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-03-15 19:05:17,834 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 3.0) internal successors, (69), 23 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 20 [2022-03-15 19:05:17,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:05:17,837 INFO L225 Difference]: With dead ends: 682 [2022-03-15 19:05:17,837 INFO L226 Difference]: Without dead ends: 677 [2022-03-15 19:05:17,838 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 50 SyntacticMatches, 2 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 738 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=317, Invalid=3465, Unknown=0, NotChecked=0, Total=3782 [2022-03-15 19:05:17,839 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 135 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 1637 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1708 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 1637 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-03-15 19:05:17,839 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [135 Valid, 0 Invalid, 1708 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 1637 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-03-15 19:05:17,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 677 states. [2022-03-15 19:05:17,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 677 to 402. [2022-03-15 19:05:17,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 402 states, 401 states have (on average 3.0124688279301743) internal successors, (1208), 401 states have internal predecessors, (1208), 0 states have call successors, (0), 0 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:05:17,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 1208 transitions. [2022-03-15 19:05:17,847 INFO L78 Accepts]: Start accepts. Automaton has 402 states and 1208 transitions. Word has length 20 [2022-03-15 19:05:17,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:05:17,847 INFO L470 AbstractCegarLoop]: Abstraction has 402 states and 1208 transitions. [2022-03-15 19:05:17,847 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 3.0) internal successors, (69), 23 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:05:17,848 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 1208 transitions. [2022-03-15 19:05:17,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-03-15 19:05:17,848 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:05:17,848 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:05:17,867 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:05:18,065 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,SelfDestructingSolverStorable24 [2022-03-15 19:05:18,065 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:05:18,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:05:18,066 INFO L85 PathProgramCache]: Analyzing trace with hash 2104831413, now seen corresponding path program 4 times [2022-03-15 19:05:18,066 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:05:18,066 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261250602] [2022-03-15 19:05:18,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:05:18,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:05:18,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:05:18,787 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:05:18,787 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:05:18,787 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261250602] [2022-03-15 19:05:18,787 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1261250602] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:05:18,787 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1746804547] [2022-03-15 19:05:18,787 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 19:05:18,787 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:05:18,787 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:05:18,788 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:05:18,789 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:05:18,888 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 19:05:18,888 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:05:18,891 INFO L263 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 104 conjunts are in the unsatisfiable core [2022-03-15 19:05:18,892 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:05:19,106 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:05:19,110 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 20 treesize of output 22 [2022-03-15 19:05:19,784 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:05:19,784 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 26 [2022-03-15 19:05:19,877 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:05:19,877 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:05:21,519 INFO L353 Elim1Store]: treesize reduction 94, result has 8.7 percent of original size [2022-03-15 19:05:21,520 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 1175 treesize of output 820 [2022-03-15 19:05:21,543 INFO L353 Elim1Store]: treesize reduction 94, result has 8.7 percent of original size [2022-03-15 19:05:21,543 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 780 treesize of output 511 [2022-03-15 19:05:22,463 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 19:05:22,463 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1746804547] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:05:22,463 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:05:22,463 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 11] total 36 [2022-03-15 19:05:22,463 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [49924905] [2022-03-15 19:05:22,463 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:05:22,466 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:05:22,477 INFO L252 McrAutomatonBuilder]: Finished intersection with 62 states and 114 transitions. [2022-03-15 19:05:22,477 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:05:45,553 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 12 new interpolants: [28894#(and (or (< 2147483647 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))))) (not (<= (+ ~bag2~0 ~sum2~0) 2147483647)) (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4))) ~sum1~0) (< (+ 2 ~j~0) ~N~0) (not (<= 0 (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)) 2147483648))) (<= ~N~0 (+ ~j~0 1)) (< (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4)))) ~cap2~0) (not (<= 0 (+ ~bag2~0 ~sum2~0 2147483648))) (not (<= 0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)) 2147483648))) (<= ~cap2~0 (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)))) (not (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4))) 2147483647))) (or (< (+ 2 ~j~0) ~N~0) (<= ~N~0 (+ ~j~0 1)) (not (<= 0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) 2147483648))) (<= ~cap2~0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))))) (< ~sum1~0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)) 1)) (< (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)) 2147483648) 0) (not (<= 0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)) 2147483648))) (< 2147483647 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)))) (not (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4))) 2147483647)) (not (<= 0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 2147483648))) (not (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4)))) 2147483647))) (or (< 2147483647 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))))) (not (<= (+ ~bag2~0 ~sum2~0) 2147483647)) (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4))) ~sum1~0) (< (+ 2 ~j~0) ~N~0) (<= ~N~0 (+ ~j~0 1)) (< (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4)))) ~cap2~0) (not (<= 0 (+ ~bag2~0 ~sum2~0 2147483648))) (< (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) 2147483648) 0) (< (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)) 2147483648) 0) (not (<= 0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)) 2147483648))) (< 2147483647 (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)))) (not (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0) 2147483647)) (not (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4))) 2147483647)) (not (<= 0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 2147483648)))) (or (< (+ 2 ~j~0) ~N~0) (<= ~N~0 (+ ~j~0 1)) (not (<= 0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) 2147483648))) (not (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4))) 2147483647)) (<= ~cap2~0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))))) (< ~sum1~0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)) 1)) (not (<= 0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)) 2147483648))) (<= ~cap2~0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)))) (not (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4))) 2147483647)) (not (<= 0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)) 2147483648))) (not (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4)))) 2147483647))) (or (< 2147483647 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))))) (not (<= (+ ~bag2~0 ~sum2~0) 2147483647)) (< (+ 2 ~j~0) ~N~0) (not (<= 0 (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)) 2147483648))) (<= ~N~0 (+ ~j~0 1)) (< (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4)))) ~cap2~0) (not (<= 0 (+ ~bag2~0 ~sum2~0 2147483648))) (< ~sum1~0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)) 1)) (not (<= 0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)) 2147483648))) (<= ~cap2~0 (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)))) (not (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4))) 2147483647))) (or (< 2147483647 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))))) (not (<= (+ ~bag2~0 ~sum2~0) 2147483647)) (< (+ 2 ~j~0) ~N~0) (<= ~N~0 (+ ~j~0 1)) (< (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4)))) ~cap2~0) (not (<= 0 (+ ~bag2~0 ~sum2~0 2147483648))) (< (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) 2147483648) 0) (< (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)) 2147483648) 0) (< ~sum1~0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)) 1)) (not (<= 0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)) 2147483648))) (< 2147483647 (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)))) (not (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0) 2147483647)) (not (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4))) 2147483647)) (not (<= 0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 2147483648)))) (or (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4))) ~sum1~0) (< (+ 2 ~j~0) ~N~0) (<= ~N~0 (+ ~j~0 1)) (not (<= 0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) 2147483648))) (<= ~cap2~0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))))) (< (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)) 2147483648) 0) (not (<= 0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)) 2147483648))) (< 2147483647 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)))) (not (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4))) 2147483647)) (not (<= 0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 2147483648))) (not (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4)))) 2147483647))) (or (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4))) ~sum1~0) (< (+ 2 ~j~0) ~N~0) (<= ~N~0 (+ ~j~0 1)) (not (<= 0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) 2147483648))) (not (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4))) 2147483647)) (<= ~cap2~0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))))) (not (<= 0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)) 2147483648))) (<= ~cap2~0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)))) (not (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4))) 2147483647)) (not (<= 0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)) 2147483648))) (not (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4)))) 2147483647)))), 28901#(and (or (<= (* ~N~0 4) (+ (* ~i~0 4) 3 ~A~0.offset)) (not (<= 0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) 2147483648))) (<= ~cap2~0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))))) (<= (+ ~cap1~0 1) (+ ~bag1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (<= (+ 5 ~A~0.offset (* ~j~0 4)) (* ~N~0 4)) (<= ~N~0 ~j~0) (<= (+ ~bag1~0 ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0)) (not (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4)))) 2147483647))) (or (<= (* ~N~0 4) (+ (* ~i~0 4) 3 ~A~0.offset)) (not (<= 0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) 2147483648))) (<= ~cap2~0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))))) (<= (+ ~cap1~0 1) (+ ~bag1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (<= (+ 5 ~A~0.offset (* ~j~0 4)) (* ~N~0 4)) (<= ~N~0 ~j~0) (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0) (+ ~bag1~0 ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (not (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4)))) 2147483647))) (or (= ~A~0.offset 0) (not (<= 0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) 2147483648))) (<= ~cap2~0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))))) (<= ~N~0 ~j~0) (not (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4)))) 2147483647))) (or (< 2147483647 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))))) (not (<= (+ ~bag2~0 ~sum2~0) 2147483647)) (<= (* ~N~0 4) (+ (* ~i~0 4) 3 ~A~0.offset)) (not (<= 0 (+ ~bag2~0 ~sum2~0 2147483648))) (< (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) 2147483648) 0) (<= (+ ~cap1~0 1) (+ ~bag1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (<= (+ 5 ~A~0.offset (* ~j~0 4)) (* ~N~0 4)) (<= ~N~0 ~j~0) (<= (+ ~bag1~0 ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0))) (or (< 2147483647 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))))) (not (<= (+ ~bag2~0 ~sum2~0) 2147483647)) (<= (* ~N~0 4) (+ (* ~i~0 4) 3 ~A~0.offset)) (not (<= 0 (+ ~bag2~0 ~sum2~0 2147483648))) (< (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) 2147483648) 0) (<= (+ ~cap1~0 1) (+ ~bag1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (<= (+ 5 ~A~0.offset (* ~j~0 4)) (* ~N~0 4)) (<= ~N~0 ~j~0) (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0) (+ ~bag1~0 ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))) (or (< 2147483647 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))))) (not (<= (+ ~bag2~0 ~sum2~0) 2147483647)) (= ~A~0.offset 0) (not (<= 0 (+ ~bag2~0 ~sum2~0 2147483648))) (< (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) 2147483648) 0) (<= ~N~0 ~j~0))), 28900#(and (or (< (+ ~bag1~0 ~sum1~0 2147483648) 0) (not (<= 0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset 4)))) (<= ~sum2~0 (+ ~bag1~0 ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (not (< (+ ~i~0 1) ~N~0)) (<= (+ ~cap1~0 1) (+ (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (< 2147483647 (+ ~bag1~0 ~sum1~0))) (or (< (+ ~bag1~0 ~sum1~0 2147483648) 0) (not (<= 0 (+ (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) 2147483648))) (<= ~sum2~0 (+ ~bag1~0 ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (not (< (+ ~i~0 1) ~N~0)) (<= (+ ~cap1~0 1) (+ (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (< 2147483647 (+ ~bag1~0 ~sum1~0))) (or (< (+ ~bag1~0 ~sum1~0 2147483648) 0) (= ~A~0.offset 0) (not (<= 0 (+ (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) 2147483648))) (not (< (+ ~i~0 1) ~N~0)) (< 2147483647 (+ ~bag1~0 ~sum1~0))) (or (< (+ ~bag1~0 ~sum1~0 2147483648) 0) (= ~A~0.offset 0) (not (<= 0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset 4)))) (not (< (+ ~i~0 1) ~N~0)) (< 2147483647 (+ ~bag1~0 ~sum1~0))) (or (< (+ ~bag1~0 ~sum1~0 2147483648) 0) (not (<= 0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset 4)))) (not (< (+ ~i~0 1) ~N~0)) (<= (+ ~cap1~0 1) (+ (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (< 2147483647 (+ ~bag1~0 ~sum1~0)) (<= (+ ~bag1~0 ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) ~sum2~0)) (or (< (+ ~bag1~0 ~sum1~0 2147483648) 0) (not (<= 0 (+ (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) 2147483648))) (not (< (+ ~i~0 1) ~N~0)) (<= (+ ~cap1~0 1) (+ (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (< 2147483647 (+ ~bag1~0 ~sum1~0)) (<= (+ ~bag1~0 ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) ~sum2~0))), 28899#(and (or (not (<= 0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (<= (+ ~bag1~0 ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) ~sum2~0) (<= (+ ~cap1~0 1) (+ ~bag1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (not (< ~i~0 ~N~0))) (or (not (<= 0 (+ ~bag1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) 2147483648))) (<= ~sum2~0 (+ ~bag1~0 ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (<= (+ ~cap1~0 1) (+ ~bag1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (not (< ~i~0 ~N~0))) (or (not (<= 0 (+ ~bag1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) 2147483648))) (<= (+ ~bag1~0 ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) ~sum2~0) (<= (+ ~cap1~0 1) (+ ~bag1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (not (< ~i~0 ~N~0))) (or (not (<= 0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (<= ~sum2~0 (+ ~bag1~0 ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (<= (+ ~cap1~0 1) (+ ~bag1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (not (< ~i~0 ~N~0))) (or (= ~A~0.offset 0) (not (<= 0 (+ ~bag1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) 2147483648))) (not (< ~i~0 ~N~0))) (or (= ~A~0.offset 0) (not (<= 0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (not (< ~i~0 ~N~0)))), 28892#(and (or (not (<= (+ ~bag2~0 ~sum2~0) 2147483647)) (not (<= 0 (+ ~bag2~0 ~sum2~0 2147483648))) (<= (+ ~bag1~0 ~sum1~0) (+ ~bag2~0 ~sum2~0)) (< ~j~0 ~N~0)) (or (not (<= (+ ~bag2~0 ~sum2~0) 2147483647)) (not (<= 0 (+ ~bag2~0 ~sum2~0 2147483648))) (<= (+ ~bag2~0 ~sum2~0) (+ ~bag1~0 ~sum1~0)) (< ~j~0 ~N~0))), 28896#(and (or (< 2147483647 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))))) (not (<= (+ ~bag2~0 ~sum2~0) 2147483647)) (< (+ 2 ~j~0) ~N~0) (not (<= 0 (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)) 2147483648))) (<= ~N~0 (+ ~j~0 1)) (< (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4)))) ~cap2~0) (not (<= 0 (+ ~bag2~0 ~sum2~0 2147483648))) (not (<= 0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)) 2147483648))) (<= (+ ~bag1~0 ~sum1~0) (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)))) (<= ~cap2~0 (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)))) (not (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4))) 2147483647))) (or (< 2147483647 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))))) (not (<= (+ ~bag2~0 ~sum2~0) 2147483647)) (< (+ 2 ~j~0) ~N~0) (not (<= 0 (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)) 2147483648))) (<= ~N~0 (+ ~j~0 1)) (< (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4)))) ~cap2~0) (not (<= 0 (+ ~bag2~0 ~sum2~0 2147483648))) (not (<= 0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)) 2147483648))) (<= ~cap2~0 (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)))) (not (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4))) 2147483647)) (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4))) (+ ~bag1~0 ~sum1~0))) (or (< (+ 2 ~j~0) ~N~0) (<= ~N~0 (+ ~j~0 1)) (not (<= 0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) 2147483648))) (not (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4))) 2147483647)) (<= ~cap2~0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))))) (not (<= 0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)) 2147483648))) (<= ~cap2~0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)))) (<= (+ ~bag1~0 ~sum1~0) (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)))) (not (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4))) 2147483647)) (not (<= 0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)) 2147483648))) (not (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4)))) 2147483647))) (or (< 2147483647 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))))) (not (<= (+ ~bag2~0 ~sum2~0) 2147483647)) (< (+ 2 ~j~0) ~N~0) (<= ~N~0 (+ ~j~0 1)) (< (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4)))) ~cap2~0) (not (<= 0 (+ ~bag2~0 ~sum2~0 2147483648))) (< (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) 2147483648) 0) (< (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)) 2147483648) 0) (not (<= 0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)) 2147483648))) (<= (+ ~bag1~0 ~sum1~0) (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)))) (< 2147483647 (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)))) (not (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0) 2147483647)) (not (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4))) 2147483647)) (not (<= 0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 2147483648)))) (or (< (+ 2 ~j~0) ~N~0) (<= ~N~0 (+ ~j~0 1)) (not (<= 0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) 2147483648))) (<= ~cap2~0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))))) (< (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)) 2147483648) 0) (not (<= 0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)) 2147483648))) (< 2147483647 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)))) (not (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4))) 2147483647)) (not (<= 0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 2147483648))) (not (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4)))) 2147483647)) (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4))) (+ ~bag1~0 ~sum1~0))) (or (< (+ 2 ~j~0) ~N~0) (<= ~N~0 (+ ~j~0 1)) (not (<= 0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) 2147483648))) (<= ~cap2~0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))))) (< (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)) 2147483648) 0) (not (<= 0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)) 2147483648))) (<= (+ ~bag1~0 ~sum1~0) (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)))) (< 2147483647 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)))) (not (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4))) 2147483647)) (not (<= 0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 2147483648))) (not (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4)))) 2147483647))) (or (< (+ 2 ~j~0) ~N~0) (<= ~N~0 (+ ~j~0 1)) (not (<= 0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) 2147483648))) (not (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4))) 2147483647)) (<= ~cap2~0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))))) (not (<= 0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)) 2147483648))) (<= ~cap2~0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)))) (not (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4))) 2147483647)) (not (<= 0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)) 2147483648))) (not (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4)))) 2147483647)) (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4))) (+ ~bag1~0 ~sum1~0))) (or (< 2147483647 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))))) (not (<= (+ ~bag2~0 ~sum2~0) 2147483647)) (< (+ 2 ~j~0) ~N~0) (<= ~N~0 (+ ~j~0 1)) (< (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4)))) ~cap2~0) (not (<= 0 (+ ~bag2~0 ~sum2~0 2147483648))) (< (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) 2147483648) 0) (< (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)) 2147483648) 0) (not (<= 0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)) 2147483648))) (< 2147483647 (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)))) (not (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0) 2147483647)) (not (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4))) 2147483647)) (not (<= 0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 2147483648))) (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4))) (+ ~bag1~0 ~sum1~0)))), 28898#(and (or (< 2147483647 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))))) (not (<= (+ ~bag2~0 ~sum2~0) 2147483647)) (= ~A~0.offset 0) (<= ~N~0 (+ ~j~0 1)) (< (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4)))) ~cap2~0) (not (<= 0 (+ ~bag2~0 ~sum2~0 2147483648))) (< (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) 2147483648) 0) (< (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)) 2147483648) 0) (< 2147483647 (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)))) (not (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0) 2147483647)) (not (<= 0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 2147483648)))) (or (= ~A~0.offset 0) (<= ~N~0 (+ ~j~0 1)) (not (<= 0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) 2147483648))) (not (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4))) 2147483647)) (<= ~cap2~0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))))) (<= ~cap2~0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)))) (not (<= 0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)) 2147483648))) (not (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4)))) 2147483647))) (or (< 2147483647 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))))) (not (<= (+ ~bag2~0 ~sum2~0) 2147483647)) (not (<= 0 (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)) 2147483648))) (<= ~N~0 (+ ~j~0 1)) (< (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4)))) ~cap2~0) (not (<= 0 (+ ~bag2~0 ~sum2~0 2147483648))) (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4))) (+ ~sum1~0 |thread1Thread1of1ForFork0_plus_~b#1| |thread1Thread1of1ForFork0_plus_~a#1|)) (<= (+ ~cap1~0 1) (+ |thread1Thread1of1ForFork0_plus_~b#1| |thread1Thread1of1ForFork0_plus_~a#1|)) (<= ~cap2~0 (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)))) (<= (+ 9 ~A~0.offset (* ~j~0 4)) (* ~N~0 4))) (or (< 2147483647 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))))) (not (<= (+ ~bag2~0 ~sum2~0) 2147483647)) (= ~bag1~0 |thread1Thread1of1ForFork0_plus_~a#1|) (<= ~N~0 (+ ~j~0 1)) (< (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4)))) ~cap2~0) (not (<= 0 (+ ~bag2~0 ~sum2~0 2147483648))) (< (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) 2147483648) 0) (< (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)) 2147483648) 0) (< 2147483647 (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)))) (not (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0) 2147483647)) (not (<= 0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 2147483648)))) (or (<= ~N~0 (+ ~j~0 1)) (not (<= 0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) 2147483648))) (not (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4))) 2147483647)) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) |thread1Thread1of1ForFork0_plus_~b#1|) (<= ~cap2~0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))))) (<= ~cap2~0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)))) (not (<= 0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)) 2147483648))) (not (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4)))) 2147483647))) (or (< 2147483647 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))))) (not (<= (+ ~bag2~0 ~sum2~0) 2147483647)) (<= ~N~0 (+ ~j~0 1)) (< (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4)))) ~cap2~0) (not (<= 0 (+ ~bag2~0 ~sum2~0 2147483648))) (< (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) 2147483648) 0) (< (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)) 2147483648) 0) (<= (+ ~sum1~0 |thread1Thread1of1ForFork0_plus_~b#1| |thread1Thread1of1ForFork0_plus_~a#1|) (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)))) (<= (+ ~cap1~0 1) (+ |thread1Thread1of1ForFork0_plus_~b#1| |thread1Thread1of1ForFork0_plus_~a#1|)) (< 2147483647 (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)))) (not (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0) 2147483647)) (not (<= 0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 2147483648))) (<= (+ 9 ~A~0.offset (* ~j~0 4)) (* ~N~0 4))) (or (< 2147483647 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))))) (not (<= (+ ~bag2~0 ~sum2~0) 2147483647)) (not (<= 0 (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)) 2147483648))) (<= ~N~0 (+ ~j~0 1)) (< (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4)))) ~cap2~0) (not (<= 0 (+ ~bag2~0 ~sum2~0 2147483648))) (<= (+ ~sum1~0 |thread1Thread1of1ForFork0_plus_~b#1| |thread1Thread1of1ForFork0_plus_~a#1|) (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)))) (<= (+ ~cap1~0 1) (+ |thread1Thread1of1ForFork0_plus_~b#1| |thread1Thread1of1ForFork0_plus_~a#1|)) (<= ~cap2~0 (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)))) (<= (+ 9 ~A~0.offset (* ~j~0 4)) (* ~N~0 4))) (or (<= ~N~0 (+ ~j~0 1)) (not (<= 0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) 2147483648))) (<= (+ ~sum1~0 |thread1Thread1of1ForFork0_plus_~b#1| |thread1Thread1of1ForFork0_plus_~a#1|) (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)))) (<= ~cap2~0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))))) (< (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)) 2147483648) 0) (<= (+ ~cap1~0 1) (+ |thread1Thread1of1ForFork0_plus_~b#1| |thread1Thread1of1ForFork0_plus_~a#1|)) (< 2147483647 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)))) (not (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0) 2147483647)) (not (<= 0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 2147483648))) (not (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4)))) 2147483647)) (<= (+ 9 ~A~0.offset (* ~j~0 4)) (* ~N~0 4))) (or (<= ~N~0 (+ ~j~0 1)) (not (<= 0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) 2147483648))) (not (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4))) 2147483647)) (<= (+ ~sum1~0 |thread1Thread1of1ForFork0_plus_~b#1| |thread1Thread1of1ForFork0_plus_~a#1|) (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)))) (<= ~cap2~0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))))) (<= ~cap2~0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)))) (<= (+ ~cap1~0 1) (+ |thread1Thread1of1ForFork0_plus_~b#1| |thread1Thread1of1ForFork0_plus_~a#1|)) (not (<= 0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)) 2147483648))) (not (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4)))) 2147483647)) (<= (+ 9 ~A~0.offset (* ~j~0 4)) (* ~N~0 4))) (or (<= ~N~0 (+ ~j~0 1)) (not (<= 0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) 2147483648))) (not (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4))) 2147483647)) (<= ~cap2~0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))))) (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4))) (+ ~sum1~0 |thread1Thread1of1ForFork0_plus_~b#1| |thread1Thread1of1ForFork0_plus_~a#1|)) (<= ~cap2~0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)))) (<= (+ ~cap1~0 1) (+ |thread1Thread1of1ForFork0_plus_~b#1| |thread1Thread1of1ForFork0_plus_~a#1|)) (not (<= 0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)) 2147483648))) (not (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4)))) 2147483647)) (<= (+ 9 ~A~0.offset (* ~j~0 4)) (* ~N~0 4))) (or (< 2147483647 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))))) (not (<= (+ ~bag2~0 ~sum2~0) 2147483647)) (<= ~N~0 (+ ~j~0 1)) (< (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4)))) ~cap2~0) (not (<= 0 (+ ~bag2~0 ~sum2~0 2147483648))) (< (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) 2147483648) 0) (< (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)) 2147483648) 0) (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4))) (+ ~sum1~0 |thread1Thread1of1ForFork0_plus_~b#1| |thread1Thread1of1ForFork0_plus_~a#1|)) (<= (+ ~cap1~0 1) (+ |thread1Thread1of1ForFork0_plus_~b#1| |thread1Thread1of1ForFork0_plus_~a#1|)) (< 2147483647 (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)))) (not (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0) 2147483647)) (not (<= 0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 2147483648))) (<= (+ 9 ~A~0.offset (* ~j~0 4)) (* ~N~0 4))) (or (< 2147483647 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))))) (not (<= (+ ~bag2~0 ~sum2~0) 2147483647)) (= ~A~0.offset 0) (not (<= 0 (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)) 2147483648))) (<= ~N~0 (+ ~j~0 1)) (< (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4)))) ~cap2~0) (not (<= 0 (+ ~bag2~0 ~sum2~0 2147483648))) (<= ~cap2~0 (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4))))) (or (<= ~N~0 (+ ~j~0 1)) (not (<= 0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) 2147483648))) (<= ~cap2~0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))))) (< (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)) 2147483648) 0) (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4))) (+ ~sum1~0 |thread1Thread1of1ForFork0_plus_~b#1| |thread1Thread1of1ForFork0_plus_~a#1|)) (<= (+ ~cap1~0 1) (+ |thread1Thread1of1ForFork0_plus_~b#1| |thread1Thread1of1ForFork0_plus_~a#1|)) (< 2147483647 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)))) (not (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0) 2147483647)) (not (<= 0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 2147483648))) (not (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4)))) 2147483647)) (<= (+ 9 ~A~0.offset (* ~j~0 4)) (* ~N~0 4))) (or (<= ~N~0 (+ ~j~0 1)) (not (<= 0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) 2147483648))) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) |thread1Thread1of1ForFork0_plus_~b#1|) (<= ~cap2~0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))))) (< (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)) 2147483648) 0) (< 2147483647 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)))) (not (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0) 2147483647)) (not (<= 0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 2147483648))) (not (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4)))) 2147483647))) (or (= ~A~0.offset 0) (<= ~N~0 (+ ~j~0 1)) (not (<= 0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) 2147483648))) (<= ~cap2~0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))))) (< (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)) 2147483648) 0) (< 2147483647 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)))) (not (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0) 2147483647)) (not (<= 0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 2147483648))) (not (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4)))) 2147483647))) (or (< 2147483647 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))))) (not (<= (+ ~bag2~0 ~sum2~0) 2147483647)) (not (<= 0 (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)) 2147483648))) (<= ~N~0 (+ ~j~0 1)) (< (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4)))) ~cap2~0) (not (<= 0 (+ ~bag2~0 ~sum2~0 2147483648))) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) |thread1Thread1of1ForFork0_plus_~b#1|) (<= ~cap2~0 (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4))))) (or (= ~bag1~0 |thread1Thread1of1ForFork0_plus_~a#1|) (<= ~N~0 (+ ~j~0 1)) (not (<= 0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) 2147483648))) (not (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4))) 2147483647)) (<= ~cap2~0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))))) (<= ~cap2~0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)))) (not (<= 0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)) 2147483648))) (not (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4)))) 2147483647))) (or (< 2147483647 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))))) (not (<= (+ ~bag2~0 ~sum2~0) 2147483647)) (= ~bag1~0 |thread1Thread1of1ForFork0_plus_~a#1|) (not (<= 0 (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)) 2147483648))) (<= ~N~0 (+ ~j~0 1)) (< (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4)))) ~cap2~0) (not (<= 0 (+ ~bag2~0 ~sum2~0 2147483648))) (<= ~cap2~0 (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4))))) (or (= ~bag1~0 |thread1Thread1of1ForFork0_plus_~a#1|) (<= ~N~0 (+ ~j~0 1)) (not (<= 0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) 2147483648))) (<= ~cap2~0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))))) (< (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)) 2147483648) 0) (< 2147483647 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)))) (not (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0) 2147483647)) (not (<= 0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 2147483648))) (not (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4)))) 2147483647))) (or (< 2147483647 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))))) (not (<= (+ ~bag2~0 ~sum2~0) 2147483647)) (<= ~N~0 (+ ~j~0 1)) (< (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4)))) ~cap2~0) (not (<= 0 (+ ~bag2~0 ~sum2~0 2147483648))) (< (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) 2147483648) 0) (< (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)) 2147483648) 0) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) |thread1Thread1of1ForFork0_plus_~b#1|) (< 2147483647 (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)))) (not (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0) 2147483647)) (not (<= 0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 2147483648))))), 28893#(and (or (not (<= 0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) 2147483648))) (< ~sum1~0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 1)) (<= ~cap2~0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))))) (<= ~N~0 ~j~0) (< (+ ~j~0 1) ~N~0) (not (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0) 2147483647)) (not (<= 0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 2147483648))) (not (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4)))) 2147483647))) (or (not (<= 0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) 2147483648))) (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0) ~sum1~0) (<= ~cap2~0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))))) (<= ~N~0 ~j~0) (< (+ ~j~0 1) ~N~0) (not (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0) 2147483647)) (not (<= 0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 2147483648))) (not (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4)))) 2147483647))) (or (< 2147483647 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))))) (not (<= (+ ~bag2~0 ~sum2~0) 2147483647)) (not (<= 0 (+ ~bag2~0 ~sum2~0 2147483648))) (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0) ~sum1~0) (< (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) 2147483648) 0) (<= ~N~0 ~j~0) (< (+ ~j~0 1) ~N~0) (not (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0) 2147483647)) (not (<= 0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 2147483648)))) (or (< 2147483647 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))))) (not (<= (+ ~bag2~0 ~sum2~0) 2147483647)) (not (<= 0 (+ ~bag2~0 ~sum2~0 2147483648))) (< (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) 2147483648) 0) (< ~sum1~0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 1)) (<= ~N~0 ~j~0) (< (+ ~j~0 1) ~N~0) (not (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0) 2147483647)) (not (<= 0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 2147483648))))), 28902#(and (or (< 2147483647 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))))) (not (<= (+ ~bag2~0 ~sum2~0) 2147483647)) (= ~A~0.offset 0) (<= ~N~0 (+ ~j~0 1)) (< (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4)))) ~cap2~0) (not (<= 0 (+ ~bag2~0 ~sum2~0 2147483648))) (< (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) 2147483648) 0) (< (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)) 2147483648) 0) (< 2147483647 (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)))) (not (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0) 2147483647)) (not (<= 0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 2147483648)))) (or (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4))) (+ ~bag1~0 ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (<= ~N~0 (+ ~j~0 1)) (<= (* ~N~0 4) (+ (* ~i~0 4) 3 ~A~0.offset)) (not (<= 0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) 2147483648))) (<= ~cap2~0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))))) (< (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)) 2147483648) 0) (<= (+ ~cap1~0 1) (+ ~bag1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (< 2147483647 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)))) (not (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0) 2147483647)) (not (<= 0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 2147483648))) (not (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4)))) 2147483647)) (<= (+ 9 ~A~0.offset (* ~j~0 4)) (* ~N~0 4))) (or (<= ~N~0 (+ ~j~0 1)) (<= (* ~N~0 4) (+ (* ~i~0 4) 3 ~A~0.offset)) (not (<= 0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) 2147483648))) (<= ~cap2~0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))))) (< (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)) 2147483648) 0) (<= (+ ~cap1~0 1) (+ ~bag1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (<= (+ ~bag1~0 ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)))) (< 2147483647 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)))) (not (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0) 2147483647)) (not (<= 0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 2147483648))) (not (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4)))) 2147483647)) (<= (+ 9 ~A~0.offset (* ~j~0 4)) (* ~N~0 4))) (or (= ~A~0.offset 0) (<= ~N~0 (+ ~j~0 1)) (not (<= 0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) 2147483648))) (not (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4))) 2147483647)) (<= ~cap2~0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))))) (<= ~cap2~0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)))) (not (<= 0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)) 2147483648))) (not (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4)))) 2147483647))) (or (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4))) (+ ~bag1~0 ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (<= ~N~0 (+ ~j~0 1)) (<= (* ~N~0 4) (+ (* ~i~0 4) 3 ~A~0.offset)) (not (<= 0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) 2147483648))) (not (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4))) 2147483647)) (<= ~cap2~0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))))) (<= (+ ~cap1~0 1) (+ ~bag1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (<= ~cap2~0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)))) (not (<= 0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)) 2147483648))) (not (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4)))) 2147483647)) (<= (+ 9 ~A~0.offset (* ~j~0 4)) (* ~N~0 4))) (or (< 2147483647 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))))) (not (<= (+ ~bag2~0 ~sum2~0) 2147483647)) (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4))) (+ ~bag1~0 ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (<= ~N~0 (+ ~j~0 1)) (< (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4)))) ~cap2~0) (<= (* ~N~0 4) (+ (* ~i~0 4) 3 ~A~0.offset)) (not (<= 0 (+ ~bag2~0 ~sum2~0 2147483648))) (< (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) 2147483648) 0) (< (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)) 2147483648) 0) (<= (+ ~cap1~0 1) (+ ~bag1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (< 2147483647 (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)))) (not (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0) 2147483647)) (not (<= 0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 2147483648))) (<= (+ 9 ~A~0.offset (* ~j~0 4)) (* ~N~0 4))) (or (< 2147483647 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))))) (not (<= (+ ~bag2~0 ~sum2~0) 2147483647)) (= ~A~0.offset 0) (not (<= 0 (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)) 2147483648))) (<= ~N~0 (+ ~j~0 1)) (< (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4)))) ~cap2~0) (not (<= 0 (+ ~bag2~0 ~sum2~0 2147483648))) (<= ~cap2~0 (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4))))) (or (<= ~N~0 (+ ~j~0 1)) (<= (* ~N~0 4) (+ (* ~i~0 4) 3 ~A~0.offset)) (not (<= 0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) 2147483648))) (not (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4))) 2147483647)) (<= ~cap2~0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))))) (<= (+ ~cap1~0 1) (+ ~bag1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (<= (+ ~bag1~0 ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)))) (<= ~cap2~0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)))) (not (<= 0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)) 2147483648))) (not (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4)))) 2147483647)) (<= (+ 9 ~A~0.offset (* ~j~0 4)) (* ~N~0 4))) (or (< 2147483647 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))))) (not (<= (+ ~bag2~0 ~sum2~0) 2147483647)) (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4))) (+ ~bag1~0 ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (not (<= 0 (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)) 2147483648))) (<= ~N~0 (+ ~j~0 1)) (< (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4)))) ~cap2~0) (<= (* ~N~0 4) (+ (* ~i~0 4) 3 ~A~0.offset)) (not (<= 0 (+ ~bag2~0 ~sum2~0 2147483648))) (<= (+ ~cap1~0 1) (+ ~bag1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (<= ~cap2~0 (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)))) (<= (+ 9 ~A~0.offset (* ~j~0 4)) (* ~N~0 4))) (or (< 2147483647 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))))) (not (<= (+ ~bag2~0 ~sum2~0) 2147483647)) (not (<= 0 (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)) 2147483648))) (<= ~N~0 (+ ~j~0 1)) (< (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4)))) ~cap2~0) (<= (* ~N~0 4) (+ (* ~i~0 4) 3 ~A~0.offset)) (not (<= 0 (+ ~bag2~0 ~sum2~0 2147483648))) (<= (+ ~cap1~0 1) (+ ~bag1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (<= (+ ~bag1~0 ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)))) (<= ~cap2~0 (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)))) (<= (+ 9 ~A~0.offset (* ~j~0 4)) (* ~N~0 4))) (or (< 2147483647 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))))) (not (<= (+ ~bag2~0 ~sum2~0) 2147483647)) (<= ~N~0 (+ ~j~0 1)) (< (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4)))) ~cap2~0) (<= (* ~N~0 4) (+ (* ~i~0 4) 3 ~A~0.offset)) (not (<= 0 (+ ~bag2~0 ~sum2~0 2147483648))) (< (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) 2147483648) 0) (< (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)) 2147483648) 0) (<= (+ ~cap1~0 1) (+ ~bag1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (<= (+ ~bag1~0 ~sum1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)))) (< 2147483647 (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)))) (not (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0) 2147483647)) (not (<= 0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 2147483648))) (<= (+ 9 ~A~0.offset (* ~j~0 4)) (* ~N~0 4))) (or (= ~A~0.offset 0) (<= ~N~0 (+ ~j~0 1)) (not (<= 0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) 2147483648))) (<= ~cap2~0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))))) (< (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)) 2147483648) 0) (< 2147483647 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4) 4)))) (not (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0) 2147483647)) (not (<= 0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 2147483648))) (not (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4)))) 2147483647)))), 28891#(and (or (not (<= (+ ~bag2~0 ~sum2~0) 2147483647)) (< ~sum1~0 (+ ~bag2~0 ~sum2~0 1)) (not (<= 0 (+ ~bag2~0 ~sum2~0 2147483648))) (< ~j~0 ~N~0)) (or (not (<= (+ ~bag2~0 ~sum2~0) 2147483647)) (<= (+ ~bag2~0 ~sum2~0) ~sum1~0) (not (<= 0 (+ ~bag2~0 ~sum2~0 2147483648))) (< ~j~0 ~N~0))), 28897#(and (or (not (<= 0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) 2147483648))) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) |thread1Thread1of1ForFork0_plus_~b#1|) (<= ~cap2~0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))))) (<= ~N~0 ~j~0) (not (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4)))) 2147483647))) (or (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0) (+ ~sum1~0 |thread1Thread1of1ForFork0_plus_~b#1| |thread1Thread1of1ForFork0_plus_~a#1|)) (not (<= 0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) 2147483648))) (<= ~cap2~0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))))) (<= (+ 5 ~A~0.offset (* ~j~0 4)) (* ~N~0 4)) (<= (+ ~cap1~0 1) (+ |thread1Thread1of1ForFork0_plus_~b#1| |thread1Thread1of1ForFork0_plus_~a#1|)) (<= ~N~0 ~j~0) (not (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4)))) 2147483647))) (or (< 2147483647 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))))) (not (<= (+ ~bag2~0 ~sum2~0) 2147483647)) (not (<= 0 (+ ~bag2~0 ~sum2~0 2147483648))) (< (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) 2147483648) 0) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) |thread1Thread1of1ForFork0_plus_~b#1|) (<= ~N~0 ~j~0)) (or (= ~A~0.offset 0) (not (<= 0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) 2147483648))) (<= ~cap2~0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))))) (<= ~N~0 ~j~0) (not (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4)))) 2147483647))) (or (<= (+ ~sum1~0 |thread1Thread1of1ForFork0_plus_~b#1| |thread1Thread1of1ForFork0_plus_~a#1|) (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0)) (not (<= 0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) 2147483648))) (<= ~cap2~0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))))) (<= (+ 5 ~A~0.offset (* ~j~0 4)) (* ~N~0 4)) (<= (+ ~cap1~0 1) (+ |thread1Thread1of1ForFork0_plus_~b#1| |thread1Thread1of1ForFork0_plus_~a#1|)) (<= ~N~0 ~j~0) (not (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4)))) 2147483647))) (or (< 2147483647 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))))) (not (<= (+ ~bag2~0 ~sum2~0) 2147483647)) (= ~A~0.offset 0) (not (<= 0 (+ ~bag2~0 ~sum2~0 2147483648))) (< (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) 2147483648) 0) (<= ~N~0 ~j~0)) (or (< 2147483647 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))))) (not (<= (+ ~bag2~0 ~sum2~0) 2147483647)) (= ~bag1~0 |thread1Thread1of1ForFork0_plus_~a#1|) (not (<= 0 (+ ~bag2~0 ~sum2~0 2147483648))) (< (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) 2147483648) 0) (<= ~N~0 ~j~0)) (or (< 2147483647 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))))) (not (<= (+ ~bag2~0 ~sum2~0) 2147483647)) (<= (+ ~sum1~0 |thread1Thread1of1ForFork0_plus_~b#1| |thread1Thread1of1ForFork0_plus_~a#1|) (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0)) (not (<= 0 (+ ~bag2~0 ~sum2~0 2147483648))) (< (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) 2147483648) 0) (<= (+ 5 ~A~0.offset (* ~j~0 4)) (* ~N~0 4)) (<= (+ ~cap1~0 1) (+ |thread1Thread1of1ForFork0_plus_~b#1| |thread1Thread1of1ForFork0_plus_~a#1|)) (<= ~N~0 ~j~0)) (or (< 2147483647 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))))) (not (<= (+ ~bag2~0 ~sum2~0) 2147483647)) (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0) (+ ~sum1~0 |thread1Thread1of1ForFork0_plus_~b#1| |thread1Thread1of1ForFork0_plus_~a#1|)) (not (<= 0 (+ ~bag2~0 ~sum2~0 2147483648))) (< (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) 2147483648) 0) (<= (+ 5 ~A~0.offset (* ~j~0 4)) (* ~N~0 4)) (<= (+ ~cap1~0 1) (+ |thread1Thread1of1ForFork0_plus_~b#1| |thread1Thread1of1ForFork0_plus_~a#1|)) (<= ~N~0 ~j~0)) (or (= ~bag1~0 |thread1Thread1of1ForFork0_plus_~a#1|) (not (<= 0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) 2147483648))) (<= ~cap2~0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))))) (<= ~N~0 ~j~0) (not (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4)))) 2147483647)))), 28895#(and (or (not (<= 0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) 2147483648))) (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0) (+ ~bag1~0 ~sum1~0)) (<= ~cap2~0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))))) (<= ~N~0 ~j~0) (< (+ ~j~0 1) ~N~0) (not (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0) 2147483647)) (not (<= 0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 2147483648))) (not (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4)))) 2147483647))) (or (< 2147483647 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))))) (not (<= (+ ~bag2~0 ~sum2~0) 2147483647)) (<= (+ ~bag1~0 ~sum1~0) (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0)) (not (<= 0 (+ ~bag2~0 ~sum2~0 2147483648))) (< (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) 2147483648) 0) (<= ~N~0 ~j~0) (< (+ ~j~0 1) ~N~0) (not (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0) 2147483647)) (not (<= 0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 2147483648)))) (or (< 2147483647 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))))) (not (<= (+ ~bag2~0 ~sum2~0) 2147483647)) (not (<= 0 (+ ~bag2~0 ~sum2~0 2147483648))) (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0) (+ ~bag1~0 ~sum1~0)) (< (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) 2147483648) 0) (<= ~N~0 ~j~0) (< (+ ~j~0 1) ~N~0) (not (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0) 2147483647)) (not (<= 0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 2147483648)))) (or (<= (+ ~bag1~0 ~sum1~0) (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0)) (not (<= 0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) 2147483648))) (<= ~cap2~0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))))) (<= ~N~0 ~j~0) (< (+ ~j~0 1) ~N~0) (not (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0) 2147483647)) (not (<= 0 (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4))) ~sum2~0 2147483648))) (not (<= (+ ~bag2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~j~0 4)))) 2147483647))))] [2022-03-15 19:05:45,554 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-03-15 19:05:45,554 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:05:45,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-03-15 19:05:45,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=308, Invalid=2042, Unknown=2, NotChecked=0, Total=2352 [2022-03-15 19:05:45,555 INFO L87 Difference]: Start difference. First operand 402 states and 1208 transitions. Second operand has 27 states, 26 states have (on average 2.8076923076923075) internal successors, (73), 26 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Received shutdown request... [2022-03-15 19:06:14,109 WARN L244 SmtUtils]: Removed 21 from assertion stack [2022-03-15 19:06:14,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2022-03-15 19:06:14,110 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 38 SyntacticMatches, 7 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2903 ImplicationChecksByTransitivity, 28.4s TimeCoverageRelationStatistics Valid=1019, Invalid=8681, Unknown=2, NotChecked=0, Total=9702 [2022-03-15 19:06:14,110 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 206 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 1212 mSolverCounterSat, 222 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1434 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 222 IncrementalHoareTripleChecker+Valid, 1212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-03-15 19:06:14,111 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [206 Valid, 0 Invalid, 1434 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [222 Valid, 1212 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-03-15 19:06:14,111 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2022-03-15 19:06:14,117 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:06:14,117 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-03-15 19:06:14,128 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2022-03-15 19:06:14,312 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,SelfDestructingSolverStorable25 [2022-03-15 19:06:14,312 WARN L594 AbstractCegarLoop]: Verification canceled: while BasicCegarLoop was constructing difference of abstraction (402states) and FLOYD_HOARE automaton (currently 53 states, 27 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 180 for 1610ms.. [2022-03-15 19:06:14,313 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATION (1 of 3 remaining) [2022-03-15 19:06:14,313 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATION (0 of 3 remaining) [2022-03-15 19:06:14,315 INFO L732 BasicCegarLoop]: Path program histogram: [12, 4, 4, 2, 1, 1, 1, 1] [2022-03-15 19:06:14,316 INFO L230 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-03-15 19:06:14,316 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-03-15 19:06:14,317 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.03 07:06:14 BasicIcfg [2022-03-15 19:06:14,317 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-03-15 19:06:14,318 INFO L158 Benchmark]: Toolchain (without parser) took 763674.48ms. Allocated memory was 192.9MB in the beginning and 576.7MB in the end (delta: 383.8MB). Free memory was 135.8MB in the beginning and 306.7MB in the end (delta: -171.0MB). Peak memory consumption was 417.0MB. Max. memory is 8.0GB. [2022-03-15 19:06:14,318 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 192.9MB. Free memory is still 152.1MB. There was no memory consumed. Max. memory is 8.0GB. [2022-03-15 19:06:14,318 INFO L158 Benchmark]: CACSL2BoogieTranslator took 308.11ms. Allocated memory was 192.9MB in the beginning and 276.8MB in the end (delta: 83.9MB). Free memory was 135.5MB in the beginning and 244.8MB in the end (delta: -109.3MB). Peak memory consumption was 9.3MB. Max. memory is 8.0GB. [2022-03-15 19:06:14,318 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.64ms. Allocated memory is still 276.8MB. Free memory was 244.8MB in the beginning and 242.2MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-03-15 19:06:14,318 INFO L158 Benchmark]: Boogie Preprocessor took 49.65ms. Allocated memory is still 276.8MB. Free memory was 242.2MB in the beginning and 240.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-03-15 19:06:14,318 INFO L158 Benchmark]: RCFGBuilder took 632.59ms. Allocated memory is still 276.8MB. Free memory was 240.1MB in the beginning and 216.5MB in the end (delta: 23.6MB). Peak memory consumption was 24.1MB. Max. memory is 8.0GB. [2022-03-15 19:06:14,318 INFO L158 Benchmark]: TraceAbstraction took 762624.15ms. Allocated memory was 276.8MB in the beginning and 576.7MB in the end (delta: 299.9MB). Free memory was 216.5MB in the beginning and 306.7MB in the end (delta: -90.3MB). Peak memory consumption was 413.8MB. Max. memory is 8.0GB. [2022-03-15 19:06:14,319 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.10ms. Allocated memory is still 192.9MB. Free memory is still 152.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 308.11ms. Allocated memory was 192.9MB in the beginning and 276.8MB in the end (delta: 83.9MB). Free memory was 135.5MB in the beginning and 244.8MB in the end (delta: -109.3MB). Peak memory consumption was 9.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 52.64ms. Allocated memory is still 276.8MB. Free memory was 244.8MB in the beginning and 242.2MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 49.65ms. Allocated memory is still 276.8MB. Free memory was 242.2MB in the beginning and 240.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 632.59ms. Allocated memory is still 276.8MB. Free memory was 240.1MB in the beginning and 216.5MB in the end (delta: 23.6MB). Peak memory consumption was 24.1MB. Max. memory is 8.0GB. * TraceAbstraction took 762624.15ms. Allocated memory was 276.8MB in the beginning and 576.7MB in the end (delta: 299.9MB). Free memory was 216.5MB in the beginning and 306.7MB in the end (delta: -90.3MB). Peak memory consumption was 413.8MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 9.9s, 375 PlacesBefore, 24 PlacesAfterwards, 396 TransitionsBefore, 21 TransitionsAfterwards, 37700 CoEnabledTransitionPairs, 8 FixpointIterations, 117 TrivialSequentialCompositions, 249 ConcurrentSequentialCompositions, 15 TrivialYvCompositions, 81 ConcurrentYvCompositions, 24 ChoiceCompositions, 486 TotalNumberOfCompositions, 32001 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 31447, positive: 31411, positive conditional: 0, positive unconditional: 31411, negative: 36, negative conditional: 0, negative unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 22040, positive: 22024, positive conditional: 0, positive unconditional: 22024, negative: 16, negative conditional: 0, negative unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 31447, positive: 9387, positive conditional: 0, positive unconditional: 9387, negative: 20, negative conditional: 0, negative unconditional: 20, unknown: 22040, unknown conditional: 0, unknown unconditional: 22040] , Statistics on independence cache: Total cache size (in pairs): 30, Positive cache size: 26, Positive conditional cache size: 0, Positive unconditional cache size: 26, Negative cache size: 4, Negative conditional cache size: 0, Negative unconditional cache size: 4 - 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: 103]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while BasicCegarLoop was constructing difference of abstraction (402states) and FLOYD_HOARE automaton (currently 53 states, 27 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 180 for 1610ms.. - TimeoutResultAtElement [Line: 98]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while BasicCegarLoop was constructing difference of abstraction (402states) and FLOYD_HOARE automaton (currently 53 states, 27 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 180 for 1610ms.. - TimeoutResultAtElement [Line: 97]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while BasicCegarLoop was constructing difference of abstraction (402states) and FLOYD_HOARE automaton (currently 53 states, 27 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 180 for 1610ms.. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 611 locations, 3 error locations. Started 1 CEGAR loops. OverallTime: 762.4s, OverallIterations: 26, TraceHistogramMax: 2, PathProgramHistogramMax: 12, EmptinessCheckTime: 0.0s, AutomataDifference: 570.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 10.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6114 SdHoareTripleChecker+Valid, 29.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6114 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 25.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4767 mSDsCounter, 3870 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 31496 IncrementalHoareTripleChecker+Invalid, 35366 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3870 mSolverCounterUnsat, 0 mSDtfsCounter, 31496 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2954 GetRequests, 749 SyntacticMatches, 100 SemanticMatches, 2104 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 138763 ImplicationChecksByTransitivity, 561.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=436occurred in iteration=23, InterpolantAutomatonStates: 1481, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 25 MinimizatonAttempts, 10116 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 2.1s SatisfiabilityAnalysisTime, 76.3s InterpolantComputationTime, 861 NumberOfCodeBlocks, 861 NumberOfCodeBlocksAsserted, 72 NumberOfCheckSat, 1195 ConstructedInterpolants, 72 QuantifiedInterpolants, 74377 SizeOfPredicates, 1167 NumberOfNonLiveVariables, 6096 ConjunctsInSsa, 1423 ConjunctsInUnsatCore, 70 InterpolantComputations, 6 PerfectInterpolantSequences, 89/471 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