./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-fpi/res2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version b5317dae Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/array-fpi/res2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 105e7597bd9cfde6146cefe87563ba1bc48309677fb8b2f1d1f421bc92453e6b --- Real Ultimate output --- This is Ultimate 0.2.2-?-b5317da-m [2023-02-16 00:29:09,274 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-16 00:29:09,278 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-16 00:29:09,299 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-16 00:29:09,302 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-16 00:29:09,304 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-16 00:29:09,305 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-16 00:29:09,308 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-16 00:29:09,309 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-16 00:29:09,312 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-16 00:29:09,313 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-16 00:29:09,315 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-16 00:29:09,315 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-16 00:29:09,318 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-16 00:29:09,319 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-16 00:29:09,320 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-16 00:29:09,321 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-16 00:29:09,322 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-16 00:29:09,323 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-16 00:29:09,327 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-16 00:29:09,327 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-16 00:29:09,328 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-16 00:29:09,329 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-16 00:29:09,329 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-16 00:29:09,335 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-16 00:29:09,336 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-16 00:29:09,336 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-16 00:29:09,337 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-16 00:29:09,338 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-16 00:29:09,338 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-16 00:29:09,339 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-16 00:29:09,339 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-16 00:29:09,340 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-16 00:29:09,341 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-16 00:29:09,342 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-16 00:29:09,342 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-16 00:29:09,342 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-16 00:29:09,343 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-16 00:29:09,343 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-16 00:29:09,347 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-16 00:29:09,348 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-16 00:29:09,349 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-02-16 00:29:09,380 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-16 00:29:09,381 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-16 00:29:09,382 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-16 00:29:09,382 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-16 00:29:09,382 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-16 00:29:09,383 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-16 00:29:09,383 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-16 00:29:09,383 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-16 00:29:09,383 INFO L138 SettingsManager]: * Use SBE=true [2023-02-16 00:29:09,384 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-16 00:29:09,384 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-16 00:29:09,384 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-16 00:29:09,385 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-16 00:29:09,385 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-16 00:29:09,385 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-16 00:29:09,385 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-16 00:29:09,385 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-16 00:29:09,385 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-16 00:29:09,385 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-16 00:29:09,386 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-16 00:29:09,386 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-16 00:29:09,386 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-16 00:29:09,386 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-16 00:29:09,386 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-16 00:29:09,386 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-16 00:29:09,387 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-16 00:29:09,387 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-16 00:29:09,387 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-16 00:29:09,387 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-16 00:29:09,387 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-16 00:29:09,387 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-16 00:29:09,387 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-16 00:29:09,388 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-16 00:29:09,388 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-16 00:29:09,388 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-16 00:29:09,388 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 105e7597bd9cfde6146cefe87563ba1bc48309677fb8b2f1d1f421bc92453e6b [2023-02-16 00:29:09,585 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-16 00:29:09,598 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-16 00:29:09,600 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-16 00:29:09,600 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-16 00:29:09,601 INFO L275 PluginConnector]: CDTParser initialized [2023-02-16 00:29:09,601 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-fpi/res2.c [2023-02-16 00:29:10,626 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-16 00:29:10,779 INFO L351 CDTParser]: Found 1 translation units. [2023-02-16 00:29:10,781 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/res2.c [2023-02-16 00:29:10,786 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b854f7f9f/261d9be2f66e46f5a85bd8a2b9a6b354/FLAGda291068e [2023-02-16 00:29:10,800 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b854f7f9f/261d9be2f66e46f5a85bd8a2b9a6b354 [2023-02-16 00:29:10,802 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-16 00:29:10,803 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-16 00:29:10,804 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-16 00:29:10,804 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-16 00:29:10,806 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-16 00:29:10,807 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.02 12:29:10" (1/1) ... [2023-02-16 00:29:10,807 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@43a640e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:29:10, skipping insertion in model container [2023-02-16 00:29:10,808 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.02 12:29:10" (1/1) ... [2023-02-16 00:29:10,815 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-16 00:29:10,827 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-16 00:29:10,939 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/res2.c[587,600] [2023-02-16 00:29:10,958 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-16 00:29:10,964 INFO L203 MainTranslator]: Completed pre-run [2023-02-16 00:29:10,974 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/res2.c[587,600] [2023-02-16 00:29:10,982 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-16 00:29:10,992 INFO L208 MainTranslator]: Completed translation [2023-02-16 00:29:10,992 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:29:10 WrapperNode [2023-02-16 00:29:10,992 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-16 00:29:10,993 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-16 00:29:10,993 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-16 00:29:10,993 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-16 00:29:10,998 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:29:10" (1/1) ... [2023-02-16 00:29:11,003 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:29:10" (1/1) ... [2023-02-16 00:29:11,017 INFO L138 Inliner]: procedures = 17, calls = 36, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 120 [2023-02-16 00:29:11,017 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-16 00:29:11,018 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-16 00:29:11,018 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-16 00:29:11,018 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-16 00:29:11,023 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:29:10" (1/1) ... [2023-02-16 00:29:11,023 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:29:10" (1/1) ... [2023-02-16 00:29:11,028 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:29:10" (1/1) ... [2023-02-16 00:29:11,028 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:29:10" (1/1) ... [2023-02-16 00:29:11,033 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:29:10" (1/1) ... [2023-02-16 00:29:11,036 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:29:10" (1/1) ... [2023-02-16 00:29:11,036 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:29:10" (1/1) ... [2023-02-16 00:29:11,037 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:29:10" (1/1) ... [2023-02-16 00:29:11,038 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-16 00:29:11,039 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-16 00:29:11,039 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-16 00:29:11,039 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-16 00:29:11,040 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:29:10" (1/1) ... [2023-02-16 00:29:11,044 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-16 00:29:11,050 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 00:29:11,064 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) [2023-02-16 00:29:11,089 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 [2023-02-16 00:29:11,092 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-16 00:29:11,093 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-16 00:29:11,093 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-02-16 00:29:11,093 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-02-16 00:29:11,093 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-02-16 00:29:11,094 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-16 00:29:11,095 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-16 00:29:11,095 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-02-16 00:29:11,095 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-02-16 00:29:11,167 INFO L235 CfgBuilder]: Building ICFG [2023-02-16 00:29:11,169 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-16 00:29:11,399 INFO L276 CfgBuilder]: Performing block encoding [2023-02-16 00:29:11,404 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-16 00:29:11,404 INFO L300 CfgBuilder]: Removed 6 assume(true) statements. [2023-02-16 00:29:11,405 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.02 12:29:11 BoogieIcfgContainer [2023-02-16 00:29:11,405 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-16 00:29:11,407 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-16 00:29:11,407 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-16 00:29:11,409 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-16 00:29:11,409 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.02 12:29:10" (1/3) ... [2023-02-16 00:29:11,410 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e11d206 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.02 12:29:11, skipping insertion in model container [2023-02-16 00:29:11,410 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:29:10" (2/3) ... [2023-02-16 00:29:11,410 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e11d206 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.02 12:29:11, skipping insertion in model container [2023-02-16 00:29:11,411 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.02 12:29:11" (3/3) ... [2023-02-16 00:29:11,412 INFO L112 eAbstractionObserver]: Analyzing ICFG res2.c [2023-02-16 00:29:11,426 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-16 00:29:11,426 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-02-16 00:29:11,458 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-16 00:29:11,462 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@cc7f895, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-16 00:29:11,463 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-02-16 00:29:11,465 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 28 states have (on average 1.5714285714285714) internal successors, (44), 29 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 00:29:11,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-02-16 00:29:11,469 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 00:29:11,470 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 00:29:11,470 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 00:29:11,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 00:29:11,473 INFO L85 PathProgramCache]: Analyzing trace with hash 1780399656, now seen corresponding path program 1 times [2023-02-16 00:29:11,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 00:29:11,479 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860844572] [2023-02-16 00:29:11,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:29:11,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 00:29:11,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:29:11,594 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 00:29:11,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 00:29:11,595 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860844572] [2023-02-16 00:29:11,596 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1860844572] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 00:29:11,596 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 00:29:11,596 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-16 00:29:11,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882712685] [2023-02-16 00:29:11,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 00:29:11,600 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-02-16 00:29:11,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 00:29:11,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-02-16 00:29:11,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-16 00:29:11,618 INFO L87 Difference]: Start difference. First operand has 30 states, 28 states have (on average 1.5714285714285714) internal successors, (44), 29 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 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) [2023-02-16 00:29:11,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 00:29:11,631 INFO L93 Difference]: Finished difference Result 56 states and 82 transitions. [2023-02-16 00:29:11,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-02-16 00:29:11,632 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 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 19 [2023-02-16 00:29:11,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 00:29:11,637 INFO L225 Difference]: With dead ends: 56 [2023-02-16 00:29:11,637 INFO L226 Difference]: Without dead ends: 26 [2023-02-16 00:29:11,639 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-16 00:29:11,641 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-16 00:29:11,642 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-16 00:29:11,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2023-02-16 00:29:11,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2023-02-16 00:29:11,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.24) internal successors, (31), 25 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 00:29:11,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 31 transitions. [2023-02-16 00:29:11,661 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 31 transitions. Word has length 19 [2023-02-16 00:29:11,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 00:29:11,664 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 31 transitions. [2023-02-16 00:29:11,664 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 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) [2023-02-16 00:29:11,664 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2023-02-16 00:29:11,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-02-16 00:29:11,665 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 00:29:11,665 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 00:29:11,665 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-16 00:29:11,665 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 00:29:11,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 00:29:11,666 INFO L85 PathProgramCache]: Analyzing trace with hash -1279549768, now seen corresponding path program 1 times [2023-02-16 00:29:11,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 00:29:11,666 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534573919] [2023-02-16 00:29:11,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:29:11,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 00:29:11,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:29:11,786 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 00:29:11,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 00:29:11,787 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534573919] [2023-02-16 00:29:11,787 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [534573919] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 00:29:11,787 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 00:29:11,788 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-16 00:29:11,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86250586] [2023-02-16 00:29:11,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 00:29:11,789 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-16 00:29:11,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 00:29:11,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-16 00:29:11,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-02-16 00:29:11,790 INFO L87 Difference]: Start difference. First operand 26 states and 31 transitions. Second operand has 4 states, 4 states have (on average 4.75) 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) [2023-02-16 00:29:11,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 00:29:11,884 INFO L93 Difference]: Finished difference Result 57 states and 72 transitions. [2023-02-16 00:29:11,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-16 00:29:11,885 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) 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 19 [2023-02-16 00:29:11,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 00:29:11,886 INFO L225 Difference]: With dead ends: 57 [2023-02-16 00:29:11,886 INFO L226 Difference]: Without dead ends: 38 [2023-02-16 00:29:11,886 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-02-16 00:29:11,887 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 44 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 00:29:11,887 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 14 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 00:29:11,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2023-02-16 00:29:11,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 32. [2023-02-16 00:29:11,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 31 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) [2023-02-16 00:29:11,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 37 transitions. [2023-02-16 00:29:11,897 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 37 transitions. Word has length 19 [2023-02-16 00:29:11,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 00:29:11,897 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 37 transitions. [2023-02-16 00:29:11,897 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) 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) [2023-02-16 00:29:11,897 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2023-02-16 00:29:11,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-02-16 00:29:11,899 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 00:29:11,899 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 00:29:11,900 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-02-16 00:29:11,900 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 00:29:11,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 00:29:11,902 INFO L85 PathProgramCache]: Analyzing trace with hash -1740145276, now seen corresponding path program 1 times [2023-02-16 00:29:11,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 00:29:11,902 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032401998] [2023-02-16 00:29:11,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:29:11,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 00:29:11,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:29:13,449 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 00:29:13,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 00:29:13,449 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032401998] [2023-02-16 00:29:13,451 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1032401998] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 00:29:13,451 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1817635405] [2023-02-16 00:29:13,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:29:13,451 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 00:29:13,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 00:29:13,453 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) [2023-02-16 00:29:13,481 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-02-16 00:29:13,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:29:13,566 INFO L263 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 65 conjunts are in the unsatisfiable core [2023-02-16 00:29:13,585 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 00:29:13,644 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-02-16 00:29:13,645 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 27 [2023-02-16 00:29:13,681 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-16 00:29:13,720 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:29:13,721 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2023-02-16 00:29:13,876 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:29:13,877 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 26 [2023-02-16 00:29:14,069 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:29:14,071 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 28 [2023-02-16 00:29:14,245 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:29:14,246 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 36 [2023-02-16 00:29:14,430 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:29:14,432 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 40 [2023-02-16 00:29:14,593 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:29:14,595 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 48 [2023-02-16 00:29:14,771 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:29:14,772 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 19 [2023-02-16 00:29:14,803 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 00:29:14,804 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 00:29:44,218 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 00:29:44,218 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 00:29:44,219 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 00:29:44,235 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 00:29:44,235 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1817635405] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 00:29:44,236 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-16 00:29:44,236 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 16] total 41 [2023-02-16 00:29:44,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161686991] [2023-02-16 00:29:44,236 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-16 00:29:44,237 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2023-02-16 00:29:44,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 00:29:44,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2023-02-16 00:29:44,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=277, Invalid=1351, Unknown=12, NotChecked=0, Total=1640 [2023-02-16 00:29:44,242 INFO L87 Difference]: Start difference. First operand 32 states and 37 transitions. Second operand has 41 states, 41 states have (on average 1.951219512195122) internal successors, (80), 41 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 00:29:48,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 00:29:48,601 INFO L93 Difference]: Finished difference Result 57 states and 66 transitions. [2023-02-16 00:29:48,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-02-16 00:29:48,601 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 1.951219512195122) internal successors, (80), 41 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2023-02-16 00:29:48,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 00:29:48,602 INFO L225 Difference]: With dead ends: 57 [2023-02-16 00:29:48,602 INFO L226 Difference]: Without dead ends: 53 [2023-02-16 00:29:48,603 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 39 SyntacticMatches, 4 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 885 ImplicationChecksByTransitivity, 33.1s TimeCoverageRelationStatistics Valid=463, Invalid=2281, Unknown=12, NotChecked=0, Total=2756 [2023-02-16 00:29:48,604 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 40 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 505 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 536 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 505 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-02-16 00:29:48,604 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 127 Invalid, 536 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 505 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-02-16 00:29:48,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2023-02-16 00:29:48,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 49. [2023-02-16 00:29:48,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 48 states have (on average 1.2083333333333333) internal successors, (58), 48 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 00:29:48,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 58 transitions. [2023-02-16 00:29:48,613 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 58 transitions. Word has length 31 [2023-02-16 00:29:48,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 00:29:48,613 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 58 transitions. [2023-02-16 00:29:48,614 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 1.951219512195122) internal successors, (80), 41 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 00:29:48,614 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 58 transitions. [2023-02-16 00:29:48,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-02-16 00:29:48,614 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 00:29:48,615 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 00:29:48,620 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-02-16 00:29:48,819 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 00:29:48,820 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 00:29:48,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 00:29:48,821 INFO L85 PathProgramCache]: Analyzing trace with hash 1839245574, now seen corresponding path program 2 times [2023-02-16 00:29:48,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 00:29:48,821 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290093430] [2023-02-16 00:29:48,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:29:48,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 00:29:48,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:29:48,913 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-02-16 00:29:48,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 00:29:48,914 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290093430] [2023-02-16 00:29:48,914 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [290093430] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 00:29:48,914 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [780019491] [2023-02-16 00:29:48,914 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-16 00:29:48,914 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 00:29:48,914 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 00:29:48,915 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) [2023-02-16 00:29:48,921 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-02-16 00:29:48,983 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-16 00:29:48,983 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-16 00:29:48,984 INFO L263 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-16 00:29:48,985 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 00:29:49,034 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-02-16 00:29:49,035 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 00:29:49,077 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-02-16 00:29:49,077 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [780019491] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 00:29:49,077 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-16 00:29:49,078 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2023-02-16 00:29:49,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607706632] [2023-02-16 00:29:49,078 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-16 00:29:49,078 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-16 00:29:49,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 00:29:49,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-16 00:29:49,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2023-02-16 00:29:49,079 INFO L87 Difference]: Start difference. First operand 49 states and 58 transitions. Second operand has 11 states, 11 states have (on average 3.909090909090909) internal successors, (43), 11 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 00:29:49,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 00:29:49,236 INFO L93 Difference]: Finished difference Result 128 states and 151 transitions. [2023-02-16 00:29:49,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-16 00:29:49,236 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.909090909090909) internal successors, (43), 11 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2023-02-16 00:29:49,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 00:29:49,237 INFO L225 Difference]: With dead ends: 128 [2023-02-16 00:29:49,237 INFO L226 Difference]: Without dead ends: 72 [2023-02-16 00:29:49,237 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 58 SyntacticMatches, 4 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2023-02-16 00:29:49,240 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 89 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 00:29:49,240 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 33 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 00:29:49,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2023-02-16 00:29:49,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 54. [2023-02-16 00:29:49,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 53 states have (on average 1.169811320754717) internal successors, (62), 53 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) [2023-02-16 00:29:49,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 62 transitions. [2023-02-16 00:29:49,246 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 62 transitions. Word has length 33 [2023-02-16 00:29:49,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 00:29:49,246 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 62 transitions. [2023-02-16 00:29:49,247 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.909090909090909) internal successors, (43), 11 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 00:29:49,247 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 62 transitions. [2023-02-16 00:29:49,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-02-16 00:29:49,247 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 00:29:49,247 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 00:29:49,265 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-02-16 00:29:49,465 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2023-02-16 00:29:49,465 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 00:29:49,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 00:29:49,466 INFO L85 PathProgramCache]: Analyzing trace with hash 447877832, now seen corresponding path program 3 times [2023-02-16 00:29:49,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 00:29:49,466 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768836273] [2023-02-16 00:29:49,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:29:49,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 00:29:49,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:29:49,565 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-02-16 00:29:49,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 00:29:49,565 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768836273] [2023-02-16 00:29:49,565 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [768836273] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 00:29:49,565 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [555810308] [2023-02-16 00:29:49,565 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-16 00:29:49,566 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 00:29:49,566 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 00:29:49,567 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) [2023-02-16 00:29:49,585 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-02-16 00:29:49,650 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-02-16 00:29:49,650 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-16 00:29:49,651 INFO L263 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-16 00:29:49,653 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 00:29:49,691 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-02-16 00:29:49,691 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 00:29:49,738 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-02-16 00:29:49,738 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [555810308] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 00:29:49,738 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-16 00:29:49,738 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2023-02-16 00:29:49,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718199612] [2023-02-16 00:29:49,739 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-16 00:29:49,739 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-16 00:29:49,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 00:29:49,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-16 00:29:49,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2023-02-16 00:29:49,740 INFO L87 Difference]: Start difference. First operand 54 states and 62 transitions. Second operand has 11 states, 11 states have (on average 3.909090909090909) internal successors, (43), 11 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 00:29:49,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 00:29:49,902 INFO L93 Difference]: Finished difference Result 65 states and 73 transitions. [2023-02-16 00:29:49,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-16 00:29:49,903 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.909090909090909) internal successors, (43), 11 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2023-02-16 00:29:49,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 00:29:49,903 INFO L225 Difference]: With dead ends: 65 [2023-02-16 00:29:49,903 INFO L226 Difference]: Without dead ends: 49 [2023-02-16 00:29:49,904 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 62 SyntacticMatches, 4 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2023-02-16 00:29:49,904 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 86 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 00:29:49,904 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 29 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 00:29:49,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2023-02-16 00:29:49,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 44. [2023-02-16 00:29:49,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 43 states have (on average 1.1395348837209303) internal successors, (49), 43 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 00:29:49,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 49 transitions. [2023-02-16 00:29:49,908 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 49 transitions. Word has length 35 [2023-02-16 00:29:49,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 00:29:49,909 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 49 transitions. [2023-02-16 00:29:49,909 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.909090909090909) internal successors, (43), 11 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 00:29:49,909 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 49 transitions. [2023-02-16 00:29:49,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2023-02-16 00:29:49,910 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 00:29:49,910 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 00:29:49,915 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-02-16 00:29:50,114 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 00:29:50,114 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 00:29:50,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 00:29:50,115 INFO L85 PathProgramCache]: Analyzing trace with hash 1410382416, now seen corresponding path program 4 times [2023-02-16 00:29:50,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 00:29:50,115 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767147024] [2023-02-16 00:29:50,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:29:50,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 00:29:50,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:29:53,330 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 00:29:53,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 00:29:53,330 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767147024] [2023-02-16 00:29:53,330 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1767147024] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 00:29:53,330 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [91766221] [2023-02-16 00:29:53,330 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-02-16 00:29:53,330 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 00:29:53,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 00:29:53,337 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) [2023-02-16 00:29:53,339 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-02-16 00:29:53,433 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-02-16 00:29:53,433 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-16 00:29:53,448 INFO L263 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 101 conjunts are in the unsatisfiable core [2023-02-16 00:29:53,454 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 00:29:53,464 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-16 00:29:53,481 INFO L321 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2023-02-16 00:29:53,482 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 34 [2023-02-16 00:29:53,560 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2023-02-16 00:29:53,704 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 37 [2023-02-16 00:29:54,081 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:29:54,082 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 00:29:54,083 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 42 [2023-02-16 00:29:54,298 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 00:29:54,300 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:29:54,301 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 42 [2023-02-16 00:29:54,730 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 44 [2023-02-16 00:29:54,953 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:29:54,954 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 52 [2023-02-16 00:29:55,247 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:29:55,248 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 00:29:55,249 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 8 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 64 [2023-02-16 00:29:55,465 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 59 [2023-02-16 00:29:55,766 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 66 [2023-02-16 00:29:55,987 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:29:55,988 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 8 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 74 [2023-02-16 00:29:56,307 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 00:29:56,308 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:29:56,310 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 8 disjoint index pairs (out of 28 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 100 treesize of output 86 [2023-02-16 00:29:56,555 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 7 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 99 treesize of output 81 [2023-02-16 00:29:56,804 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 7 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 31 [2023-02-16 00:29:56,857 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 00:29:56,857 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 00:30:35,522 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 00:30:35,523 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [91766221] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 00:30:35,523 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-16 00:30:35,524 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 31, 31] total 90 [2023-02-16 00:30:35,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434436864] [2023-02-16 00:30:35,524 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-16 00:30:35,524 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 90 states [2023-02-16 00:30:35,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 00:30:35,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2023-02-16 00:30:35,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=992, Invalid=7008, Unknown=10, NotChecked=0, Total=8010 [2023-02-16 00:30:35,528 INFO L87 Difference]: Start difference. First operand 44 states and 49 transitions. Second operand has 90 states, 90 states have (on average 1.2777777777777777) internal successors, (115), 90 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 00:31:28,735 WARN L233 SmtUtils]: Spent 40.04s on a formula simplification that was a NOOP. DAG size: 162 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-16 00:31:42,778 WARN L233 SmtUtils]: Spent 12.36s on a formula simplification. DAG size of input: 213 DAG size of output: 142 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-16 00:32:22,161 WARN L233 SmtUtils]: Spent 38.09s on a formula simplification. DAG size of input: 277 DAG size of output: 275 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-16 00:32:24,591 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse90 (* |c_ULTIMATE.start_main_~i~0#1| 4)) (.cse23 (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse1 (* 3 c_~N~0)) (.cse0 (select .cse23 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse19 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse44 (+ |c_ULTIMATE.start_main_~a~0#1.offset| .cse90)) (.cse26 (< (+ |c_ULTIMATE.start_main_~i~0#1| 1) c_~N~0))) (let ((.cse2 (not (< |c_ULTIMATE.start_main_~i~0#1| c_~N~0))) (.cse45 (< 0 |c_ULTIMATE.start_main_~i~0#1|)) (.cse46 (< |c_ULTIMATE.start_main_~i~0#1| 0)) (.cse12 (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|)) (.cse13 (+ |c_ULTIMATE.start_main_~b~0#1.offset| .cse90)) (.cse62 (+ |c_ULTIMATE.start_main_~b~0#1.offset| .cse90 4)) (.cse14 (not .cse26)) (.cse31 (+ .cse0 (select .cse19 .cse44))) (.cse20 (+ |c_ULTIMATE.start_main_~a~0#1.offset| .cse90 4)) (.cse25 (< (+ |c_ULTIMATE.start_main_~i~0#1| 2) c_~N~0)) (.cse24 (not (< 1 c_~N~0))) (.cse9 (+ .cse1 1)) (.cse38 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (.cse8 (+ |c_ULTIMATE.start_main_~c~0#1.offset| 4)) (.cse6 (+ |c_ULTIMATE.start_main_~b~0#1.offset| 4))) (and (= |c_ULTIMATE.start_main_~c~0#1.offset| 0) (<= (+ .cse0 4) .cse1) (or .cse2 (forall ((v_ArrVal_334 Int) (v_ArrVal_332 Int) (v_ArrVal_342 Int) (v_ArrVal_341 Int) (v_ArrVal_339 Int) (v_ArrVal_337 Int)) (let ((.cse10 (store .cse12 .cse13 v_ArrVal_332))) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| .cse10))) (let ((.cse5 (select .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse7 (let ((.cse11 (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_337)))) (store .cse11 |c_ULTIMATE.start_main_~c~0#1.base| (store (store (select .cse11 |c_ULTIMATE.start_main_~c~0#1.base|) |c_ULTIMATE.start_main_~c~0#1.offset| v_ArrVal_339) .cse8 v_ArrVal_341))))) (let ((.cse3 (select .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (not (<= v_ArrVal_342 (+ v_ArrVal_339 (select .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset|)))) (not (<= v_ArrVal_337 (+ v_ArrVal_334 (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_334)) |c_ULTIMATE.start_main_~b~0#1.base|) .cse6)))) (not (<= v_ArrVal_332 1)) (not (<= v_ArrVal_341 1)) (< (+ v_ArrVal_342 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_342)) |c_ULTIMATE.start_main_~c~0#1.base|) .cse8)) .cse9) (not (<= v_ArrVal_334 (+ (select .cse10 |c_ULTIMATE.start_main_~b~0#1.offset|) (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset|)))) (not (<= v_ArrVal_339 1)))))))))) (or .cse14 (forall ((v_ArrVal_334 Int) (v_ArrVal_332 Int) (v_ArrVal_342 Int) (v_ArrVal_330 Int) (v_ArrVal_341 Int) (v_ArrVal_328 Int) (v_ArrVal_339 Int) (v_ArrVal_337 Int)) (let ((.cse17 (let ((.cse22 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse23 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_328)))) (store .cse22 |c_ULTIMATE.start_main_~b~0#1.base| (store (store (select .cse22 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| v_ArrVal_330) .cse6 v_ArrVal_332))))) (let ((.cse18 (select .cse17 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse15 (let ((.cse21 (store .cse17 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse18 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_337)))) (store .cse21 |c_ULTIMATE.start_main_~c~0#1.base| (store (store (select .cse21 |c_ULTIMATE.start_main_~c~0#1.base|) |c_ULTIMATE.start_main_~c~0#1.offset| v_ArrVal_339) .cse8 v_ArrVal_341))))) (let ((.cse16 (select .cse15 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (< (+ (select (select (store .cse15 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse16 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_342)) |c_ULTIMATE.start_main_~c~0#1.base|) .cse8) v_ArrVal_342) .cse9) (not (<= v_ArrVal_337 (+ v_ArrVal_334 (select (select (store .cse17 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse18 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_334)) |c_ULTIMATE.start_main_~b~0#1.base|) .cse6)))) (not (<= v_ArrVal_332 1)) (not (<= v_ArrVal_328 (+ .cse0 (select .cse19 .cse20)))) (not (<= v_ArrVal_341 1)) (not (<= v_ArrVal_342 (+ v_ArrVal_339 (select .cse16 |c_ULTIMATE.start_main_~#sum~0#1.offset|)))) (not (<= v_ArrVal_334 (+ v_ArrVal_330 (select .cse18 |c_ULTIMATE.start_main_~#sum~0#1.offset|)))) (not (<= v_ArrVal_330 1)) (not (<= v_ArrVal_339 1)))))))) .cse24 .cse25) (<= 2 c_~N~0) (or .cse2 .cse26 .cse24 (forall ((v_ArrVal_334 Int) (v_ArrVal_332 Int) (v_ArrVal_342 Int) (v_ArrVal_330 Int) (v_ArrVal_341 Int) (v_ArrVal_328 Int) (v_ArrVal_339 Int) (v_ArrVal_337 Int)) (let ((.cse29 (let ((.cse33 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse23 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_328)))) (store .cse33 |c_ULTIMATE.start_main_~b~0#1.base| (store (store (select .cse33 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| v_ArrVal_330) .cse6 v_ArrVal_332))))) (let ((.cse30 (select .cse29 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse27 (let ((.cse32 (store .cse29 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse30 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_337)))) (store .cse32 |c_ULTIMATE.start_main_~c~0#1.base| (store (store (select .cse32 |c_ULTIMATE.start_main_~c~0#1.base|) |c_ULTIMATE.start_main_~c~0#1.offset| v_ArrVal_339) .cse8 v_ArrVal_341))))) (let ((.cse28 (select .cse27 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (< (+ (select (select (store .cse27 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse28 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_342)) |c_ULTIMATE.start_main_~c~0#1.base|) .cse8) v_ArrVal_342) .cse9) (not (<= v_ArrVal_337 (+ v_ArrVal_334 (select (select (store .cse29 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse30 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_334)) |c_ULTIMATE.start_main_~b~0#1.base|) .cse6)))) (not (<= v_ArrVal_332 1)) (not (<= v_ArrVal_341 1)) (not (<= v_ArrVal_342 (+ v_ArrVal_339 (select .cse28 |c_ULTIMATE.start_main_~#sum~0#1.offset|)))) (not (<= v_ArrVal_328 .cse31)) (not (<= v_ArrVal_334 (+ v_ArrVal_330 (select .cse30 |c_ULTIMATE.start_main_~#sum~0#1.offset|)))) (not (<= v_ArrVal_330 1)) (not (<= v_ArrVal_339 1))))))))) (or (< |c_ULTIMATE.start_main_~i~0#1| 1) (forall ((v_ArrVal_334 Int) (v_ArrVal_332 Int) (v_ArrVal_342 Int) (v_ArrVal_330 Int) (v_ArrVal_341 Int) (v_ArrVal_328 Int) (v_ArrVal_339 Int) (v_ArrVal_326 Int) (v_ArrVal_337 Int) (v_ArrVal_325 Int)) (let ((.cse34 (store .cse19 .cse44 v_ArrVal_325))) (let ((.cse37 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse34))) (let ((.cse35 (select .cse37 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse39 (let ((.cse43 (store .cse37 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse35 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_328)))) (store .cse43 |c_ULTIMATE.start_main_~b~0#1.base| (store (store (select .cse43 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| v_ArrVal_330) .cse6 v_ArrVal_332))))) (let ((.cse40 (select .cse39 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse41 (let ((.cse42 (store .cse39 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse40 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_337)))) (store .cse42 |c_ULTIMATE.start_main_~c~0#1.base| (store (store (select .cse42 |c_ULTIMATE.start_main_~c~0#1.base|) |c_ULTIMATE.start_main_~c~0#1.offset| v_ArrVal_339) .cse8 v_ArrVal_341))))) (let ((.cse36 (select .cse41 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (not (<= v_ArrVal_325 1)) (not (<= v_ArrVal_332 1)) (not (<= v_ArrVal_341 1)) (not (<= v_ArrVal_326 (+ (select .cse34 |c_ULTIMATE.start_main_~a~0#1.offset|) (select .cse35 |c_ULTIMATE.start_main_~#sum~0#1.offset|)))) (not (<= v_ArrVal_342 (+ (select .cse36 |c_ULTIMATE.start_main_~#sum~0#1.offset|) v_ArrVal_339))) (not (<= v_ArrVal_328 (+ (select (select (store .cse37 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse35 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_326)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse38) v_ArrVal_326))) (not (<= v_ArrVal_337 (+ v_ArrVal_334 (select (select (store .cse39 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse40 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_334)) |c_ULTIMATE.start_main_~b~0#1.base|) .cse6)))) (< (+ (select (select (store .cse41 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse36 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_342)) |c_ULTIMATE.start_main_~c~0#1.base|) .cse8) v_ArrVal_342) 7) (not (<= v_ArrVal_334 (+ v_ArrVal_330 (select .cse40 |c_ULTIMATE.start_main_~#sum~0#1.offset|)))) (not (<= v_ArrVal_330 1)) (not (<= v_ArrVal_339 1))))))))))) (< 1 |c_ULTIMATE.start_main_~i~0#1|)) (or .cse45 .cse46 (forall ((v_ArrVal_323 Int) (v_ArrVal_334 Int) (v_ArrVal_332 Int) (v_ArrVal_342 Int) (v_ArrVal_330 Int) (v_ArrVal_341 Int) (v_ArrVal_328 Int) (v_ArrVal_339 Int) (v_ArrVal_337 Int) (v_ArrVal_326 Int) (v_ArrVal_325 Int)) (let ((.cse47 (store (store .cse19 .cse44 v_ArrVal_323) .cse20 v_ArrVal_325))) (let ((.cse52 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse47))) (let ((.cse48 (select .cse52 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse51 (let ((.cse55 (store .cse52 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse48 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_328)))) (store .cse55 |c_ULTIMATE.start_main_~b~0#1.base| (store (store (select .cse55 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| v_ArrVal_330) .cse6 v_ArrVal_332))))) (let ((.cse49 (select .cse51 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse53 (let ((.cse54 (store .cse51 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse49 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_337)))) (store .cse54 |c_ULTIMATE.start_main_~c~0#1.base| (store (store (select .cse54 |c_ULTIMATE.start_main_~c~0#1.base|) |c_ULTIMATE.start_main_~c~0#1.offset| v_ArrVal_339) .cse8 v_ArrVal_341))))) (let ((.cse50 (select .cse53 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (not (<= v_ArrVal_325 1)) (not (<= v_ArrVal_332 1)) (not (<= v_ArrVal_326 (+ (select .cse47 |c_ULTIMATE.start_main_~a~0#1.offset|) (select .cse48 |c_ULTIMATE.start_main_~#sum~0#1.offset|)))) (not (<= v_ArrVal_341 1)) (not (<= v_ArrVal_334 (+ v_ArrVal_330 (select .cse49 |c_ULTIMATE.start_main_~#sum~0#1.offset|)))) (not (<= v_ArrVal_342 (+ v_ArrVal_339 (select .cse50 |c_ULTIMATE.start_main_~#sum~0#1.offset|)))) (not (<= v_ArrVal_337 (+ v_ArrVal_334 (select (select (store .cse51 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse49 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_334)) |c_ULTIMATE.start_main_~b~0#1.base|) .cse6)))) (not (<= v_ArrVal_328 (+ (select (select (store .cse52 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse48 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_326)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse38) v_ArrVal_326))) (not (<= v_ArrVal_323 1)) (< (+ (select (select (store .cse53 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse50 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_342)) |c_ULTIMATE.start_main_~c~0#1.base|) .cse8) v_ArrVal_342) 7) (not (<= v_ArrVal_330 1)) (not (<= v_ArrVal_339 1)))))))))))) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~c~0#1.base|)) (or .cse14 (forall ((v_ArrVal_334 Int) (v_ArrVal_332 Int) (v_ArrVal_342 Int) (v_ArrVal_341 Int) (v_ArrVal_339 Int) (v_ArrVal_337 Int)) (let ((.cse56 (store .cse12 .cse62 v_ArrVal_332))) (let ((.cse58 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| .cse56))) (let ((.cse57 (select .cse58 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse59 (let ((.cse61 (store .cse58 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse57 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_337)))) (store .cse61 |c_ULTIMATE.start_main_~c~0#1.base| (store (store (select .cse61 |c_ULTIMATE.start_main_~c~0#1.base|) |c_ULTIMATE.start_main_~c~0#1.offset| v_ArrVal_339) .cse8 v_ArrVal_341))))) (let ((.cse60 (select .cse59 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (not (<= v_ArrVal_332 1)) (not (<= v_ArrVal_334 (+ (select .cse56 |c_ULTIMATE.start_main_~b~0#1.offset|) (select .cse57 |c_ULTIMATE.start_main_~#sum~0#1.offset|)))) (not (<= v_ArrVal_337 (+ v_ArrVal_334 (select (select (store .cse58 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse57 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_334)) |c_ULTIMATE.start_main_~b~0#1.base|) .cse6)))) (not (<= v_ArrVal_341 1)) (< (+ (select (select (store .cse59 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse60 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_342)) |c_ULTIMATE.start_main_~c~0#1.base|) .cse8) v_ArrVal_342) .cse9) (not (<= v_ArrVal_339 1)) (not (<= v_ArrVal_342 (+ (select .cse60 |c_ULTIMATE.start_main_~#sum~0#1.offset|) v_ArrVal_339))))))))))) (or .cse45 .cse46 (forall ((v_ArrVal_334 Int) (v_ArrVal_332 Int) (v_ArrVal_342 Int) (v_ArrVal_330 Int) (v_ArrVal_341 Int) (v_ArrVal_328 Int) (v_ArrVal_339 Int) (v_ArrVal_326 Int) (v_ArrVal_337 Int) (v_ArrVal_325 Int)) (let ((.cse68 (store .cse19 .cse20 v_ArrVal_325))) (let ((.cse69 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse68))) (let ((.cse67 (select .cse69 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse65 (let ((.cse71 (store .cse69 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse67 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_328)))) (store .cse71 |c_ULTIMATE.start_main_~b~0#1.base| (store (store (select .cse71 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| v_ArrVal_330) .cse6 v_ArrVal_332))))) (let ((.cse66 (select .cse65 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse63 (let ((.cse70 (store .cse65 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse66 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_337)))) (store .cse70 |c_ULTIMATE.start_main_~c~0#1.base| (store (store (select .cse70 |c_ULTIMATE.start_main_~c~0#1.base|) |c_ULTIMATE.start_main_~c~0#1.offset| v_ArrVal_339) .cse8 v_ArrVal_341))))) (let ((.cse64 (select .cse63 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (not (<= v_ArrVal_325 1)) (< (+ (select (select (store .cse63 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse64 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_342)) |c_ULTIMATE.start_main_~c~0#1.base|) .cse8) v_ArrVal_342) 7) (not (<= v_ArrVal_332 1)) (not (<= v_ArrVal_337 (+ v_ArrVal_334 (select (select (store .cse65 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse66 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_334)) |c_ULTIMATE.start_main_~b~0#1.base|) .cse6)))) (not (<= v_ArrVal_341 1)) (not (<= v_ArrVal_342 (+ v_ArrVal_339 (select .cse64 |c_ULTIMATE.start_main_~#sum~0#1.offset|)))) (not (<= v_ArrVal_334 (+ v_ArrVal_330 (select .cse66 |c_ULTIMATE.start_main_~#sum~0#1.offset|)))) (not (<= v_ArrVal_326 (+ (select .cse67 |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse68 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (not (<= v_ArrVal_330 1)) (not (<= v_ArrVal_339 1)) (not (<= v_ArrVal_328 (+ (select (select (store .cse69 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse67 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_326)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse38) v_ArrVal_326))))))))))))) (or .cse14 (forall ((v_ArrVal_334 Int) (v_ArrVal_332 Int) (v_ArrVal_342 Int) (v_ArrVal_330 Int) (v_ArrVal_341 Int) (v_ArrVal_339 Int) (v_ArrVal_337 Int)) (let ((.cse74 (store (store .cse12 .cse13 v_ArrVal_330) .cse62 v_ArrVal_332))) (let ((.cse72 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| .cse74))) (let ((.cse73 (select .cse72 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse76 (let ((.cse77 (store .cse72 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse73 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_337)))) (store .cse77 |c_ULTIMATE.start_main_~c~0#1.base| (store (store (select .cse77 |c_ULTIMATE.start_main_~c~0#1.base|) |c_ULTIMATE.start_main_~c~0#1.offset| v_ArrVal_339) .cse8 v_ArrVal_341))))) (let ((.cse75 (select .cse76 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (not (<= v_ArrVal_337 (+ v_ArrVal_334 (select (select (store .cse72 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse73 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_334)) |c_ULTIMATE.start_main_~b~0#1.base|) .cse6)))) (not (<= v_ArrVal_334 (+ (select .cse74 |c_ULTIMATE.start_main_~b~0#1.offset|) (select .cse73 |c_ULTIMATE.start_main_~#sum~0#1.offset|)))) (not (<= v_ArrVal_332 1)) (not (<= v_ArrVal_342 (+ (select .cse75 |c_ULTIMATE.start_main_~#sum~0#1.offset|) v_ArrVal_339))) (not (<= v_ArrVal_341 1)) (< (+ v_ArrVal_342 (select (select (store .cse76 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse75 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_342)) |c_ULTIMATE.start_main_~c~0#1.base|) .cse8)) .cse9) (not (<= v_ArrVal_330 1)) (not (<= v_ArrVal_339 1)))))))))) (or .cse14 .cse24 (forall ((v_ArrVal_334 Int) (v_ArrVal_332 Int) (v_ArrVal_342 Int) (v_ArrVal_330 Int) (v_ArrVal_341 Int) (v_ArrVal_328 Int) (v_ArrVal_339 Int) (v_ArrVal_337 Int) (v_ArrVal_326 Int)) (let ((.cse80 (let ((.cse83 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse23 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_328)))) (store .cse83 |c_ULTIMATE.start_main_~b~0#1.base| (store (store (select .cse83 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| v_ArrVal_330) .cse6 v_ArrVal_332))))) (let ((.cse81 (select .cse80 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse78 (let ((.cse82 (store .cse80 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse81 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_337)))) (store .cse82 |c_ULTIMATE.start_main_~c~0#1.base| (store (store (select .cse82 |c_ULTIMATE.start_main_~c~0#1.base|) |c_ULTIMATE.start_main_~c~0#1.offset| v_ArrVal_339) .cse8 v_ArrVal_341))))) (let ((.cse79 (select .cse78 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (< (+ (select (select (store .cse78 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse79 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_342)) |c_ULTIMATE.start_main_~c~0#1.base|) .cse8) v_ArrVal_342) .cse9) (not (<= v_ArrVal_337 (+ v_ArrVal_334 (select (select (store .cse80 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse81 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_334)) |c_ULTIMATE.start_main_~b~0#1.base|) .cse6)))) (not (<= v_ArrVal_326 .cse31)) (not (<= v_ArrVal_332 1)) (not (<= v_ArrVal_341 1)) (not (<= v_ArrVal_342 (+ v_ArrVal_339 (select .cse79 |c_ULTIMATE.start_main_~#sum~0#1.offset|)))) (not (<= v_ArrVal_328 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse23 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_326)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse20) v_ArrVal_326))) (not (<= v_ArrVal_334 (+ v_ArrVal_330 (select .cse81 |c_ULTIMATE.start_main_~#sum~0#1.offset|)))) (not (<= v_ArrVal_330 1)) (not (<= v_ArrVal_339 1)))))))) .cse25) (or .cse24 (< 2 c_~N~0) (forall ((v_ArrVal_334 Int) (v_ArrVal_332 Int) (v_ArrVal_342 Int) (v_ArrVal_330 Int) (v_ArrVal_341 Int) (v_ArrVal_328 Int) (v_ArrVal_339 Int) (v_ArrVal_337 Int) (v_ArrVal_326 Int)) (let ((.cse86 (let ((.cse89 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse23 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_328)))) (store .cse89 |c_ULTIMATE.start_main_~b~0#1.base| (store (store (select .cse89 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| v_ArrVal_330) .cse6 v_ArrVal_332))))) (let ((.cse87 (select .cse86 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse84 (let ((.cse88 (store .cse86 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse87 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_337)))) (store .cse88 |c_ULTIMATE.start_main_~c~0#1.base| (store (store (select .cse88 |c_ULTIMATE.start_main_~c~0#1.base|) |c_ULTIMATE.start_main_~c~0#1.offset| v_ArrVal_339) .cse8 v_ArrVal_341))))) (let ((.cse85 (select .cse84 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (< (+ (select (select (store .cse84 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse85 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_342)) |c_ULTIMATE.start_main_~c~0#1.base|) .cse8) v_ArrVal_342) .cse9) (not (<= v_ArrVal_337 (+ v_ArrVal_334 (select (select (store .cse86 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse87 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_334)) |c_ULTIMATE.start_main_~b~0#1.base|) .cse6)))) (not (<= v_ArrVal_332 1)) (not (<= v_ArrVal_341 1)) (not (<= v_ArrVal_342 (+ v_ArrVal_339 (select .cse85 |c_ULTIMATE.start_main_~#sum~0#1.offset|)))) (not (<= v_ArrVal_328 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse23 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_326)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse38) v_ArrVal_326))) (not (<= v_ArrVal_334 (+ v_ArrVal_330 (select .cse87 |c_ULTIMATE.start_main_~#sum~0#1.offset|)))) (not (<= v_ArrVal_326 (+ .cse0 (select .cse19 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (not (<= v_ArrVal_330 1)) (not (<= v_ArrVal_339 1))))))))) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~b~0#1.base|)) (= |c_ULTIMATE.start_main_~b~0#1.offset| 0))))) is different from true [2023-02-16 00:32:26,602 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-16 00:32:28,613 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-16 00:32:30,657 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-16 00:32:36,392 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-16 00:32:47,473 WARN L233 SmtUtils]: Spent 5.68s on a formula simplification that was a NOOP. DAG size: 144 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-16 00:32:50,171 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse87 (* |c_ULTIMATE.start_main_~i~0#1| 4)) (.cse26 (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse1 (select .cse26 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse22 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse47 (+ |c_ULTIMATE.start_main_~a~0#1.offset| .cse87)) (.cse0 (< 1 c_~N~0)) (.cse29 (< (+ |c_ULTIMATE.start_main_~i~0#1| 1) c_~N~0))) (let ((.cse5 (not (< |c_ULTIMATE.start_main_~i~0#1| c_~N~0))) (.cse48 (< 0 |c_ULTIMATE.start_main_~i~0#1|)) (.cse49 (< |c_ULTIMATE.start_main_~i~0#1| 0)) (.cse41 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (.cse15 (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|)) (.cse16 (+ |c_ULTIMATE.start_main_~b~0#1.offset| .cse87)) (.cse65 (+ |c_ULTIMATE.start_main_~b~0#1.offset| .cse87 4)) (.cse17 (not .cse29)) (.cse27 (not .cse0)) (.cse12 (+ (* 3 c_~N~0) 1)) (.cse34 (+ .cse1 (select .cse22 .cse47))) (.cse23 (+ |c_ULTIMATE.start_main_~a~0#1.offset| .cse87 4)) (.cse11 (+ |c_ULTIMATE.start_main_~c~0#1.offset| 4)) (.cse9 (+ |c_ULTIMATE.start_main_~b~0#1.offset| 4)) (.cse28 (< (+ |c_ULTIMATE.start_main_~i~0#1| 2) c_~N~0))) (and (not (= |c_ULTIMATE.start_main_~c~0#1.base| |c_ULTIMATE.start_main_~#sum~0#1.base|)) (= |c_ULTIMATE.start_main_~c~0#1.offset| 0) .cse0 (= 0 |c_ULTIMATE.start_main_~#sum~0#1.offset|) (exists ((|ULTIMATE.start_main_~a~0#1.base| Int)) (let ((.cse4 (select |c_#memory_int| |ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse2 (select .cse4 4)) (.cse3 (select .cse4 0))) (and (not (= |c_ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~a~0#1.base|)) (<= .cse1 (+ .cse2 .cse3)) (<= .cse2 1) (<= .cse3 1) (not (= |ULTIMATE.start_main_~a~0#1.base| |c_ULTIMATE.start_main_~#sum~0#1.base|)) (not (= |c_ULTIMATE.start_main_~b~0#1.base| |ULTIMATE.start_main_~a~0#1.base|)))))) (<= |c_ULTIMATE.start_main_~i~0#1| 2) (not (= |c_ULTIMATE.start_main_~c~0#1.base| |c_ULTIMATE.start_main_~b~0#1.base|)) (or .cse5 (forall ((v_ArrVal_334 Int) (v_ArrVal_332 Int) (v_ArrVal_342 Int) (v_ArrVal_341 Int) (v_ArrVal_339 Int) (v_ArrVal_337 Int)) (let ((.cse13 (store .cse15 .cse16 v_ArrVal_332))) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| .cse13))) (let ((.cse8 (select .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse10 (let ((.cse14 (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_337)))) (store .cse14 |c_ULTIMATE.start_main_~c~0#1.base| (store (store (select .cse14 |c_ULTIMATE.start_main_~c~0#1.base|) |c_ULTIMATE.start_main_~c~0#1.offset| v_ArrVal_339) .cse11 v_ArrVal_341))))) (let ((.cse6 (select .cse10 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (not (<= v_ArrVal_342 (+ v_ArrVal_339 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset|)))) (not (<= v_ArrVal_337 (+ v_ArrVal_334 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_334)) |c_ULTIMATE.start_main_~b~0#1.base|) .cse9)))) (not (<= v_ArrVal_332 1)) (not (<= v_ArrVal_341 1)) (< (+ v_ArrVal_342 (select (select (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_342)) |c_ULTIMATE.start_main_~c~0#1.base|) .cse11)) .cse12) (not (<= v_ArrVal_334 (+ (select .cse13 |c_ULTIMATE.start_main_~b~0#1.offset|) (select .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset|)))) (not (<= v_ArrVal_339 1)))))))))) (<= c_~N~0 2) (or .cse17 (forall ((v_ArrVal_334 Int) (v_ArrVal_332 Int) (v_ArrVal_342 Int) (v_ArrVal_330 Int) (v_ArrVal_341 Int) (v_ArrVal_328 Int) (v_ArrVal_339 Int) (v_ArrVal_337 Int)) (let ((.cse20 (let ((.cse25 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse26 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_328)))) (store .cse25 |c_ULTIMATE.start_main_~b~0#1.base| (store (store (select .cse25 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| v_ArrVal_330) .cse9 v_ArrVal_332))))) (let ((.cse21 (select .cse20 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse18 (let ((.cse24 (store .cse20 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse21 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_337)))) (store .cse24 |c_ULTIMATE.start_main_~c~0#1.base| (store (store (select .cse24 |c_ULTIMATE.start_main_~c~0#1.base|) |c_ULTIMATE.start_main_~c~0#1.offset| v_ArrVal_339) .cse11 v_ArrVal_341))))) (let ((.cse19 (select .cse18 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (< (+ (select (select (store .cse18 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse19 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_342)) |c_ULTIMATE.start_main_~c~0#1.base|) .cse11) v_ArrVal_342) .cse12) (not (<= v_ArrVal_337 (+ v_ArrVal_334 (select (select (store .cse20 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse21 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_334)) |c_ULTIMATE.start_main_~b~0#1.base|) .cse9)))) (not (<= v_ArrVal_332 1)) (not (<= v_ArrVal_328 (+ .cse1 (select .cse22 .cse23)))) (not (<= v_ArrVal_341 1)) (not (<= v_ArrVal_342 (+ v_ArrVal_339 (select .cse19 |c_ULTIMATE.start_main_~#sum~0#1.offset|)))) (not (<= v_ArrVal_334 (+ v_ArrVal_330 (select .cse21 |c_ULTIMATE.start_main_~#sum~0#1.offset|)))) (not (<= v_ArrVal_330 1)) (not (<= v_ArrVal_339 1)))))))) .cse27 .cse28) (or .cse5 .cse29 .cse27 (forall ((v_ArrVal_334 Int) (v_ArrVal_332 Int) (v_ArrVal_342 Int) (v_ArrVal_330 Int) (v_ArrVal_341 Int) (v_ArrVal_328 Int) (v_ArrVal_339 Int) (v_ArrVal_337 Int)) (let ((.cse32 (let ((.cse36 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse26 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_328)))) (store .cse36 |c_ULTIMATE.start_main_~b~0#1.base| (store (store (select .cse36 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| v_ArrVal_330) .cse9 v_ArrVal_332))))) (let ((.cse33 (select .cse32 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse30 (let ((.cse35 (store .cse32 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse33 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_337)))) (store .cse35 |c_ULTIMATE.start_main_~c~0#1.base| (store (store (select .cse35 |c_ULTIMATE.start_main_~c~0#1.base|) |c_ULTIMATE.start_main_~c~0#1.offset| v_ArrVal_339) .cse11 v_ArrVal_341))))) (let ((.cse31 (select .cse30 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (< (+ (select (select (store .cse30 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse31 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_342)) |c_ULTIMATE.start_main_~c~0#1.base|) .cse11) v_ArrVal_342) .cse12) (not (<= v_ArrVal_337 (+ v_ArrVal_334 (select (select (store .cse32 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse33 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_334)) |c_ULTIMATE.start_main_~b~0#1.base|) .cse9)))) (not (<= v_ArrVal_332 1)) (not (<= v_ArrVal_341 1)) (not (<= v_ArrVal_342 (+ v_ArrVal_339 (select .cse31 |c_ULTIMATE.start_main_~#sum~0#1.offset|)))) (not (<= v_ArrVal_328 .cse34)) (not (<= v_ArrVal_334 (+ v_ArrVal_330 (select .cse33 |c_ULTIMATE.start_main_~#sum~0#1.offset|)))) (not (<= v_ArrVal_330 1)) (not (<= v_ArrVal_339 1))))))))) (or (< |c_ULTIMATE.start_main_~i~0#1| 1) (forall ((v_ArrVal_334 Int) (v_ArrVal_332 Int) (v_ArrVal_342 Int) (v_ArrVal_330 Int) (v_ArrVal_341 Int) (v_ArrVal_328 Int) (v_ArrVal_339 Int) (v_ArrVal_326 Int) (v_ArrVal_337 Int) (v_ArrVal_325 Int)) (let ((.cse37 (store .cse22 .cse47 v_ArrVal_325))) (let ((.cse40 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse37))) (let ((.cse38 (select .cse40 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse42 (let ((.cse46 (store .cse40 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse38 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_328)))) (store .cse46 |c_ULTIMATE.start_main_~b~0#1.base| (store (store (select .cse46 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| v_ArrVal_330) .cse9 v_ArrVal_332))))) (let ((.cse43 (select .cse42 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse44 (let ((.cse45 (store .cse42 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse43 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_337)))) (store .cse45 |c_ULTIMATE.start_main_~c~0#1.base| (store (store (select .cse45 |c_ULTIMATE.start_main_~c~0#1.base|) |c_ULTIMATE.start_main_~c~0#1.offset| v_ArrVal_339) .cse11 v_ArrVal_341))))) (let ((.cse39 (select .cse44 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (not (<= v_ArrVal_325 1)) (not (<= v_ArrVal_332 1)) (not (<= v_ArrVal_341 1)) (not (<= v_ArrVal_326 (+ (select .cse37 |c_ULTIMATE.start_main_~a~0#1.offset|) (select .cse38 |c_ULTIMATE.start_main_~#sum~0#1.offset|)))) (not (<= v_ArrVal_342 (+ (select .cse39 |c_ULTIMATE.start_main_~#sum~0#1.offset|) v_ArrVal_339))) (not (<= v_ArrVal_328 (+ (select (select (store .cse40 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse38 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_326)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse41) v_ArrVal_326))) (not (<= v_ArrVal_337 (+ v_ArrVal_334 (select (select (store .cse42 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse43 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_334)) |c_ULTIMATE.start_main_~b~0#1.base|) .cse9)))) (< (+ (select (select (store .cse44 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse39 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_342)) |c_ULTIMATE.start_main_~c~0#1.base|) .cse11) v_ArrVal_342) 7) (not (<= v_ArrVal_334 (+ v_ArrVal_330 (select .cse43 |c_ULTIMATE.start_main_~#sum~0#1.offset|)))) (not (<= v_ArrVal_330 1)) (not (<= v_ArrVal_339 1))))))))))) (< 1 |c_ULTIMATE.start_main_~i~0#1|)) (or .cse48 .cse49 (forall ((v_ArrVal_323 Int) (v_ArrVal_334 Int) (v_ArrVal_332 Int) (v_ArrVal_342 Int) (v_ArrVal_330 Int) (v_ArrVal_341 Int) (v_ArrVal_328 Int) (v_ArrVal_339 Int) (v_ArrVal_337 Int) (v_ArrVal_326 Int) (v_ArrVal_325 Int)) (let ((.cse50 (store (store .cse22 .cse47 v_ArrVal_323) .cse23 v_ArrVal_325))) (let ((.cse55 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse50))) (let ((.cse51 (select .cse55 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse54 (let ((.cse58 (store .cse55 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse51 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_328)))) (store .cse58 |c_ULTIMATE.start_main_~b~0#1.base| (store (store (select .cse58 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| v_ArrVal_330) .cse9 v_ArrVal_332))))) (let ((.cse52 (select .cse54 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse56 (let ((.cse57 (store .cse54 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse52 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_337)))) (store .cse57 |c_ULTIMATE.start_main_~c~0#1.base| (store (store (select .cse57 |c_ULTIMATE.start_main_~c~0#1.base|) |c_ULTIMATE.start_main_~c~0#1.offset| v_ArrVal_339) .cse11 v_ArrVal_341))))) (let ((.cse53 (select .cse56 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (not (<= v_ArrVal_325 1)) (not (<= v_ArrVal_332 1)) (not (<= v_ArrVal_326 (+ (select .cse50 |c_ULTIMATE.start_main_~a~0#1.offset|) (select .cse51 |c_ULTIMATE.start_main_~#sum~0#1.offset|)))) (not (<= v_ArrVal_341 1)) (not (<= v_ArrVal_334 (+ v_ArrVal_330 (select .cse52 |c_ULTIMATE.start_main_~#sum~0#1.offset|)))) (not (<= v_ArrVal_342 (+ v_ArrVal_339 (select .cse53 |c_ULTIMATE.start_main_~#sum~0#1.offset|)))) (not (<= v_ArrVal_337 (+ v_ArrVal_334 (select (select (store .cse54 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse52 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_334)) |c_ULTIMATE.start_main_~b~0#1.base|) .cse9)))) (not (<= v_ArrVal_328 (+ (select (select (store .cse55 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse51 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_326)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse41) v_ArrVal_326))) (not (<= v_ArrVal_323 1)) (< (+ (select (select (store .cse56 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse53 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_342)) |c_ULTIMATE.start_main_~c~0#1.base|) .cse11) v_ArrVal_342) 7) (not (<= v_ArrVal_330 1)) (not (<= v_ArrVal_339 1)))))))))))) (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~#sum~0#1.base|)) (or .cse17 (forall ((v_ArrVal_334 Int) (v_ArrVal_332 Int) (v_ArrVal_342 Int) (v_ArrVal_341 Int) (v_ArrVal_339 Int) (v_ArrVal_337 Int)) (let ((.cse59 (store .cse15 .cse65 v_ArrVal_332))) (let ((.cse61 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| .cse59))) (let ((.cse60 (select .cse61 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse62 (let ((.cse64 (store .cse61 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse60 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_337)))) (store .cse64 |c_ULTIMATE.start_main_~c~0#1.base| (store (store (select .cse64 |c_ULTIMATE.start_main_~c~0#1.base|) |c_ULTIMATE.start_main_~c~0#1.offset| v_ArrVal_339) .cse11 v_ArrVal_341))))) (let ((.cse63 (select .cse62 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (not (<= v_ArrVal_332 1)) (not (<= v_ArrVal_334 (+ (select .cse59 |c_ULTIMATE.start_main_~b~0#1.offset|) (select .cse60 |c_ULTIMATE.start_main_~#sum~0#1.offset|)))) (not (<= v_ArrVal_337 (+ v_ArrVal_334 (select (select (store .cse61 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse60 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_334)) |c_ULTIMATE.start_main_~b~0#1.base|) .cse9)))) (not (<= v_ArrVal_341 1)) (< (+ (select (select (store .cse62 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse63 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_342)) |c_ULTIMATE.start_main_~c~0#1.base|) .cse11) v_ArrVal_342) .cse12) (not (<= v_ArrVal_339 1)) (not (<= v_ArrVal_342 (+ (select .cse63 |c_ULTIMATE.start_main_~#sum~0#1.offset|) v_ArrVal_339))))))))))) (or .cse48 .cse49 (forall ((v_ArrVal_334 Int) (v_ArrVal_332 Int) (v_ArrVal_342 Int) (v_ArrVal_330 Int) (v_ArrVal_341 Int) (v_ArrVal_328 Int) (v_ArrVal_339 Int) (v_ArrVal_326 Int) (v_ArrVal_337 Int) (v_ArrVal_325 Int)) (let ((.cse71 (store .cse22 .cse23 v_ArrVal_325))) (let ((.cse72 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse71))) (let ((.cse70 (select .cse72 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse68 (let ((.cse74 (store .cse72 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse70 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_328)))) (store .cse74 |c_ULTIMATE.start_main_~b~0#1.base| (store (store (select .cse74 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| v_ArrVal_330) .cse9 v_ArrVal_332))))) (let ((.cse69 (select .cse68 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse66 (let ((.cse73 (store .cse68 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse69 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_337)))) (store .cse73 |c_ULTIMATE.start_main_~c~0#1.base| (store (store (select .cse73 |c_ULTIMATE.start_main_~c~0#1.base|) |c_ULTIMATE.start_main_~c~0#1.offset| v_ArrVal_339) .cse11 v_ArrVal_341))))) (let ((.cse67 (select .cse66 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (not (<= v_ArrVal_325 1)) (< (+ (select (select (store .cse66 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse67 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_342)) |c_ULTIMATE.start_main_~c~0#1.base|) .cse11) v_ArrVal_342) 7) (not (<= v_ArrVal_332 1)) (not (<= v_ArrVal_337 (+ v_ArrVal_334 (select (select (store .cse68 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse69 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_334)) |c_ULTIMATE.start_main_~b~0#1.base|) .cse9)))) (not (<= v_ArrVal_341 1)) (not (<= v_ArrVal_342 (+ v_ArrVal_339 (select .cse67 |c_ULTIMATE.start_main_~#sum~0#1.offset|)))) (not (<= v_ArrVal_334 (+ v_ArrVal_330 (select .cse69 |c_ULTIMATE.start_main_~#sum~0#1.offset|)))) (not (<= v_ArrVal_326 (+ (select .cse70 |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse71 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (not (<= v_ArrVal_330 1)) (not (<= v_ArrVal_339 1)) (not (<= v_ArrVal_328 (+ (select (select (store .cse72 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse70 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_326)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse41) v_ArrVal_326))))))))))))) (or .cse17 (forall ((v_ArrVal_334 Int) (v_ArrVal_332 Int) (v_ArrVal_342 Int) (v_ArrVal_330 Int) (v_ArrVal_341 Int) (v_ArrVal_339 Int) (v_ArrVal_337 Int)) (let ((.cse77 (store (store .cse15 .cse16 v_ArrVal_330) .cse65 v_ArrVal_332))) (let ((.cse75 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| .cse77))) (let ((.cse76 (select .cse75 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse79 (let ((.cse80 (store .cse75 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse76 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_337)))) (store .cse80 |c_ULTIMATE.start_main_~c~0#1.base| (store (store (select .cse80 |c_ULTIMATE.start_main_~c~0#1.base|) |c_ULTIMATE.start_main_~c~0#1.offset| v_ArrVal_339) .cse11 v_ArrVal_341))))) (let ((.cse78 (select .cse79 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (not (<= v_ArrVal_337 (+ v_ArrVal_334 (select (select (store .cse75 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse76 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_334)) |c_ULTIMATE.start_main_~b~0#1.base|) .cse9)))) (not (<= v_ArrVal_334 (+ (select .cse77 |c_ULTIMATE.start_main_~b~0#1.offset|) (select .cse76 |c_ULTIMATE.start_main_~#sum~0#1.offset|)))) (not (<= v_ArrVal_332 1)) (not (<= v_ArrVal_342 (+ (select .cse78 |c_ULTIMATE.start_main_~#sum~0#1.offset|) v_ArrVal_339))) (not (<= v_ArrVal_341 1)) (< (+ v_ArrVal_342 (select (select (store .cse79 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse78 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_342)) |c_ULTIMATE.start_main_~c~0#1.base|) .cse11)) .cse12) (not (<= v_ArrVal_330 1)) (not (<= v_ArrVal_339 1)))))))))) (or .cse17 .cse27 (forall ((v_ArrVal_334 Int) (v_ArrVal_332 Int) (v_ArrVal_342 Int) (v_ArrVal_330 Int) (v_ArrVal_341 Int) (v_ArrVal_328 Int) (v_ArrVal_339 Int) (v_ArrVal_337 Int) (v_ArrVal_326 Int)) (let ((.cse83 (let ((.cse86 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse26 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_328)))) (store .cse86 |c_ULTIMATE.start_main_~b~0#1.base| (store (store (select .cse86 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| v_ArrVal_330) .cse9 v_ArrVal_332))))) (let ((.cse84 (select .cse83 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse81 (let ((.cse85 (store .cse83 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse84 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_337)))) (store .cse85 |c_ULTIMATE.start_main_~c~0#1.base| (store (store (select .cse85 |c_ULTIMATE.start_main_~c~0#1.base|) |c_ULTIMATE.start_main_~c~0#1.offset| v_ArrVal_339) .cse11 v_ArrVal_341))))) (let ((.cse82 (select .cse81 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (< (+ (select (select (store .cse81 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse82 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_342)) |c_ULTIMATE.start_main_~c~0#1.base|) .cse11) v_ArrVal_342) .cse12) (not (<= v_ArrVal_337 (+ v_ArrVal_334 (select (select (store .cse83 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse84 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_334)) |c_ULTIMATE.start_main_~b~0#1.base|) .cse9)))) (not (<= v_ArrVal_326 .cse34)) (not (<= v_ArrVal_332 1)) (not (<= v_ArrVal_341 1)) (not (<= v_ArrVal_342 (+ v_ArrVal_339 (select .cse82 |c_ULTIMATE.start_main_~#sum~0#1.offset|)))) (not (<= v_ArrVal_328 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse26 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_326)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse23) v_ArrVal_326))) (not (<= v_ArrVal_334 (+ v_ArrVal_330 (select .cse84 |c_ULTIMATE.start_main_~#sum~0#1.offset|)))) (not (<= v_ArrVal_330 1)) (not (<= v_ArrVal_339 1)))))))) .cse28) (= 0 |c_ULTIMATE.start_main_~b~0#1.offset|))))) is different from true [2023-02-16 00:33:09,473 WARN L233 SmtUtils]: Spent 8.25s on a formula simplification that was a NOOP. DAG size: 132 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-16 00:33:16,698 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-16 00:33:19,240 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse13 (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse1 (< (+ |c_ULTIMATE.start_main_~i~0#1| 1) c_~N~0)) (.cse53 (select .cse13 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse54 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse57 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse22 (+ |c_ULTIMATE.start_main_~b~0#1.offset| .cse57 4)) (.cse10 (+ .cse53 (select .cse54 (+ |c_ULTIMATE.start_main_~a~0#1.offset| .cse57)))) (.cse0 (not (< |c_ULTIMATE.start_main_~i~0#1| c_~N~0))) (.cse21 (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|)) (.cse34 (+ |c_ULTIMATE.start_main_~b~0#1.offset| .cse57)) (.cse14 (not .cse1)) (.cse6 (+ (* 3 c_~N~0) 1)) (.cse39 (+ |c_ULTIMATE.start_main_~a~0#1.offset| .cse57 4)) (.cse5 (+ |c_ULTIMATE.start_main_~c~0#1.offset| 4)) (.cse9 (+ |c_ULTIMATE.start_main_~b~0#1.offset| 4)) (.cse2 (not (< 1 c_~N~0))) (.cse42 (< (+ |c_ULTIMATE.start_main_~i~0#1| 2) c_~N~0))) (and (or .cse0 .cse1 .cse2 (forall ((v_ArrVal_334 Int) (v_ArrVal_332 Int) (v_ArrVal_342 Int) (v_ArrVal_330 Int) (v_ArrVal_341 Int) (v_ArrVal_328 Int) (v_ArrVal_339 Int) (v_ArrVal_337 Int)) (let ((.cse7 (let ((.cse12 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_328)))) (store .cse12 |c_ULTIMATE.start_main_~b~0#1.base| (store (store (select .cse12 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| v_ArrVal_330) .cse9 v_ArrVal_332))))) (let ((.cse8 (select .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse3 (let ((.cse11 (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_337)))) (store .cse11 |c_ULTIMATE.start_main_~c~0#1.base| (store (store (select .cse11 |c_ULTIMATE.start_main_~c~0#1.base|) |c_ULTIMATE.start_main_~c~0#1.offset| v_ArrVal_339) .cse5 v_ArrVal_341))))) (let ((.cse4 (select .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (< (+ (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_342)) |c_ULTIMATE.start_main_~c~0#1.base|) .cse5) v_ArrVal_342) .cse6) (not (<= v_ArrVal_337 (+ v_ArrVal_334 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_334)) |c_ULTIMATE.start_main_~b~0#1.base|) .cse9)))) (not (<= v_ArrVal_332 1)) (not (<= v_ArrVal_341 1)) (not (<= v_ArrVal_342 (+ v_ArrVal_339 (select .cse4 |c_ULTIMATE.start_main_~#sum~0#1.offset|)))) (not (<= v_ArrVal_328 .cse10)) (not (<= v_ArrVal_334 (+ v_ArrVal_330 (select .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset|)))) (not (<= v_ArrVal_330 1)) (not (<= v_ArrVal_339 1))))))))) (or .cse14 (forall ((v_ArrVal_334 Int) (v_ArrVal_332 Int) (v_ArrVal_342 Int) (v_ArrVal_341 Int) (v_ArrVal_339 Int) (v_ArrVal_337 Int)) (let ((.cse15 (store .cse21 .cse22 v_ArrVal_332))) (let ((.cse17 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| .cse15))) (let ((.cse16 (select .cse17 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse18 (let ((.cse20 (store .cse17 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse16 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_337)))) (store .cse20 |c_ULTIMATE.start_main_~c~0#1.base| (store (store (select .cse20 |c_ULTIMATE.start_main_~c~0#1.base|) |c_ULTIMATE.start_main_~c~0#1.offset| v_ArrVal_339) .cse5 v_ArrVal_341))))) (let ((.cse19 (select .cse18 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (not (<= v_ArrVal_332 1)) (not (<= v_ArrVal_334 (+ (select .cse15 |c_ULTIMATE.start_main_~b~0#1.offset|) (select .cse16 |c_ULTIMATE.start_main_~#sum~0#1.offset|)))) (not (<= v_ArrVal_337 (+ v_ArrVal_334 (select (select (store .cse17 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse16 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_334)) |c_ULTIMATE.start_main_~b~0#1.base|) .cse9)))) (not (<= v_ArrVal_341 1)) (< (+ (select (select (store .cse18 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse19 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_342)) |c_ULTIMATE.start_main_~c~0#1.base|) .cse5) v_ArrVal_342) .cse6) (not (<= v_ArrVal_339 1)) (not (<= v_ArrVal_342 (+ (select .cse19 |c_ULTIMATE.start_main_~#sum~0#1.offset|) v_ArrVal_339))))))))))) (or (forall ((v_ArrVal_334 Int) (v_ArrVal_332 Int) (v_ArrVal_342 Int) (v_ArrVal_330 Int) (v_ArrVal_341 Int) (v_ArrVal_339 Int) (v_ArrVal_337 Int)) (let ((.cse25 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| (store (store .cse21 |c_ULTIMATE.start_main_~b~0#1.offset| v_ArrVal_330) .cse9 v_ArrVal_332)))) (let ((.cse26 (select .cse25 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse23 (let ((.cse27 (store .cse25 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse26 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_337)))) (store .cse27 |c_ULTIMATE.start_main_~c~0#1.base| (store (store (select .cse27 |c_ULTIMATE.start_main_~c~0#1.base|) |c_ULTIMATE.start_main_~c~0#1.offset| v_ArrVal_339) .cse5 v_ArrVal_341))))) (let ((.cse24 (select .cse23 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (< (+ (select (select (store .cse23 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse24 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_342)) |c_ULTIMATE.start_main_~c~0#1.base|) .cse5) v_ArrVal_342) .cse6) (not (<= v_ArrVal_332 1)) (not (<= v_ArrVal_341 1)) (not (<= v_ArrVal_337 (+ v_ArrVal_334 (select (select (store .cse25 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse26 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_334)) |c_ULTIMATE.start_main_~b~0#1.base|) .cse9)))) (not (<= v_ArrVal_334 (+ v_ArrVal_330 (select .cse26 |c_ULTIMATE.start_main_~#sum~0#1.offset|)))) (not (<= v_ArrVal_342 (+ (select .cse24 |c_ULTIMATE.start_main_~#sum~0#1.offset|) v_ArrVal_339))) (not (<= v_ArrVal_339 1)) (not (<= v_ArrVal_330 1)))))))) .cse2) (or .cse14 (forall ((v_ArrVal_334 Int) (v_ArrVal_332 Int) (v_ArrVal_342 Int) (v_ArrVal_330 Int) (v_ArrVal_341 Int) (v_ArrVal_339 Int) (v_ArrVal_337 Int)) (let ((.cse30 (store (store .cse21 .cse34 v_ArrVal_330) .cse22 v_ArrVal_332))) (let ((.cse28 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| .cse30))) (let ((.cse29 (select .cse28 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse32 (let ((.cse33 (store .cse28 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse29 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_337)))) (store .cse33 |c_ULTIMATE.start_main_~c~0#1.base| (store (store (select .cse33 |c_ULTIMATE.start_main_~c~0#1.base|) |c_ULTIMATE.start_main_~c~0#1.offset| v_ArrVal_339) .cse5 v_ArrVal_341))))) (let ((.cse31 (select .cse32 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (not (<= v_ArrVal_337 (+ v_ArrVal_334 (select (select (store .cse28 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse29 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_334)) |c_ULTIMATE.start_main_~b~0#1.base|) .cse9)))) (not (<= v_ArrVal_334 (+ (select .cse30 |c_ULTIMATE.start_main_~b~0#1.offset|) (select .cse29 |c_ULTIMATE.start_main_~#sum~0#1.offset|)))) (not (<= v_ArrVal_332 1)) (not (<= v_ArrVal_342 (+ (select .cse31 |c_ULTIMATE.start_main_~#sum~0#1.offset|) v_ArrVal_339))) (not (<= v_ArrVal_341 1)) (< (+ v_ArrVal_342 (select (select (store .cse32 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse31 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_342)) |c_ULTIMATE.start_main_~c~0#1.base|) .cse5)) .cse6) (not (<= v_ArrVal_330 1)) (not (<= v_ArrVal_339 1)))))))))) (or .cse14 .cse2 (forall ((v_ArrVal_334 Int) (v_ArrVal_332 Int) (v_ArrVal_342 Int) (v_ArrVal_330 Int) (v_ArrVal_341 Int) (v_ArrVal_328 Int) (v_ArrVal_339 Int) (v_ArrVal_337 Int) (v_ArrVal_326 Int)) (let ((.cse37 (let ((.cse41 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_328)))) (store .cse41 |c_ULTIMATE.start_main_~b~0#1.base| (store (store (select .cse41 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| v_ArrVal_330) .cse9 v_ArrVal_332))))) (let ((.cse38 (select .cse37 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse35 (let ((.cse40 (store .cse37 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse38 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_337)))) (store .cse40 |c_ULTIMATE.start_main_~c~0#1.base| (store (store (select .cse40 |c_ULTIMATE.start_main_~c~0#1.base|) |c_ULTIMATE.start_main_~c~0#1.offset| v_ArrVal_339) .cse5 v_ArrVal_341))))) (let ((.cse36 (select .cse35 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (< (+ (select (select (store .cse35 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse36 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_342)) |c_ULTIMATE.start_main_~c~0#1.base|) .cse5) v_ArrVal_342) .cse6) (not (<= v_ArrVal_337 (+ v_ArrVal_334 (select (select (store .cse37 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse38 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_334)) |c_ULTIMATE.start_main_~b~0#1.base|) .cse9)))) (not (<= v_ArrVal_326 .cse10)) (not (<= v_ArrVal_332 1)) (not (<= v_ArrVal_341 1)) (not (<= v_ArrVal_342 (+ v_ArrVal_339 (select .cse36 |c_ULTIMATE.start_main_~#sum~0#1.offset|)))) (not (<= v_ArrVal_328 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_326)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse39) v_ArrVal_326))) (not (<= v_ArrVal_334 (+ v_ArrVal_330 (select .cse38 |c_ULTIMATE.start_main_~#sum~0#1.offset|)))) (not (<= v_ArrVal_330 1)) (not (<= v_ArrVal_339 1)))))))) .cse42) (or .cse0 (forall ((v_ArrVal_334 Int) (v_ArrVal_332 Int) (v_ArrVal_342 Int) (v_ArrVal_341 Int) (v_ArrVal_339 Int) (v_ArrVal_337 Int)) (let ((.cse47 (store .cse21 .cse34 v_ArrVal_332))) (let ((.cse44 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| .cse47))) (let ((.cse45 (select .cse44 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse46 (let ((.cse48 (store .cse44 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse45 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_337)))) (store .cse48 |c_ULTIMATE.start_main_~c~0#1.base| (store (store (select .cse48 |c_ULTIMATE.start_main_~c~0#1.base|) |c_ULTIMATE.start_main_~c~0#1.offset| v_ArrVal_339) .cse5 v_ArrVal_341))))) (let ((.cse43 (select .cse46 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (not (<= v_ArrVal_342 (+ v_ArrVal_339 (select .cse43 |c_ULTIMATE.start_main_~#sum~0#1.offset|)))) (not (<= v_ArrVal_337 (+ v_ArrVal_334 (select (select (store .cse44 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse45 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_334)) |c_ULTIMATE.start_main_~b~0#1.base|) .cse9)))) (not (<= v_ArrVal_332 1)) (not (<= v_ArrVal_341 1)) (< (+ v_ArrVal_342 (select (select (store .cse46 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse43 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_342)) |c_ULTIMATE.start_main_~c~0#1.base|) .cse5)) .cse6) (not (<= v_ArrVal_334 (+ (select .cse47 |c_ULTIMATE.start_main_~b~0#1.offset|) (select .cse45 |c_ULTIMATE.start_main_~#sum~0#1.offset|)))) (not (<= v_ArrVal_339 1)))))))))) (or .cse14 (forall ((v_ArrVal_334 Int) (v_ArrVal_332 Int) (v_ArrVal_342 Int) (v_ArrVal_330 Int) (v_ArrVal_341 Int) (v_ArrVal_328 Int) (v_ArrVal_339 Int) (v_ArrVal_337 Int)) (let ((.cse51 (let ((.cse56 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_328)))) (store .cse56 |c_ULTIMATE.start_main_~b~0#1.base| (store (store (select .cse56 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| v_ArrVal_330) .cse9 v_ArrVal_332))))) (let ((.cse52 (select .cse51 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse49 (let ((.cse55 (store .cse51 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse52 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_337)))) (store .cse55 |c_ULTIMATE.start_main_~c~0#1.base| (store (store (select .cse55 |c_ULTIMATE.start_main_~c~0#1.base|) |c_ULTIMATE.start_main_~c~0#1.offset| v_ArrVal_339) .cse5 v_ArrVal_341))))) (let ((.cse50 (select .cse49 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (< (+ (select (select (store .cse49 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse50 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_342)) |c_ULTIMATE.start_main_~c~0#1.base|) .cse5) v_ArrVal_342) .cse6) (not (<= v_ArrVal_337 (+ v_ArrVal_334 (select (select (store .cse51 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse52 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_334)) |c_ULTIMATE.start_main_~b~0#1.base|) .cse9)))) (not (<= v_ArrVal_332 1)) (not (<= v_ArrVal_328 (+ .cse53 (select .cse54 .cse39)))) (not (<= v_ArrVal_341 1)) (not (<= v_ArrVal_342 (+ v_ArrVal_339 (select .cse50 |c_ULTIMATE.start_main_~#sum~0#1.offset|)))) (not (<= v_ArrVal_334 (+ v_ArrVal_330 (select .cse52 |c_ULTIMATE.start_main_~#sum~0#1.offset|)))) (not (<= v_ArrVal_330 1)) (not (<= v_ArrVal_339 1)))))))) .cse2 .cse42))))) is different from true [2023-02-16 00:33:32,018 WARN L233 SmtUtils]: Spent 10.37s on a formula simplification that was a NOOP. DAG size: 130 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-16 00:33:34,068 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse84 (* |c_ULTIMATE.start_main_~i~0#1| 4)) (.cse23 (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse0 (select .cse23 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse19 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse44 (+ |c_ULTIMATE.start_main_~a~0#1.offset| .cse84)) (.cse1 (* 3 c_~N~0)) (.cse26 (< (+ |c_ULTIMATE.start_main_~i~0#1| 1) c_~N~0))) (let ((.cse2 (not (< |c_ULTIMATE.start_main_~i~0#1| c_~N~0))) (.cse45 (< 0 |c_ULTIMATE.start_main_~i~0#1|)) (.cse46 (< |c_ULTIMATE.start_main_~i~0#1| 0)) (.cse38 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (.cse12 (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|)) (.cse13 (+ |c_ULTIMATE.start_main_~b~0#1.offset| .cse84)) (.cse62 (+ |c_ULTIMATE.start_main_~b~0#1.offset| .cse84 4)) (.cse14 (not .cse26)) (.cse24 (not (< 1 c_~N~0))) (.cse9 (+ .cse1 1)) (.cse31 (+ .cse0 (select .cse19 .cse44))) (.cse20 (+ |c_ULTIMATE.start_main_~a~0#1.offset| .cse84 4)) (.cse8 (+ |c_ULTIMATE.start_main_~c~0#1.offset| 4)) (.cse6 (+ |c_ULTIMATE.start_main_~b~0#1.offset| 4)) (.cse25 (< (+ |c_ULTIMATE.start_main_~i~0#1| 2) c_~N~0))) (and (= |c_ULTIMATE.start_main_~c~0#1.offset| 0) (<= (+ .cse0 4) .cse1) (or .cse2 (forall ((v_ArrVal_334 Int) (v_ArrVal_332 Int) (v_ArrVal_342 Int) (v_ArrVal_341 Int) (v_ArrVal_339 Int) (v_ArrVal_337 Int)) (let ((.cse10 (store .cse12 .cse13 v_ArrVal_332))) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| .cse10))) (let ((.cse5 (select .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse7 (let ((.cse11 (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_337)))) (store .cse11 |c_ULTIMATE.start_main_~c~0#1.base| (store (store (select .cse11 |c_ULTIMATE.start_main_~c~0#1.base|) |c_ULTIMATE.start_main_~c~0#1.offset| v_ArrVal_339) .cse8 v_ArrVal_341))))) (let ((.cse3 (select .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (not (<= v_ArrVal_342 (+ v_ArrVal_339 (select .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset|)))) (not (<= v_ArrVal_337 (+ v_ArrVal_334 (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_334)) |c_ULTIMATE.start_main_~b~0#1.base|) .cse6)))) (not (<= v_ArrVal_332 1)) (not (<= v_ArrVal_341 1)) (< (+ v_ArrVal_342 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_342)) |c_ULTIMATE.start_main_~c~0#1.base|) .cse8)) .cse9) (not (<= v_ArrVal_334 (+ (select .cse10 |c_ULTIMATE.start_main_~b~0#1.offset|) (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset|)))) (not (<= v_ArrVal_339 1)))))))))) (or .cse14 (forall ((v_ArrVal_334 Int) (v_ArrVal_332 Int) (v_ArrVal_342 Int) (v_ArrVal_330 Int) (v_ArrVal_341 Int) (v_ArrVal_328 Int) (v_ArrVal_339 Int) (v_ArrVal_337 Int)) (let ((.cse17 (let ((.cse22 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse23 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_328)))) (store .cse22 |c_ULTIMATE.start_main_~b~0#1.base| (store (store (select .cse22 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| v_ArrVal_330) .cse6 v_ArrVal_332))))) (let ((.cse18 (select .cse17 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse15 (let ((.cse21 (store .cse17 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse18 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_337)))) (store .cse21 |c_ULTIMATE.start_main_~c~0#1.base| (store (store (select .cse21 |c_ULTIMATE.start_main_~c~0#1.base|) |c_ULTIMATE.start_main_~c~0#1.offset| v_ArrVal_339) .cse8 v_ArrVal_341))))) (let ((.cse16 (select .cse15 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (< (+ (select (select (store .cse15 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse16 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_342)) |c_ULTIMATE.start_main_~c~0#1.base|) .cse8) v_ArrVal_342) .cse9) (not (<= v_ArrVal_337 (+ v_ArrVal_334 (select (select (store .cse17 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse18 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_334)) |c_ULTIMATE.start_main_~b~0#1.base|) .cse6)))) (not (<= v_ArrVal_332 1)) (not (<= v_ArrVal_328 (+ .cse0 (select .cse19 .cse20)))) (not (<= v_ArrVal_341 1)) (not (<= v_ArrVal_342 (+ v_ArrVal_339 (select .cse16 |c_ULTIMATE.start_main_~#sum~0#1.offset|)))) (not (<= v_ArrVal_334 (+ v_ArrVal_330 (select .cse18 |c_ULTIMATE.start_main_~#sum~0#1.offset|)))) (not (<= v_ArrVal_330 1)) (not (<= v_ArrVal_339 1)))))))) .cse24 .cse25) (<= 2 c_~N~0) (or .cse2 .cse26 .cse24 (forall ((v_ArrVal_334 Int) (v_ArrVal_332 Int) (v_ArrVal_342 Int) (v_ArrVal_330 Int) (v_ArrVal_341 Int) (v_ArrVal_328 Int) (v_ArrVal_339 Int) (v_ArrVal_337 Int)) (let ((.cse29 (let ((.cse33 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse23 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_328)))) (store .cse33 |c_ULTIMATE.start_main_~b~0#1.base| (store (store (select .cse33 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| v_ArrVal_330) .cse6 v_ArrVal_332))))) (let ((.cse30 (select .cse29 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse27 (let ((.cse32 (store .cse29 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse30 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_337)))) (store .cse32 |c_ULTIMATE.start_main_~c~0#1.base| (store (store (select .cse32 |c_ULTIMATE.start_main_~c~0#1.base|) |c_ULTIMATE.start_main_~c~0#1.offset| v_ArrVal_339) .cse8 v_ArrVal_341))))) (let ((.cse28 (select .cse27 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (< (+ (select (select (store .cse27 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse28 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_342)) |c_ULTIMATE.start_main_~c~0#1.base|) .cse8) v_ArrVal_342) .cse9) (not (<= v_ArrVal_337 (+ v_ArrVal_334 (select (select (store .cse29 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse30 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_334)) |c_ULTIMATE.start_main_~b~0#1.base|) .cse6)))) (not (<= v_ArrVal_332 1)) (not (<= v_ArrVal_341 1)) (not (<= v_ArrVal_342 (+ v_ArrVal_339 (select .cse28 |c_ULTIMATE.start_main_~#sum~0#1.offset|)))) (not (<= v_ArrVal_328 .cse31)) (not (<= v_ArrVal_334 (+ v_ArrVal_330 (select .cse30 |c_ULTIMATE.start_main_~#sum~0#1.offset|)))) (not (<= v_ArrVal_330 1)) (not (<= v_ArrVal_339 1))))))))) (or (< |c_ULTIMATE.start_main_~i~0#1| 1) (forall ((v_ArrVal_334 Int) (v_ArrVal_332 Int) (v_ArrVal_342 Int) (v_ArrVal_330 Int) (v_ArrVal_341 Int) (v_ArrVal_328 Int) (v_ArrVal_339 Int) (v_ArrVal_326 Int) (v_ArrVal_337 Int) (v_ArrVal_325 Int)) (let ((.cse34 (store .cse19 .cse44 v_ArrVal_325))) (let ((.cse37 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse34))) (let ((.cse35 (select .cse37 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse39 (let ((.cse43 (store .cse37 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse35 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_328)))) (store .cse43 |c_ULTIMATE.start_main_~b~0#1.base| (store (store (select .cse43 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| v_ArrVal_330) .cse6 v_ArrVal_332))))) (let ((.cse40 (select .cse39 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse41 (let ((.cse42 (store .cse39 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse40 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_337)))) (store .cse42 |c_ULTIMATE.start_main_~c~0#1.base| (store (store (select .cse42 |c_ULTIMATE.start_main_~c~0#1.base|) |c_ULTIMATE.start_main_~c~0#1.offset| v_ArrVal_339) .cse8 v_ArrVal_341))))) (let ((.cse36 (select .cse41 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (not (<= v_ArrVal_325 1)) (not (<= v_ArrVal_332 1)) (not (<= v_ArrVal_341 1)) (not (<= v_ArrVal_326 (+ (select .cse34 |c_ULTIMATE.start_main_~a~0#1.offset|) (select .cse35 |c_ULTIMATE.start_main_~#sum~0#1.offset|)))) (not (<= v_ArrVal_342 (+ (select .cse36 |c_ULTIMATE.start_main_~#sum~0#1.offset|) v_ArrVal_339))) (not (<= v_ArrVal_328 (+ (select (select (store .cse37 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse35 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_326)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse38) v_ArrVal_326))) (not (<= v_ArrVal_337 (+ v_ArrVal_334 (select (select (store .cse39 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse40 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_334)) |c_ULTIMATE.start_main_~b~0#1.base|) .cse6)))) (< (+ (select (select (store .cse41 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse36 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_342)) |c_ULTIMATE.start_main_~c~0#1.base|) .cse8) v_ArrVal_342) 7) (not (<= v_ArrVal_334 (+ v_ArrVal_330 (select .cse40 |c_ULTIMATE.start_main_~#sum~0#1.offset|)))) (not (<= v_ArrVal_330 1)) (not (<= v_ArrVal_339 1))))))))))) (< 1 |c_ULTIMATE.start_main_~i~0#1|)) (or .cse45 .cse46 (forall ((v_ArrVal_323 Int) (v_ArrVal_334 Int) (v_ArrVal_332 Int) (v_ArrVal_342 Int) (v_ArrVal_330 Int) (v_ArrVal_341 Int) (v_ArrVal_328 Int) (v_ArrVal_339 Int) (v_ArrVal_337 Int) (v_ArrVal_326 Int) (v_ArrVal_325 Int)) (let ((.cse47 (store (store .cse19 .cse44 v_ArrVal_323) .cse20 v_ArrVal_325))) (let ((.cse52 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse47))) (let ((.cse48 (select .cse52 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse51 (let ((.cse55 (store .cse52 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse48 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_328)))) (store .cse55 |c_ULTIMATE.start_main_~b~0#1.base| (store (store (select .cse55 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| v_ArrVal_330) .cse6 v_ArrVal_332))))) (let ((.cse49 (select .cse51 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse53 (let ((.cse54 (store .cse51 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse49 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_337)))) (store .cse54 |c_ULTIMATE.start_main_~c~0#1.base| (store (store (select .cse54 |c_ULTIMATE.start_main_~c~0#1.base|) |c_ULTIMATE.start_main_~c~0#1.offset| v_ArrVal_339) .cse8 v_ArrVal_341))))) (let ((.cse50 (select .cse53 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (not (<= v_ArrVal_325 1)) (not (<= v_ArrVal_332 1)) (not (<= v_ArrVal_326 (+ (select .cse47 |c_ULTIMATE.start_main_~a~0#1.offset|) (select .cse48 |c_ULTIMATE.start_main_~#sum~0#1.offset|)))) (not (<= v_ArrVal_341 1)) (not (<= v_ArrVal_334 (+ v_ArrVal_330 (select .cse49 |c_ULTIMATE.start_main_~#sum~0#1.offset|)))) (not (<= v_ArrVal_342 (+ v_ArrVal_339 (select .cse50 |c_ULTIMATE.start_main_~#sum~0#1.offset|)))) (not (<= v_ArrVal_337 (+ v_ArrVal_334 (select (select (store .cse51 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse49 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_334)) |c_ULTIMATE.start_main_~b~0#1.base|) .cse6)))) (not (<= v_ArrVal_328 (+ (select (select (store .cse52 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse48 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_326)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse38) v_ArrVal_326))) (not (<= v_ArrVal_323 1)) (< (+ (select (select (store .cse53 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse50 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_342)) |c_ULTIMATE.start_main_~c~0#1.base|) .cse8) v_ArrVal_342) 7) (not (<= v_ArrVal_330 1)) (not (<= v_ArrVal_339 1)))))))))))) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~c~0#1.base|)) (or .cse14 (forall ((v_ArrVal_334 Int) (v_ArrVal_332 Int) (v_ArrVal_342 Int) (v_ArrVal_341 Int) (v_ArrVal_339 Int) (v_ArrVal_337 Int)) (let ((.cse56 (store .cse12 .cse62 v_ArrVal_332))) (let ((.cse58 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| .cse56))) (let ((.cse57 (select .cse58 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse59 (let ((.cse61 (store .cse58 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse57 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_337)))) (store .cse61 |c_ULTIMATE.start_main_~c~0#1.base| (store (store (select .cse61 |c_ULTIMATE.start_main_~c~0#1.base|) |c_ULTIMATE.start_main_~c~0#1.offset| v_ArrVal_339) .cse8 v_ArrVal_341))))) (let ((.cse60 (select .cse59 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (not (<= v_ArrVal_332 1)) (not (<= v_ArrVal_334 (+ (select .cse56 |c_ULTIMATE.start_main_~b~0#1.offset|) (select .cse57 |c_ULTIMATE.start_main_~#sum~0#1.offset|)))) (not (<= v_ArrVal_337 (+ v_ArrVal_334 (select (select (store .cse58 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse57 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_334)) |c_ULTIMATE.start_main_~b~0#1.base|) .cse6)))) (not (<= v_ArrVal_341 1)) (< (+ (select (select (store .cse59 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse60 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_342)) |c_ULTIMATE.start_main_~c~0#1.base|) .cse8) v_ArrVal_342) .cse9) (not (<= v_ArrVal_339 1)) (not (<= v_ArrVal_342 (+ (select .cse60 |c_ULTIMATE.start_main_~#sum~0#1.offset|) v_ArrVal_339))))))))))) (or .cse45 .cse46 (forall ((v_ArrVal_334 Int) (v_ArrVal_332 Int) (v_ArrVal_342 Int) (v_ArrVal_330 Int) (v_ArrVal_341 Int) (v_ArrVal_328 Int) (v_ArrVal_339 Int) (v_ArrVal_326 Int) (v_ArrVal_337 Int) (v_ArrVal_325 Int)) (let ((.cse68 (store .cse19 .cse20 v_ArrVal_325))) (let ((.cse69 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse68))) (let ((.cse67 (select .cse69 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse65 (let ((.cse71 (store .cse69 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse67 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_328)))) (store .cse71 |c_ULTIMATE.start_main_~b~0#1.base| (store (store (select .cse71 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| v_ArrVal_330) .cse6 v_ArrVal_332))))) (let ((.cse66 (select .cse65 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse63 (let ((.cse70 (store .cse65 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse66 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_337)))) (store .cse70 |c_ULTIMATE.start_main_~c~0#1.base| (store (store (select .cse70 |c_ULTIMATE.start_main_~c~0#1.base|) |c_ULTIMATE.start_main_~c~0#1.offset| v_ArrVal_339) .cse8 v_ArrVal_341))))) (let ((.cse64 (select .cse63 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (not (<= v_ArrVal_325 1)) (< (+ (select (select (store .cse63 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse64 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_342)) |c_ULTIMATE.start_main_~c~0#1.base|) .cse8) v_ArrVal_342) 7) (not (<= v_ArrVal_332 1)) (not (<= v_ArrVal_337 (+ v_ArrVal_334 (select (select (store .cse65 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse66 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_334)) |c_ULTIMATE.start_main_~b~0#1.base|) .cse6)))) (not (<= v_ArrVal_341 1)) (not (<= v_ArrVal_342 (+ v_ArrVal_339 (select .cse64 |c_ULTIMATE.start_main_~#sum~0#1.offset|)))) (not (<= v_ArrVal_334 (+ v_ArrVal_330 (select .cse66 |c_ULTIMATE.start_main_~#sum~0#1.offset|)))) (not (<= v_ArrVal_326 (+ (select .cse67 |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse68 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (not (<= v_ArrVal_330 1)) (not (<= v_ArrVal_339 1)) (not (<= v_ArrVal_328 (+ (select (select (store .cse69 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse67 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_326)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse38) v_ArrVal_326))))))))))))) (or .cse14 (forall ((v_ArrVal_334 Int) (v_ArrVal_332 Int) (v_ArrVal_342 Int) (v_ArrVal_330 Int) (v_ArrVal_341 Int) (v_ArrVal_339 Int) (v_ArrVal_337 Int)) (let ((.cse74 (store (store .cse12 .cse13 v_ArrVal_330) .cse62 v_ArrVal_332))) (let ((.cse72 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| .cse74))) (let ((.cse73 (select .cse72 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse76 (let ((.cse77 (store .cse72 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse73 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_337)))) (store .cse77 |c_ULTIMATE.start_main_~c~0#1.base| (store (store (select .cse77 |c_ULTIMATE.start_main_~c~0#1.base|) |c_ULTIMATE.start_main_~c~0#1.offset| v_ArrVal_339) .cse8 v_ArrVal_341))))) (let ((.cse75 (select .cse76 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (not (<= v_ArrVal_337 (+ v_ArrVal_334 (select (select (store .cse72 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse73 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_334)) |c_ULTIMATE.start_main_~b~0#1.base|) .cse6)))) (not (<= v_ArrVal_334 (+ (select .cse74 |c_ULTIMATE.start_main_~b~0#1.offset|) (select .cse73 |c_ULTIMATE.start_main_~#sum~0#1.offset|)))) (not (<= v_ArrVal_332 1)) (not (<= v_ArrVal_342 (+ (select .cse75 |c_ULTIMATE.start_main_~#sum~0#1.offset|) v_ArrVal_339))) (not (<= v_ArrVal_341 1)) (< (+ v_ArrVal_342 (select (select (store .cse76 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse75 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_342)) |c_ULTIMATE.start_main_~c~0#1.base|) .cse8)) .cse9) (not (<= v_ArrVal_330 1)) (not (<= v_ArrVal_339 1)))))))))) (or .cse14 .cse24 (forall ((v_ArrVal_334 Int) (v_ArrVal_332 Int) (v_ArrVal_342 Int) (v_ArrVal_330 Int) (v_ArrVal_341 Int) (v_ArrVal_328 Int) (v_ArrVal_339 Int) (v_ArrVal_337 Int) (v_ArrVal_326 Int)) (let ((.cse80 (let ((.cse83 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse23 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_328)))) (store .cse83 |c_ULTIMATE.start_main_~b~0#1.base| (store (store (select .cse83 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| v_ArrVal_330) .cse6 v_ArrVal_332))))) (let ((.cse81 (select .cse80 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse78 (let ((.cse82 (store .cse80 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse81 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_337)))) (store .cse82 |c_ULTIMATE.start_main_~c~0#1.base| (store (store (select .cse82 |c_ULTIMATE.start_main_~c~0#1.base|) |c_ULTIMATE.start_main_~c~0#1.offset| v_ArrVal_339) .cse8 v_ArrVal_341))))) (let ((.cse79 (select .cse78 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (< (+ (select (select (store .cse78 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse79 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_342)) |c_ULTIMATE.start_main_~c~0#1.base|) .cse8) v_ArrVal_342) .cse9) (not (<= v_ArrVal_337 (+ v_ArrVal_334 (select (select (store .cse80 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse81 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_334)) |c_ULTIMATE.start_main_~b~0#1.base|) .cse6)))) (not (<= v_ArrVal_326 .cse31)) (not (<= v_ArrVal_332 1)) (not (<= v_ArrVal_341 1)) (not (<= v_ArrVal_342 (+ v_ArrVal_339 (select .cse79 |c_ULTIMATE.start_main_~#sum~0#1.offset|)))) (not (<= v_ArrVal_328 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse23 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_326)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse20) v_ArrVal_326))) (not (<= v_ArrVal_334 (+ v_ArrVal_330 (select .cse81 |c_ULTIMATE.start_main_~#sum~0#1.offset|)))) (not (<= v_ArrVal_330 1)) (not (<= v_ArrVal_339 1)))))))) .cse25) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~b~0#1.base|)) (= |c_ULTIMATE.start_main_~b~0#1.offset| 0))))) is different from true [2023-02-16 00:33:36,774 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-16 00:33:48,891 WARN L233 SmtUtils]: Spent 9.30s on a formula simplification that was a NOOP. DAG size: 170 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)