/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerCTransformed.xml -s ../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf -i ../../../trunk/examples/svcomp/array-fpi/ss4.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-d966a43 [2022-01-31 12:00:16,112 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-31 12:00:16,113 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-31 12:00:16,142 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-31 12:00:16,142 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-31 12:00:16,143 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-31 12:00:16,149 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-31 12:00:16,150 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-31 12:00:16,160 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-31 12:00:16,165 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-31 12:00:16,165 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-31 12:00:16,166 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-31 12:00:16,166 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-31 12:00:16,167 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-31 12:00:16,167 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-31 12:00:16,168 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-31 12:00:16,168 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-31 12:00:16,169 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-31 12:00:16,170 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-31 12:00:16,173 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-31 12:00:16,177 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-31 12:00:16,179 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-31 12:00:16,181 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-31 12:00:16,183 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-31 12:00:16,188 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-31 12:00:16,188 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-31 12:00:16,188 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-31 12:00:16,188 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-31 12:00:16,189 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-31 12:00:16,189 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-31 12:00:16,189 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-31 12:00:16,190 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-31 12:00:16,190 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-31 12:00:16,191 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-31 12:00:16,191 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-31 12:00:16,191 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-31 12:00:16,192 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-31 12:00:16,192 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-31 12:00:16,192 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-31 12:00:16,193 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-31 12:00:16,193 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-31 12:00:16,200 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf [2022-01-31 12:00:16,206 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-31 12:00:16,206 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-31 12:00:16,207 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-31 12:00:16,207 INFO L138 SettingsManager]: * sizeof long=4 [2022-01-31 12:00:16,207 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-31 12:00:16,207 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-01-31 12:00:16,207 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-31 12:00:16,208 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-31 12:00:16,208 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-31 12:00:16,208 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-31 12:00:16,208 INFO L138 SettingsManager]: * sizeof long double=12 [2022-01-31 12:00:16,208 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-31 12:00:16,208 INFO L138 SettingsManager]: * Use constant arrays=true [2022-01-31 12:00:16,208 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-31 12:00:16,208 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-31 12:00:16,209 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-31 12:00:16,209 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-01-31 12:00:16,209 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-31 12:00:16,209 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-31 12:00:16,209 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-31 12:00:16,209 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-31 12:00:16,210 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-01-31 12:00:16,210 INFO L138 SettingsManager]: * TransformationType=LOOP_ACCELERATION_JORDAN 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.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-01-31 12:00:16,391 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-31 12:00:16,408 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-31 12:00:16,410 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-31 12:00:16,411 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-31 12:00:16,411 INFO L275 PluginConnector]: CDTParser initialized [2022-01-31 12:00:16,412 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-fpi/ss4.c [2022-01-31 12:00:16,476 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/468bd60ef/6f9ebf3e7d194d29b76f001ac3d33381/FLAG505fb7ac9 [2022-01-31 12:00:16,771 INFO L306 CDTParser]: Found 1 translation units. [2022-01-31 12:00:16,772 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-fpi/ss4.c [2022-01-31 12:00:16,777 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/468bd60ef/6f9ebf3e7d194d29b76f001ac3d33381/FLAG505fb7ac9 [2022-01-31 12:00:17,207 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/468bd60ef/6f9ebf3e7d194d29b76f001ac3d33381 [2022-01-31 12:00:17,209 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-31 12:00:17,212 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-31 12:00:17,214 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-31 12:00:17,214 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-31 12:00:17,216 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-31 12:00:17,216 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 12:00:17" (1/1) ... [2022-01-31 12:00:17,217 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61057826 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 12:00:17, skipping insertion in model container [2022-01-31 12:00:17,217 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 12:00:17" (1/1) ... [2022-01-31 12:00:17,222 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-31 12:00:17,232 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-31 12:00:17,335 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/array-fpi/ss4.c[586,599] [2022-01-31 12:00:17,363 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-31 12:00:17,368 INFO L203 MainTranslator]: Completed pre-run [2022-01-31 12:00:17,379 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/array-fpi/ss4.c[586,599] [2022-01-31 12:00:17,388 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-31 12:00:17,401 INFO L208 MainTranslator]: Completed translation [2022-01-31 12:00:17,401 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 12:00:17 WrapperNode [2022-01-31 12:00:17,402 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-31 12:00:17,402 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-31 12:00:17,402 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-31 12:00:17,402 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-31 12:00:17,409 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 12:00:17" (1/1) ... [2022-01-31 12:00:17,409 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 12:00:17" (1/1) ... [2022-01-31 12:00:17,414 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 12:00:17" (1/1) ... [2022-01-31 12:00:17,414 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 12:00:17" (1/1) ... [2022-01-31 12:00:17,418 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 12:00:17" (1/1) ... [2022-01-31 12:00:17,422 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 12:00:17" (1/1) ... [2022-01-31 12:00:17,427 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 12:00:17" (1/1) ... [2022-01-31 12:00:17,428 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-31 12:00:17,429 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-31 12:00:17,429 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-31 12:00:17,429 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-31 12:00:17,430 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 12:00:17" (1/1) ... [2022-01-31 12:00:17,434 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-31 12:00:17,445 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 12:00:17,454 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-01-31 12:00:17,461 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-01-31 12:00:17,481 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-01-31 12:00:17,481 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-31 12:00:17,481 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-01-31 12:00:17,481 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-01-31 12:00:17,481 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-01-31 12:00:17,481 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-01-31 12:00:17,482 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-01-31 12:00:17,482 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-01-31 12:00:17,482 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-01-31 12:00:17,482 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-31 12:00:17,482 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-01-31 12:00:17,482 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-01-31 12:00:17,483 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-01-31 12:00:17,483 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2022-01-31 12:00:17,483 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-01-31 12:00:17,484 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-01-31 12:00:17,485 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-01-31 12:00:17,485 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-01-31 12:00:17,485 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-01-31 12:00:17,485 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-31 12:00:17,485 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-01-31 12:00:17,485 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-31 12:00:17,486 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-31 12:00:17,558 INFO L234 CfgBuilder]: Building ICFG [2022-01-31 12:00:17,560 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-31 12:00:17,701 INFO L275 CfgBuilder]: Performing block encoding [2022-01-31 12:00:17,706 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-31 12:00:17,706 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-01-31 12:00:17,708 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 12:00:17 BoogieIcfgContainer [2022-01-31 12:00:17,708 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-31 12:00:17,708 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-01-31 12:00:17,708 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-01-31 12:00:17,709 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-01-31 12:00:17,711 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 12:00:17" (1/1) ... [2022-01-31 12:00:17,725 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 31.01 12:00:17 BasicIcfg [2022-01-31 12:00:17,725 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-01-31 12:00:17,726 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-31 12:00:17,726 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-31 12:00:17,729 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-31 12:00:17,729 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.01 12:00:17" (1/4) ... [2022-01-31 12:00:17,729 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50925c2a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 12:00:17, skipping insertion in model container [2022-01-31 12:00:17,730 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 12:00:17" (2/4) ... [2022-01-31 12:00:17,730 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50925c2a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 12:00:17, skipping insertion in model container [2022-01-31 12:00:17,730 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 12:00:17" (3/4) ... [2022-01-31 12:00:17,730 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50925c2a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.01 12:00:17, skipping insertion in model container [2022-01-31 12:00:17,730 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 31.01 12:00:17" (4/4) ... [2022-01-31 12:00:17,731 INFO L111 eAbstractionObserver]: Analyzing ICFG ss4.cJordan [2022-01-31 12:00:17,735 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2022-01-31 12:00:17,735 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-31 12:00:17,767 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-31 12:00:17,772 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=ForwardPredicates, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-01-31 12:00:17,773 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-31 12:00:17,790 INFO L276 IsEmpty]: Start isEmpty. Operand has 37 states, 27 states have (on average 1.4444444444444444) internal successors, (39), 28 states have internal predecessors, (39), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-01-31 12:00:17,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-01-31 12:00:17,799 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 12:00:17,800 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 12:00:17,800 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 12:00:17,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 12:00:17,805 INFO L85 PathProgramCache]: Analyzing trace with hash 334130708, now seen corresponding path program 1 times [2022-01-31 12:00:17,813 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 12:00:17,813 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274293324] [2022-01-31 12:00:17,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 12:00:17,814 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 12:00:17,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:00:17,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 12:00:18,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:00:18,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 12:00:18,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:00:18,038 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 12:00:18,038 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 12:00:18,040 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274293324] [2022-01-31 12:00:18,040 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [274293324] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 12:00:18,040 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 12:00:18,041 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-31 12:00:18,042 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298691252] [2022-01-31 12:00:18,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 12:00:18,046 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-31 12:00:18,047 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 12:00:18,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-31 12:00:18,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-31 12:00:18,078 INFO L87 Difference]: Start difference. First operand has 37 states, 27 states have (on average 1.4444444444444444) internal successors, (39), 28 states have internal predecessors, (39), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 2 states have internal predecessors, (19), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 12:00:18,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 12:00:18,147 INFO L93 Difference]: Finished difference Result 37 states and 41 transitions. [2022-01-31 12:00:18,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-31 12:00:18,150 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 2 states have internal predecessors, (19), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 25 [2022-01-31 12:00:18,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 12:00:18,157 INFO L225 Difference]: With dead ends: 37 [2022-01-31 12:00:18,157 INFO L226 Difference]: Without dead ends: 30 [2022-01-31 12:00:18,162 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-31 12:00:18,166 INFO L933 BasicCegarLoop]: 41 mSDtfsCounter, 8 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-31 12:00:18,167 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 45 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-31 12:00:18,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-01-31 12:00:18,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-01-31 12:00:18,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 23 states have (on average 1.173913043478261) internal successors, (27), 23 states have internal predecessors, (27), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-31 12:00:18,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2022-01-31 12:00:18,197 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 25 [2022-01-31 12:00:18,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 12:00:18,197 INFO L470 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2022-01-31 12:00:18,198 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 2 states have internal predecessors, (19), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 12:00:18,198 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2022-01-31 12:00:18,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-01-31 12:00:18,199 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 12:00:18,199 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 12:00:18,199 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-31 12:00:18,199 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 12:00:18,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 12:00:18,200 INFO L85 PathProgramCache]: Analyzing trace with hash 1527605231, now seen corresponding path program 1 times [2022-01-31 12:00:18,200 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 12:00:18,200 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010796821] [2022-01-31 12:00:18,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 12:00:18,201 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 12:00:18,258 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-31 12:00:18,259 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [714828543] [2022-01-31 12:00:18,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 12:00:18,259 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 12:00:18,259 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 12:00:18,262 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 12:00:18,264 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-01-31 12:00:18,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:00:18,342 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 3 conjunts are in the unsatisfiable core [2022-01-31 12:00:18,347 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 12:00:18,472 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 12:00:18,472 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-31 12:00:18,472 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 12:00:18,472 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010796821] [2022-01-31 12:00:18,472 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-31 12:00:18,473 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [714828543] [2022-01-31 12:00:18,473 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [714828543] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 12:00:18,473 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 12:00:18,473 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-31 12:00:18,474 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655577355] [2022-01-31 12:00:18,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 12:00:18,474 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-31 12:00:18,474 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 12:00:18,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-31 12:00:18,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-01-31 12:00:18,475 INFO L87 Difference]: Start difference. First operand 30 states and 33 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-31 12:00:18,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 12:00:18,516 INFO L93 Difference]: Finished difference Result 38 states and 41 transitions. [2022-01-31 12:00:18,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-31 12:00:18,516 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), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 25 [2022-01-31 12:00:18,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 12:00:18,517 INFO L225 Difference]: With dead ends: 38 [2022-01-31 12:00:18,517 INFO L226 Difference]: Without dead ends: 38 [2022-01-31 12:00:18,517 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-01-31 12:00:18,518 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 29 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-31 12:00:18,519 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [29 Valid, 31 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-31 12:00:18,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-01-31 12:00:18,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 34. [2022-01-31 12:00:18,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 27 states have internal predecessors, (31), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-31 12:00:18,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 37 transitions. [2022-01-31 12:00:18,523 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 37 transitions. Word has length 25 [2022-01-31 12:00:18,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 12:00:18,523 INFO L470 AbstractCegarLoop]: Abstraction has 34 states and 37 transitions. [2022-01-31 12:00:18,523 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-31 12:00:18,523 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2022-01-31 12:00:18,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-01-31 12:00:18,524 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 12:00:18,524 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 12:00:18,543 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-01-31 12:00:18,739 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 12:00:18,740 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 12:00:18,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 12:00:18,740 INFO L85 PathProgramCache]: Analyzing trace with hash 1782587353, now seen corresponding path program 1 times [2022-01-31 12:00:18,740 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 12:00:18,741 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485066431] [2022-01-31 12:00:18,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 12:00:18,741 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 12:00:18,770 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-31 12:00:18,770 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1862332522] [2022-01-31 12:00:18,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 12:00:18,770 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 12:00:18,771 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 12:00:18,773 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 12:00:18,795 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-01-31 12:00:18,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:00:18,858 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 48 conjunts are in the unsatisfiable core [2022-01-31 12:00:18,863 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 12:00:18,934 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-01-31 12:00:18,942 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-01-31 12:00:18,985 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-01-31 12:00:19,153 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2022-01-31 12:00:19,272 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 23 [2022-01-31 12:00:19,334 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2022-01-31 12:00:19,397 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2022-01-31 12:00:19,491 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 10 [2022-01-31 12:00:19,563 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 12:00:19,563 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 12:00:20,036 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 12:00:20,118 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 12:00:20,118 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 12:00:20,119 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485066431] [2022-01-31 12:00:20,119 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-31 12:00:20,119 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1862332522] [2022-01-31 12:00:20,119 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1862332522] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 12:00:20,120 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-31 12:00:20,120 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 28 [2022-01-31 12:00:20,120 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018183361] [2022-01-31 12:00:20,120 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-31 12:00:20,121 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-01-31 12:00:20,121 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 12:00:20,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-01-31 12:00:20,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=640, Unknown=0, NotChecked=0, Total=756 [2022-01-31 12:00:20,124 INFO L87 Difference]: Start difference. First operand 34 states and 37 transitions. Second operand has 28 states, 26 states have (on average 1.8461538461538463) internal successors, (48), 27 states have internal predecessors, (48), 5 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-01-31 12:00:20,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 12:00:20,992 INFO L93 Difference]: Finished difference Result 54 states and 60 transitions. [2022-01-31 12:00:20,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-01-31 12:00:20,992 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 26 states have (on average 1.8461538461538463) internal successors, (48), 27 states have internal predecessors, (48), 5 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 33 [2022-01-31 12:00:20,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 12:00:20,993 INFO L225 Difference]: With dead ends: 54 [2022-01-31 12:00:20,993 INFO L226 Difference]: Without dead ends: 50 [2022-01-31 12:00:20,994 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 324 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=176, Invalid=1014, Unknown=0, NotChecked=0, Total=1190 [2022-01-31 12:00:20,994 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 39 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 352 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 428 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 4 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-31 12:00:20,995 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [39 Valid, 162 Invalid, 428 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 352 Invalid, 0 Unknown, 4 Unchecked, 0.4s Time] [2022-01-31 12:00:20,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-01-31 12:00:20,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 47. [2022-01-31 12:00:20,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 40 states have (on average 1.175) internal successors, (47), 40 states have internal predecessors, (47), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-31 12:00:20,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 53 transitions. [2022-01-31 12:00:20,998 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 53 transitions. Word has length 33 [2022-01-31 12:00:20,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 12:00:20,999 INFO L470 AbstractCegarLoop]: Abstraction has 47 states and 53 transitions. [2022-01-31 12:00:20,999 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 26 states have (on average 1.8461538461538463) internal successors, (48), 27 states have internal predecessors, (48), 5 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-01-31 12:00:20,999 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 53 transitions. [2022-01-31 12:00:20,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-01-31 12:00:20,999 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 12:00:21,000 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 12:00:21,017 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-01-31 12:00:21,203 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-01-31 12:00:21,204 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 12:00:21,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 12:00:21,204 INFO L85 PathProgramCache]: Analyzing trace with hash 1886510619, now seen corresponding path program 2 times [2022-01-31 12:00:21,204 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 12:00:21,204 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500725558] [2022-01-31 12:00:21,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 12:00:21,205 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 12:00:21,235 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-31 12:00:21,236 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1843666097] [2022-01-31 12:00:21,236 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-31 12:00:21,236 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 12:00:21,236 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 12:00:21,238 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 12:00:21,241 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-01-31 12:00:21,301 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-31 12:00:21,301 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 12:00:21,302 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 6 conjunts are in the unsatisfiable core [2022-01-31 12:00:21,303 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 12:00:21,372 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-31 12:00:21,372 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 12:00:21,440 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-31 12:00:21,441 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 12:00:21,441 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500725558] [2022-01-31 12:00:21,441 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-31 12:00:21,441 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1843666097] [2022-01-31 12:00:21,441 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1843666097] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 12:00:21,441 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-31 12:00:21,441 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2022-01-31 12:00:21,441 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516299763] [2022-01-31 12:00:21,442 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-31 12:00:21,442 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-31 12:00:21,442 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 12:00:21,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-31 12:00:21,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-01-31 12:00:21,443 INFO L87 Difference]: Start difference. First operand 47 states and 53 transitions. Second operand has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 12:00:21,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 12:00:21,544 INFO L93 Difference]: Finished difference Result 75 states and 80 transitions. [2022-01-31 12:00:21,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-31 12:00:21,546 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 35 [2022-01-31 12:00:21,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 12:00:21,550 INFO L225 Difference]: With dead ends: 75 [2022-01-31 12:00:21,551 INFO L226 Difference]: Without dead ends: 63 [2022-01-31 12:00:21,554 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2022-01-31 12:00:21,557 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 48 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 12:00:21,565 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [48 Valid, 90 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 12:00:21,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-01-31 12:00:21,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 48. [2022-01-31 12:00:21,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 41 states have (on average 1.146341463414634) internal successors, (47), 41 states have internal predecessors, (47), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-31 12:00:21,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 53 transitions. [2022-01-31 12:00:21,569 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 53 transitions. Word has length 35 [2022-01-31 12:00:21,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 12:00:21,570 INFO L470 AbstractCegarLoop]: Abstraction has 48 states and 53 transitions. [2022-01-31 12:00:21,570 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 12:00:21,570 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 53 transitions. [2022-01-31 12:00:21,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-01-31 12:00:21,570 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 12:00:21,571 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 12:00:21,591 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-01-31 12:00:21,788 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 12:00:21,789 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 12:00:21,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 12:00:21,789 INFO L85 PathProgramCache]: Analyzing trace with hash -899444771, now seen corresponding path program 3 times [2022-01-31 12:00:21,789 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 12:00:21,789 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444355312] [2022-01-31 12:00:21,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 12:00:21,790 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 12:00:21,806 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-31 12:00:21,806 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [771665399] [2022-01-31 12:00:21,806 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-31 12:00:21,806 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 12:00:21,806 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 12:00:21,808 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 12:00:21,809 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-01-31 12:00:21,864 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-01-31 12:00:21,864 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 12:00:21,865 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 6 conjunts are in the unsatisfiable core [2022-01-31 12:00:21,867 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 12:00:21,949 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-31 12:00:21,949 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 12:00:21,999 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-31 12:00:21,999 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 12:00:21,999 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444355312] [2022-01-31 12:00:21,999 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-31 12:00:21,999 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [771665399] [2022-01-31 12:00:21,999 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [771665399] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 12:00:22,000 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-31 12:00:22,000 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2022-01-31 12:00:22,000 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210941299] [2022-01-31 12:00:22,000 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-31 12:00:22,000 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-31 12:00:22,000 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 12:00:22,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-31 12:00:22,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-01-31 12:00:22,001 INFO L87 Difference]: Start difference. First operand 48 states and 53 transitions. Second operand has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 12:00:22,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 12:00:22,101 INFO L93 Difference]: Finished difference Result 45 states and 48 transitions. [2022-01-31 12:00:22,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-31 12:00:22,101 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 35 [2022-01-31 12:00:22,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 12:00:22,103 INFO L225 Difference]: With dead ends: 45 [2022-01-31 12:00:22,103 INFO L226 Difference]: Without dead ends: 45 [2022-01-31 12:00:22,103 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2022-01-31 12:00:22,105 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 31 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 12:00:22,106 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 101 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 12:00:22,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-01-31 12:00:22,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 42. [2022-01-31 12:00:22,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 35 states have (on average 1.1142857142857143) internal successors, (39), 35 states have internal predecessors, (39), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-31 12:00:22,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 45 transitions. [2022-01-31 12:00:22,116 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 45 transitions. Word has length 35 [2022-01-31 12:00:22,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 12:00:22,117 INFO L470 AbstractCegarLoop]: Abstraction has 42 states and 45 transitions. [2022-01-31 12:00:22,117 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 12:00:22,117 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 45 transitions. [2022-01-31 12:00:22,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-01-31 12:00:22,119 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 12:00:22,119 INFO L514 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1] [2022-01-31 12:00:22,143 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-01-31 12:00:22,327 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 12:00:22,327 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 12:00:22,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 12:00:22,328 INFO L85 PathProgramCache]: Analyzing trace with hash 1799560259, now seen corresponding path program 4 times [2022-01-31 12:00:22,328 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 12:00:22,328 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37638621] [2022-01-31 12:00:22,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 12:00:22,328 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 12:00:22,346 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-31 12:00:22,347 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1567505533] [2022-01-31 12:00:22,347 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-01-31 12:00:22,347 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 12:00:22,347 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 12:00:22,351 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 12:00:22,371 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-01-31 12:00:22,410 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-01-31 12:00:22,410 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 12:00:22,412 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 68 conjunts are in the unsatisfiable core [2022-01-31 12:00:22,415 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 12:00:22,437 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-01-31 12:00:22,476 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:00:22,477 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-01-31 12:00:22,519 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:00:22,520 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:00:22,521 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-01-31 12:00:22,647 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:00:22,648 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:00:22,649 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 12:00:22,649 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 39 [2022-01-31 12:00:22,729 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:00:22,730 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:00:22,732 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 39 [2022-01-31 12:00:22,840 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:00:22,840 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:00:22,841 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 12:00:22,841 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 47 [2022-01-31 12:00:22,930 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:00:22,930 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:00:22,932 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 39 [2022-01-31 12:00:23,021 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:00:23,022 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:00:23,023 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 37 [2022-01-31 12:00:23,079 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:00:23,080 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:00:23,080 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 12:00:23,081 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 41 [2022-01-31 12:00:23,186 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:00:23,187 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 35 [2022-01-31 12:00:23,262 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:00:23,263 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2022-01-31 12:00:23,367 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 12:00:23,367 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 12:00:44,923 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 12:00:44,923 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 12:00:44,924 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37638621] [2022-01-31 12:00:44,925 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-31 12:00:44,926 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1567505533] [2022-01-31 12:00:44,926 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1567505533] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 12:00:44,926 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-31 12:00:44,926 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 42 [2022-01-31 12:00:44,926 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545196326] [2022-01-31 12:00:44,926 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-31 12:00:44,927 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-01-31 12:00:44,928 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 12:00:44,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-01-31 12:00:44,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=1570, Unknown=2, NotChecked=0, Total=1722 [2022-01-31 12:00:44,930 INFO L87 Difference]: Start difference. First operand 42 states and 45 transitions. Second operand has 42 states, 40 states have (on average 1.5) internal successors, (60), 41 states have internal predecessors, (60), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 12:00:55,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 12:00:55,893 INFO L93 Difference]: Finished difference Result 72 states and 79 transitions. [2022-01-31 12:00:55,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-01-31 12:00:55,894 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 40 states have (on average 1.5) internal successors, (60), 41 states have internal predecessors, (60), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 41 [2022-01-31 12:00:55,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 12:00:55,894 INFO L225 Difference]: With dead ends: 72 [2022-01-31 12:00:55,894 INFO L226 Difference]: Without dead ends: 68 [2022-01-31 12:00:55,895 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 450 ImplicationChecksByTransitivity, 28.3s TimeCoverageRelationStatistics Valid=217, Invalid=2433, Unknown=2, NotChecked=0, Total=2652 [2022-01-31 12:00:55,895 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 6 mSDsluCounter, 351 mSDsCounter, 0 mSdLazyCounter, 797 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 369 SdHoareTripleChecker+Invalid, 987 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 797 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 136 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2022-01-31 12:00:55,896 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 369 Invalid, 987 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 797 Invalid, 0 Unknown, 136 Unchecked, 4.1s Time] [2022-01-31 12:00:55,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2022-01-31 12:00:55,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 59. [2022-01-31 12:00:55,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 52 states have (on average 1.1346153846153846) internal successors, (59), 52 states have internal predecessors, (59), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-31 12:00:55,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 65 transitions. [2022-01-31 12:00:55,898 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 65 transitions. Word has length 41 [2022-01-31 12:00:55,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 12:00:55,899 INFO L470 AbstractCegarLoop]: Abstraction has 59 states and 65 transitions. [2022-01-31 12:00:55,899 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 40 states have (on average 1.5) internal successors, (60), 41 states have internal predecessors, (60), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 12:00:55,899 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 65 transitions. [2022-01-31 12:00:55,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-01-31 12:00:55,901 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 12:00:55,901 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 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, 1, 1, 1, 1, 1, 1] [2022-01-31 12:00:55,917 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-01-31 12:00:56,109 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 12:00:56,109 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 12:00:56,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 12:00:56,110 INFO L85 PathProgramCache]: Analyzing trace with hash 1017604101, now seen corresponding path program 5 times [2022-01-31 12:00:56,110 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 12:00:56,110 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809253411] [2022-01-31 12:00:56,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 12:00:56,110 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 12:00:56,124 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-31 12:00:56,124 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2080023119] [2022-01-31 12:00:56,125 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-01-31 12:00:56,125 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 12:00:56,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 12:00:56,126 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 12:00:56,127 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-01-31 12:00:56,199 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-01-31 12:00:56,199 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 12:00:56,200 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 8 conjunts are in the unsatisfiable core [2022-01-31 12:00:56,202 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 12:00:56,304 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-01-31 12:00:56,304 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 12:00:56,383 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-01-31 12:00:56,383 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 12:00:56,383 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809253411] [2022-01-31 12:00:56,383 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-31 12:00:56,383 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2080023119] [2022-01-31 12:00:56,387 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2080023119] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 12:00:56,387 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-31 12:00:56,387 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 12 [2022-01-31 12:00:56,387 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983578154] [2022-01-31 12:00:56,387 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-31 12:00:56,388 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-31 12:00:56,388 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 12:00:56,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-31 12:00:56,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2022-01-31 12:00:56,389 INFO L87 Difference]: Start difference. First operand 59 states and 65 transitions. Second operand has 12 states, 12 states have (on average 3.25) internal successors, (39), 12 states have internal predecessors, (39), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 12:00:56,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 12:00:56,517 INFO L93 Difference]: Finished difference Result 93 states and 98 transitions. [2022-01-31 12:00:56,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-31 12:00:56,518 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.25) internal successors, (39), 12 states have internal predecessors, (39), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 43 [2022-01-31 12:00:56,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 12:00:56,518 INFO L225 Difference]: With dead ends: 93 [2022-01-31 12:00:56,518 INFO L226 Difference]: Without dead ends: 75 [2022-01-31 12:00:56,519 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2022-01-31 12:00:56,519 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 78 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 12:00:56,519 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [78 Valid, 65 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 12:00:56,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-01-31 12:00:56,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 60. [2022-01-31 12:00:56,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 53 states have (on average 1.1132075471698113) internal successors, (59), 53 states have internal predecessors, (59), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-31 12:00:56,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 65 transitions. [2022-01-31 12:00:56,522 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 65 transitions. Word has length 43 [2022-01-31 12:00:56,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 12:00:56,523 INFO L470 AbstractCegarLoop]: Abstraction has 60 states and 65 transitions. [2022-01-31 12:00:56,523 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.25) internal successors, (39), 12 states have internal predecessors, (39), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 12:00:56,523 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 65 transitions. [2022-01-31 12:00:56,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-01-31 12:00:56,523 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 12:00:56,523 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 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, 1, 1, 1, 1, 1, 1] [2022-01-31 12:00:56,542 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-01-31 12:00:56,739 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 12:00:56,739 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 12:00:56,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 12:00:56,740 INFO L85 PathProgramCache]: Analyzing trace with hash 973621319, now seen corresponding path program 6 times [2022-01-31 12:00:56,740 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 12:00:56,740 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285531974] [2022-01-31 12:00:56,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 12:00:56,740 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 12:00:56,757 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-31 12:00:56,757 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [204492063] [2022-01-31 12:00:56,757 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-01-31 12:00:56,758 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 12:00:56,758 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 12:00:56,759 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 12:00:56,759 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-01-31 12:00:56,818 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-01-31 12:00:56,819 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 12:00:56,819 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 8 conjunts are in the unsatisfiable core [2022-01-31 12:00:56,820 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 12:00:56,909 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-01-31 12:00:56,910 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 12:00:56,990 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-01-31 12:00:56,990 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 12:00:56,990 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285531974] [2022-01-31 12:00:56,990 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-31 12:00:56,990 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [204492063] [2022-01-31 12:00:56,990 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [204492063] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 12:00:56,990 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-31 12:00:56,990 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 12 [2022-01-31 12:00:56,990 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022484771] [2022-01-31 12:00:56,991 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-31 12:00:56,991 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-31 12:00:56,991 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 12:00:56,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-31 12:00:56,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2022-01-31 12:00:56,991 INFO L87 Difference]: Start difference. First operand 60 states and 65 transitions. Second operand has 12 states, 12 states have (on average 3.25) internal successors, (39), 12 states have internal predecessors, (39), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 12:00:57,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 12:00:57,133 INFO L93 Difference]: Finished difference Result 53 states and 56 transitions. [2022-01-31 12:00:57,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-31 12:00:57,134 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.25) internal successors, (39), 12 states have internal predecessors, (39), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 43 [2022-01-31 12:00:57,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 12:00:57,134 INFO L225 Difference]: With dead ends: 53 [2022-01-31 12:00:57,134 INFO L226 Difference]: Without dead ends: 53 [2022-01-31 12:00:57,134 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2022-01-31 12:00:57,135 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 54 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 12:00:57,135 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [54 Valid, 101 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 12:00:57,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-01-31 12:00:57,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 50. [2022-01-31 12:00:57,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 43 states have (on average 1.0930232558139534) internal successors, (47), 43 states have internal predecessors, (47), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-31 12:00:57,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 53 transitions. [2022-01-31 12:00:57,137 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 53 transitions. Word has length 43 [2022-01-31 12:00:57,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 12:00:57,137 INFO L470 AbstractCegarLoop]: Abstraction has 50 states and 53 transitions. [2022-01-31 12:00:57,138 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.25) internal successors, (39), 12 states have internal predecessors, (39), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 12:00:57,138 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 53 transitions. [2022-01-31 12:00:57,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-01-31 12:00:57,138 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 12:00:57,138 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 12:00:57,155 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-01-31 12:00:57,346 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 12:00:57,347 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 12:00:57,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 12:00:57,347 INFO L85 PathProgramCache]: Analyzing trace with hash 456719661, now seen corresponding path program 7 times [2022-01-31 12:00:57,347 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 12:00:57,347 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017618245] [2022-01-31 12:00:57,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 12:00:57,348 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 12:00:57,361 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-31 12:00:57,361 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [491193831] [2022-01-31 12:00:57,361 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-01-31 12:00:57,361 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 12:00:57,362 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 12:00:57,362 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 12:00:57,363 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-01-31 12:00:57,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:00:57,445 INFO L263 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 96 conjunts are in the unsatisfiable core [2022-01-31 12:00:57,448 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 12:00:57,467 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-01-31 12:00:57,470 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-01-31 12:00:57,486 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-01-31 12:00:57,529 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:00:57,530 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 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 [2022-01-31 12:00:57,580 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:00:57,581 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:00:57,581 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:00:57,582 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 52 [2022-01-31 12:00:57,725 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:00:57,726 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 12:00:57,726 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:00:57,727 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:00:57,728 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 51 [2022-01-31 12:00:57,831 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:00:57,831 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:00:57,832 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:00:57,840 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 12:00:57,841 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:00:57,842 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 49 [2022-01-31 12:00:57,934 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:00:57,934 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:00:57,935 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:00:57,937 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 51 [2022-01-31 12:00:58,120 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:00:58,121 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 12:00:58,122 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:00:58,122 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:00:58,123 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 55 [2022-01-31 12:00:58,224 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:00:58,224 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 12:00:58,225 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:00:58,226 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:00:58,227 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 62 [2022-01-31 12:00:58,335 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:00:58,336 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:00:58,336 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:00:58,337 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 58 [2022-01-31 12:00:58,420 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:00:58,421 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:00:58,421 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:00:58,422 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 47 [2022-01-31 12:00:58,473 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:00:58,475 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 12:00:58,477 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:00:58,477 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:00:58,478 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 51 [2022-01-31 12:00:58,586 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:00:58,586 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:00:58,587 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:00:58,587 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 12:00:58,588 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:00:58,589 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 49 [2022-01-31 12:00:58,707 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 43 [2022-01-31 12:00:58,799 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 20 [2022-01-31 12:00:58,920 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 12:00:58,921 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 12:04:46,131 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 12:04:46,132 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 12:04:46,132 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017618245] [2022-01-31 12:04:46,132 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-31 12:04:46,132 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [491193831] [2022-01-31 12:04:46,132 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [491193831] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 12:04:46,132 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-31 12:04:46,132 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 58 [2022-01-31 12:04:46,134 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806542352] [2022-01-31 12:04:46,134 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-31 12:04:46,135 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2022-01-31 12:04:46,135 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 12:04:46,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2022-01-31 12:04:46,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=214, Invalid=3046, Unknown=46, NotChecked=0, Total=3306 [2022-01-31 12:04:46,137 INFO L87 Difference]: Start difference. First operand 50 states and 53 transitions. Second operand has 58 states, 56 states have (on average 1.3571428571428572) internal successors, (76), 57 states have internal predecessors, (76), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 12:07:30,438 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2022-01-31 12:07:38,026 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2022-01-31 12:07:40,257 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2022-01-31 12:07:42,318 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2022-01-31 12:07:45,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 12:07:45,920 INFO L93 Difference]: Finished difference Result 88 states and 95 transitions. [2022-01-31 12:07:45,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-01-31 12:07:45,920 INFO L78 Accepts]: Start accepts. Automaton has has 58 states, 56 states have (on average 1.3571428571428572) internal successors, (76), 57 states have internal predecessors, (76), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 49 [2022-01-31 12:07:45,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 12:07:45,922 INFO L225 Difference]: With dead ends: 88 [2022-01-31 12:07:45,922 INFO L226 Difference]: Without dead ends: 84 [2022-01-31 12:07:45,923 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 793 ImplicationChecksByTransitivity, 367.7s TimeCoverageRelationStatistics Valid=305, Invalid=4465, Unknown=60, NotChecked=0, Total=4830 [2022-01-31 12:07:45,925 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 10 mSDsluCounter, 443 mSDsCounter, 0 mSdLazyCounter, 1273 mSolverCounterSat, 82 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 34.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 461 SdHoareTripleChecker+Invalid, 1609 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 1273 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 250 IncrementalHoareTripleChecker+Unchecked, 37.5s IncrementalHoareTripleChecker+Time [2022-01-31 12:07:45,925 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 461 Invalid, 1609 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 1273 Invalid, 4 Unknown, 250 Unchecked, 37.5s Time] [2022-01-31 12:07:45,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2022-01-31 12:07:45,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 71. [2022-01-31 12:07:45,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 64 states have (on average 1.109375) internal successors, (71), 64 states have internal predecessors, (71), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-31 12:07:45,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 77 transitions. [2022-01-31 12:07:45,942 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 77 transitions. Word has length 49 [2022-01-31 12:07:45,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 12:07:45,942 INFO L470 AbstractCegarLoop]: Abstraction has 71 states and 77 transitions. [2022-01-31 12:07:45,942 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 58 states, 56 states have (on average 1.3571428571428572) internal successors, (76), 57 states have internal predecessors, (76), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 12:07:45,942 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 77 transitions. [2022-01-31 12:07:45,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-01-31 12:07:45,942 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 12:07:45,943 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 12:07:45,974 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-01-31 12:07:46,160 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-01-31 12:07:46,160 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 12:07:46,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 12:07:46,161 INFO L85 PathProgramCache]: Analyzing trace with hash -962021777, now seen corresponding path program 8 times [2022-01-31 12:07:46,161 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 12:07:46,161 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536364429] [2022-01-31 12:07:46,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 12:07:46,161 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 12:07:46,182 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-31 12:07:46,182 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2032483659] [2022-01-31 12:07:46,182 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-31 12:07:46,182 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 12:07:46,182 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 12:07:46,195 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 12:07:46,215 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-01-31 12:07:46,268 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-31 12:07:46,269 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 12:07:46,270 INFO L263 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 10 conjunts are in the unsatisfiable core [2022-01-31 12:07:46,271 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 12:07:46,408 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 16 proven. 9 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-01-31 12:07:46,408 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 12:07:46,522 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 16 proven. 9 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-01-31 12:07:46,523 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 12:07:46,523 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536364429] [2022-01-31 12:07:46,523 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-31 12:07:46,523 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2032483659] [2022-01-31 12:07:46,523 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2032483659] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 12:07:46,523 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-31 12:07:46,523 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 15 [2022-01-31 12:07:46,523 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097633727] [2022-01-31 12:07:46,523 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-31 12:07:46,523 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-01-31 12:07:46,523 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 12:07:46,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-01-31 12:07:46,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2022-01-31 12:07:46,524 INFO L87 Difference]: Start difference. First operand 71 states and 77 transitions. Second operand has 15 states, 15 states have (on average 3.0) internal successors, (45), 15 states have internal predecessors, (45), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 12:07:46,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 12:07:46,755 INFO L93 Difference]: Finished difference Result 111 states and 116 transitions. [2022-01-31 12:07:46,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-31 12:07:46,755 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.0) internal successors, (45), 15 states have internal predecessors, (45), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 51 [2022-01-31 12:07:46,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 12:07:46,756 INFO L225 Difference]: With dead ends: 111 [2022-01-31 12:07:46,756 INFO L226 Difference]: Without dead ends: 87 [2022-01-31 12:07:46,756 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=110, Invalid=270, Unknown=0, NotChecked=0, Total=380 [2022-01-31 12:07:46,757 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 80 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-31 12:07:46,757 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [80 Valid, 117 Invalid, 258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-31 12:07:46,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2022-01-31 12:07:46,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 72. [2022-01-31 12:07:46,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 65 states have (on average 1.0923076923076922) internal successors, (71), 65 states have internal predecessors, (71), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-31 12:07:46,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 77 transitions. [2022-01-31 12:07:46,761 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 77 transitions. Word has length 51 [2022-01-31 12:07:46,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 12:07:46,761 INFO L470 AbstractCegarLoop]: Abstraction has 72 states and 77 transitions. [2022-01-31 12:07:46,761 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.0) internal successors, (45), 15 states have internal predecessors, (45), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 12:07:46,762 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 77 transitions. [2022-01-31 12:07:46,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-01-31 12:07:46,762 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 12:07:46,762 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 12:07:46,782 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-01-31 12:07:46,979 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-01-31 12:07:46,979 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 12:07:46,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 12:07:46,980 INFO L85 PathProgramCache]: Analyzing trace with hash 1763960113, now seen corresponding path program 9 times [2022-01-31 12:07:46,980 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 12:07:46,980 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999735893] [2022-01-31 12:07:46,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 12:07:46,980 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 12:07:46,994 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-31 12:07:46,994 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1610111019] [2022-01-31 12:07:46,994 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-31 12:07:46,994 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 12:07:46,995 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 12:07:46,996 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 12:07:47,028 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-01-31 12:07:47,192 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-01-31 12:07:47,193 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 12:07:47,195 INFO L263 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 10 conjunts are in the unsatisfiable core [2022-01-31 12:07:47,196 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 12:07:47,320 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 9 proven. 16 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-01-31 12:07:47,321 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 12:07:47,430 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 9 proven. 16 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-01-31 12:07:47,431 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 12:07:47,431 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999735893] [2022-01-31 12:07:47,431 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-31 12:07:47,431 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1610111019] [2022-01-31 12:07:47,431 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1610111019] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 12:07:47,431 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-31 12:07:47,431 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 15 [2022-01-31 12:07:47,431 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883391510] [2022-01-31 12:07:47,431 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-31 12:07:47,431 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-01-31 12:07:47,432 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 12:07:47,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-01-31 12:07:47,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2022-01-31 12:07:47,432 INFO L87 Difference]: Start difference. First operand 72 states and 77 transitions. Second operand has 15 states, 15 states have (on average 3.0) internal successors, (45), 15 states have internal predecessors, (45), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 12:07:47,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 12:07:47,661 INFO L93 Difference]: Finished difference Result 61 states and 64 transitions. [2022-01-31 12:07:47,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-01-31 12:07:47,662 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.0) internal successors, (45), 15 states have internal predecessors, (45), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 51 [2022-01-31 12:07:47,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 12:07:47,662 INFO L225 Difference]: With dead ends: 61 [2022-01-31 12:07:47,662 INFO L226 Difference]: Without dead ends: 61 [2022-01-31 12:07:47,663 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=149, Invalid=403, Unknown=0, NotChecked=0, Total=552 [2022-01-31 12:07:47,663 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 77 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-31 12:07:47,663 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [77 Valid, 88 Invalid, 227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-31 12:07:47,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-01-31 12:07:47,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 58. [2022-01-31 12:07:47,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 51 states have (on average 1.0784313725490196) internal successors, (55), 51 states have internal predecessors, (55), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-31 12:07:47,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 61 transitions. [2022-01-31 12:07:47,666 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 61 transitions. Word has length 51 [2022-01-31 12:07:47,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 12:07:47,666 INFO L470 AbstractCegarLoop]: Abstraction has 58 states and 61 transitions. [2022-01-31 12:07:47,666 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.0) internal successors, (45), 15 states have internal predecessors, (45), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 12:07:47,666 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 61 transitions. [2022-01-31 12:07:47,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-01-31 12:07:47,666 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 12:07:47,666 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 12:07:47,688 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-01-31 12:07:47,886 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-01-31 12:07:47,887 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 12:07:47,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 12:07:47,887 INFO L85 PathProgramCache]: Analyzing trace with hash -3382633, now seen corresponding path program 10 times [2022-01-31 12:07:47,887 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 12:07:47,887 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618573631] [2022-01-31 12:07:47,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 12:07:47,887 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 12:07:47,902 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-31 12:07:47,903 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1402607133] [2022-01-31 12:07:47,903 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-01-31 12:07:47,903 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 12:07:47,903 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 12:07:47,904 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 12:07:47,914 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-01-31 12:07:47,997 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-01-31 12:07:47,997 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 12:07:47,999 WARN L261 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 117 conjunts are in the unsatisfiable core [2022-01-31 12:07:48,004 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 12:07:48,033 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-01-31 12:07:48,058 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:07:48,059 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-01-31 12:07:48,131 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:07:48,132 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:07:48,133 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 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 [2022-01-31 12:07:48,223 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:07:48,224 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:07:48,224 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:07:48,225 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:07:48,226 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2022-01-31 12:07:48,317 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:07:48,318 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:07:48,319 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:07:48,319 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:07:48,320 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:07:48,320 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:07:48,321 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:07:48,322 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 54 [2022-01-31 12:07:48,454 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:07:48,463 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:07:48,463 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:07:48,464 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 12:07:48,464 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:07:48,465 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:07:48,465 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:07:48,467 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:07:48,468 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 7 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 63 [2022-01-31 12:07:48,592 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:07:48,593 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:07:48,593 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:07:48,594 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:07:48,594 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:07:48,595 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:07:48,595 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 12:07:48,596 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:07:48,597 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:07:48,598 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 7 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 61 [2022-01-31 12:07:48,731 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:07:48,732 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:07:48,733 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:07:48,734 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:07:48,734 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:07:48,735 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:07:48,735 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:07:48,736 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:07:48,737 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:07:48,737 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:07:48,738 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 12:07:48,739 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 7 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 61 [2022-01-31 12:07:48,867 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:07:48,868 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:07:48,869 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:07:48,870 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:07:48,870 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:07:48,871 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:07:48,872 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:07:48,872 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:07:48,873 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:07:48,874 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 12:07:48,875 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 7 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 68 [2022-01-31 12:07:49,191 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:07:49,192 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:07:49,192 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:07:49,193 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 12:07:49,193 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:07:49,194 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:07:49,194 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:07:49,195 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:07:49,198 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 7 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 73 [2022-01-31 12:07:49,336 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:07:49,337 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:07:49,337 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:07:49,338 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 12:07:49,338 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:07:49,339 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:07:49,340 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:07:49,340 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:07:49,341 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 7 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 66 [2022-01-31 12:07:49,540 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:07:49,541 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:07:49,542 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:07:49,542 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:07:49,543 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:07:49,544 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:07:49,544 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 12:07:49,545 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:07:49,545 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:07:49,546 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 7 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 69 [2022-01-31 12:07:49,728 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:07:49,729 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:07:49,730 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:07:49,730 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:07:49,731 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:07:49,732 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:07:49,732 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:07:49,733 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 77 treesize of output 63 [2022-01-31 12:07:49,865 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:07:49,866 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:07:49,867 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:07:49,867 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:07:49,868 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:07:49,868 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:07:49,869 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:07:49,870 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 53 treesize of output 57 [2022-01-31 12:07:49,982 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:07:49,982 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:07:49,983 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:07:49,983 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 12:07:49,984 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:07:49,985 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:07:49,985 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:07:49,986 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:07:49,987 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 7 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 63 [2022-01-31 12:07:50,181 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:07:50,182 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:07:50,182 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:07:50,183 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 12:07:50,183 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:07:50,184 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:07:50,184 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:07:50,185 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:07:50,186 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 7 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 70 [2022-01-31 12:07:50,401 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:07:50,402 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:07:50,403 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:07:50,404 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:07:50,404 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:07:50,405 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:07:50,406 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:07:50,406 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:07:50,407 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:07:50,408 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:07:50,408 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 12:07:50,410 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 7 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 65 [2022-01-31 12:07:50,629 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:07:50,630 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 79 treesize of output 63 [2022-01-31 12:07:50,904 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:07:50,905 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 65 treesize of output 29 [2022-01-31 12:07:51,054 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 12:07:51,054 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 12:12:47,618 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 12:12:47,626 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 12:12:47,631 INFO L353 Elim1Store]: treesize reduction 66, result has 1.5 percent of original size [2022-01-31 12:12:47,631 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 8 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 1089 treesize of output 1 [2022-01-31 12:12:47,649 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 63 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 12:12:47,649 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 12:12:47,649 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618573631] [2022-01-31 12:12:47,649 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-31 12:12:47,649 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1402607133] [2022-01-31 12:12:47,649 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1402607133] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 12:12:47,649 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-31 12:12:47,649 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 39] total 75 [2022-01-31 12:12:47,649 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051724520] [2022-01-31 12:12:47,650 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-31 12:12:47,650 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 75 states [2022-01-31 12:12:47,650 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 12:12:47,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2022-01-31 12:12:47,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=459, Invalid=5078, Unknown=13, NotChecked=0, Total=5550 [2022-01-31 12:12:47,651 INFO L87 Difference]: Start difference. First operand 58 states and 61 transitions. Second operand has 75 states, 73 states have (on average 1.3150684931506849) internal successors, (96), 74 states have internal predecessors, (96), 4 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-01-31 12:13:43,385 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse99 (select |c_#memory_int| c_main_~a~0.base)) (.cse138 (* c_main_~i~0 8))) (let ((.cse136 (store .cse99 (+ c_main_~a~0.offset .cse138) 1)) (.cse140 (+ c_main_~a~0.offset .cse138 8)) (.cse7 (+ c_main_~a~0.offset 24))) (let ((.cse118 (select .cse99 .cse7)) (.cse59 (store .cse136 .cse140 1)) (.cse117 (store .cse99 .cse140 1)) (.cse139 (+ c_main_~a~0.offset 16 .cse138))) (let ((.cse0 (not (< (+ c_main_~i~0 2) c_~N~0))) (.cse41 (store .cse117 .cse139 1)) (.cse22 (store .cse59 .cse139 1)) (.cse79 (+ c_main_~a~0.offset .cse138 24)) (.cse80 (not (< (+ c_main_~i~0 3) c_~N~0))) (.cse60 (not (< (+ c_main_~i~0 1) c_~N~0))) (.cse1 (< 4 c_~N~0)) (.cse23 (+ c_~N~0 (* c_~N~0 c_~N~0))) (.cse137 (+ (- 2) (select (select |c_#memory_int| |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|) (* (- 1) .cse118))) (.cse8 (+ c_main_~a~0.offset 16)) (.cse9 (+ c_main_~a~0.offset 8))) (and (or .cse0 .cse1 (= (let ((.cse5 (let ((.cse20 (store |c_#memory_int| c_main_~a~0.base .cse22))) (let ((.cse21 (select .cse20 |c_main_~#sum~0.base|))) (let ((.cse15 (select .cse21 |c_main_~#sum~0.offset|)) (.cse18 (select .cse22 c_main_~a~0.offset))) (let ((.cse19 (select (select (store .cse20 |c_main_~#sum~0.base| (store .cse21 |c_main_~#sum~0.offset| (+ .cse15 .cse18))) c_main_~a~0.base) .cse9))) (let ((.cse16 (select (select (store .cse20 |c_main_~#sum~0.base| (store .cse21 |c_main_~#sum~0.offset| (+ .cse15 .cse18 .cse19))) c_main_~a~0.base) .cse8))) (let ((.cse17 (select (select (store .cse20 |c_main_~#sum~0.base| (store .cse21 |c_main_~#sum~0.offset| (+ .cse15 .cse16 .cse18 .cse19))) c_main_~a~0.base) .cse7))) (let ((.cse10 (store .cse20 |c_main_~#sum~0.base| (store .cse21 |c_main_~#sum~0.offset| (+ .cse15 .cse16 .cse17 .cse18 .cse19))))) (store .cse10 c_main_~a~0.base (let ((.cse11 (let ((.cse12 (let ((.cse13 (let ((.cse14 (select .cse10 c_main_~a~0.base))) (store .cse14 c_main_~a~0.offset (+ .cse15 .cse16 .cse17 .cse18 .cse19 (select .cse14 c_main_~a~0.offset)))))) (store .cse13 .cse9 (+ (select .cse13 .cse9) (select (select (store .cse10 c_main_~a~0.base .cse13) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|)))))) (store .cse12 .cse8 (+ (select .cse12 .cse8) (select (select (store .cse10 c_main_~a~0.base .cse12) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|)))))) (store .cse11 .cse7 (+ (select .cse11 .cse7) (select (select (store .cse10 c_main_~a~0.base .cse11) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|)))))))))))))) (let ((.cse6 (select .cse5 |c_main_~#sum~0.base|))) (let ((.cse4 (select (select (store .cse5 |c_main_~#sum~0.base| (store .cse6 |c_main_~#sum~0.offset| 0)) c_main_~a~0.base) c_main_~a~0.offset))) (let ((.cse3 (select (select (store .cse5 |c_main_~#sum~0.base| (store .cse6 |c_main_~#sum~0.offset| .cse4)) c_main_~a~0.base) .cse9))) (let ((.cse2 (select (select (store .cse5 |c_main_~#sum~0.base| (store .cse6 |c_main_~#sum~0.offset| (+ .cse3 .cse4))) c_main_~a~0.base) .cse8))) (+ .cse2 .cse3 .cse4 (select (select (store .cse5 |c_main_~#sum~0.base| (store .cse6 |c_main_~#sum~0.offset| (+ .cse2 .cse3 .cse4))) c_main_~a~0.base) .cse7))))))) .cse23)) (or (= (let ((.cse26 (let ((.cse39 (store |c_#memory_int| c_main_~a~0.base .cse41))) (let ((.cse40 (select .cse39 |c_main_~#sum~0.base|))) (let ((.cse35 (select .cse41 c_main_~a~0.offset)) (.cse37 (select .cse40 |c_main_~#sum~0.offset|))) (let ((.cse38 (select (select (store .cse39 |c_main_~#sum~0.base| (store .cse40 |c_main_~#sum~0.offset| (+ .cse35 .cse37))) c_main_~a~0.base) .cse9))) (let ((.cse34 (select (select (store .cse39 |c_main_~#sum~0.base| (store .cse40 |c_main_~#sum~0.offset| (+ .cse35 .cse37 .cse38))) c_main_~a~0.base) .cse8))) (let ((.cse36 (select (select (store .cse39 |c_main_~#sum~0.base| (store .cse40 |c_main_~#sum~0.offset| (+ .cse34 .cse35 .cse37 .cse38))) c_main_~a~0.base) .cse7))) (let ((.cse29 (store .cse39 |c_main_~#sum~0.base| (store .cse40 |c_main_~#sum~0.offset| (+ .cse34 .cse35 .cse36 .cse37 .cse38))))) (store .cse29 c_main_~a~0.base (let ((.cse30 (let ((.cse31 (let ((.cse32 (let ((.cse33 (select .cse29 c_main_~a~0.base))) (store .cse33 c_main_~a~0.offset (+ .cse34 (select .cse33 c_main_~a~0.offset) .cse35 .cse36 .cse37 .cse38))))) (store .cse32 .cse9 (+ (select .cse32 .cse9) (select (select (store .cse29 c_main_~a~0.base .cse32) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|)))))) (store .cse31 .cse8 (+ (select (select (store .cse29 c_main_~a~0.base .cse31) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|) (select .cse31 .cse8)))))) (store .cse30 .cse7 (+ (select .cse30 .cse7) (select (select (store .cse29 c_main_~a~0.base .cse30) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|)))))))))))))) (let ((.cse27 (select .cse26 |c_main_~#sum~0.base|))) (let ((.cse24 (select (select (store .cse26 |c_main_~#sum~0.base| (store .cse27 |c_main_~#sum~0.offset| 0)) c_main_~a~0.base) c_main_~a~0.offset))) (let ((.cse25 (select (select (store .cse26 |c_main_~#sum~0.base| (store .cse27 |c_main_~#sum~0.offset| .cse24)) c_main_~a~0.base) .cse9))) (let ((.cse28 (select (select (store .cse26 |c_main_~#sum~0.base| (store .cse27 |c_main_~#sum~0.offset| (+ .cse24 .cse25))) c_main_~a~0.base) .cse8))) (+ .cse24 .cse25 (select (select (store .cse26 |c_main_~#sum~0.base| (store .cse27 |c_main_~#sum~0.offset| (+ .cse24 .cse25 .cse28))) c_main_~a~0.base) .cse7) .cse28)))))) .cse23) .cse0 .cse1) (or (= .cse23 (let ((.cse45 (let ((.cse57 (store |c_#memory_int| c_main_~a~0.base .cse59))) (let ((.cse58 (select .cse57 |c_main_~#sum~0.base|))) (let ((.cse52 (select .cse58 |c_main_~#sum~0.offset|)) (.cse53 (select .cse59 c_main_~a~0.offset))) (let ((.cse56 (select (select (store .cse57 |c_main_~#sum~0.base| (store .cse58 |c_main_~#sum~0.offset| (+ .cse52 .cse53))) c_main_~a~0.base) .cse9))) (let ((.cse54 (select (select (store .cse57 |c_main_~#sum~0.base| (store .cse58 |c_main_~#sum~0.offset| (+ .cse52 .cse53 .cse56))) c_main_~a~0.base) .cse8))) (let ((.cse55 (select (select (store .cse57 |c_main_~#sum~0.base| (store .cse58 |c_main_~#sum~0.offset| (+ .cse52 .cse53 .cse54 .cse56))) c_main_~a~0.base) .cse7))) (let ((.cse47 (store .cse57 |c_main_~#sum~0.base| (store .cse58 |c_main_~#sum~0.offset| (+ .cse52 .cse53 .cse54 .cse55 .cse56))))) (store .cse47 c_main_~a~0.base (let ((.cse48 (let ((.cse49 (let ((.cse50 (let ((.cse51 (select .cse47 c_main_~a~0.base))) (store .cse51 c_main_~a~0.offset (+ .cse52 .cse53 .cse54 (select .cse51 c_main_~a~0.offset) .cse55 .cse56))))) (store .cse50 .cse9 (+ (select (select (store .cse47 c_main_~a~0.base .cse50) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|) (select .cse50 .cse9)))))) (store .cse49 .cse8 (+ (select (select (store .cse47 c_main_~a~0.base .cse49) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|) (select .cse49 .cse8)))))) (store .cse48 .cse7 (+ (select .cse48 .cse7) (select (select (store .cse47 c_main_~a~0.base .cse48) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|)))))))))))))) (let ((.cse46 (select .cse45 |c_main_~#sum~0.base|))) (let ((.cse43 (select (select (store .cse45 |c_main_~#sum~0.base| (store .cse46 |c_main_~#sum~0.offset| 0)) c_main_~a~0.base) c_main_~a~0.offset))) (let ((.cse42 (select (select (store .cse45 |c_main_~#sum~0.base| (store .cse46 |c_main_~#sum~0.offset| .cse43)) c_main_~a~0.base) .cse9))) (let ((.cse44 (select (select (store .cse45 |c_main_~#sum~0.base| (store .cse46 |c_main_~#sum~0.offset| (+ .cse42 .cse43))) c_main_~a~0.base) .cse8))) (+ .cse42 .cse43 .cse44 (select (select (store .cse45 |c_main_~#sum~0.base| (store .cse46 |c_main_~#sum~0.offset| (+ .cse42 .cse43 .cse44))) c_main_~a~0.base) .cse7)))))))) .cse1 .cse60) (or .cse1 (= (let ((.cse62 (let ((.cse78 (store .cse41 .cse79 1))) (let ((.cse76 (store |c_#memory_int| c_main_~a~0.base .cse78))) (let ((.cse77 (select .cse76 |c_main_~#sum~0.base|))) (let ((.cse72 (select .cse77 |c_main_~#sum~0.offset|)) (.cse75 (select .cse78 c_main_~a~0.offset))) (let ((.cse71 (select (select (store .cse76 |c_main_~#sum~0.base| (store .cse77 |c_main_~#sum~0.offset| (+ .cse72 .cse75))) c_main_~a~0.base) .cse9))) (let ((.cse74 (select (select (store .cse76 |c_main_~#sum~0.base| (store .cse77 |c_main_~#sum~0.offset| (+ .cse71 .cse72 .cse75))) c_main_~a~0.base) .cse8))) (let ((.cse73 (select (select (store .cse76 |c_main_~#sum~0.base| (store .cse77 |c_main_~#sum~0.offset| (+ .cse71 .cse72 .cse74 .cse75))) c_main_~a~0.base) .cse7))) (let ((.cse66 (store .cse76 |c_main_~#sum~0.base| (store .cse77 |c_main_~#sum~0.offset| (+ .cse71 .cse72 .cse73 .cse74 .cse75))))) (store .cse66 c_main_~a~0.base (let ((.cse67 (let ((.cse68 (let ((.cse69 (let ((.cse70 (select .cse66 c_main_~a~0.base))) (store .cse70 c_main_~a~0.offset (+ .cse71 .cse72 (select .cse70 c_main_~a~0.offset) .cse73 .cse74 .cse75))))) (store .cse69 .cse9 (+ (select (select (store .cse66 c_main_~a~0.base .cse69) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|) (select .cse69 .cse9)))))) (store .cse68 .cse8 (+ (select .cse68 .cse8) (select (select (store .cse66 c_main_~a~0.base .cse68) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|)))))) (store .cse67 .cse7 (+ (select (select (store .cse66 c_main_~a~0.base .cse67) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|) (select .cse67 .cse7))))))))))))))) (let ((.cse63 (select .cse62 |c_main_~#sum~0.base|))) (let ((.cse64 (select (select (store .cse62 |c_main_~#sum~0.base| (store .cse63 |c_main_~#sum~0.offset| 0)) c_main_~a~0.base) c_main_~a~0.offset))) (let ((.cse65 (select (select (store .cse62 |c_main_~#sum~0.base| (store .cse63 |c_main_~#sum~0.offset| .cse64)) c_main_~a~0.base) .cse9))) (let ((.cse61 (select (select (store .cse62 |c_main_~#sum~0.base| (store .cse63 |c_main_~#sum~0.offset| (+ .cse64 .cse65))) c_main_~a~0.base) .cse8))) (+ .cse61 (select (select (store .cse62 |c_main_~#sum~0.base| (store .cse63 |c_main_~#sum~0.offset| (+ .cse61 .cse64 .cse65))) c_main_~a~0.base) .cse7) .cse64 .cse65)))))) .cse23) .cse80) (or (= .cse23 (let ((.cse84 (let ((.cse98 (store .cse22 .cse79 1))) (let ((.cse96 (store |c_#memory_int| c_main_~a~0.base .cse98))) (let ((.cse97 (select .cse96 |c_main_~#sum~0.base|))) (let ((.cse92 (select .cse97 |c_main_~#sum~0.offset|)) (.cse94 (select .cse98 c_main_~a~0.offset))) (let ((.cse95 (select (select (store .cse96 |c_main_~#sum~0.base| (store .cse97 |c_main_~#sum~0.offset| (+ .cse92 .cse94))) c_main_~a~0.base) .cse9))) (let ((.cse93 (select (select (store .cse96 |c_main_~#sum~0.base| (store .cse97 |c_main_~#sum~0.offset| (+ .cse92 .cse94 .cse95))) c_main_~a~0.base) .cse8))) (let ((.cse91 (select (select (store .cse96 |c_main_~#sum~0.base| (store .cse97 |c_main_~#sum~0.offset| (+ .cse92 .cse93 .cse94 .cse95))) c_main_~a~0.base) .cse7))) (let ((.cse86 (store .cse96 |c_main_~#sum~0.base| (store .cse97 |c_main_~#sum~0.offset| (+ .cse91 .cse92 .cse93 .cse94 .cse95))))) (store .cse86 c_main_~a~0.base (let ((.cse87 (let ((.cse88 (let ((.cse89 (let ((.cse90 (select .cse86 c_main_~a~0.base))) (store .cse90 c_main_~a~0.offset (+ .cse91 .cse92 .cse93 .cse94 .cse95 (select .cse90 c_main_~a~0.offset)))))) (store .cse89 .cse9 (+ (select .cse89 .cse9) (select (select (store .cse86 c_main_~a~0.base .cse89) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|)))))) (store .cse88 .cse8 (+ (select .cse88 .cse8) (select (select (store .cse86 c_main_~a~0.base .cse88) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|)))))) (store .cse87 .cse7 (+ (select .cse87 .cse7) (select (select (store .cse86 c_main_~a~0.base .cse87) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|))))))))))))))) (let ((.cse85 (select .cse84 |c_main_~#sum~0.base|))) (let ((.cse83 (select (select (store .cse84 |c_main_~#sum~0.base| (store .cse85 |c_main_~#sum~0.offset| 0)) c_main_~a~0.base) c_main_~a~0.offset))) (let ((.cse82 (select (select (store .cse84 |c_main_~#sum~0.base| (store .cse85 |c_main_~#sum~0.offset| .cse83)) c_main_~a~0.base) .cse9))) (let ((.cse81 (select (select (store .cse84 |c_main_~#sum~0.base| (store .cse85 |c_main_~#sum~0.offset| (+ .cse82 .cse83))) c_main_~a~0.base) .cse8))) (+ .cse81 .cse82 .cse83 (select (select (store .cse84 |c_main_~#sum~0.base| (store .cse85 |c_main_~#sum~0.offset| (+ .cse81 .cse82 .cse83))) c_main_~a~0.base) .cse7)))))))) .cse1 .cse80) (< (+ c_main_~a~0.base 1) |c_main_~#sum~0.base|) (<= c_main_~i~0 4) (= (select .cse99 c_main_~a~0.offset) 1) (= c_main_~a~0.offset 0) (or .cse1 .cse60 (= .cse23 (let ((.cse100 (let ((.cse115 (store |c_#memory_int| c_main_~a~0.base .cse117))) (let ((.cse116 (select .cse115 |c_main_~#sum~0.base|))) (let ((.cse110 (select .cse117 c_main_~a~0.offset)) (.cse112 (select .cse116 |c_main_~#sum~0.offset|))) (let ((.cse114 (select (select (store .cse115 |c_main_~#sum~0.base| (store .cse116 |c_main_~#sum~0.offset| (+ .cse110 .cse112))) c_main_~a~0.base) .cse9))) (let ((.cse113 (select (select (store .cse115 |c_main_~#sum~0.base| (store .cse116 |c_main_~#sum~0.offset| (+ .cse110 .cse112 .cse114))) c_main_~a~0.base) .cse8))) (let ((.cse111 (select (select (store .cse115 |c_main_~#sum~0.base| (store .cse116 |c_main_~#sum~0.offset| (+ .cse110 .cse112 .cse113 .cse114))) c_main_~a~0.base) .cse7))) (let ((.cse105 (store .cse115 |c_main_~#sum~0.base| (store .cse116 |c_main_~#sum~0.offset| (+ .cse110 .cse111 .cse112 .cse113 .cse114))))) (store .cse105 c_main_~a~0.base (let ((.cse106 (let ((.cse107 (let ((.cse108 (let ((.cse109 (select .cse105 c_main_~a~0.base))) (store .cse109 c_main_~a~0.offset (+ .cse110 .cse111 .cse112 (select .cse109 c_main_~a~0.offset) .cse113 .cse114))))) (store .cse108 .cse9 (+ (select .cse108 .cse9) (select (select (store .cse105 c_main_~a~0.base .cse108) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|)))))) (store .cse107 .cse8 (+ (select (select (store .cse105 c_main_~a~0.base .cse107) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|) (select .cse107 .cse8)))))) (store .cse106 .cse7 (+ (select (select (store .cse105 c_main_~a~0.base .cse106) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|) (select .cse106 .cse7)))))))))))))) (let ((.cse101 (select .cse100 |c_main_~#sum~0.base|))) (let ((.cse102 (select (select (store .cse100 |c_main_~#sum~0.base| (store .cse101 |c_main_~#sum~0.offset| 0)) c_main_~a~0.base) c_main_~a~0.offset))) (let ((.cse104 (select (select (store .cse100 |c_main_~#sum~0.base| (store .cse101 |c_main_~#sum~0.offset| .cse102)) c_main_~a~0.base) .cse9))) (let ((.cse103 (select (select (store .cse100 |c_main_~#sum~0.base| (store .cse101 |c_main_~#sum~0.offset| (+ .cse102 .cse104))) c_main_~a~0.base) .cse8))) (+ (select (select (store .cse100 |c_main_~#sum~0.base| (store .cse101 |c_main_~#sum~0.offset| (+ .cse102 .cse103 .cse104))) c_main_~a~0.base) .cse7) .cse102 .cse103 .cse104)))))))) (= .cse118 1) (or .cse1 (= (let ((.cse121 (let ((.cse134 (store |c_#memory_int| c_main_~a~0.base .cse136))) (let ((.cse135 (select .cse134 |c_main_~#sum~0.base|))) (let ((.cse131 (select .cse136 c_main_~a~0.offset)) (.cse133 (select .cse135 |c_main_~#sum~0.offset|))) (let ((.cse129 (select (select (store .cse134 |c_main_~#sum~0.base| (store .cse135 |c_main_~#sum~0.offset| (+ .cse131 .cse133))) c_main_~a~0.base) .cse9))) (let ((.cse132 (select (select (store .cse134 |c_main_~#sum~0.base| (store .cse135 |c_main_~#sum~0.offset| (+ .cse129 .cse131 .cse133))) c_main_~a~0.base) .cse8))) (let ((.cse130 (select (select (store .cse134 |c_main_~#sum~0.base| (store .cse135 |c_main_~#sum~0.offset| (+ .cse129 .cse131 .cse132 .cse133))) c_main_~a~0.base) .cse7))) (let ((.cse124 (store .cse134 |c_main_~#sum~0.base| (store .cse135 |c_main_~#sum~0.offset| (+ .cse129 .cse130 .cse131 .cse132 .cse133))))) (store .cse124 c_main_~a~0.base (let ((.cse125 (let ((.cse126 (let ((.cse127 (let ((.cse128 (select .cse124 c_main_~a~0.base))) (store .cse128 c_main_~a~0.offset (+ .cse129 .cse130 .cse131 .cse132 .cse133 (select .cse128 c_main_~a~0.offset)))))) (store .cse127 .cse9 (+ (select .cse127 .cse9) (select (select (store .cse124 c_main_~a~0.base .cse127) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|)))))) (store .cse126 .cse8 (+ (select (select (store .cse124 c_main_~a~0.base .cse126) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|) (select .cse126 .cse8)))))) (store .cse125 .cse7 (+ (select .cse125 .cse7) (select (select (store .cse124 c_main_~a~0.base .cse125) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|)))))))))))))) (let ((.cse122 (select .cse121 |c_main_~#sum~0.base|))) (let ((.cse123 (select (select (store .cse121 |c_main_~#sum~0.base| (store .cse122 |c_main_~#sum~0.offset| 0)) c_main_~a~0.base) c_main_~a~0.offset))) (let ((.cse120 (select (select (store .cse121 |c_main_~#sum~0.base| (store .cse122 |c_main_~#sum~0.offset| .cse123)) c_main_~a~0.base) .cse9))) (let ((.cse119 (select (select (store .cse121 |c_main_~#sum~0.base| (store .cse122 |c_main_~#sum~0.offset| (+ .cse120 .cse123))) c_main_~a~0.base) .cse8))) (+ .cse119 .cse120 (select (select (store .cse121 |c_main_~#sum~0.base| (store .cse122 |c_main_~#sum~0.offset| (+ .cse119 .cse120 .cse123))) c_main_~a~0.base) .cse7) .cse123)))))) .cse23) (not (< c_main_~i~0 c_~N~0))) (= .cse137 1) (= .cse137 (select .cse99 .cse8)) (= (select .cse99 .cse9) 1) (< 3 c_~N~0)))))) is different from false [2022-01-31 12:13:45,419 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse99 (select |c_#memory_int| c_main_~a~0.base)) (.cse138 (* c_main_~i~0 8))) (let ((.cse136 (store .cse99 (+ c_main_~a~0.offset .cse138) 1)) (.cse140 (+ c_main_~a~0.offset .cse138 8)) (.cse7 (+ c_main_~a~0.offset 24))) (let ((.cse118 (select .cse99 .cse7)) (.cse59 (store .cse136 .cse140 1)) (.cse117 (store .cse99 .cse140 1)) (.cse139 (+ c_main_~a~0.offset 16 .cse138))) (let ((.cse0 (not (< (+ c_main_~i~0 2) c_~N~0))) (.cse41 (store .cse117 .cse139 1)) (.cse22 (store .cse59 .cse139 1)) (.cse79 (+ c_main_~a~0.offset .cse138 24)) (.cse80 (not (< (+ c_main_~i~0 3) c_~N~0))) (.cse60 (not (< (+ c_main_~i~0 1) c_~N~0))) (.cse1 (< 4 c_~N~0)) (.cse23 (+ c_~N~0 (* c_~N~0 c_~N~0))) (.cse137 (+ (- 2) (select (select |c_#memory_int| |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|) (* (- 1) .cse118))) (.cse8 (+ c_main_~a~0.offset 16)) (.cse9 (+ c_main_~a~0.offset 8))) (and (or .cse0 .cse1 (= (let ((.cse5 (let ((.cse20 (store |c_#memory_int| c_main_~a~0.base .cse22))) (let ((.cse21 (select .cse20 |c_main_~#sum~0.base|))) (let ((.cse15 (select .cse21 |c_main_~#sum~0.offset|)) (.cse18 (select .cse22 c_main_~a~0.offset))) (let ((.cse19 (select (select (store .cse20 |c_main_~#sum~0.base| (store .cse21 |c_main_~#sum~0.offset| (+ .cse15 .cse18))) c_main_~a~0.base) .cse9))) (let ((.cse16 (select (select (store .cse20 |c_main_~#sum~0.base| (store .cse21 |c_main_~#sum~0.offset| (+ .cse15 .cse18 .cse19))) c_main_~a~0.base) .cse8))) (let ((.cse17 (select (select (store .cse20 |c_main_~#sum~0.base| (store .cse21 |c_main_~#sum~0.offset| (+ .cse15 .cse16 .cse18 .cse19))) c_main_~a~0.base) .cse7))) (let ((.cse10 (store .cse20 |c_main_~#sum~0.base| (store .cse21 |c_main_~#sum~0.offset| (+ .cse15 .cse16 .cse17 .cse18 .cse19))))) (store .cse10 c_main_~a~0.base (let ((.cse11 (let ((.cse12 (let ((.cse13 (let ((.cse14 (select .cse10 c_main_~a~0.base))) (store .cse14 c_main_~a~0.offset (+ .cse15 .cse16 .cse17 .cse18 .cse19 (select .cse14 c_main_~a~0.offset)))))) (store .cse13 .cse9 (+ (select .cse13 .cse9) (select (select (store .cse10 c_main_~a~0.base .cse13) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|)))))) (store .cse12 .cse8 (+ (select .cse12 .cse8) (select (select (store .cse10 c_main_~a~0.base .cse12) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|)))))) (store .cse11 .cse7 (+ (select .cse11 .cse7) (select (select (store .cse10 c_main_~a~0.base .cse11) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|)))))))))))))) (let ((.cse6 (select .cse5 |c_main_~#sum~0.base|))) (let ((.cse4 (select (select (store .cse5 |c_main_~#sum~0.base| (store .cse6 |c_main_~#sum~0.offset| 0)) c_main_~a~0.base) c_main_~a~0.offset))) (let ((.cse3 (select (select (store .cse5 |c_main_~#sum~0.base| (store .cse6 |c_main_~#sum~0.offset| .cse4)) c_main_~a~0.base) .cse9))) (let ((.cse2 (select (select (store .cse5 |c_main_~#sum~0.base| (store .cse6 |c_main_~#sum~0.offset| (+ .cse3 .cse4))) c_main_~a~0.base) .cse8))) (+ .cse2 .cse3 .cse4 (select (select (store .cse5 |c_main_~#sum~0.base| (store .cse6 |c_main_~#sum~0.offset| (+ .cse2 .cse3 .cse4))) c_main_~a~0.base) .cse7))))))) .cse23)) (or (= (let ((.cse26 (let ((.cse39 (store |c_#memory_int| c_main_~a~0.base .cse41))) (let ((.cse40 (select .cse39 |c_main_~#sum~0.base|))) (let ((.cse35 (select .cse41 c_main_~a~0.offset)) (.cse37 (select .cse40 |c_main_~#sum~0.offset|))) (let ((.cse38 (select (select (store .cse39 |c_main_~#sum~0.base| (store .cse40 |c_main_~#sum~0.offset| (+ .cse35 .cse37))) c_main_~a~0.base) .cse9))) (let ((.cse34 (select (select (store .cse39 |c_main_~#sum~0.base| (store .cse40 |c_main_~#sum~0.offset| (+ .cse35 .cse37 .cse38))) c_main_~a~0.base) .cse8))) (let ((.cse36 (select (select (store .cse39 |c_main_~#sum~0.base| (store .cse40 |c_main_~#sum~0.offset| (+ .cse34 .cse35 .cse37 .cse38))) c_main_~a~0.base) .cse7))) (let ((.cse29 (store .cse39 |c_main_~#sum~0.base| (store .cse40 |c_main_~#sum~0.offset| (+ .cse34 .cse35 .cse36 .cse37 .cse38))))) (store .cse29 c_main_~a~0.base (let ((.cse30 (let ((.cse31 (let ((.cse32 (let ((.cse33 (select .cse29 c_main_~a~0.base))) (store .cse33 c_main_~a~0.offset (+ .cse34 (select .cse33 c_main_~a~0.offset) .cse35 .cse36 .cse37 .cse38))))) (store .cse32 .cse9 (+ (select .cse32 .cse9) (select (select (store .cse29 c_main_~a~0.base .cse32) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|)))))) (store .cse31 .cse8 (+ (select (select (store .cse29 c_main_~a~0.base .cse31) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|) (select .cse31 .cse8)))))) (store .cse30 .cse7 (+ (select .cse30 .cse7) (select (select (store .cse29 c_main_~a~0.base .cse30) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|)))))))))))))) (let ((.cse27 (select .cse26 |c_main_~#sum~0.base|))) (let ((.cse24 (select (select (store .cse26 |c_main_~#sum~0.base| (store .cse27 |c_main_~#sum~0.offset| 0)) c_main_~a~0.base) c_main_~a~0.offset))) (let ((.cse25 (select (select (store .cse26 |c_main_~#sum~0.base| (store .cse27 |c_main_~#sum~0.offset| .cse24)) c_main_~a~0.base) .cse9))) (let ((.cse28 (select (select (store .cse26 |c_main_~#sum~0.base| (store .cse27 |c_main_~#sum~0.offset| (+ .cse24 .cse25))) c_main_~a~0.base) .cse8))) (+ .cse24 .cse25 (select (select (store .cse26 |c_main_~#sum~0.base| (store .cse27 |c_main_~#sum~0.offset| (+ .cse24 .cse25 .cse28))) c_main_~a~0.base) .cse7) .cse28)))))) .cse23) .cse0 .cse1) (or (= .cse23 (let ((.cse45 (let ((.cse57 (store |c_#memory_int| c_main_~a~0.base .cse59))) (let ((.cse58 (select .cse57 |c_main_~#sum~0.base|))) (let ((.cse52 (select .cse58 |c_main_~#sum~0.offset|)) (.cse53 (select .cse59 c_main_~a~0.offset))) (let ((.cse56 (select (select (store .cse57 |c_main_~#sum~0.base| (store .cse58 |c_main_~#sum~0.offset| (+ .cse52 .cse53))) c_main_~a~0.base) .cse9))) (let ((.cse54 (select (select (store .cse57 |c_main_~#sum~0.base| (store .cse58 |c_main_~#sum~0.offset| (+ .cse52 .cse53 .cse56))) c_main_~a~0.base) .cse8))) (let ((.cse55 (select (select (store .cse57 |c_main_~#sum~0.base| (store .cse58 |c_main_~#sum~0.offset| (+ .cse52 .cse53 .cse54 .cse56))) c_main_~a~0.base) .cse7))) (let ((.cse47 (store .cse57 |c_main_~#sum~0.base| (store .cse58 |c_main_~#sum~0.offset| (+ .cse52 .cse53 .cse54 .cse55 .cse56))))) (store .cse47 c_main_~a~0.base (let ((.cse48 (let ((.cse49 (let ((.cse50 (let ((.cse51 (select .cse47 c_main_~a~0.base))) (store .cse51 c_main_~a~0.offset (+ .cse52 .cse53 .cse54 (select .cse51 c_main_~a~0.offset) .cse55 .cse56))))) (store .cse50 .cse9 (+ (select (select (store .cse47 c_main_~a~0.base .cse50) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|) (select .cse50 .cse9)))))) (store .cse49 .cse8 (+ (select (select (store .cse47 c_main_~a~0.base .cse49) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|) (select .cse49 .cse8)))))) (store .cse48 .cse7 (+ (select .cse48 .cse7) (select (select (store .cse47 c_main_~a~0.base .cse48) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|)))))))))))))) (let ((.cse46 (select .cse45 |c_main_~#sum~0.base|))) (let ((.cse43 (select (select (store .cse45 |c_main_~#sum~0.base| (store .cse46 |c_main_~#sum~0.offset| 0)) c_main_~a~0.base) c_main_~a~0.offset))) (let ((.cse42 (select (select (store .cse45 |c_main_~#sum~0.base| (store .cse46 |c_main_~#sum~0.offset| .cse43)) c_main_~a~0.base) .cse9))) (let ((.cse44 (select (select (store .cse45 |c_main_~#sum~0.base| (store .cse46 |c_main_~#sum~0.offset| (+ .cse42 .cse43))) c_main_~a~0.base) .cse8))) (+ .cse42 .cse43 .cse44 (select (select (store .cse45 |c_main_~#sum~0.base| (store .cse46 |c_main_~#sum~0.offset| (+ .cse42 .cse43 .cse44))) c_main_~a~0.base) .cse7)))))))) .cse1 .cse60) (or .cse1 (= (let ((.cse62 (let ((.cse78 (store .cse41 .cse79 1))) (let ((.cse76 (store |c_#memory_int| c_main_~a~0.base .cse78))) (let ((.cse77 (select .cse76 |c_main_~#sum~0.base|))) (let ((.cse72 (select .cse77 |c_main_~#sum~0.offset|)) (.cse75 (select .cse78 c_main_~a~0.offset))) (let ((.cse71 (select (select (store .cse76 |c_main_~#sum~0.base| (store .cse77 |c_main_~#sum~0.offset| (+ .cse72 .cse75))) c_main_~a~0.base) .cse9))) (let ((.cse74 (select (select (store .cse76 |c_main_~#sum~0.base| (store .cse77 |c_main_~#sum~0.offset| (+ .cse71 .cse72 .cse75))) c_main_~a~0.base) .cse8))) (let ((.cse73 (select (select (store .cse76 |c_main_~#sum~0.base| (store .cse77 |c_main_~#sum~0.offset| (+ .cse71 .cse72 .cse74 .cse75))) c_main_~a~0.base) .cse7))) (let ((.cse66 (store .cse76 |c_main_~#sum~0.base| (store .cse77 |c_main_~#sum~0.offset| (+ .cse71 .cse72 .cse73 .cse74 .cse75))))) (store .cse66 c_main_~a~0.base (let ((.cse67 (let ((.cse68 (let ((.cse69 (let ((.cse70 (select .cse66 c_main_~a~0.base))) (store .cse70 c_main_~a~0.offset (+ .cse71 .cse72 (select .cse70 c_main_~a~0.offset) .cse73 .cse74 .cse75))))) (store .cse69 .cse9 (+ (select (select (store .cse66 c_main_~a~0.base .cse69) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|) (select .cse69 .cse9)))))) (store .cse68 .cse8 (+ (select .cse68 .cse8) (select (select (store .cse66 c_main_~a~0.base .cse68) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|)))))) (store .cse67 .cse7 (+ (select (select (store .cse66 c_main_~a~0.base .cse67) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|) (select .cse67 .cse7))))))))))))))) (let ((.cse63 (select .cse62 |c_main_~#sum~0.base|))) (let ((.cse64 (select (select (store .cse62 |c_main_~#sum~0.base| (store .cse63 |c_main_~#sum~0.offset| 0)) c_main_~a~0.base) c_main_~a~0.offset))) (let ((.cse65 (select (select (store .cse62 |c_main_~#sum~0.base| (store .cse63 |c_main_~#sum~0.offset| .cse64)) c_main_~a~0.base) .cse9))) (let ((.cse61 (select (select (store .cse62 |c_main_~#sum~0.base| (store .cse63 |c_main_~#sum~0.offset| (+ .cse64 .cse65))) c_main_~a~0.base) .cse8))) (+ .cse61 (select (select (store .cse62 |c_main_~#sum~0.base| (store .cse63 |c_main_~#sum~0.offset| (+ .cse61 .cse64 .cse65))) c_main_~a~0.base) .cse7) .cse64 .cse65)))))) .cse23) .cse80) (or (= .cse23 (let ((.cse84 (let ((.cse98 (store .cse22 .cse79 1))) (let ((.cse96 (store |c_#memory_int| c_main_~a~0.base .cse98))) (let ((.cse97 (select .cse96 |c_main_~#sum~0.base|))) (let ((.cse92 (select .cse97 |c_main_~#sum~0.offset|)) (.cse94 (select .cse98 c_main_~a~0.offset))) (let ((.cse95 (select (select (store .cse96 |c_main_~#sum~0.base| (store .cse97 |c_main_~#sum~0.offset| (+ .cse92 .cse94))) c_main_~a~0.base) .cse9))) (let ((.cse93 (select (select (store .cse96 |c_main_~#sum~0.base| (store .cse97 |c_main_~#sum~0.offset| (+ .cse92 .cse94 .cse95))) c_main_~a~0.base) .cse8))) (let ((.cse91 (select (select (store .cse96 |c_main_~#sum~0.base| (store .cse97 |c_main_~#sum~0.offset| (+ .cse92 .cse93 .cse94 .cse95))) c_main_~a~0.base) .cse7))) (let ((.cse86 (store .cse96 |c_main_~#sum~0.base| (store .cse97 |c_main_~#sum~0.offset| (+ .cse91 .cse92 .cse93 .cse94 .cse95))))) (store .cse86 c_main_~a~0.base (let ((.cse87 (let ((.cse88 (let ((.cse89 (let ((.cse90 (select .cse86 c_main_~a~0.base))) (store .cse90 c_main_~a~0.offset (+ .cse91 .cse92 .cse93 .cse94 .cse95 (select .cse90 c_main_~a~0.offset)))))) (store .cse89 .cse9 (+ (select .cse89 .cse9) (select (select (store .cse86 c_main_~a~0.base .cse89) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|)))))) (store .cse88 .cse8 (+ (select .cse88 .cse8) (select (select (store .cse86 c_main_~a~0.base .cse88) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|)))))) (store .cse87 .cse7 (+ (select .cse87 .cse7) (select (select (store .cse86 c_main_~a~0.base .cse87) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|))))))))))))))) (let ((.cse85 (select .cse84 |c_main_~#sum~0.base|))) (let ((.cse83 (select (select (store .cse84 |c_main_~#sum~0.base| (store .cse85 |c_main_~#sum~0.offset| 0)) c_main_~a~0.base) c_main_~a~0.offset))) (let ((.cse82 (select (select (store .cse84 |c_main_~#sum~0.base| (store .cse85 |c_main_~#sum~0.offset| .cse83)) c_main_~a~0.base) .cse9))) (let ((.cse81 (select (select (store .cse84 |c_main_~#sum~0.base| (store .cse85 |c_main_~#sum~0.offset| (+ .cse82 .cse83))) c_main_~a~0.base) .cse8))) (+ .cse81 .cse82 .cse83 (select (select (store .cse84 |c_main_~#sum~0.base| (store .cse85 |c_main_~#sum~0.offset| (+ .cse81 .cse82 .cse83))) c_main_~a~0.base) .cse7)))))))) .cse1 .cse80) (< (+ c_main_~a~0.base 1) |c_main_~#sum~0.base|) (<= c_main_~i~0 4) (= (select .cse99 c_main_~a~0.offset) 1) (= c_main_~a~0.offset 0) (or .cse1 .cse60 (= .cse23 (let ((.cse100 (let ((.cse115 (store |c_#memory_int| c_main_~a~0.base .cse117))) (let ((.cse116 (select .cse115 |c_main_~#sum~0.base|))) (let ((.cse110 (select .cse117 c_main_~a~0.offset)) (.cse112 (select .cse116 |c_main_~#sum~0.offset|))) (let ((.cse114 (select (select (store .cse115 |c_main_~#sum~0.base| (store .cse116 |c_main_~#sum~0.offset| (+ .cse110 .cse112))) c_main_~a~0.base) .cse9))) (let ((.cse113 (select (select (store .cse115 |c_main_~#sum~0.base| (store .cse116 |c_main_~#sum~0.offset| (+ .cse110 .cse112 .cse114))) c_main_~a~0.base) .cse8))) (let ((.cse111 (select (select (store .cse115 |c_main_~#sum~0.base| (store .cse116 |c_main_~#sum~0.offset| (+ .cse110 .cse112 .cse113 .cse114))) c_main_~a~0.base) .cse7))) (let ((.cse105 (store .cse115 |c_main_~#sum~0.base| (store .cse116 |c_main_~#sum~0.offset| (+ .cse110 .cse111 .cse112 .cse113 .cse114))))) (store .cse105 c_main_~a~0.base (let ((.cse106 (let ((.cse107 (let ((.cse108 (let ((.cse109 (select .cse105 c_main_~a~0.base))) (store .cse109 c_main_~a~0.offset (+ .cse110 .cse111 .cse112 (select .cse109 c_main_~a~0.offset) .cse113 .cse114))))) (store .cse108 .cse9 (+ (select .cse108 .cse9) (select (select (store .cse105 c_main_~a~0.base .cse108) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|)))))) (store .cse107 .cse8 (+ (select (select (store .cse105 c_main_~a~0.base .cse107) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|) (select .cse107 .cse8)))))) (store .cse106 .cse7 (+ (select (select (store .cse105 c_main_~a~0.base .cse106) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|) (select .cse106 .cse7)))))))))))))) (let ((.cse101 (select .cse100 |c_main_~#sum~0.base|))) (let ((.cse102 (select (select (store .cse100 |c_main_~#sum~0.base| (store .cse101 |c_main_~#sum~0.offset| 0)) c_main_~a~0.base) c_main_~a~0.offset))) (let ((.cse104 (select (select (store .cse100 |c_main_~#sum~0.base| (store .cse101 |c_main_~#sum~0.offset| .cse102)) c_main_~a~0.base) .cse9))) (let ((.cse103 (select (select (store .cse100 |c_main_~#sum~0.base| (store .cse101 |c_main_~#sum~0.offset| (+ .cse102 .cse104))) c_main_~a~0.base) .cse8))) (+ (select (select (store .cse100 |c_main_~#sum~0.base| (store .cse101 |c_main_~#sum~0.offset| (+ .cse102 .cse103 .cse104))) c_main_~a~0.base) .cse7) .cse102 .cse103 .cse104)))))))) (= .cse118 1) (or .cse1 (= (let ((.cse121 (let ((.cse134 (store |c_#memory_int| c_main_~a~0.base .cse136))) (let ((.cse135 (select .cse134 |c_main_~#sum~0.base|))) (let ((.cse131 (select .cse136 c_main_~a~0.offset)) (.cse133 (select .cse135 |c_main_~#sum~0.offset|))) (let ((.cse129 (select (select (store .cse134 |c_main_~#sum~0.base| (store .cse135 |c_main_~#sum~0.offset| (+ .cse131 .cse133))) c_main_~a~0.base) .cse9))) (let ((.cse132 (select (select (store .cse134 |c_main_~#sum~0.base| (store .cse135 |c_main_~#sum~0.offset| (+ .cse129 .cse131 .cse133))) c_main_~a~0.base) .cse8))) (let ((.cse130 (select (select (store .cse134 |c_main_~#sum~0.base| (store .cse135 |c_main_~#sum~0.offset| (+ .cse129 .cse131 .cse132 .cse133))) c_main_~a~0.base) .cse7))) (let ((.cse124 (store .cse134 |c_main_~#sum~0.base| (store .cse135 |c_main_~#sum~0.offset| (+ .cse129 .cse130 .cse131 .cse132 .cse133))))) (store .cse124 c_main_~a~0.base (let ((.cse125 (let ((.cse126 (let ((.cse127 (let ((.cse128 (select .cse124 c_main_~a~0.base))) (store .cse128 c_main_~a~0.offset (+ .cse129 .cse130 .cse131 .cse132 .cse133 (select .cse128 c_main_~a~0.offset)))))) (store .cse127 .cse9 (+ (select .cse127 .cse9) (select (select (store .cse124 c_main_~a~0.base .cse127) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|)))))) (store .cse126 .cse8 (+ (select (select (store .cse124 c_main_~a~0.base .cse126) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|) (select .cse126 .cse8)))))) (store .cse125 .cse7 (+ (select .cse125 .cse7) (select (select (store .cse124 c_main_~a~0.base .cse125) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|)))))))))))))) (let ((.cse122 (select .cse121 |c_main_~#sum~0.base|))) (let ((.cse123 (select (select (store .cse121 |c_main_~#sum~0.base| (store .cse122 |c_main_~#sum~0.offset| 0)) c_main_~a~0.base) c_main_~a~0.offset))) (let ((.cse120 (select (select (store .cse121 |c_main_~#sum~0.base| (store .cse122 |c_main_~#sum~0.offset| .cse123)) c_main_~a~0.base) .cse9))) (let ((.cse119 (select (select (store .cse121 |c_main_~#sum~0.base| (store .cse122 |c_main_~#sum~0.offset| (+ .cse120 .cse123))) c_main_~a~0.base) .cse8))) (+ .cse119 .cse120 (select (select (store .cse121 |c_main_~#sum~0.base| (store .cse122 |c_main_~#sum~0.offset| (+ .cse119 .cse120 .cse123))) c_main_~a~0.base) .cse7) .cse123)))))) .cse23) (not (< c_main_~i~0 c_~N~0))) (= .cse137 1) (= .cse137 (select .cse99 .cse8)) (= (select .cse99 .cse9) 1) (< 3 c_~N~0)))))) is different from true [2022-01-31 12:13:55,674 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2022-01-31 12:13:57,986 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.97s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2022-01-31 12:14:04,320 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse144 (* c_main_~i~0 8))) (let ((.cse128 (select |c_#memory_int| c_main_~a~0.base)) (.cse146 (+ c_main_~a~0.offset .cse144 8)) (.cse81 (select (select |c_#memory_int| |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|))) (let ((.cse147 (store .cse128 .cse146 (+ (select .cse128 .cse146) .cse81)))) (let ((.cse102 (store |c_#memory_int| c_main_~a~0.base .cse147))) (let ((.cse103 (select .cse102 |c_main_~#sum~0.base|)) (.cse145 (+ c_main_~a~0.offset 16 .cse144))) (let ((.cse135 (store .cse147 .cse145 (+ (select .cse103 |c_main_~#sum~0.offset|) (select .cse147 .cse145))))) (let ((.cse124 (store |c_#memory_int| c_main_~a~0.base .cse135)) (.cse59 (store (store .cse128 (+ c_main_~a~0.offset .cse144) 1) .cse146 1)) (.cse122 (store .cse128 .cse146 1))) (let ((.cse0 (not (< (+ c_main_~i~0 2) c_~N~0))) (.cse41 (store .cse122 .cse145 1)) (.cse22 (store .cse59 .cse145 1)) (.cse80 (not (< (+ c_main_~i~0 3) c_~N~0))) (.cse1 (< 4 c_~N~0)) (.cse60 (not (< (+ c_main_~i~0 1) c_~N~0))) (.cse125 (select .cse124 |c_main_~#sum~0.base|)) (.cse79 (+ c_main_~a~0.offset .cse144 24)) (.cse7 (+ c_main_~a~0.offset 24)) (.cse8 (+ c_main_~a~0.offset 16)) (.cse9 (+ c_main_~a~0.offset 8)) (.cse129 (select .cse128 c_main_~a~0.offset)) (.cse23 (+ c_~N~0 (* c_~N~0 c_~N~0)))) (and (or .cse0 .cse1 (= (let ((.cse5 (let ((.cse20 (store |c_#memory_int| c_main_~a~0.base .cse22))) (let ((.cse21 (select .cse20 |c_main_~#sum~0.base|))) (let ((.cse15 (select .cse21 |c_main_~#sum~0.offset|)) (.cse18 (select .cse22 c_main_~a~0.offset))) (let ((.cse19 (select (select (store .cse20 |c_main_~#sum~0.base| (store .cse21 |c_main_~#sum~0.offset| (+ .cse15 .cse18))) c_main_~a~0.base) .cse9))) (let ((.cse16 (select (select (store .cse20 |c_main_~#sum~0.base| (store .cse21 |c_main_~#sum~0.offset| (+ .cse15 .cse18 .cse19))) c_main_~a~0.base) .cse8))) (let ((.cse17 (select (select (store .cse20 |c_main_~#sum~0.base| (store .cse21 |c_main_~#sum~0.offset| (+ .cse15 .cse16 .cse18 .cse19))) c_main_~a~0.base) .cse7))) (let ((.cse10 (store .cse20 |c_main_~#sum~0.base| (store .cse21 |c_main_~#sum~0.offset| (+ .cse15 .cse16 .cse17 .cse18 .cse19))))) (store .cse10 c_main_~a~0.base (let ((.cse11 (let ((.cse12 (let ((.cse13 (let ((.cse14 (select .cse10 c_main_~a~0.base))) (store .cse14 c_main_~a~0.offset (+ .cse15 .cse16 .cse17 .cse18 .cse19 (select .cse14 c_main_~a~0.offset)))))) (store .cse13 .cse9 (+ (select .cse13 .cse9) (select (select (store .cse10 c_main_~a~0.base .cse13) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|)))))) (store .cse12 .cse8 (+ (select .cse12 .cse8) (select (select (store .cse10 c_main_~a~0.base .cse12) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|)))))) (store .cse11 .cse7 (+ (select .cse11 .cse7) (select (select (store .cse10 c_main_~a~0.base .cse11) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|)))))))))))))) (let ((.cse6 (select .cse5 |c_main_~#sum~0.base|))) (let ((.cse4 (select (select (store .cse5 |c_main_~#sum~0.base| (store .cse6 |c_main_~#sum~0.offset| 0)) c_main_~a~0.base) c_main_~a~0.offset))) (let ((.cse3 (select (select (store .cse5 |c_main_~#sum~0.base| (store .cse6 |c_main_~#sum~0.offset| .cse4)) c_main_~a~0.base) .cse9))) (let ((.cse2 (select (select (store .cse5 |c_main_~#sum~0.base| (store .cse6 |c_main_~#sum~0.offset| (+ .cse3 .cse4))) c_main_~a~0.base) .cse8))) (+ .cse2 .cse3 .cse4 (select (select (store .cse5 |c_main_~#sum~0.base| (store .cse6 |c_main_~#sum~0.offset| (+ .cse2 .cse3 .cse4))) c_main_~a~0.base) .cse7))))))) .cse23)) (or (= (let ((.cse26 (let ((.cse39 (store |c_#memory_int| c_main_~a~0.base .cse41))) (let ((.cse40 (select .cse39 |c_main_~#sum~0.base|))) (let ((.cse35 (select .cse41 c_main_~a~0.offset)) (.cse37 (select .cse40 |c_main_~#sum~0.offset|))) (let ((.cse38 (select (select (store .cse39 |c_main_~#sum~0.base| (store .cse40 |c_main_~#sum~0.offset| (+ .cse35 .cse37))) c_main_~a~0.base) .cse9))) (let ((.cse34 (select (select (store .cse39 |c_main_~#sum~0.base| (store .cse40 |c_main_~#sum~0.offset| (+ .cse35 .cse37 .cse38))) c_main_~a~0.base) .cse8))) (let ((.cse36 (select (select (store .cse39 |c_main_~#sum~0.base| (store .cse40 |c_main_~#sum~0.offset| (+ .cse34 .cse35 .cse37 .cse38))) c_main_~a~0.base) .cse7))) (let ((.cse29 (store .cse39 |c_main_~#sum~0.base| (store .cse40 |c_main_~#sum~0.offset| (+ .cse34 .cse35 .cse36 .cse37 .cse38))))) (store .cse29 c_main_~a~0.base (let ((.cse30 (let ((.cse31 (let ((.cse32 (let ((.cse33 (select .cse29 c_main_~a~0.base))) (store .cse33 c_main_~a~0.offset (+ .cse34 (select .cse33 c_main_~a~0.offset) .cse35 .cse36 .cse37 .cse38))))) (store .cse32 .cse9 (+ (select .cse32 .cse9) (select (select (store .cse29 c_main_~a~0.base .cse32) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|)))))) (store .cse31 .cse8 (+ (select (select (store .cse29 c_main_~a~0.base .cse31) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|) (select .cse31 .cse8)))))) (store .cse30 .cse7 (+ (select .cse30 .cse7) (select (select (store .cse29 c_main_~a~0.base .cse30) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|)))))))))))))) (let ((.cse27 (select .cse26 |c_main_~#sum~0.base|))) (let ((.cse24 (select (select (store .cse26 |c_main_~#sum~0.base| (store .cse27 |c_main_~#sum~0.offset| 0)) c_main_~a~0.base) c_main_~a~0.offset))) (let ((.cse25 (select (select (store .cse26 |c_main_~#sum~0.base| (store .cse27 |c_main_~#sum~0.offset| .cse24)) c_main_~a~0.base) .cse9))) (let ((.cse28 (select (select (store .cse26 |c_main_~#sum~0.base| (store .cse27 |c_main_~#sum~0.offset| (+ .cse24 .cse25))) c_main_~a~0.base) .cse8))) (+ .cse24 .cse25 (select (select (store .cse26 |c_main_~#sum~0.base| (store .cse27 |c_main_~#sum~0.offset| (+ .cse24 .cse25 .cse28))) c_main_~a~0.base) .cse7) .cse28)))))) .cse23) .cse0 .cse1) (<= c_~N~0 4) (or (= .cse23 (let ((.cse45 (let ((.cse57 (store |c_#memory_int| c_main_~a~0.base .cse59))) (let ((.cse58 (select .cse57 |c_main_~#sum~0.base|))) (let ((.cse52 (select .cse58 |c_main_~#sum~0.offset|)) (.cse53 (select .cse59 c_main_~a~0.offset))) (let ((.cse56 (select (select (store .cse57 |c_main_~#sum~0.base| (store .cse58 |c_main_~#sum~0.offset| (+ .cse52 .cse53))) c_main_~a~0.base) .cse9))) (let ((.cse54 (select (select (store .cse57 |c_main_~#sum~0.base| (store .cse58 |c_main_~#sum~0.offset| (+ .cse52 .cse53 .cse56))) c_main_~a~0.base) .cse8))) (let ((.cse55 (select (select (store .cse57 |c_main_~#sum~0.base| (store .cse58 |c_main_~#sum~0.offset| (+ .cse52 .cse53 .cse54 .cse56))) c_main_~a~0.base) .cse7))) (let ((.cse47 (store .cse57 |c_main_~#sum~0.base| (store .cse58 |c_main_~#sum~0.offset| (+ .cse52 .cse53 .cse54 .cse55 .cse56))))) (store .cse47 c_main_~a~0.base (let ((.cse48 (let ((.cse49 (let ((.cse50 (let ((.cse51 (select .cse47 c_main_~a~0.base))) (store .cse51 c_main_~a~0.offset (+ .cse52 .cse53 .cse54 (select .cse51 c_main_~a~0.offset) .cse55 .cse56))))) (store .cse50 .cse9 (+ (select (select (store .cse47 c_main_~a~0.base .cse50) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|) (select .cse50 .cse9)))))) (store .cse49 .cse8 (+ (select (select (store .cse47 c_main_~a~0.base .cse49) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|) (select .cse49 .cse8)))))) (store .cse48 .cse7 (+ (select .cse48 .cse7) (select (select (store .cse47 c_main_~a~0.base .cse48) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|)))))))))))))) (let ((.cse46 (select .cse45 |c_main_~#sum~0.base|))) (let ((.cse43 (select (select (store .cse45 |c_main_~#sum~0.base| (store .cse46 |c_main_~#sum~0.offset| 0)) c_main_~a~0.base) c_main_~a~0.offset))) (let ((.cse42 (select (select (store .cse45 |c_main_~#sum~0.base| (store .cse46 |c_main_~#sum~0.offset| .cse43)) c_main_~a~0.base) .cse9))) (let ((.cse44 (select (select (store .cse45 |c_main_~#sum~0.base| (store .cse46 |c_main_~#sum~0.offset| (+ .cse42 .cse43))) c_main_~a~0.base) .cse8))) (+ .cse42 .cse43 .cse44 (select (select (store .cse45 |c_main_~#sum~0.base| (store .cse46 |c_main_~#sum~0.offset| (+ .cse42 .cse43 .cse44))) c_main_~a~0.base) .cse7)))))))) .cse1 .cse60) (or .cse1 (= (let ((.cse62 (let ((.cse78 (store .cse41 .cse79 1))) (let ((.cse76 (store |c_#memory_int| c_main_~a~0.base .cse78))) (let ((.cse77 (select .cse76 |c_main_~#sum~0.base|))) (let ((.cse72 (select .cse77 |c_main_~#sum~0.offset|)) (.cse75 (select .cse78 c_main_~a~0.offset))) (let ((.cse71 (select (select (store .cse76 |c_main_~#sum~0.base| (store .cse77 |c_main_~#sum~0.offset| (+ .cse72 .cse75))) c_main_~a~0.base) .cse9))) (let ((.cse74 (select (select (store .cse76 |c_main_~#sum~0.base| (store .cse77 |c_main_~#sum~0.offset| (+ .cse71 .cse72 .cse75))) c_main_~a~0.base) .cse8))) (let ((.cse73 (select (select (store .cse76 |c_main_~#sum~0.base| (store .cse77 |c_main_~#sum~0.offset| (+ .cse71 .cse72 .cse74 .cse75))) c_main_~a~0.base) .cse7))) (let ((.cse66 (store .cse76 |c_main_~#sum~0.base| (store .cse77 |c_main_~#sum~0.offset| (+ .cse71 .cse72 .cse73 .cse74 .cse75))))) (store .cse66 c_main_~a~0.base (let ((.cse67 (let ((.cse68 (let ((.cse69 (let ((.cse70 (select .cse66 c_main_~a~0.base))) (store .cse70 c_main_~a~0.offset (+ .cse71 .cse72 (select .cse70 c_main_~a~0.offset) .cse73 .cse74 .cse75))))) (store .cse69 .cse9 (+ (select (select (store .cse66 c_main_~a~0.base .cse69) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|) (select .cse69 .cse9)))))) (store .cse68 .cse8 (+ (select .cse68 .cse8) (select (select (store .cse66 c_main_~a~0.base .cse68) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|)))))) (store .cse67 .cse7 (+ (select (select (store .cse66 c_main_~a~0.base .cse67) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|) (select .cse67 .cse7))))))))))))))) (let ((.cse63 (select .cse62 |c_main_~#sum~0.base|))) (let ((.cse64 (select (select (store .cse62 |c_main_~#sum~0.base| (store .cse63 |c_main_~#sum~0.offset| 0)) c_main_~a~0.base) c_main_~a~0.offset))) (let ((.cse65 (select (select (store .cse62 |c_main_~#sum~0.base| (store .cse63 |c_main_~#sum~0.offset| .cse64)) c_main_~a~0.base) .cse9))) (let ((.cse61 (select (select (store .cse62 |c_main_~#sum~0.base| (store .cse63 |c_main_~#sum~0.offset| (+ .cse64 .cse65))) c_main_~a~0.base) .cse8))) (+ .cse61 (select (select (store .cse62 |c_main_~#sum~0.base| (store .cse63 |c_main_~#sum~0.offset| (+ .cse61 .cse64 .cse65))) c_main_~a~0.base) .cse7) .cse64 .cse65)))))) .cse23) .cse80) (= .cse81 4) (or (= .cse23 (let ((.cse85 (let ((.cse99 (store .cse22 .cse79 1))) (let ((.cse97 (store |c_#memory_int| c_main_~a~0.base .cse99))) (let ((.cse98 (select .cse97 |c_main_~#sum~0.base|))) (let ((.cse93 (select .cse98 |c_main_~#sum~0.offset|)) (.cse95 (select .cse99 c_main_~a~0.offset))) (let ((.cse96 (select (select (store .cse97 |c_main_~#sum~0.base| (store .cse98 |c_main_~#sum~0.offset| (+ .cse93 .cse95))) c_main_~a~0.base) .cse9))) (let ((.cse94 (select (select (store .cse97 |c_main_~#sum~0.base| (store .cse98 |c_main_~#sum~0.offset| (+ .cse93 .cse95 .cse96))) c_main_~a~0.base) .cse8))) (let ((.cse92 (select (select (store .cse97 |c_main_~#sum~0.base| (store .cse98 |c_main_~#sum~0.offset| (+ .cse93 .cse94 .cse95 .cse96))) c_main_~a~0.base) .cse7))) (let ((.cse87 (store .cse97 |c_main_~#sum~0.base| (store .cse98 |c_main_~#sum~0.offset| (+ .cse92 .cse93 .cse94 .cse95 .cse96))))) (store .cse87 c_main_~a~0.base (let ((.cse88 (let ((.cse89 (let ((.cse90 (let ((.cse91 (select .cse87 c_main_~a~0.base))) (store .cse91 c_main_~a~0.offset (+ .cse92 .cse93 .cse94 .cse95 .cse96 (select .cse91 c_main_~a~0.offset)))))) (store .cse90 .cse9 (+ (select .cse90 .cse9) (select (select (store .cse87 c_main_~a~0.base .cse90) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|)))))) (store .cse89 .cse8 (+ (select .cse89 .cse8) (select (select (store .cse87 c_main_~a~0.base .cse89) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|)))))) (store .cse88 .cse7 (+ (select .cse88 .cse7) (select (select (store .cse87 c_main_~a~0.base .cse88) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|))))))))))))))) (let ((.cse86 (select .cse85 |c_main_~#sum~0.base|))) (let ((.cse84 (select (select (store .cse85 |c_main_~#sum~0.base| (store .cse86 |c_main_~#sum~0.offset| 0)) c_main_~a~0.base) c_main_~a~0.offset))) (let ((.cse83 (select (select (store .cse85 |c_main_~#sum~0.base| (store .cse86 |c_main_~#sum~0.offset| .cse84)) c_main_~a~0.base) .cse9))) (let ((.cse82 (select (select (store .cse85 |c_main_~#sum~0.base| (store .cse86 |c_main_~#sum~0.offset| (+ .cse83 .cse84))) c_main_~a~0.base) .cse8))) (+ .cse82 .cse83 .cse84 (select (select (store .cse85 |c_main_~#sum~0.base| (store .cse86 |c_main_~#sum~0.offset| (+ .cse82 .cse83 .cse84))) c_main_~a~0.base) .cse7)))))))) .cse1 .cse80) (< (+ c_main_~a~0.base 1) |c_main_~#sum~0.base|) (= c_main_~a~0.offset 0) (= .cse23 (let ((.cse104 (select (select (store .cse102 |c_main_~#sum~0.base| (store .cse103 |c_main_~#sum~0.offset| 0)) c_main_~a~0.base) c_main_~a~0.offset))) (let ((.cse101 (select (select (store .cse102 |c_main_~#sum~0.base| (store .cse103 |c_main_~#sum~0.offset| .cse104)) c_main_~a~0.base) .cse9))) (let ((.cse100 (select (select (store .cse102 |c_main_~#sum~0.base| (store .cse103 |c_main_~#sum~0.offset| (+ .cse101 .cse104))) c_main_~a~0.base) .cse8))) (+ .cse100 .cse101 (select (select (store .cse102 |c_main_~#sum~0.base| (store .cse103 |c_main_~#sum~0.offset| (+ .cse100 .cse101 .cse104))) c_main_~a~0.base) .cse7) .cse104))))) (or .cse1 .cse60 (= .cse23 (let ((.cse105 (let ((.cse120 (store |c_#memory_int| c_main_~a~0.base .cse122))) (let ((.cse121 (select .cse120 |c_main_~#sum~0.base|))) (let ((.cse115 (select .cse122 c_main_~a~0.offset)) (.cse117 (select .cse121 |c_main_~#sum~0.offset|))) (let ((.cse119 (select (select (store .cse120 |c_main_~#sum~0.base| (store .cse121 |c_main_~#sum~0.offset| (+ .cse115 .cse117))) c_main_~a~0.base) .cse9))) (let ((.cse118 (select (select (store .cse120 |c_main_~#sum~0.base| (store .cse121 |c_main_~#sum~0.offset| (+ .cse115 .cse117 .cse119))) c_main_~a~0.base) .cse8))) (let ((.cse116 (select (select (store .cse120 |c_main_~#sum~0.base| (store .cse121 |c_main_~#sum~0.offset| (+ .cse115 .cse117 .cse118 .cse119))) c_main_~a~0.base) .cse7))) (let ((.cse110 (store .cse120 |c_main_~#sum~0.base| (store .cse121 |c_main_~#sum~0.offset| (+ .cse115 .cse116 .cse117 .cse118 .cse119))))) (store .cse110 c_main_~a~0.base (let ((.cse111 (let ((.cse112 (let ((.cse113 (let ((.cse114 (select .cse110 c_main_~a~0.base))) (store .cse114 c_main_~a~0.offset (+ .cse115 .cse116 .cse117 (select .cse114 c_main_~a~0.offset) .cse118 .cse119))))) (store .cse113 .cse9 (+ (select .cse113 .cse9) (select (select (store .cse110 c_main_~a~0.base .cse113) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|)))))) (store .cse112 .cse8 (+ (select (select (store .cse110 c_main_~a~0.base .cse112) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|) (select .cse112 .cse8)))))) (store .cse111 .cse7 (+ (select (select (store .cse110 c_main_~a~0.base .cse111) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|) (select .cse111 .cse7)))))))))))))) (let ((.cse106 (select .cse105 |c_main_~#sum~0.base|))) (let ((.cse107 (select (select (store .cse105 |c_main_~#sum~0.base| (store .cse106 |c_main_~#sum~0.offset| 0)) c_main_~a~0.base) c_main_~a~0.offset))) (let ((.cse109 (select (select (store .cse105 |c_main_~#sum~0.base| (store .cse106 |c_main_~#sum~0.offset| .cse107)) c_main_~a~0.base) .cse9))) (let ((.cse108 (select (select (store .cse105 |c_main_~#sum~0.base| (store .cse106 |c_main_~#sum~0.offset| (+ .cse107 .cse109))) c_main_~a~0.base) .cse8))) (+ (select (select (store .cse105 |c_main_~#sum~0.base| (store .cse106 |c_main_~#sum~0.offset| (+ .cse107 .cse108 .cse109))) c_main_~a~0.base) .cse7) .cse107 .cse108 .cse109)))))))) (= (let ((.cse126 (select (select (store .cse124 |c_main_~#sum~0.base| (store .cse125 |c_main_~#sum~0.offset| 0)) c_main_~a~0.base) c_main_~a~0.offset))) (let ((.cse127 (select (select (store .cse124 |c_main_~#sum~0.base| (store .cse125 |c_main_~#sum~0.offset| .cse126)) c_main_~a~0.base) .cse9))) (let ((.cse123 (select (select (store .cse124 |c_main_~#sum~0.base| (store .cse125 |c_main_~#sum~0.offset| (+ .cse126 .cse127))) c_main_~a~0.base) .cse8))) (+ .cse123 (select (select (store .cse124 |c_main_~#sum~0.base| (store .cse125 |c_main_~#sum~0.offset| (+ .cse123 .cse126 .cse127))) c_main_~a~0.base) .cse7) .cse126 .cse127)))) .cse23) (= 5 (select .cse128 .cse8)) (= (select .cse128 .cse9) 5) (= .cse129 5) (= (let ((.cse132 (store |c_#memory_int| c_main_~a~0.base (store .cse135 .cse79 (+ (select .cse125 |c_main_~#sum~0.offset|) (select .cse135 .cse79)))))) (let ((.cse133 (select .cse132 |c_main_~#sum~0.base|))) (let ((.cse134 (select (select (store .cse132 |c_main_~#sum~0.base| (store .cse133 |c_main_~#sum~0.offset| 0)) c_main_~a~0.base) c_main_~a~0.offset))) (let ((.cse131 (select (select (store .cse132 |c_main_~#sum~0.base| (store .cse133 |c_main_~#sum~0.offset| .cse134)) c_main_~a~0.base) .cse9))) (let ((.cse130 (select (select (store .cse132 |c_main_~#sum~0.base| (store .cse133 |c_main_~#sum~0.offset| (+ .cse131 .cse134))) c_main_~a~0.base) .cse8))) (+ .cse130 .cse131 (select (select (store .cse132 |c_main_~#sum~0.base| (store .cse133 |c_main_~#sum~0.offset| (+ .cse130 .cse131 .cse134))) c_main_~a~0.base) .cse7) .cse134)))))) .cse23) (= 5 (select .cse128 .cse7)) (< 3 c_~N~0) (or (< c_main_~i~0 c_~N~0) (= (let ((.cse139 (store |c_#memory_int| c_main_~a~0.base (let ((.cse141 (let ((.cse142 (let ((.cse143 (store .cse128 c_main_~a~0.offset (+ .cse129 .cse81)))) (store .cse143 .cse9 (+ (select (select (store |c_#memory_int| c_main_~a~0.base .cse143) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|) (select .cse143 .cse9)))))) (store .cse142 .cse8 (+ (select (select (store |c_#memory_int| c_main_~a~0.base .cse142) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|) (select .cse142 .cse8)))))) (store .cse141 .cse7 (+ (select .cse141 .cse7) (select (select (store |c_#memory_int| c_main_~a~0.base .cse141) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|))))))) (let ((.cse140 (select .cse139 |c_main_~#sum~0.base|))) (let ((.cse138 (select (select (store .cse139 |c_main_~#sum~0.base| (store .cse140 |c_main_~#sum~0.offset| 0)) c_main_~a~0.base) c_main_~a~0.offset))) (let ((.cse136 (select (select (store .cse139 |c_main_~#sum~0.base| (store .cse140 |c_main_~#sum~0.offset| .cse138)) c_main_~a~0.base) .cse9))) (let ((.cse137 (select (select (store .cse139 |c_main_~#sum~0.base| (store .cse140 |c_main_~#sum~0.offset| (+ .cse136 .cse138))) c_main_~a~0.base) .cse8))) (+ .cse136 .cse137 .cse138 (select (select (store .cse139 |c_main_~#sum~0.base| (store .cse140 |c_main_~#sum~0.offset| (+ .cse136 .cse137 .cse138))) c_main_~a~0.base) .cse7))))))) .cse23))))))))))) is different from false [2022-01-31 12:14:06,349 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse144 (* c_main_~i~0 8))) (let ((.cse128 (select |c_#memory_int| c_main_~a~0.base)) (.cse146 (+ c_main_~a~0.offset .cse144 8)) (.cse81 (select (select |c_#memory_int| |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|))) (let ((.cse147 (store .cse128 .cse146 (+ (select .cse128 .cse146) .cse81)))) (let ((.cse102 (store |c_#memory_int| c_main_~a~0.base .cse147))) (let ((.cse103 (select .cse102 |c_main_~#sum~0.base|)) (.cse145 (+ c_main_~a~0.offset 16 .cse144))) (let ((.cse135 (store .cse147 .cse145 (+ (select .cse103 |c_main_~#sum~0.offset|) (select .cse147 .cse145))))) (let ((.cse124 (store |c_#memory_int| c_main_~a~0.base .cse135)) (.cse59 (store (store .cse128 (+ c_main_~a~0.offset .cse144) 1) .cse146 1)) (.cse122 (store .cse128 .cse146 1))) (let ((.cse0 (not (< (+ c_main_~i~0 2) c_~N~0))) (.cse41 (store .cse122 .cse145 1)) (.cse22 (store .cse59 .cse145 1)) (.cse80 (not (< (+ c_main_~i~0 3) c_~N~0))) (.cse1 (< 4 c_~N~0)) (.cse60 (not (< (+ c_main_~i~0 1) c_~N~0))) (.cse125 (select .cse124 |c_main_~#sum~0.base|)) (.cse79 (+ c_main_~a~0.offset .cse144 24)) (.cse7 (+ c_main_~a~0.offset 24)) (.cse8 (+ c_main_~a~0.offset 16)) (.cse9 (+ c_main_~a~0.offset 8)) (.cse129 (select .cse128 c_main_~a~0.offset)) (.cse23 (+ c_~N~0 (* c_~N~0 c_~N~0)))) (and (or .cse0 .cse1 (= (let ((.cse5 (let ((.cse20 (store |c_#memory_int| c_main_~a~0.base .cse22))) (let ((.cse21 (select .cse20 |c_main_~#sum~0.base|))) (let ((.cse15 (select .cse21 |c_main_~#sum~0.offset|)) (.cse18 (select .cse22 c_main_~a~0.offset))) (let ((.cse19 (select (select (store .cse20 |c_main_~#sum~0.base| (store .cse21 |c_main_~#sum~0.offset| (+ .cse15 .cse18))) c_main_~a~0.base) .cse9))) (let ((.cse16 (select (select (store .cse20 |c_main_~#sum~0.base| (store .cse21 |c_main_~#sum~0.offset| (+ .cse15 .cse18 .cse19))) c_main_~a~0.base) .cse8))) (let ((.cse17 (select (select (store .cse20 |c_main_~#sum~0.base| (store .cse21 |c_main_~#sum~0.offset| (+ .cse15 .cse16 .cse18 .cse19))) c_main_~a~0.base) .cse7))) (let ((.cse10 (store .cse20 |c_main_~#sum~0.base| (store .cse21 |c_main_~#sum~0.offset| (+ .cse15 .cse16 .cse17 .cse18 .cse19))))) (store .cse10 c_main_~a~0.base (let ((.cse11 (let ((.cse12 (let ((.cse13 (let ((.cse14 (select .cse10 c_main_~a~0.base))) (store .cse14 c_main_~a~0.offset (+ .cse15 .cse16 .cse17 .cse18 .cse19 (select .cse14 c_main_~a~0.offset)))))) (store .cse13 .cse9 (+ (select .cse13 .cse9) (select (select (store .cse10 c_main_~a~0.base .cse13) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|)))))) (store .cse12 .cse8 (+ (select .cse12 .cse8) (select (select (store .cse10 c_main_~a~0.base .cse12) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|)))))) (store .cse11 .cse7 (+ (select .cse11 .cse7) (select (select (store .cse10 c_main_~a~0.base .cse11) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|)))))))))))))) (let ((.cse6 (select .cse5 |c_main_~#sum~0.base|))) (let ((.cse4 (select (select (store .cse5 |c_main_~#sum~0.base| (store .cse6 |c_main_~#sum~0.offset| 0)) c_main_~a~0.base) c_main_~a~0.offset))) (let ((.cse3 (select (select (store .cse5 |c_main_~#sum~0.base| (store .cse6 |c_main_~#sum~0.offset| .cse4)) c_main_~a~0.base) .cse9))) (let ((.cse2 (select (select (store .cse5 |c_main_~#sum~0.base| (store .cse6 |c_main_~#sum~0.offset| (+ .cse3 .cse4))) c_main_~a~0.base) .cse8))) (+ .cse2 .cse3 .cse4 (select (select (store .cse5 |c_main_~#sum~0.base| (store .cse6 |c_main_~#sum~0.offset| (+ .cse2 .cse3 .cse4))) c_main_~a~0.base) .cse7))))))) .cse23)) (or (= (let ((.cse26 (let ((.cse39 (store |c_#memory_int| c_main_~a~0.base .cse41))) (let ((.cse40 (select .cse39 |c_main_~#sum~0.base|))) (let ((.cse35 (select .cse41 c_main_~a~0.offset)) (.cse37 (select .cse40 |c_main_~#sum~0.offset|))) (let ((.cse38 (select (select (store .cse39 |c_main_~#sum~0.base| (store .cse40 |c_main_~#sum~0.offset| (+ .cse35 .cse37))) c_main_~a~0.base) .cse9))) (let ((.cse34 (select (select (store .cse39 |c_main_~#sum~0.base| (store .cse40 |c_main_~#sum~0.offset| (+ .cse35 .cse37 .cse38))) c_main_~a~0.base) .cse8))) (let ((.cse36 (select (select (store .cse39 |c_main_~#sum~0.base| (store .cse40 |c_main_~#sum~0.offset| (+ .cse34 .cse35 .cse37 .cse38))) c_main_~a~0.base) .cse7))) (let ((.cse29 (store .cse39 |c_main_~#sum~0.base| (store .cse40 |c_main_~#sum~0.offset| (+ .cse34 .cse35 .cse36 .cse37 .cse38))))) (store .cse29 c_main_~a~0.base (let ((.cse30 (let ((.cse31 (let ((.cse32 (let ((.cse33 (select .cse29 c_main_~a~0.base))) (store .cse33 c_main_~a~0.offset (+ .cse34 (select .cse33 c_main_~a~0.offset) .cse35 .cse36 .cse37 .cse38))))) (store .cse32 .cse9 (+ (select .cse32 .cse9) (select (select (store .cse29 c_main_~a~0.base .cse32) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|)))))) (store .cse31 .cse8 (+ (select (select (store .cse29 c_main_~a~0.base .cse31) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|) (select .cse31 .cse8)))))) (store .cse30 .cse7 (+ (select .cse30 .cse7) (select (select (store .cse29 c_main_~a~0.base .cse30) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|)))))))))))))) (let ((.cse27 (select .cse26 |c_main_~#sum~0.base|))) (let ((.cse24 (select (select (store .cse26 |c_main_~#sum~0.base| (store .cse27 |c_main_~#sum~0.offset| 0)) c_main_~a~0.base) c_main_~a~0.offset))) (let ((.cse25 (select (select (store .cse26 |c_main_~#sum~0.base| (store .cse27 |c_main_~#sum~0.offset| .cse24)) c_main_~a~0.base) .cse9))) (let ((.cse28 (select (select (store .cse26 |c_main_~#sum~0.base| (store .cse27 |c_main_~#sum~0.offset| (+ .cse24 .cse25))) c_main_~a~0.base) .cse8))) (+ .cse24 .cse25 (select (select (store .cse26 |c_main_~#sum~0.base| (store .cse27 |c_main_~#sum~0.offset| (+ .cse24 .cse25 .cse28))) c_main_~a~0.base) .cse7) .cse28)))))) .cse23) .cse0 .cse1) (<= c_~N~0 4) (or (= .cse23 (let ((.cse45 (let ((.cse57 (store |c_#memory_int| c_main_~a~0.base .cse59))) (let ((.cse58 (select .cse57 |c_main_~#sum~0.base|))) (let ((.cse52 (select .cse58 |c_main_~#sum~0.offset|)) (.cse53 (select .cse59 c_main_~a~0.offset))) (let ((.cse56 (select (select (store .cse57 |c_main_~#sum~0.base| (store .cse58 |c_main_~#sum~0.offset| (+ .cse52 .cse53))) c_main_~a~0.base) .cse9))) (let ((.cse54 (select (select (store .cse57 |c_main_~#sum~0.base| (store .cse58 |c_main_~#sum~0.offset| (+ .cse52 .cse53 .cse56))) c_main_~a~0.base) .cse8))) (let ((.cse55 (select (select (store .cse57 |c_main_~#sum~0.base| (store .cse58 |c_main_~#sum~0.offset| (+ .cse52 .cse53 .cse54 .cse56))) c_main_~a~0.base) .cse7))) (let ((.cse47 (store .cse57 |c_main_~#sum~0.base| (store .cse58 |c_main_~#sum~0.offset| (+ .cse52 .cse53 .cse54 .cse55 .cse56))))) (store .cse47 c_main_~a~0.base (let ((.cse48 (let ((.cse49 (let ((.cse50 (let ((.cse51 (select .cse47 c_main_~a~0.base))) (store .cse51 c_main_~a~0.offset (+ .cse52 .cse53 .cse54 (select .cse51 c_main_~a~0.offset) .cse55 .cse56))))) (store .cse50 .cse9 (+ (select (select (store .cse47 c_main_~a~0.base .cse50) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|) (select .cse50 .cse9)))))) (store .cse49 .cse8 (+ (select (select (store .cse47 c_main_~a~0.base .cse49) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|) (select .cse49 .cse8)))))) (store .cse48 .cse7 (+ (select .cse48 .cse7) (select (select (store .cse47 c_main_~a~0.base .cse48) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|)))))))))))))) (let ((.cse46 (select .cse45 |c_main_~#sum~0.base|))) (let ((.cse43 (select (select (store .cse45 |c_main_~#sum~0.base| (store .cse46 |c_main_~#sum~0.offset| 0)) c_main_~a~0.base) c_main_~a~0.offset))) (let ((.cse42 (select (select (store .cse45 |c_main_~#sum~0.base| (store .cse46 |c_main_~#sum~0.offset| .cse43)) c_main_~a~0.base) .cse9))) (let ((.cse44 (select (select (store .cse45 |c_main_~#sum~0.base| (store .cse46 |c_main_~#sum~0.offset| (+ .cse42 .cse43))) c_main_~a~0.base) .cse8))) (+ .cse42 .cse43 .cse44 (select (select (store .cse45 |c_main_~#sum~0.base| (store .cse46 |c_main_~#sum~0.offset| (+ .cse42 .cse43 .cse44))) c_main_~a~0.base) .cse7)))))))) .cse1 .cse60) (or .cse1 (= (let ((.cse62 (let ((.cse78 (store .cse41 .cse79 1))) (let ((.cse76 (store |c_#memory_int| c_main_~a~0.base .cse78))) (let ((.cse77 (select .cse76 |c_main_~#sum~0.base|))) (let ((.cse72 (select .cse77 |c_main_~#sum~0.offset|)) (.cse75 (select .cse78 c_main_~a~0.offset))) (let ((.cse71 (select (select (store .cse76 |c_main_~#sum~0.base| (store .cse77 |c_main_~#sum~0.offset| (+ .cse72 .cse75))) c_main_~a~0.base) .cse9))) (let ((.cse74 (select (select (store .cse76 |c_main_~#sum~0.base| (store .cse77 |c_main_~#sum~0.offset| (+ .cse71 .cse72 .cse75))) c_main_~a~0.base) .cse8))) (let ((.cse73 (select (select (store .cse76 |c_main_~#sum~0.base| (store .cse77 |c_main_~#sum~0.offset| (+ .cse71 .cse72 .cse74 .cse75))) c_main_~a~0.base) .cse7))) (let ((.cse66 (store .cse76 |c_main_~#sum~0.base| (store .cse77 |c_main_~#sum~0.offset| (+ .cse71 .cse72 .cse73 .cse74 .cse75))))) (store .cse66 c_main_~a~0.base (let ((.cse67 (let ((.cse68 (let ((.cse69 (let ((.cse70 (select .cse66 c_main_~a~0.base))) (store .cse70 c_main_~a~0.offset (+ .cse71 .cse72 (select .cse70 c_main_~a~0.offset) .cse73 .cse74 .cse75))))) (store .cse69 .cse9 (+ (select (select (store .cse66 c_main_~a~0.base .cse69) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|) (select .cse69 .cse9)))))) (store .cse68 .cse8 (+ (select .cse68 .cse8) (select (select (store .cse66 c_main_~a~0.base .cse68) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|)))))) (store .cse67 .cse7 (+ (select (select (store .cse66 c_main_~a~0.base .cse67) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|) (select .cse67 .cse7))))))))))))))) (let ((.cse63 (select .cse62 |c_main_~#sum~0.base|))) (let ((.cse64 (select (select (store .cse62 |c_main_~#sum~0.base| (store .cse63 |c_main_~#sum~0.offset| 0)) c_main_~a~0.base) c_main_~a~0.offset))) (let ((.cse65 (select (select (store .cse62 |c_main_~#sum~0.base| (store .cse63 |c_main_~#sum~0.offset| .cse64)) c_main_~a~0.base) .cse9))) (let ((.cse61 (select (select (store .cse62 |c_main_~#sum~0.base| (store .cse63 |c_main_~#sum~0.offset| (+ .cse64 .cse65))) c_main_~a~0.base) .cse8))) (+ .cse61 (select (select (store .cse62 |c_main_~#sum~0.base| (store .cse63 |c_main_~#sum~0.offset| (+ .cse61 .cse64 .cse65))) c_main_~a~0.base) .cse7) .cse64 .cse65)))))) .cse23) .cse80) (= .cse81 4) (or (= .cse23 (let ((.cse85 (let ((.cse99 (store .cse22 .cse79 1))) (let ((.cse97 (store |c_#memory_int| c_main_~a~0.base .cse99))) (let ((.cse98 (select .cse97 |c_main_~#sum~0.base|))) (let ((.cse93 (select .cse98 |c_main_~#sum~0.offset|)) (.cse95 (select .cse99 c_main_~a~0.offset))) (let ((.cse96 (select (select (store .cse97 |c_main_~#sum~0.base| (store .cse98 |c_main_~#sum~0.offset| (+ .cse93 .cse95))) c_main_~a~0.base) .cse9))) (let ((.cse94 (select (select (store .cse97 |c_main_~#sum~0.base| (store .cse98 |c_main_~#sum~0.offset| (+ .cse93 .cse95 .cse96))) c_main_~a~0.base) .cse8))) (let ((.cse92 (select (select (store .cse97 |c_main_~#sum~0.base| (store .cse98 |c_main_~#sum~0.offset| (+ .cse93 .cse94 .cse95 .cse96))) c_main_~a~0.base) .cse7))) (let ((.cse87 (store .cse97 |c_main_~#sum~0.base| (store .cse98 |c_main_~#sum~0.offset| (+ .cse92 .cse93 .cse94 .cse95 .cse96))))) (store .cse87 c_main_~a~0.base (let ((.cse88 (let ((.cse89 (let ((.cse90 (let ((.cse91 (select .cse87 c_main_~a~0.base))) (store .cse91 c_main_~a~0.offset (+ .cse92 .cse93 .cse94 .cse95 .cse96 (select .cse91 c_main_~a~0.offset)))))) (store .cse90 .cse9 (+ (select .cse90 .cse9) (select (select (store .cse87 c_main_~a~0.base .cse90) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|)))))) (store .cse89 .cse8 (+ (select .cse89 .cse8) (select (select (store .cse87 c_main_~a~0.base .cse89) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|)))))) (store .cse88 .cse7 (+ (select .cse88 .cse7) (select (select (store .cse87 c_main_~a~0.base .cse88) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|))))))))))))))) (let ((.cse86 (select .cse85 |c_main_~#sum~0.base|))) (let ((.cse84 (select (select (store .cse85 |c_main_~#sum~0.base| (store .cse86 |c_main_~#sum~0.offset| 0)) c_main_~a~0.base) c_main_~a~0.offset))) (let ((.cse83 (select (select (store .cse85 |c_main_~#sum~0.base| (store .cse86 |c_main_~#sum~0.offset| .cse84)) c_main_~a~0.base) .cse9))) (let ((.cse82 (select (select (store .cse85 |c_main_~#sum~0.base| (store .cse86 |c_main_~#sum~0.offset| (+ .cse83 .cse84))) c_main_~a~0.base) .cse8))) (+ .cse82 .cse83 .cse84 (select (select (store .cse85 |c_main_~#sum~0.base| (store .cse86 |c_main_~#sum~0.offset| (+ .cse82 .cse83 .cse84))) c_main_~a~0.base) .cse7)))))))) .cse1 .cse80) (< (+ c_main_~a~0.base 1) |c_main_~#sum~0.base|) (= c_main_~a~0.offset 0) (= .cse23 (let ((.cse104 (select (select (store .cse102 |c_main_~#sum~0.base| (store .cse103 |c_main_~#sum~0.offset| 0)) c_main_~a~0.base) c_main_~a~0.offset))) (let ((.cse101 (select (select (store .cse102 |c_main_~#sum~0.base| (store .cse103 |c_main_~#sum~0.offset| .cse104)) c_main_~a~0.base) .cse9))) (let ((.cse100 (select (select (store .cse102 |c_main_~#sum~0.base| (store .cse103 |c_main_~#sum~0.offset| (+ .cse101 .cse104))) c_main_~a~0.base) .cse8))) (+ .cse100 .cse101 (select (select (store .cse102 |c_main_~#sum~0.base| (store .cse103 |c_main_~#sum~0.offset| (+ .cse100 .cse101 .cse104))) c_main_~a~0.base) .cse7) .cse104))))) (or .cse1 .cse60 (= .cse23 (let ((.cse105 (let ((.cse120 (store |c_#memory_int| c_main_~a~0.base .cse122))) (let ((.cse121 (select .cse120 |c_main_~#sum~0.base|))) (let ((.cse115 (select .cse122 c_main_~a~0.offset)) (.cse117 (select .cse121 |c_main_~#sum~0.offset|))) (let ((.cse119 (select (select (store .cse120 |c_main_~#sum~0.base| (store .cse121 |c_main_~#sum~0.offset| (+ .cse115 .cse117))) c_main_~a~0.base) .cse9))) (let ((.cse118 (select (select (store .cse120 |c_main_~#sum~0.base| (store .cse121 |c_main_~#sum~0.offset| (+ .cse115 .cse117 .cse119))) c_main_~a~0.base) .cse8))) (let ((.cse116 (select (select (store .cse120 |c_main_~#sum~0.base| (store .cse121 |c_main_~#sum~0.offset| (+ .cse115 .cse117 .cse118 .cse119))) c_main_~a~0.base) .cse7))) (let ((.cse110 (store .cse120 |c_main_~#sum~0.base| (store .cse121 |c_main_~#sum~0.offset| (+ .cse115 .cse116 .cse117 .cse118 .cse119))))) (store .cse110 c_main_~a~0.base (let ((.cse111 (let ((.cse112 (let ((.cse113 (let ((.cse114 (select .cse110 c_main_~a~0.base))) (store .cse114 c_main_~a~0.offset (+ .cse115 .cse116 .cse117 (select .cse114 c_main_~a~0.offset) .cse118 .cse119))))) (store .cse113 .cse9 (+ (select .cse113 .cse9) (select (select (store .cse110 c_main_~a~0.base .cse113) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|)))))) (store .cse112 .cse8 (+ (select (select (store .cse110 c_main_~a~0.base .cse112) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|) (select .cse112 .cse8)))))) (store .cse111 .cse7 (+ (select (select (store .cse110 c_main_~a~0.base .cse111) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|) (select .cse111 .cse7)))))))))))))) (let ((.cse106 (select .cse105 |c_main_~#sum~0.base|))) (let ((.cse107 (select (select (store .cse105 |c_main_~#sum~0.base| (store .cse106 |c_main_~#sum~0.offset| 0)) c_main_~a~0.base) c_main_~a~0.offset))) (let ((.cse109 (select (select (store .cse105 |c_main_~#sum~0.base| (store .cse106 |c_main_~#sum~0.offset| .cse107)) c_main_~a~0.base) .cse9))) (let ((.cse108 (select (select (store .cse105 |c_main_~#sum~0.base| (store .cse106 |c_main_~#sum~0.offset| (+ .cse107 .cse109))) c_main_~a~0.base) .cse8))) (+ (select (select (store .cse105 |c_main_~#sum~0.base| (store .cse106 |c_main_~#sum~0.offset| (+ .cse107 .cse108 .cse109))) c_main_~a~0.base) .cse7) .cse107 .cse108 .cse109)))))))) (= (let ((.cse126 (select (select (store .cse124 |c_main_~#sum~0.base| (store .cse125 |c_main_~#sum~0.offset| 0)) c_main_~a~0.base) c_main_~a~0.offset))) (let ((.cse127 (select (select (store .cse124 |c_main_~#sum~0.base| (store .cse125 |c_main_~#sum~0.offset| .cse126)) c_main_~a~0.base) .cse9))) (let ((.cse123 (select (select (store .cse124 |c_main_~#sum~0.base| (store .cse125 |c_main_~#sum~0.offset| (+ .cse126 .cse127))) c_main_~a~0.base) .cse8))) (+ .cse123 (select (select (store .cse124 |c_main_~#sum~0.base| (store .cse125 |c_main_~#sum~0.offset| (+ .cse123 .cse126 .cse127))) c_main_~a~0.base) .cse7) .cse126 .cse127)))) .cse23) (= 5 (select .cse128 .cse8)) (= (select .cse128 .cse9) 5) (= .cse129 5) (= (let ((.cse132 (store |c_#memory_int| c_main_~a~0.base (store .cse135 .cse79 (+ (select .cse125 |c_main_~#sum~0.offset|) (select .cse135 .cse79)))))) (let ((.cse133 (select .cse132 |c_main_~#sum~0.base|))) (let ((.cse134 (select (select (store .cse132 |c_main_~#sum~0.base| (store .cse133 |c_main_~#sum~0.offset| 0)) c_main_~a~0.base) c_main_~a~0.offset))) (let ((.cse131 (select (select (store .cse132 |c_main_~#sum~0.base| (store .cse133 |c_main_~#sum~0.offset| .cse134)) c_main_~a~0.base) .cse9))) (let ((.cse130 (select (select (store .cse132 |c_main_~#sum~0.base| (store .cse133 |c_main_~#sum~0.offset| (+ .cse131 .cse134))) c_main_~a~0.base) .cse8))) (+ .cse130 .cse131 (select (select (store .cse132 |c_main_~#sum~0.base| (store .cse133 |c_main_~#sum~0.offset| (+ .cse130 .cse131 .cse134))) c_main_~a~0.base) .cse7) .cse134)))))) .cse23) (= 5 (select .cse128 .cse7)) (< 3 c_~N~0) (or (< c_main_~i~0 c_~N~0) (= (let ((.cse139 (store |c_#memory_int| c_main_~a~0.base (let ((.cse141 (let ((.cse142 (let ((.cse143 (store .cse128 c_main_~a~0.offset (+ .cse129 .cse81)))) (store .cse143 .cse9 (+ (select (select (store |c_#memory_int| c_main_~a~0.base .cse143) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|) (select .cse143 .cse9)))))) (store .cse142 .cse8 (+ (select (select (store |c_#memory_int| c_main_~a~0.base .cse142) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|) (select .cse142 .cse8)))))) (store .cse141 .cse7 (+ (select .cse141 .cse7) (select (select (store |c_#memory_int| c_main_~a~0.base .cse141) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|))))))) (let ((.cse140 (select .cse139 |c_main_~#sum~0.base|))) (let ((.cse138 (select (select (store .cse139 |c_main_~#sum~0.base| (store .cse140 |c_main_~#sum~0.offset| 0)) c_main_~a~0.base) c_main_~a~0.offset))) (let ((.cse136 (select (select (store .cse139 |c_main_~#sum~0.base| (store .cse140 |c_main_~#sum~0.offset| .cse138)) c_main_~a~0.base) .cse9))) (let ((.cse137 (select (select (store .cse139 |c_main_~#sum~0.base| (store .cse140 |c_main_~#sum~0.offset| (+ .cse136 .cse138))) c_main_~a~0.base) .cse8))) (+ .cse136 .cse137 .cse138 (select (select (store .cse139 |c_main_~#sum~0.base| (store .cse140 |c_main_~#sum~0.offset| (+ .cse136 .cse137 .cse138))) c_main_~a~0.base) .cse7))))))) .cse23))))))))))) is different from true [2022-01-31 12:14:44,305 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2022-01-31 12:14:52,314 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse138 (* c_main_~i~0 8))) (let ((.cse73 (select (select |c_#memory_int| |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|)) (.cse131 (select |c_#memory_int| c_main_~a~0.base)) (.cse140 (+ c_main_~a~0.offset .cse138))) (let ((.cse143 (store .cse131 .cse140 (+ .cse73 (select .cse131 .cse140))))) (let ((.cse70 (store |c_#memory_int| c_main_~a~0.base .cse143))) (let ((.cse71 (select .cse70 |c_main_~#sum~0.base|)) (.cse139 (+ c_main_~a~0.offset .cse138 8))) (let ((.cse141 (store .cse131 .cse139 (+ (select .cse131 .cse139) .cse73))) (.cse142 (store .cse143 .cse139 (+ (select .cse71 |c_main_~#sum~0.offset|) (select .cse143 .cse139))))) (let ((.cse74 (store |c_#memory_int| c_main_~a~0.base .cse142)) (.cse106 (store |c_#memory_int| c_main_~a~0.base .cse141))) (let ((.cse107 (select .cse106 |c_main_~#sum~0.base|)) (.cse48 (+ c_main_~a~0.offset 16 .cse138)) (.cse75 (select .cse74 |c_main_~#sum~0.base|))) (let ((.cse103 (store .cse142 .cse48 (+ (select .cse142 .cse48) (select .cse75 |c_main_~#sum~0.offset|)))) (.cse137 (store .cse141 .cse48 (+ (select .cse107 |c_main_~#sum~0.offset|) (select .cse141 .cse48))))) (let ((.cse127 (store |c_#memory_int| c_main_~a~0.base .cse137)) (.cse4 (store |c_#memory_int| c_main_~a~0.base .cse103)) (.cse66 (store (store .cse131 .cse140 1) .cse139 1))) (let ((.cse9 (not (< (+ c_main_~i~0 2) c_~N~0))) (.cse28 (store .cse66 .cse48 1)) (.cse5 (select .cse4 |c_main_~#sum~0.base|)) (.cse10 (< 4 c_~N~0)) (.cse67 (not (< (+ c_main_~i~0 1) c_~N~0))) (.cse47 (store .cse131 .cse139 1)) (.cse7 (+ c_main_~a~0.offset 16)) (.cse8 (+ c_main_~a~0.offset 8)) (.cse128 (select .cse127 |c_main_~#sum~0.base|)) (.cse97 (+ c_main_~a~0.offset .cse138 24)) (.cse0 (+ c_~N~0 (* c_~N~0 c_~N~0))) (.cse6 (+ c_main_~a~0.offset 24))) (and (= .cse0 (let ((.cse3 (select (select (store .cse4 |c_main_~#sum~0.base| (store .cse5 |c_main_~#sum~0.offset| 0)) c_main_~a~0.base) c_main_~a~0.offset))) (let ((.cse1 (select (select (store .cse4 |c_main_~#sum~0.base| (store .cse5 |c_main_~#sum~0.offset| .cse3)) c_main_~a~0.base) .cse8))) (let ((.cse2 (select (select (store .cse4 |c_main_~#sum~0.base| (store .cse5 |c_main_~#sum~0.offset| (+ .cse1 .cse3))) c_main_~a~0.base) .cse7))) (+ .cse1 .cse2 .cse3 (select (select (store .cse4 |c_main_~#sum~0.base| (store .cse5 |c_main_~#sum~0.offset| (+ .cse1 .cse2 .cse3))) c_main_~a~0.base) .cse6)))))) (or .cse9 .cse10 (= (let ((.cse14 (let ((.cse26 (store |c_#memory_int| c_main_~a~0.base .cse28))) (let ((.cse27 (select .cse26 |c_main_~#sum~0.base|))) (let ((.cse21 (select .cse27 |c_main_~#sum~0.offset|)) (.cse24 (select .cse28 c_main_~a~0.offset))) (let ((.cse25 (select (select (store .cse26 |c_main_~#sum~0.base| (store .cse27 |c_main_~#sum~0.offset| (+ .cse21 .cse24))) c_main_~a~0.base) .cse8))) (let ((.cse22 (select (select (store .cse26 |c_main_~#sum~0.base| (store .cse27 |c_main_~#sum~0.offset| (+ .cse21 .cse24 .cse25))) c_main_~a~0.base) .cse7))) (let ((.cse23 (select (select (store .cse26 |c_main_~#sum~0.base| (store .cse27 |c_main_~#sum~0.offset| (+ .cse21 .cse22 .cse24 .cse25))) c_main_~a~0.base) .cse6))) (let ((.cse16 (store .cse26 |c_main_~#sum~0.base| (store .cse27 |c_main_~#sum~0.offset| (+ .cse21 .cse22 .cse23 .cse24 .cse25))))) (store .cse16 c_main_~a~0.base (let ((.cse17 (let ((.cse18 (let ((.cse19 (let ((.cse20 (select .cse16 c_main_~a~0.base))) (store .cse20 c_main_~a~0.offset (+ .cse21 .cse22 .cse23 .cse24 .cse25 (select .cse20 c_main_~a~0.offset)))))) (store .cse19 .cse8 (+ (select .cse19 .cse8) (select (select (store .cse16 c_main_~a~0.base .cse19) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|)))))) (store .cse18 .cse7 (+ (select .cse18 .cse7) (select (select (store .cse16 c_main_~a~0.base .cse18) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|)))))) (store .cse17 .cse6 (+ (select .cse17 .cse6) (select (select (store .cse16 c_main_~a~0.base .cse17) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|)))))))))))))) (let ((.cse15 (select .cse14 |c_main_~#sum~0.base|))) (let ((.cse13 (select (select (store .cse14 |c_main_~#sum~0.base| (store .cse15 |c_main_~#sum~0.offset| 0)) c_main_~a~0.base) c_main_~a~0.offset))) (let ((.cse12 (select (select (store .cse14 |c_main_~#sum~0.base| (store .cse15 |c_main_~#sum~0.offset| .cse13)) c_main_~a~0.base) .cse8))) (let ((.cse11 (select (select (store .cse14 |c_main_~#sum~0.base| (store .cse15 |c_main_~#sum~0.offset| (+ .cse12 .cse13))) c_main_~a~0.base) .cse7))) (+ .cse11 .cse12 .cse13 (select (select (store .cse14 |c_main_~#sum~0.base| (store .cse15 |c_main_~#sum~0.offset| (+ .cse11 .cse12 .cse13))) c_main_~a~0.base) .cse6))))))) .cse0)) (or (= (let ((.cse31 (let ((.cse46 (store .cse47 .cse48 1))) (let ((.cse44 (store |c_#memory_int| c_main_~a~0.base .cse46))) (let ((.cse45 (select .cse44 |c_main_~#sum~0.base|))) (let ((.cse40 (select .cse46 c_main_~a~0.offset)) (.cse42 (select .cse45 |c_main_~#sum~0.offset|))) (let ((.cse43 (select (select (store .cse44 |c_main_~#sum~0.base| (store .cse45 |c_main_~#sum~0.offset| (+ .cse40 .cse42))) c_main_~a~0.base) .cse8))) (let ((.cse39 (select (select (store .cse44 |c_main_~#sum~0.base| (store .cse45 |c_main_~#sum~0.offset| (+ .cse40 .cse42 .cse43))) c_main_~a~0.base) .cse7))) (let ((.cse41 (select (select (store .cse44 |c_main_~#sum~0.base| (store .cse45 |c_main_~#sum~0.offset| (+ .cse39 .cse40 .cse42 .cse43))) c_main_~a~0.base) .cse6))) (let ((.cse34 (store .cse44 |c_main_~#sum~0.base| (store .cse45 |c_main_~#sum~0.offset| (+ .cse39 .cse40 .cse41 .cse42 .cse43))))) (store .cse34 c_main_~a~0.base (let ((.cse35 (let ((.cse36 (let ((.cse37 (let ((.cse38 (select .cse34 c_main_~a~0.base))) (store .cse38 c_main_~a~0.offset (+ .cse39 (select .cse38 c_main_~a~0.offset) .cse40 .cse41 .cse42 .cse43))))) (store .cse37 .cse8 (+ (select .cse37 .cse8) (select (select (store .cse34 c_main_~a~0.base .cse37) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|)))))) (store .cse36 .cse7 (+ (select (select (store .cse34 c_main_~a~0.base .cse36) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|) (select .cse36 .cse7)))))) (store .cse35 .cse6 (+ (select .cse35 .cse6) (select (select (store .cse34 c_main_~a~0.base .cse35) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|))))))))))))))) (let ((.cse32 (select .cse31 |c_main_~#sum~0.base|))) (let ((.cse29 (select (select (store .cse31 |c_main_~#sum~0.base| (store .cse32 |c_main_~#sum~0.offset| 0)) c_main_~a~0.base) c_main_~a~0.offset))) (let ((.cse30 (select (select (store .cse31 |c_main_~#sum~0.base| (store .cse32 |c_main_~#sum~0.offset| .cse29)) c_main_~a~0.base) .cse8))) (let ((.cse33 (select (select (store .cse31 |c_main_~#sum~0.base| (store .cse32 |c_main_~#sum~0.offset| (+ .cse29 .cse30))) c_main_~a~0.base) .cse7))) (+ .cse29 .cse30 (select (select (store .cse31 |c_main_~#sum~0.base| (store .cse32 |c_main_~#sum~0.offset| (+ .cse29 .cse30 .cse33))) c_main_~a~0.base) .cse6) .cse33)))))) .cse0) .cse9 .cse10) (<= c_~N~0 4) (or (= .cse0 (let ((.cse52 (let ((.cse64 (store |c_#memory_int| c_main_~a~0.base .cse66))) (let ((.cse65 (select .cse64 |c_main_~#sum~0.base|))) (let ((.cse59 (select .cse65 |c_main_~#sum~0.offset|)) (.cse60 (select .cse66 c_main_~a~0.offset))) (let ((.cse63 (select (select (store .cse64 |c_main_~#sum~0.base| (store .cse65 |c_main_~#sum~0.offset| (+ .cse59 .cse60))) c_main_~a~0.base) .cse8))) (let ((.cse61 (select (select (store .cse64 |c_main_~#sum~0.base| (store .cse65 |c_main_~#sum~0.offset| (+ .cse59 .cse60 .cse63))) c_main_~a~0.base) .cse7))) (let ((.cse62 (select (select (store .cse64 |c_main_~#sum~0.base| (store .cse65 |c_main_~#sum~0.offset| (+ .cse59 .cse60 .cse61 .cse63))) c_main_~a~0.base) .cse6))) (let ((.cse54 (store .cse64 |c_main_~#sum~0.base| (store .cse65 |c_main_~#sum~0.offset| (+ .cse59 .cse60 .cse61 .cse62 .cse63))))) (store .cse54 c_main_~a~0.base (let ((.cse55 (let ((.cse56 (let ((.cse57 (let ((.cse58 (select .cse54 c_main_~a~0.base))) (store .cse58 c_main_~a~0.offset (+ .cse59 .cse60 .cse61 (select .cse58 c_main_~a~0.offset) .cse62 .cse63))))) (store .cse57 .cse8 (+ (select (select (store .cse54 c_main_~a~0.base .cse57) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|) (select .cse57 .cse8)))))) (store .cse56 .cse7 (+ (select (select (store .cse54 c_main_~a~0.base .cse56) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|) (select .cse56 .cse7)))))) (store .cse55 .cse6 (+ (select .cse55 .cse6) (select (select (store .cse54 c_main_~a~0.base .cse55) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|)))))))))))))) (let ((.cse53 (select .cse52 |c_main_~#sum~0.base|))) (let ((.cse50 (select (select (store .cse52 |c_main_~#sum~0.base| (store .cse53 |c_main_~#sum~0.offset| 0)) c_main_~a~0.base) c_main_~a~0.offset))) (let ((.cse49 (select (select (store .cse52 |c_main_~#sum~0.base| (store .cse53 |c_main_~#sum~0.offset| .cse50)) c_main_~a~0.base) .cse8))) (let ((.cse51 (select (select (store .cse52 |c_main_~#sum~0.base| (store .cse53 |c_main_~#sum~0.offset| (+ .cse49 .cse50))) c_main_~a~0.base) .cse7))) (+ .cse49 .cse50 .cse51 (select (select (store .cse52 |c_main_~#sum~0.base| (store .cse53 |c_main_~#sum~0.offset| (+ .cse49 .cse50 .cse51))) c_main_~a~0.base) .cse6)))))))) .cse10 .cse67) (= .cse0 (let ((.cse68 (select (select (store .cse70 |c_main_~#sum~0.base| (store .cse71 |c_main_~#sum~0.offset| 0)) c_main_~a~0.base) c_main_~a~0.offset))) (let ((.cse72 (select (select (store .cse70 |c_main_~#sum~0.base| (store .cse71 |c_main_~#sum~0.offset| .cse68)) c_main_~a~0.base) .cse8))) (let ((.cse69 (select (select (store .cse70 |c_main_~#sum~0.base| (store .cse71 |c_main_~#sum~0.offset| (+ .cse68 .cse72))) c_main_~a~0.base) .cse7))) (+ .cse68 .cse69 (select (select (store .cse70 |c_main_~#sum~0.base| (store .cse71 |c_main_~#sum~0.offset| (+ .cse68 .cse69 .cse72))) c_main_~a~0.base) .cse6) .cse72))))) (= .cse73 4) (= .cse0 (let ((.cse77 (select (select (store .cse74 |c_main_~#sum~0.base| (store .cse75 |c_main_~#sum~0.offset| 0)) c_main_~a~0.base) c_main_~a~0.offset))) (let ((.cse76 (select (select (store .cse74 |c_main_~#sum~0.base| (store .cse75 |c_main_~#sum~0.offset| .cse77)) c_main_~a~0.base) .cse8))) (let ((.cse78 (select (select (store .cse74 |c_main_~#sum~0.base| (store .cse75 |c_main_~#sum~0.offset| (+ .cse76 .cse77))) c_main_~a~0.base) .cse7))) (+ (select (select (store .cse74 |c_main_~#sum~0.base| (store .cse75 |c_main_~#sum~0.offset| (+ .cse76 .cse77 .cse78))) c_main_~a~0.base) .cse6) .cse76 .cse77 .cse78))))) (or (= .cse0 (let ((.cse82 (let ((.cse96 (store .cse28 .cse97 1))) (let ((.cse94 (store |c_#memory_int| c_main_~a~0.base .cse96))) (let ((.cse95 (select .cse94 |c_main_~#sum~0.base|))) (let ((.cse90 (select .cse95 |c_main_~#sum~0.offset|)) (.cse92 (select .cse96 c_main_~a~0.offset))) (let ((.cse93 (select (select (store .cse94 |c_main_~#sum~0.base| (store .cse95 |c_main_~#sum~0.offset| (+ .cse90 .cse92))) c_main_~a~0.base) .cse8))) (let ((.cse91 (select (select (store .cse94 |c_main_~#sum~0.base| (store .cse95 |c_main_~#sum~0.offset| (+ .cse90 .cse92 .cse93))) c_main_~a~0.base) .cse7))) (let ((.cse89 (select (select (store .cse94 |c_main_~#sum~0.base| (store .cse95 |c_main_~#sum~0.offset| (+ .cse90 .cse91 .cse92 .cse93))) c_main_~a~0.base) .cse6))) (let ((.cse84 (store .cse94 |c_main_~#sum~0.base| (store .cse95 |c_main_~#sum~0.offset| (+ .cse89 .cse90 .cse91 .cse92 .cse93))))) (store .cse84 c_main_~a~0.base (let ((.cse85 (let ((.cse86 (let ((.cse87 (let ((.cse88 (select .cse84 c_main_~a~0.base))) (store .cse88 c_main_~a~0.offset (+ .cse89 .cse90 .cse91 .cse92 .cse93 (select .cse88 c_main_~a~0.offset)))))) (store .cse87 .cse8 (+ (select .cse87 .cse8) (select (select (store .cse84 c_main_~a~0.base .cse87) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|)))))) (store .cse86 .cse7 (+ (select .cse86 .cse7) (select (select (store .cse84 c_main_~a~0.base .cse86) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|)))))) (store .cse85 .cse6 (+ (select .cse85 .cse6) (select (select (store .cse84 c_main_~a~0.base .cse85) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|))))))))))))))) (let ((.cse83 (select .cse82 |c_main_~#sum~0.base|))) (let ((.cse81 (select (select (store .cse82 |c_main_~#sum~0.base| (store .cse83 |c_main_~#sum~0.offset| 0)) c_main_~a~0.base) c_main_~a~0.offset))) (let ((.cse80 (select (select (store .cse82 |c_main_~#sum~0.base| (store .cse83 |c_main_~#sum~0.offset| .cse81)) c_main_~a~0.base) .cse8))) (let ((.cse79 (select (select (store .cse82 |c_main_~#sum~0.base| (store .cse83 |c_main_~#sum~0.offset| (+ .cse80 .cse81))) c_main_~a~0.base) .cse7))) (+ .cse79 .cse80 .cse81 (select (select (store .cse82 |c_main_~#sum~0.base| (store .cse83 |c_main_~#sum~0.offset| (+ .cse79 .cse80 .cse81))) c_main_~a~0.base) .cse6)))))))) .cse10 (not (< (+ c_main_~i~0 3) c_~N~0))) (< (+ c_main_~a~0.base 1) |c_main_~#sum~0.base|) (= c_main_~a~0.offset 0) (= .cse0 (let ((.cse101 (store |c_#memory_int| c_main_~a~0.base (store .cse103 .cse97 (+ (select .cse103 .cse97) (select .cse5 |c_main_~#sum~0.offset|)))))) (let ((.cse102 (select .cse101 |c_main_~#sum~0.base|))) (let ((.cse99 (select (select (store .cse101 |c_main_~#sum~0.base| (store .cse102 |c_main_~#sum~0.offset| 0)) c_main_~a~0.base) c_main_~a~0.offset))) (let ((.cse98 (select (select (store .cse101 |c_main_~#sum~0.base| (store .cse102 |c_main_~#sum~0.offset| .cse99)) c_main_~a~0.base) .cse8))) (let ((.cse100 (select (select (store .cse101 |c_main_~#sum~0.base| (store .cse102 |c_main_~#sum~0.offset| (+ .cse98 .cse99))) c_main_~a~0.base) .cse7))) (+ .cse98 .cse99 .cse100 (select (select (store .cse101 |c_main_~#sum~0.base| (store .cse102 |c_main_~#sum~0.offset| (+ .cse98 .cse99 .cse100))) c_main_~a~0.base) .cse6)))))))) (= .cse0 (let ((.cse108 (select (select (store .cse106 |c_main_~#sum~0.base| (store .cse107 |c_main_~#sum~0.offset| 0)) c_main_~a~0.base) c_main_~a~0.offset))) (let ((.cse105 (select (select (store .cse106 |c_main_~#sum~0.base| (store .cse107 |c_main_~#sum~0.offset| .cse108)) c_main_~a~0.base) .cse8))) (let ((.cse104 (select (select (store .cse106 |c_main_~#sum~0.base| (store .cse107 |c_main_~#sum~0.offset| (+ .cse105 .cse108))) c_main_~a~0.base) .cse7))) (+ .cse104 .cse105 (select (select (store .cse106 |c_main_~#sum~0.base| (store .cse107 |c_main_~#sum~0.offset| (+ .cse104 .cse105 .cse108))) c_main_~a~0.base) .cse6) .cse108))))) (or .cse10 .cse67 (= .cse0 (let ((.cse109 (let ((.cse124 (store |c_#memory_int| c_main_~a~0.base .cse47))) (let ((.cse125 (select .cse124 |c_main_~#sum~0.base|))) (let ((.cse119 (select .cse47 c_main_~a~0.offset)) (.cse121 (select .cse125 |c_main_~#sum~0.offset|))) (let ((.cse123 (select (select (store .cse124 |c_main_~#sum~0.base| (store .cse125 |c_main_~#sum~0.offset| (+ .cse119 .cse121))) c_main_~a~0.base) .cse8))) (let ((.cse122 (select (select (store .cse124 |c_main_~#sum~0.base| (store .cse125 |c_main_~#sum~0.offset| (+ .cse119 .cse121 .cse123))) c_main_~a~0.base) .cse7))) (let ((.cse120 (select (select (store .cse124 |c_main_~#sum~0.base| (store .cse125 |c_main_~#sum~0.offset| (+ .cse119 .cse121 .cse122 .cse123))) c_main_~a~0.base) .cse6))) (let ((.cse114 (store .cse124 |c_main_~#sum~0.base| (store .cse125 |c_main_~#sum~0.offset| (+ .cse119 .cse120 .cse121 .cse122 .cse123))))) (store .cse114 c_main_~a~0.base (let ((.cse115 (let ((.cse116 (let ((.cse117 (let ((.cse118 (select .cse114 c_main_~a~0.base))) (store .cse118 c_main_~a~0.offset (+ .cse119 .cse120 .cse121 (select .cse118 c_main_~a~0.offset) .cse122 .cse123))))) (store .cse117 .cse8 (+ (select .cse117 .cse8) (select (select (store .cse114 c_main_~a~0.base .cse117) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|)))))) (store .cse116 .cse7 (+ (select (select (store .cse114 c_main_~a~0.base .cse116) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|) (select .cse116 .cse7)))))) (store .cse115 .cse6 (+ (select (select (store .cse114 c_main_~a~0.base .cse115) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|) (select .cse115 .cse6)))))))))))))) (let ((.cse110 (select .cse109 |c_main_~#sum~0.base|))) (let ((.cse111 (select (select (store .cse109 |c_main_~#sum~0.base| (store .cse110 |c_main_~#sum~0.offset| 0)) c_main_~a~0.base) c_main_~a~0.offset))) (let ((.cse113 (select (select (store .cse109 |c_main_~#sum~0.base| (store .cse110 |c_main_~#sum~0.offset| .cse111)) c_main_~a~0.base) .cse8))) (let ((.cse112 (select (select (store .cse109 |c_main_~#sum~0.base| (store .cse110 |c_main_~#sum~0.offset| (+ .cse111 .cse113))) c_main_~a~0.base) .cse7))) (+ (select (select (store .cse109 |c_main_~#sum~0.base| (store .cse110 |c_main_~#sum~0.offset| (+ .cse111 .cse112 .cse113))) c_main_~a~0.base) .cse6) .cse111 .cse112 .cse113)))))))) (= (let ((.cse129 (select (select (store .cse127 |c_main_~#sum~0.base| (store .cse128 |c_main_~#sum~0.offset| 0)) c_main_~a~0.base) c_main_~a~0.offset))) (let ((.cse130 (select (select (store .cse127 |c_main_~#sum~0.base| (store .cse128 |c_main_~#sum~0.offset| .cse129)) c_main_~a~0.base) .cse8))) (let ((.cse126 (select (select (store .cse127 |c_main_~#sum~0.base| (store .cse128 |c_main_~#sum~0.offset| (+ .cse129 .cse130))) c_main_~a~0.base) .cse7))) (+ .cse126 (select (select (store .cse127 |c_main_~#sum~0.base| (store .cse128 |c_main_~#sum~0.offset| (+ .cse126 .cse129 .cse130))) c_main_~a~0.base) .cse6) .cse129 .cse130)))) .cse0) (= 5 (select .cse131 .cse7)) (= (select .cse131 .cse8) 5) (= (select .cse131 c_main_~a~0.offset) 5) (= (let ((.cse134 (store |c_#memory_int| c_main_~a~0.base (store .cse137 .cse97 (+ (select .cse128 |c_main_~#sum~0.offset|) (select .cse137 .cse97)))))) (let ((.cse135 (select .cse134 |c_main_~#sum~0.base|))) (let ((.cse136 (select (select (store .cse134 |c_main_~#sum~0.base| (store .cse135 |c_main_~#sum~0.offset| 0)) c_main_~a~0.base) c_main_~a~0.offset))) (let ((.cse133 (select (select (store .cse134 |c_main_~#sum~0.base| (store .cse135 |c_main_~#sum~0.offset| .cse136)) c_main_~a~0.base) .cse8))) (let ((.cse132 (select (select (store .cse134 |c_main_~#sum~0.base| (store .cse135 |c_main_~#sum~0.offset| (+ .cse133 .cse136))) c_main_~a~0.base) .cse7))) (+ .cse132 .cse133 (select (select (store .cse134 |c_main_~#sum~0.base| (store .cse135 |c_main_~#sum~0.offset| (+ .cse132 .cse133 .cse136))) c_main_~a~0.base) .cse6) .cse136)))))) .cse0) (= 5 (select .cse131 .cse6)) (< 3 c_~N~0))))))))))))) is different from false [2022-01-31 12:14:54,346 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse138 (* c_main_~i~0 8))) (let ((.cse73 (select (select |c_#memory_int| |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|)) (.cse131 (select |c_#memory_int| c_main_~a~0.base)) (.cse140 (+ c_main_~a~0.offset .cse138))) (let ((.cse143 (store .cse131 .cse140 (+ .cse73 (select .cse131 .cse140))))) (let ((.cse70 (store |c_#memory_int| c_main_~a~0.base .cse143))) (let ((.cse71 (select .cse70 |c_main_~#sum~0.base|)) (.cse139 (+ c_main_~a~0.offset .cse138 8))) (let ((.cse141 (store .cse131 .cse139 (+ (select .cse131 .cse139) .cse73))) (.cse142 (store .cse143 .cse139 (+ (select .cse71 |c_main_~#sum~0.offset|) (select .cse143 .cse139))))) (let ((.cse74 (store |c_#memory_int| c_main_~a~0.base .cse142)) (.cse106 (store |c_#memory_int| c_main_~a~0.base .cse141))) (let ((.cse107 (select .cse106 |c_main_~#sum~0.base|)) (.cse48 (+ c_main_~a~0.offset 16 .cse138)) (.cse75 (select .cse74 |c_main_~#sum~0.base|))) (let ((.cse103 (store .cse142 .cse48 (+ (select .cse142 .cse48) (select .cse75 |c_main_~#sum~0.offset|)))) (.cse137 (store .cse141 .cse48 (+ (select .cse107 |c_main_~#sum~0.offset|) (select .cse141 .cse48))))) (let ((.cse127 (store |c_#memory_int| c_main_~a~0.base .cse137)) (.cse4 (store |c_#memory_int| c_main_~a~0.base .cse103)) (.cse66 (store (store .cse131 .cse140 1) .cse139 1))) (let ((.cse9 (not (< (+ c_main_~i~0 2) c_~N~0))) (.cse28 (store .cse66 .cse48 1)) (.cse5 (select .cse4 |c_main_~#sum~0.base|)) (.cse10 (< 4 c_~N~0)) (.cse67 (not (< (+ c_main_~i~0 1) c_~N~0))) (.cse47 (store .cse131 .cse139 1)) (.cse7 (+ c_main_~a~0.offset 16)) (.cse8 (+ c_main_~a~0.offset 8)) (.cse128 (select .cse127 |c_main_~#sum~0.base|)) (.cse97 (+ c_main_~a~0.offset .cse138 24)) (.cse0 (+ c_~N~0 (* c_~N~0 c_~N~0))) (.cse6 (+ c_main_~a~0.offset 24))) (and (= .cse0 (let ((.cse3 (select (select (store .cse4 |c_main_~#sum~0.base| (store .cse5 |c_main_~#sum~0.offset| 0)) c_main_~a~0.base) c_main_~a~0.offset))) (let ((.cse1 (select (select (store .cse4 |c_main_~#sum~0.base| (store .cse5 |c_main_~#sum~0.offset| .cse3)) c_main_~a~0.base) .cse8))) (let ((.cse2 (select (select (store .cse4 |c_main_~#sum~0.base| (store .cse5 |c_main_~#sum~0.offset| (+ .cse1 .cse3))) c_main_~a~0.base) .cse7))) (+ .cse1 .cse2 .cse3 (select (select (store .cse4 |c_main_~#sum~0.base| (store .cse5 |c_main_~#sum~0.offset| (+ .cse1 .cse2 .cse3))) c_main_~a~0.base) .cse6)))))) (or .cse9 .cse10 (= (let ((.cse14 (let ((.cse26 (store |c_#memory_int| c_main_~a~0.base .cse28))) (let ((.cse27 (select .cse26 |c_main_~#sum~0.base|))) (let ((.cse21 (select .cse27 |c_main_~#sum~0.offset|)) (.cse24 (select .cse28 c_main_~a~0.offset))) (let ((.cse25 (select (select (store .cse26 |c_main_~#sum~0.base| (store .cse27 |c_main_~#sum~0.offset| (+ .cse21 .cse24))) c_main_~a~0.base) .cse8))) (let ((.cse22 (select (select (store .cse26 |c_main_~#sum~0.base| (store .cse27 |c_main_~#sum~0.offset| (+ .cse21 .cse24 .cse25))) c_main_~a~0.base) .cse7))) (let ((.cse23 (select (select (store .cse26 |c_main_~#sum~0.base| (store .cse27 |c_main_~#sum~0.offset| (+ .cse21 .cse22 .cse24 .cse25))) c_main_~a~0.base) .cse6))) (let ((.cse16 (store .cse26 |c_main_~#sum~0.base| (store .cse27 |c_main_~#sum~0.offset| (+ .cse21 .cse22 .cse23 .cse24 .cse25))))) (store .cse16 c_main_~a~0.base (let ((.cse17 (let ((.cse18 (let ((.cse19 (let ((.cse20 (select .cse16 c_main_~a~0.base))) (store .cse20 c_main_~a~0.offset (+ .cse21 .cse22 .cse23 .cse24 .cse25 (select .cse20 c_main_~a~0.offset)))))) (store .cse19 .cse8 (+ (select .cse19 .cse8) (select (select (store .cse16 c_main_~a~0.base .cse19) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|)))))) (store .cse18 .cse7 (+ (select .cse18 .cse7) (select (select (store .cse16 c_main_~a~0.base .cse18) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|)))))) (store .cse17 .cse6 (+ (select .cse17 .cse6) (select (select (store .cse16 c_main_~a~0.base .cse17) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|)))))))))))))) (let ((.cse15 (select .cse14 |c_main_~#sum~0.base|))) (let ((.cse13 (select (select (store .cse14 |c_main_~#sum~0.base| (store .cse15 |c_main_~#sum~0.offset| 0)) c_main_~a~0.base) c_main_~a~0.offset))) (let ((.cse12 (select (select (store .cse14 |c_main_~#sum~0.base| (store .cse15 |c_main_~#sum~0.offset| .cse13)) c_main_~a~0.base) .cse8))) (let ((.cse11 (select (select (store .cse14 |c_main_~#sum~0.base| (store .cse15 |c_main_~#sum~0.offset| (+ .cse12 .cse13))) c_main_~a~0.base) .cse7))) (+ .cse11 .cse12 .cse13 (select (select (store .cse14 |c_main_~#sum~0.base| (store .cse15 |c_main_~#sum~0.offset| (+ .cse11 .cse12 .cse13))) c_main_~a~0.base) .cse6))))))) .cse0)) (or (= (let ((.cse31 (let ((.cse46 (store .cse47 .cse48 1))) (let ((.cse44 (store |c_#memory_int| c_main_~a~0.base .cse46))) (let ((.cse45 (select .cse44 |c_main_~#sum~0.base|))) (let ((.cse40 (select .cse46 c_main_~a~0.offset)) (.cse42 (select .cse45 |c_main_~#sum~0.offset|))) (let ((.cse43 (select (select (store .cse44 |c_main_~#sum~0.base| (store .cse45 |c_main_~#sum~0.offset| (+ .cse40 .cse42))) c_main_~a~0.base) .cse8))) (let ((.cse39 (select (select (store .cse44 |c_main_~#sum~0.base| (store .cse45 |c_main_~#sum~0.offset| (+ .cse40 .cse42 .cse43))) c_main_~a~0.base) .cse7))) (let ((.cse41 (select (select (store .cse44 |c_main_~#sum~0.base| (store .cse45 |c_main_~#sum~0.offset| (+ .cse39 .cse40 .cse42 .cse43))) c_main_~a~0.base) .cse6))) (let ((.cse34 (store .cse44 |c_main_~#sum~0.base| (store .cse45 |c_main_~#sum~0.offset| (+ .cse39 .cse40 .cse41 .cse42 .cse43))))) (store .cse34 c_main_~a~0.base (let ((.cse35 (let ((.cse36 (let ((.cse37 (let ((.cse38 (select .cse34 c_main_~a~0.base))) (store .cse38 c_main_~a~0.offset (+ .cse39 (select .cse38 c_main_~a~0.offset) .cse40 .cse41 .cse42 .cse43))))) (store .cse37 .cse8 (+ (select .cse37 .cse8) (select (select (store .cse34 c_main_~a~0.base .cse37) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|)))))) (store .cse36 .cse7 (+ (select (select (store .cse34 c_main_~a~0.base .cse36) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|) (select .cse36 .cse7)))))) (store .cse35 .cse6 (+ (select .cse35 .cse6) (select (select (store .cse34 c_main_~a~0.base .cse35) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|))))))))))))))) (let ((.cse32 (select .cse31 |c_main_~#sum~0.base|))) (let ((.cse29 (select (select (store .cse31 |c_main_~#sum~0.base| (store .cse32 |c_main_~#sum~0.offset| 0)) c_main_~a~0.base) c_main_~a~0.offset))) (let ((.cse30 (select (select (store .cse31 |c_main_~#sum~0.base| (store .cse32 |c_main_~#sum~0.offset| .cse29)) c_main_~a~0.base) .cse8))) (let ((.cse33 (select (select (store .cse31 |c_main_~#sum~0.base| (store .cse32 |c_main_~#sum~0.offset| (+ .cse29 .cse30))) c_main_~a~0.base) .cse7))) (+ .cse29 .cse30 (select (select (store .cse31 |c_main_~#sum~0.base| (store .cse32 |c_main_~#sum~0.offset| (+ .cse29 .cse30 .cse33))) c_main_~a~0.base) .cse6) .cse33)))))) .cse0) .cse9 .cse10) (<= c_~N~0 4) (or (= .cse0 (let ((.cse52 (let ((.cse64 (store |c_#memory_int| c_main_~a~0.base .cse66))) (let ((.cse65 (select .cse64 |c_main_~#sum~0.base|))) (let ((.cse59 (select .cse65 |c_main_~#sum~0.offset|)) (.cse60 (select .cse66 c_main_~a~0.offset))) (let ((.cse63 (select (select (store .cse64 |c_main_~#sum~0.base| (store .cse65 |c_main_~#sum~0.offset| (+ .cse59 .cse60))) c_main_~a~0.base) .cse8))) (let ((.cse61 (select (select (store .cse64 |c_main_~#sum~0.base| (store .cse65 |c_main_~#sum~0.offset| (+ .cse59 .cse60 .cse63))) c_main_~a~0.base) .cse7))) (let ((.cse62 (select (select (store .cse64 |c_main_~#sum~0.base| (store .cse65 |c_main_~#sum~0.offset| (+ .cse59 .cse60 .cse61 .cse63))) c_main_~a~0.base) .cse6))) (let ((.cse54 (store .cse64 |c_main_~#sum~0.base| (store .cse65 |c_main_~#sum~0.offset| (+ .cse59 .cse60 .cse61 .cse62 .cse63))))) (store .cse54 c_main_~a~0.base (let ((.cse55 (let ((.cse56 (let ((.cse57 (let ((.cse58 (select .cse54 c_main_~a~0.base))) (store .cse58 c_main_~a~0.offset (+ .cse59 .cse60 .cse61 (select .cse58 c_main_~a~0.offset) .cse62 .cse63))))) (store .cse57 .cse8 (+ (select (select (store .cse54 c_main_~a~0.base .cse57) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|) (select .cse57 .cse8)))))) (store .cse56 .cse7 (+ (select (select (store .cse54 c_main_~a~0.base .cse56) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|) (select .cse56 .cse7)))))) (store .cse55 .cse6 (+ (select .cse55 .cse6) (select (select (store .cse54 c_main_~a~0.base .cse55) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|)))))))))))))) (let ((.cse53 (select .cse52 |c_main_~#sum~0.base|))) (let ((.cse50 (select (select (store .cse52 |c_main_~#sum~0.base| (store .cse53 |c_main_~#sum~0.offset| 0)) c_main_~a~0.base) c_main_~a~0.offset))) (let ((.cse49 (select (select (store .cse52 |c_main_~#sum~0.base| (store .cse53 |c_main_~#sum~0.offset| .cse50)) c_main_~a~0.base) .cse8))) (let ((.cse51 (select (select (store .cse52 |c_main_~#sum~0.base| (store .cse53 |c_main_~#sum~0.offset| (+ .cse49 .cse50))) c_main_~a~0.base) .cse7))) (+ .cse49 .cse50 .cse51 (select (select (store .cse52 |c_main_~#sum~0.base| (store .cse53 |c_main_~#sum~0.offset| (+ .cse49 .cse50 .cse51))) c_main_~a~0.base) .cse6)))))))) .cse10 .cse67) (= .cse0 (let ((.cse68 (select (select (store .cse70 |c_main_~#sum~0.base| (store .cse71 |c_main_~#sum~0.offset| 0)) c_main_~a~0.base) c_main_~a~0.offset))) (let ((.cse72 (select (select (store .cse70 |c_main_~#sum~0.base| (store .cse71 |c_main_~#sum~0.offset| .cse68)) c_main_~a~0.base) .cse8))) (let ((.cse69 (select (select (store .cse70 |c_main_~#sum~0.base| (store .cse71 |c_main_~#sum~0.offset| (+ .cse68 .cse72))) c_main_~a~0.base) .cse7))) (+ .cse68 .cse69 (select (select (store .cse70 |c_main_~#sum~0.base| (store .cse71 |c_main_~#sum~0.offset| (+ .cse68 .cse69 .cse72))) c_main_~a~0.base) .cse6) .cse72))))) (= .cse73 4) (= .cse0 (let ((.cse77 (select (select (store .cse74 |c_main_~#sum~0.base| (store .cse75 |c_main_~#sum~0.offset| 0)) c_main_~a~0.base) c_main_~a~0.offset))) (let ((.cse76 (select (select (store .cse74 |c_main_~#sum~0.base| (store .cse75 |c_main_~#sum~0.offset| .cse77)) c_main_~a~0.base) .cse8))) (let ((.cse78 (select (select (store .cse74 |c_main_~#sum~0.base| (store .cse75 |c_main_~#sum~0.offset| (+ .cse76 .cse77))) c_main_~a~0.base) .cse7))) (+ (select (select (store .cse74 |c_main_~#sum~0.base| (store .cse75 |c_main_~#sum~0.offset| (+ .cse76 .cse77 .cse78))) c_main_~a~0.base) .cse6) .cse76 .cse77 .cse78))))) (or (= .cse0 (let ((.cse82 (let ((.cse96 (store .cse28 .cse97 1))) (let ((.cse94 (store |c_#memory_int| c_main_~a~0.base .cse96))) (let ((.cse95 (select .cse94 |c_main_~#sum~0.base|))) (let ((.cse90 (select .cse95 |c_main_~#sum~0.offset|)) (.cse92 (select .cse96 c_main_~a~0.offset))) (let ((.cse93 (select (select (store .cse94 |c_main_~#sum~0.base| (store .cse95 |c_main_~#sum~0.offset| (+ .cse90 .cse92))) c_main_~a~0.base) .cse8))) (let ((.cse91 (select (select (store .cse94 |c_main_~#sum~0.base| (store .cse95 |c_main_~#sum~0.offset| (+ .cse90 .cse92 .cse93))) c_main_~a~0.base) .cse7))) (let ((.cse89 (select (select (store .cse94 |c_main_~#sum~0.base| (store .cse95 |c_main_~#sum~0.offset| (+ .cse90 .cse91 .cse92 .cse93))) c_main_~a~0.base) .cse6))) (let ((.cse84 (store .cse94 |c_main_~#sum~0.base| (store .cse95 |c_main_~#sum~0.offset| (+ .cse89 .cse90 .cse91 .cse92 .cse93))))) (store .cse84 c_main_~a~0.base (let ((.cse85 (let ((.cse86 (let ((.cse87 (let ((.cse88 (select .cse84 c_main_~a~0.base))) (store .cse88 c_main_~a~0.offset (+ .cse89 .cse90 .cse91 .cse92 .cse93 (select .cse88 c_main_~a~0.offset)))))) (store .cse87 .cse8 (+ (select .cse87 .cse8) (select (select (store .cse84 c_main_~a~0.base .cse87) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|)))))) (store .cse86 .cse7 (+ (select .cse86 .cse7) (select (select (store .cse84 c_main_~a~0.base .cse86) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|)))))) (store .cse85 .cse6 (+ (select .cse85 .cse6) (select (select (store .cse84 c_main_~a~0.base .cse85) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|))))))))))))))) (let ((.cse83 (select .cse82 |c_main_~#sum~0.base|))) (let ((.cse81 (select (select (store .cse82 |c_main_~#sum~0.base| (store .cse83 |c_main_~#sum~0.offset| 0)) c_main_~a~0.base) c_main_~a~0.offset))) (let ((.cse80 (select (select (store .cse82 |c_main_~#sum~0.base| (store .cse83 |c_main_~#sum~0.offset| .cse81)) c_main_~a~0.base) .cse8))) (let ((.cse79 (select (select (store .cse82 |c_main_~#sum~0.base| (store .cse83 |c_main_~#sum~0.offset| (+ .cse80 .cse81))) c_main_~a~0.base) .cse7))) (+ .cse79 .cse80 .cse81 (select (select (store .cse82 |c_main_~#sum~0.base| (store .cse83 |c_main_~#sum~0.offset| (+ .cse79 .cse80 .cse81))) c_main_~a~0.base) .cse6)))))))) .cse10 (not (< (+ c_main_~i~0 3) c_~N~0))) (< (+ c_main_~a~0.base 1) |c_main_~#sum~0.base|) (= c_main_~a~0.offset 0) (= .cse0 (let ((.cse101 (store |c_#memory_int| c_main_~a~0.base (store .cse103 .cse97 (+ (select .cse103 .cse97) (select .cse5 |c_main_~#sum~0.offset|)))))) (let ((.cse102 (select .cse101 |c_main_~#sum~0.base|))) (let ((.cse99 (select (select (store .cse101 |c_main_~#sum~0.base| (store .cse102 |c_main_~#sum~0.offset| 0)) c_main_~a~0.base) c_main_~a~0.offset))) (let ((.cse98 (select (select (store .cse101 |c_main_~#sum~0.base| (store .cse102 |c_main_~#sum~0.offset| .cse99)) c_main_~a~0.base) .cse8))) (let ((.cse100 (select (select (store .cse101 |c_main_~#sum~0.base| (store .cse102 |c_main_~#sum~0.offset| (+ .cse98 .cse99))) c_main_~a~0.base) .cse7))) (+ .cse98 .cse99 .cse100 (select (select (store .cse101 |c_main_~#sum~0.base| (store .cse102 |c_main_~#sum~0.offset| (+ .cse98 .cse99 .cse100))) c_main_~a~0.base) .cse6)))))))) (= .cse0 (let ((.cse108 (select (select (store .cse106 |c_main_~#sum~0.base| (store .cse107 |c_main_~#sum~0.offset| 0)) c_main_~a~0.base) c_main_~a~0.offset))) (let ((.cse105 (select (select (store .cse106 |c_main_~#sum~0.base| (store .cse107 |c_main_~#sum~0.offset| .cse108)) c_main_~a~0.base) .cse8))) (let ((.cse104 (select (select (store .cse106 |c_main_~#sum~0.base| (store .cse107 |c_main_~#sum~0.offset| (+ .cse105 .cse108))) c_main_~a~0.base) .cse7))) (+ .cse104 .cse105 (select (select (store .cse106 |c_main_~#sum~0.base| (store .cse107 |c_main_~#sum~0.offset| (+ .cse104 .cse105 .cse108))) c_main_~a~0.base) .cse6) .cse108))))) (or .cse10 .cse67 (= .cse0 (let ((.cse109 (let ((.cse124 (store |c_#memory_int| c_main_~a~0.base .cse47))) (let ((.cse125 (select .cse124 |c_main_~#sum~0.base|))) (let ((.cse119 (select .cse47 c_main_~a~0.offset)) (.cse121 (select .cse125 |c_main_~#sum~0.offset|))) (let ((.cse123 (select (select (store .cse124 |c_main_~#sum~0.base| (store .cse125 |c_main_~#sum~0.offset| (+ .cse119 .cse121))) c_main_~a~0.base) .cse8))) (let ((.cse122 (select (select (store .cse124 |c_main_~#sum~0.base| (store .cse125 |c_main_~#sum~0.offset| (+ .cse119 .cse121 .cse123))) c_main_~a~0.base) .cse7))) (let ((.cse120 (select (select (store .cse124 |c_main_~#sum~0.base| (store .cse125 |c_main_~#sum~0.offset| (+ .cse119 .cse121 .cse122 .cse123))) c_main_~a~0.base) .cse6))) (let ((.cse114 (store .cse124 |c_main_~#sum~0.base| (store .cse125 |c_main_~#sum~0.offset| (+ .cse119 .cse120 .cse121 .cse122 .cse123))))) (store .cse114 c_main_~a~0.base (let ((.cse115 (let ((.cse116 (let ((.cse117 (let ((.cse118 (select .cse114 c_main_~a~0.base))) (store .cse118 c_main_~a~0.offset (+ .cse119 .cse120 .cse121 (select .cse118 c_main_~a~0.offset) .cse122 .cse123))))) (store .cse117 .cse8 (+ (select .cse117 .cse8) (select (select (store .cse114 c_main_~a~0.base .cse117) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|)))))) (store .cse116 .cse7 (+ (select (select (store .cse114 c_main_~a~0.base .cse116) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|) (select .cse116 .cse7)))))) (store .cse115 .cse6 (+ (select (select (store .cse114 c_main_~a~0.base .cse115) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|) (select .cse115 .cse6)))))))))))))) (let ((.cse110 (select .cse109 |c_main_~#sum~0.base|))) (let ((.cse111 (select (select (store .cse109 |c_main_~#sum~0.base| (store .cse110 |c_main_~#sum~0.offset| 0)) c_main_~a~0.base) c_main_~a~0.offset))) (let ((.cse113 (select (select (store .cse109 |c_main_~#sum~0.base| (store .cse110 |c_main_~#sum~0.offset| .cse111)) c_main_~a~0.base) .cse8))) (let ((.cse112 (select (select (store .cse109 |c_main_~#sum~0.base| (store .cse110 |c_main_~#sum~0.offset| (+ .cse111 .cse113))) c_main_~a~0.base) .cse7))) (+ (select (select (store .cse109 |c_main_~#sum~0.base| (store .cse110 |c_main_~#sum~0.offset| (+ .cse111 .cse112 .cse113))) c_main_~a~0.base) .cse6) .cse111 .cse112 .cse113)))))))) (= (let ((.cse129 (select (select (store .cse127 |c_main_~#sum~0.base| (store .cse128 |c_main_~#sum~0.offset| 0)) c_main_~a~0.base) c_main_~a~0.offset))) (let ((.cse130 (select (select (store .cse127 |c_main_~#sum~0.base| (store .cse128 |c_main_~#sum~0.offset| .cse129)) c_main_~a~0.base) .cse8))) (let ((.cse126 (select (select (store .cse127 |c_main_~#sum~0.base| (store .cse128 |c_main_~#sum~0.offset| (+ .cse129 .cse130))) c_main_~a~0.base) .cse7))) (+ .cse126 (select (select (store .cse127 |c_main_~#sum~0.base| (store .cse128 |c_main_~#sum~0.offset| (+ .cse126 .cse129 .cse130))) c_main_~a~0.base) .cse6) .cse129 .cse130)))) .cse0) (= 5 (select .cse131 .cse7)) (= (select .cse131 .cse8) 5) (= (select .cse131 c_main_~a~0.offset) 5) (= (let ((.cse134 (store |c_#memory_int| c_main_~a~0.base (store .cse137 .cse97 (+ (select .cse128 |c_main_~#sum~0.offset|) (select .cse137 .cse97)))))) (let ((.cse135 (select .cse134 |c_main_~#sum~0.base|))) (let ((.cse136 (select (select (store .cse134 |c_main_~#sum~0.base| (store .cse135 |c_main_~#sum~0.offset| 0)) c_main_~a~0.base) c_main_~a~0.offset))) (let ((.cse133 (select (select (store .cse134 |c_main_~#sum~0.base| (store .cse135 |c_main_~#sum~0.offset| .cse136)) c_main_~a~0.base) .cse8))) (let ((.cse132 (select (select (store .cse134 |c_main_~#sum~0.base| (store .cse135 |c_main_~#sum~0.offset| (+ .cse133 .cse136))) c_main_~a~0.base) .cse7))) (+ .cse132 .cse133 (select (select (store .cse134 |c_main_~#sum~0.base| (store .cse135 |c_main_~#sum~0.offset| (+ .cse132 .cse133 .cse136))) c_main_~a~0.base) .cse6) .cse136)))))) .cse0) (= 5 (select .cse131 .cse6)) (< 3 c_~N~0))))))))))))) is different from true [2022-01-31 12:14:56,582 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2022-01-31 12:14:59,881 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2022-01-31 12:15:02,100 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers []