./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-fpi/modn.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 791161d1 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/array-fpi/modn.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b1b107a3e17c36933ddc5a5cff6ab95f9f0d71df794eec32ec4a28d109efd829 --- Real Ultimate output --- This is Ultimate 0.2.2-?-791161d [2022-07-22 10:46:03,545 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-22 10:46:03,546 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-22 10:46:03,574 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-22 10:46:03,574 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-22 10:46:03,575 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-22 10:46:03,577 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-22 10:46:03,578 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-22 10:46:03,579 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-22 10:46:03,580 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-22 10:46:03,581 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-22 10:46:03,582 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-22 10:46:03,582 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-22 10:46:03,583 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-22 10:46:03,584 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-22 10:46:03,585 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-22 10:46:03,586 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-22 10:46:03,586 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-22 10:46:03,588 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-22 10:46:03,589 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-22 10:46:03,590 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-22 10:46:03,591 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-22 10:46:03,595 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-22 10:46:03,596 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-22 10:46:03,597 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-22 10:46:03,603 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-22 10:46:03,606 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-22 10:46:03,606 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-22 10:46:03,607 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-22 10:46:03,607 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-22 10:46:03,608 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-22 10:46:03,608 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-22 10:46:03,609 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-22 10:46:03,609 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-22 10:46:03,610 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-22 10:46:03,610 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-22 10:46:03,611 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-22 10:46:03,611 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-22 10:46:03,611 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-22 10:46:03,611 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-22 10:46:03,612 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-22 10:46:03,613 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-22 10:46:03,614 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-22 10:46:03,640 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-22 10:46:03,640 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-22 10:46:03,640 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-22 10:46:03,641 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-22 10:46:03,641 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-22 10:46:03,641 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-22 10:46:03,642 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-22 10:46:03,642 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-22 10:46:03,642 INFO L138 SettingsManager]: * Use SBE=true [2022-07-22 10:46:03,643 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-22 10:46:03,643 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-22 10:46:03,644 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-22 10:46:03,644 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-22 10:46:03,644 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-22 10:46:03,644 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-22 10:46:03,644 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-22 10:46:03,645 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-22 10:46:03,645 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-22 10:46:03,645 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-22 10:46:03,646 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-22 10:46:03,646 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-22 10:46:03,646 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-22 10:46:03,647 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-22 10:46:03,647 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-22 10:46:03,647 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-22 10:46:03,647 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-22 10:46:03,648 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-22 10:46:03,648 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-22 10:46:03,648 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-22 10:46:03,648 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-22 10:46:03,648 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-22 10:46:03,649 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-22 10:46:03,649 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-22 10:46:03,649 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b1b107a3e17c36933ddc5a5cff6ab95f9f0d71df794eec32ec4a28d109efd829 [2022-07-22 10:46:03,862 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-22 10:46:03,886 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-22 10:46:03,888 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-22 10:46:03,889 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-22 10:46:03,890 INFO L275 PluginConnector]: CDTParser initialized [2022-07-22 10:46:03,891 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-fpi/modn.c [2022-07-22 10:46:03,952 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9dd93824f/ceced845b3c342c7beb7508d8b855281/FLAGd10193867 [2022-07-22 10:46:04,340 INFO L306 CDTParser]: Found 1 translation units. [2022-07-22 10:46:04,340 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/modn.c [2022-07-22 10:46:04,346 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9dd93824f/ceced845b3c342c7beb7508d8b855281/FLAGd10193867 [2022-07-22 10:46:04,749 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9dd93824f/ceced845b3c342c7beb7508d8b855281 [2022-07-22 10:46:04,751 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-22 10:46:04,752 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-22 10:46:04,755 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-22 10:46:04,755 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-22 10:46:04,758 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-22 10:46:04,759 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 10:46:04" (1/1) ... [2022-07-22 10:46:04,760 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7bec4293 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:46:04, skipping insertion in model container [2022-07-22 10:46:04,760 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 10:46:04" (1/1) ... [2022-07-22 10:46:04,766 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-22 10:46:04,777 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-22 10:46:04,893 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/modn.c[587,600] [2022-07-22 10:46:04,917 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 10:46:04,927 INFO L203 MainTranslator]: Completed pre-run [2022-07-22 10:46:04,936 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/modn.c[587,600] [2022-07-22 10:46:04,942 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 10:46:04,959 INFO L208 MainTranslator]: Completed translation [2022-07-22 10:46:04,960 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:46:04 WrapperNode [2022-07-22 10:46:04,960 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-22 10:46:04,961 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-22 10:46:04,961 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-22 10:46:04,961 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-22 10:46:04,966 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:46:04" (1/1) ... [2022-07-22 10:46:04,971 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:46:04" (1/1) ... [2022-07-22 10:46:04,986 INFO L137 Inliner]: procedures = 17, calls = 26, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 78 [2022-07-22 10:46:04,987 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-22 10:46:04,987 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-22 10:46:04,988 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-22 10:46:04,988 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-22 10:46:04,994 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:46:04" (1/1) ... [2022-07-22 10:46:04,995 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:46:04" (1/1) ... [2022-07-22 10:46:04,996 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:46:04" (1/1) ... [2022-07-22 10:46:04,997 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:46:04" (1/1) ... [2022-07-22 10:46:05,001 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:46:04" (1/1) ... [2022-07-22 10:46:05,007 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:46:04" (1/1) ... [2022-07-22 10:46:05,008 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:46:04" (1/1) ... [2022-07-22 10:46:05,009 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-22 10:46:05,010 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-22 10:46:05,010 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-22 10:46:05,010 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-22 10:46:05,015 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:46:04" (1/1) ... [2022-07-22 10:46:05,021 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-22 10:46:05,029 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 10:46:05,044 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-07-22 10:46:05,047 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-07-22 10:46:05,071 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-22 10:46:05,071 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-22 10:46:05,072 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-22 10:46:05,072 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-22 10:46:05,072 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-22 10:46:05,072 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-22 10:46:05,075 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-22 10:46:05,075 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-22 10:46:05,076 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-22 10:46:05,126 INFO L234 CfgBuilder]: Building ICFG [2022-07-22 10:46:05,127 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-22 10:46:05,227 INFO L275 CfgBuilder]: Performing block encoding [2022-07-22 10:46:05,232 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-22 10:46:05,232 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-07-22 10:46:05,234 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 10:46:05 BoogieIcfgContainer [2022-07-22 10:46:05,234 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-22 10:46:05,235 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-22 10:46:05,236 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-22 10:46:05,238 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-22 10:46:05,239 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.07 10:46:04" (1/3) ... [2022-07-22 10:46:05,239 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4973b36a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 10:46:05, skipping insertion in model container [2022-07-22 10:46:05,239 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:46:04" (2/3) ... [2022-07-22 10:46:05,240 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4973b36a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 10:46:05, skipping insertion in model container [2022-07-22 10:46:05,240 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 10:46:05" (3/3) ... [2022-07-22 10:46:05,241 INFO L111 eAbstractionObserver]: Analyzing ICFG modn.c [2022-07-22 10:46:05,252 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-22 10:46:05,253 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-22 10:46:05,290 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-22 10:46:05,296 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@3c2ea8cb, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@2893f0b8 [2022-07-22 10:46:05,296 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-22 10:46:05,300 INFO L276 IsEmpty]: Start isEmpty. Operand has 21 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 20 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:46:05,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-07-22 10:46:05,305 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 10:46:05,306 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 10:46:05,306 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 10:46:05,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 10:46:05,316 INFO L85 PathProgramCache]: Analyzing trace with hash -1828546148, now seen corresponding path program 1 times [2022-07-22 10:46:05,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 10:46:05,324 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957899783] [2022-07-22 10:46:05,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 10:46:05,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 10:46:05,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 10:46:05,502 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 10:46:05,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 10:46:05,503 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957899783] [2022-07-22 10:46:05,503 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [957899783] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 10:46:05,503 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 10:46:05,504 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-22 10:46:05,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056424973] [2022-07-22 10:46:05,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 10:46:05,511 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-22 10:46:05,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 10:46:05,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-22 10:46:05,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-22 10:46:05,543 INFO L87 Difference]: Start difference. First operand has 21 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 20 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:46:05,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 10:46:05,557 INFO L93 Difference]: Finished difference Result 38 states and 52 transitions. [2022-07-22 10:46:05,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-22 10:46:05,559 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-07-22 10:46:05,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 10:46:05,565 INFO L225 Difference]: With dead ends: 38 [2022-07-22 10:46:05,565 INFO L226 Difference]: Without dead ends: 17 [2022-07-22 10:46:05,568 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-22 10:46:05,572 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 10:46:05,573 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 10:46:05,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-07-22 10:46:05,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-07-22 10:46:05,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.1875) internal successors, (19), 16 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:46:05,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2022-07-22 10:46:05,601 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 12 [2022-07-22 10:46:05,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 10:46:05,602 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2022-07-22 10:46:05,602 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:46:05,603 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-07-22 10:46:05,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-07-22 10:46:05,603 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 10:46:05,603 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 10:46:05,604 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-22 10:46:05,604 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 10:46:05,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 10:46:05,605 INFO L85 PathProgramCache]: Analyzing trace with hash -1148487778, now seen corresponding path program 1 times [2022-07-22 10:46:05,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 10:46:05,606 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890286321] [2022-07-22 10:46:05,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 10:46:05,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 10:46:05,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 10:46:05,736 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 10:46:05,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 10:46:05,737 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890286321] [2022-07-22 10:46:05,737 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [890286321] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 10:46:05,737 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 10:46:05,737 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 10:46:05,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637181656] [2022-07-22 10:46:05,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 10:46:05,739 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-22 10:46:05,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 10:46:05,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 10:46:05,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-22 10:46:05,740 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:46:05,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 10:46:05,829 INFO L93 Difference]: Finished difference Result 37 states and 42 transitions. [2022-07-22 10:46:05,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 10:46:05,830 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-07-22 10:46:05,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 10:46:05,831 INFO L225 Difference]: With dead ends: 37 [2022-07-22 10:46:05,831 INFO L226 Difference]: Without dead ends: 27 [2022-07-22 10:46:05,831 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-22 10:46:05,833 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 20 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 10:46:05,833 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 15 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 10:46:05,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-07-22 10:46:05,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 19. [2022-07-22 10:46:05,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:46:05,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2022-07-22 10:46:05,849 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 12 [2022-07-22 10:46:05,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 10:46:05,850 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2022-07-22 10:46:05,850 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:46:05,850 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2022-07-22 10:46:05,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-22 10:46:05,851 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 10:46:05,851 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 10:46:05,851 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-22 10:46:05,852 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 10:46:05,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 10:46:05,852 INFO L85 PathProgramCache]: Analyzing trace with hash 586911962, now seen corresponding path program 1 times [2022-07-22 10:46:05,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 10:46:05,853 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562554532] [2022-07-22 10:46:05,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 10:46:05,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 10:46:05,875 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-22 10:46:05,876 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1062509236] [2022-07-22 10:46:05,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 10:46:05,876 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 10:46:05,877 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 10:46:05,880 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-07-22 10:46:05,882 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-07-22 10:46:05,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 10:46:05,985 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 25 conjunts are in the unsatisfiable core [2022-07-22 10:46:05,992 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 10:46:06,115 INFO L390 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-07-22 10:46:06,150 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 28 treesize of output 16 [2022-07-22 10:46:06,282 INFO L356 Elim1Store]: treesize reduction 19, result has 44.1 percent of original size [2022-07-22 10:46:06,283 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 28 [2022-07-22 10:46:06,486 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 22 [2022-07-22 10:46:06,520 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 10:46:06,520 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 10:46:08,710 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (< c_~N~0 0)) (.cse5 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse0 (= (mod .cse5 c_~N~0) 0)) (.cse1 (< .cse5 0)) (.cse4 (not .cse3))) (and (or (and (not .cse0) .cse1) (let ((.cse2 (forall ((|ULTIMATE.start_main_~a~0#1.base| Int)) (= (select (store (select |c_#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) (mod (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0)) |c_ULTIMATE.start_main_~a~0#1.offset|) 0)))) (and (or .cse2 .cse3) (or .cse4 .cse2)))) (or .cse0 (not .cse1) (and (or (forall ((|ULTIMATE.start_main_~a~0#1.base| Int)) (= (select (store (select |c_#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ (mod (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0) (* (- 1) c_~N~0))) |c_ULTIMATE.start_main_~a~0#1.offset|) 0)) .cse3) (or (forall ((|ULTIMATE.start_main_~a~0#1.base| Int)) (= (select (store (select |c_#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ c_~N~0 (mod (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0))) |c_ULTIMATE.start_main_~a~0#1.offset|) 0)) .cse4)))))) is different from false [2022-07-22 10:46:14,933 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-07-22 10:46:14,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 10:46:14,933 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562554532] [2022-07-22 10:46:14,933 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-22 10:46:14,933 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1062509236] [2022-07-22 10:46:14,934 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1062509236] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 10:46:14,934 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-22 10:46:14,934 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2022-07-22 10:46:14,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015047544] [2022-07-22 10:46:14,934 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-22 10:46:14,935 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-07-22 10:46:14,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 10:46:14,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-07-22 10:46:14,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=233, Unknown=3, NotChecked=32, Total=342 [2022-07-22 10:46:14,936 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. Second operand has 19 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 19 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:46:16,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 10:46:16,065 INFO L93 Difference]: Finished difference Result 36 states and 40 transitions. [2022-07-22 10:46:16,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-22 10:46:16,066 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 19 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-07-22 10:46:16,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 10:46:16,066 INFO L225 Difference]: With dead ends: 36 [2022-07-22 10:46:16,066 INFO L226 Difference]: Without dead ends: 34 [2022-07-22 10:46:16,068 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 8.9s TimeCoverageRelationStatistics Valid=135, Invalid=372, Unknown=3, NotChecked=42, Total=552 [2022-07-22 10:46:16,069 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 12 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 58 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-22 10:46:16,069 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 69 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 79 Invalid, 0 Unknown, 58 Unchecked, 0.5s Time] [2022-07-22 10:46:16,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-07-22 10:46:16,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 28. [2022-07-22 10:46:16,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 27 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:46:16,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2022-07-22 10:46:16,075 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 16 [2022-07-22 10:46:16,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 10:46:16,075 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2022-07-22 10:46:16,075 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 19 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:46:16,076 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2022-07-22 10:46:16,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-22 10:46:16,076 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 10:46:16,077 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 10:46:16,103 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-07-22 10:46:16,291 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 10:46:16,292 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 10:46:16,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 10:46:16,292 INFO L85 PathProgramCache]: Analyzing trace with hash -1267903976, now seen corresponding path program 2 times [2022-07-22 10:46:16,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 10:46:16,293 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031389179] [2022-07-22 10:46:16,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 10:46:16,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 10:46:16,311 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-22 10:46:16,319 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [882640381] [2022-07-22 10:46:16,319 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-22 10:46:16,319 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 10:46:16,319 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 10:46:16,321 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 10:46:16,339 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-07-22 10:46:16,374 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-22 10:46:16,375 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 10:46:16,376 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-22 10:46:16,377 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 10:46:16,685 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 10:46:16,685 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 10:46:16,866 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 10:46:16,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 10:46:16,866 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031389179] [2022-07-22 10:46:16,866 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-22 10:46:16,866 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [882640381] [2022-07-22 10:46:16,866 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [882640381] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 10:46:16,867 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-22 10:46:16,867 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2022-07-22 10:46:16,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705712983] [2022-07-22 10:46:16,867 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-22 10:46:16,867 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-22 10:46:16,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 10:46:16,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-22 10:46:16,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-07-22 10:46:16,868 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:46:17,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 10:46:17,418 INFO L93 Difference]: Finished difference Result 61 states and 67 transitions. [2022-07-22 10:46:17,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-22 10:46:17,419 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-07-22 10:46:17,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 10:46:17,419 INFO L225 Difference]: With dead ends: 61 [2022-07-22 10:46:17,419 INFO L226 Difference]: Without dead ends: 42 [2022-07-22 10:46:17,420 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2022-07-22 10:46:17,421 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 46 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-22 10:46:17,421 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 45 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-22 10:46:17,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-07-22 10:46:17,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 26. [2022-07-22 10:46:17,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.16) internal successors, (29), 25 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:46:17,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2022-07-22 10:46:17,427 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 18 [2022-07-22 10:46:17,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 10:46:17,427 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2022-07-22 10:46:17,427 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:46:17,427 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2022-07-22 10:46:17,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-22 10:46:17,428 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 10:46:17,428 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 10:46:17,448 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-07-22 10:46:17,628 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-07-22 10:46:17,629 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 10:46:17,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 10:46:17,630 INFO L85 PathProgramCache]: Analyzing trace with hash -1174519208, now seen corresponding path program 3 times [2022-07-22 10:46:17,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 10:46:17,630 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435926989] [2022-07-22 10:46:17,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 10:46:17,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 10:46:17,646 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-22 10:46:17,649 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1421788617] [2022-07-22 10:46:17,650 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-22 10:46:17,650 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 10:46:17,650 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 10:46:17,651 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-07-22 10:46:17,657 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-07-22 10:46:17,699 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-07-22 10:46:17,699 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 10:46:17,700 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 18 conjunts are in the unsatisfiable core [2022-07-22 10:46:17,702 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 10:46:18,174 INFO L356 Elim1Store]: treesize reduction 21, result has 47.5 percent of original size [2022-07-22 10:46:18,175 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 104 treesize of output 83 [2022-07-22 10:46:19,308 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 22 [2022-07-22 10:46:19,410 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-22 10:46:19,410 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 10:46:19,914 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 10:46:19,915 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 189 treesize of output 167 [2022-07-22 10:46:20,406 INFO L390 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 34 treesize of output 28 [2022-07-22 10:46:20,420 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30 [2022-07-22 10:46:20,512 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 26 [2022-07-22 10:46:20,525 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 28 [2022-07-22 10:46:20,619 INFO L390 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 25 treesize of output 21 [2022-07-22 10:46:20,632 INFO L390 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 28 treesize of output 26 [2022-07-22 10:46:20,678 INFO L390 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 25 treesize of output 21 [2022-07-22 10:46:20,689 INFO L390 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 28 treesize of output 26 [2022-07-22 10:46:20,731 INFO L390 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 22 treesize of output 18 [2022-07-22 10:46:20,745 INFO L390 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 28 treesize of output 26 [2022-07-22 10:46:20,799 INFO L390 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 22 treesize of output 18 [2022-07-22 10:46:20,819 INFO L390 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 28 treesize of output 26 [2022-07-22 10:46:22,145 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-22 10:46:22,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 10:46:22,146 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435926989] [2022-07-22 10:46:22,146 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-22 10:46:22,146 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1421788617] [2022-07-22 10:46:22,146 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1421788617] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 10:46:22,146 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-22 10:46:22,146 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 16 [2022-07-22 10:46:22,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382142407] [2022-07-22 10:46:22,146 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-22 10:46:22,147 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-07-22 10:46:22,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 10:46:22,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-07-22 10:46:22,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2022-07-22 10:46:22,148 INFO L87 Difference]: Start difference. First operand 26 states and 29 transitions. Second operand has 16 states, 16 states have (on average 1.75) internal successors, (28), 16 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:46:22,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 10:46:22,467 INFO L93 Difference]: Finished difference Result 29 states and 31 transitions. [2022-07-22 10:46:22,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-22 10:46:22,467 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.75) internal successors, (28), 16 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-07-22 10:46:22,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 10:46:22,468 INFO L225 Difference]: With dead ends: 29 [2022-07-22 10:46:22,468 INFO L226 Difference]: Without dead ends: 24 [2022-07-22 10:46:22,469 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=69, Invalid=203, Unknown=0, NotChecked=0, Total=272 [2022-07-22 10:46:22,470 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 7 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 34 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-22 10:46:22,471 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 60 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 48 Invalid, 0 Unknown, 34 Unchecked, 0.2s Time] [2022-07-22 10:46:22,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-07-22 10:46:22,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2022-07-22 10:46:22,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 22 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:46:22,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2022-07-22 10:46:22,474 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 18 [2022-07-22 10:46:22,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 10:46:22,475 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 25 transitions. [2022-07-22 10:46:22,475 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.75) internal successors, (28), 16 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:46:22,475 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2022-07-22 10:46:22,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-22 10:46:22,476 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 10:46:22,476 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 10:46:22,493 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-07-22 10:46:22,679 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 10:46:22,680 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 10:46:22,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 10:46:22,680 INFO L85 PathProgramCache]: Analyzing trace with hash -1786143722, now seen corresponding path program 4 times [2022-07-22 10:46:22,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 10:46:22,681 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721446326] [2022-07-22 10:46:22,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 10:46:22,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 10:46:22,706 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-22 10:46:22,712 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1608315725] [2022-07-22 10:46:22,712 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-22 10:46:22,712 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 10:46:22,712 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 10:46:22,714 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-07-22 10:46:22,740 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-07-22 10:46:22,762 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-22 10:46:22,763 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 10:46:22,764 WARN L261 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 39 conjunts are in the unsatisfiable core [2022-07-22 10:46:22,771 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 10:46:22,814 INFO L390 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-07-22 10:46:22,937 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 25 treesize of output 13 [2022-07-22 10:46:23,125 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 27 treesize of output 15 [2022-07-22 10:46:23,766 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:46:23,767 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2022-07-22 10:46:24,169 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:46:24,174 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:46:24,175 INFO L390 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 32 treesize of output 34 [2022-07-22 10:46:24,668 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:46:24,669 INFO L390 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 41 treesize of output 25 [2022-07-22 10:46:24,791 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 10:46:24,792 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 10:46:27,426 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_44| Int)) (or (forall ((v_ArrVal_135 Int)) (= (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_44| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_135) |c_ULTIMATE.start_main_~a~0#1.offset|) 0)) (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_44|)))) is different from false [2022-07-22 10:47:56,328 WARN L233 SmtUtils]: Spent 1.07m on a formula simplification. DAG size of input: 61 DAG size of output: 58 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-22 10:47:59,259 WARN L833 $PredicateComparison]: unable to prove that (forall ((~N~0 Int)) (or (= (mod (+ (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1) ~N~0) 0) (< (+ |c_ULTIMATE.start_main_~i~0#1| 1) ~N~0) (not (< |c_ULTIMATE.start_main_~i~0#1| ~N~0)))) is different from false [2022-07-22 10:48:20,549 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-07-22 10:48:20,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 10:48:20,549 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721446326] [2022-07-22 10:48:20,549 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-22 10:48:20,549 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1608315725] [2022-07-22 10:48:20,550 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1608315725] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 10:48:20,550 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-22 10:48:20,550 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 24 [2022-07-22 10:48:20,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772656101] [2022-07-22 10:48:20,550 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-22 10:48:20,551 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-07-22 10:48:20,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 10:48:20,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-07-22 10:48:20,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=374, Unknown=21, NotChecked=82, Total=552 [2022-07-22 10:48:20,552 INFO L87 Difference]: Start difference. First operand 23 states and 25 transitions. Second operand has 24 states, 24 states have (on average 1.4166666666666667) internal successors, (34), 24 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:48:22,738 WARN L833 $PredicateComparison]: unable to prove that (and (< (+ |c_ULTIMATE.start_main_~a~0#1.base| 1) |c_ULTIMATE.start_main_~#sum~0#1.base|) (< 1 c_~N~0) (forall ((~N~0 Int)) (or (= (mod (+ (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1) ~N~0) 0) (< (+ |c_ULTIMATE.start_main_~i~0#1| 1) ~N~0) (not (< |c_ULTIMATE.start_main_~i~0#1| ~N~0)))) (= (+ (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (- 2)) 0) (<= |c_ULTIMATE.start_main_~i~0#1| 2) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0)) is different from false [2022-07-22 10:48:24,794 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~i~0#1_44| Int)) (or (forall ((v_ArrVal_135 Int)) (= (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_44| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_135) |c_ULTIMATE.start_main_~a~0#1.offset|) 0)) (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_44|)))) (exists ((~N~0 Int)) (and (< 1 ~N~0) (<= ~N~0 2) (= (mod 2 ~N~0) (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|))))) (= |c_ULTIMATE.start_main_~i~0#1| 0) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (and (= (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) 2) (< (+ |c_ULTIMATE.start_main_~a~0#1.base| 1) |ULTIMATE.start_main_~#sum~0#1.base|)))) is different from false [2022-07-22 10:48:43,114 WARN L233 SmtUtils]: Spent 7.96s on a formula simplification. DAG size of input: 58 DAG size of output: 31 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-22 10:48:45,118 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~i~0#1_44| Int)) (or (forall ((v_ArrVal_135 Int)) (= (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_44| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_135) |c_ULTIMATE.start_main_~a~0#1.offset|) 0)) (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_44|)))) (exists ((~N~0 Int)) (and (< 1 ~N~0) (<= ~N~0 2) (= (mod 2 ~N~0) (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)))) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (and (= (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) 2) (< (+ |c_ULTIMATE.start_main_~a~0#1.base| 1) |ULTIMATE.start_main_~#sum~0#1.base|)))) is different from false [2022-07-22 10:48:45,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 10:48:45,516 INFO L93 Difference]: Finished difference Result 49 states and 55 transitions. [2022-07-22 10:48:45,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-07-22 10:48:45,517 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.4166666666666667) internal successors, (34), 24 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-07-22 10:48:45,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 10:48:45,517 INFO L225 Difference]: With dead ends: 49 [2022-07-22 10:48:45,517 INFO L226 Difference]: Without dead ends: 47 [2022-07-22 10:48:45,518 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 14 SyntacticMatches, 3 SemanticMatches, 27 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 140.7s TimeCoverageRelationStatistics Valid=94, Invalid=452, Unknown=26, NotChecked=240, Total=812 [2022-07-22 10:48:45,519 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 9 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 136 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-22 10:48:45,519 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 81 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 54 Invalid, 0 Unknown, 136 Unchecked, 0.3s Time] [2022-07-22 10:48:45,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-07-22 10:48:45,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 42. [2022-07-22 10:48:45,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 41 states have (on average 1.170731707317073) internal successors, (48), 41 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:48:45,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 48 transitions. [2022-07-22 10:48:45,528 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 48 transitions. Word has length 20 [2022-07-22 10:48:45,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 10:48:45,529 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 48 transitions. [2022-07-22 10:48:45,529 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 1.4166666666666667) internal successors, (34), 24 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:48:45,529 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 48 transitions. [2022-07-22 10:48:45,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-22 10:48:45,530 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 10:48:45,530 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 10:48:45,555 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-07-22 10:48:45,749 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 10:48:45,749 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 10:48:45,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 10:48:45,750 INFO L85 PathProgramCache]: Analyzing trace with hash 1232945932, now seen corresponding path program 1 times [2022-07-22 10:48:45,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 10:48:45,750 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597529418] [2022-07-22 10:48:45,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 10:48:45,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 10:48:45,769 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-22 10:48:45,770 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [432346489] [2022-07-22 10:48:45,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 10:48:45,770 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 10:48:45,770 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 10:48:45,771 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-07-22 10:48:45,772 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-07-22 10:48:45,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 10:48:45,827 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 45 conjunts are in the unsatisfiable core [2022-07-22 10:48:45,830 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 10:48:45,851 INFO L390 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-07-22 10:48:45,875 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-22 10:48:45,952 INFO L390 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 28 treesize of output 16 [2022-07-22 10:48:46,083 INFO L390 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 28 treesize of output 16 [2022-07-22 10:48:46,355 INFO L390 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 51 treesize of output 42 [2022-07-22 10:48:46,699 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:48:46,700 INFO L390 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 62 treesize of output 52 [2022-07-22 10:48:57,310 INFO L390 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 65 treesize of output 33 [2022-07-22 10:48:57,452 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 10:48:57,453 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 10:49:29,239 WARN L233 SmtUtils]: Spent 28.35s on a formula simplification. DAG size of input: 77 DAG size of output: 72 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-22 10:49:39,498 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 10:49:39,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 10:49:39,498 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597529418] [2022-07-22 10:49:39,498 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-22 10:49:39,498 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [432346489] [2022-07-22 10:49:39,499 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [432346489] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 10:49:39,499 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-22 10:49:39,499 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 25 [2022-07-22 10:49:39,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653095690] [2022-07-22 10:49:39,499 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-22 10:49:39,499 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-07-22 10:49:39,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 10:49:39,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-07-22 10:49:39,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=487, Unknown=4, NotChecked=0, Total=600 [2022-07-22 10:49:39,500 INFO L87 Difference]: Start difference. First operand 42 states and 48 transitions. Second operand has 25 states, 25 states have (on average 1.68) internal successors, (42), 25 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:49:46,579 WARN L233 SmtUtils]: Spent 6.30s on a formula simplification. DAG size of input: 50 DAG size of output: 41 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-22 10:49:49,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 10:49:49,318 INFO L93 Difference]: Finished difference Result 69 states and 80 transitions. [2022-07-22 10:49:49,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-07-22 10:49:49,319 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.68) internal successors, (42), 25 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-07-22 10:49:49,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 10:49:49,320 INFO L225 Difference]: With dead ends: 69 [2022-07-22 10:49:49,320 INFO L226 Difference]: Without dead ends: 67 [2022-07-22 10:49:49,321 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 234 ImplicationChecksByTransitivity, 59.6s TimeCoverageRelationStatistics Valid=136, Invalid=616, Unknown=4, NotChecked=0, Total=756 [2022-07-22 10:49:49,321 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 21 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 55 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-22 10:49:49,321 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 101 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 116 Invalid, 0 Unknown, 55 Unchecked, 0.7s Time] [2022-07-22 10:49:49,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-07-22 10:49:49,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 55. [2022-07-22 10:49:49,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 54 states have (on average 1.2037037037037037) internal successors, (65), 54 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:49:49,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 65 transitions. [2022-07-22 10:49:49,330 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 65 transitions. Word has length 24 [2022-07-22 10:49:49,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 10:49:49,331 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 65 transitions. [2022-07-22 10:49:49,331 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 1.68) internal successors, (42), 25 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:49:49,331 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 65 transitions. [2022-07-22 10:49:49,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-22 10:49:49,332 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 10:49:49,332 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 10:49:49,349 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-07-22 10:49:49,535 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 10:49:49,535 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 10:49:49,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 10:49:49,536 INFO L85 PathProgramCache]: Analyzing trace with hash -900609774, now seen corresponding path program 5 times [2022-07-22 10:49:49,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 10:49:49,536 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437383386] [2022-07-22 10:49:49,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 10:49:49,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 10:49:49,550 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-22 10:49:49,550 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [354284513] [2022-07-22 10:49:49,550 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-22 10:49:49,551 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 10:49:49,555 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 10:49:49,557 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-07-22 10:49:49,563 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-07-22 10:49:49,629 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2022-07-22 10:49:49,629 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 10:49:49,630 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-22 10:49:49,631 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 10:49:50,159 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 16 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 10:49:50,159 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 10:49:50,631 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 16 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 10:49:50,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 10:49:50,631 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437383386] [2022-07-22 10:49:50,631 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-22 10:49:50,631 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [354284513] [2022-07-22 10:49:50,631 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [354284513] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 10:49:50,631 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-22 10:49:50,632 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2022-07-22 10:49:50,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485416146] [2022-07-22 10:49:50,632 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-22 10:49:50,632 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-07-22 10:49:50,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 10:49:50,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-07-22 10:49:50,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2022-07-22 10:49:50,633 INFO L87 Difference]: Start difference. First operand 55 states and 65 transitions. Second operand has 16 states, 16 states have (on average 2.25) internal successors, (36), 16 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:49:51,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 10:49:51,880 INFO L93 Difference]: Finished difference Result 123 states and 134 transitions. [2022-07-22 10:49:51,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-22 10:49:51,881 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.25) internal successors, (36), 16 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-07-22 10:49:51,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 10:49:51,882 INFO L225 Difference]: With dead ends: 123 [2022-07-22 10:49:51,882 INFO L226 Difference]: Without dead ends: 85 [2022-07-22 10:49:51,883 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=156, Invalid=396, Unknown=0, NotChecked=0, Total=552 [2022-07-22 10:49:51,883 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 199 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-22 10:49:51,884 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 87 Invalid, 227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-22 10:49:51,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2022-07-22 10:49:51,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 51. [2022-07-22 10:49:51,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 50 states have (on average 1.14) internal successors, (57), 50 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:49:51,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 57 transitions. [2022-07-22 10:49:51,892 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 57 transitions. Word has length 24 [2022-07-22 10:49:51,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 10:49:51,892 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 57 transitions. [2022-07-22 10:49:51,893 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.25) internal successors, (36), 16 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:49:51,893 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 57 transitions. [2022-07-22 10:49:51,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-22 10:49:51,894 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 10:49:51,894 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 10:49:51,919 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-07-22 10:49:52,116 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 10:49:52,117 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 10:49:52,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 10:49:52,117 INFO L85 PathProgramCache]: Analyzing trace with hash -1049585326, now seen corresponding path program 6 times [2022-07-22 10:49:52,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 10:49:52,118 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607980739] [2022-07-22 10:49:52,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 10:49:52,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 10:49:52,142 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-22 10:49:52,152 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [693233093] [2022-07-22 10:49:52,152 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-07-22 10:49:52,153 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 10:49:52,153 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 10:49:52,154 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-07-22 10:49:52,184 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-07-22 10:49:52,231 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-07-22 10:49:52,232 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 10:49:52,233 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 55 conjunts are in the unsatisfiable core [2022-07-22 10:49:52,238 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 10:49:52,292 INFO L390 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-07-22 10:49:52,338 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-22 10:49:52,456 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-07-22 10:49:52,710 INFO L390 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 27 treesize of output 15 [2022-07-22 10:49:53,059 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-07-22 10:49:53,735 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 20 [2022-07-22 10:49:54,166 INFO L356 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2022-07-22 10:49:54,166 INFO L390 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 1 case distinctions, treesize of input 38 treesize of output 36 [2022-07-22 10:49:54,521 INFO L356 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2022-07-22 10:49:54,522 INFO L390 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 1 case distinctions, treesize of input 38 treesize of output 36 [2022-07-22 10:49:55,203 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-07-22 10:49:55,203 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 30 [2022-07-22 10:49:55,318 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-22 10:49:55,319 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 10:49:57,780 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (< c_~N~0 0)) (.cse5 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse2 (= (mod .cse5 c_~N~0) 0)) (.cse3 (< .cse5 0)) (.cse0 (not .cse1))) (and (or (and (or .cse0 (forall ((|ULTIMATE.start_main_~i~0#1| Int)) (= (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ c_~N~0 (mod (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0))) |c_ULTIMATE.start_main_~a~0#1.offset|) 0))) (or (forall ((|ULTIMATE.start_main_~i~0#1| Int)) (= (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ (mod (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0) (* (- 1) c_~N~0))) |c_ULTIMATE.start_main_~a~0#1.offset|) 0)) .cse1)) .cse2 (not .cse3)) (or (and (not .cse2) .cse3) (let ((.cse4 (forall ((|ULTIMATE.start_main_~i~0#1| Int)) (= (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) (mod (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0)) |c_ULTIMATE.start_main_~a~0#1.offset|) 0)))) (and (or .cse0 .cse4) (or .cse4 .cse1))))))) is different from false [2022-07-22 10:50:00,780 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse8 (< c_~N~0 0)) (.cse22 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse11 (= (mod .cse22 c_~N~0) 0)) (.cse12 (< .cse22 0)) (.cse9 (not .cse8))) (and (or (and (or (and (forall ((|ULTIMATE.start_main_~i~0#1| Int) (v_subst_3 Int)) (let ((.cse0 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ (mod (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0) (* (- 1) c_~N~0))))) (let ((.cse1 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse0) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (or (= (select (store .cse0 (+ (* 4 v_subst_3) |c_ULTIMATE.start_main_~a~0#1.offset|) (mod .cse1 c_~N~0)) |c_ULTIMATE.start_main_~a~0#1.offset|) 0) (< .cse1 0))))) (forall ((|ULTIMATE.start_main_~i~0#1| Int) (v_subst_3 Int)) (let ((.cse2 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ (mod (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0) (* (- 1) c_~N~0))))) (let ((.cse3 (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse2) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0))) (or (= (select (store .cse2 (+ (* 4 v_subst_3) |c_ULTIMATE.start_main_~a~0#1.offset|) .cse3) |c_ULTIMATE.start_main_~a~0#1.offset|) 0) (not (= .cse3 0)))))) (forall ((|ULTIMATE.start_main_~i~0#1| Int) (v_subst_1 Int)) (let ((.cse7 (* (- 1) c_~N~0))) (let ((.cse5 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ (mod (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0) .cse7)))) (let ((.cse4 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse5) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse6 (mod .cse4 c_~N~0))) (or (not (< .cse4 0)) (= (select (store .cse5 (+ (* 4 v_subst_1) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ .cse6 .cse7)) |c_ULTIMATE.start_main_~a~0#1.offset|) 0) (= .cse6 0)))))))) .cse8) (or .cse9 (forall ((|ULTIMATE.start_main_~i~0#1| Int) (v_subst_2 Int)) (= (select (let ((.cse10 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ c_~N~0 (mod (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0))))) (store .cse10 (+ (* 4 v_subst_2) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ c_~N~0 (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse10) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0)))) |c_ULTIMATE.start_main_~a~0#1.offset|) 0)))) .cse11 (not .cse12)) (or (and (not .cse11) .cse12) (let ((.cse13 (forall ((|ULTIMATE.start_main_~i~0#1| Int) (v_subst_3 Int)) (let ((.cse21 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) (mod (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0)))) (let ((.cse20 (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse21) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0))) (or (not (= .cse20 0)) (= (select (store .cse21 (+ (* 4 v_subst_3) |c_ULTIMATE.start_main_~a~0#1.offset|) .cse20) |c_ULTIMATE.start_main_~a~0#1.offset|) 0)))))) (.cse17 (forall ((|ULTIMATE.start_main_~i~0#1| Int) (v_subst_3 Int)) (let ((.cse19 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) (mod (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0)))) (let ((.cse18 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse19) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (or (< .cse18 0) (= (select (store .cse19 (+ (* 4 v_subst_3) |c_ULTIMATE.start_main_~a~0#1.offset|) (mod .cse18 c_~N~0)) |c_ULTIMATE.start_main_~a~0#1.offset|) 0))))))) (and (or (and .cse13 (forall ((|ULTIMATE.start_main_~i~0#1| Int) (v_subst_1 Int)) (let ((.cse14 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) (mod (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0)))) (let ((.cse16 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse14) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse15 (mod .cse16 c_~N~0))) (or (= (select (store .cse14 (+ (* 4 v_subst_1) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ .cse15 (* (- 1) c_~N~0))) |c_ULTIMATE.start_main_~a~0#1.offset|) 0) (= .cse15 0) (not (< .cse16 0))))))) .cse17) .cse8) (or (and .cse13 .cse17) .cse9))))))) is different from false [2022-07-22 10:50:04,683 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse62 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse35 (< c_~N~0 0)) (.cse34 (mod .cse62 c_~N~0))) (let ((.cse0 (= .cse34 0)) (.cse1 (< .cse62 0)) (.cse32 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse33 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse4 (not .cse35))) (and (or .cse0 (not .cse1) (and (or (forall ((v_subst_2 Int) (v_subst_10 Int)) (= (select (let ((.cse2 (let ((.cse3 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ c_~N~0 (mod (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0))))) (store .cse3 (+ (* v_subst_10 4) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ c_~N~0 (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse3) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0)))))) (store .cse2 (+ (* 4 v_subst_2) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ c_~N~0 (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse2) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0)))) |c_ULTIMATE.start_main_~a~0#1.offset|) 0)) .cse4) (or (let ((.cse31 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store .cse32 .cse33 (+ .cse34 (* (- 1) c_~N~0)))) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse5 (= (mod .cse31 c_~N~0) 0)) (.cse6 (< .cse31 0))) (and (or (and (not .cse5) .cse6) (and (forall ((v_subst_5 Int) (v_subst_3 Int)) (let ((.cse8 (let ((.cse9 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ (mod (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0) (* (- 1) c_~N~0))))) (store .cse9 (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_5)) (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse9) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0))))) (let ((.cse7 (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse8) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0))) (or (not (= .cse7 0)) (= (select (store .cse8 (+ (* 4 v_subst_3) |c_ULTIMATE.start_main_~a~0#1.offset|) .cse7) |c_ULTIMATE.start_main_~a~0#1.offset|) 0))))) (forall ((v_subst_6 Int) (v_subst_1 Int)) (let ((.cse13 (* (- 1) c_~N~0))) (let ((.cse12 (let ((.cse14 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ (mod (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0) .cse13)))) (store .cse14 (+ (* 4 v_subst_6) |c_ULTIMATE.start_main_~a~0#1.offset|) (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse14) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0))))) (let ((.cse11 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse12) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse10 (mod .cse11 c_~N~0))) (or (= .cse10 0) (not (< .cse11 0)) (= (select (store .cse12 (+ (* 4 v_subst_1) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ .cse10 .cse13)) |c_ULTIMATE.start_main_~a~0#1.offset|) 0))))))) (forall ((v_subst_4 Int) (v_subst_3 Int)) (let ((.cse15 (let ((.cse17 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ (mod (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0) (* (- 1) c_~N~0))))) (store .cse17 (+ (* 4 v_subst_4) |c_ULTIMATE.start_main_~a~0#1.offset|) (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse17) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0))))) (let ((.cse16 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse15) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (or (= (select (store .cse15 (+ (* 4 v_subst_3) |c_ULTIMATE.start_main_~a~0#1.offset|) (mod .cse16 c_~N~0)) |c_ULTIMATE.start_main_~a~0#1.offset|) 0) (< .cse16 0))))))) (or .cse5 (not .cse6) (and (forall ((v_subst_7 Int) (v_subst_3 Int)) (let ((.cse19 (let ((.cse21 (* (- 1) c_~N~0))) (let ((.cse20 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ (mod (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0) .cse21)))) (store .cse20 (+ (* 4 v_subst_7) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse20) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0) .cse21)))))) (let ((.cse18 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse19) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (or (< .cse18 0) (= (select (store .cse19 (+ (* 4 v_subst_3) |c_ULTIMATE.start_main_~a~0#1.offset|) (mod .cse18 c_~N~0)) |c_ULTIMATE.start_main_~a~0#1.offset|) 0))))) (forall ((v_subst_8 Int) (v_subst_3 Int)) (let ((.cse23 (let ((.cse25 (* (- 1) c_~N~0))) (let ((.cse24 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ (mod (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0) .cse25)))) (store .cse24 (+ (* 4 v_subst_8) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse24) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0) .cse25)))))) (let ((.cse22 (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse23) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0))) (or (not (= .cse22 0)) (= (select (store .cse23 (+ (* 4 v_subst_3) |c_ULTIMATE.start_main_~a~0#1.offset|) .cse22) |c_ULTIMATE.start_main_~a~0#1.offset|) 0))))) (forall ((v_subst_9 Int) (v_subst_1 Int)) (let ((.cse28 (* (- 1) c_~N~0))) (let ((.cse26 (let ((.cse30 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ (mod (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0) .cse28)))) (store .cse30 (+ (* 4 v_subst_9) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse30) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0) .cse28))))) (let ((.cse29 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse26) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse27 (mod .cse29 c_~N~0))) (or (= (select (store .cse26 (+ (* 4 v_subst_1) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ .cse27 .cse28)) |c_ULTIMATE.start_main_~a~0#1.offset|) 0) (not (< .cse29 0)) (= .cse27 0)))))))))))) .cse35))) (or (and (not .cse0) .cse1) (let ((.cse49 (forall ((v_subst_5 Int) (v_subst_3 Int)) (let ((.cse59 (let ((.cse61 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) (mod (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0)))) (store .cse61 (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_5)) (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse61) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0))))) (let ((.cse60 (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse59) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0))) (or (= (select (store .cse59 (+ (* 4 v_subst_3) |c_ULTIMATE.start_main_~a~0#1.offset|) .cse60) |c_ULTIMATE.start_main_~a~0#1.offset|) 0) (not (= .cse60 0))))))) (.cse50 (forall ((v_subst_4 Int) (v_subst_3 Int)) (let ((.cse56 (let ((.cse58 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) (mod (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0)))) (store .cse58 (+ (* 4 v_subst_4) |c_ULTIMATE.start_main_~a~0#1.offset|) (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse58) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0))))) (let ((.cse57 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse56) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (or (= (select (store .cse56 (+ (* 4 v_subst_3) |c_ULTIMATE.start_main_~a~0#1.offset|) (mod .cse57 c_~N~0)) |c_ULTIMATE.start_main_~a~0#1.offset|) 0) (< .cse57 0))))))) (and (or (let ((.cse55 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store .cse32 .cse33 .cse34)) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse48 (= (mod .cse55 c_~N~0) 0)) (.cse47 (< .cse55 0))) (and (or (and (forall ((v_subst_9 Int) (v_subst_1 Int)) (let ((.cse39 (* (- 1) c_~N~0))) (let ((.cse38 (let ((.cse40 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) (mod (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0)))) (store .cse40 (+ (* 4 v_subst_9) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse40) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0) .cse39))))) (let ((.cse36 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse38) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse37 (mod .cse36 c_~N~0))) (or (not (< .cse36 0)) (= .cse37 0) (= (select (store .cse38 (+ (* 4 v_subst_1) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ .cse37 .cse39)) |c_ULTIMATE.start_main_~a~0#1.offset|) 0))))))) (forall ((v_subst_8 Int) (v_subst_3 Int)) (let ((.cse42 (let ((.cse43 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) (mod (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0)))) (store .cse43 (+ (* 4 v_subst_8) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse43) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0) (* (- 1) c_~N~0)))))) (let ((.cse41 (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse42) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0))) (or (not (= .cse41 0)) (= (select (store .cse42 (+ (* 4 v_subst_3) |c_ULTIMATE.start_main_~a~0#1.offset|) .cse41) |c_ULTIMATE.start_main_~a~0#1.offset|) 0))))) (forall ((v_subst_7 Int) (v_subst_3 Int)) (let ((.cse45 (let ((.cse46 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) (mod (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0)))) (store .cse46 (+ (* 4 v_subst_7) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse46) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0) (* (- 1) c_~N~0)))))) (let ((.cse44 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse45) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (or (< .cse44 0) (= (select (store .cse45 (+ (* 4 v_subst_3) |c_ULTIMATE.start_main_~a~0#1.offset|) (mod .cse44 c_~N~0)) |c_ULTIMATE.start_main_~a~0#1.offset|) 0)))))) (not .cse47) .cse48) (or (and .cse49 .cse50 (forall ((v_subst_6 Int) (v_subst_1 Int)) (let ((.cse51 (let ((.cse54 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) (mod (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0)))) (store .cse54 (+ (* 4 v_subst_6) |c_ULTIMATE.start_main_~a~0#1.offset|) (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse54) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0))))) (let ((.cse53 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse51) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse52 (mod .cse53 c_~N~0))) (or (= (select (store .cse51 (+ (* 4 v_subst_1) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ .cse52 (* (- 1) c_~N~0))) |c_ULTIMATE.start_main_~a~0#1.offset|) 0) (= .cse52 0) (not (< .cse53 0)))))))) (and (not .cse48) .cse47))))) .cse35) (or .cse4 (and .cse49 .cse50))))))))) is different from false [2022-07-22 10:50:08,999 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse49 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse23 (< c_~N~0 0)) (.cse22 (mod .cse49 c_~N~0))) (let ((.cse0 (= .cse22 0)) (.cse1 (< .cse49 0)) (.cse26 (not .cse23)) (.cse21 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (and (or (and (not .cse0) .cse1) (and (or (let ((.cse20 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store .cse21 |c_ULTIMATE.start_main_~a~0#1.offset| .cse22)) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse11 (= (mod .cse20 c_~N~0) 0)) (.cse10 (< .cse20 0))) (and (or (and (forall ((v_subst_5 Int) (v_subst_3 Int)) (let ((.cse2 (let ((.cse4 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset| (mod (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0)))) (store .cse4 (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_5)) (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse4) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0))))) (let ((.cse3 (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse2) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0))) (or (= (select (store .cse2 (+ (* 4 v_subst_3) |c_ULTIMATE.start_main_~a~0#1.offset|) .cse3) |c_ULTIMATE.start_main_~a~0#1.offset|) 0) (not (= .cse3 0)))))) (forall ((v_subst_4 Int) (v_subst_3 Int)) (let ((.cse6 (let ((.cse7 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset| (mod (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0)))) (store .cse7 (+ (* 4 v_subst_4) |c_ULTIMATE.start_main_~a~0#1.offset|) (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse7) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0))))) (let ((.cse5 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse6) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (or (< .cse5 0) (= (select (store .cse6 (+ (* 4 v_subst_3) |c_ULTIMATE.start_main_~a~0#1.offset|) (mod .cse5 c_~N~0)) |c_ULTIMATE.start_main_~a~0#1.offset|) 0))))) (forall ((v_subst_6 Int)) (let ((.cse8 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse9 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset| (mod (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0)))) (store .cse9 (+ (* 4 v_subst_6) |c_ULTIMATE.start_main_~a~0#1.offset|) (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse9) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0)))) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (or (= (mod .cse8 c_~N~0) 0) (not (< .cse8 0)))))) (and .cse10 (not .cse11))) (or .cse11 (not .cse10) (and (forall ((v_subst_7 Int) (v_subst_3 Int)) (let ((.cse13 (let ((.cse14 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset| (mod (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0)))) (store .cse14 (+ (* 4 v_subst_7) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse14) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0) (* (- 1) c_~N~0)))))) (let ((.cse12 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse13) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (or (< .cse12 0) (= (select (store .cse13 (+ (* 4 v_subst_3) |c_ULTIMATE.start_main_~a~0#1.offset|) (mod .cse12 c_~N~0)) |c_ULTIMATE.start_main_~a~0#1.offset|) 0))))) (forall ((v_subst_9 Int)) (let ((.cse15 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse16 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset| (mod (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0)))) (store .cse16 (+ (* 4 v_subst_9) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse16) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0) (* (- 1) c_~N~0))))) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (or (= (mod .cse15 c_~N~0) 0) (not (< .cse15 0))))) (forall ((v_subst_8 Int) (v_subst_3 Int)) (let ((.cse17 (let ((.cse19 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset| (mod (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0)))) (store .cse19 (+ (* 4 v_subst_8) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse19) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0) (* (- 1) c_~N~0)))))) (let ((.cse18 (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse17) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0))) (or (= (select (store .cse17 (+ (* 4 v_subst_3) |c_ULTIMATE.start_main_~a~0#1.offset|) .cse18) |c_ULTIMATE.start_main_~a~0#1.offset|) 0) (not (= .cse18 0))))))))))) .cse23) (or (forall ((v_subst_4 Int) (v_subst_3 Int)) (= (select (let ((.cse24 (let ((.cse25 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset| (mod (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0)))) (store .cse25 (+ (* 4 v_subst_4) |c_ULTIMATE.start_main_~a~0#1.offset|) (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse25) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0))))) (store .cse24 (+ (* 4 v_subst_3) |c_ULTIMATE.start_main_~a~0#1.offset|) (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse24) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0))) |c_ULTIMATE.start_main_~a~0#1.offset|) 0)) .cse26))) (or .cse0 (not .cse1) (let ((.cse48 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store .cse21 |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse22 (* (- 1) c_~N~0)))) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse35 (= (mod .cse48 c_~N~0) 0)) (.cse36 (< .cse48 0))) (and (or (and (forall ((v_subst_5 Int) (v_subst_3 Int)) (let ((.cse28 (let ((.cse29 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset| (+ (mod (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0) (* (- 1) c_~N~0))))) (store .cse29 (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_5)) (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse29) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0))))) (let ((.cse27 (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse28) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0))) (or (not (= .cse27 0)) (= (select (store .cse28 (+ (* 4 v_subst_3) |c_ULTIMATE.start_main_~a~0#1.offset|) .cse27) |c_ULTIMATE.start_main_~a~0#1.offset|) 0))))) (forall ((v_subst_6 Int)) (let ((.cse30 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse31 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset| (+ (mod (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0) (* (- 1) c_~N~0))))) (store .cse31 (+ (* 4 v_subst_6) |c_ULTIMATE.start_main_~a~0#1.offset|) (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse31) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0)))) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (or (= (mod .cse30 c_~N~0) 0) (not (< .cse30 0))))) (forall ((v_subst_4 Int) (v_subst_3 Int)) (let ((.cse32 (let ((.cse34 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset| (+ (mod (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0) (* (- 1) c_~N~0))))) (store .cse34 (+ (* 4 v_subst_4) |c_ULTIMATE.start_main_~a~0#1.offset|) (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse34) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0))))) (let ((.cse33 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse32) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (or (= (select (store .cse32 (+ (* 4 v_subst_3) |c_ULTIMATE.start_main_~a~0#1.offset|) (mod .cse33 c_~N~0)) |c_ULTIMATE.start_main_~a~0#1.offset|) 0) (< .cse33 0)))))) (and (not .cse35) .cse36)) .cse26 (or (and (forall ((v_subst_8 Int) (v_subst_3 Int)) (let ((.cse37 (let ((.cse40 (* (- 1) c_~N~0))) (let ((.cse39 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset| (+ (mod (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0) .cse40)))) (store .cse39 (+ (* 4 v_subst_8) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse39) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0) .cse40)))))) (let ((.cse38 (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse37) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0))) (or (= (select (store .cse37 (+ (* 4 v_subst_3) |c_ULTIMATE.start_main_~a~0#1.offset|) .cse38) |c_ULTIMATE.start_main_~a~0#1.offset|) 0) (not (= .cse38 0)))))) (forall ((v_subst_7 Int) (v_subst_3 Int)) (let ((.cse41 (let ((.cse44 (* (- 1) c_~N~0))) (let ((.cse43 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset| (+ (mod (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0) .cse44)))) (store .cse43 (+ (* 4 v_subst_7) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse43) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0) .cse44)))))) (let ((.cse42 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse41) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (or (= (select (store .cse41 (+ (* 4 v_subst_3) |c_ULTIMATE.start_main_~a~0#1.offset|) (mod .cse42 c_~N~0)) |c_ULTIMATE.start_main_~a~0#1.offset|) 0) (< .cse42 0))))) (forall ((v_subst_9 Int)) (let ((.cse45 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse47 (* (- 1) c_~N~0))) (let ((.cse46 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset| (+ (mod (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0) .cse47)))) (store .cse46 (+ (* 4 v_subst_9) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse46) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0) .cse47))))) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (or (= (mod .cse45 c_~N~0) 0) (not (< .cse45 0)))))) .cse35 (not .cse36)))))))))) is different from true [2022-07-22 10:50:11,702 WARN L855 $PredicateComparison]: unable to prove that (or (let ((.cse49 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse23 (< c_~N~0 0)) (.cse22 (mod .cse49 c_~N~0))) (let ((.cse0 (= .cse22 0)) (.cse1 (< .cse49 0)) (.cse26 (not .cse23)) (.cse21 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (and (or (and (not .cse0) .cse1) (and (or (let ((.cse20 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store .cse21 |c_ULTIMATE.start_main_~a~0#1.offset| .cse22)) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse11 (= (mod .cse20 c_~N~0) 0)) (.cse10 (< .cse20 0))) (and (or (and (forall ((v_subst_5 Int) (v_subst_3 Int)) (let ((.cse2 (let ((.cse4 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset| (mod (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0)))) (store .cse4 (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_5)) (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse4) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0))))) (let ((.cse3 (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse2) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0))) (or (= (select (store .cse2 (+ (* 4 v_subst_3) |c_ULTIMATE.start_main_~a~0#1.offset|) .cse3) |c_ULTIMATE.start_main_~a~0#1.offset|) 0) (not (= .cse3 0)))))) (forall ((v_subst_4 Int) (v_subst_3 Int)) (let ((.cse6 (let ((.cse7 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset| (mod (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0)))) (store .cse7 (+ (* 4 v_subst_4) |c_ULTIMATE.start_main_~a~0#1.offset|) (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse7) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0))))) (let ((.cse5 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse6) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (or (< .cse5 0) (= (select (store .cse6 (+ (* 4 v_subst_3) |c_ULTIMATE.start_main_~a~0#1.offset|) (mod .cse5 c_~N~0)) |c_ULTIMATE.start_main_~a~0#1.offset|) 0))))) (forall ((v_subst_6 Int)) (let ((.cse8 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse9 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset| (mod (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0)))) (store .cse9 (+ (* 4 v_subst_6) |c_ULTIMATE.start_main_~a~0#1.offset|) (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse9) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0)))) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (or (= (mod .cse8 c_~N~0) 0) (not (< .cse8 0)))))) (and .cse10 (not .cse11))) (or .cse11 (not .cse10) (and (forall ((v_subst_7 Int) (v_subst_3 Int)) (let ((.cse13 (let ((.cse14 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset| (mod (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0)))) (store .cse14 (+ (* 4 v_subst_7) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse14) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0) (* (- 1) c_~N~0)))))) (let ((.cse12 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse13) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (or (< .cse12 0) (= (select (store .cse13 (+ (* 4 v_subst_3) |c_ULTIMATE.start_main_~a~0#1.offset|) (mod .cse12 c_~N~0)) |c_ULTIMATE.start_main_~a~0#1.offset|) 0))))) (forall ((v_subst_9 Int)) (let ((.cse15 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse16 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset| (mod (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0)))) (store .cse16 (+ (* 4 v_subst_9) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse16) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0) (* (- 1) c_~N~0))))) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (or (= (mod .cse15 c_~N~0) 0) (not (< .cse15 0))))) (forall ((v_subst_8 Int) (v_subst_3 Int)) (let ((.cse17 (let ((.cse19 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset| (mod (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0)))) (store .cse19 (+ (* 4 v_subst_8) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse19) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0) (* (- 1) c_~N~0)))))) (let ((.cse18 (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse17) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0))) (or (= (select (store .cse17 (+ (* 4 v_subst_3) |c_ULTIMATE.start_main_~a~0#1.offset|) .cse18) |c_ULTIMATE.start_main_~a~0#1.offset|) 0) (not (= .cse18 0))))))))))) .cse23) (or (forall ((v_subst_4 Int) (v_subst_3 Int)) (= (select (let ((.cse24 (let ((.cse25 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset| (mod (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0)))) (store .cse25 (+ (* 4 v_subst_4) |c_ULTIMATE.start_main_~a~0#1.offset|) (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse25) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0))))) (store .cse24 (+ (* 4 v_subst_3) |c_ULTIMATE.start_main_~a~0#1.offset|) (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse24) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0))) |c_ULTIMATE.start_main_~a~0#1.offset|) 0)) .cse26))) (or .cse0 (not .cse1) (let ((.cse48 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store .cse21 |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse22 (* (- 1) c_~N~0)))) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse35 (= (mod .cse48 c_~N~0) 0)) (.cse36 (< .cse48 0))) (and (or (and (forall ((v_subst_5 Int) (v_subst_3 Int)) (let ((.cse28 (let ((.cse29 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset| (+ (mod (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0) (* (- 1) c_~N~0))))) (store .cse29 (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_5)) (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse29) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0))))) (let ((.cse27 (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse28) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0))) (or (not (= .cse27 0)) (= (select (store .cse28 (+ (* 4 v_subst_3) |c_ULTIMATE.start_main_~a~0#1.offset|) .cse27) |c_ULTIMATE.start_main_~a~0#1.offset|) 0))))) (forall ((v_subst_6 Int)) (let ((.cse30 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse31 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset| (+ (mod (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0) (* (- 1) c_~N~0))))) (store .cse31 (+ (* 4 v_subst_6) |c_ULTIMATE.start_main_~a~0#1.offset|) (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse31) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0)))) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (or (= (mod .cse30 c_~N~0) 0) (not (< .cse30 0))))) (forall ((v_subst_4 Int) (v_subst_3 Int)) (let ((.cse32 (let ((.cse34 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset| (+ (mod (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0) (* (- 1) c_~N~0))))) (store .cse34 (+ (* 4 v_subst_4) |c_ULTIMATE.start_main_~a~0#1.offset|) (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse34) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0))))) (let ((.cse33 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse32) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (or (= (select (store .cse32 (+ (* 4 v_subst_3) |c_ULTIMATE.start_main_~a~0#1.offset|) (mod .cse33 c_~N~0)) |c_ULTIMATE.start_main_~a~0#1.offset|) 0) (< .cse33 0)))))) (and (not .cse35) .cse36)) .cse26 (or (and (forall ((v_subst_8 Int) (v_subst_3 Int)) (let ((.cse37 (let ((.cse40 (* (- 1) c_~N~0))) (let ((.cse39 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset| (+ (mod (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0) .cse40)))) (store .cse39 (+ (* 4 v_subst_8) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse39) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0) .cse40)))))) (let ((.cse38 (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse37) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0))) (or (= (select (store .cse37 (+ (* 4 v_subst_3) |c_ULTIMATE.start_main_~a~0#1.offset|) .cse38) |c_ULTIMATE.start_main_~a~0#1.offset|) 0) (not (= .cse38 0)))))) (forall ((v_subst_7 Int) (v_subst_3 Int)) (let ((.cse41 (let ((.cse44 (* (- 1) c_~N~0))) (let ((.cse43 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset| (+ (mod (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0) .cse44)))) (store .cse43 (+ (* 4 v_subst_7) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse43) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0) .cse44)))))) (let ((.cse42 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse41) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (or (= (select (store .cse41 (+ (* 4 v_subst_3) |c_ULTIMATE.start_main_~a~0#1.offset|) (mod .cse42 c_~N~0)) |c_ULTIMATE.start_main_~a~0#1.offset|) 0) (< .cse42 0))))) (forall ((v_subst_9 Int)) (let ((.cse45 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse47 (* (- 1) c_~N~0))) (let ((.cse46 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset| (+ (mod (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0) .cse47)))) (store .cse46 (+ (* 4 v_subst_9) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse46) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0) .cse47))))) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (or (= (mod .cse45 c_~N~0) 0) (not (< .cse45 0)))))) .cse35 (not .cse36)))))))))) (< |c_ULTIMATE.start_main_~i~0#1| c_~N~0)) is different from true [2022-07-22 10:50:26,660 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 10:50:26,670 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-22 10:50:26,670 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 1 [2022-07-22 10:50:26,677 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 12 not checked. [2022-07-22 10:50:26,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 10:50:26,678 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607980739] [2022-07-22 10:50:26,678 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-22 10:50:26,678 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [693233093] [2022-07-22 10:50:26,678 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [693233093] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 10:50:26,678 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-22 10:50:26,678 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 29 [2022-07-22 10:50:26,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690599353] [2022-07-22 10:50:26,679 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-22 10:50:26,682 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-07-22 10:50:26,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 10:50:26,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-07-22 10:50:26,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=461, Unknown=6, NotChecked=240, Total=812 [2022-07-22 10:50:26,684 INFO L87 Difference]: Start difference. First operand 51 states and 57 transitions. Second operand has 29 states, 29 states have (on average 1.4827586206896552) internal successors, (43), 29 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:50:28,954 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (and (not (<= c_~N~0 0)) (= (+ (- 1) .cse0) 0) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (or (let ((.cse24 (< c_~N~0 0)) (.cse23 (mod .cse0 c_~N~0))) (let ((.cse1 (= .cse23 0)) (.cse2 (< .cse0 0)) (.cse27 (not .cse24)) (.cse22 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (and (or (and (not .cse1) .cse2) (and (or (let ((.cse21 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store .cse22 |c_ULTIMATE.start_main_~a~0#1.offset| .cse23)) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse12 (= (mod .cse21 c_~N~0) 0)) (.cse11 (< .cse21 0))) (and (or (and (forall ((v_subst_5 Int) (v_subst_3 Int)) (let ((.cse3 (let ((.cse5 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset| (mod (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0)))) (store .cse5 (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_5)) (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse5) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0))))) (let ((.cse4 (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse3) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0))) (or (= (select (store .cse3 (+ (* 4 v_subst_3) |c_ULTIMATE.start_main_~a~0#1.offset|) .cse4) |c_ULTIMATE.start_main_~a~0#1.offset|) 0) (not (= .cse4 0)))))) (forall ((v_subst_4 Int) (v_subst_3 Int)) (let ((.cse7 (let ((.cse8 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset| (mod (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0)))) (store .cse8 (+ (* 4 v_subst_4) |c_ULTIMATE.start_main_~a~0#1.offset|) (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse8) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0))))) (let ((.cse6 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse7) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (or (< .cse6 0) (= (select (store .cse7 (+ (* 4 v_subst_3) |c_ULTIMATE.start_main_~a~0#1.offset|) (mod .cse6 c_~N~0)) |c_ULTIMATE.start_main_~a~0#1.offset|) 0))))) (forall ((v_subst_6 Int)) (let ((.cse9 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse10 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset| (mod (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0)))) (store .cse10 (+ (* 4 v_subst_6) |c_ULTIMATE.start_main_~a~0#1.offset|) (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse10) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0)))) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (or (= (mod .cse9 c_~N~0) 0) (not (< .cse9 0)))))) (and .cse11 (not .cse12))) (or .cse12 (not .cse11) (and (forall ((v_subst_7 Int) (v_subst_3 Int)) (let ((.cse14 (let ((.cse15 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset| (mod (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0)))) (store .cse15 (+ (* 4 v_subst_7) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse15) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0) (* (- 1) c_~N~0)))))) (let ((.cse13 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse14) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (or (< .cse13 0) (= (select (store .cse14 (+ (* 4 v_subst_3) |c_ULTIMATE.start_main_~a~0#1.offset|) (mod .cse13 c_~N~0)) |c_ULTIMATE.start_main_~a~0#1.offset|) 0))))) (forall ((v_subst_9 Int)) (let ((.cse16 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse17 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset| (mod (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0)))) (store .cse17 (+ (* 4 v_subst_9) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse17) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0) (* (- 1) c_~N~0))))) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (or (= (mod .cse16 c_~N~0) 0) (not (< .cse16 0))))) (forall ((v_subst_8 Int) (v_subst_3 Int)) (let ((.cse18 (let ((.cse20 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset| (mod (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0)))) (store .cse20 (+ (* 4 v_subst_8) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse20) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0) (* (- 1) c_~N~0)))))) (let ((.cse19 (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse18) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0))) (or (= (select (store .cse18 (+ (* 4 v_subst_3) |c_ULTIMATE.start_main_~a~0#1.offset|) .cse19) |c_ULTIMATE.start_main_~a~0#1.offset|) 0) (not (= .cse19 0))))))))))) .cse24) (or (forall ((v_subst_4 Int) (v_subst_3 Int)) (= (select (let ((.cse25 (let ((.cse26 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset| (mod (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0)))) (store .cse26 (+ (* 4 v_subst_4) |c_ULTIMATE.start_main_~a~0#1.offset|) (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse26) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0))))) (store .cse25 (+ (* 4 v_subst_3) |c_ULTIMATE.start_main_~a~0#1.offset|) (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse25) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0))) |c_ULTIMATE.start_main_~a~0#1.offset|) 0)) .cse27))) (or .cse1 (not .cse2) (let ((.cse49 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store .cse22 |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse23 (* (- 1) c_~N~0)))) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse36 (= (mod .cse49 c_~N~0) 0)) (.cse37 (< .cse49 0))) (and (or (and (forall ((v_subst_5 Int) (v_subst_3 Int)) (let ((.cse29 (let ((.cse30 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset| (+ (mod (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0) (* (- 1) c_~N~0))))) (store .cse30 (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_5)) (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse30) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0))))) (let ((.cse28 (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse29) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0))) (or (not (= .cse28 0)) (= (select (store .cse29 (+ (* 4 v_subst_3) |c_ULTIMATE.start_main_~a~0#1.offset|) .cse28) |c_ULTIMATE.start_main_~a~0#1.offset|) 0))))) (forall ((v_subst_6 Int)) (let ((.cse31 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse32 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset| (+ (mod (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0) (* (- 1) c_~N~0))))) (store .cse32 (+ (* 4 v_subst_6) |c_ULTIMATE.start_main_~a~0#1.offset|) (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse32) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0)))) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (or (= (mod .cse31 c_~N~0) 0) (not (< .cse31 0))))) (forall ((v_subst_4 Int) (v_subst_3 Int)) (let ((.cse33 (let ((.cse35 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset| (+ (mod (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0) (* (- 1) c_~N~0))))) (store .cse35 (+ (* 4 v_subst_4) |c_ULTIMATE.start_main_~a~0#1.offset|) (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse35) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0))))) (let ((.cse34 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse33) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (or (= (select (store .cse33 (+ (* 4 v_subst_3) |c_ULTIMATE.start_main_~a~0#1.offset|) (mod .cse34 c_~N~0)) |c_ULTIMATE.start_main_~a~0#1.offset|) 0) (< .cse34 0)))))) (and (not .cse36) .cse37)) .cse27 (or (and (forall ((v_subst_8 Int) (v_subst_3 Int)) (let ((.cse38 (let ((.cse41 (* (- 1) c_~N~0))) (let ((.cse40 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset| (+ (mod (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0) .cse41)))) (store .cse40 (+ (* 4 v_subst_8) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse40) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0) .cse41)))))) (let ((.cse39 (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse38) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0))) (or (= (select (store .cse38 (+ (* 4 v_subst_3) |c_ULTIMATE.start_main_~a~0#1.offset|) .cse39) |c_ULTIMATE.start_main_~a~0#1.offset|) 0) (not (= .cse39 0)))))) (forall ((v_subst_7 Int) (v_subst_3 Int)) (let ((.cse42 (let ((.cse45 (* (- 1) c_~N~0))) (let ((.cse44 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset| (+ (mod (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0) .cse45)))) (store .cse44 (+ (* 4 v_subst_7) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse44) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0) .cse45)))))) (let ((.cse43 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse42) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (or (= (select (store .cse42 (+ (* 4 v_subst_3) |c_ULTIMATE.start_main_~a~0#1.offset|) (mod .cse43 c_~N~0)) |c_ULTIMATE.start_main_~a~0#1.offset|) 0) (< .cse43 0))))) (forall ((v_subst_9 Int)) (let ((.cse46 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse48 (* (- 1) c_~N~0))) (let ((.cse47 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset| (+ (mod (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0) .cse48)))) (store .cse47 (+ (* 4 v_subst_9) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse47) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0) .cse48))))) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (or (= (mod .cse46 c_~N~0) 0) (not (< .cse46 0)))))) .cse36 (not .cse37))))))))) (< |c_ULTIMATE.start_main_~i~0#1| c_~N~0)) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= |c_ULTIMATE.start_main_~i~0#1| 1))) is different from true [2022-07-22 10:50:34,253 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse0 (< (+ |c_ULTIMATE.start_main_~i~0#1| 1) c_~N~0)) (.cse57 (< |c_ULTIMATE.start_main_~i~0#1| c_~N~0)) (.cse1 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (and (or (< (+ 2 |c_ULTIMATE.start_main_~i~0#1|) c_~N~0) (not .cse0) (and (= (mod (+ .cse1 2) c_~N~0) 0) (forall ((v_subst_4 Int) (v_subst_3 Int)) (let ((.cse7 (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse6 (+ (select .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset|) 2))) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse6)))) (let ((.cse2 (let ((.cse5 (store (select .cse4 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset| (mod .cse6 c_~N~0)))) (store .cse5 (+ (* 4 v_subst_4) |c_ULTIMATE.start_main_~a~0#1.offset|) (mod (select (select (store .cse4 |c_ULTIMATE.start_main_~a~0#1.base| .cse5) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0))))) (let ((.cse3 (select (select (store .cse4 |c_ULTIMATE.start_main_~a~0#1.base| .cse2) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (or (= (select (store .cse2 (+ (* 4 v_subst_3) |c_ULTIMATE.start_main_~a~0#1.offset|) (mod .cse3 c_~N~0)) |c_ULTIMATE.start_main_~a~0#1.offset|) 0) (< .cse3 0)))))))))) (< 2 c_~N~0) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (or (let ((.cse31 (< c_~N~0 0)) (.cse30 (mod .cse1 c_~N~0))) (let ((.cse8 (= .cse30 0)) (.cse9 (< .cse1 0)) (.cse34 (not .cse31)) (.cse29 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (and (or (and (not .cse8) .cse9) (and (or (let ((.cse28 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store .cse29 |c_ULTIMATE.start_main_~a~0#1.offset| .cse30)) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse19 (= (mod .cse28 c_~N~0) 0)) (.cse18 (< .cse28 0))) (and (or (and (forall ((v_subst_5 Int) (v_subst_3 Int)) (let ((.cse10 (let ((.cse12 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset| (mod (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0)))) (store .cse12 (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_5)) (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse12) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0))))) (let ((.cse11 (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse10) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0))) (or (= (select (store .cse10 (+ (* 4 v_subst_3) |c_ULTIMATE.start_main_~a~0#1.offset|) .cse11) |c_ULTIMATE.start_main_~a~0#1.offset|) 0) (not (= .cse11 0)))))) (forall ((v_subst_4 Int) (v_subst_3 Int)) (let ((.cse14 (let ((.cse15 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset| (mod (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0)))) (store .cse15 (+ (* 4 v_subst_4) |c_ULTIMATE.start_main_~a~0#1.offset|) (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse15) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0))))) (let ((.cse13 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse14) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (or (< .cse13 0) (= (select (store .cse14 (+ (* 4 v_subst_3) |c_ULTIMATE.start_main_~a~0#1.offset|) (mod .cse13 c_~N~0)) |c_ULTIMATE.start_main_~a~0#1.offset|) 0))))) (forall ((v_subst_6 Int)) (let ((.cse16 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse17 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset| (mod (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0)))) (store .cse17 (+ (* 4 v_subst_6) |c_ULTIMATE.start_main_~a~0#1.offset|) (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse17) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0)))) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (or (= (mod .cse16 c_~N~0) 0) (not (< .cse16 0)))))) (and .cse18 (not .cse19))) (or .cse19 (not .cse18) (and (forall ((v_subst_7 Int) (v_subst_3 Int)) (let ((.cse21 (let ((.cse22 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset| (mod (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0)))) (store .cse22 (+ (* 4 v_subst_7) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse22) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0) (* (- 1) c_~N~0)))))) (let ((.cse20 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse21) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (or (< .cse20 0) (= (select (store .cse21 (+ (* 4 v_subst_3) |c_ULTIMATE.start_main_~a~0#1.offset|) (mod .cse20 c_~N~0)) |c_ULTIMATE.start_main_~a~0#1.offset|) 0))))) (forall ((v_subst_9 Int)) (let ((.cse23 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse24 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset| (mod (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0)))) (store .cse24 (+ (* 4 v_subst_9) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse24) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0) (* (- 1) c_~N~0))))) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (or (= (mod .cse23 c_~N~0) 0) (not (< .cse23 0))))) (forall ((v_subst_8 Int) (v_subst_3 Int)) (let ((.cse25 (let ((.cse27 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset| (mod (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0)))) (store .cse27 (+ (* 4 v_subst_8) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse27) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0) (* (- 1) c_~N~0)))))) (let ((.cse26 (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse25) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0))) (or (= (select (store .cse25 (+ (* 4 v_subst_3) |c_ULTIMATE.start_main_~a~0#1.offset|) .cse26) |c_ULTIMATE.start_main_~a~0#1.offset|) 0) (not (= .cse26 0))))))))))) .cse31) (or (forall ((v_subst_4 Int) (v_subst_3 Int)) (= (select (let ((.cse32 (let ((.cse33 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset| (mod (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0)))) (store .cse33 (+ (* 4 v_subst_4) |c_ULTIMATE.start_main_~a~0#1.offset|) (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse33) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0))))) (store .cse32 (+ (* 4 v_subst_3) |c_ULTIMATE.start_main_~a~0#1.offset|) (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse32) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0))) |c_ULTIMATE.start_main_~a~0#1.offset|) 0)) .cse34))) (or .cse8 (not .cse9) (let ((.cse56 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store .cse29 |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse30 (* (- 1) c_~N~0)))) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse43 (= (mod .cse56 c_~N~0) 0)) (.cse44 (< .cse56 0))) (and (or (and (forall ((v_subst_5 Int) (v_subst_3 Int)) (let ((.cse36 (let ((.cse37 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset| (+ (mod (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0) (* (- 1) c_~N~0))))) (store .cse37 (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_5)) (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse37) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0))))) (let ((.cse35 (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse36) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0))) (or (not (= .cse35 0)) (= (select (store .cse36 (+ (* 4 v_subst_3) |c_ULTIMATE.start_main_~a~0#1.offset|) .cse35) |c_ULTIMATE.start_main_~a~0#1.offset|) 0))))) (forall ((v_subst_6 Int)) (let ((.cse38 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse39 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset| (+ (mod (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0) (* (- 1) c_~N~0))))) (store .cse39 (+ (* 4 v_subst_6) |c_ULTIMATE.start_main_~a~0#1.offset|) (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse39) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0)))) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (or (= (mod .cse38 c_~N~0) 0) (not (< .cse38 0))))) (forall ((v_subst_4 Int) (v_subst_3 Int)) (let ((.cse40 (let ((.cse42 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset| (+ (mod (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0) (* (- 1) c_~N~0))))) (store .cse42 (+ (* 4 v_subst_4) |c_ULTIMATE.start_main_~a~0#1.offset|) (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse42) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0))))) (let ((.cse41 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse40) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (or (= (select (store .cse40 (+ (* 4 v_subst_3) |c_ULTIMATE.start_main_~a~0#1.offset|) (mod .cse41 c_~N~0)) |c_ULTIMATE.start_main_~a~0#1.offset|) 0) (< .cse41 0)))))) (and (not .cse43) .cse44)) .cse34 (or (and (forall ((v_subst_8 Int) (v_subst_3 Int)) (let ((.cse45 (let ((.cse48 (* (- 1) c_~N~0))) (let ((.cse47 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset| (+ (mod (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0) .cse48)))) (store .cse47 (+ (* 4 v_subst_8) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse47) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0) .cse48)))))) (let ((.cse46 (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse45) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0))) (or (= (select (store .cse45 (+ (* 4 v_subst_3) |c_ULTIMATE.start_main_~a~0#1.offset|) .cse46) |c_ULTIMATE.start_main_~a~0#1.offset|) 0) (not (= .cse46 0)))))) (forall ((v_subst_7 Int) (v_subst_3 Int)) (let ((.cse49 (let ((.cse52 (* (- 1) c_~N~0))) (let ((.cse51 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset| (+ (mod (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0) .cse52)))) (store .cse51 (+ (* 4 v_subst_7) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse51) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0) .cse52)))))) (let ((.cse50 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse49) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (or (= (select (store .cse49 (+ (* 4 v_subst_3) |c_ULTIMATE.start_main_~a~0#1.offset|) (mod .cse50 c_~N~0)) |c_ULTIMATE.start_main_~a~0#1.offset|) 0) (< .cse50 0))))) (forall ((v_subst_9 Int)) (let ((.cse53 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse55 (* (- 1) c_~N~0))) (let ((.cse54 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset| (+ (mod (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0) .cse55)))) (store .cse54 (+ (* 4 v_subst_9) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse54) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0) .cse55))))) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (or (= (mod .cse53 c_~N~0) 0) (not (< .cse53 0)))))) .cse43 (not .cse44))))))))) .cse57) (or .cse0 (and (forall ((v_subst_4 Int) (v_subst_3 Int)) (let ((.cse63 (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse62 (+ (select .cse63 |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1))) (let ((.cse60 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse63 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse62)))) (let ((.cse58 (let ((.cse61 (store (select .cse60 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset| (mod .cse62 c_~N~0)))) (store .cse61 (+ (* 4 v_subst_4) |c_ULTIMATE.start_main_~a~0#1.offset|) (mod (select (select (store .cse60 |c_ULTIMATE.start_main_~a~0#1.base| .cse61) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0))))) (let ((.cse59 (select (select (store .cse60 |c_ULTIMATE.start_main_~a~0#1.base| .cse58) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (or (= (select (store .cse58 (+ (* 4 v_subst_3) |c_ULTIMATE.start_main_~a~0#1.offset|) (mod .cse59 c_~N~0)) |c_ULTIMATE.start_main_~a~0#1.offset|) 0) (< .cse59 0)))))))) (= (mod (+ .cse1 1) c_~N~0) 0)) (not .cse57)) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (<= |c_ULTIMATE.start_main_~i~0#1| 3) (= .cse1 3))) is different from true [2022-07-22 10:50:39,765 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse62 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse35 (< c_~N~0 0)) (.cse34 (mod .cse62 c_~N~0))) (let ((.cse0 (= .cse34 0)) (.cse1 (< .cse62 0)) (.cse32 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse33 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse4 (not .cse35))) (and (< 2 c_~N~0) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~i~0#1| 0) (or .cse0 (not .cse1) (and (or (forall ((v_subst_2 Int) (v_subst_10 Int)) (= (select (let ((.cse2 (let ((.cse3 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ c_~N~0 (mod (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0))))) (store .cse3 (+ (* v_subst_10 4) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ c_~N~0 (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse3) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0)))))) (store .cse2 (+ (* 4 v_subst_2) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ c_~N~0 (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse2) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0)))) |c_ULTIMATE.start_main_~a~0#1.offset|) 0)) .cse4) (or (let ((.cse31 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store .cse32 .cse33 (+ .cse34 (* (- 1) c_~N~0)))) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse5 (= (mod .cse31 c_~N~0) 0)) (.cse6 (< .cse31 0))) (and (or (and (not .cse5) .cse6) (and (forall ((v_subst_5 Int) (v_subst_3 Int)) (let ((.cse8 (let ((.cse9 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ (mod (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0) (* (- 1) c_~N~0))))) (store .cse9 (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_5)) (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse9) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0))))) (let ((.cse7 (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse8) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0))) (or (not (= .cse7 0)) (= (select (store .cse8 (+ (* 4 v_subst_3) |c_ULTIMATE.start_main_~a~0#1.offset|) .cse7) |c_ULTIMATE.start_main_~a~0#1.offset|) 0))))) (forall ((v_subst_6 Int) (v_subst_1 Int)) (let ((.cse13 (* (- 1) c_~N~0))) (let ((.cse12 (let ((.cse14 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ (mod (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0) .cse13)))) (store .cse14 (+ (* 4 v_subst_6) |c_ULTIMATE.start_main_~a~0#1.offset|) (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse14) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0))))) (let ((.cse11 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse12) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse10 (mod .cse11 c_~N~0))) (or (= .cse10 0) (not (< .cse11 0)) (= (select (store .cse12 (+ (* 4 v_subst_1) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ .cse10 .cse13)) |c_ULTIMATE.start_main_~a~0#1.offset|) 0))))))) (forall ((v_subst_4 Int) (v_subst_3 Int)) (let ((.cse15 (let ((.cse17 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ (mod (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0) (* (- 1) c_~N~0))))) (store .cse17 (+ (* 4 v_subst_4) |c_ULTIMATE.start_main_~a~0#1.offset|) (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse17) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0))))) (let ((.cse16 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse15) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (or (= (select (store .cse15 (+ (* 4 v_subst_3) |c_ULTIMATE.start_main_~a~0#1.offset|) (mod .cse16 c_~N~0)) |c_ULTIMATE.start_main_~a~0#1.offset|) 0) (< .cse16 0))))))) (or .cse5 (not .cse6) (and (forall ((v_subst_7 Int) (v_subst_3 Int)) (let ((.cse19 (let ((.cse21 (* (- 1) c_~N~0))) (let ((.cse20 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ (mod (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0) .cse21)))) (store .cse20 (+ (* 4 v_subst_7) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse20) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0) .cse21)))))) (let ((.cse18 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse19) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (or (< .cse18 0) (= (select (store .cse19 (+ (* 4 v_subst_3) |c_ULTIMATE.start_main_~a~0#1.offset|) (mod .cse18 c_~N~0)) |c_ULTIMATE.start_main_~a~0#1.offset|) 0))))) (forall ((v_subst_8 Int) (v_subst_3 Int)) (let ((.cse23 (let ((.cse25 (* (- 1) c_~N~0))) (let ((.cse24 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ (mod (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0) .cse25)))) (store .cse24 (+ (* 4 v_subst_8) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse24) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0) .cse25)))))) (let ((.cse22 (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse23) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0))) (or (not (= .cse22 0)) (= (select (store .cse23 (+ (* 4 v_subst_3) |c_ULTIMATE.start_main_~a~0#1.offset|) .cse22) |c_ULTIMATE.start_main_~a~0#1.offset|) 0))))) (forall ((v_subst_9 Int) (v_subst_1 Int)) (let ((.cse28 (* (- 1) c_~N~0))) (let ((.cse26 (let ((.cse30 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ (mod (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0) .cse28)))) (store .cse30 (+ (* 4 v_subst_9) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse30) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0) .cse28))))) (let ((.cse29 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse26) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse27 (mod .cse29 c_~N~0))) (or (= (select (store .cse26 (+ (* 4 v_subst_1) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ .cse27 .cse28)) |c_ULTIMATE.start_main_~a~0#1.offset|) 0) (not (< .cse29 0)) (= .cse27 0)))))))))))) .cse35))) (or (and (not .cse0) .cse1) (let ((.cse49 (forall ((v_subst_5 Int) (v_subst_3 Int)) (let ((.cse59 (let ((.cse61 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) (mod (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0)))) (store .cse61 (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_5)) (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse61) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0))))) (let ((.cse60 (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse59) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0))) (or (= (select (store .cse59 (+ (* 4 v_subst_3) |c_ULTIMATE.start_main_~a~0#1.offset|) .cse60) |c_ULTIMATE.start_main_~a~0#1.offset|) 0) (not (= .cse60 0))))))) (.cse50 (forall ((v_subst_4 Int) (v_subst_3 Int)) (let ((.cse56 (let ((.cse58 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) (mod (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0)))) (store .cse58 (+ (* 4 v_subst_4) |c_ULTIMATE.start_main_~a~0#1.offset|) (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse58) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0))))) (let ((.cse57 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse56) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (or (= (select (store .cse56 (+ (* 4 v_subst_3) |c_ULTIMATE.start_main_~a~0#1.offset|) (mod .cse57 c_~N~0)) |c_ULTIMATE.start_main_~a~0#1.offset|) 0) (< .cse57 0))))))) (and (or (let ((.cse55 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store .cse32 .cse33 .cse34)) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse48 (= (mod .cse55 c_~N~0) 0)) (.cse47 (< .cse55 0))) (and (or (and (forall ((v_subst_9 Int) (v_subst_1 Int)) (let ((.cse39 (* (- 1) c_~N~0))) (let ((.cse38 (let ((.cse40 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) (mod (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0)))) (store .cse40 (+ (* 4 v_subst_9) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse40) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0) .cse39))))) (let ((.cse36 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse38) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse37 (mod .cse36 c_~N~0))) (or (not (< .cse36 0)) (= .cse37 0) (= (select (store .cse38 (+ (* 4 v_subst_1) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ .cse37 .cse39)) |c_ULTIMATE.start_main_~a~0#1.offset|) 0))))))) (forall ((v_subst_8 Int) (v_subst_3 Int)) (let ((.cse42 (let ((.cse43 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) (mod (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0)))) (store .cse43 (+ (* 4 v_subst_8) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse43) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0) (* (- 1) c_~N~0)))))) (let ((.cse41 (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse42) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0))) (or (not (= .cse41 0)) (= (select (store .cse42 (+ (* 4 v_subst_3) |c_ULTIMATE.start_main_~a~0#1.offset|) .cse41) |c_ULTIMATE.start_main_~a~0#1.offset|) 0))))) (forall ((v_subst_7 Int) (v_subst_3 Int)) (let ((.cse45 (let ((.cse46 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) (mod (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0)))) (store .cse46 (+ (* 4 v_subst_7) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse46) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0) (* (- 1) c_~N~0)))))) (let ((.cse44 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse45) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (or (< .cse44 0) (= (select (store .cse45 (+ (* 4 v_subst_3) |c_ULTIMATE.start_main_~a~0#1.offset|) (mod .cse44 c_~N~0)) |c_ULTIMATE.start_main_~a~0#1.offset|) 0)))))) (not .cse47) .cse48) (or (and .cse49 .cse50 (forall ((v_subst_6 Int) (v_subst_1 Int)) (let ((.cse51 (let ((.cse54 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) (mod (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0)))) (store .cse54 (+ (* 4 v_subst_6) |c_ULTIMATE.start_main_~a~0#1.offset|) (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse54) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0))))) (let ((.cse53 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse51) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse52 (mod .cse53 c_~N~0))) (or (= (select (store .cse51 (+ (* 4 v_subst_1) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ .cse52 (* (- 1) c_~N~0))) |c_ULTIMATE.start_main_~a~0#1.offset|) 0) (= .cse52 0) (not (< .cse53 0)))))))) (and (not .cse48) .cse47))))) .cse35) (or .cse4 (and .cse49 .cse50))))) (<= c_~N~0 3) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= .cse62 3))))) is different from true [2022-07-22 10:50:41,796 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse49 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse50 (< |c_ULTIMATE.start_main_~i~0#1| c_~N~0))) (and (or (let ((.cse23 (< c_~N~0 0)) (.cse22 (mod .cse49 c_~N~0))) (let ((.cse0 (= .cse22 0)) (.cse1 (< .cse49 0)) (.cse26 (not .cse23)) (.cse21 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (and (or (and (not .cse0) .cse1) (and (or (let ((.cse20 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store .cse21 |c_ULTIMATE.start_main_~a~0#1.offset| .cse22)) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse11 (= (mod .cse20 c_~N~0) 0)) (.cse10 (< .cse20 0))) (and (or (and (forall ((v_subst_5 Int) (v_subst_3 Int)) (let ((.cse2 (let ((.cse4 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset| (mod (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0)))) (store .cse4 (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_5)) (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse4) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0))))) (let ((.cse3 (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse2) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0))) (or (= (select (store .cse2 (+ (* 4 v_subst_3) |c_ULTIMATE.start_main_~a~0#1.offset|) .cse3) |c_ULTIMATE.start_main_~a~0#1.offset|) 0) (not (= .cse3 0)))))) (forall ((v_subst_4 Int) (v_subst_3 Int)) (let ((.cse6 (let ((.cse7 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset| (mod (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0)))) (store .cse7 (+ (* 4 v_subst_4) |c_ULTIMATE.start_main_~a~0#1.offset|) (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse7) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0))))) (let ((.cse5 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse6) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (or (< .cse5 0) (= (select (store .cse6 (+ (* 4 v_subst_3) |c_ULTIMATE.start_main_~a~0#1.offset|) (mod .cse5 c_~N~0)) |c_ULTIMATE.start_main_~a~0#1.offset|) 0))))) (forall ((v_subst_6 Int)) (let ((.cse8 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse9 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset| (mod (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0)))) (store .cse9 (+ (* 4 v_subst_6) |c_ULTIMATE.start_main_~a~0#1.offset|) (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse9) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0)))) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (or (= (mod .cse8 c_~N~0) 0) (not (< .cse8 0)))))) (and .cse10 (not .cse11))) (or .cse11 (not .cse10) (and (forall ((v_subst_7 Int) (v_subst_3 Int)) (let ((.cse13 (let ((.cse14 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset| (mod (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0)))) (store .cse14 (+ (* 4 v_subst_7) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse14) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0) (* (- 1) c_~N~0)))))) (let ((.cse12 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse13) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (or (< .cse12 0) (= (select (store .cse13 (+ (* 4 v_subst_3) |c_ULTIMATE.start_main_~a~0#1.offset|) (mod .cse12 c_~N~0)) |c_ULTIMATE.start_main_~a~0#1.offset|) 0))))) (forall ((v_subst_9 Int)) (let ((.cse15 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse16 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset| (mod (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0)))) (store .cse16 (+ (* 4 v_subst_9) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse16) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0) (* (- 1) c_~N~0))))) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (or (= (mod .cse15 c_~N~0) 0) (not (< .cse15 0))))) (forall ((v_subst_8 Int) (v_subst_3 Int)) (let ((.cse17 (let ((.cse19 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset| (mod (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0)))) (store .cse19 (+ (* 4 v_subst_8) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse19) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0) (* (- 1) c_~N~0)))))) (let ((.cse18 (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse17) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0))) (or (= (select (store .cse17 (+ (* 4 v_subst_3) |c_ULTIMATE.start_main_~a~0#1.offset|) .cse18) |c_ULTIMATE.start_main_~a~0#1.offset|) 0) (not (= .cse18 0))))))))))) .cse23) (or (forall ((v_subst_4 Int) (v_subst_3 Int)) (= (select (let ((.cse24 (let ((.cse25 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset| (mod (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0)))) (store .cse25 (+ (* 4 v_subst_4) |c_ULTIMATE.start_main_~a~0#1.offset|) (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse25) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0))))) (store .cse24 (+ (* 4 v_subst_3) |c_ULTIMATE.start_main_~a~0#1.offset|) (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse24) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0))) |c_ULTIMATE.start_main_~a~0#1.offset|) 0)) .cse26))) (or .cse0 (not .cse1) (let ((.cse48 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store .cse21 |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse22 (* (- 1) c_~N~0)))) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse35 (= (mod .cse48 c_~N~0) 0)) (.cse36 (< .cse48 0))) (and (or (and (forall ((v_subst_5 Int) (v_subst_3 Int)) (let ((.cse28 (let ((.cse29 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset| (+ (mod (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0) (* (- 1) c_~N~0))))) (store .cse29 (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_5)) (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse29) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0))))) (let ((.cse27 (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse28) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0))) (or (not (= .cse27 0)) (= (select (store .cse28 (+ (* 4 v_subst_3) |c_ULTIMATE.start_main_~a~0#1.offset|) .cse27) |c_ULTIMATE.start_main_~a~0#1.offset|) 0))))) (forall ((v_subst_6 Int)) (let ((.cse30 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse31 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset| (+ (mod (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0) (* (- 1) c_~N~0))))) (store .cse31 (+ (* 4 v_subst_6) |c_ULTIMATE.start_main_~a~0#1.offset|) (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse31) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0)))) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (or (= (mod .cse30 c_~N~0) 0) (not (< .cse30 0))))) (forall ((v_subst_4 Int) (v_subst_3 Int)) (let ((.cse32 (let ((.cse34 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset| (+ (mod (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0) (* (- 1) c_~N~0))))) (store .cse34 (+ (* 4 v_subst_4) |c_ULTIMATE.start_main_~a~0#1.offset|) (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse34) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0))))) (let ((.cse33 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse32) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (or (= (select (store .cse32 (+ (* 4 v_subst_3) |c_ULTIMATE.start_main_~a~0#1.offset|) (mod .cse33 c_~N~0)) |c_ULTIMATE.start_main_~a~0#1.offset|) 0) (< .cse33 0)))))) (and (not .cse35) .cse36)) .cse26 (or (and (forall ((v_subst_8 Int) (v_subst_3 Int)) (let ((.cse37 (let ((.cse40 (* (- 1) c_~N~0))) (let ((.cse39 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset| (+ (mod (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0) .cse40)))) (store .cse39 (+ (* 4 v_subst_8) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse39) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0) .cse40)))))) (let ((.cse38 (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse37) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0))) (or (= (select (store .cse37 (+ (* 4 v_subst_3) |c_ULTIMATE.start_main_~a~0#1.offset|) .cse38) |c_ULTIMATE.start_main_~a~0#1.offset|) 0) (not (= .cse38 0)))))) (forall ((v_subst_7 Int) (v_subst_3 Int)) (let ((.cse41 (let ((.cse44 (* (- 1) c_~N~0))) (let ((.cse43 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset| (+ (mod (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0) .cse44)))) (store .cse43 (+ (* 4 v_subst_7) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse43) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0) .cse44)))))) (let ((.cse42 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse41) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (or (= (select (store .cse41 (+ (* 4 v_subst_3) |c_ULTIMATE.start_main_~a~0#1.offset|) (mod .cse42 c_~N~0)) |c_ULTIMATE.start_main_~a~0#1.offset|) 0) (< .cse42 0))))) (forall ((v_subst_9 Int)) (let ((.cse45 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse47 (* (- 1) c_~N~0))) (let ((.cse46 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset| (+ (mod (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0) .cse47)))) (store .cse46 (+ (* 4 v_subst_9) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse46) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0) .cse47))))) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (or (= (mod .cse45 c_~N~0) 0) (not (< .cse45 0)))))) .cse35 (not .cse36))))))))) .cse50) (or (< (+ |c_ULTIMATE.start_main_~i~0#1| 1) c_~N~0) (and (forall ((v_subst_4 Int) (v_subst_3 Int)) (let ((.cse56 (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse55 (+ (select .cse56 |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1))) (let ((.cse53 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse56 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse55)))) (let ((.cse51 (let ((.cse54 (store (select .cse53 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset| (mod .cse55 c_~N~0)))) (store .cse54 (+ (* 4 v_subst_4) |c_ULTIMATE.start_main_~a~0#1.offset|) (mod (select (select (store .cse53 |c_ULTIMATE.start_main_~a~0#1.base| .cse54) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0))))) (let ((.cse52 (select (select (store .cse53 |c_ULTIMATE.start_main_~a~0#1.base| .cse51) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (or (= (select (store .cse51 (+ (* 4 v_subst_3) |c_ULTIMATE.start_main_~a~0#1.offset|) (mod .cse52 c_~N~0)) |c_ULTIMATE.start_main_~a~0#1.offset|) 0) (< .cse52 0)))))))) (= (mod (+ .cse49 1) c_~N~0) 0)) (not .cse50)))) is different from true