./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loops/sum_array-2.i --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/loops/sum_array-2.i -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 84226515a723f10f2a919f265c45890771224ac18b5dd5f986441c53175929f5 --- Real Ultimate output --- This is Ultimate 0.2.2-?-791161d [2022-07-22 15:09:25,909 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-22 15:09:25,910 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-22 15:09:25,928 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-22 15:09:25,929 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-22 15:09:25,930 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-22 15:09:25,931 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-22 15:09:25,932 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-22 15:09:25,933 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-22 15:09:25,933 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-22 15:09:25,934 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-22 15:09:25,935 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-22 15:09:25,935 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-22 15:09:25,936 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-22 15:09:25,937 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-22 15:09:25,937 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-22 15:09:25,938 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-22 15:09:25,940 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-22 15:09:25,944 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-22 15:09:25,947 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-22 15:09:25,950 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-22 15:09:25,952 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-22 15:09:25,952 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-22 15:09:25,953 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-22 15:09:25,954 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-22 15:09:25,959 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-22 15:09:25,962 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-22 15:09:25,962 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-22 15:09:25,963 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-22 15:09:25,964 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-22 15:09:25,964 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-22 15:09:25,965 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-22 15:09:25,966 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-22 15:09:25,966 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-22 15:09:25,967 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-22 15:09:25,968 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-22 15:09:25,969 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-22 15:09:25,969 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-22 15:09:25,969 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-22 15:09:25,970 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-22 15:09:25,970 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-22 15:09:25,972 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-22 15:09:25,973 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-22 15:09:25,995 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-22 15:09:25,997 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-22 15:09:25,998 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-22 15:09:25,998 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-22 15:09:25,999 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-22 15:09:25,999 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-22 15:09:25,999 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-22 15:09:25,999 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-22 15:09:26,000 INFO L138 SettingsManager]: * Use SBE=true [2022-07-22 15:09:26,001 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-22 15:09:26,001 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-22 15:09:26,001 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-22 15:09:26,001 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-22 15:09:26,001 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-22 15:09:26,002 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-22 15:09:26,002 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-22 15:09:26,002 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-22 15:09:26,002 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-22 15:09:26,002 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-22 15:09:26,003 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-22 15:09:26,003 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-22 15:09:26,004 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-22 15:09:26,004 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-22 15:09:26,004 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-22 15:09:26,004 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-22 15:09:26,004 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-22 15:09:26,005 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-22 15:09:26,005 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-22 15:09:26,005 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-22 15:09:26,005 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-22 15:09:26,005 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-22 15:09:26,006 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-22 15:09:26,006 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-22 15:09:26,006 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 -> 84226515a723f10f2a919f265c45890771224ac18b5dd5f986441c53175929f5 [2022-07-22 15:09:26,197 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-22 15:09:26,225 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-22 15:09:26,227 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-22 15:09:26,228 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-22 15:09:26,229 INFO L275 PluginConnector]: CDTParser initialized [2022-07-22 15:09:26,230 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loops/sum_array-2.i [2022-07-22 15:09:26,284 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5047a70e1/5d8fab455e924bc1979039b605de0037/FLAG290fceef2 [2022-07-22 15:09:26,634 INFO L306 CDTParser]: Found 1 translation units. [2022-07-22 15:09:26,634 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops/sum_array-2.i [2022-07-22 15:09:26,638 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5047a70e1/5d8fab455e924bc1979039b605de0037/FLAG290fceef2 [2022-07-22 15:09:27,073 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5047a70e1/5d8fab455e924bc1979039b605de0037 [2022-07-22 15:09:27,076 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-22 15:09:27,078 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-22 15:09:27,081 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-22 15:09:27,081 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-22 15:09:27,084 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-22 15:09:27,085 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 03:09:27" (1/1) ... [2022-07-22 15:09:27,085 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f0286f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 03:09:27, skipping insertion in model container [2022-07-22 15:09:27,086 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 03:09:27" (1/1) ... [2022-07-22 15:09:27,091 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-22 15:09:27,107 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-22 15:09:27,266 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/loops/sum_array-2.i[938,951] [2022-07-22 15:09:27,303 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 15:09:27,308 INFO L203 MainTranslator]: Completed pre-run [2022-07-22 15:09:27,316 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/loops/sum_array-2.i[938,951] [2022-07-22 15:09:27,321 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 15:09:27,329 INFO L208 MainTranslator]: Completed translation [2022-07-22 15:09:27,330 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 03:09:27 WrapperNode [2022-07-22 15:09:27,330 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-22 15:09:27,331 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-22 15:09:27,331 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-22 15:09:27,331 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-22 15:09:27,336 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 03:09:27" (1/1) ... [2022-07-22 15:09:27,347 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 03:09:27" (1/1) ... [2022-07-22 15:09:27,373 INFO L137 Inliner]: procedures = 18, calls = 29, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 101 [2022-07-22 15:09:27,373 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-22 15:09:27,374 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-22 15:09:27,374 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-22 15:09:27,374 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-22 15:09:27,379 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 03:09:27" (1/1) ... [2022-07-22 15:09:27,379 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 03:09:27" (1/1) ... [2022-07-22 15:09:27,383 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 03:09:27" (1/1) ... [2022-07-22 15:09:27,384 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 03:09:27" (1/1) ... [2022-07-22 15:09:27,390 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 03:09:27" (1/1) ... [2022-07-22 15:09:27,399 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 03:09:27" (1/1) ... [2022-07-22 15:09:27,400 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 03:09:27" (1/1) ... [2022-07-22 15:09:27,402 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-22 15:09:27,402 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-22 15:09:27,403 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-22 15:09:27,403 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-22 15:09:27,404 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 03:09:27" (1/1) ... [2022-07-22 15:09:27,423 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-22 15:09:27,432 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 15:09:27,442 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 15:09:27,461 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-22 15:09:27,472 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-22 15:09:27,472 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-22 15:09:27,473 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-22 15:09:27,473 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-22 15:09:27,473 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-22 15:09:27,473 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-22 15:09:27,473 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-22 15:09:27,473 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-22 15:09:27,518 INFO L234 CfgBuilder]: Building ICFG [2022-07-22 15:09:27,519 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-22 15:09:27,658 INFO L275 CfgBuilder]: Performing block encoding [2022-07-22 15:09:27,662 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-22 15:09:27,663 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-07-22 15:09:27,664 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 03:09:27 BoogieIcfgContainer [2022-07-22 15:09:27,665 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-22 15:09:27,666 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-22 15:09:27,666 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-22 15:09:27,669 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-22 15:09:27,669 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.07 03:09:27" (1/3) ... [2022-07-22 15:09:27,670 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@292c6b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 03:09:27, skipping insertion in model container [2022-07-22 15:09:27,670 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 03:09:27" (2/3) ... [2022-07-22 15:09:27,670 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@292c6b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 03:09:27, skipping insertion in model container [2022-07-22 15:09:27,671 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 03:09:27" (3/3) ... [2022-07-22 15:09:27,672 INFO L111 eAbstractionObserver]: Analyzing ICFG sum_array-2.i [2022-07-22 15:09:27,683 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-22 15:09:27,684 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-22 15:09:27,718 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-22 15:09:27,723 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@13b885dd, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@285bfec [2022-07-22 15:09:27,723 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-22 15:09:27,726 INFO L276 IsEmpty]: Start isEmpty. Operand has 23 states, 21 states have (on average 1.5714285714285714) internal successors, (33), 22 states have internal predecessors, (33), 0 states have call successors, (0), 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 15:09:27,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-22 15:09:27,731 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 15:09:27,732 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 15:09:27,732 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 15:09:27,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 15:09:27,736 INFO L85 PathProgramCache]: Analyzing trace with hash -1741268329, now seen corresponding path program 1 times [2022-07-22 15:09:27,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 15:09:27,744 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604952135] [2022-07-22 15:09:27,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 15:09:27,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 15:09:27,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 15:09:27,852 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 15:09:27,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 15:09:27,853 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604952135] [2022-07-22 15:09:27,854 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1604952135] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 15:09:27,854 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 15:09:27,854 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-22 15:09:27,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197214066] [2022-07-22 15:09:27,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 15:09:27,859 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-22 15:09:27,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 15:09:27,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-22 15:09:27,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-22 15:09:27,881 INFO L87 Difference]: Start difference. First operand has 23 states, 21 states have (on average 1.5714285714285714) internal successors, (33), 22 states have internal predecessors, (33), 0 states have call successors, (0), 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 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 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 15:09:27,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 15:09:27,891 INFO L93 Difference]: Finished difference Result 41 states and 58 transitions. [2022-07-22 15:09:27,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-22 15:09:27,893 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 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 11 [2022-07-22 15:09:27,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 15:09:27,899 INFO L225 Difference]: With dead ends: 41 [2022-07-22 15:09:27,899 INFO L226 Difference]: Without dead ends: 19 [2022-07-22 15:09:27,901 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 15:09:27,904 INFO L413 NwaCegarLoop]: 28 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, 28 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 15:09:27,905 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 15:09:27,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-07-22 15:09:27,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2022-07-22 15:09:27,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 18 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 15:09:27,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 22 transitions. [2022-07-22 15:09:27,929 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 22 transitions. Word has length 11 [2022-07-22 15:09:27,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 15:09:27,930 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 22 transitions. [2022-07-22 15:09:27,931 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 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 15:09:27,931 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2022-07-22 15:09:27,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-22 15:09:27,932 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 15:09:27,932 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 15:09:27,933 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-22 15:09:27,933 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 15:09:27,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 15:09:27,934 INFO L85 PathProgramCache]: Analyzing trace with hash -217285445, now seen corresponding path program 1 times [2022-07-22 15:09:27,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 15:09:27,935 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165832191] [2022-07-22 15:09:27,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 15:09:27,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 15:09:27,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 15:09:28,032 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 15:09:28,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 15:09:28,033 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165832191] [2022-07-22 15:09:28,033 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1165832191] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 15:09:28,033 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 15:09:28,033 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 15:09:28,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304690846] [2022-07-22 15:09:28,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 15:09:28,034 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-22 15:09:28,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 15:09:28,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 15:09:28,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 15:09:28,036 INFO L87 Difference]: Start difference. First operand 19 states and 22 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 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 15:09:28,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 15:09:28,098 INFO L93 Difference]: Finished difference Result 52 states and 62 transitions. [2022-07-22 15:09:28,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 15:09:28,099 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 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 11 [2022-07-22 15:09:28,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 15:09:28,100 INFO L225 Difference]: With dead ends: 52 [2022-07-22 15:09:28,100 INFO L226 Difference]: Without dead ends: 33 [2022-07-22 15:09:28,100 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-22 15:09:28,101 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 15 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 15:09:28,102 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 28 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 15:09:28,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-07-22 15:09:28,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 22. [2022-07-22 15:09:28,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 21 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 15:09:28,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2022-07-22 15:09:28,107 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 25 transitions. Word has length 11 [2022-07-22 15:09:28,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 15:09:28,107 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 25 transitions. [2022-07-22 15:09:28,107 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 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 15:09:28,107 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2022-07-22 15:09:28,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-07-22 15:09:28,108 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 15:09:28,108 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 15:09:28,108 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-22 15:09:28,109 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 15:09:28,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 15:09:28,109 INFO L85 PathProgramCache]: Analyzing trace with hash -2020776544, now seen corresponding path program 1 times [2022-07-22 15:09:28,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 15:09:28,110 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2441826] [2022-07-22 15:09:28,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 15:09:28,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 15:09:28,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 15:09:29,131 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-22 15:09:29,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 15:09:29,132 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2441826] [2022-07-22 15:09:29,132 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2441826] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 15:09:29,132 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1947732129] [2022-07-22 15:09:29,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 15:09:29,133 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 15:09:29,133 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 15:09:29,160 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 15:09:29,163 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 15:09:29,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 15:09:29,224 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 29 conjunts are in the unsatisfiable core [2022-07-22 15:09:29,230 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 15:09:29,270 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 14 treesize of output 12 [2022-07-22 15:09:29,359 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-22 15:09:29,362 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 1 case distinctions, treesize of input 21 treesize of output 24 [2022-07-22 15:09:29,468 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-22 15:09:29,469 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 15:09:29,667 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 15:09:29,667 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 195 treesize of output 199 [2022-07-22 15:09:30,112 INFO L356 Elim1Store]: treesize reduction 14, result has 6.7 percent of original size [2022-07-22 15:09:30,112 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 214 treesize of output 156 [2022-07-22 15:09:30,122 INFO L356 Elim1Store]: treesize reduction 14, result has 6.7 percent of original size [2022-07-22 15:09:30,123 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 184 treesize of output 135 [2022-07-22 15:09:30,132 INFO L356 Elim1Store]: treesize reduction 14, result has 6.7 percent of original size [2022-07-22 15:09:30,133 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 113 treesize of output 82 [2022-07-22 15:09:30,143 INFO L356 Elim1Store]: treesize reduction 7, result has 50.0 percent of original size [2022-07-22 15:09:30,143 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 104 treesize of output 85 [2022-07-22 15:09:30,158 INFO L356 Elim1Store]: treesize reduction 7, result has 50.0 percent of original size [2022-07-22 15:09:30,159 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 261 treesize of output 200 [2022-07-22 15:09:30,177 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 15:09:30,178 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 158 treesize of output 130 [2022-07-22 15:09:30,205 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 15:09:30,205 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 62 [2022-07-22 15:09:30,227 INFO L356 Elim1Store]: treesize reduction 7, result has 50.0 percent of original size [2022-07-22 15:09:30,228 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 104 treesize of output 83 [2022-07-22 15:09:30,235 INFO L356 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2022-07-22 15:09:30,236 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 196 treesize of output 1 [2022-07-22 15:09:30,241 INFO L356 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2022-07-22 15:09:30,241 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 1 [2022-07-22 15:09:30,247 INFO L356 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2022-07-22 15:09:30,248 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 169 treesize of output 1 [2022-07-22 15:09:30,593 INFO L356 Elim1Store]: treesize reduction 40, result has 70.8 percent of original size [2022-07-22 15:09:30,593 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 680 treesize of output 456 [2022-07-22 15:09:32,505 INFO L356 Elim1Store]: treesize reduction 40, result has 70.8 percent of original size [2022-07-22 15:09:32,505 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 434 treesize of output 326 [2022-07-22 15:09:33,401 INFO L356 Elim1Store]: treesize reduction 33, result has 74.4 percent of original size [2022-07-22 15:09:33,402 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 231 treesize of output 220 [2022-07-22 15:09:33,514 INFO L356 Elim1Store]: treesize reduction 108, result has 16.3 percent of original size [2022-07-22 15:09:33,514 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 172 treesize of output 112 [2022-07-22 15:09:33,565 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 15:09:33,566 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 569 treesize of output 433 [2022-07-22 15:09:34,880 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 15:09:34,880 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 569 treesize of output 433 [2022-07-22 15:09:35,349 INFO L356 Elim1Store]: treesize reduction 128, result has 0.8 percent of original size [2022-07-22 15:09:35,349 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 402 treesize of output 1 [2022-07-22 15:09:35,356 INFO L356 Elim1Store]: treesize reduction 128, result has 0.8 percent of original size [2022-07-22 15:09:35,356 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 799 treesize of output 1 [2022-07-22 15:09:35,361 INFO L356 Elim1Store]: treesize reduction 128, result has 0.8 percent of original size [2022-07-22 15:09:35,361 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 60 treesize of output 1 [2022-07-22 15:09:35,367 INFO L356 Elim1Store]: treesize reduction 128, result has 0.8 percent of original size [2022-07-22 15:09:35,368 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 231 treesize of output 1 [2022-07-22 15:09:35,374 INFO L356 Elim1Store]: treesize reduction 128, result has 0.8 percent of original size [2022-07-22 15:09:35,375 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 628 treesize of output 1 [2022-07-22 15:09:35,414 INFO L356 Elim1Store]: treesize reduction 128, result has 0.8 percent of original size [2022-07-22 15:09:35,414 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 231 treesize of output 1 [2022-07-22 15:09:35,420 INFO L356 Elim1Store]: treesize reduction 128, result has 0.8 percent of original size [2022-07-22 15:09:35,420 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 402 treesize of output 1 [2022-07-22 15:09:35,426 INFO L356 Elim1Store]: treesize reduction 128, result has 0.8 percent of original size [2022-07-22 15:09:35,427 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 799 treesize of output 1 [2022-07-22 15:09:35,432 INFO L356 Elim1Store]: treesize reduction 128, result has 0.8 percent of original size [2022-07-22 15:09:35,433 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 60 treesize of output 1 [2022-07-22 15:09:35,438 INFO L356 Elim1Store]: treesize reduction 128, result has 0.8 percent of original size [2022-07-22 15:09:35,438 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 231 treesize of output 1 [2022-07-22 15:09:35,444 INFO L356 Elim1Store]: treesize reduction 128, result has 0.8 percent of original size [2022-07-22 15:09:35,446 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 628 treesize of output 1 [2022-07-22 15:09:35,453 INFO L356 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2022-07-22 15:09:35,454 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 104 treesize of output 1 [2022-07-22 15:09:35,458 INFO L356 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2022-07-22 15:09:35,458 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 1 [2022-07-22 15:09:35,462 INFO L356 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2022-07-22 15:09:35,462 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 196 treesize of output 1 [2022-07-22 15:09:35,466 INFO L356 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2022-07-22 15:09:35,466 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 104 treesize of output 1 [2022-07-22 15:09:35,471 INFO L356 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2022-07-22 15:09:35,471 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 261 treesize of output 1 [2022-07-22 15:09:35,476 INFO L356 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2022-07-22 15:09:35,477 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 169 treesize of output 1 [2022-07-22 15:09:35,497 INFO L356 Elim1Store]: treesize reduction 84, result has 1.2 percent of original size [2022-07-22 15:09:35,498 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 169 treesize of output 1 [2022-07-22 15:09:35,502 INFO L356 Elim1Store]: treesize reduction 84, result has 1.2 percent of original size [2022-07-22 15:09:35,502 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 38 treesize of output 1 [2022-07-22 15:09:35,507 INFO L356 Elim1Store]: treesize reduction 84, result has 1.2 percent of original size [2022-07-22 15:09:35,507 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 104 treesize of output 1 [2022-07-22 15:09:35,511 INFO L356 Elim1Store]: treesize reduction 84, result has 1.2 percent of original size [2022-07-22 15:09:35,511 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 261 treesize of output 1 [2022-07-22 15:09:35,516 INFO L356 Elim1Store]: treesize reduction 84, result has 1.2 percent of original size [2022-07-22 15:09:35,516 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 196 treesize of output 1 [2022-07-22 15:09:35,521 INFO L356 Elim1Store]: treesize reduction 84, result has 1.2 percent of original size [2022-07-22 15:09:35,521 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 104 treesize of output 1 [2022-07-22 15:09:35,531 INFO L356 Elim1Store]: treesize reduction 128, result has 0.8 percent of original size [2022-07-22 15:09:35,531 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 60 treesize of output 1 [2022-07-22 15:09:35,536 INFO L356 Elim1Store]: treesize reduction 128, result has 0.8 percent of original size [2022-07-22 15:09:35,536 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 231 treesize of output 1 [2022-07-22 15:09:35,543 INFO L356 Elim1Store]: treesize reduction 128, result has 0.8 percent of original size [2022-07-22 15:09:35,544 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 402 treesize of output 1 [2022-07-22 15:09:35,549 INFO L356 Elim1Store]: treesize reduction 128, result has 0.8 percent of original size [2022-07-22 15:09:35,549 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 231 treesize of output 1 [2022-07-22 15:09:35,556 INFO L356 Elim1Store]: treesize reduction 128, result has 0.8 percent of original size [2022-07-22 15:09:35,557 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 799 treesize of output 1 [2022-07-22 15:09:35,562 INFO L356 Elim1Store]: treesize reduction 128, result has 0.8 percent of original size [2022-07-22 15:09:35,563 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 628 treesize of output 1 [2022-07-22 15:09:35,605 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-22 15:09:35,605 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1947732129] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 15:09:35,605 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 15:09:35,607 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 7] total 18 [2022-07-22 15:09:35,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945990934] [2022-07-22 15:09:35,607 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 15:09:35,609 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-07-22 15:09:35,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 15:09:35,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-07-22 15:09:35,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=247, Unknown=0, NotChecked=0, Total=306 [2022-07-22 15:09:35,611 INFO L87 Difference]: Start difference. First operand 22 states and 25 transitions. Second operand has 18 states, 18 states have (on average 2.3333333333333335) internal successors, (42), 18 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 15:09:36,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 15:09:36,109 INFO L93 Difference]: Finished difference Result 52 states and 59 transitions. [2022-07-22 15:09:36,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-22 15:09:36,110 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.3333333333333335) internal successors, (42), 18 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 19 [2022-07-22 15:09:36,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 15:09:36,112 INFO L225 Difference]: With dead ends: 52 [2022-07-22 15:09:36,112 INFO L226 Difference]: Without dead ends: 35 [2022-07-22 15:09:36,113 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=182, Invalid=574, Unknown=0, NotChecked=0, Total=756 [2022-07-22 15:09:36,115 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 70 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-22 15:09:36,116 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 86 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-22 15:09:36,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-07-22 15:09:36,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 27. [2022-07-22 15:09:36,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 26 states have internal predecessors, (30), 0 states have call successors, (0), 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 15:09:36,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2022-07-22 15:09:36,123 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 19 [2022-07-22 15:09:36,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 15:09:36,123 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2022-07-22 15:09:36,123 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.3333333333333335) internal successors, (42), 18 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 15:09:36,123 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2022-07-22 15:09:36,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-07-22 15:09:36,124 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 15:09:36,124 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 15:09:36,146 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 15:09:36,343 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 15:09:36,344 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 15:09:36,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 15:09:36,345 INFO L85 PathProgramCache]: Analyzing trace with hash -224460496, now seen corresponding path program 1 times [2022-07-22 15:09:36,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 15:09:36,346 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647442137] [2022-07-22 15:09:36,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 15:09:36,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 15:09:36,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 15:09:36,458 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-22 15:09:36,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 15:09:36,459 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647442137] [2022-07-22 15:09:36,459 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [647442137] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 15:09:36,459 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1617201859] [2022-07-22 15:09:36,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 15:09:36,459 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 15:09:36,459 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 15:09:36,476 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 15:09:36,513 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 15:09:36,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 15:09:36,546 INFO L263 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-22 15:09:36,555 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 15:09:36,610 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-22 15:09:36,610 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 15:09:36,671 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-22 15:09:36,672 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1617201859] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 15:09:36,672 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 15:09:36,672 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 13 [2022-07-22 15:09:36,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945960235] [2022-07-22 15:09:36,672 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 15:09:36,672 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-22 15:09:36,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 15:09:36,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-22 15:09:36,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2022-07-22 15:09:36,674 INFO L87 Difference]: Start difference. First operand 27 states and 30 transitions. Second operand has 13 states, 13 states have (on average 3.076923076923077) internal successors, (40), 13 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 15:09:36,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 15:09:36,845 INFO L93 Difference]: Finished difference Result 65 states and 74 transitions. [2022-07-22 15:09:36,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-22 15:09:36,846 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.076923076923077) internal successors, (40), 13 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-07-22 15:09:36,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 15:09:36,846 INFO L225 Difference]: With dead ends: 65 [2022-07-22 15:09:36,846 INFO L226 Difference]: Without dead ends: 52 [2022-07-22 15:09:36,847 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 46 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=76, Invalid=196, Unknown=0, NotChecked=0, Total=272 [2022-07-22 15:09:36,847 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 92 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 15:09:36,847 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 56 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 15:09:36,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-07-22 15:09:36,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 32. [2022-07-22 15:09:36,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 31 states have (on average 1.1290322580645162) internal successors, (35), 31 states have internal predecessors, (35), 0 states have call successors, (0), 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 15:09:36,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2022-07-22 15:09:36,852 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 26 [2022-07-22 15:09:36,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 15:09:36,852 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 35 transitions. [2022-07-22 15:09:36,852 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.076923076923077) internal successors, (40), 13 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 15:09:36,853 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2022-07-22 15:09:36,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-07-22 15:09:36,853 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 15:09:36,853 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 15:09:36,873 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 15:09:37,053 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 15:09:37,054 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 15:09:37,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 15:09:37,054 INFO L85 PathProgramCache]: Analyzing trace with hash 1108233645, now seen corresponding path program 2 times [2022-07-22 15:09:37,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 15:09:37,055 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903491012] [2022-07-22 15:09:37,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 15:09:37,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 15:09:37,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 15:09:38,065 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 15:09:38,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 15:09:38,065 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903491012] [2022-07-22 15:09:38,065 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [903491012] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 15:09:38,065 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [74067701] [2022-07-22 15:09:38,065 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-22 15:09:38,066 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 15:09:38,066 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 15:09:38,080 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 15:09:38,100 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 15:09:38,159 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-22 15:09:38,159 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 15:09:38,161 INFO L263 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 36 conjunts are in the unsatisfiable core [2022-07-22 15:09:38,164 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 15:09:38,172 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 14 treesize of output 12 [2022-07-22 15:09:38,282 INFO L356 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-07-22 15:09:38,282 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 1 case distinctions, treesize of input 27 treesize of output 30 [2022-07-22 15:09:38,436 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-22 15:09:38,436 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 15:09:38,707 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 15:09:38,707 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 219 treesize of output 223 [2022-07-22 15:09:38,947 INFO L356 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-07-22 15:09:38,947 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 125 treesize of output 90 [2022-07-22 15:09:38,956 INFO L356 Elim1Store]: treesize reduction 9, result has 43.8 percent of original size [2022-07-22 15:09:38,957 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 116 treesize of output 95 [2022-07-22 15:09:38,969 INFO L356 Elim1Store]: treesize reduction 9, result has 43.8 percent of original size [2022-07-22 15:09:38,970 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 285 treesize of output 220 [2022-07-22 15:09:38,983 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 15:09:38,983 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 170 treesize of output 142 [2022-07-22 15:09:39,007 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 15:09:39,008 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 71 treesize of output 68 [2022-07-22 15:09:39,026 INFO L356 Elim1Store]: treesize reduction 9, result has 43.8 percent of original size [2022-07-22 15:09:39,027 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 40 [2022-07-22 15:09:39,038 INFO L356 Elim1Store]: treesize reduction 9, result has 43.8 percent of original size [2022-07-22 15:09:39,038 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 116 treesize of output 91 [2022-07-22 15:09:39,045 INFO L356 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-07-22 15:09:39,045 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 214 treesize of output 1 [2022-07-22 15:09:39,050 INFO L356 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-07-22 15:09:39,052 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 187 treesize of output 1 [2022-07-22 15:09:39,526 INFO L356 Elim1Store]: treesize reduction 64, result has 60.2 percent of original size [2022-07-22 15:09:39,527 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 504 treesize of output 354 [2022-07-22 15:09:40,706 INFO L356 Elim1Store]: treesize reduction 64, result has 60.2 percent of original size [2022-07-22 15:09:40,707 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 291 treesize of output 245 [2022-07-22 15:09:41,188 INFO L356 Elim1Store]: treesize reduction 64, result has 60.2 percent of original size [2022-07-22 15:09:41,189 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 697 treesize of output 461 [2022-07-22 15:09:41,600 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-07-22 15:09:41,674 INFO L356 Elim1Store]: treesize reduction 49, result has 68.0 percent of original size [2022-07-22 15:09:41,674 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 921 treesize of output 588 [2022-07-22 15:09:41,988 INFO L356 Elim1Store]: treesize reduction 132, result has 13.7 percent of original size [2022-07-22 15:09:41,989 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 649 treesize of output 365 [2022-07-22 15:09:42,045 INFO L356 Elim1Store]: treesize reduction 132, result has 13.7 percent of original size [2022-07-22 15:09:42,046 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 200 treesize of output 124 [2022-07-22 15:09:42,073 INFO L356 Elim1Store]: treesize reduction 152, result has 0.7 percent of original size [2022-07-22 15:09:42,073 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 273 treesize of output 1 [2022-07-22 15:09:42,150 INFO L356 Elim1Store]: treesize reduction 49, result has 68.0 percent of original size [2022-07-22 15:09:42,151 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 921 treesize of output 588 [2022-07-22 15:09:42,507 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-07-22 15:09:42,539 INFO L356 Elim1Store]: treesize reduction 120, result has 21.6 percent of original size [2022-07-22 15:09:42,540 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 450 treesize of output 274 [2022-07-22 15:09:42,571 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-07-22 15:09:42,578 INFO L356 Elim1Store]: treesize reduction 152, result has 0.7 percent of original size [2022-07-22 15:09:42,578 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 273 treesize of output 1 [2022-07-22 15:09:42,580 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-07-22 15:09:42,586 INFO L356 Elim1Store]: treesize reduction 152, result has 0.7 percent of original size [2022-07-22 15:09:42,586 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 273 treesize of output 1 [2022-07-22 15:09:42,591 INFO L356 Elim1Store]: treesize reduction 152, result has 0.7 percent of original size [2022-07-22 15:09:42,591 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 74 treesize of output 1 [2022-07-22 15:09:42,598 INFO L356 Elim1Store]: treesize reduction 152, result has 0.7 percent of original size [2022-07-22 15:09:42,598 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 722 treesize of output 1 [2022-07-22 15:09:42,601 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-07-22 15:09:42,607 INFO L356 Elim1Store]: treesize reduction 152, result has 0.7 percent of original size [2022-07-22 15:09:42,608 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 472 treesize of output 1 [2022-07-22 15:09:42,631 INFO L356 Elim1Store]: treesize reduction 152, result has 0.7 percent of original size [2022-07-22 15:09:42,632 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 921 treesize of output 1 [2022-07-22 15:09:42,635 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-07-22 15:09:42,640 INFO L356 Elim1Store]: treesize reduction 152, result has 0.7 percent of original size [2022-07-22 15:09:42,641 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 273 treesize of output 1 [2022-07-22 15:09:42,643 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-07-22 15:09:42,649 INFO L356 Elim1Store]: treesize reduction 152, result has 0.7 percent of original size [2022-07-22 15:09:42,650 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 273 treesize of output 1 [2022-07-22 15:09:42,654 INFO L356 Elim1Store]: treesize reduction 152, result has 0.7 percent of original size [2022-07-22 15:09:42,654 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 74 treesize of output 1 [2022-07-22 15:09:42,660 INFO L356 Elim1Store]: treesize reduction 152, result has 0.7 percent of original size [2022-07-22 15:09:42,660 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 722 treesize of output 1 [2022-07-22 15:09:42,664 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-07-22 15:09:42,670 INFO L356 Elim1Store]: treesize reduction 152, result has 0.7 percent of original size [2022-07-22 15:09:42,670 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 472 treesize of output 1 [2022-07-22 15:09:42,680 INFO L356 Elim1Store]: treesize reduction 96, result has 1.0 percent of original size [2022-07-22 15:09:42,680 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 285 treesize of output 1 [2022-07-22 15:09:42,685 INFO L356 Elim1Store]: treesize reduction 96, result has 1.0 percent of original size [2022-07-22 15:09:42,685 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 116 treesize of output 1 [2022-07-22 15:09:42,690 INFO L356 Elim1Store]: treesize reduction 96, result has 1.0 percent of original size [2022-07-22 15:09:42,690 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 44 treesize of output 1 [2022-07-22 15:09:42,695 INFO L356 Elim1Store]: treesize reduction 96, result has 1.0 percent of original size [2022-07-22 15:09:42,696 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 116 treesize of output 1 [2022-07-22 15:09:42,701 INFO L356 Elim1Store]: treesize reduction 96, result has 1.0 percent of original size [2022-07-22 15:09:42,701 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 214 treesize of output 1 [2022-07-22 15:09:42,706 INFO L356 Elim1Store]: treesize reduction 96, result has 1.0 percent of original size [2022-07-22 15:09:42,706 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 187 treesize of output 1 [2022-07-22 15:09:42,736 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-07-22 15:09:42,741 INFO L356 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-07-22 15:09:42,742 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 116 treesize of output 1 [2022-07-22 15:09:42,744 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-07-22 15:09:42,750 INFO L356 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-07-22 15:09:42,750 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 285 treesize of output 1 [2022-07-22 15:09:42,883 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-07-22 15:09:42,883 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [74067701] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 15:09:42,883 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 15:09:42,883 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 9, 9] total 28 [2022-07-22 15:09:42,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481524260] [2022-07-22 15:09:42,884 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 15:09:42,885 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-07-22 15:09:42,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 15:09:42,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-07-22 15:09:42,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=654, Unknown=0, NotChecked=0, Total=756 [2022-07-22 15:09:42,889 INFO L87 Difference]: Start difference. First operand 32 states and 35 transitions. Second operand has 28 states, 28 states have (on average 2.642857142857143) internal successors, (74), 28 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 15:09:44,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 15:09:44,543 INFO L93 Difference]: Finished difference Result 83 states and 92 transitions. [2022-07-22 15:09:44,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-07-22 15:09:44,544 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 2.642857142857143) internal successors, (74), 28 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-07-22 15:09:44,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 15:09:44,544 INFO L225 Difference]: With dead ends: 83 [2022-07-22 15:09:44,544 INFO L226 Difference]: Without dead ends: 57 [2022-07-22 15:09:44,545 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 590 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=542, Invalid=2214, Unknown=0, NotChecked=0, Total=2756 [2022-07-22 15:09:44,546 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 214 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 340 mSolverCounterSat, 172 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 512 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 172 IncrementalHoareTripleChecker+Valid, 340 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-22 15:09:44,546 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 144 Invalid, 512 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [172 Valid, 340 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-22 15:09:44,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-07-22 15:09:44,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 44. [2022-07-22 15:09:44,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 43 states have (on average 1.0930232558139534) internal successors, (47), 43 states have internal predecessors, (47), 0 states have call successors, (0), 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 15:09:44,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 47 transitions. [2022-07-22 15:09:44,554 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 47 transitions. Word has length 31 [2022-07-22 15:09:44,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 15:09:44,554 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 47 transitions. [2022-07-22 15:09:44,554 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 2.642857142857143) internal successors, (74), 28 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 15:09:44,555 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 47 transitions. [2022-07-22 15:09:44,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-07-22 15:09:44,556 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 15:09:44,556 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 15:09:44,576 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 15:09:44,773 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 15:09:44,773 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 15:09:44,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 15:09:44,774 INFO L85 PathProgramCache]: Analyzing trace with hash 1732581416, now seen corresponding path program 3 times [2022-07-22 15:09:44,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 15:09:44,774 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22705597] [2022-07-22 15:09:44,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 15:09:44,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 15:09:44,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 15:09:45,731 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-22 15:09:45,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 15:09:45,731 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22705597] [2022-07-22 15:09:45,731 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [22705597] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 15:09:45,731 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1436115940] [2022-07-22 15:09:45,732 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-22 15:09:45,732 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 15:09:45,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 15:09:45,736 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 15:09:45,737 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 15:09:46,030 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-07-22 15:09:46,030 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 15:09:46,032 INFO L263 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 50 conjunts are in the unsatisfiable core [2022-07-22 15:09:46,036 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 15:09:46,041 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 14 treesize of output 12 [2022-07-22 15:09:46,311 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-22 15:09:46,312 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 116 treesize of output 113 [2022-07-22 15:09:46,317 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:09:46,317 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 87 [2022-07-22 15:09:46,333 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:09:46,335 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 60 treesize of output 11 [2022-07-22 15:09:46,768 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 15:09:46,772 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 15:09:46,772 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 2 disjoint index pairs (out of 15 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 74 treesize of output 34 [2022-07-22 15:09:46,821 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-07-22 15:09:46,821 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 15:09:47,135 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 15:09:47,136 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 219 treesize of output 223 [2022-07-22 15:09:47,224 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 15:09:47,224 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 314 treesize of output 258 [2022-07-22 15:09:47,292 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 15:09:47,293 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 338 treesize of output 258 [2022-07-22 15:09:47,489 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 15:09:47,489 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 414 treesize of output 374 [2022-07-22 15:09:49,277 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:09:49,282 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:09:49,283 INFO L356 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-07-22 15:09:49,284 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 348 treesize of output 1 [2022-07-22 15:09:49,287 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:09:49,287 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 15:09:49,291 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:09:49,293 INFO L356 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-07-22 15:09:49,293 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 96 treesize of output 1 [2022-07-22 15:09:49,295 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:09:49,296 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 15:09:49,297 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:09:49,298 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2022-07-22 15:09:49,318 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:09:49,320 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:09:49,320 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 1 [2022-07-22 15:09:49,344 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:09:49,348 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:09:49,350 INFO L356 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-07-22 15:09:49,350 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 96 treesize of output 1 [2022-07-22 15:09:49,353 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:09:49,355 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:09:49,356 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2022-07-22 15:09:49,360 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:09:49,365 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:09:49,367 INFO L356 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-07-22 15:09:49,367 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 272 treesize of output 1 [2022-07-22 15:09:49,374 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 15:09:49,378 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 15:09:49,380 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 15:09:49,414 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 15:09:49,414 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 77 treesize of output 165 [2022-07-22 15:09:49,741 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:09:49,744 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 56 [2022-07-22 15:09:49,748 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:09:49,753 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:09:49,754 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 158 treesize of output 106 [2022-07-22 15:09:49,757 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:09:49,762 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:09:49,762 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 56 [2022-07-22 15:09:49,765 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:09:49,770 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:09:49,773 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 20 [2022-07-22 15:09:49,776 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:09:49,781 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:09:49,782 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 213 treesize of output 141 [2022-07-22 15:09:49,785 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:09:49,793 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:09:49,794 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 157 treesize of output 121 [2022-07-22 15:09:49,800 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:09:49,804 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:09:49,808 INFO L356 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-07-22 15:09:49,809 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 161 treesize of output 1 [2022-07-22 15:09:49,859 INFO L356 Elim1Store]: treesize reduction 41, result has 57.7 percent of original size [2022-07-22 15:09:49,860 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 161 treesize of output 144 [2022-07-22 15:09:49,864 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 15:09:49,882 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 15:09:49,883 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 163 treesize of output 163 [2022-07-22 15:09:49,963 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 15:09:49,965 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 15:09:49,982 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 15:09:49,982 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 168 treesize of output 156 [2022-07-22 15:09:49,986 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 15:09:50,004 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 15:09:50,004 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 165 treesize of output 165 [2022-07-22 15:09:50,096 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:09:50,101 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:09:50,103 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:09:50,106 INFO L356 Elim1Store]: treesize reduction 19, result has 5.0 percent of original size [2022-07-22 15:09:50,106 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 289 treesize of output 1 [2022-07-22 15:09:50,117 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 15:09:50,123 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 15:09:50,124 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 15:09:50,160 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 15:09:50,161 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 227 treesize of output 255 [2022-07-22 15:09:51,474 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 15:09:51,474 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 541 treesize of output 449 [2022-07-22 15:09:53,953 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-07-22 15:09:53,953 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1436115940] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 15:09:53,953 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 15:09:53,953 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 11, 11] total 31 [2022-07-22 15:09:53,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38547136] [2022-07-22 15:09:53,953 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 15:09:53,955 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-07-22 15:09:53,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 15:09:53,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-07-22 15:09:53,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=793, Unknown=0, NotChecked=0, Total=930 [2022-07-22 15:09:53,957 INFO L87 Difference]: Start difference. First operand 44 states and 47 transitions. Second operand has 31 states, 31 states have (on average 3.032258064516129) internal successors, (94), 31 states have internal predecessors, (94), 0 states have call successors, (0), 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 15:09:55,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 15:09:55,054 INFO L93 Difference]: Finished difference Result 89 states and 96 transitions. [2022-07-22 15:09:55,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-07-22 15:09:55,054 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 3.032258064516129) internal successors, (94), 31 states have internal predecessors, (94), 0 states have call successors, (0), 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 43 [2022-07-22 15:09:55,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 15:09:55,057 INFO L225 Difference]: With dead ends: 89 [2022-07-22 15:09:55,057 INFO L226 Difference]: Without dead ends: 87 [2022-07-22 15:09:55,058 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 70 SyntacticMatches, 3 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 407 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=288, Invalid=1518, Unknown=0, NotChecked=0, Total=1806 [2022-07-22 15:09:55,060 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 71 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 403 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 249 SdHoareTripleChecker+Invalid, 472 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 403 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 18 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-22 15:09:55,060 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 249 Invalid, 472 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 403 Invalid, 0 Unknown, 18 Unchecked, 0.4s Time] [2022-07-22 15:09:55,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2022-07-22 15:09:55,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 51. [2022-07-22 15:09:55,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 50 states have (on average 1.1) internal successors, (55), 50 states have internal predecessors, (55), 0 states have call successors, (0), 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 15:09:55,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 55 transitions. [2022-07-22 15:09:55,085 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 55 transitions. Word has length 43 [2022-07-22 15:09:55,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 15:09:55,085 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 55 transitions. [2022-07-22 15:09:55,086 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 3.032258064516129) internal successors, (94), 31 states have internal predecessors, (94), 0 states have call successors, (0), 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 15:09:55,086 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 55 transitions. [2022-07-22 15:09:55,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-07-22 15:09:55,086 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 15:09:55,086 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 15:09:55,107 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-22 15:09:55,295 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 15:09:55,296 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 15:09:55,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 15:09:55,296 INFO L85 PathProgramCache]: Analyzing trace with hash 1620778086, now seen corresponding path program 4 times [2022-07-22 15:09:55,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 15:09:55,296 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041912683] [2022-07-22 15:09:55,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 15:09:55,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 15:09:55,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 15:09:55,565 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 7 proven. 21 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-07-22 15:09:55,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 15:09:55,566 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041912683] [2022-07-22 15:09:55,566 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2041912683] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 15:09:55,566 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1048809670] [2022-07-22 15:09:55,566 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-22 15:09:55,566 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 15:09:55,566 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 15:09:55,567 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 15:09:55,569 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 15:09:55,828 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-22 15:09:55,828 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 15:09:55,831 INFO L263 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 67 conjunts are in the unsatisfiable core [2022-07-22 15:09:55,835 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 15:09:55,844 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-22 15:09:55,844 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 19 [2022-07-22 15:09:55,980 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-22 15:09:56,043 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-22 15:09:56,084 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-22 15:09:56,119 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-22 15:09:56,169 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-22 15:09:56,196 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-22 15:09:56,228 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 30 [2022-07-22 15:09:56,284 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 141 treesize of output 132 [2022-07-22 15:09:56,290 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:09:56,290 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:09:56,296 INFO L356 Elim1Store]: treesize reduction 39, result has 2.5 percent of original size [2022-07-22 15:09:56,296 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 113 [2022-07-22 15:09:56,372 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:09:56,373 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:09:56,381 INFO L356 Elim1Store]: treesize reduction 45, result has 16.7 percent of original size [2022-07-22 15:09:56,381 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 123 treesize of output 65 [2022-07-22 15:10:02,878 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 2 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 15:10:02,878 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 15:10:05,227 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|aux_div_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| Int) (|aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| Int)) (let ((.cse0 (+ (* |aux_div_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| 4294967296) |aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56|))) (or (< |aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| 0) (< 2147483647 .cse0) (< .cse0 0) (< 2147483647 |aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56|) (let ((.cse2 (let ((.cse3 (* (mod |aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| 4294967296) 4))) (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#C~0#1.base|) (+ .cse3 |c_ULTIMATE.start_main_~#C~0#1.offset|) (+ (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#B~0#1.base|) (+ |c_ULTIMATE.start_main_~#B~0#1.offset| .cse3)) (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#A~0#1.base|) (+ |c_ULTIMATE.start_main_~#A~0#1.offset| .cse3))))))) (= (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#C~0#1.base| .cse2))) (+ (select (select .cse1 |c_ULTIMATE.start_main_~#B~0#1.base|) (+ |c_ULTIMATE.start_main_~#B~0#1.offset| 8)) (select (select .cse1 |c_ULTIMATE.start_main_~#A~0#1.base|) (+ |c_ULTIMATE.start_main_~#A~0#1.offset| 8)))) (select .cse2 (+ 8 |c_ULTIMATE.start_main_~#C~0#1.offset|))))))) (forall ((|aux_div_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| Int) (|aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| Int)) (let ((.cse4 (+ (* |aux_div_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| 4294967296) |aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56|))) (or (<= |aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| 2147483647) (<= 4294967296 |aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56|) (<= 4294967296 .cse4) (let ((.cse5 (let ((.cse7 (* (mod |aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| 4294967296) 4))) (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#C~0#1.base|) (+ (- 17179869184) .cse7 |c_ULTIMATE.start_main_~#C~0#1.offset|) (+ (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#B~0#1.base|) (+ |c_ULTIMATE.start_main_~#B~0#1.offset| (- 17179869184) .cse7)) (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#A~0#1.base|) (+ (- 17179869184) |c_ULTIMATE.start_main_~#A~0#1.offset| .cse7))))))) (= (select .cse5 (+ 8 |c_ULTIMATE.start_main_~#C~0#1.offset|)) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~#C~0#1.base| .cse5))) (+ (select (select .cse6 |c_ULTIMATE.start_main_~#A~0#1.base|) (+ |c_ULTIMATE.start_main_~#A~0#1.offset| 8)) (select (select .cse6 |c_ULTIMATE.start_main_~#B~0#1.base|) (+ |c_ULTIMATE.start_main_~#B~0#1.offset| 8)))))) (<= .cse4 2147483647))))) is different from false [2022-07-22 15:10:07,517 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (<= (mod |c_ULTIMATE.start_main_~i~0#1| 4294967296) 2147483647))) (and (or (not .cse0) (and (forall ((|aux_div_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| Int) (|aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| Int)) (let ((.cse7 (+ (* |aux_div_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| 4294967296) |aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56|))) (or (<= |aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| 2147483647) (<= 4294967296 |aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56|) (let ((.cse2 (let ((.cse4 (* (mod |aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| 4294967296) 4)) (.cse3 (let ((.cse6 (* (mod |c_ULTIMATE.start_main_~i~0#1| 4294967296) 4))) (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#C~0#1.base|) (+ .cse6 |c_ULTIMATE.start_main_~#C~0#1.offset|) (+ (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#A~0#1.base|) (+ |c_ULTIMATE.start_main_~#A~0#1.offset| .cse6)) (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#B~0#1.base|) (+ |c_ULTIMATE.start_main_~#B~0#1.offset| .cse6))))))) (store .cse3 (+ (- 17179869184) .cse4 |c_ULTIMATE.start_main_~#C~0#1.offset|) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#C~0#1.base| .cse3))) (+ (select (select .cse5 |c_ULTIMATE.start_main_~#A~0#1.base|) (+ (- 17179869184) |c_ULTIMATE.start_main_~#A~0#1.offset| .cse4)) (select (select .cse5 |c_ULTIMATE.start_main_~#B~0#1.base|) (+ |c_ULTIMATE.start_main_~#B~0#1.offset| (- 17179869184) .cse4)))))))) (= (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#C~0#1.base| .cse2))) (+ (select (select .cse1 |c_ULTIMATE.start_main_~#A~0#1.base|) (+ |c_ULTIMATE.start_main_~#A~0#1.offset| 8)) (select (select .cse1 |c_ULTIMATE.start_main_~#B~0#1.base|) (+ |c_ULTIMATE.start_main_~#B~0#1.offset| 8)))) (select .cse2 (+ 8 |c_ULTIMATE.start_main_~#C~0#1.offset|)))) (<= 4294967296 .cse7) (<= .cse7 2147483647)))) (forall ((|aux_div_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| Int) (|aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| Int)) (let ((.cse8 (+ (* |aux_div_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| 4294967296) |aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56|))) (or (< |aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| 0) (< 2147483647 .cse8) (< .cse8 0) (< 2147483647 |aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56|) (let ((.cse9 (let ((.cse12 (* (mod |aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| 4294967296) 4)) (.cse11 (let ((.cse14 (* (mod |c_ULTIMATE.start_main_~i~0#1| 4294967296) 4))) (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#C~0#1.base|) (+ .cse14 |c_ULTIMATE.start_main_~#C~0#1.offset|) (+ (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#A~0#1.base|) (+ |c_ULTIMATE.start_main_~#A~0#1.offset| .cse14)) (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#B~0#1.base|) (+ |c_ULTIMATE.start_main_~#B~0#1.offset| .cse14))))))) (store .cse11 (+ .cse12 |c_ULTIMATE.start_main_~#C~0#1.offset|) (let ((.cse13 (store |c_#memory_int| |c_ULTIMATE.start_main_~#C~0#1.base| .cse11))) (+ (select (select .cse13 |c_ULTIMATE.start_main_~#B~0#1.base|) (+ |c_ULTIMATE.start_main_~#B~0#1.offset| .cse12)) (select (select .cse13 |c_ULTIMATE.start_main_~#A~0#1.base|) (+ |c_ULTIMATE.start_main_~#A~0#1.offset| .cse12)))))))) (= (select .cse9 (+ 8 |c_ULTIMATE.start_main_~#C~0#1.offset|)) (let ((.cse10 (store |c_#memory_int| |c_ULTIMATE.start_main_~#C~0#1.base| .cse9))) (+ (select (select .cse10 |c_ULTIMATE.start_main_~#A~0#1.base|) (+ |c_ULTIMATE.start_main_~#A~0#1.offset| 8)) (select (select .cse10 |c_ULTIMATE.start_main_~#B~0#1.base|) (+ |c_ULTIMATE.start_main_~#B~0#1.offset| 8))))))))))) (or .cse0 (and (forall ((|aux_div_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| Int) (|aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| Int)) (let ((.cse21 (+ (* |aux_div_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| 4294967296) |aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56|))) (or (let ((.cse16 (let ((.cse18 (* (mod |aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| 4294967296) 4)) (.cse17 (let ((.cse20 (* (mod |c_ULTIMATE.start_main_~i~0#1| 4294967296) 4))) (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#C~0#1.base|) (+ (- 17179869184) .cse20 |c_ULTIMATE.start_main_~#C~0#1.offset|) (+ (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#B~0#1.base|) (+ |c_ULTIMATE.start_main_~#B~0#1.offset| (- 17179869184) .cse20)) (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#A~0#1.base|) (+ (- 17179869184) |c_ULTIMATE.start_main_~#A~0#1.offset| .cse20))))))) (store .cse17 (+ .cse18 |c_ULTIMATE.start_main_~#C~0#1.offset|) (let ((.cse19 (store |c_#memory_int| |c_ULTIMATE.start_main_~#C~0#1.base| .cse17))) (+ (select (select .cse19 |c_ULTIMATE.start_main_~#B~0#1.base|) (+ |c_ULTIMATE.start_main_~#B~0#1.offset| .cse18)) (select (select .cse19 |c_ULTIMATE.start_main_~#A~0#1.base|) (+ |c_ULTIMATE.start_main_~#A~0#1.offset| .cse18)))))))) (= (let ((.cse15 (store |c_#memory_int| |c_ULTIMATE.start_main_~#C~0#1.base| .cse16))) (+ (select (select .cse15 |c_ULTIMATE.start_main_~#A~0#1.base|) (+ |c_ULTIMATE.start_main_~#A~0#1.offset| 8)) (select (select .cse15 |c_ULTIMATE.start_main_~#B~0#1.base|) (+ |c_ULTIMATE.start_main_~#B~0#1.offset| 8)))) (select .cse16 (+ 8 |c_ULTIMATE.start_main_~#C~0#1.offset|)))) (< |aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| 0) (< 2147483647 .cse21) (< .cse21 0) (< 2147483647 |aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56|)))) (forall ((|aux_div_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| Int) (|aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| Int)) (let ((.cse28 (+ (* |aux_div_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| 4294967296) |aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56|))) (or (<= |aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| 2147483647) (<= 4294967296 |aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56|) (let ((.cse22 (let ((.cse25 (* (mod |aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| 4294967296) 4)) (.cse24 (let ((.cse27 (* (mod |c_ULTIMATE.start_main_~i~0#1| 4294967296) 4))) (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#C~0#1.base|) (+ (- 17179869184) .cse27 |c_ULTIMATE.start_main_~#C~0#1.offset|) (+ (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#B~0#1.base|) (+ |c_ULTIMATE.start_main_~#B~0#1.offset| (- 17179869184) .cse27)) (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#A~0#1.base|) (+ (- 17179869184) |c_ULTIMATE.start_main_~#A~0#1.offset| .cse27))))))) (store .cse24 (+ (- 17179869184) .cse25 |c_ULTIMATE.start_main_~#C~0#1.offset|) (let ((.cse26 (store |c_#memory_int| |c_ULTIMATE.start_main_~#C~0#1.base| .cse24))) (+ (select (select .cse26 |c_ULTIMATE.start_main_~#A~0#1.base|) (+ (- 17179869184) |c_ULTIMATE.start_main_~#A~0#1.offset| .cse25)) (select (select .cse26 |c_ULTIMATE.start_main_~#B~0#1.base|) (+ |c_ULTIMATE.start_main_~#B~0#1.offset| (- 17179869184) .cse25)))))))) (= (select .cse22 (+ 8 |c_ULTIMATE.start_main_~#C~0#1.offset|)) (let ((.cse23 (store |c_#memory_int| |c_ULTIMATE.start_main_~#C~0#1.base| .cse22))) (+ (select (select .cse23 |c_ULTIMATE.start_main_~#B~0#1.base|) (+ |c_ULTIMATE.start_main_~#B~0#1.offset| 8)) (select (select .cse23 |c_ULTIMATE.start_main_~#A~0#1.base|) (+ |c_ULTIMATE.start_main_~#A~0#1.offset| 8)))))) (<= 4294967296 .cse28) (<= .cse28 2147483647)))))))) is different from false [2022-07-22 15:10:09,854 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (<= (mod (+ |c_ULTIMATE.start_main_~i~0#1| 1) 4294967296) 2147483647))) (and (or .cse0 (and (forall ((|aux_div_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| Int) (|aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| Int)) (let ((.cse7 (+ (* |aux_div_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| 4294967296) |aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56|))) (or (<= |aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| 2147483647) (<= 4294967296 |aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56|) (let ((.cse1 (let ((.cse4 (* (mod |aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| 4294967296) 4)) (.cse3 (let ((.cse6 (* (mod (+ |c_ULTIMATE.start_main_~i~0#1| 1) 4294967296) 4))) (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#C~0#1.base|) (+ (- 17179869184) .cse6 |c_ULTIMATE.start_main_~#C~0#1.offset|) (+ (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#A~0#1.base|) (+ (- 17179869184) |c_ULTIMATE.start_main_~#A~0#1.offset| .cse6)) (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#B~0#1.base|) (+ |c_ULTIMATE.start_main_~#B~0#1.offset| (- 17179869184) .cse6))))))) (store .cse3 (+ (- 17179869184) .cse4 |c_ULTIMATE.start_main_~#C~0#1.offset|) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#C~0#1.base| .cse3))) (+ (select (select .cse5 |c_ULTIMATE.start_main_~#B~0#1.base|) (+ |c_ULTIMATE.start_main_~#B~0#1.offset| (- 17179869184) .cse4)) (select (select .cse5 |c_ULTIMATE.start_main_~#A~0#1.base|) (+ (- 17179869184) |c_ULTIMATE.start_main_~#A~0#1.offset| .cse4)))))))) (= (select .cse1 (+ 8 |c_ULTIMATE.start_main_~#C~0#1.offset|)) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#C~0#1.base| .cse1))) (+ (select (select .cse2 |c_ULTIMATE.start_main_~#A~0#1.base|) (+ |c_ULTIMATE.start_main_~#A~0#1.offset| 8)) (select (select .cse2 |c_ULTIMATE.start_main_~#B~0#1.base|) (+ |c_ULTIMATE.start_main_~#B~0#1.offset| 8)))))) (<= 4294967296 .cse7) (<= .cse7 2147483647)))) (forall ((|aux_div_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| Int) (|aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| Int)) (let ((.cse14 (+ (* |aux_div_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| 4294967296) |aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56|))) (or (let ((.cse9 (let ((.cse11 (* (mod |aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| 4294967296) 4)) (.cse10 (let ((.cse13 (* (mod (+ |c_ULTIMATE.start_main_~i~0#1| 1) 4294967296) 4))) (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#C~0#1.base|) (+ (- 17179869184) .cse13 |c_ULTIMATE.start_main_~#C~0#1.offset|) (+ (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#A~0#1.base|) (+ (- 17179869184) |c_ULTIMATE.start_main_~#A~0#1.offset| .cse13)) (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#B~0#1.base|) (+ |c_ULTIMATE.start_main_~#B~0#1.offset| (- 17179869184) .cse13))))))) (store .cse10 (+ .cse11 |c_ULTIMATE.start_main_~#C~0#1.offset|) (let ((.cse12 (store |c_#memory_int| |c_ULTIMATE.start_main_~#C~0#1.base| .cse10))) (+ (select (select .cse12 |c_ULTIMATE.start_main_~#A~0#1.base|) (+ |c_ULTIMATE.start_main_~#A~0#1.offset| .cse11)) (select (select .cse12 |c_ULTIMATE.start_main_~#B~0#1.base|) (+ |c_ULTIMATE.start_main_~#B~0#1.offset| .cse11)))))))) (= (let ((.cse8 (store |c_#memory_int| |c_ULTIMATE.start_main_~#C~0#1.base| .cse9))) (+ (select (select .cse8 |c_ULTIMATE.start_main_~#B~0#1.base|) (+ |c_ULTIMATE.start_main_~#B~0#1.offset| 8)) (select (select .cse8 |c_ULTIMATE.start_main_~#A~0#1.base|) (+ |c_ULTIMATE.start_main_~#A~0#1.offset| 8)))) (select .cse9 (+ 8 |c_ULTIMATE.start_main_~#C~0#1.offset|)))) (< |aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| 0) (< 2147483647 .cse14) (< .cse14 0) (< 2147483647 |aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56|)))))) (or (and (forall ((|aux_div_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| Int) (|aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| Int)) (let ((.cse21 (+ (* |aux_div_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| 4294967296) |aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56|))) (or (let ((.cse15 (let ((.cse18 (* (mod |aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| 4294967296) 4)) (.cse17 (let ((.cse20 (* (mod (+ |c_ULTIMATE.start_main_~i~0#1| 1) 4294967296) 4))) (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#C~0#1.base|) (+ .cse20 |c_ULTIMATE.start_main_~#C~0#1.offset|) (+ (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#B~0#1.base|) (+ |c_ULTIMATE.start_main_~#B~0#1.offset| .cse20)) (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#A~0#1.base|) (+ |c_ULTIMATE.start_main_~#A~0#1.offset| .cse20))))))) (store .cse17 (+ .cse18 |c_ULTIMATE.start_main_~#C~0#1.offset|) (let ((.cse19 (store |c_#memory_int| |c_ULTIMATE.start_main_~#C~0#1.base| .cse17))) (+ (select (select .cse19 |c_ULTIMATE.start_main_~#B~0#1.base|) (+ |c_ULTIMATE.start_main_~#B~0#1.offset| .cse18)) (select (select .cse19 |c_ULTIMATE.start_main_~#A~0#1.base|) (+ |c_ULTIMATE.start_main_~#A~0#1.offset| .cse18)))))))) (= (select .cse15 (+ 8 |c_ULTIMATE.start_main_~#C~0#1.offset|)) (let ((.cse16 (store |c_#memory_int| |c_ULTIMATE.start_main_~#C~0#1.base| .cse15))) (+ (select (select .cse16 |c_ULTIMATE.start_main_~#B~0#1.base|) (+ |c_ULTIMATE.start_main_~#B~0#1.offset| 8)) (select (select .cse16 |c_ULTIMATE.start_main_~#A~0#1.base|) (+ |c_ULTIMATE.start_main_~#A~0#1.offset| 8)))))) (< |aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| 0) (< 2147483647 .cse21) (< .cse21 0) (< 2147483647 |aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56|)))) (forall ((|aux_div_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| Int) (|aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| Int)) (let ((.cse28 (+ (* |aux_div_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| 4294967296) |aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56|))) (or (let ((.cse23 (let ((.cse25 (* (mod |aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| 4294967296) 4)) (.cse24 (let ((.cse27 (* (mod (+ |c_ULTIMATE.start_main_~i~0#1| 1) 4294967296) 4))) (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#C~0#1.base|) (+ .cse27 |c_ULTIMATE.start_main_~#C~0#1.offset|) (+ (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#B~0#1.base|) (+ |c_ULTIMATE.start_main_~#B~0#1.offset| .cse27)) (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#A~0#1.base|) (+ |c_ULTIMATE.start_main_~#A~0#1.offset| .cse27))))))) (store .cse24 (+ (- 17179869184) .cse25 |c_ULTIMATE.start_main_~#C~0#1.offset|) (let ((.cse26 (store |c_#memory_int| |c_ULTIMATE.start_main_~#C~0#1.base| .cse24))) (+ (select (select .cse26 |c_ULTIMATE.start_main_~#A~0#1.base|) (+ (- 17179869184) |c_ULTIMATE.start_main_~#A~0#1.offset| .cse25)) (select (select .cse26 |c_ULTIMATE.start_main_~#B~0#1.base|) (+ |c_ULTIMATE.start_main_~#B~0#1.offset| (- 17179869184) .cse25)))))))) (= (let ((.cse22 (store |c_#memory_int| |c_ULTIMATE.start_main_~#C~0#1.base| .cse23))) (+ (select (select .cse22 |c_ULTIMATE.start_main_~#A~0#1.base|) (+ |c_ULTIMATE.start_main_~#A~0#1.offset| 8)) (select (select .cse22 |c_ULTIMATE.start_main_~#B~0#1.base|) (+ |c_ULTIMATE.start_main_~#B~0#1.offset| 8)))) (select .cse23 (+ 8 |c_ULTIMATE.start_main_~#C~0#1.offset|)))) (<= |aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| 2147483647) (<= 4294967296 |aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56|) (<= 4294967296 .cse28) (<= .cse28 2147483647))))) (not .cse0)))) is different from false [2022-07-22 15:10:10,198 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (<= (mod (+ |c_ULTIMATE.start_main_~i~0#1| 1) 4294967296) 2147483647))) (and (or (not .cse0) (and (forall ((|aux_div_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| Int) (|aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| Int) (v_ArrVal_266 (Array Int Int))) (let ((.cse8 (+ (* |aux_div_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| 4294967296) |aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56|))) (or (< |aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| 0) (let ((.cse2 (let ((.cse4 (* (mod |aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| 4294967296) 4)) (.cse3 (let ((.cse6 (* (mod (+ |c_ULTIMATE.start_main_~i~0#1| 1) 4294967296) 4))) (store v_ArrVal_266 (+ .cse6 |c_ULTIMATE.start_main_~#C~0#1.offset|) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~#C~0#1.base| v_ArrVal_266))) (+ (select (select .cse7 |c_ULTIMATE.start_main_~#A~0#1.base|) (+ |c_ULTIMATE.start_main_~#A~0#1.offset| .cse6)) (select (select .cse7 |c_ULTIMATE.start_main_~#B~0#1.base|) (+ |c_ULTIMATE.start_main_~#B~0#1.offset| .cse6)))))))) (store .cse3 (+ .cse4 |c_ULTIMATE.start_main_~#C~0#1.offset|) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#C~0#1.base| .cse3))) (+ (select (select .cse5 |c_ULTIMATE.start_main_~#B~0#1.base|) (+ |c_ULTIMATE.start_main_~#B~0#1.offset| .cse4)) (select (select .cse5 |c_ULTIMATE.start_main_~#A~0#1.base|) (+ |c_ULTIMATE.start_main_~#A~0#1.offset| .cse4)))))))) (= (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#C~0#1.base| .cse2))) (+ (select (select .cse1 |c_ULTIMATE.start_main_~#A~0#1.base|) (+ |c_ULTIMATE.start_main_~#A~0#1.offset| 8)) (select (select .cse1 |c_ULTIMATE.start_main_~#B~0#1.base|) (+ |c_ULTIMATE.start_main_~#B~0#1.offset| 8)))) (select .cse2 (+ 8 |c_ULTIMATE.start_main_~#C~0#1.offset|)))) (< 2147483647 .cse8) (< .cse8 0) (< 2147483647 |aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56|)))) (forall ((|aux_div_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| Int) (|aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| Int) (v_ArrVal_266 (Array Int Int))) (let ((.cse16 (+ (* |aux_div_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| 4294967296) |aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56|))) (or (<= |aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| 2147483647) (let ((.cse9 (let ((.cse12 (* (mod |aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| 4294967296) 4)) (.cse11 (let ((.cse14 (* (mod (+ |c_ULTIMATE.start_main_~i~0#1| 1) 4294967296) 4))) (store v_ArrVal_266 (+ .cse14 |c_ULTIMATE.start_main_~#C~0#1.offset|) (let ((.cse15 (store |c_#memory_int| |c_ULTIMATE.start_main_~#C~0#1.base| v_ArrVal_266))) (+ (select (select .cse15 |c_ULTIMATE.start_main_~#A~0#1.base|) (+ |c_ULTIMATE.start_main_~#A~0#1.offset| .cse14)) (select (select .cse15 |c_ULTIMATE.start_main_~#B~0#1.base|) (+ |c_ULTIMATE.start_main_~#B~0#1.offset| .cse14)))))))) (store .cse11 (+ (- 17179869184) .cse12 |c_ULTIMATE.start_main_~#C~0#1.offset|) (let ((.cse13 (store |c_#memory_int| |c_ULTIMATE.start_main_~#C~0#1.base| .cse11))) (+ (select (select .cse13 |c_ULTIMATE.start_main_~#A~0#1.base|) (+ (- 17179869184) |c_ULTIMATE.start_main_~#A~0#1.offset| .cse12)) (select (select .cse13 |c_ULTIMATE.start_main_~#B~0#1.base|) (+ |c_ULTIMATE.start_main_~#B~0#1.offset| (- 17179869184) .cse12)))))))) (= (select .cse9 (+ 8 |c_ULTIMATE.start_main_~#C~0#1.offset|)) (let ((.cse10 (store |c_#memory_int| |c_ULTIMATE.start_main_~#C~0#1.base| .cse9))) (+ (select (select .cse10 |c_ULTIMATE.start_main_~#B~0#1.base|) (+ |c_ULTIMATE.start_main_~#B~0#1.offset| 8)) (select (select .cse10 |c_ULTIMATE.start_main_~#A~0#1.base|) (+ |c_ULTIMATE.start_main_~#A~0#1.offset| 8)))))) (<= 4294967296 |aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56|) (<= 4294967296 .cse16) (<= .cse16 2147483647)))))) (or .cse0 (and (forall ((|aux_div_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| Int) (|aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| Int) (v_ArrVal_266 (Array Int Int))) (let ((.cse17 (+ (* |aux_div_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| 4294967296) |aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56|))) (or (<= |aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| 2147483647) (<= 4294967296 |aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56|) (<= 4294967296 .cse17) (<= .cse17 2147483647) (let ((.cse18 (let ((.cse21 (* (mod |aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| 4294967296) 4)) (.cse20 (let ((.cse23 (* (mod (+ |c_ULTIMATE.start_main_~i~0#1| 1) 4294967296) 4))) (store v_ArrVal_266 (+ (- 17179869184) .cse23 |c_ULTIMATE.start_main_~#C~0#1.offset|) (let ((.cse24 (store |c_#memory_int| |c_ULTIMATE.start_main_~#C~0#1.base| v_ArrVal_266))) (+ (select (select .cse24 |c_ULTIMATE.start_main_~#B~0#1.base|) (+ |c_ULTIMATE.start_main_~#B~0#1.offset| (- 17179869184) .cse23)) (select (select .cse24 |c_ULTIMATE.start_main_~#A~0#1.base|) (+ (- 17179869184) |c_ULTIMATE.start_main_~#A~0#1.offset| .cse23)))))))) (store .cse20 (+ (- 17179869184) .cse21 |c_ULTIMATE.start_main_~#C~0#1.offset|) (let ((.cse22 (store |c_#memory_int| |c_ULTIMATE.start_main_~#C~0#1.base| .cse20))) (+ (select (select .cse22 |c_ULTIMATE.start_main_~#A~0#1.base|) (+ (- 17179869184) |c_ULTIMATE.start_main_~#A~0#1.offset| .cse21)) (select (select .cse22 |c_ULTIMATE.start_main_~#B~0#1.base|) (+ |c_ULTIMATE.start_main_~#B~0#1.offset| (- 17179869184) .cse21)))))))) (= (select .cse18 (+ 8 |c_ULTIMATE.start_main_~#C~0#1.offset|)) (let ((.cse19 (store |c_#memory_int| |c_ULTIMATE.start_main_~#C~0#1.base| .cse18))) (+ (select (select .cse19 |c_ULTIMATE.start_main_~#B~0#1.base|) (+ |c_ULTIMATE.start_main_~#B~0#1.offset| 8)) (select (select .cse19 |c_ULTIMATE.start_main_~#A~0#1.base|) (+ |c_ULTIMATE.start_main_~#A~0#1.offset| 8))))))))) (forall ((|aux_div_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| Int) (|aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| Int) (v_ArrVal_266 (Array Int Int))) (let ((.cse25 (+ (* |aux_div_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| 4294967296) |aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56|))) (or (< |aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| 0) (< 2147483647 .cse25) (< .cse25 0) (let ((.cse26 (let ((.cse29 (* (mod |aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| 4294967296) 4)) (.cse28 (let ((.cse31 (* (mod (+ |c_ULTIMATE.start_main_~i~0#1| 1) 4294967296) 4))) (store v_ArrVal_266 (+ (- 17179869184) .cse31 |c_ULTIMATE.start_main_~#C~0#1.offset|) (let ((.cse32 (store |c_#memory_int| |c_ULTIMATE.start_main_~#C~0#1.base| v_ArrVal_266))) (+ (select (select .cse32 |c_ULTIMATE.start_main_~#B~0#1.base|) (+ |c_ULTIMATE.start_main_~#B~0#1.offset| (- 17179869184) .cse31)) (select (select .cse32 |c_ULTIMATE.start_main_~#A~0#1.base|) (+ (- 17179869184) |c_ULTIMATE.start_main_~#A~0#1.offset| .cse31)))))))) (store .cse28 (+ .cse29 |c_ULTIMATE.start_main_~#C~0#1.offset|) (let ((.cse30 (store |c_#memory_int| |c_ULTIMATE.start_main_~#C~0#1.base| .cse28))) (+ (select (select .cse30 |c_ULTIMATE.start_main_~#A~0#1.base|) (+ |c_ULTIMATE.start_main_~#A~0#1.offset| .cse29)) (select (select .cse30 |c_ULTIMATE.start_main_~#B~0#1.base|) (+ |c_ULTIMATE.start_main_~#B~0#1.offset| .cse29)))))))) (= (select .cse26 (+ 8 |c_ULTIMATE.start_main_~#C~0#1.offset|)) (let ((.cse27 (store |c_#memory_int| |c_ULTIMATE.start_main_~#C~0#1.base| .cse26))) (+ (select (select .cse27 |c_ULTIMATE.start_main_~#A~0#1.base|) (+ |c_ULTIMATE.start_main_~#A~0#1.offset| 8)) (select (select .cse27 |c_ULTIMATE.start_main_~#B~0#1.base|) (+ |c_ULTIMATE.start_main_~#B~0#1.offset| 8)))))) (< 2147483647 |aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56|)))))))) is different from false [2022-07-22 15:10:10,436 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (<= (mod (+ 2 |c_ULTIMATE.start_main_~i~0#1|) 4294967296) 2147483647))) (and (or (not .cse0) (and (forall ((|aux_div_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| Int) (|aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| Int) (v_ArrVal_266 (Array Int Int))) (let ((.cse1 (+ (* |aux_div_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| 4294967296) |aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56|))) (or (<= |aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| 2147483647) (<= 4294967296 |aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56|) (<= 4294967296 .cse1) (<= .cse1 2147483647) (let ((.cse3 (let ((.cse5 (* (mod |aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| 4294967296) 4)) (.cse4 (let ((.cse7 (* 4 (mod (+ 2 |c_ULTIMATE.start_main_~i~0#1|) 4294967296)))) (store v_ArrVal_266 (+ .cse7 |c_ULTIMATE.start_main_~#C~0#1.offset|) (let ((.cse8 (store |c_#memory_int| |c_ULTIMATE.start_main_~#C~0#1.base| v_ArrVal_266))) (+ (select (select .cse8 |c_ULTIMATE.start_main_~#B~0#1.base|) (+ |c_ULTIMATE.start_main_~#B~0#1.offset| .cse7)) (select (select .cse8 |c_ULTIMATE.start_main_~#A~0#1.base|) (+ |c_ULTIMATE.start_main_~#A~0#1.offset| .cse7)))))))) (store .cse4 (+ (- 17179869184) .cse5 |c_ULTIMATE.start_main_~#C~0#1.offset|) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~#C~0#1.base| .cse4))) (+ (select (select .cse6 |c_ULTIMATE.start_main_~#A~0#1.base|) (+ (- 17179869184) |c_ULTIMATE.start_main_~#A~0#1.offset| .cse5)) (select (select .cse6 |c_ULTIMATE.start_main_~#B~0#1.base|) (+ |c_ULTIMATE.start_main_~#B~0#1.offset| (- 17179869184) .cse5)))))))) (= (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#C~0#1.base| .cse3))) (+ (select (select .cse2 |c_ULTIMATE.start_main_~#B~0#1.base|) (+ |c_ULTIMATE.start_main_~#B~0#1.offset| 8)) (select (select .cse2 |c_ULTIMATE.start_main_~#A~0#1.base|) (+ |c_ULTIMATE.start_main_~#A~0#1.offset| 8)))) (select .cse3 (+ 8 |c_ULTIMATE.start_main_~#C~0#1.offset|))))))) (forall ((|aux_div_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| Int) (|aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| Int) (v_ArrVal_266 (Array Int Int))) (let ((.cse16 (+ (* |aux_div_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| 4294967296) |aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56|))) (or (let ((.cse10 (let ((.cse12 (* (mod |aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| 4294967296) 4)) (.cse11 (let ((.cse14 (* 4 (mod (+ 2 |c_ULTIMATE.start_main_~i~0#1|) 4294967296)))) (store v_ArrVal_266 (+ .cse14 |c_ULTIMATE.start_main_~#C~0#1.offset|) (let ((.cse15 (store |c_#memory_int| |c_ULTIMATE.start_main_~#C~0#1.base| v_ArrVal_266))) (+ (select (select .cse15 |c_ULTIMATE.start_main_~#B~0#1.base|) (+ |c_ULTIMATE.start_main_~#B~0#1.offset| .cse14)) (select (select .cse15 |c_ULTIMATE.start_main_~#A~0#1.base|) (+ |c_ULTIMATE.start_main_~#A~0#1.offset| .cse14)))))))) (store .cse11 (+ .cse12 |c_ULTIMATE.start_main_~#C~0#1.offset|) (let ((.cse13 (store |c_#memory_int| |c_ULTIMATE.start_main_~#C~0#1.base| .cse11))) (+ (select (select .cse13 |c_ULTIMATE.start_main_~#B~0#1.base|) (+ |c_ULTIMATE.start_main_~#B~0#1.offset| .cse12)) (select (select .cse13 |c_ULTIMATE.start_main_~#A~0#1.base|) (+ |c_ULTIMATE.start_main_~#A~0#1.offset| .cse12)))))))) (= (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_main_~#C~0#1.base| .cse10))) (+ (select (select .cse9 |c_ULTIMATE.start_main_~#A~0#1.base|) (+ |c_ULTIMATE.start_main_~#A~0#1.offset| 8)) (select (select .cse9 |c_ULTIMATE.start_main_~#B~0#1.base|) (+ |c_ULTIMATE.start_main_~#B~0#1.offset| 8)))) (select .cse10 (+ 8 |c_ULTIMATE.start_main_~#C~0#1.offset|)))) (< |aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| 0) (< 2147483647 .cse16) (< .cse16 0) (< 2147483647 |aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56|)))))) (or .cse0 (and (forall ((|aux_div_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| Int) (|aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| Int) (v_ArrVal_266 (Array Int Int))) (let ((.cse17 (+ (* |aux_div_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| 4294967296) |aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56|))) (or (<= |aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| 2147483647) (<= 4294967296 |aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56|) (<= 4294967296 .cse17) (let ((.cse19 (let ((.cse21 (* (mod |aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| 4294967296) 4)) (.cse20 (let ((.cse23 (* 4 (mod (+ 2 |c_ULTIMATE.start_main_~i~0#1|) 4294967296)))) (store v_ArrVal_266 (+ (- 17179869184) .cse23 |c_ULTIMATE.start_main_~#C~0#1.offset|) (let ((.cse24 (store |c_#memory_int| |c_ULTIMATE.start_main_~#C~0#1.base| v_ArrVal_266))) (+ (select (select .cse24 |c_ULTIMATE.start_main_~#A~0#1.base|) (+ (- 17179869184) |c_ULTIMATE.start_main_~#A~0#1.offset| .cse23)) (select (select .cse24 |c_ULTIMATE.start_main_~#B~0#1.base|) (+ |c_ULTIMATE.start_main_~#B~0#1.offset| (- 17179869184) .cse23)))))))) (store .cse20 (+ (- 17179869184) .cse21 |c_ULTIMATE.start_main_~#C~0#1.offset|) (let ((.cse22 (store |c_#memory_int| |c_ULTIMATE.start_main_~#C~0#1.base| .cse20))) (+ (select (select .cse22 |c_ULTIMATE.start_main_~#B~0#1.base|) (+ |c_ULTIMATE.start_main_~#B~0#1.offset| (- 17179869184) .cse21)) (select (select .cse22 |c_ULTIMATE.start_main_~#A~0#1.base|) (+ (- 17179869184) |c_ULTIMATE.start_main_~#A~0#1.offset| .cse21)))))))) (= (let ((.cse18 (store |c_#memory_int| |c_ULTIMATE.start_main_~#C~0#1.base| .cse19))) (+ (select (select .cse18 |c_ULTIMATE.start_main_~#A~0#1.base|) (+ |c_ULTIMATE.start_main_~#A~0#1.offset| 8)) (select (select .cse18 |c_ULTIMATE.start_main_~#B~0#1.base|) (+ |c_ULTIMATE.start_main_~#B~0#1.offset| 8)))) (select .cse19 (+ 8 |c_ULTIMATE.start_main_~#C~0#1.offset|)))) (<= .cse17 2147483647)))) (forall ((|aux_div_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| Int) (|aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| Int) (v_ArrVal_266 (Array Int Int))) (let ((.cse32 (+ (* |aux_div_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| 4294967296) |aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56|))) (or (< |aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| 0) (let ((.cse26 (let ((.cse28 (* (mod |aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| 4294967296) 4)) (.cse27 (let ((.cse30 (* 4 (mod (+ 2 |c_ULTIMATE.start_main_~i~0#1|) 4294967296)))) (store v_ArrVal_266 (+ (- 17179869184) .cse30 |c_ULTIMATE.start_main_~#C~0#1.offset|) (let ((.cse31 (store |c_#memory_int| |c_ULTIMATE.start_main_~#C~0#1.base| v_ArrVal_266))) (+ (select (select .cse31 |c_ULTIMATE.start_main_~#A~0#1.base|) (+ (- 17179869184) |c_ULTIMATE.start_main_~#A~0#1.offset| .cse30)) (select (select .cse31 |c_ULTIMATE.start_main_~#B~0#1.base|) (+ |c_ULTIMATE.start_main_~#B~0#1.offset| (- 17179869184) .cse30)))))))) (store .cse27 (+ .cse28 |c_ULTIMATE.start_main_~#C~0#1.offset|) (let ((.cse29 (store |c_#memory_int| |c_ULTIMATE.start_main_~#C~0#1.base| .cse27))) (+ (select (select .cse29 |c_ULTIMATE.start_main_~#B~0#1.base|) (+ |c_ULTIMATE.start_main_~#B~0#1.offset| .cse28)) (select (select .cse29 |c_ULTIMATE.start_main_~#A~0#1.base|) (+ |c_ULTIMATE.start_main_~#A~0#1.offset| .cse28)))))))) (= (let ((.cse25 (store |c_#memory_int| |c_ULTIMATE.start_main_~#C~0#1.base| .cse26))) (+ (select (select .cse25 |c_ULTIMATE.start_main_~#A~0#1.base|) (+ |c_ULTIMATE.start_main_~#A~0#1.offset| 8)) (select (select .cse25 |c_ULTIMATE.start_main_~#B~0#1.base|) (+ |c_ULTIMATE.start_main_~#B~0#1.offset| 8)))) (select .cse26 (+ 8 |c_ULTIMATE.start_main_~#C~0#1.offset|)))) (< 2147483647 .cse32) (< .cse32 0) (< 2147483647 |aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56|)))))))) is different from false [2022-07-22 15:10:10,755 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|aux_div_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| Int) (|aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| Int) (v_ArrVal_266 (Array Int Int))) (let ((.cse0 (+ (* |aux_div_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| 4294967296) |aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56|))) (or (<= |aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| 2147483647) (<= 4294967296 |aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56|) (<= 4294967296 .cse0) (<= .cse0 2147483647) (let ((.cse5 (+ 8 |c_ULTIMATE.start_main_~#C~0#1.offset|)) (.cse3 (+ |c_ULTIMATE.start_main_~#A~0#1.offset| 8)) (.cse2 (+ |c_ULTIMATE.start_main_~#B~0#1.offset| 8))) (let ((.cse4 (let ((.cse7 (* (mod |aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| 4294967296) 4)) (.cse6 (store v_ArrVal_266 .cse5 (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_main_~#C~0#1.base| v_ArrVal_266))) (+ (select (select .cse9 |c_ULTIMATE.start_main_~#A~0#1.base|) .cse3) (select (select .cse9 |c_ULTIMATE.start_main_~#B~0#1.base|) .cse2)))))) (store .cse6 (+ (- 17179869184) .cse7 |c_ULTIMATE.start_main_~#C~0#1.offset|) (let ((.cse8 (store |c_#memory_int| |c_ULTIMATE.start_main_~#C~0#1.base| .cse6))) (+ (select (select .cse8 |c_ULTIMATE.start_main_~#A~0#1.base|) (+ (- 17179869184) |c_ULTIMATE.start_main_~#A~0#1.offset| .cse7)) (select (select .cse8 |c_ULTIMATE.start_main_~#B~0#1.base|) (+ |c_ULTIMATE.start_main_~#B~0#1.offset| (- 17179869184) .cse7)))))))) (= (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#C~0#1.base| .cse4))) (+ (select (select .cse1 |c_ULTIMATE.start_main_~#B~0#1.base|) .cse2) (select (select .cse1 |c_ULTIMATE.start_main_~#A~0#1.base|) .cse3))) (select .cse4 .cse5))))))) (forall ((|aux_div_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| Int) (|aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| Int) (v_ArrVal_266 (Array Int Int))) (let ((.cse19 (+ (* |aux_div_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| 4294967296) |aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56|))) (or (let ((.cse11 (+ 8 |c_ULTIMATE.start_main_~#C~0#1.offset|)) (.cse14 (+ |c_ULTIMATE.start_main_~#A~0#1.offset| 8)) (.cse13 (+ |c_ULTIMATE.start_main_~#B~0#1.offset| 8))) (let ((.cse10 (let ((.cse16 (* (mod |aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| 4294967296) 4)) (.cse15 (store v_ArrVal_266 .cse11 (let ((.cse18 (store |c_#memory_int| |c_ULTIMATE.start_main_~#C~0#1.base| v_ArrVal_266))) (+ (select (select .cse18 |c_ULTIMATE.start_main_~#A~0#1.base|) .cse14) (select (select .cse18 |c_ULTIMATE.start_main_~#B~0#1.base|) .cse13)))))) (store .cse15 (+ .cse16 |c_ULTIMATE.start_main_~#C~0#1.offset|) (let ((.cse17 (store |c_#memory_int| |c_ULTIMATE.start_main_~#C~0#1.base| .cse15))) (+ (select (select .cse17 |c_ULTIMATE.start_main_~#A~0#1.base|) (+ |c_ULTIMATE.start_main_~#A~0#1.offset| .cse16)) (select (select .cse17 |c_ULTIMATE.start_main_~#B~0#1.base|) (+ |c_ULTIMATE.start_main_~#B~0#1.offset| .cse16)))))))) (= (select .cse10 .cse11) (let ((.cse12 (store |c_#memory_int| |c_ULTIMATE.start_main_~#C~0#1.base| .cse10))) (+ (select (select .cse12 |c_ULTIMATE.start_main_~#B~0#1.base|) .cse13) (select (select .cse12 |c_ULTIMATE.start_main_~#A~0#1.base|) .cse14)))))) (< |aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| 0) (< 2147483647 .cse19) (< .cse19 0) (< 2147483647 |aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56|))))) is different from false [2022-07-22 15:10:11,178 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse12 (<= (mod |c_ULTIMATE.start_main_~i~0#1| 4294967296) 2147483647))) (let ((.cse11 (not .cse12))) (and (or (forall ((|aux_div_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| Int) (|aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| Int) (v_ArrVal_263 Int) (v_ArrVal_266 (Array Int Int))) (let ((.cse10 (+ (* |aux_div_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| 4294967296) |aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56|))) (or (let ((.cse1 (+ 8 |c_ULTIMATE.start_main_~#C~0#1.offset|)) (.cse4 (+ |c_ULTIMATE.start_main_~#B~0#1.offset| 8)) (.cse3 (+ |c_ULTIMATE.start_main_~#A~0#1.offset| 8)) (.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#B~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#B~0#1.base|) (+ |c_ULTIMATE.start_main_~#B~0#1.offset| (* (mod |c_ULTIMATE.start_main_~i~0#1| 4294967296) 4)) v_ArrVal_263)))) (let ((.cse0 (let ((.cse7 (* (mod |aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| 4294967296) 4)) (.cse6 (store v_ArrVal_266 .cse1 (let ((.cse9 (store .cse5 |c_ULTIMATE.start_main_~#C~0#1.base| v_ArrVal_266))) (+ (select (select .cse9 |c_ULTIMATE.start_main_~#B~0#1.base|) .cse4) (select (select .cse9 |c_ULTIMATE.start_main_~#A~0#1.base|) .cse3)))))) (store .cse6 (+ .cse7 |c_ULTIMATE.start_main_~#C~0#1.offset|) (let ((.cse8 (store .cse5 |c_ULTIMATE.start_main_~#C~0#1.base| .cse6))) (+ (select (select .cse8 |c_ULTIMATE.start_main_~#B~0#1.base|) (+ |c_ULTIMATE.start_main_~#B~0#1.offset| .cse7)) (select (select .cse8 |c_ULTIMATE.start_main_~#A~0#1.base|) (+ |c_ULTIMATE.start_main_~#A~0#1.offset| .cse7)))))))) (= (select .cse0 .cse1) (let ((.cse2 (store .cse5 |c_ULTIMATE.start_main_~#C~0#1.base| .cse0))) (+ (select (select .cse2 |c_ULTIMATE.start_main_~#A~0#1.base|) .cse3) (select (select .cse2 |c_ULTIMATE.start_main_~#B~0#1.base|) .cse4)))))) (< |aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| 0) (< 2147483647 .cse10) (< .cse10 0) (< 2147483647 |aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56|)))) .cse11) (or .cse12 (forall ((|aux_div_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| Int) (|aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| Int) (v_ArrVal_263 Int) (v_ArrVal_266 (Array Int Int))) (let ((.cse13 (+ (* |aux_div_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| 4294967296) |aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56|))) (or (<= |aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| 2147483647) (<= 4294967296 |aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56|) (<= 4294967296 .cse13) (let ((.cse15 (+ 8 |c_ULTIMATE.start_main_~#C~0#1.offset|)) (.cse18 (+ |c_ULTIMATE.start_main_~#B~0#1.offset| 8)) (.cse17 (+ |c_ULTIMATE.start_main_~#A~0#1.offset| 8)) (.cse19 (store |c_#memory_int| |c_ULTIMATE.start_main_~#B~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#B~0#1.base|) (+ |c_ULTIMATE.start_main_~#B~0#1.offset| (- 17179869184) (* (mod |c_ULTIMATE.start_main_~i~0#1| 4294967296) 4)) v_ArrVal_263)))) (let ((.cse14 (let ((.cse21 (* (mod |aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| 4294967296) 4)) (.cse20 (store v_ArrVal_266 .cse15 (let ((.cse23 (store .cse19 |c_ULTIMATE.start_main_~#C~0#1.base| v_ArrVal_266))) (+ (select (select .cse23 |c_ULTIMATE.start_main_~#B~0#1.base|) .cse18) (select (select .cse23 |c_ULTIMATE.start_main_~#A~0#1.base|) .cse17)))))) (store .cse20 (+ (- 17179869184) .cse21 |c_ULTIMATE.start_main_~#C~0#1.offset|) (let ((.cse22 (store .cse19 |c_ULTIMATE.start_main_~#C~0#1.base| .cse20))) (+ (select (select .cse22 |c_ULTIMATE.start_main_~#A~0#1.base|) (+ (- 17179869184) |c_ULTIMATE.start_main_~#A~0#1.offset| .cse21)) (select (select .cse22 |c_ULTIMATE.start_main_~#B~0#1.base|) (+ |c_ULTIMATE.start_main_~#B~0#1.offset| (- 17179869184) .cse21)))))))) (= (select .cse14 .cse15) (let ((.cse16 (store .cse19 |c_ULTIMATE.start_main_~#C~0#1.base| .cse14))) (+ (select (select .cse16 |c_ULTIMATE.start_main_~#A~0#1.base|) .cse17) (select (select .cse16 |c_ULTIMATE.start_main_~#B~0#1.base|) .cse18)))))) (<= .cse13 2147483647))))) (or (forall ((|aux_div_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| Int) (|aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| Int) (v_ArrVal_263 Int) (v_ArrVal_266 (Array Int Int))) (let ((.cse24 (+ (* |aux_div_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| 4294967296) |aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56|))) (or (< |aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| 0) (< 2147483647 .cse24) (< .cse24 0) (let ((.cse30 (+ 8 |c_ULTIMATE.start_main_~#C~0#1.offset|)) (.cse26 (+ |c_ULTIMATE.start_main_~#B~0#1.offset| 8)) (.cse27 (+ |c_ULTIMATE.start_main_~#A~0#1.offset| 8)) (.cse28 (store |c_#memory_int| |c_ULTIMATE.start_main_~#B~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#B~0#1.base|) (+ |c_ULTIMATE.start_main_~#B~0#1.offset| (- 17179869184) (* (mod |c_ULTIMATE.start_main_~i~0#1| 4294967296) 4)) v_ArrVal_263)))) (let ((.cse29 (let ((.cse32 (* (mod |aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| 4294967296) 4)) (.cse31 (store v_ArrVal_266 .cse30 (let ((.cse34 (store .cse28 |c_ULTIMATE.start_main_~#C~0#1.base| v_ArrVal_266))) (+ (select (select .cse34 |c_ULTIMATE.start_main_~#B~0#1.base|) .cse26) (select (select .cse34 |c_ULTIMATE.start_main_~#A~0#1.base|) .cse27)))))) (store .cse31 (+ .cse32 |c_ULTIMATE.start_main_~#C~0#1.offset|) (let ((.cse33 (store .cse28 |c_ULTIMATE.start_main_~#C~0#1.base| .cse31))) (+ (select (select .cse33 |c_ULTIMATE.start_main_~#B~0#1.base|) (+ |c_ULTIMATE.start_main_~#B~0#1.offset| .cse32)) (select (select .cse33 |c_ULTIMATE.start_main_~#A~0#1.base|) (+ |c_ULTIMATE.start_main_~#A~0#1.offset| .cse32)))))))) (= (let ((.cse25 (store .cse28 |c_ULTIMATE.start_main_~#C~0#1.base| .cse29))) (+ (select (select .cse25 |c_ULTIMATE.start_main_~#B~0#1.base|) .cse26) (select (select .cse25 |c_ULTIMATE.start_main_~#A~0#1.base|) .cse27))) (select .cse29 .cse30)))) (< 2147483647 |aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56|)))) .cse12) (or .cse11 (forall ((|aux_div_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| Int) (|aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| Int) (v_ArrVal_263 Int) (v_ArrVal_266 (Array Int Int))) (let ((.cse45 (+ (* |aux_div_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| 4294967296) |aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56|))) (or (<= |aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| 2147483647) (<= 4294967296 |aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56|) (let ((.cse36 (+ 8 |c_ULTIMATE.start_main_~#C~0#1.offset|)) (.cse39 (+ |c_ULTIMATE.start_main_~#B~0#1.offset| 8)) (.cse38 (+ |c_ULTIMATE.start_main_~#A~0#1.offset| 8)) (.cse40 (store |c_#memory_int| |c_ULTIMATE.start_main_~#B~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#B~0#1.base|) (+ |c_ULTIMATE.start_main_~#B~0#1.offset| (* (mod |c_ULTIMATE.start_main_~i~0#1| 4294967296) 4)) v_ArrVal_263)))) (let ((.cse35 (let ((.cse42 (* (mod |aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| 4294967296) 4)) (.cse41 (store v_ArrVal_266 .cse36 (let ((.cse44 (store .cse40 |c_ULTIMATE.start_main_~#C~0#1.base| v_ArrVal_266))) (+ (select (select .cse44 |c_ULTIMATE.start_main_~#B~0#1.base|) .cse39) (select (select .cse44 |c_ULTIMATE.start_main_~#A~0#1.base|) .cse38)))))) (store .cse41 (+ (- 17179869184) .cse42 |c_ULTIMATE.start_main_~#C~0#1.offset|) (let ((.cse43 (store .cse40 |c_ULTIMATE.start_main_~#C~0#1.base| .cse41))) (+ (select (select .cse43 |c_ULTIMATE.start_main_~#A~0#1.base|) (+ (- 17179869184) |c_ULTIMATE.start_main_~#A~0#1.offset| .cse42)) (select (select .cse43 |c_ULTIMATE.start_main_~#B~0#1.base|) (+ |c_ULTIMATE.start_main_~#B~0#1.offset| (- 17179869184) .cse42)))))))) (= (select .cse35 .cse36) (let ((.cse37 (store .cse40 |c_ULTIMATE.start_main_~#C~0#1.base| .cse35))) (+ (select (select .cse37 |c_ULTIMATE.start_main_~#A~0#1.base|) .cse38) (select (select .cse37 |c_ULTIMATE.start_main_~#B~0#1.base|) .cse39)))))) (<= 4294967296 .cse45) (<= .cse45 2147483647)))))))) is different from false [2022-07-22 15:10:11,610 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse12 (<= (mod (+ |c_ULTIMATE.start_main_~i~0#1| 1) 4294967296) 2147483647))) (let ((.cse11 (not .cse12))) (and (or (forall ((|aux_div_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| Int) (|aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| Int) (v_ArrVal_263 Int) (v_ArrVal_266 (Array Int Int))) (let ((.cse0 (+ (* |aux_div_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| 4294967296) |aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56|))) (or (< |aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| 0) (< 2147483647 .cse0) (< .cse0 0) (< 2147483647 |aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56|) (let ((.cse6 (+ 8 |c_ULTIMATE.start_main_~#C~0#1.offset|)) (.cse3 (+ |c_ULTIMATE.start_main_~#B~0#1.offset| 8)) (.cse2 (+ |c_ULTIMATE.start_main_~#A~0#1.offset| 8)) (.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#B~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#B~0#1.base|) (+ |c_ULTIMATE.start_main_~#B~0#1.offset| (* (mod (+ |c_ULTIMATE.start_main_~i~0#1| 1) 4294967296) 4)) v_ArrVal_263)))) (let ((.cse5 (let ((.cse8 (* (mod |aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| 4294967296) 4)) (.cse7 (store v_ArrVal_266 .cse6 (let ((.cse10 (store .cse4 |c_ULTIMATE.start_main_~#C~0#1.base| v_ArrVal_266))) (+ (select (select .cse10 |c_ULTIMATE.start_main_~#B~0#1.base|) .cse3) (select (select .cse10 |c_ULTIMATE.start_main_~#A~0#1.base|) .cse2)))))) (store .cse7 (+ .cse8 |c_ULTIMATE.start_main_~#C~0#1.offset|) (let ((.cse9 (store .cse4 |c_ULTIMATE.start_main_~#C~0#1.base| .cse7))) (+ (select (select .cse9 |c_ULTIMATE.start_main_~#A~0#1.base|) (+ |c_ULTIMATE.start_main_~#A~0#1.offset| .cse8)) (select (select .cse9 |c_ULTIMATE.start_main_~#B~0#1.base|) (+ |c_ULTIMATE.start_main_~#B~0#1.offset| .cse8)))))))) (= (let ((.cse1 (store .cse4 |c_ULTIMATE.start_main_~#C~0#1.base| .cse5))) (+ (select (select .cse1 |c_ULTIMATE.start_main_~#A~0#1.base|) .cse2) (select (select .cse1 |c_ULTIMATE.start_main_~#B~0#1.base|) .cse3))) (select .cse5 .cse6))))))) .cse11) (or .cse12 (forall ((|aux_div_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| Int) (|aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| Int) (v_ArrVal_263 Int) (v_ArrVal_266 (Array Int Int))) (let ((.cse23 (+ (* |aux_div_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| 4294967296) |aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56|))) (or (<= |aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| 2147483647) (<= 4294967296 |aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56|) (let ((.cse18 (+ 8 |c_ULTIMATE.start_main_~#C~0#1.offset|)) (.cse15 (+ |c_ULTIMATE.start_main_~#B~0#1.offset| 8)) (.cse14 (+ |c_ULTIMATE.start_main_~#A~0#1.offset| 8)) (.cse16 (store |c_#memory_int| |c_ULTIMATE.start_main_~#B~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#B~0#1.base|) (+ |c_ULTIMATE.start_main_~#B~0#1.offset| (- 17179869184) (* (mod (+ |c_ULTIMATE.start_main_~i~0#1| 1) 4294967296) 4)) v_ArrVal_263)))) (let ((.cse17 (let ((.cse20 (* (mod |aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| 4294967296) 4)) (.cse19 (store v_ArrVal_266 .cse18 (let ((.cse22 (store .cse16 |c_ULTIMATE.start_main_~#C~0#1.base| v_ArrVal_266))) (+ (select (select .cse22 |c_ULTIMATE.start_main_~#B~0#1.base|) .cse15) (select (select .cse22 |c_ULTIMATE.start_main_~#A~0#1.base|) .cse14)))))) (store .cse19 (+ (- 17179869184) .cse20 |c_ULTIMATE.start_main_~#C~0#1.offset|) (let ((.cse21 (store .cse16 |c_ULTIMATE.start_main_~#C~0#1.base| .cse19))) (+ (select (select .cse21 |c_ULTIMATE.start_main_~#B~0#1.base|) (+ |c_ULTIMATE.start_main_~#B~0#1.offset| (- 17179869184) .cse20)) (select (select .cse21 |c_ULTIMATE.start_main_~#A~0#1.base|) (+ (- 17179869184) |c_ULTIMATE.start_main_~#A~0#1.offset| .cse20)))))))) (= (let ((.cse13 (store .cse16 |c_ULTIMATE.start_main_~#C~0#1.base| .cse17))) (+ (select (select .cse13 |c_ULTIMATE.start_main_~#A~0#1.base|) .cse14) (select (select .cse13 |c_ULTIMATE.start_main_~#B~0#1.base|) .cse15))) (select .cse17 .cse18)))) (<= 4294967296 .cse23) (<= .cse23 2147483647))))) (or .cse12 (forall ((|aux_div_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| Int) (|aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| Int) (v_ArrVal_263 Int) (v_ArrVal_266 (Array Int Int))) (let ((.cse24 (+ (* |aux_div_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| 4294967296) |aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56|))) (or (< |aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| 0) (< 2147483647 .cse24) (< .cse24 0) (< 2147483647 |aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56|) (let ((.cse30 (+ 8 |c_ULTIMATE.start_main_~#C~0#1.offset|)) (.cse26 (+ |c_ULTIMATE.start_main_~#B~0#1.offset| 8)) (.cse27 (+ |c_ULTIMATE.start_main_~#A~0#1.offset| 8)) (.cse28 (store |c_#memory_int| |c_ULTIMATE.start_main_~#B~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#B~0#1.base|) (+ |c_ULTIMATE.start_main_~#B~0#1.offset| (- 17179869184) (* (mod (+ |c_ULTIMATE.start_main_~i~0#1| 1) 4294967296) 4)) v_ArrVal_263)))) (let ((.cse29 (let ((.cse32 (* (mod |aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| 4294967296) 4)) (.cse31 (store v_ArrVal_266 .cse30 (let ((.cse34 (store .cse28 |c_ULTIMATE.start_main_~#C~0#1.base| v_ArrVal_266))) (+ (select (select .cse34 |c_ULTIMATE.start_main_~#B~0#1.base|) .cse26) (select (select .cse34 |c_ULTIMATE.start_main_~#A~0#1.base|) .cse27)))))) (store .cse31 (+ .cse32 |c_ULTIMATE.start_main_~#C~0#1.offset|) (let ((.cse33 (store .cse28 |c_ULTIMATE.start_main_~#C~0#1.base| .cse31))) (+ (select (select .cse33 |c_ULTIMATE.start_main_~#B~0#1.base|) (+ |c_ULTIMATE.start_main_~#B~0#1.offset| .cse32)) (select (select .cse33 |c_ULTIMATE.start_main_~#A~0#1.base|) (+ |c_ULTIMATE.start_main_~#A~0#1.offset| .cse32)))))))) (= (let ((.cse25 (store .cse28 |c_ULTIMATE.start_main_~#C~0#1.base| .cse29))) (+ (select (select .cse25 |c_ULTIMATE.start_main_~#B~0#1.base|) .cse26) (select (select .cse25 |c_ULTIMATE.start_main_~#A~0#1.base|) .cse27))) (select .cse29 .cse30)))))))) (or (forall ((|aux_div_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| Int) (|aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| Int) (v_ArrVal_263 Int) (v_ArrVal_266 (Array Int Int))) (let ((.cse35 (+ (* |aux_div_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| 4294967296) |aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56|))) (or (<= |aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| 2147483647) (<= 4294967296 |aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56|) (<= 4294967296 .cse35) (<= .cse35 2147483647) (let ((.cse41 (+ 8 |c_ULTIMATE.start_main_~#C~0#1.offset|)) (.cse37 (+ |c_ULTIMATE.start_main_~#B~0#1.offset| 8)) (.cse38 (+ |c_ULTIMATE.start_main_~#A~0#1.offset| 8)) (.cse39 (store |c_#memory_int| |c_ULTIMATE.start_main_~#B~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#B~0#1.base|) (+ |c_ULTIMATE.start_main_~#B~0#1.offset| (* (mod (+ |c_ULTIMATE.start_main_~i~0#1| 1) 4294967296) 4)) v_ArrVal_263)))) (let ((.cse40 (let ((.cse43 (* (mod |aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| 4294967296) 4)) (.cse42 (store v_ArrVal_266 .cse41 (let ((.cse45 (store .cse39 |c_ULTIMATE.start_main_~#C~0#1.base| v_ArrVal_266))) (+ (select (select .cse45 |c_ULTIMATE.start_main_~#B~0#1.base|) .cse37) (select (select .cse45 |c_ULTIMATE.start_main_~#A~0#1.base|) .cse38)))))) (store .cse42 (+ (- 17179869184) .cse43 |c_ULTIMATE.start_main_~#C~0#1.offset|) (let ((.cse44 (store .cse39 |c_ULTIMATE.start_main_~#C~0#1.base| .cse42))) (+ (select (select .cse44 |c_ULTIMATE.start_main_~#B~0#1.base|) (+ |c_ULTIMATE.start_main_~#B~0#1.offset| (- 17179869184) .cse43)) (select (select .cse44 |c_ULTIMATE.start_main_~#A~0#1.base|) (+ (- 17179869184) |c_ULTIMATE.start_main_~#A~0#1.offset| .cse43)))))))) (= (let ((.cse36 (store .cse39 |c_ULTIMATE.start_main_~#C~0#1.base| .cse40))) (+ (select (select .cse36 |c_ULTIMATE.start_main_~#B~0#1.base|) .cse37) (select (select .cse36 |c_ULTIMATE.start_main_~#A~0#1.base|) .cse38))) (select .cse40 .cse41))))))) .cse11)))) is different from false [2022-07-22 15:10:11,999 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 15:10:11,999 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 736 treesize of output 465 [2022-07-22 15:10:12,059 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 15:10:12,060 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 753 treesize of output 457 [2022-07-22 15:10:12,096 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 15:10:12,096 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 762 treesize of output 466 [2022-07-22 15:10:12,151 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 15:10:12,151 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 727 treesize of output 456 [2022-07-22 15:10:12,191 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse12 (<= (mod (+ |c_ULTIMATE.start_main_~i~0#1| 1) 4294967296) 2147483647))) (let ((.cse0 (not .cse12))) (and (or .cse0 (forall ((v_arrayElimArr_8 (Array Int Int)) (|aux_div_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| Int) (|aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| Int) (v_ArrVal_266 (Array Int Int))) (let ((.cse1 (+ (* |aux_div_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| 4294967296) |aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56|))) (or (< |aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| 0) (< 2147483647 .cse1) (< .cse1 0) (< 2147483647 |aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56|) (let ((.cse7 (+ 8 |c_ULTIMATE.start_main_~#C~0#1.offset|)) (.cse4 (+ |c_ULTIMATE.start_main_~#A~0#1.offset| 8)) (.cse3 (+ |c_ULTIMATE.start_main_~#B~0#1.offset| 8)) (.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#B~0#1.base| v_arrayElimArr_8))) (let ((.cse6 (let ((.cse9 (* (mod |aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| 4294967296) 4)) (.cse8 (store v_ArrVal_266 .cse7 (let ((.cse11 (store .cse5 |c_ULTIMATE.start_main_~#C~0#1.base| v_ArrVal_266))) (+ (select (select .cse11 |c_ULTIMATE.start_main_~#A~0#1.base|) .cse4) (select (select .cse11 |c_ULTIMATE.start_main_~#B~0#1.base|) .cse3)))))) (store .cse8 (+ .cse9 |c_ULTIMATE.start_main_~#C~0#1.offset|) (let ((.cse10 (store .cse5 |c_ULTIMATE.start_main_~#C~0#1.base| .cse8))) (+ (select (select .cse10 |c_ULTIMATE.start_main_~#B~0#1.base|) (+ |c_ULTIMATE.start_main_~#B~0#1.offset| .cse9)) (select (select .cse10 |c_ULTIMATE.start_main_~#A~0#1.base|) (+ |c_ULTIMATE.start_main_~#A~0#1.offset| .cse9)))))))) (= (let ((.cse2 (store .cse5 |c_ULTIMATE.start_main_~#C~0#1.base| .cse6))) (+ (select (select .cse2 |c_ULTIMATE.start_main_~#B~0#1.base|) .cse3) (select (select .cse2 |c_ULTIMATE.start_main_~#A~0#1.base|) .cse4))) (select .cse6 .cse7)))))))) (or .cse12 (forall ((v_arrayElimArr_7 (Array Int Int)) (|aux_div_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| Int) (|aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| Int) (v_ArrVal_266 (Array Int Int))) (let ((.cse23 (+ (* |aux_div_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| 4294967296) |aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56|))) (or (<= |aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| 2147483647) (<= 4294967296 |aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56|) (let ((.cse14 (+ 8 |c_ULTIMATE.start_main_~#C~0#1.offset|)) (.cse17 (+ |c_ULTIMATE.start_main_~#A~0#1.offset| 8)) (.cse16 (+ |c_ULTIMATE.start_main_~#B~0#1.offset| 8)) (.cse18 (store |c_#memory_int| |c_ULTIMATE.start_main_~#B~0#1.base| v_arrayElimArr_7))) (let ((.cse13 (let ((.cse20 (* (mod |aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| 4294967296) 4)) (.cse19 (store v_ArrVal_266 .cse14 (let ((.cse22 (store .cse18 |c_ULTIMATE.start_main_~#C~0#1.base| v_ArrVal_266))) (+ (select (select .cse22 |c_ULTIMATE.start_main_~#A~0#1.base|) .cse17) (select (select .cse22 |c_ULTIMATE.start_main_~#B~0#1.base|) .cse16)))))) (store .cse19 (+ (- 17179869184) .cse20 |c_ULTIMATE.start_main_~#C~0#1.offset|) (let ((.cse21 (store .cse18 |c_ULTIMATE.start_main_~#C~0#1.base| .cse19))) (+ (select (select .cse21 |c_ULTIMATE.start_main_~#B~0#1.base|) (+ |c_ULTIMATE.start_main_~#B~0#1.offset| (- 17179869184) .cse20)) (select (select .cse21 |c_ULTIMATE.start_main_~#A~0#1.base|) (+ (- 17179869184) |c_ULTIMATE.start_main_~#A~0#1.offset| .cse20)))))))) (= (select .cse13 .cse14) (let ((.cse15 (store .cse18 |c_ULTIMATE.start_main_~#C~0#1.base| .cse13))) (+ (select (select .cse15 |c_ULTIMATE.start_main_~#B~0#1.base|) .cse16) (select (select .cse15 |c_ULTIMATE.start_main_~#A~0#1.base|) .cse17)))))) (<= 4294967296 .cse23) (<= .cse23 2147483647))))) (or .cse12 (forall ((v_arrayElimArr_6 (Array Int Int)) (|aux_div_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| Int) (|aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| Int) (v_ArrVal_266 (Array Int Int))) (let ((.cse34 (+ (* |aux_div_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| 4294967296) |aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56|))) (or (< |aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| 0) (let ((.cse25 (+ 8 |c_ULTIMATE.start_main_~#C~0#1.offset|)) (.cse27 (+ |c_ULTIMATE.start_main_~#A~0#1.offset| 8)) (.cse28 (+ |c_ULTIMATE.start_main_~#B~0#1.offset| 8)) (.cse29 (store |c_#memory_int| |c_ULTIMATE.start_main_~#B~0#1.base| v_arrayElimArr_6))) (let ((.cse24 (let ((.cse31 (* (mod |aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| 4294967296) 4)) (.cse30 (store v_ArrVal_266 .cse25 (let ((.cse33 (store .cse29 |c_ULTIMATE.start_main_~#C~0#1.base| v_ArrVal_266))) (+ (select (select .cse33 |c_ULTIMATE.start_main_~#A~0#1.base|) .cse27) (select (select .cse33 |c_ULTIMATE.start_main_~#B~0#1.base|) .cse28)))))) (store .cse30 (+ .cse31 |c_ULTIMATE.start_main_~#C~0#1.offset|) (let ((.cse32 (store .cse29 |c_ULTIMATE.start_main_~#C~0#1.base| .cse30))) (+ (select (select .cse32 |c_ULTIMATE.start_main_~#B~0#1.base|) (+ |c_ULTIMATE.start_main_~#B~0#1.offset| .cse31)) (select (select .cse32 |c_ULTIMATE.start_main_~#A~0#1.base|) (+ |c_ULTIMATE.start_main_~#A~0#1.offset| .cse31)))))))) (= (select .cse24 .cse25) (let ((.cse26 (store .cse29 |c_ULTIMATE.start_main_~#C~0#1.base| .cse24))) (+ (select (select .cse26 |c_ULTIMATE.start_main_~#A~0#1.base|) .cse27) (select (select .cse26 |c_ULTIMATE.start_main_~#B~0#1.base|) .cse28)))))) (< 2147483647 .cse34) (< .cse34 0) (< 2147483647 |aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56|))))) (or .cse0 (forall ((v_arrayElimArr_5 (Array Int Int)) (|aux_div_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| Int) (|aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| Int) (v_ArrVal_266 (Array Int Int))) (let ((.cse45 (+ (* |aux_div_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| 4294967296) |aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56|))) (or (<= |aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| 2147483647) (<= 4294967296 |aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56|) (let ((.cse36 (+ 8 |c_ULTIMATE.start_main_~#C~0#1.offset|)) (.cse39 (+ |c_ULTIMATE.start_main_~#B~0#1.offset| 8)) (.cse38 (+ |c_ULTIMATE.start_main_~#A~0#1.offset| 8)) (.cse40 (store |c_#memory_int| |c_ULTIMATE.start_main_~#B~0#1.base| v_arrayElimArr_5))) (let ((.cse35 (let ((.cse42 (* (mod |aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| 4294967296) 4)) (.cse41 (store v_ArrVal_266 .cse36 (let ((.cse44 (store .cse40 |c_ULTIMATE.start_main_~#C~0#1.base| v_ArrVal_266))) (+ (select (select .cse44 |c_ULTIMATE.start_main_~#B~0#1.base|) .cse39) (select (select .cse44 |c_ULTIMATE.start_main_~#A~0#1.base|) .cse38)))))) (store .cse41 (+ (- 17179869184) .cse42 |c_ULTIMATE.start_main_~#C~0#1.offset|) (let ((.cse43 (store .cse40 |c_ULTIMATE.start_main_~#C~0#1.base| .cse41))) (+ (select (select .cse43 |c_ULTIMATE.start_main_~#B~0#1.base|) (+ |c_ULTIMATE.start_main_~#B~0#1.offset| (- 17179869184) .cse42)) (select (select .cse43 |c_ULTIMATE.start_main_~#A~0#1.base|) (+ (- 17179869184) |c_ULTIMATE.start_main_~#A~0#1.offset| .cse42)))))))) (= (select .cse35 .cse36) (let ((.cse37 (store .cse40 |c_ULTIMATE.start_main_~#C~0#1.base| .cse35))) (+ (select (select .cse37 |c_ULTIMATE.start_main_~#A~0#1.base|) .cse38) (select (select .cse37 |c_ULTIMATE.start_main_~#B~0#1.base|) .cse39)))))) (<= 4294967296 .cse45) (<= .cse45 2147483647)))))))) is different from false [2022-07-22 15:10:12,411 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse11 (<= (mod (+ 2 |c_ULTIMATE.start_main_~i~0#1|) 4294967296) 2147483647))) (let ((.cse12 (not .cse11))) (and (or (forall ((v_arrayElimArr_6 (Array Int Int)) (|aux_div_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| Int) (|aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| Int) (v_ArrVal_266 (Array Int Int))) (let ((.cse10 (+ (* |aux_div_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| 4294967296) |aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56|))) (or (< |aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| 0) (let ((.cse1 (+ 8 |c_ULTIMATE.start_main_~#C~0#1.offset|)) (.cse3 (+ |c_ULTIMATE.start_main_~#A~0#1.offset| 8)) (.cse4 (+ |c_ULTIMATE.start_main_~#B~0#1.offset| 8)) (.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#B~0#1.base| v_arrayElimArr_6))) (let ((.cse0 (let ((.cse7 (* (mod |aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| 4294967296) 4)) (.cse6 (store v_ArrVal_266 .cse1 (let ((.cse9 (store .cse5 |c_ULTIMATE.start_main_~#C~0#1.base| v_ArrVal_266))) (+ (select (select .cse9 |c_ULTIMATE.start_main_~#A~0#1.base|) .cse3) (select (select .cse9 |c_ULTIMATE.start_main_~#B~0#1.base|) .cse4)))))) (store .cse6 (+ .cse7 |c_ULTIMATE.start_main_~#C~0#1.offset|) (let ((.cse8 (store .cse5 |c_ULTIMATE.start_main_~#C~0#1.base| .cse6))) (+ (select (select .cse8 |c_ULTIMATE.start_main_~#B~0#1.base|) (+ |c_ULTIMATE.start_main_~#B~0#1.offset| .cse7)) (select (select .cse8 |c_ULTIMATE.start_main_~#A~0#1.base|) (+ |c_ULTIMATE.start_main_~#A~0#1.offset| .cse7)))))))) (= (select .cse0 .cse1) (let ((.cse2 (store .cse5 |c_ULTIMATE.start_main_~#C~0#1.base| .cse0))) (+ (select (select .cse2 |c_ULTIMATE.start_main_~#A~0#1.base|) .cse3) (select (select .cse2 |c_ULTIMATE.start_main_~#B~0#1.base|) .cse4)))))) (< 2147483647 .cse10) (< .cse10 0) (< 2147483647 |aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56|)))) .cse11) (or .cse12 (forall ((v_arrayElimArr_5 (Array Int Int)) (|aux_div_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| Int) (|aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| Int) (v_ArrVal_266 (Array Int Int))) (let ((.cse23 (+ (* |aux_div_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| 4294967296) |aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56|))) (or (<= |aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| 2147483647) (<= 4294967296 |aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56|) (let ((.cse14 (+ 8 |c_ULTIMATE.start_main_~#C~0#1.offset|)) (.cse17 (+ |c_ULTIMATE.start_main_~#B~0#1.offset| 8)) (.cse16 (+ |c_ULTIMATE.start_main_~#A~0#1.offset| 8)) (.cse18 (store |c_#memory_int| |c_ULTIMATE.start_main_~#B~0#1.base| v_arrayElimArr_5))) (let ((.cse13 (let ((.cse20 (* (mod |aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| 4294967296) 4)) (.cse19 (store v_ArrVal_266 .cse14 (let ((.cse22 (store .cse18 |c_ULTIMATE.start_main_~#C~0#1.base| v_ArrVal_266))) (+ (select (select .cse22 |c_ULTIMATE.start_main_~#B~0#1.base|) .cse17) (select (select .cse22 |c_ULTIMATE.start_main_~#A~0#1.base|) .cse16)))))) (store .cse19 (+ (- 17179869184) .cse20 |c_ULTIMATE.start_main_~#C~0#1.offset|) (let ((.cse21 (store .cse18 |c_ULTIMATE.start_main_~#C~0#1.base| .cse19))) (+ (select (select .cse21 |c_ULTIMATE.start_main_~#B~0#1.base|) (+ |c_ULTIMATE.start_main_~#B~0#1.offset| (- 17179869184) .cse20)) (select (select .cse21 |c_ULTIMATE.start_main_~#A~0#1.base|) (+ (- 17179869184) |c_ULTIMATE.start_main_~#A~0#1.offset| .cse20)))))))) (= (select .cse13 .cse14) (let ((.cse15 (store .cse18 |c_ULTIMATE.start_main_~#C~0#1.base| .cse13))) (+ (select (select .cse15 |c_ULTIMATE.start_main_~#A~0#1.base|) .cse16) (select (select .cse15 |c_ULTIMATE.start_main_~#B~0#1.base|) .cse17)))))) (<= 4294967296 .cse23) (<= .cse23 2147483647))))) (or (forall ((v_arrayElimArr_7 (Array Int Int)) (|aux_div_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| Int) (|aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| Int) (v_ArrVal_266 (Array Int Int))) (let ((.cse34 (+ (* |aux_div_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| 4294967296) |aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56|))) (or (<= |aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| 2147483647) (<= 4294967296 |aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56|) (let ((.cse25 (+ 8 |c_ULTIMATE.start_main_~#C~0#1.offset|)) (.cse28 (+ |c_ULTIMATE.start_main_~#A~0#1.offset| 8)) (.cse27 (+ |c_ULTIMATE.start_main_~#B~0#1.offset| 8)) (.cse29 (store |c_#memory_int| |c_ULTIMATE.start_main_~#B~0#1.base| v_arrayElimArr_7))) (let ((.cse24 (let ((.cse31 (* (mod |aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| 4294967296) 4)) (.cse30 (store v_ArrVal_266 .cse25 (let ((.cse33 (store .cse29 |c_ULTIMATE.start_main_~#C~0#1.base| v_ArrVal_266))) (+ (select (select .cse33 |c_ULTIMATE.start_main_~#A~0#1.base|) .cse28) (select (select .cse33 |c_ULTIMATE.start_main_~#B~0#1.base|) .cse27)))))) (store .cse30 (+ (- 17179869184) .cse31 |c_ULTIMATE.start_main_~#C~0#1.offset|) (let ((.cse32 (store .cse29 |c_ULTIMATE.start_main_~#C~0#1.base| .cse30))) (+ (select (select .cse32 |c_ULTIMATE.start_main_~#B~0#1.base|) (+ |c_ULTIMATE.start_main_~#B~0#1.offset| (- 17179869184) .cse31)) (select (select .cse32 |c_ULTIMATE.start_main_~#A~0#1.base|) (+ (- 17179869184) |c_ULTIMATE.start_main_~#A~0#1.offset| .cse31)))))))) (= (select .cse24 .cse25) (let ((.cse26 (store .cse29 |c_ULTIMATE.start_main_~#C~0#1.base| .cse24))) (+ (select (select .cse26 |c_ULTIMATE.start_main_~#B~0#1.base|) .cse27) (select (select .cse26 |c_ULTIMATE.start_main_~#A~0#1.base|) .cse28)))))) (<= 4294967296 .cse34) (<= .cse34 2147483647)))) .cse11) (or .cse12 (forall ((v_arrayElimArr_8 (Array Int Int)) (|aux_div_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| Int) (|aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| Int) (v_ArrVal_266 (Array Int Int))) (let ((.cse35 (+ (* |aux_div_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| 4294967296) |aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56|))) (or (< |aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| 0) (< 2147483647 .cse35) (< .cse35 0) (< 2147483647 |aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56|) (let ((.cse41 (+ 8 |c_ULTIMATE.start_main_~#C~0#1.offset|)) (.cse38 (+ |c_ULTIMATE.start_main_~#A~0#1.offset| 8)) (.cse37 (+ |c_ULTIMATE.start_main_~#B~0#1.offset| 8)) (.cse39 (store |c_#memory_int| |c_ULTIMATE.start_main_~#B~0#1.base| v_arrayElimArr_8))) (let ((.cse40 (let ((.cse43 (* (mod |aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| 4294967296) 4)) (.cse42 (store v_ArrVal_266 .cse41 (let ((.cse45 (store .cse39 |c_ULTIMATE.start_main_~#C~0#1.base| v_ArrVal_266))) (+ (select (select .cse45 |c_ULTIMATE.start_main_~#A~0#1.base|) .cse38) (select (select .cse45 |c_ULTIMATE.start_main_~#B~0#1.base|) .cse37)))))) (store .cse42 (+ .cse43 |c_ULTIMATE.start_main_~#C~0#1.offset|) (let ((.cse44 (store .cse39 |c_ULTIMATE.start_main_~#C~0#1.base| .cse42))) (+ (select (select .cse44 |c_ULTIMATE.start_main_~#B~0#1.base|) (+ |c_ULTIMATE.start_main_~#B~0#1.offset| .cse43)) (select (select .cse44 |c_ULTIMATE.start_main_~#A~0#1.base|) (+ |c_ULTIMATE.start_main_~#A~0#1.offset| .cse43)))))))) (= (let ((.cse36 (store .cse39 |c_ULTIMATE.start_main_~#C~0#1.base| .cse40))) (+ (select (select .cse36 |c_ULTIMATE.start_main_~#B~0#1.base|) .cse37) (select (select .cse36 |c_ULTIMATE.start_main_~#A~0#1.base|) .cse38))) (select .cse40 .cse41))))))))))) is different from false [2022-07-22 15:10:12,769 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_arrayElimArr_5 (Array Int Int)) (|aux_div_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| Int) (|aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| Int) (v_ArrVal_266 (Array Int Int))) (let ((.cse10 (+ (* |aux_div_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| 4294967296) |aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56|))) (or (<= |aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| 2147483647) (<= 4294967296 |aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56|) (let ((.cse1 (+ 8 |c_ULTIMATE.start_main_~#C~0#1.offset|)) (.cse4 (+ |c_ULTIMATE.start_main_~#B~0#1.offset| 8)) (.cse3 (+ |c_ULTIMATE.start_main_~#A~0#1.offset| 8)) (.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#B~0#1.base| v_arrayElimArr_5))) (let ((.cse0 (let ((.cse7 (* (mod |aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| 4294967296) 4)) (.cse6 (store v_ArrVal_266 .cse1 (let ((.cse9 (store .cse5 |c_ULTIMATE.start_main_~#C~0#1.base| v_ArrVal_266))) (+ (select (select .cse9 |c_ULTIMATE.start_main_~#B~0#1.base|) .cse4) (select (select .cse9 |c_ULTIMATE.start_main_~#A~0#1.base|) .cse3)))))) (store .cse6 (+ (- 17179869184) .cse7 |c_ULTIMATE.start_main_~#C~0#1.offset|) (let ((.cse8 (store .cse5 |c_ULTIMATE.start_main_~#C~0#1.base| .cse6))) (+ (select (select .cse8 |c_ULTIMATE.start_main_~#B~0#1.base|) (+ |c_ULTIMATE.start_main_~#B~0#1.offset| (- 17179869184) .cse7)) (select (select .cse8 |c_ULTIMATE.start_main_~#A~0#1.base|) (+ (- 17179869184) |c_ULTIMATE.start_main_~#A~0#1.offset| .cse7)))))))) (= (select .cse0 .cse1) (let ((.cse2 (store .cse5 |c_ULTIMATE.start_main_~#C~0#1.base| .cse0))) (+ (select (select .cse2 |c_ULTIMATE.start_main_~#A~0#1.base|) .cse3) (select (select .cse2 |c_ULTIMATE.start_main_~#B~0#1.base|) .cse4)))))) (<= 4294967296 .cse10) (<= .cse10 2147483647)))) (forall ((v_arrayElimArr_8 (Array Int Int)) (|aux_div_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| Int) (|aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| Int) (v_ArrVal_266 (Array Int Int))) (let ((.cse11 (+ (* |aux_div_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| 4294967296) |aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56|))) (or (< |aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| 0) (< 2147483647 .cse11) (< .cse11 0) (< 2147483647 |aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56|) (let ((.cse17 (+ 8 |c_ULTIMATE.start_main_~#C~0#1.offset|)) (.cse14 (+ |c_ULTIMATE.start_main_~#A~0#1.offset| 8)) (.cse13 (+ |c_ULTIMATE.start_main_~#B~0#1.offset| 8)) (.cse15 (store |c_#memory_int| |c_ULTIMATE.start_main_~#B~0#1.base| v_arrayElimArr_8))) (let ((.cse16 (let ((.cse19 (* (mod |aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_45_56| 4294967296) 4)) (.cse18 (store v_ArrVal_266 .cse17 (let ((.cse21 (store .cse15 |c_ULTIMATE.start_main_~#C~0#1.base| v_ArrVal_266))) (+ (select (select .cse21 |c_ULTIMATE.start_main_~#A~0#1.base|) .cse14) (select (select .cse21 |c_ULTIMATE.start_main_~#B~0#1.base|) .cse13)))))) (store .cse18 (+ .cse19 |c_ULTIMATE.start_main_~#C~0#1.offset|) (let ((.cse20 (store .cse15 |c_ULTIMATE.start_main_~#C~0#1.base| .cse18))) (+ (select (select .cse20 |c_ULTIMATE.start_main_~#B~0#1.base|) (+ |c_ULTIMATE.start_main_~#B~0#1.offset| .cse19)) (select (select .cse20 |c_ULTIMATE.start_main_~#A~0#1.base|) (+ |c_ULTIMATE.start_main_~#A~0#1.offset| .cse19)))))))) (= (let ((.cse12 (store .cse15 |c_ULTIMATE.start_main_~#C~0#1.base| .cse16))) (+ (select (select .cse12 |c_ULTIMATE.start_main_~#B~0#1.base|) .cse13) (select (select .cse12 |c_ULTIMATE.start_main_~#A~0#1.base|) .cse14))) (select .cse16 .cse17)))))))) is different from false [2022-07-22 15:10:13,403 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 634675 treesize of output 634671 [2022-07-22 15:10:20,103 INFO L356 Elim1Store]: treesize reduction 54, result has 47.6 percent of original size [2022-07-22 15:10:20,121 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 9591837 treesize of output 7510862