./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-fpi/sina3.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c3fed411 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/array-fpi/sina3.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2aebf3cfbf85ca5d76e40b9ce94a108ab82985532ad1ea09b88a009b3e11ff5a --- Real Ultimate output --- This is Ultimate 0.2.2-tmp.no-commuhash-c3fed41 [2021-12-17 02:20:39,770 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-17 02:20:39,771 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-17 02:20:39,803 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-17 02:20:39,804 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-17 02:20:39,805 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-17 02:20:39,806 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-17 02:20:39,808 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-17 02:20:39,809 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-17 02:20:39,810 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-17 02:20:39,811 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-17 02:20:39,812 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-17 02:20:39,812 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-17 02:20:39,813 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-17 02:20:39,814 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-17 02:20:39,816 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-17 02:20:39,816 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-17 02:20:39,817 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-17 02:20:39,819 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-17 02:20:39,820 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-17 02:20:39,822 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-17 02:20:39,825 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-17 02:20:39,826 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-17 02:20:39,827 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-17 02:20:39,829 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-17 02:20:39,829 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-17 02:20:39,830 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-17 02:20:39,830 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-17 02:20:39,831 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-17 02:20:39,832 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-17 02:20:39,832 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-17 02:20:39,832 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-17 02:20:39,833 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-17 02:20:39,834 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-17 02:20:39,835 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-17 02:20:39,835 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-17 02:20:39,836 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-17 02:20:39,836 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-17 02:20:39,836 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-17 02:20:39,837 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-17 02:20:39,838 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-17 02:20:39,844 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-17 02:20:39,878 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-17 02:20:39,878 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-17 02:20:39,879 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-17 02:20:39,879 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-17 02:20:39,880 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-17 02:20:39,880 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-17 02:20:39,880 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-17 02:20:39,881 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-17 02:20:39,881 INFO L138 SettingsManager]: * Use SBE=true [2021-12-17 02:20:39,881 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-17 02:20:39,882 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-17 02:20:39,882 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-17 02:20:39,882 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-17 02:20:39,883 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-17 02:20:39,883 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-17 02:20:39,883 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-17 02:20:39,883 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-17 02:20:39,883 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-17 02:20:39,883 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-17 02:20:39,884 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-17 02:20:39,884 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-17 02:20:39,884 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-17 02:20:39,884 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-17 02:20:39,884 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-17 02:20:39,885 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-17 02:20:39,885 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-17 02:20:39,885 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-17 02:20:39,885 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-17 02:20:39,886 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-17 02:20:39,886 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-17 02:20:39,886 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-17 02:20:39,886 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-17 02:20:39,887 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-17 02:20:39,887 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-17 02:20:39,887 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 -> 2aebf3cfbf85ca5d76e40b9ce94a108ab82985532ad1ea09b88a009b3e11ff5a [2021-12-17 02:20:40,078 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-17 02:20:40,103 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-17 02:20:40,105 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-17 02:20:40,106 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-17 02:20:40,106 INFO L275 PluginConnector]: CDTParser initialized [2021-12-17 02:20:40,107 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-fpi/sina3.c [2021-12-17 02:20:40,183 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ab64d7be1/a189309580754aef9d3490f29923b82c/FLAG73e9a4c87 [2021-12-17 02:20:40,507 INFO L306 CDTParser]: Found 1 translation units. [2021-12-17 02:20:40,508 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/sina3.c [2021-12-17 02:20:40,514 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ab64d7be1/a189309580754aef9d3490f29923b82c/FLAG73e9a4c87 [2021-12-17 02:20:40,930 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ab64d7be1/a189309580754aef9d3490f29923b82c [2021-12-17 02:20:40,932 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-17 02:20:40,933 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-17 02:20:40,943 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-17 02:20:40,943 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-17 02:20:40,946 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-17 02:20:40,947 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.12 02:20:40" (1/1) ... [2021-12-17 02:20:40,948 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@583d62a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 02:20:40, skipping insertion in model container [2021-12-17 02:20:40,948 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.12 02:20:40" (1/1) ... [2021-12-17 02:20:40,954 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-17 02:20:40,965 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-17 02:20:41,107 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/sina3.c[588,601] [2021-12-17 02:20:41,124 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-17 02:20:41,129 INFO L203 MainTranslator]: Completed pre-run [2021-12-17 02:20:41,142 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/sina3.c[588,601] [2021-12-17 02:20:41,153 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-17 02:20:41,170 INFO L208 MainTranslator]: Completed translation [2021-12-17 02:20:41,170 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 02:20:41 WrapperNode [2021-12-17 02:20:41,171 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-17 02:20:41,172 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-17 02:20:41,172 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-17 02:20:41,172 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-17 02:20:41,178 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 02:20:41" (1/1) ... [2021-12-17 02:20:41,191 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 02:20:41" (1/1) ... [2021-12-17 02:20:41,213 INFO L137 Inliner]: procedures = 17, calls = 24, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 96 [2021-12-17 02:20:41,213 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-17 02:20:41,215 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-17 02:20:41,215 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-17 02:20:41,215 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-17 02:20:41,221 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 02:20:41" (1/1) ... [2021-12-17 02:20:41,222 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 02:20:41" (1/1) ... [2021-12-17 02:20:41,226 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 02:20:41" (1/1) ... [2021-12-17 02:20:41,226 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 02:20:41" (1/1) ... [2021-12-17 02:20:41,241 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 02:20:41" (1/1) ... [2021-12-17 02:20:41,246 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 02:20:41" (1/1) ... [2021-12-17 02:20:41,250 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 02:20:41" (1/1) ... [2021-12-17 02:20:41,253 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-17 02:20:41,255 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-17 02:20:41,256 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-17 02:20:41,256 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-17 02:20:41,257 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 02:20:41" (1/1) ... [2021-12-17 02:20:41,262 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-17 02:20:41,271 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 02:20:41,284 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) [2021-12-17 02:20:41,296 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 [2021-12-17 02:20:41,322 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-17 02:20:41,323 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-17 02:20:41,323 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-17 02:20:41,323 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-17 02:20:41,323 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-17 02:20:41,323 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-17 02:20:41,323 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-17 02:20:41,324 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-17 02:20:41,324 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-17 02:20:41,376 INFO L236 CfgBuilder]: Building ICFG [2021-12-17 02:20:41,378 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-17 02:20:41,496 INFO L277 CfgBuilder]: Performing block encoding [2021-12-17 02:20:41,501 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-17 02:20:41,502 INFO L301 CfgBuilder]: Removed 5 assume(true) statements. [2021-12-17 02:20:41,503 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 02:20:41 BoogieIcfgContainer [2021-12-17 02:20:41,503 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-17 02:20:41,505 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-17 02:20:41,505 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-17 02:20:41,508 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-17 02:20:41,508 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.12 02:20:40" (1/3) ... [2021-12-17 02:20:41,508 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4be85523 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.12 02:20:41, skipping insertion in model container [2021-12-17 02:20:41,509 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 02:20:41" (2/3) ... [2021-12-17 02:20:41,509 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4be85523 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.12 02:20:41, skipping insertion in model container [2021-12-17 02:20:41,509 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 02:20:41" (3/3) ... [2021-12-17 02:20:41,510 INFO L111 eAbstractionObserver]: Analyzing ICFG sina3.c [2021-12-17 02:20:41,514 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-17 02:20:41,514 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-17 02:20:41,549 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-17 02:20:41,555 INFO L339 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, mLoopAccelerationTechnique=FAST_UPR [2021-12-17 02:20:41,558 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-17 02:20:41,574 INFO L276 IsEmpty]: Start isEmpty. Operand has 27 states, 25 states have (on average 1.56) internal successors, (39), 26 states have internal predecessors, (39), 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) [2021-12-17 02:20:41,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-12-17 02:20:41,578 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 02:20:41,578 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 02:20:41,579 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 02:20:41,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 02:20:41,583 INFO L85 PathProgramCache]: Analyzing trace with hash 1389277550, now seen corresponding path program 1 times [2021-12-17 02:20:41,589 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 02:20:41,589 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000096645] [2021-12-17 02:20:41,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 02:20:41,590 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 02:20:41,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 02:20:41,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 02:20:41,715 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 02:20:41,715 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000096645] [2021-12-17 02:20:41,716 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1000096645] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 02:20:41,716 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 02:20:41,716 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-17 02:20:41,718 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437067044] [2021-12-17 02:20:41,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 02:20:41,721 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-12-17 02:20:41,722 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 02:20:41,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-12-17 02:20:41,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-17 02:20:41,744 INFO L87 Difference]: Start difference. First operand has 27 states, 25 states have (on average 1.56) internal successors, (39), 26 states have internal predecessors, (39), 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 8.0) internal successors, (16), 2 states have internal predecessors, (16), 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) [2021-12-17 02:20:41,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 02:20:41,757 INFO L93 Difference]: Finished difference Result 50 states and 72 transitions. [2021-12-17 02:20:41,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-12-17 02:20:41,759 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-12-17 02:20:41,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 02:20:41,764 INFO L225 Difference]: With dead ends: 50 [2021-12-17 02:20:41,765 INFO L226 Difference]: Without dead ends: 23 [2021-12-17 02:20:41,767 INFO L932 BasicCegarLoop]: 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 [2021-12-17 02:20:41,773 INFO L933 BasicCegarLoop]: 32 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, 32 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 [2021-12-17 02:20:41,774 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 02:20:41,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2021-12-17 02:20:41,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2021-12-17 02:20:41,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 states have internal predecessors, (27), 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) [2021-12-17 02:20:41,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2021-12-17 02:20:41,815 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 16 [2021-12-17 02:20:41,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 02:20:41,815 INFO L470 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2021-12-17 02:20:41,816 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 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) [2021-12-17 02:20:41,816 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2021-12-17 02:20:41,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-12-17 02:20:41,817 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 02:20:41,817 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 02:20:41,817 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-17 02:20:41,818 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 02:20:41,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 02:20:41,823 INFO L85 PathProgramCache]: Analyzing trace with hash 796930410, now seen corresponding path program 1 times [2021-12-17 02:20:41,823 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 02:20:41,828 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792934851] [2021-12-17 02:20:41,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 02:20:41,829 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 02:20:41,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 02:20:41,953 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 02:20:41,953 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 02:20:41,954 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792934851] [2021-12-17 02:20:41,955 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1792934851] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 02:20:41,955 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 02:20:41,955 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-17 02:20:41,956 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553636173] [2021-12-17 02:20:41,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 02:20:41,958 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-17 02:20:41,959 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 02:20:41,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-17 02:20:41,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-17 02:20:41,961 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 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) [2021-12-17 02:20:42,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 02:20:42,034 INFO L93 Difference]: Finished difference Result 53 states and 64 transitions. [2021-12-17 02:20:42,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-17 02:20:42,035 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-12-17 02:20:42,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 02:20:42,036 INFO L225 Difference]: With dead ends: 53 [2021-12-17 02:20:42,037 INFO L226 Difference]: Without dead ends: 37 [2021-12-17 02:20:42,040 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-17 02:20:42,042 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 41 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-17 02:20:42,043 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [41 Valid, 17 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-17 02:20:42,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2021-12-17 02:20:42,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 27. [2021-12-17 02:20:42,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 26 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 02:20:42,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2021-12-17 02:20:42,060 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 16 [2021-12-17 02:20:42,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 02:20:42,062 INFO L470 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2021-12-17 02:20:42,064 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 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) [2021-12-17 02:20:42,066 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2021-12-17 02:20:42,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-12-17 02:20:42,067 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 02:20:42,067 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 02:20:42,068 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-17 02:20:42,068 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 02:20:42,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 02:20:42,069 INFO L85 PathProgramCache]: Analyzing trace with hash 495241442, now seen corresponding path program 1 times [2021-12-17 02:20:42,072 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 02:20:42,072 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279488011] [2021-12-17 02:20:42,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 02:20:42,072 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 02:20:42,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 02:20:42,992 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 02:20:42,992 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 02:20:42,992 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279488011] [2021-12-17 02:20:42,993 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [279488011] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 02:20:42,993 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [209120854] [2021-12-17 02:20:42,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 02:20:42,994 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 02:20:42,994 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 02:20:42,999 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) [2021-12-17 02:20:43,007 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-12-17 02:20:43,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 02:20:43,067 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 53 conjunts are in the unsatisfiable core [2021-12-17 02:20:43,073 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 02:20:43,170 INFO L388 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 [2021-12-17 02:20:43,189 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-17 02:20:43,243 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:20:43,245 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2021-12-17 02:20:43,523 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:20:43,525 INFO L388 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 26 treesize of output 28 [2021-12-17 02:20:43,733 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:20:43,735 INFO L388 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 43 treesize of output 33 [2021-12-17 02:20:43,915 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:20:43,916 INFO L388 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 47 treesize of output 33 [2021-12-17 02:20:44,226 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:20:44,231 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-17 02:20:44,231 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 32 [2021-12-17 02:20:44,248 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 02:20:44,249 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 02:20:44,672 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 02:20:44,672 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 02:20:44,673 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 02:20:44,687 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 02:20:44,687 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [209120854] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 02:20:44,687 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-17 02:20:44,688 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 38 [2021-12-17 02:20:44,688 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036863629] [2021-12-17 02:20:44,688 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-17 02:20:44,689 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2021-12-17 02:20:44,689 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 02:20:44,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2021-12-17 02:20:44,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=223, Invalid=1183, Unknown=0, NotChecked=0, Total=1406 [2021-12-17 02:20:44,692 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand has 38 states, 38 states have (on average 1.605263157894737) internal successors, (61), 38 states have internal predecessors, (61), 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) [2021-12-17 02:20:45,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 02:20:45,171 INFO L93 Difference]: Finished difference Result 55 states and 64 transitions. [2021-12-17 02:20:45,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-12-17 02:20:45,172 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 1.605263157894737) internal successors, (61), 38 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2021-12-17 02:20:45,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 02:20:45,172 INFO L225 Difference]: With dead ends: 55 [2021-12-17 02:20:45,173 INFO L226 Difference]: Without dead ends: 53 [2021-12-17 02:20:45,174 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 24 SyntacticMatches, 5 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 689 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=292, Invalid=1430, Unknown=0, NotChecked=0, Total=1722 [2021-12-17 02:20:45,175 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 41 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 336 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 418 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 336 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 13 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-17 02:20:45,175 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [41 Valid, 114 Invalid, 418 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 336 Invalid, 0 Unknown, 13 Unchecked, 0.3s Time] [2021-12-17 02:20:45,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2021-12-17 02:20:45,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 44. [2021-12-17 02:20:45,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 43 states have (on average 1.2093023255813953) internal successors, (52), 43 states have internal predecessors, (52), 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) [2021-12-17 02:20:45,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 52 transitions. [2021-12-17 02:20:45,182 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 52 transitions. Word has length 24 [2021-12-17 02:20:45,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 02:20:45,182 INFO L470 AbstractCegarLoop]: Abstraction has 44 states and 52 transitions. [2021-12-17 02:20:45,183 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 1.605263157894737) internal successors, (61), 38 states have internal predecessors, (61), 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) [2021-12-17 02:20:45,183 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 52 transitions. [2021-12-17 02:20:45,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-12-17 02:20:45,184 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 02:20:45,184 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 02:20:45,208 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-12-17 02:20:45,399 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 02:20:45,400 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 02:20:45,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 02:20:45,400 INFO L85 PathProgramCache]: Analyzing trace with hash 831040416, now seen corresponding path program 2 times [2021-12-17 02:20:45,400 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 02:20:45,400 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655743933] [2021-12-17 02:20:45,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 02:20:45,401 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 02:20:45,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 02:20:45,454 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-17 02:20:45,454 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 02:20:45,454 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655743933] [2021-12-17 02:20:45,455 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [655743933] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 02:20:45,455 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1424006244] [2021-12-17 02:20:45,455 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-17 02:20:45,455 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 02:20:45,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 02:20:45,456 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) [2021-12-17 02:20:45,464 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-12-17 02:20:45,516 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-17 02:20:45,516 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 02:20:45,517 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-17 02:20:45,518 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 02:20:45,578 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-17 02:20:45,579 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 02:20:45,627 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-17 02:20:45,627 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1424006244] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 02:20:45,628 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-17 02:20:45,628 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2021-12-17 02:20:45,628 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314565222] [2021-12-17 02:20:45,628 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-17 02:20:45,629 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-17 02:20:45,629 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 02:20:45,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-17 02:20:45,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2021-12-17 02:20:45,630 INFO L87 Difference]: Start difference. First operand 44 states and 52 transitions. Second operand has 11 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 02:20:45,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 02:20:45,763 INFO L93 Difference]: Finished difference Result 110 states and 128 transitions. [2021-12-17 02:20:45,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-17 02:20:45,763 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2021-12-17 02:20:45,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 02:20:45,766 INFO L225 Difference]: With dead ends: 110 [2021-12-17 02:20:45,766 INFO L226 Difference]: Without dead ends: 66 [2021-12-17 02:20:45,766 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2021-12-17 02:20:45,768 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 56 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-17 02:20:45,769 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [56 Valid, 61 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-17 02:20:45,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2021-12-17 02:20:45,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 46. [2021-12-17 02:20:45,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 45 states have (on average 1.1777777777777778) internal successors, (53), 45 states have internal predecessors, (53), 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) [2021-12-17 02:20:45,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 53 transitions. [2021-12-17 02:20:45,789 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 53 transitions. Word has length 26 [2021-12-17 02:20:45,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 02:20:45,789 INFO L470 AbstractCegarLoop]: Abstraction has 46 states and 53 transitions. [2021-12-17 02:20:45,789 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 02:20:45,789 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 53 transitions. [2021-12-17 02:20:45,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-12-17 02:20:45,790 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 02:20:45,791 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 02:20:45,808 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-12-17 02:20:45,995 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2021-12-17 02:20:45,998 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 02:20:45,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 02:20:45,999 INFO L85 PathProgramCache]: Analyzing trace with hash -587916192, now seen corresponding path program 3 times [2021-12-17 02:20:45,999 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 02:20:45,999 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323512955] [2021-12-17 02:20:45,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 02:20:45,999 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 02:20:46,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 02:20:46,048 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-17 02:20:46,049 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 02:20:46,049 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323512955] [2021-12-17 02:20:46,049 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1323512955] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 02:20:46,049 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [119624268] [2021-12-17 02:20:46,049 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-17 02:20:46,049 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 02:20:46,050 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 02:20:46,052 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) [2021-12-17 02:20:46,073 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-12-17 02:20:46,120 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-12-17 02:20:46,121 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 02:20:46,122 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-17 02:20:46,123 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 02:20:46,198 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-17 02:20:46,199 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 02:20:46,254 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-17 02:20:46,255 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [119624268] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 02:20:46,255 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-17 02:20:46,255 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2021-12-17 02:20:46,255 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916939966] [2021-12-17 02:20:46,255 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-17 02:20:46,256 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-17 02:20:46,256 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 02:20:46,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-17 02:20:46,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2021-12-17 02:20:46,257 INFO L87 Difference]: Start difference. First operand 46 states and 53 transitions. Second operand has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 11 states have internal predecessors, (41), 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) [2021-12-17 02:20:46,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 02:20:46,377 INFO L93 Difference]: Finished difference Result 63 states and 69 transitions. [2021-12-17 02:20:46,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-17 02:20:46,378 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 11 states have internal predecessors, (41), 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 [2021-12-17 02:20:46,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 02:20:46,379 INFO L225 Difference]: With dead ends: 63 [2021-12-17 02:20:46,379 INFO L226 Difference]: Without dead ends: 50 [2021-12-17 02:20:46,379 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 46 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2021-12-17 02:20:46,380 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 60 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-17 02:20:46,380 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [60 Valid, 53 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-17 02:20:46,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2021-12-17 02:20:46,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 35. [2021-12-17 02:20:46,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 34 states have (on average 1.1470588235294117) internal successors, (39), 34 states have internal predecessors, (39), 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) [2021-12-17 02:20:46,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2021-12-17 02:20:46,384 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 26 [2021-12-17 02:20:46,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 02:20:46,385 INFO L470 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2021-12-17 02:20:46,385 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 11 states have internal predecessors, (41), 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) [2021-12-17 02:20:46,385 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2021-12-17 02:20:46,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-12-17 02:20:46,386 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 02:20:46,386 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 02:20:46,415 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-12-17 02:20:46,609 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 02:20:46,609 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 02:20:46,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 02:20:46,610 INFO L85 PathProgramCache]: Analyzing trace with hash -826292134, now seen corresponding path program 4 times [2021-12-17 02:20:46,610 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 02:20:46,610 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165067107] [2021-12-17 02:20:46,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 02:20:46,610 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 02:20:46,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 02:20:48,001 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 02:20:48,002 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 02:20:48,002 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165067107] [2021-12-17 02:20:48,002 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1165067107] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 02:20:48,002 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1780705097] [2021-12-17 02:20:48,002 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-12-17 02:20:48,002 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 02:20:48,002 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 02:20:48,004 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) [2021-12-17 02:20:48,027 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-12-17 02:20:48,081 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-12-17 02:20:48,082 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 02:20:48,083 WARN L261 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 74 conjunts are in the unsatisfiable core [2021-12-17 02:20:48,090 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 02:20:48,108 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:20:48,110 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2021-12-17 02:20:48,120 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-17 02:20:48,161 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:20:48,162 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2021-12-17 02:20:48,294 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:20:48,295 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:20:48,296 INFO L388 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 35 treesize of output 37 [2021-12-17 02:20:48,598 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:20:48,599 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:20:48,600 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:20:48,601 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2021-12-17 02:20:48,790 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:20:48,791 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:20:48,791 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:20:48,792 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:20:48,794 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 54 [2021-12-17 02:20:49,004 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:20:49,005 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 02:20:49,005 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:20:49,006 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:20:49,007 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 53 [2021-12-17 02:20:49,172 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:20:49,173 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:20:49,174 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:20:49,175 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 45 [2021-12-17 02:20:49,409 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:20:49,410 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:20:49,415 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 02:20:49,416 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:20:49,416 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 02:20:49,418 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 51 [2021-12-17 02:20:49,667 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:20:49,668 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:20:49,669 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:20:49,670 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:20:49,679 INFO L354 Elim1Store]: treesize reduction 33, result has 31.3 percent of original size [2021-12-17 02:20:49,680 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 56 treesize of output 62 [2021-12-17 02:20:49,972 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:20:49,973 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:20:49,978 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-17 02:20:49,979 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 36 [2021-12-17 02:20:50,013 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 02:20:50,013 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 02:20:52,161 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_69| Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_69| (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (forall ((v_ArrVal_234 Int)) (= (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_69| 8)) v_ArrVal_234) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ c_~N~0 1))))) is different from false [2021-12-17 02:21:08,387 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_75| Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_75| (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (forall ((v_ArrVal_234 Int) (|v_ULTIMATE.start_main_~i~0#1_69| Int) (v_ArrVal_226 Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_69| 1) (= (select (store (let ((.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| (* |v_ULTIMATE.start_main_~i~0#1_75| 4)) v_ArrVal_226)))) (let ((.cse5 (select .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse2 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse1 (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse3))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8)))) (let ((.cse0 (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse2 .cse3))))) (store (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset| (+ (select (select .cse0 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|) .cse1 .cse2 .cse3))))))) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_69| 8)) v_ArrVal_234) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ c_~N~0 1)))))) is different from false [2021-12-17 02:21:10,439 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_234 Int) (|v_ULTIMATE.start_main_~i~0#1_69| Int) (|v_ULTIMATE.start_main_~i~0#1_75| Int) (v_ArrVal_226 Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_75| (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (= (select (store (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|) (+ |c_ULTIMATE.start_main_~b~0#1.offset| (* |c_ULTIMATE.start_main_~i~0#1| 4)) 1) (+ |c_ULTIMATE.start_main_~b~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_75| 4)) v_ArrVal_226)))) (let ((.cse5 (select .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse1 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse3 (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse2))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8)))) (let ((.cse0 (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse2 .cse3))))) (store (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset| (+ (select (select .cse0 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|) .cse1 .cse2 .cse3))))))) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_69| 8)) v_ArrVal_234) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ c_~N~0 1)) (< |v_ULTIMATE.start_main_~i~0#1_69| 1))) is different from false [2021-12-17 02:21:12,055 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_234 Int) (|v_ULTIMATE.start_main_~i~0#1_69| Int) (|v_ULTIMATE.start_main_~i~0#1_75| Int) (v_ArrVal_226 Int)) (or (= (select (store (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| 1) (+ |c_ULTIMATE.start_main_~b~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_75| 4)) v_ArrVal_226)))) (let ((.cse5 (select .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse1 (select (select .cse4 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse2 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse3 (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse2))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8)))) (let ((.cse0 (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse2 .cse3))))) (store (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse1 .cse2 .cse3 (select (select .cse0 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|)))))))) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_69| 8)) v_ArrVal_234) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ c_~N~0 1)) (< |v_ULTIMATE.start_main_~i~0#1_69| 1) (< |v_ULTIMATE.start_main_~i~0#1_75| 1))) is different from false [2021-12-17 02:22:20,877 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2021-12-17 02:22:20,877 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1780705097] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 02:22:20,878 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-17 02:22:20,878 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 21, 22] total 62 [2021-12-17 02:22:20,878 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955896429] [2021-12-17 02:22:20,878 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-17 02:22:20,879 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 62 states [2021-12-17 02:22:20,879 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 02:22:20,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2021-12-17 02:22:20,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=344, Invalid=2934, Unknown=44, NotChecked=460, Total=3782 [2021-12-17 02:22:20,881 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand has 62 states, 62 states have (on average 1.3709677419354838) internal successors, (85), 62 states have internal predecessors, (85), 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) [2021-12-17 02:22:23,824 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (and (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 0) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (= 0 |c_ULTIMATE.start_main_~b~0#1.offset|) (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~i~0#1| 0) (< 1 c_~N~0) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|) (+ |c_ULTIMATE.start_main_~b~0#1.offset| (* |c_ULTIMATE.start_main_~i~0#1| 4))) 1) (= (select .cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8)) 1) (forall ((|v_ULTIMATE.start_main_~i~0#1_75| Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_75| (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (forall ((v_ArrVal_234 Int) (|v_ULTIMATE.start_main_~i~0#1_69| Int) (v_ArrVal_226 Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_69| 1) (= (select (store (let ((.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| (* |v_ULTIMATE.start_main_~i~0#1_75| 4)) v_ArrVal_226)))) (let ((.cse6 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse3 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse4 (select (select .cse5 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse2 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse4))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8)))) (let ((.cse1 (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse3 .cse4))))) (store (select .cse1 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset| (+ (select (select .cse1 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|) .cse2 .cse3 .cse4))))))) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_69| 8)) v_ArrVal_234) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ c_~N~0 1)))))) (< (+ |c_ULTIMATE.start_main_~a~0#1.base| 1) |c_ULTIMATE.start_main_~#sum~0#1.base|) (<= c_~N~0 2) (< (+ |c_ULTIMATE.start_main_~b~0#1.base| 1) |c_ULTIMATE.start_main_~#sum~0#1.base|))) is different from false [2021-12-17 02:22:26,333 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (and (= (select .cse0 (+ (* |c_ULTIMATE.start_main_~i~0#1| 8) |c_ULTIMATE.start_main_~a~0#1.offset|)) (+ c_~N~0 1)) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (<= 2 .cse1) (forall ((|v_ULTIMATE.start_main_~i~0#1_69| Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_69| (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (forall ((v_ArrVal_234 Int)) (= (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_69| 8)) v_ArrVal_234) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ c_~N~0 1))))) (<= .cse1 2) (= |c_ULTIMATE.start_main_~i~0#1| 0) (= |c_ULTIMATE.start_main_~b~0#1.offset| 0) (< 1 c_~N~0) (= (select .cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8)) 1) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|) (+ |c_ULTIMATE.start_main_~b~0#1.offset| (* |c_ULTIMATE.start_main_~i~0#1| 4))) 1) (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int) (|ULTIMATE.start_main_~b~0#1.base| Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse3 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse2 (select (select |c_#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (* |c_ULTIMATE.start_main_~i~0#1| 4)))) (and (< (+ |c_ULTIMATE.start_main_~a~0#1.base| 1) |ULTIMATE.start_main_~#sum~0#1.base|) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 8) |c_ULTIMATE.start_main_~a~0#1.offset|)) (+ .cse2 .cse3)) (= .cse3 2) (< (+ |ULTIMATE.start_main_~b~0#1.base| 1) |ULTIMATE.start_main_~#sum~0#1.base|) (= .cse2 1)))) (<= c_~N~0 2) (= 2 c_~N~0) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~b~0#1.base|)) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)))) is different from false [2021-12-17 02:22:28,393 WARN L838 $PredicateComparison]: unable to prove that (and (< 1 c_~N~0) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (forall ((|v_ULTIMATE.start_main_~i~0#1_69| Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_69| (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (forall ((v_ArrVal_234 Int)) (= (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_69| 8)) v_ArrVal_234) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ c_~N~0 1))))) (<= c_~N~0 2) (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int) (|ULTIMATE.start_main_~b~0#1.base| Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse0 (select (select |c_#memory_int| |ULTIMATE.start_main_~b~0#1.base|) 0))) (and (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ .cse0 2)) (< (+ |c_ULTIMATE.start_main_~a~0#1.base| 1) |ULTIMATE.start_main_~#sum~0#1.base|) (= .cse0 1) (= (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) 2) (< (+ |ULTIMATE.start_main_~b~0#1.base| 1) |ULTIMATE.start_main_~#sum~0#1.base|))))) is different from false [2021-12-17 02:22:30,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 02:22:30,556 INFO L93 Difference]: Finished difference Result 70 states and 79 transitions. [2021-12-17 02:22:30,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2021-12-17 02:22:30,556 INFO L78 Accepts]: Start accepts. Automaton has has 62 states, 62 states have (on average 1.3709677419354838) internal successors, (85), 62 states have internal predecessors, (85), 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 32 [2021-12-17 02:22:30,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 02:22:30,557 INFO L225 Difference]: With dead ends: 70 [2021-12-17 02:22:30,557 INFO L226 Difference]: Without dead ends: 68 [2021-12-17 02:22:30,559 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 26 SyntacticMatches, 3 SemanticMatches, 72 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 1753 ImplicationChecksByTransitivity, 100.5s TimeCoverageRelationStatistics Valid=453, Invalid=3948, Unknown=49, NotChecked=952, Total=5402 [2021-12-17 02:22:30,560 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 19 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 297 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 983 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 642 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-17 02:22:30,560 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 195 Invalid, 983 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 297 Invalid, 0 Unknown, 642 Unchecked, 0.3s Time] [2021-12-17 02:22:30,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2021-12-17 02:22:30,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 60. [2021-12-17 02:22:30,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 59 states have (on average 1.1694915254237288) internal successors, (69), 59 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 02:22:30,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 69 transitions. [2021-12-17 02:22:30,567 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 69 transitions. Word has length 32 [2021-12-17 02:22:30,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 02:22:30,568 INFO L470 AbstractCegarLoop]: Abstraction has 60 states and 69 transitions. [2021-12-17 02:22:30,568 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 62 states, 62 states have (on average 1.3709677419354838) internal successors, (85), 62 states have internal predecessors, (85), 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) [2021-12-17 02:22:30,568 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 69 transitions. [2021-12-17 02:22:30,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-12-17 02:22:30,570 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 02:22:30,570 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 02:22:30,598 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-12-17 02:22:30,771 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 02:22:30,771 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 02:22:30,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 02:22:30,772 INFO L85 PathProgramCache]: Analyzing trace with hash 1696042328, now seen corresponding path program 5 times [2021-12-17 02:22:30,772 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 02:22:30,772 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036775563] [2021-12-17 02:22:30,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 02:22:30,773 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 02:22:30,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 02:22:30,858 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-12-17 02:22:30,859 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 02:22:30,859 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036775563] [2021-12-17 02:22:30,859 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2036775563] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 02:22:30,859 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1941004050] [2021-12-17 02:22:30,859 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-12-17 02:22:30,859 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 02:22:30,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 02:22:30,861 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) [2021-12-17 02:22:30,861 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-12-17 02:22:30,965 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2021-12-17 02:22:30,965 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 02:22:30,967 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-17 02:22:30,969 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 02:22:31,073 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-12-17 02:22:31,073 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 02:22:31,141 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-12-17 02:22:31,141 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1941004050] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 02:22:31,141 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-17 02:22:31,141 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2021-12-17 02:22:31,142 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831625843] [2021-12-17 02:22:31,142 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-17 02:22:31,142 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-12-17 02:22:31,142 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 02:22:31,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-12-17 02:22:31,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2021-12-17 02:22:31,143 INFO L87 Difference]: Start difference. First operand 60 states and 69 transitions. Second operand has 14 states, 14 states have (on average 3.0) internal successors, (42), 14 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) [2021-12-17 02:22:31,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 02:22:31,290 INFO L93 Difference]: Finished difference Result 148 states and 167 transitions. [2021-12-17 02:22:31,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-17 02:22:31,290 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.0) internal successors, (42), 14 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 34 [2021-12-17 02:22:31,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 02:22:31,291 INFO L225 Difference]: With dead ends: 148 [2021-12-17 02:22:31,291 INFO L226 Difference]: Without dead ends: 111 [2021-12-17 02:22:31,292 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2021-12-17 02:22:31,292 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 127 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-17 02:22:31,293 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [127 Valid, 62 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-17 02:22:31,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2021-12-17 02:22:31,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 83. [2021-12-17 02:22:31,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 82 states have (on average 1.1219512195121952) internal successors, (92), 82 states have internal predecessors, (92), 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) [2021-12-17 02:22:31,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 92 transitions. [2021-12-17 02:22:31,302 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 92 transitions. Word has length 34 [2021-12-17 02:22:31,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 02:22:31,302 INFO L470 AbstractCegarLoop]: Abstraction has 83 states and 92 transitions. [2021-12-17 02:22:31,302 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.0) internal successors, (42), 14 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) [2021-12-17 02:22:31,302 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 92 transitions. [2021-12-17 02:22:31,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-12-17 02:22:31,303 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 02:22:31,303 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 02:22:31,322 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2021-12-17 02:22:31,511 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 02:22:31,512 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 02:22:31,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 02:22:31,512 INFO L85 PathProgramCache]: Analyzing trace with hash 1205583320, now seen corresponding path program 6 times [2021-12-17 02:22:31,512 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 02:22:31,512 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350274032] [2021-12-17 02:22:31,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 02:22:31,513 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 02:22:31,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 02:22:31,580 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-12-17 02:22:31,581 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 02:22:31,581 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350274032] [2021-12-17 02:22:31,581 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [350274032] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 02:22:31,581 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1680210796] [2021-12-17 02:22:31,581 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2021-12-17 02:22:31,582 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 02:22:31,582 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 02:22:31,583 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-17 02:22:31,608 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-12-17 02:22:31,693 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2021-12-17 02:22:31,693 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 02:22:31,695 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-17 02:22:31,697 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 02:22:31,795 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-12-17 02:22:31,795 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 02:22:31,851 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-12-17 02:22:31,851 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1680210796] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 02:22:31,852 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-17 02:22:31,852 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2021-12-17 02:22:31,852 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643140228] [2021-12-17 02:22:31,852 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-17 02:22:31,852 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-12-17 02:22:31,852 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 02:22:31,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-12-17 02:22:31,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2021-12-17 02:22:31,853 INFO L87 Difference]: Start difference. First operand 83 states and 92 transitions. Second operand has 14 states, 14 states have (on average 3.5) internal successors, (49), 14 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 02:22:32,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 02:22:32,044 INFO L93 Difference]: Finished difference Result 112 states and 119 transitions. [2021-12-17 02:22:32,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-17 02:22:32,045 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.5) internal successors, (49), 14 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2021-12-17 02:22:32,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 02:22:32,045 INFO L225 Difference]: With dead ends: 112 [2021-12-17 02:22:32,045 INFO L226 Difference]: Without dead ends: 91 [2021-12-17 02:22:32,046 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 61 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=280, Unknown=0, NotChecked=0, Total=380 [2021-12-17 02:22:32,046 INFO L933 BasicCegarLoop]: 29 mSDtfsCounter, 143 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 304 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 378 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-17 02:22:32,047 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [143 Valid, 95 Invalid, 378 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 304 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-17 02:22:32,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2021-12-17 02:22:32,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 68. [2021-12-17 02:22:32,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 67 states have (on average 1.0895522388059702) internal successors, (73), 67 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 02:22:32,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 73 transitions. [2021-12-17 02:22:32,054 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 73 transitions. Word has length 34 [2021-12-17 02:22:32,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 02:22:32,054 INFO L470 AbstractCegarLoop]: Abstraction has 68 states and 73 transitions. [2021-12-17 02:22:32,054 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.5) internal successors, (49), 14 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 02:22:32,054 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 73 transitions. [2021-12-17 02:22:32,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-12-17 02:22:32,055 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 02:22:32,055 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 02:22:32,076 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-12-17 02:22:32,263 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 02:22:32,264 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 02:22:32,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 02:22:32,264 INFO L85 PathProgramCache]: Analyzing trace with hash 1737020496, now seen corresponding path program 1 times [2021-12-17 02:22:32,264 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 02:22:32,264 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743910623] [2021-12-17 02:22:32,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 02:22:32,265 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 02:22:32,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 02:22:33,587 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 02:22:33,588 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 02:22:33,588 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743910623] [2021-12-17 02:22:33,588 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1743910623] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 02:22:33,588 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1257814145] [2021-12-17 02:22:33,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 02:22:33,588 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 02:22:33,589 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 02:22:33,592 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-17 02:22:33,598 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-12-17 02:22:33,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 02:22:33,655 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 75 conjunts are in the unsatisfiable core [2021-12-17 02:22:33,658 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 02:22:33,685 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-17 02:22:33,692 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:22:33,695 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-12-17 02:22:33,696 INFO L388 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 19 treesize of output 15 [2021-12-17 02:22:33,731 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2021-12-17 02:22:33,823 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:22:33,824 INFO L388 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 35 treesize of output 37 [2021-12-17 02:22:34,029 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:22:34,030 INFO L388 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 30 treesize of output 33 [2021-12-17 02:22:34,138 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:22:34,139 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:22:34,140 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 42 [2021-12-17 02:22:34,351 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 02:22:34,352 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:22:34,353 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:22:34,354 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 51 [2021-12-17 02:22:34,475 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:22:34,476 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:22:34,478 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 47 [2021-12-17 02:22:34,714 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:22:34,715 INFO L388 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 47 treesize of output 46 [2021-12-17 02:22:34,725 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:22:34,726 INFO L388 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 26 treesize of output 16 [2021-12-17 02:22:34,870 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:22:34,871 INFO L388 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 42 treesize of output 34 [2021-12-17 02:22:35,490 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:22:35,491 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 58 treesize of output 32 [2021-12-17 02:22:35,538 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 02:22:35,539 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 02:22:35,737 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_424 (Array Int Int))) (= (select (store v_ArrVal_424 (+ (* |c_ULTIMATE.start_main_~i~0#1| 8) |c_ULTIMATE.start_main_~a~0#1.offset| 8) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_424))) (+ (select (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select (select .cse0 |c_ULTIMATE.start_main_~b~0#1.base|) (+ |c_ULTIMATE.start_main_~b~0#1.offset| (* |c_ULTIMATE.start_main_~i~0#1| 4) 4))))) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8)) (+ c_~N~0 1))) is different from false [2021-12-17 02:22:35,742 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_424 (Array Int Int))) (= (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_424))) (+ (select (select .cse0 |c_ULTIMATE.start_main_~b~0#1.base|) (+ |c_ULTIMATE.start_main_~b~0#1.offset| 4)) (select (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ c_~N~0 1))) is different from false [2021-12-17 02:22:35,753 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_424 (Array Int Int))) (= (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 8) |c_ULTIMATE.start_main_~a~0#1.offset|)) (select .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset|))))) |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_424))) (+ (select (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select (select .cse0 |c_ULTIMATE.start_main_~b~0#1.base|) (+ |c_ULTIMATE.start_main_~b~0#1.offset| 4)))) (+ c_~N~0 1))) is different from false [2021-12-17 02:22:35,827 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_424 (Array Int Int))) (= (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse4 (* |c_ULTIMATE.start_main_~i~0#1| 8))) (let ((.cse2 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse4 |c_ULTIMATE.start_main_~a~0#1.offset|))) (.cse3 (select .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ .cse2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse3))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse4 |c_ULTIMATE.start_main_~a~0#1.offset| 8)) .cse3)))))) |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_424))) (+ (select (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select (select .cse0 |c_ULTIMATE.start_main_~b~0#1.base|) (+ |c_ULTIMATE.start_main_~b~0#1.offset| 4)))) (+ c_~N~0 1))) is different from false [2021-12-17 02:22:35,837 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_424 (Array Int Int))) (= (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse2 (select .cse1 |c_ULTIMATE.start_main_~#sum~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|))) (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse3))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8)) .cse2 .cse3))))) |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_424))) (+ (select (select .cse0 |c_ULTIMATE.start_main_~b~0#1.base|) (+ |c_ULTIMATE.start_main_~b~0#1.offset| 4)) (select (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ c_~N~0 1))) is different from false [2021-12-17 02:22:35,864 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~b~0#1.offset| Int) (v_ArrVal_424 (Array Int Int))) (= (let ((.cse0 (store (let ((.cse1 (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|) (+ |ULTIMATE.start_main_~b~0#1.offset| (* |c_ULTIMATE.start_main_~i~0#1| 4)) 1)))) (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse2 (select .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse3 (select (select .cse1 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse4 (select .cse2 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ .cse3 .cse4 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse4))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8)))))))) |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_424))) (+ (select (select .cse0 |c_ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| 4)) (select (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ c_~N~0 1))) is different from false [2021-12-17 02:22:35,934 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~b~0#1.offset| Int) (v_ArrVal_424 (Array Int Int))) (= (let ((.cse0 (store (let ((.cse1 (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|) (+ |ULTIMATE.start_main_~b~0#1.offset| (* |c_ULTIMATE.start_main_~i~0#1| 4) 4) 1)))) (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse2 (select .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse3 (select (select .cse1 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse4 (select .cse2 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ .cse3 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse4))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8)) .cse4)))))) |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_424))) (+ (select (select .cse0 |c_ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| 4)) (select (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ c_~N~0 1))) is different from false [2021-12-17 02:22:35,948 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-17 02:22:35,949 INFO L388 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 285 treesize of output 169 [2021-12-17 02:22:35,963 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~b~0#1.offset| Int) (v_ArrVal_424 (Array Int Int)) (v_arrayElimArr_1 (Array Int Int))) (or (not (= (select v_arrayElimArr_1 (+ |ULTIMATE.start_main_~b~0#1.offset| (* |c_ULTIMATE.start_main_~i~0#1| 4) 4)) 1)) (= (let ((.cse0 (store (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_arrayElimArr_1))) (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse2 (select .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse3 (select .cse2 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse4 (select (select .cse1 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (+ (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse4))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8)) .cse3 .cse4)))))) |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_424))) (+ (select (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select (select .cse0 |c_ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| 4)))) (+ c_~N~0 1)))) is different from false [2021-12-17 02:22:35,981 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~b~0#1.offset| Int) (v_ArrVal_424 (Array Int Int)) (v_arrayElimArr_1 (Array Int Int))) (let ((.cse1 (+ |ULTIMATE.start_main_~b~0#1.offset| 4))) (or (= (let ((.cse0 (store (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_arrayElimArr_1))) (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse3 (select .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse4 (select .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse5 (select (select .cse2 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (+ (select (select (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse4 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8)) .cse4 .cse5)))))) |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_424))) (+ (select (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select (select .cse0 |c_ULTIMATE.start_main_~b~0#1.base|) .cse1))) (+ c_~N~0 1)) (not (= (select v_arrayElimArr_1 .cse1) 1))))) is different from false [2021-12-17 02:22:36,186 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~b~0#1.offset| Int) (v_arrayElimArr_1 (Array Int Int))) (or (and (forall ((v_ArrVal_424 (Array Int Int))) (<= (+ |c_ULTIMATE.start_main_~i~0#1| 2) (let ((.cse0 (store (let ((.cse1 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) 1)) |c_ULTIMATE.start_main_~b~0#1.base| v_arrayElimArr_1))) (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse2 (select .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse3 (select .cse2 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse4 (select (select .cse1 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (+ .cse3 .cse4 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse4))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8)))))))) |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_424))) (+ (select (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select (select .cse0 |c_ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| 4)))))) (forall ((v_ArrVal_424 (Array Int Int))) (<= (let ((.cse5 (store (let ((.cse6 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) 1)) |c_ULTIMATE.start_main_~b~0#1.base| v_arrayElimArr_1))) (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse7 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse8 (select .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse9 (select (select .cse6 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (+ .cse8 .cse9 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse8 .cse9))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8)))))))) |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_424))) (+ (select (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select (select .cse5 |c_ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| 4)))) (+ |c_ULTIMATE.start_main_~i~0#1| 2)))) (not (= (select v_arrayElimArr_1 (+ |ULTIMATE.start_main_~b~0#1.offset| 4)) 1)))) is different from false [2021-12-17 02:22:36,234 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~b~0#1.offset| Int) (v_arrayElimArr_1 (Array Int Int))) (or (and (forall ((v_ArrVal_424 (Array Int Int))) (<= (let ((.cse0 (store (let ((.cse1 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 8) |c_ULTIMATE.start_main_~a~0#1.offset| 8) 1)) |c_ULTIMATE.start_main_~b~0#1.base| v_arrayElimArr_1))) (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse2 (select .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse3 (select (select .cse1 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse4 (select .cse2 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ .cse3 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse4))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8)) .cse4)))))) |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_424))) (+ (select (select .cse0 |c_ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| 4)) (select (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ |c_ULTIMATE.start_main_~i~0#1| 3))) (forall ((v_ArrVal_424 (Array Int Int))) (<= (+ |c_ULTIMATE.start_main_~i~0#1| 3) (let ((.cse5 (store (let ((.cse6 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 8) |c_ULTIMATE.start_main_~a~0#1.offset| 8) 1)) |c_ULTIMATE.start_main_~b~0#1.base| v_arrayElimArr_1))) (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse7 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse8 (select (select .cse6 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse9 (select .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ .cse8 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse8 .cse9))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8)) .cse9)))))) |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_424))) (+ (select (select .cse5 |c_ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| 4)) (select (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)))))) (not (= (select v_arrayElimArr_1 (+ |ULTIMATE.start_main_~b~0#1.offset| 4)) 1)))) is different from false [2021-12-17 02:22:36,290 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~b~0#1.offset| Int) (v_arrayElimArr_1 (Array Int Int))) (or (and (forall ((v_ArrVal_424 (Array Int Int))) (<= (let ((.cse0 (store (let ((.cse1 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse5 (* |c_ULTIMATE.start_main_~i~0#1| 8))) (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse5 |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (+ .cse5 |c_ULTIMATE.start_main_~a~0#1.offset| 8) 1))) |c_ULTIMATE.start_main_~b~0#1.base| v_arrayElimArr_1))) (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse2 (select .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse3 (select .cse2 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse4 (select (select .cse1 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (+ (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse4))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8)) .cse3 .cse4)))))) |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_424))) (+ (select (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select (select .cse0 |c_ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| 4)))) (+ |c_ULTIMATE.start_main_~i~0#1| 3))) (forall ((v_ArrVal_424 (Array Int Int))) (<= (+ |c_ULTIMATE.start_main_~i~0#1| 3) (let ((.cse6 (store (let ((.cse7 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse11 (* |c_ULTIMATE.start_main_~i~0#1| 8))) (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse11 |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (+ .cse11 |c_ULTIMATE.start_main_~a~0#1.offset| 8) 1))) |c_ULTIMATE.start_main_~b~0#1.base| v_arrayElimArr_1))) (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse8 (select .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse9 (select .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse10 (select (select .cse7 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (+ (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse9 .cse10))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8)) .cse9 .cse10)))))) |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_424))) (+ (select (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select (select .cse6 |c_ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| 4))))))) (not (= (select v_arrayElimArr_1 (+ |ULTIMATE.start_main_~b~0#1.offset| 4)) 1)))) is different from false [2021-12-17 02:22:36,316 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 14 not checked. [2021-12-17 02:22:36,316 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1257814145] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 02:22:36,316 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-17 02:22:36,316 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 22, 23] total 65 [2021-12-17 02:22:36,319 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837577579] [2021-12-17 02:22:36,319 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-17 02:22:36,320 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 65 states [2021-12-17 02:22:36,320 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 02:22:36,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2021-12-17 02:22:36,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=346, Invalid=2435, Unknown=23, NotChecked=1356, Total=4160 [2021-12-17 02:22:36,322 INFO L87 Difference]: Start difference. First operand 68 states and 73 transitions. Second operand has 65 states, 65 states have (on average 1.4923076923076923) internal successors, (97), 65 states have internal predecessors, (97), 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) [2021-12-17 02:22:42,968 WARN L227 SmtUtils]: Spent 6.17s on a formula simplification. DAG size of input: 77 DAG size of output: 58 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-17 02:22:43,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 02:22:43,610 INFO L93 Difference]: Finished difference Result 71 states and 75 transitions. [2021-12-17 02:22:43,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2021-12-17 02:22:43,610 INFO L78 Accepts]: Start accepts. Automaton has has 65 states, 65 states have (on average 1.4923076923076923) internal successors, (97), 65 states have internal predecessors, (97), 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 36 [2021-12-17 02:22:43,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 02:22:43,611 INFO L225 Difference]: With dead ends: 71 [2021-12-17 02:22:43,611 INFO L226 Difference]: Without dead ends: 44 [2021-12-17 02:22:43,612 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 34 SyntacticMatches, 12 SemanticMatches, 72 ConstructedPredicates, 12 IntricatePredicates, 0 DeprecatedPredicates, 1805 ImplicationChecksByTransitivity, 8.7s TimeCoverageRelationStatistics Valid=469, Invalid=3337, Unknown=24, NotChecked=1572, Total=5402 [2021-12-17 02:22:43,613 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 19 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 383 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 845 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 383 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 407 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-17 02:22:43,613 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 169 Invalid, 845 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 383 Invalid, 0 Unknown, 407 Unchecked, 0.2s Time] [2021-12-17 02:22:43,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2021-12-17 02:22:43,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 43. [2021-12-17 02:22:43,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 42 states have (on average 1.119047619047619) internal successors, (47), 42 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) [2021-12-17 02:22:43,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2021-12-17 02:22:43,617 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 36 [2021-12-17 02:22:43,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 02:22:43,617 INFO L470 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2021-12-17 02:22:43,617 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 65 states, 65 states have (on average 1.4923076923076923) internal successors, (97), 65 states have internal predecessors, (97), 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) [2021-12-17 02:22:43,618 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2021-12-17 02:22:43,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-12-17 02:22:43,618 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 02:22:43,618 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 02:22:43,639 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2021-12-17 02:22:43,832 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 02:22:43,832 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 02:22:43,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 02:22:43,833 INFO L85 PathProgramCache]: Analyzing trace with hash 1201221586, now seen corresponding path program 7 times [2021-12-17 02:22:43,833 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 02:22:43,833 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291530398] [2021-12-17 02:22:43,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 02:22:43,833 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 02:22:43,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 02:22:45,500 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 02:22:45,500 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 02:22:45,501 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291530398] [2021-12-17 02:22:45,501 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1291530398] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 02:22:45,501 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [742724701] [2021-12-17 02:22:45,501 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-12-17 02:22:45,501 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 02:22:45,501 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 02:22:45,502 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-17 02:22:45,503 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-12-17 02:22:45,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 02:22:45,577 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 91 conjunts are in the unsatisfiable core [2021-12-17 02:22:45,590 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 02:22:45,606 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-17 02:22:45,612 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-12-17 02:22:45,612 INFO L388 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 [2021-12-17 02:22:45,632 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2021-12-17 02:22:45,674 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:22:45,675 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2021-12-17 02:22:45,777 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:22:45,778 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:22:45,778 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:22:45,780 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 47 [2021-12-17 02:22:46,095 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:22:46,096 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:22:46,096 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:22:46,098 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 61 [2021-12-17 02:22:46,277 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:22:46,278 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:22:46,279 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:22:46,280 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:22:46,281 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 71 [2021-12-17 02:22:46,464 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:22:46,466 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:22:46,467 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:22:46,468 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:22:46,468 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 71 [2021-12-17 02:22:46,701 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:22:46,702 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:22:46,703 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:22:46,704 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:22:46,704 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:22:46,705 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 02:22:46,705 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 70 [2021-12-17 02:22:46,909 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:22:46,909 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:22:46,910 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 02:22:46,911 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:22:46,913 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 72 [2021-12-17 02:22:47,097 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:22:47,098 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:22:47,098 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:22:47,099 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:22:47,100 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:22:47,100 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 02:22:47,105 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 62 [2021-12-17 02:22:47,380 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:22:47,381 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:22:47,382 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 02:22:47,383 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:22:47,384 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 02:22:47,385 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 68 [2021-12-17 02:22:47,595 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:22:47,597 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:22:47,597 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:22:47,598 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:22:47,623 INFO L354 Elim1Store]: treesize reduction 65, result has 39.3 percent of original size [2021-12-17 02:22:47,623 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 66 treesize of output 91 [2021-12-17 02:22:47,991 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:22:47,993 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:22:47,994 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:22:48,032 INFO L354 Elim1Store]: treesize reduction 131, result has 26.0 percent of original size [2021-12-17 02:22:48,032 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 71 treesize of output 90 [2021-12-17 02:22:48,316 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-17 02:22:48,317 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 34 [2021-12-17 02:22:48,368 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 1 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 02:22:48,368 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 02:22:50,537 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_147| Int)) (or (forall ((v_ArrVal_526 Int)) (= (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_147| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_526) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ c_~N~0 1))) (< |v_ULTIMATE.start_main_~i~0#1_147| (+ |c_ULTIMATE.start_main_~i~0#1| 1)))) is different from false [2021-12-17 02:23:04,032 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_148| Int)) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_147| Int) (v_ArrVal_526 Int) (v_ArrVal_524 Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_147| (+ |v_ULTIMATE.start_main_~i~0#1_148| 1)) (= (select (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_148| 8)) v_ArrVal_524) (+ (* |v_ULTIMATE.start_main_~i~0#1_147| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_526) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ c_~N~0 1)))) (< |v_ULTIMATE.start_main_~i~0#1_148| (+ |c_ULTIMATE.start_main_~i~0#1| 1)))) is different from false [2021-12-17 02:23:06,063 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_147| Int) (|v_ULTIMATE.start_main_~i~0#1_148| Int) (v_ArrVal_526 Int) (v_ArrVal_524 Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_147| (+ |v_ULTIMATE.start_main_~i~0#1_148| 1)) (= (select (store (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ (select (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|) (+ |c_ULTIMATE.start_main_~b~0#1.offset| (* |c_ULTIMATE.start_main_~i~0#1| 4))) (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_148| 8)) v_ArrVal_524) (+ (* |v_ULTIMATE.start_main_~i~0#1_147| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_526) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ c_~N~0 1)) (< |v_ULTIMATE.start_main_~i~0#1_148| (+ |c_ULTIMATE.start_main_~i~0#1| 1)))) is different from false [2021-12-17 02:23:22,391 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_155| Int)) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_147| Int) (|v_ULTIMATE.start_main_~i~0#1_148| Int) (v_ArrVal_526 Int) (v_ArrVal_514 Int) (v_ArrVal_524 Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_147| (+ |v_ULTIMATE.start_main_~i~0#1_148| 1)) (= (select (store (store (let ((.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| (* |v_ULTIMATE.start_main_~i~0#1_155| 4)) v_ArrVal_514)))) (let ((.cse6 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse2 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse3 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse2))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8)))) (let ((.cse4 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse2 .cse3))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 16)))) (let ((.cse0 (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse2 .cse3 .cse4))))) (store (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset| (+ (select (select .cse0 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|) .cse1 .cse2 .cse3 .cse4)))))))) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_148| 8)) v_ArrVal_524) (+ (* |v_ULTIMATE.start_main_~i~0#1_147| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_526) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ c_~N~0 1)) (< |v_ULTIMATE.start_main_~i~0#1_148| 1))) (< |v_ULTIMATE.start_main_~i~0#1_155| (+ |c_ULTIMATE.start_main_~i~0#1| 1)))) is different from false [2021-12-17 02:23:24,530 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_147| Int) (|v_ULTIMATE.start_main_~i~0#1_148| Int) (|v_ULTIMATE.start_main_~i~0#1_155| Int) (v_ArrVal_526 Int) (v_ArrVal_514 Int) (v_ArrVal_524 Int) (v_ArrVal_512 Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_147| (+ |v_ULTIMATE.start_main_~i~0#1_148| 1)) (< |v_ULTIMATE.start_main_~i~0#1_155| (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (< |v_ULTIMATE.start_main_~i~0#1_148| 1) (= (select (store (store (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|) (+ |c_ULTIMATE.start_main_~b~0#1.offset| (* |c_ULTIMATE.start_main_~i~0#1| 4)) v_ArrVal_512) (+ |c_ULTIMATE.start_main_~b~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_155| 4)) v_ArrVal_514)))) (let ((.cse6 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse1 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse4 (select (select .cse5 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse2 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse4))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8)))) (let ((.cse3 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse2 .cse4))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 16)))) (let ((.cse0 (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse2 .cse3 .cse4))))) (store (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset| (+ (select (select .cse0 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|) .cse1 .cse2 .cse3 .cse4)))))))) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_148| 8)) v_ArrVal_524) (+ (* |v_ULTIMATE.start_main_~i~0#1_147| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_526) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ c_~N~0 1)))) is different from false [2021-12-17 02:23:26,841 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_156| Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_156| (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (forall ((|v_ULTIMATE.start_main_~i~0#1_147| Int) (|v_ULTIMATE.start_main_~i~0#1_148| Int) (|v_ULTIMATE.start_main_~i~0#1_155| Int) (v_ArrVal_526 Int) (v_ArrVal_514 Int) (v_ArrVal_524 Int) (v_ArrVal_512 Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_147| (+ |v_ULTIMATE.start_main_~i~0#1_148| 1)) (< |v_ULTIMATE.start_main_~i~0#1_155| (+ |v_ULTIMATE.start_main_~i~0#1_156| 1)) (< |v_ULTIMATE.start_main_~i~0#1_148| 1) (= (select (store (store (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|) (+ |c_ULTIMATE.start_main_~b~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_156| 4)) v_ArrVal_512) (+ |c_ULTIMATE.start_main_~b~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_155| 4)) v_ArrVal_514)))) (let ((.cse6 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse3 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse4 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse3))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8)))) (let ((.cse2 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse3 .cse4))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 16)))) (let ((.cse0 (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse2 .cse3 .cse4))))) (store (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset| (+ (select (select .cse0 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|) .cse1 .cse2 .cse3 .cse4)))))))) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_148| 8)) v_ArrVal_524) (+ (* |v_ULTIMATE.start_main_~i~0#1_147| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_526) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ c_~N~0 1)))))) is different from false [2021-12-17 02:23:29,096 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_147| Int) (|v_ULTIMATE.start_main_~i~0#1_148| Int) (|v_ULTIMATE.start_main_~i~0#1_156| Int) (|v_ULTIMATE.start_main_~i~0#1_155| Int) (v_ArrVal_526 Int) (v_ArrVal_514 Int) (v_ArrVal_524 Int) (v_ArrVal_512 Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_147| (+ |v_ULTIMATE.start_main_~i~0#1_148| 1)) (< |v_ULTIMATE.start_main_~i~0#1_156| (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (< |v_ULTIMATE.start_main_~i~0#1_155| (+ |v_ULTIMATE.start_main_~i~0#1_156| 1)) (< |v_ULTIMATE.start_main_~i~0#1_148| 1) (= (select (store (store (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| (store (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|) (+ |c_ULTIMATE.start_main_~b~0#1.offset| (* |c_ULTIMATE.start_main_~i~0#1| 4)) 1) (+ |c_ULTIMATE.start_main_~b~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_156| 4)) v_ArrVal_512) (+ |c_ULTIMATE.start_main_~b~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_155| 4)) v_ArrVal_514)))) (let ((.cse6 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse1 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse2 (select (select .cse5 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse4 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse2))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8)))) (let ((.cse3 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse2 .cse4))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 16)))) (let ((.cse0 (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse2 .cse3 .cse4))))) (store (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse1 .cse2 .cse3 (select (select .cse0 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|) .cse4)))))))) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_148| 8)) v_ArrVal_524) (+ (* |v_ULTIMATE.start_main_~i~0#1_147| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_526) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ c_~N~0 1)))) is different from false [2021-12-17 02:23:31,311 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_147| Int) (|v_ULTIMATE.start_main_~i~0#1_148| Int) (|v_ULTIMATE.start_main_~i~0#1_156| Int) (|v_ULTIMATE.start_main_~i~0#1_155| Int) (v_ArrVal_526 Int) (v_ArrVal_514 Int) (v_ArrVal_524 Int) (v_ArrVal_512 Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_147| (+ |v_ULTIMATE.start_main_~i~0#1_148| 1)) (= (select (store (store (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| (store (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| 1) (+ |c_ULTIMATE.start_main_~b~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_156| 4)) v_ArrVal_512) (+ |c_ULTIMATE.start_main_~b~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_155| 4)) v_ArrVal_514)))) (let ((.cse6 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse2 (select (select .cse5 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse3 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse1 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse3))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8)))) (let ((.cse4 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse2 .cse3))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 16)))) (let ((.cse0 (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse2 .cse3 .cse4))))) (store (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse1 (select (select .cse0 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|) .cse2 .cse3 .cse4)))))))) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_148| 8)) v_ArrVal_524) (+ (* |v_ULTIMATE.start_main_~i~0#1_147| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_526) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ c_~N~0 1)) (< |v_ULTIMATE.start_main_~i~0#1_155| (+ |v_ULTIMATE.start_main_~i~0#1_156| 1)) (< |v_ULTIMATE.start_main_~i~0#1_148| 1) (< |v_ULTIMATE.start_main_~i~0#1_156| 1))) is different from false [2021-12-17 02:25:38,566 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_147| Int) (|v_ULTIMATE.start_main_~i~0#1_148| Int) (|v_ULTIMATE.start_main_~i~0#1_156| Int) (|v_ULTIMATE.start_main_~i~0#1_155| Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_147| (+ |v_ULTIMATE.start_main_~i~0#1_148| 1)) (< |v_ULTIMATE.start_main_~i~0#1_155| (+ |v_ULTIMATE.start_main_~i~0#1_156| 1)) (< |v_ULTIMATE.start_main_~i~0#1_148| 1) (and (forall ((v_ArrVal_526 Int) (v_ArrVal_514 Int) (v_ArrVal_524 Int) (v_ArrVal_512 Int)) (<= (+ |c_ULTIMATE.start_main_~i~0#1| 4) (select (store (store (let ((.cse5 (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse8 (* |c_ULTIMATE.start_main_~i~0#1| 8))) (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse8 |c_ULTIMATE.start_main_~a~0#1.offset| 8) 1) (+ .cse8 |c_ULTIMATE.start_main_~a~0#1.offset| 16) 1))))) (store .cse7 |c_ULTIMATE.start_main_~b~0#1.base| (store (store (store (select .cse7 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| 1) (+ |c_ULTIMATE.start_main_~b~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_156| 4)) v_ArrVal_512) (+ |c_ULTIMATE.start_main_~b~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_155| 4)) v_ArrVal_514))))) (let ((.cse6 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse4 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse2 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse4))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8)))) (let ((.cse3 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse2 .cse4))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 16)))) (let ((.cse0 (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse2 .cse3 .cse4))))) (store (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse1 .cse2 .cse3 (select (select .cse0 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|) .cse4)))))))) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_148| 8)) v_ArrVal_524) (+ (* |v_ULTIMATE.start_main_~i~0#1_147| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_526) |c_ULTIMATE.start_main_~a~0#1.offset|))) (forall ((v_ArrVal_526 Int) (v_ArrVal_514 Int) (v_ArrVal_524 Int) (v_ArrVal_512 Int)) (<= (select (store (store (let ((.cse14 (let ((.cse16 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse17 (* |c_ULTIMATE.start_main_~i~0#1| 8))) (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse17 |c_ULTIMATE.start_main_~a~0#1.offset| 8) 1) (+ .cse17 |c_ULTIMATE.start_main_~a~0#1.offset| 16) 1))))) (store .cse16 |c_ULTIMATE.start_main_~b~0#1.base| (store (store (store (select .cse16 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| 1) (+ |c_ULTIMATE.start_main_~b~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_156| 4)) v_ArrVal_512) (+ |c_ULTIMATE.start_main_~b~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_155| 4)) v_ArrVal_514))))) (let ((.cse15 (select .cse14 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse10 (select (select .cse14 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse13 (select .cse15 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse11 (select (select (store .cse14 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse15 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse10 .cse13))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8)))) (let ((.cse12 (select (select (store .cse14 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse15 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse10 .cse11 .cse13))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 16)))) (let ((.cse9 (store .cse14 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse15 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse10 .cse11 .cse12 .cse13))))) (store (select .cse9 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse10 .cse11 .cse12 (select (select .cse9 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|) .cse13)))))))) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_148| 8)) v_ArrVal_524) (+ (* |v_ULTIMATE.start_main_~i~0#1_147| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_526) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ |c_ULTIMATE.start_main_~i~0#1| 4)))) (< |v_ULTIMATE.start_main_~i~0#1_156| 1))) is different from false [2021-12-17 02:25:42,870 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_147| Int) (|v_ULTIMATE.start_main_~i~0#1_148| Int) (|v_ULTIMATE.start_main_~i~0#1_156| Int) (|v_ULTIMATE.start_main_~i~0#1_155| Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_147| (+ |v_ULTIMATE.start_main_~i~0#1_148| 1)) (< |v_ULTIMATE.start_main_~i~0#1_155| (+ |v_ULTIMATE.start_main_~i~0#1_156| 1)) (and (forall ((v_ArrVal_526 Int) (v_ArrVal_514 Int) (v_ArrVal_524 Int) (v_ArrVal_512 Int)) (<= (+ |c_ULTIMATE.start_main_~i~0#1| 4) (select (store (store (let ((.cse5 (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse8 (* |c_ULTIMATE.start_main_~i~0#1| 8))) (store (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse8 |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (+ .cse8 |c_ULTIMATE.start_main_~a~0#1.offset| 8) 1) (+ .cse8 |c_ULTIMATE.start_main_~a~0#1.offset| 16) 1))))) (store .cse7 |c_ULTIMATE.start_main_~b~0#1.base| (store (store (store (select .cse7 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| 1) (+ |c_ULTIMATE.start_main_~b~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_156| 4)) v_ArrVal_512) (+ |c_ULTIMATE.start_main_~b~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_155| 4)) v_ArrVal_514))))) (let ((.cse6 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse4 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse3 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse4))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8)))) (let ((.cse2 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse3 .cse4))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 16)))) (let ((.cse0 (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse2 .cse3 .cse4))))) (store (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset| (+ (select (select .cse0 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|) .cse1 .cse2 .cse3 .cse4)))))))) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_148| 8)) v_ArrVal_524) (+ (* |v_ULTIMATE.start_main_~i~0#1_147| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_526) |c_ULTIMATE.start_main_~a~0#1.offset|))) (forall ((v_ArrVal_526 Int) (v_ArrVal_514 Int) (v_ArrVal_524 Int) (v_ArrVal_512 Int)) (<= (select (store (store (let ((.cse14 (let ((.cse16 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse17 (* |c_ULTIMATE.start_main_~i~0#1| 8))) (store (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse17 |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (+ .cse17 |c_ULTIMATE.start_main_~a~0#1.offset| 8) 1) (+ .cse17 |c_ULTIMATE.start_main_~a~0#1.offset| 16) 1))))) (store .cse16 |c_ULTIMATE.start_main_~b~0#1.base| (store (store (store (select .cse16 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| 1) (+ |c_ULTIMATE.start_main_~b~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_156| 4)) v_ArrVal_512) (+ |c_ULTIMATE.start_main_~b~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_155| 4)) v_ArrVal_514))))) (let ((.cse15 (select .cse14 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse10 (select (select .cse14 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse13 (select .cse15 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse12 (select (select (store .cse14 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse15 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse10 .cse13))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8)))) (let ((.cse11 (select (select (store .cse14 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse15 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse10 .cse12 .cse13))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 16)))) (let ((.cse9 (store .cse14 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse15 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse10 .cse11 .cse12 .cse13))))) (store (select .cse9 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset| (+ (select (select .cse9 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|) .cse10 .cse11 .cse12 .cse13)))))))) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_148| 8)) v_ArrVal_524) (+ (* |v_ULTIMATE.start_main_~i~0#1_147| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_526) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ |c_ULTIMATE.start_main_~i~0#1| 4)))) (< |v_ULTIMATE.start_main_~i~0#1_148| 1) (< |v_ULTIMATE.start_main_~i~0#1_156| 1))) is different from false [2021-12-17 02:25:42,901 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 19 not checked. [2021-12-17 02:25:42,902 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [742724701] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 02:25:42,902 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-17 02:25:42,902 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 28, 30] total 80 [2021-12-17 02:25:42,902 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130351177] [2021-12-17 02:25:42,902 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-17 02:25:42,902 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 80 states [2021-12-17 02:25:42,902 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 02:25:42,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2021-12-17 02:25:42,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=428, Invalid=4371, Unknown=71, NotChecked=1450, Total=6320 [2021-12-17 02:25:42,904 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand has 80 states, 80 states have (on average 1.3125) internal successors, (105), 80 states have internal predecessors, (105), 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) [2021-12-17 02:25:53,769 WARN L227 SmtUtils]: Spent 10.27s on a formula simplification. DAG size of input: 105 DAG size of output: 100 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-17 02:25:55,907 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|) (+ |c_ULTIMATE.start_main_~b~0#1.offset| (* |c_ULTIMATE.start_main_~i~0#1| 4))) 1) (exists ((|v_ULTIMATE.start_main_~i~0#1_138| Int)) (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse1 (* |v_ULTIMATE.start_main_~i~0#1_138| 8))) (and (<= c_~N~0 (+ |v_ULTIMATE.start_main_~i~0#1_138| 1)) (< |v_ULTIMATE.start_main_~i~0#1_138| c_~N~0) (= (select .cse0 (+ .cse1 |c_ULTIMATE.start_main_~a~0#1.offset| (- 8))) 1) (= (select .cse0 (+ .cse1 |c_ULTIMATE.start_main_~a~0#1.offset|)) 1) (<= (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_138|) |c_ULTIMATE.start_main_~a~0#1.offset|) 16) (<= 2 |v_ULTIMATE.start_main_~i~0#1_138|)))) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 0) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (not (= |c_ULTIMATE.start_main_~a~0#1.base| |c_ULTIMATE.start_main_~b~0#1.base|)) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) 0) 1) (= |c_ULTIMATE.start_main_~i~0#1| 0) (= |c_ULTIMATE.start_main_~b~0#1.offset| 0) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~b~0#1.base|)) (forall ((|v_ULTIMATE.start_main_~i~0#1_156| Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_156| (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (forall ((|v_ULTIMATE.start_main_~i~0#1_147| Int) (|v_ULTIMATE.start_main_~i~0#1_148| Int) (|v_ULTIMATE.start_main_~i~0#1_155| Int) (v_ArrVal_526 Int) (v_ArrVal_514 Int) (v_ArrVal_524 Int) (v_ArrVal_512 Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_147| (+ |v_ULTIMATE.start_main_~i~0#1_148| 1)) (< |v_ULTIMATE.start_main_~i~0#1_155| (+ |v_ULTIMATE.start_main_~i~0#1_156| 1)) (< |v_ULTIMATE.start_main_~i~0#1_148| 1) (= (select (store (store (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|) (+ |c_ULTIMATE.start_main_~b~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_156| 4)) v_ArrVal_512) (+ |c_ULTIMATE.start_main_~b~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_155| 4)) v_ArrVal_514)))) (let ((.cse8 (select .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse3 (select (select .cse7 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse5 (select .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse6 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8)))) (let ((.cse4 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse5 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 16)))) (let ((.cse2 (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse4 .cse5 .cse6))))) (store (select .cse2 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset| (+ (select (select .cse2 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|) .cse3 .cse4 .cse5 .cse6)))))))) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_148| 8)) v_ArrVal_524) (+ (* |v_ULTIMATE.start_main_~i~0#1_147| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_526) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ c_~N~0 1)))))) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|))) is different from false [2021-12-17 02:25:58,056 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|)) (.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (and (exists ((|v_ULTIMATE.start_main_~i~0#1_138| Int)) (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse1 (* |v_ULTIMATE.start_main_~i~0#1_138| 8))) (and (<= c_~N~0 (+ |v_ULTIMATE.start_main_~i~0#1_138| 1)) (< |v_ULTIMATE.start_main_~i~0#1_138| c_~N~0) (= (select .cse0 (+ .cse1 |c_ULTIMATE.start_main_~a~0#1.offset| (- 8))) 1) (= (select .cse0 (+ .cse1 |c_ULTIMATE.start_main_~a~0#1.offset|)) 1) (<= (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_138|) |c_ULTIMATE.start_main_~a~0#1.offset|) 16) (<= 2 |v_ULTIMATE.start_main_~i~0#1_138|)))) (= (select .cse2 8) 1) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 0) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= (select .cse3 0) 1) (<= |c_ULTIMATE.start_main_~i~0#1| 1) (= |c_ULTIMATE.start_main_~b~0#1.offset| 0) (not (= |c_ULTIMATE.start_main_~a~0#1.base| |c_ULTIMATE.start_main_~b~0#1.base|)) (or (< 3 c_~N~0) (= (select .cse2 (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* c_~N~0 8) (- 8))) 1)) (<= 3 c_~N~0) (forall ((|v_ULTIMATE.start_main_~i~0#1_155| Int)) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_147| Int) (|v_ULTIMATE.start_main_~i~0#1_148| Int) (v_ArrVal_526 Int) (v_ArrVal_514 Int) (v_ArrVal_524 Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_147| (+ |v_ULTIMATE.start_main_~i~0#1_148| 1)) (= (select (store (store (let ((.cse9 (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| (* |v_ULTIMATE.start_main_~i~0#1_155| 4)) v_ArrVal_514)))) (let ((.cse10 (select .cse9 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse5 (select (select .cse9 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse6 (select .cse10 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse7 (select (select (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse5 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8)))) (let ((.cse8 (select (select (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse5 .cse6 .cse7))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 16)))) (let ((.cse4 (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse5 .cse6 .cse7 .cse8))))) (store (select .cse4 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset| (+ (select (select .cse4 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|) .cse5 .cse6 .cse7 .cse8)))))))) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_148| 8)) v_ArrVal_524) (+ (* |v_ULTIMATE.start_main_~i~0#1_147| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_526) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ c_~N~0 1)) (< |v_ULTIMATE.start_main_~i~0#1_148| 1))) (< |v_ULTIMATE.start_main_~i~0#1_155| (+ |c_ULTIMATE.start_main_~i~0#1| 1)))) (= (select .cse3 |c_ULTIMATE.start_main_~b~0#1.offset|) 1) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~b~0#1.base|)) (= (select .cse2 0) 1) (<= 1 |c_ULTIMATE.start_main_~i~0#1|) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)))) is different from false [2021-12-17 02:26:13,638 WARN L227 SmtUtils]: Spent 5.82s on a formula simplification. DAG size of input: 75 DAG size of output: 68 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-17 02:26:36,530 WARN L227 SmtUtils]: Spent 5.64s on a formula simplification. DAG size of input: 52 DAG size of output: 50 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-17 02:26:38,647 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 8) |c_ULTIMATE.start_main_~a~0#1.offset|)))) (and (exists ((|v_ULTIMATE.start_main_~i~0#1_138| Int)) (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse1 (* |v_ULTIMATE.start_main_~i~0#1_138| 8))) (and (<= c_~N~0 (+ |v_ULTIMATE.start_main_~i~0#1_138| 1)) (< |v_ULTIMATE.start_main_~i~0#1_138| c_~N~0) (= (select .cse0 (+ .cse1 |c_ULTIMATE.start_main_~a~0#1.offset| (- 8))) 1) (= (select .cse0 (+ .cse1 |c_ULTIMATE.start_main_~a~0#1.offset|)) 1) (<= (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_138|) |c_ULTIMATE.start_main_~a~0#1.offset|) 16) (<= 2 |v_ULTIMATE.start_main_~i~0#1_138|)))) (= .cse2 (+ c_~N~0 1)) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= |c_ULTIMATE.start_main_~b~0#1.offset| 0) (= |c_ULTIMATE.start_main_~i~0#1| 0) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~b~0#1.base|)) (= .cse2 4) (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int) (|ULTIMATE.start_main_~b~0#1.base| Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (and (not (= |ULTIMATE.start_main_~#sum~0#1.base| |ULTIMATE.start_main_~b~0#1.base|)) (= (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) 3) (= (+ (select (select |c_#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (* |c_ULTIMATE.start_main_~i~0#1| 4)) 3) (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 8) |c_ULTIMATE.start_main_~a~0#1.offset|))) (not (= |ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)))) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (forall ((|v_ULTIMATE.start_main_~i~0#1_148| Int)) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_147| Int) (v_ArrVal_526 Int) (v_ArrVal_524 Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_147| (+ |v_ULTIMATE.start_main_~i~0#1_148| 1)) (= (select (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_148| 8)) v_ArrVal_524) (+ (* |v_ULTIMATE.start_main_~i~0#1_147| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_526) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ c_~N~0 1)))) (< |v_ULTIMATE.start_main_~i~0#1_148| (+ |c_ULTIMATE.start_main_~i~0#1| 1)))))) is different from false [2021-12-17 02:26:40,820 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (and (= (select .cse0 0) (+ c_~N~0 1)) (forall ((|v_ULTIMATE.start_main_~i~0#1_147| Int)) (or (forall ((v_ArrVal_526 Int)) (= (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_147| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_526) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ c_~N~0 1))) (< |v_ULTIMATE.start_main_~i~0#1_147| (+ |c_ULTIMATE.start_main_~i~0#1| 1)))) (exists ((|v_ULTIMATE.start_main_~i~0#1_138| Int)) (let ((.cse3 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse4 (* |v_ULTIMATE.start_main_~i~0#1_138| 8)) (.cse2 (* 8 |c_ULTIMATE.start_main_~i~0#1|)) (.cse1 (* 8 |v_ULTIMATE.start_main_~i~0#1_138|))) (and (<= c_~N~0 (+ |v_ULTIMATE.start_main_~i~0#1_138| 1)) (or (= .cse1 .cse2) (= (select .cse3 (+ .cse4 |c_ULTIMATE.start_main_~a~0#1.offset|)) 1)) (< |v_ULTIMATE.start_main_~i~0#1_138| c_~N~0) (or (= (select .cse3 (+ .cse4 |c_ULTIMATE.start_main_~a~0#1.offset| (- 8))) 1) (= .cse1 (+ .cse2 8))) (<= (+ .cse1 |c_ULTIMATE.start_main_~a~0#1.offset|) 16) (<= 2 |v_ULTIMATE.start_main_~i~0#1_138|)))) (<= (+ (div (* |c_ULTIMATE.start_main_~a~0#1.offset| (- 1)) 8) 1) |c_ULTIMATE.start_main_~i~0#1|) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int) (|ULTIMATE.start_main_~b~0#1.base| Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (and (= (select (select |c_#memory_int| |ULTIMATE.start_main_~b~0#1.base|) 0) 1) (= (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) 3) (not (= |ULTIMATE.start_main_~#sum~0#1.base| |ULTIMATE.start_main_~b~0#1.base|)) (not (= |ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)))) (= (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|) 4) (= |c_ULTIMATE.start_main_~b~0#1.offset| 0) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~b~0#1.base|)) (<= 1 |c_ULTIMATE.start_main_~i~0#1|) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)))) is different from false [2021-12-17 02:26:42,825 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 8) |c_ULTIMATE.start_main_~a~0#1.offset|)) (+ c_~N~0 1)) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= |c_ULTIMATE.start_main_~b~0#1.offset| 0) (= |c_ULTIMATE.start_main_~i~0#1| 0) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~b~0#1.base|)) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (forall ((|v_ULTIMATE.start_main_~i~0#1_148| Int)) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_147| Int) (v_ArrVal_526 Int) (v_ArrVal_524 Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_147| (+ |v_ULTIMATE.start_main_~i~0#1_148| 1)) (= (select (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_148| 8)) v_ArrVal_524) (+ (* |v_ULTIMATE.start_main_~i~0#1_147| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_526) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ c_~N~0 1)))) (< |v_ULTIMATE.start_main_~i~0#1_148| (+ |c_ULTIMATE.start_main_~i~0#1| 1))))) is different from false [2021-12-17 02:26:44,940 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse1 (* |c_ULTIMATE.start_main_~a~0#1.offset| (- 1)))) (and (= (select .cse0 0) (+ c_~N~0 1)) (< 2 c_~N~0) (forall ((|v_ULTIMATE.start_main_~i~0#1_147| Int)) (or (forall ((v_ArrVal_526 Int)) (= (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_147| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_526) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ c_~N~0 1))) (< |v_ULTIMATE.start_main_~i~0#1_147| (+ |c_ULTIMATE.start_main_~i~0#1| 1)))) (<= (+ (div .cse1 8) 1) |c_ULTIMATE.start_main_~i~0#1|) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int) (|ULTIMATE.start_main_~b~0#1.base| Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (and (= (select (select |c_#memory_int| |ULTIMATE.start_main_~b~0#1.base|) 0) 1) (= (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) 3) (not (= |ULTIMATE.start_main_~#sum~0#1.base| |ULTIMATE.start_main_~b~0#1.base|)) (not (= |ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)))) (= (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|) 4) (= |c_ULTIMATE.start_main_~b~0#1.offset| 0) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~b~0#1.base|)) (<= c_~N~0 (+ (div (+ .cse1 16) 8) 1)) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)))) is different from false [2021-12-17 02:26:46,943 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) 0) (+ c_~N~0 1)) (forall ((|v_ULTIMATE.start_main_~i~0#1_147| Int)) (or (forall ((v_ArrVal_526 Int)) (= (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_147| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_526) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ c_~N~0 1))) (< |v_ULTIMATE.start_main_~i~0#1_147| (+ |c_ULTIMATE.start_main_~i~0#1| 1)))) (<= (+ (div (* |c_ULTIMATE.start_main_~a~0#1.offset| (- 1)) 8) 1) |c_ULTIMATE.start_main_~i~0#1|) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= |c_ULTIMATE.start_main_~b~0#1.offset| 0) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~b~0#1.base|)) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|))) is different from false [2021-12-17 02:26:47,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 02:26:47,074 INFO L93 Difference]: Finished difference Result 98 states and 109 transitions. [2021-12-17 02:26:47,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2021-12-17 02:26:47,075 INFO L78 Accepts]: Start accepts. Automaton has has 80 states, 80 states have (on average 1.3125) internal successors, (105), 80 states have internal predecessors, (105), 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 40 [2021-12-17 02:26:47,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 02:26:47,077 INFO L225 Difference]: With dead ends: 98 [2021-12-17 02:26:47,077 INFO L226 Difference]: Without dead ends: 96 [2021-12-17 02:26:47,080 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 28 SyntacticMatches, 9 SemanticMatches, 103 ConstructedPredicates, 17 IntricatePredicates, 2 DeprecatedPredicates, 3017 ImplicationChecksByTransitivity, 229.9s TimeCoverageRelationStatistics Valid=636, Invalid=6997, Unknown=91, NotChecked=3196, Total=10920 [2021-12-17 02:26:47,080 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 13 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 221 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 1051 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 804 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-17 02:26:47,081 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 286 Invalid, 1051 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 221 Invalid, 0 Unknown, 804 Unchecked, 0.2s Time] [2021-12-17 02:26:47,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2021-12-17 02:26:47,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 90. [2021-12-17 02:26:47,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 89 states have (on average 1.1348314606741574) internal successors, (101), 89 states have internal predecessors, (101), 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) [2021-12-17 02:26:47,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 101 transitions. [2021-12-17 02:26:47,091 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 101 transitions. Word has length 40 [2021-12-17 02:26:47,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 02:26:47,092 INFO L470 AbstractCegarLoop]: Abstraction has 90 states and 101 transitions. [2021-12-17 02:26:47,092 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 80 states, 80 states have (on average 1.3125) internal successors, (105), 80 states have internal predecessors, (105), 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) [2021-12-17 02:26:47,092 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 101 transitions. [2021-12-17 02:26:47,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-12-17 02:26:47,093 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 02:26:47,093 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 02:26:47,118 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2021-12-17 02:26:47,310 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2021-12-17 02:26:47,310 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 02:26:47,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 02:26:47,310 INFO L85 PathProgramCache]: Analyzing trace with hash 524150480, now seen corresponding path program 8 times [2021-12-17 02:26:47,311 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 02:26:47,311 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831976807] [2021-12-17 02:26:47,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 02:26:47,311 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 02:26:47,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 02:26:47,406 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 11 proven. 14 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2021-12-17 02:26:47,407 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 02:26:47,407 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831976807] [2021-12-17 02:26:47,407 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1831976807] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 02:26:47,407 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1964364055] [2021-12-17 02:26:47,407 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-17 02:26:47,407 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 02:26:47,408 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 02:26:47,412 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-17 02:26:47,416 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-12-17 02:26:47,494 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-17 02:26:47,494 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 02:26:47,496 INFO L263 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 10 conjunts are in the unsatisfiable core [2021-12-17 02:26:47,500 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 02:26:47,639 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 16 proven. 9 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2021-12-17 02:26:47,639 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 02:26:47,712 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 16 proven. 9 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2021-12-17 02:26:47,712 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1964364055] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 02:26:47,712 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-17 02:26:47,712 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 17 [2021-12-17 02:26:47,713 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029700682] [2021-12-17 02:26:47,713 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-17 02:26:47,713 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-12-17 02:26:47,713 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 02:26:47,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-12-17 02:26:47,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2021-12-17 02:26:47,714 INFO L87 Difference]: Start difference. First operand 90 states and 101 transitions. Second operand has 17 states, 17 states have (on average 2.823529411764706) internal successors, (48), 17 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 02:26:47,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 02:26:47,932 INFO L93 Difference]: Finished difference Result 191 states and 211 transitions. [2021-12-17 02:26:47,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-17 02:26:47,933 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.823529411764706) internal successors, (48), 17 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2021-12-17 02:26:47,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 02:26:47,933 INFO L225 Difference]: With dead ends: 191 [2021-12-17 02:26:47,933 INFO L226 Difference]: Without dead ends: 148 [2021-12-17 02:26:47,934 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=117, Invalid=303, Unknown=0, NotChecked=0, Total=420 [2021-12-17 02:26:47,935 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 127 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 246 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 332 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-17 02:26:47,936 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [127 Valid, 104 Invalid, 332 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 246 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-17 02:26:47,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2021-12-17 02:26:47,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 97. [2021-12-17 02:26:47,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 96 states have (on average 1.1145833333333333) internal successors, (107), 96 states have internal predecessors, (107), 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) [2021-12-17 02:26:47,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 107 transitions. [2021-12-17 02:26:47,952 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 107 transitions. Word has length 42 [2021-12-17 02:26:47,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 02:26:47,952 INFO L470 AbstractCegarLoop]: Abstraction has 97 states and 107 transitions. [2021-12-17 02:26:47,952 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.823529411764706) internal successors, (48), 17 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 02:26:47,952 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 107 transitions. [2021-12-17 02:26:47,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-12-17 02:26:47,953 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 02:26:47,954 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 02:26:47,976 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2021-12-17 02:26:48,167 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 02:26:48,168 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 02:26:48,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 02:26:48,168 INFO L85 PathProgramCache]: Analyzing trace with hash 2112995272, now seen corresponding path program 2 times [2021-12-17 02:26:48,168 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 02:26:48,168 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786567821] [2021-12-17 02:26:48,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 02:26:48,169 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 02:26:48,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 02:26:50,285 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 02:26:50,285 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 02:26:50,286 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786567821] [2021-12-17 02:26:50,286 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1786567821] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 02:26:50,286 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [842691997] [2021-12-17 02:26:50,286 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-17 02:26:50,286 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 02:26:50,286 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 02:26:50,287 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-17 02:26:50,288 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2021-12-17 02:26:50,366 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-17 02:26:50,367 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 02:26:50,368 WARN L261 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 98 conjunts are in the unsatisfiable core [2021-12-17 02:26:50,371 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 02:26:50,384 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-12-17 02:26:50,384 INFO L388 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 [2021-12-17 02:26:50,395 INFO L388 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 11 treesize of output 7 [2021-12-17 02:26:50,410 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2021-12-17 02:26:50,459 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:26:50,460 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2021-12-17 02:26:50,542 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:26:50,543 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:26:50,544 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 42 [2021-12-17 02:26:50,757 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:26:50,758 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:26:50,759 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 57 [2021-12-17 02:26:50,896 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:26:50,897 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:26:50,897 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:26:50,899 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 67 [2021-12-17 02:26:51,095 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:26:51,096 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:26:51,096 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:26:51,097 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:26:51,098 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:26:51,099 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 9 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 79 [2021-12-17 02:26:51,266 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:26:51,267 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:26:51,268 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:26:51,268 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:26:51,269 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 7 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 74 [2021-12-17 02:26:51,456 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:26:51,456 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:26:51,457 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 02:26:51,458 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:26:51,458 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:26:51,459 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 7 disjoint index pairs (out of 21 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 79 [2021-12-17 02:26:51,652 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:26:51,653 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:26:51,653 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:26:51,654 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:26:51,654 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 02:26:51,655 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:26:51,656 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 7 disjoint index pairs (out of 21 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 72 [2021-12-17 02:26:51,912 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:26:51,913 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:26:51,914 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 02:26:51,914 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:26:51,915 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 02:26:51,915 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:26:51,916 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 7 disjoint index pairs (out of 21 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 82 [2021-12-17 02:26:52,130 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:26:52,131 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:26:52,132 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:26:52,133 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:26:52,133 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 02:26:52,134 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:26:52,134 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:26:52,135 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 02:26:52,136 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:26:52,137 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:26:52,137 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:26:52,138 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:26:52,139 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:26:52,139 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 02:26:52,141 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-12-17 02:26:52,142 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 8 disjoint index pairs (out of 21 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 119 treesize of output 93 [2021-12-17 02:26:52,411 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:26:52,413 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:26:52,414 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:26:52,414 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:26:52,416 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:26:52,416 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:26:52,419 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:26:52,420 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:26:52,420 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 02:26:52,421 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:26:52,422 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:26:52,432 INFO L354 Elim1Store]: treesize reduction 38, result has 36.7 percent of original size [2021-12-17 02:26:52,433 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 11 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 7 case distinctions, treesize of input 122 treesize of output 104 [2021-12-17 02:26:53,214 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-17 02:26:53,215 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 82 treesize of output 42 [2021-12-17 02:26:53,253 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 02:26:53,254 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 02:26:55,498 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_199| Int)) (or (forall ((v_ArrVal_699 Int)) (= (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_199| 8)) v_ArrVal_699) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8)) (+ c_~N~0 1))) (< |v_ULTIMATE.start_main_~i~0#1_199| (+ |c_ULTIMATE.start_main_~i~0#1| 1)))) is different from false [2021-12-17 02:27:10,364 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_199| Int) (v_ArrVal_699 Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_199| (+ |c_ULTIMATE.start_main_~i~0#1| 2)) (= (select (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 8) |c_ULTIMATE.start_main_~a~0#1.offset| 8) (+ (select (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|) (+ |c_ULTIMATE.start_main_~b~0#1.offset| (* |c_ULTIMATE.start_main_~i~0#1| 4) 4)) (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_199| 8)) v_ArrVal_699) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8)) (+ c_~N~0 1)))) is different from false [2021-12-17 02:27:37,102 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_207| Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_207| (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (forall ((|v_ULTIMATE.start_main_~i~0#1_199| Int) (v_ArrVal_688 Int) (v_ArrVal_699 Int)) (or (= (let ((.cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8))) (select (store (let ((.cse8 (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| (* |v_ULTIMATE.start_main_~i~0#1_207| 4)) v_ArrVal_688)))) (let ((.cse9 (select .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse4 (select .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse5 (select (select .cse8 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse6 (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse4 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (let ((.cse7 (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse4 .cse5 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 16)))) (let ((.cse3 (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse4 .cse5 .cse6 .cse7))))) (let ((.cse0 (store (select .cse3 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse4 .cse5 .cse6 .cse7 (select (select .cse3 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|))))) (store .cse0 .cse1 (let ((.cse2 (store .cse3 |c_ULTIMATE.start_main_~a~0#1.base| .cse0))) (+ (select (select .cse2 |c_ULTIMATE.start_main_~b~0#1.base|) (+ |c_ULTIMATE.start_main_~b~0#1.offset| 4)) (select (select .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))))))))))) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_199| 8)) v_ArrVal_699) .cse1)) (+ c_~N~0 1)) (< |v_ULTIMATE.start_main_~i~0#1_199| 2))))) is different from false [2021-12-17 02:27:39,207 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_199| Int) (|v_ULTIMATE.start_main_~i~0#1_207| Int) (v_ArrVal_688 Int) (v_ArrVal_699 Int)) (or (= (let ((.cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8))) (select (store (let ((.cse8 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|) (+ |c_ULTIMATE.start_main_~b~0#1.offset| (* |c_ULTIMATE.start_main_~i~0#1| 4)) 1) (+ |c_ULTIMATE.start_main_~b~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_207| 4)) v_ArrVal_688)))) (let ((.cse9 (select .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse5 (select .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse6 (select (select .cse8 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse7 (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse5 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (let ((.cse4 (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse5 .cse6 .cse7))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 16)))) (let ((.cse3 (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse4 .cse5 .cse6 .cse7))))) (let ((.cse0 (store (select .cse3 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse4 .cse5 .cse6 (select (select .cse3 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|) .cse7)))) (store .cse0 .cse1 (let ((.cse2 (store .cse3 |c_ULTIMATE.start_main_~a~0#1.base| .cse0))) (+ (select (select .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select (select .cse2 |c_ULTIMATE.start_main_~b~0#1.base|) (+ |c_ULTIMATE.start_main_~b~0#1.offset| 4)))))))))))) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_199| 8)) v_ArrVal_699) .cse1)) (+ c_~N~0 1)) (< |v_ULTIMATE.start_main_~i~0#1_207| (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (< |v_ULTIMATE.start_main_~i~0#1_199| 2))) is different from false [2021-12-17 02:27:41,306 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_199| Int) (|v_ULTIMATE.start_main_~i~0#1_207| Int) (v_ArrVal_688 Int) (v_ArrVal_699 Int)) (or (= (let ((.cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8))) (select (store (let ((.cse8 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|) (+ |c_ULTIMATE.start_main_~b~0#1.offset| (* |c_ULTIMATE.start_main_~i~0#1| 4) 4) 1) (+ |c_ULTIMATE.start_main_~b~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_207| 4)) v_ArrVal_688)))) (let ((.cse9 (select .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse6 (select .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse4 (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse6 .cse7))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (let ((.cse5 (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse4 .cse6 .cse7))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 16)))) (let ((.cse3 (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse4 .cse5 .cse6 .cse7))))) (let ((.cse0 (store (select .cse3 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse4 .cse5 .cse6 .cse7 (select (select .cse3 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|))))) (store .cse0 .cse1 (let ((.cse2 (store .cse3 |c_ULTIMATE.start_main_~a~0#1.base| .cse0))) (+ (select (select .cse2 |c_ULTIMATE.start_main_~b~0#1.base|) (+ |c_ULTIMATE.start_main_~b~0#1.offset| 4)) (select (select .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))))))))))) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_199| 8)) v_ArrVal_699) .cse1)) (+ c_~N~0 1)) (< |v_ULTIMATE.start_main_~i~0#1_199| 2) (< |v_ULTIMATE.start_main_~i~0#1_207| (+ |c_ULTIMATE.start_main_~i~0#1| 2)))) is different from false [2021-12-17 02:27:43,479 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_199| Int) (|v_ULTIMATE.start_main_~i~0#1_207| Int) (v_ArrVal_688 Int) (v_ArrVal_699 Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_199| 2) (= (let ((.cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8))) (select (store (let ((.cse8 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| (store (let ((.cse10 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|) (+ |c_ULTIMATE.start_main_~b~0#1.offset| .cse10) 1) (+ |c_ULTIMATE.start_main_~b~0#1.offset| .cse10 4) 1)) (+ |c_ULTIMATE.start_main_~b~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_207| 4)) v_ArrVal_688)))) (let ((.cse9 (select .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse6 (select .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse5 (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse6 .cse7))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (let ((.cse4 (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse5 .cse6 .cse7))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 16)))) (let ((.cse3 (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse4 .cse5 .cse6 .cse7))))) (let ((.cse0 (store (select .cse3 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse4 .cse5 .cse6 (select (select .cse3 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|) .cse7)))) (store .cse0 .cse1 (let ((.cse2 (store .cse3 |c_ULTIMATE.start_main_~a~0#1.base| .cse0))) (+ (select (select .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select (select .cse2 |c_ULTIMATE.start_main_~b~0#1.base|) (+ |c_ULTIMATE.start_main_~b~0#1.offset| 4)))))))))))) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_199| 8)) v_ArrVal_699) .cse1)) (+ c_~N~0 1)) (< |v_ULTIMATE.start_main_~i~0#1_207| (+ |c_ULTIMATE.start_main_~i~0#1| 2)))) is different from false [2021-12-17 02:28:36,987 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_199| Int) (|v_ULTIMATE.start_main_~i~0#1_207| Int)) (or (and (forall ((v_ArrVal_688 Int) (v_ArrVal_699 Int)) (<= (+ |c_ULTIMATE.start_main_~i~0#1| 3) (let ((.cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8))) (select (store (let ((.cse3 (+ |c_ULTIMATE.start_main_~b~0#1.offset| 4))) (let ((.cse9 (let ((.cse11 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 8) |c_ULTIMATE.start_main_~a~0#1.offset| 8) 1)))) (store .cse11 |c_ULTIMATE.start_main_~b~0#1.base| (store (store (store (select .cse11 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| 1) .cse3 1) (+ |c_ULTIMATE.start_main_~b~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_207| 4)) v_ArrVal_688))))) (let ((.cse10 (select .cse9 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse5 (select .cse10 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse8 (select (select .cse9 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse7 (select (select (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse5 .cse8))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (let ((.cse6 (select (select (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse5 .cse7 .cse8))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 16)))) (let ((.cse4 (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse5 .cse6 .cse7 .cse8))))) (let ((.cse0 (store (select .cse4 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse5 .cse6 (select (select .cse4 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|) .cse7 .cse8)))) (store .cse0 .cse1 (let ((.cse2 (store .cse4 |c_ULTIMATE.start_main_~a~0#1.base| .cse0))) (+ (select (select .cse2 |c_ULTIMATE.start_main_~b~0#1.base|) .cse3) (select (select .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)))))))))))) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_199| 8)) v_ArrVal_699) .cse1)))) (forall ((v_ArrVal_688 Int) (v_ArrVal_699 Int)) (<= (let ((.cse13 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8))) (select (store (let ((.cse15 (+ |c_ULTIMATE.start_main_~b~0#1.offset| 4))) (let ((.cse21 (let ((.cse23 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 8) |c_ULTIMATE.start_main_~a~0#1.offset| 8) 1)))) (store .cse23 |c_ULTIMATE.start_main_~b~0#1.base| (store (store (store (select .cse23 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| 1) .cse15 1) (+ |c_ULTIMATE.start_main_~b~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_207| 4)) v_ArrVal_688))))) (let ((.cse22 (select .cse21 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse17 (select .cse22 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse20 (select (select .cse21 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse19 (select (select (store .cse21 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse22 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse17 .cse20))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse13))) (let ((.cse18 (select (select (store .cse21 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse22 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse17 .cse19 .cse20))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 16)))) (let ((.cse16 (store .cse21 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse22 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse17 .cse18 .cse19 .cse20))))) (let ((.cse12 (store (select .cse16 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse17 .cse18 (select (select .cse16 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|) .cse19 .cse20)))) (store .cse12 .cse13 (let ((.cse14 (store .cse16 |c_ULTIMATE.start_main_~a~0#1.base| .cse12))) (+ (select (select .cse14 |c_ULTIMATE.start_main_~b~0#1.base|) .cse15) (select (select .cse14 |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)))))))))))) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_199| 8)) v_ArrVal_699) .cse13)) (+ |c_ULTIMATE.start_main_~i~0#1| 3)))) (< |v_ULTIMATE.start_main_~i~0#1_199| 2) (< |v_ULTIMATE.start_main_~i~0#1_207| 2))) is different from false [2021-12-17 02:28:39,660 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_199| Int) (|v_ULTIMATE.start_main_~i~0#1_207| Int)) (or (and (forall ((v_ArrVal_688 Int) (v_ArrVal_699 Int)) (<= (let ((.cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8))) (select (store (let ((.cse3 (+ |c_ULTIMATE.start_main_~b~0#1.offset| 4))) (let ((.cse9 (let ((.cse11 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse12 (* |c_ULTIMATE.start_main_~i~0#1| 8))) (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse12 |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (+ .cse12 |c_ULTIMATE.start_main_~a~0#1.offset| 8) 1))))) (store .cse11 |c_ULTIMATE.start_main_~b~0#1.base| (store (store (store (select .cse11 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| 1) .cse3 1) (+ |c_ULTIMATE.start_main_~b~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_207| 4)) v_ArrVal_688))))) (let ((.cse10 (select .cse9 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse5 (select .cse10 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse8 (select (select .cse9 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse7 (select (select (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse5 .cse8))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (let ((.cse6 (select (select (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse5 .cse7 .cse8))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 16)))) (let ((.cse4 (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse5 .cse6 .cse7 .cse8))))) (let ((.cse0 (store (select .cse4 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse5 .cse6 .cse7 .cse8 (select (select .cse4 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|))))) (store .cse0 .cse1 (let ((.cse2 (store .cse4 |c_ULTIMATE.start_main_~a~0#1.base| .cse0))) (+ (select (select .cse2 |c_ULTIMATE.start_main_~b~0#1.base|) .cse3) (select (select .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)))))))))))) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_199| 8)) v_ArrVal_699) .cse1)) (+ |c_ULTIMATE.start_main_~i~0#1| 3))) (forall ((v_ArrVal_688 Int) (v_ArrVal_699 Int)) (<= (+ |c_ULTIMATE.start_main_~i~0#1| 3) (let ((.cse14 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8))) (select (store (let ((.cse16 (+ |c_ULTIMATE.start_main_~b~0#1.offset| 4))) (let ((.cse22 (let ((.cse24 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse25 (* |c_ULTIMATE.start_main_~i~0#1| 8))) (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse25 |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (+ .cse25 |c_ULTIMATE.start_main_~a~0#1.offset| 8) 1))))) (store .cse24 |c_ULTIMATE.start_main_~b~0#1.base| (store (store (store (select .cse24 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| 1) .cse16 1) (+ |c_ULTIMATE.start_main_~b~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_207| 4)) v_ArrVal_688))))) (let ((.cse23 (select .cse22 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse18 (select .cse23 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse21 (select (select .cse22 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse20 (select (select (store .cse22 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse23 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse18 .cse21))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse14))) (let ((.cse19 (select (select (store .cse22 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse23 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse18 .cse20 .cse21))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 16)))) (let ((.cse17 (store .cse22 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse23 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse18 .cse19 .cse20 .cse21))))) (let ((.cse13 (store (select .cse17 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse18 .cse19 .cse20 .cse21 (select (select .cse17 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|))))) (store .cse13 .cse14 (let ((.cse15 (store .cse17 |c_ULTIMATE.start_main_~a~0#1.base| .cse13))) (+ (select (select .cse15 |c_ULTIMATE.start_main_~b~0#1.base|) .cse16) (select (select .cse15 |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)))))))))))) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_199| 8)) v_ArrVal_699) .cse14))))) (< |v_ULTIMATE.start_main_~i~0#1_199| 2) (< |v_ULTIMATE.start_main_~i~0#1_207| 2))) is different from false [2021-12-17 02:28:42,482 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_199| Int) (|v_ULTIMATE.start_main_~i~0#1_207| Int)) (or (and (forall ((v_ArrVal_688 Int) (v_ArrVal_699 Int)) (<= (+ |c_ULTIMATE.start_main_~i~0#1| 4) (let ((.cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8))) (select (store (let ((.cse3 (+ |c_ULTIMATE.start_main_~b~0#1.offset| 4))) (let ((.cse9 (let ((.cse11 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse12 (* |c_ULTIMATE.start_main_~i~0#1| 8))) (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse12 |c_ULTIMATE.start_main_~a~0#1.offset| 8) 1) (+ .cse12 |c_ULTIMATE.start_main_~a~0#1.offset| 16) 1))))) (store .cse11 |c_ULTIMATE.start_main_~b~0#1.base| (store (store (store (select .cse11 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| 1) .cse3 1) (+ |c_ULTIMATE.start_main_~b~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_207| 4)) v_ArrVal_688))))) (let ((.cse10 (select .cse9 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse5 (select .cse10 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse8 (select (select .cse9 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse7 (select (select (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse5 .cse8))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (let ((.cse6 (select (select (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse5 .cse7 .cse8))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 16)))) (let ((.cse4 (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse5 .cse6 .cse7 .cse8))))) (let ((.cse0 (store (select .cse4 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse5 (select (select .cse4 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|) .cse6 .cse7 .cse8)))) (store .cse0 .cse1 (let ((.cse2 (store .cse4 |c_ULTIMATE.start_main_~a~0#1.base| .cse0))) (+ (select (select .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select (select .cse2 |c_ULTIMATE.start_main_~b~0#1.base|) .cse3)))))))))))) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_199| 8)) v_ArrVal_699) .cse1)))) (forall ((v_ArrVal_688 Int) (v_ArrVal_699 Int)) (<= (let ((.cse14 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8))) (select (store (let ((.cse16 (+ |c_ULTIMATE.start_main_~b~0#1.offset| 4))) (let ((.cse22 (let ((.cse24 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse25 (* |c_ULTIMATE.start_main_~i~0#1| 8))) (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse25 |c_ULTIMATE.start_main_~a~0#1.offset| 8) 1) (+ .cse25 |c_ULTIMATE.start_main_~a~0#1.offset| 16) 1))))) (store .cse24 |c_ULTIMATE.start_main_~b~0#1.base| (store (store (store (select .cse24 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| 1) .cse16 1) (+ |c_ULTIMATE.start_main_~b~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_207| 4)) v_ArrVal_688))))) (let ((.cse23 (select .cse22 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse18 (select .cse23 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse21 (select (select .cse22 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse20 (select (select (store .cse22 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse23 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse18 .cse21))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse14))) (let ((.cse19 (select (select (store .cse22 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse23 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse18 .cse20 .cse21))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 16)))) (let ((.cse17 (store .cse22 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse23 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse18 .cse19 .cse20 .cse21))))) (let ((.cse13 (store (select .cse17 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse18 (select (select .cse17 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|) .cse19 .cse20 .cse21)))) (store .cse13 .cse14 (let ((.cse15 (store .cse17 |c_ULTIMATE.start_main_~a~0#1.base| .cse13))) (+ (select (select .cse15 |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select (select .cse15 |c_ULTIMATE.start_main_~b~0#1.base|) .cse16)))))))))))) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_199| 8)) v_ArrVal_699) .cse14)) (+ |c_ULTIMATE.start_main_~i~0#1| 4)))) (< |v_ULTIMATE.start_main_~i~0#1_199| 2) (< |v_ULTIMATE.start_main_~i~0#1_207| 2))) is different from false [2021-12-17 02:29:24,989 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 20 refuted. 1 times theorem prover too weak. 0 trivial. 17 not checked. [2021-12-17 02:29:24,990 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [842691997] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 02:29:24,990 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-17 02:29:24,990 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 31, 31] total 80 [2021-12-17 02:29:24,990 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749916322] [2021-12-17 02:29:24,990 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-17 02:29:24,991 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 80 states [2021-12-17 02:29:24,991 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 02:29:24,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2021-12-17 02:29:24,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=4473, Unknown=68, NotChecked=1314, Total=6320 [2021-12-17 02:29:24,993 INFO L87 Difference]: Start difference. First operand 97 states and 107 transitions. Second operand has 80 states, 80 states have (on average 1.4) internal successors, (112), 80 states have internal predecessors, (112), 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) [2021-12-17 02:29:29,424 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|))) (and (= (select .cse0 8) 1) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 0) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (= |c_ULTIMATE.start_main_~b~0#1.offset| 0) (= (select .cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* c_~N~0 8) (- 8))) 1) (<= c_~N~0 3) (= (select .cse1 (+ |c_ULTIMATE.start_main_~b~0#1.offset| (* |c_ULTIMATE.start_main_~i~0#1| 4))) 1) (not (= |c_ULTIMATE.start_main_~a~0#1.base| |c_ULTIMATE.start_main_~b~0#1.base|)) (forall ((|v_ULTIMATE.start_main_~i~0#1_207| Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_207| (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (forall ((|v_ULTIMATE.start_main_~i~0#1_199| Int) (v_ArrVal_688 Int) (v_ArrVal_699 Int)) (or (= (let ((.cse3 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8))) (select (store (let ((.cse10 (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| (* |v_ULTIMATE.start_main_~i~0#1_207| 4)) v_ArrVal_688)))) (let ((.cse11 (select .cse10 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse6 (select .cse11 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse7 (select (select .cse10 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse8 (select (select (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse11 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse6 .cse7))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (let ((.cse9 (select (select (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse11 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse6 .cse7 .cse8))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 16)))) (let ((.cse5 (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse11 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse6 .cse7 .cse8 .cse9))))) (let ((.cse2 (store (select .cse5 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse6 .cse7 .cse8 .cse9 (select (select .cse5 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|))))) (store .cse2 .cse3 (let ((.cse4 (store .cse5 |c_ULTIMATE.start_main_~a~0#1.base| .cse2))) (+ (select (select .cse4 |c_ULTIMATE.start_main_~b~0#1.base|) (+ |c_ULTIMATE.start_main_~b~0#1.offset| 4)) (select (select .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))))))))))) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_199| 8)) v_ArrVal_699) .cse3)) (+ c_~N~0 1)) (< |v_ULTIMATE.start_main_~i~0#1_199| 2))))) (<= 3 c_~N~0) (= (select .cse1 |c_ULTIMATE.start_main_~b~0#1.offset|) 1) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~b~0#1.base|)) (= |c_ULTIMATE.start_main_~i~0#1| 1) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)))) is different from false [2021-12-17 02:29:31,951 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|))) (and (forall ((|v_ULTIMATE.start_main_~i~0#1_199| Int)) (or (forall ((v_ArrVal_699 Int)) (= (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_199| 8)) v_ArrVal_699) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8)) (+ c_~N~0 1))) (< |v_ULTIMATE.start_main_~i~0#1_199| (+ |c_ULTIMATE.start_main_~i~0#1| 1)))) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 8) |c_ULTIMATE.start_main_~a~0#1.offset|)) (+ c_~N~0 1)) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= (select .cse0 0) 1) (= |c_ULTIMATE.start_main_~b~0#1.offset| 0) (= (+ |c_ULTIMATE.start_main_~b~0#1.offset| (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)) c_~N~0) (= (select .cse0 (+ |c_ULTIMATE.start_main_~b~0#1.offset| 4)) 1) (= (select .cse0 (+ |c_ULTIMATE.start_main_~b~0#1.offset| (* |c_ULTIMATE.start_main_~i~0#1| 4))) 1) (forall ((|v_ULTIMATE.start_main_~i~0#1_199| Int) (v_ArrVal_699 Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_199| (+ |c_ULTIMATE.start_main_~i~0#1| 2)) (= (select (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 8) |c_ULTIMATE.start_main_~a~0#1.offset| 8) (+ (select (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|) (+ |c_ULTIMATE.start_main_~b~0#1.offset| (* |c_ULTIMATE.start_main_~i~0#1| 4) 4)) (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_199| 8)) v_ArrVal_699) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8)) (+ c_~N~0 1)))) (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int) (|ULTIMATE.start_main_~b~0#1.base| Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse3 (select |c_#memory_int| |ULTIMATE.start_main_~b~0#1.base|)) (.cse4 (* |c_ULTIMATE.start_main_~i~0#1| 4)) (.cse5 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse6 (* |c_ULTIMATE.start_main_~i~0#1| 8))) (let ((.cse2 (select .cse5 (+ .cse6 |c_ULTIMATE.start_main_~a~0#1.offset|))) (.cse1 (select .cse3 (+ .cse4 c_~N~0 (- 3))))) (and (= (+ .cse1 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|)) .cse2) (= (select .cse3 (+ .cse4 c_~N~0 (- 7))) 1) (= (+ .cse1 (select .cse5 (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* c_~N~0 8) (- 8))) 2) .cse2) (= .cse2 (+ .cse1 3)) (not (= |ULTIMATE.start_main_~#sum~0#1.base| |ULTIMATE.start_main_~b~0#1.base|)) (= (+ .cse1 (select .cse5 (+ .cse6 |c_ULTIMATE.start_main_~a~0#1.offset| (- 8)))) (+ .cse2 1)) (= .cse1 1) (not (= |ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)))))) (not (= |c_ULTIMATE.start_main_~a~0#1.base| |c_ULTIMATE.start_main_~b~0#1.base|)) (= c_~N~0 3) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~b~0#1.base|)) (<= 1 |c_ULTIMATE.start_main_~i~0#1|) (<= (+ (* 8 |c_ULTIMATE.start_main_~i~0#1|) |c_ULTIMATE.start_main_~a~0#1.offset|) 8) (= |c_ULTIMATE.start_main_~i~0#1| 1) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)))) is different from false [2021-12-17 02:29:34,067 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~i~0#1_199| Int)) (or (forall ((v_ArrVal_699 Int)) (= (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_199| 8)) v_ArrVal_699) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8)) (+ c_~N~0 1))) (< |v_ULTIMATE.start_main_~i~0#1_199| (+ |c_ULTIMATE.start_main_~i~0#1| 1)))) (forall ((|v_ULTIMATE.start_main_~i~0#1_199| Int) (v_ArrVal_699 Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_199| (+ |c_ULTIMATE.start_main_~i~0#1| 2)) (= (select (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 8) |c_ULTIMATE.start_main_~a~0#1.offset| 8) (+ (select (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|) (+ |c_ULTIMATE.start_main_~b~0#1.offset| (* |c_ULTIMATE.start_main_~i~0#1| 4) 4)) (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_199| 8)) v_ArrVal_699) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8)) (+ c_~N~0 1)))) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= c_~N~0 3) (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int) (|ULTIMATE.start_main_~b~0#1.base| Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse1 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse4 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse0 (select |c_#memory_int| |ULTIMATE.start_main_~b~0#1.base|)) (.cse2 (select .cse4 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8))) (.cse3 (+ .cse1 1))) (and (= (select .cse0 (+ c_~N~0 (- 3))) 1) (= (+ .cse1 (select .cse0 (+ c_~N~0 1))) .cse2) (= .cse2 .cse3) (= (select .cse4 |c_ULTIMATE.start_main_~a~0#1.offset|) .cse3) (= .cse1 3) (not (= |ULTIMATE.start_main_~#sum~0#1.base| |ULTIMATE.start_main_~b~0#1.base|)) (not (= |ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|))))))) is different from false [2021-12-17 02:29:34,791 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~i~0#1_199| Int) (v_ArrVal_699 Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_199| (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (= (select (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ (select (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|) (+ |c_ULTIMATE.start_main_~b~0#1.offset| (* |c_ULTIMATE.start_main_~i~0#1| 4))) (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_199| 8)) v_ArrVal_699) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8)) (+ c_~N~0 1)))) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= c_~N~0 3) (forall ((v_ArrVal_699 Int)) (= (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_699) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8)) (+ c_~N~0 1))) (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int) (|ULTIMATE.start_main_~b~0#1.base| Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse1 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse4 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse0 (select |c_#memory_int| |ULTIMATE.start_main_~b~0#1.base|)) (.cse2 (select .cse4 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8))) (.cse3 (+ .cse1 1))) (and (= (select .cse0 (+ c_~N~0 (- 3))) 1) (= (+ .cse1 (select .cse0 (+ c_~N~0 1))) .cse2) (= .cse2 .cse3) (= (select .cse4 |c_ULTIMATE.start_main_~a~0#1.offset|) .cse3) (= .cse1 3) (not (= |ULTIMATE.start_main_~#sum~0#1.base| |ULTIMATE.start_main_~b~0#1.base|)) (not (= |ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|))))))) is different from false [2021-12-17 02:29:34,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 02:29:34,875 INFO L93 Difference]: Finished difference Result 122 states and 132 transitions. [2021-12-17 02:29:34,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2021-12-17 02:29:34,875 INFO L78 Accepts]: Start accepts. Automaton has has 80 states, 80 states have (on average 1.4) internal successors, (112), 80 states have internal predecessors, (112), 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 44 [2021-12-17 02:29:34,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 02:29:34,877 INFO L225 Difference]: With dead ends: 122 [2021-12-17 02:29:34,877 INFO L226 Difference]: Without dead ends: 120 [2021-12-17 02:29:34,878 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 31 SyntacticMatches, 20 SemanticMatches, 88 ConstructedPredicates, 13 IntricatePredicates, 0 DeprecatedPredicates, 2608 ImplicationChecksByTransitivity, 158.9s TimeCoverageRelationStatistics Valid=551, Invalid=5280, Unknown=73, NotChecked=2106, Total=8010 [2021-12-17 02:29:34,879 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 16 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 402 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 1238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 402 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 818 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-17 02:29:34,879 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 217 Invalid, 1238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 402 Invalid, 0 Unknown, 818 Unchecked, 0.2s Time] [2021-12-17 02:29:34,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2021-12-17 02:29:34,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2021-12-17 02:29:34,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 119 states have (on average 1.0924369747899159) internal successors, (130), 119 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 02:29:34,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 130 transitions. [2021-12-17 02:29:34,894 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 130 transitions. Word has length 44 [2021-12-17 02:29:34,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 02:29:34,894 INFO L470 AbstractCegarLoop]: Abstraction has 120 states and 130 transitions. [2021-12-17 02:29:34,895 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 80 states, 80 states have (on average 1.4) internal successors, (112), 80 states have internal predecessors, (112), 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) [2021-12-17 02:29:34,895 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 130 transitions. [2021-12-17 02:29:34,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-12-17 02:29:34,903 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 02:29:34,903 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 02:29:34,923 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2021-12-17 02:29:35,115 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2021-12-17 02:29:35,116 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 02:29:35,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 02:29:35,116 INFO L85 PathProgramCache]: Analyzing trace with hash -22665458, now seen corresponding path program 9 times [2021-12-17 02:29:35,116 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 02:29:35,116 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109259185] [2021-12-17 02:29:35,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 02:29:35,116 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 02:29:35,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 02:29:35,226 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 4 proven. 21 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2021-12-17 02:29:35,227 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 02:29:35,227 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109259185] [2021-12-17 02:29:35,227 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2109259185] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 02:29:35,227 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1564977643] [2021-12-17 02:29:35,227 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-17 02:29:35,227 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 02:29:35,227 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 02:29:35,232 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-17 02:29:35,233 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2021-12-17 02:29:35,374 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2021-12-17 02:29:35,374 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 02:29:35,375 INFO L263 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 10 conjunts are in the unsatisfiable core [2021-12-17 02:29:35,376 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 02:29:35,496 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 9 proven. 16 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2021-12-17 02:29:35,496 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 02:29:35,572 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 9 proven. 16 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2021-12-17 02:29:35,573 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1564977643] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 02:29:35,573 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-17 02:29:35,573 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 17 [2021-12-17 02:29:35,573 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044025597] [2021-12-17 02:29:35,573 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-17 02:29:35,574 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-12-17 02:29:35,574 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 02:29:35,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-12-17 02:29:35,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2021-12-17 02:29:35,574 INFO L87 Difference]: Start difference. First operand 120 states and 130 transitions. Second operand has 17 states, 17 states have (on average 3.8823529411764706) internal successors, (66), 17 states have internal predecessors, (66), 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) [2021-12-17 02:29:35,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 02:29:35,863 INFO L93 Difference]: Finished difference Result 155 states and 163 transitions. [2021-12-17 02:29:35,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-17 02:29:35,863 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.8823529411764706) internal successors, (66), 17 states have internal predecessors, (66), 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 44 [2021-12-17 02:29:35,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 02:29:35,864 INFO L225 Difference]: With dead ends: 155 [2021-12-17 02:29:35,864 INFO L226 Difference]: Without dead ends: 115 [2021-12-17 02:29:35,865 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 85 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=148, Invalid=452, Unknown=0, NotChecked=0, Total=600 [2021-12-17 02:29:35,865 INFO L933 BasicCegarLoop]: 35 mSDtfsCounter, 139 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 414 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 487 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 414 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-17 02:29:35,865 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [139 Valid, 139 Invalid, 487 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 414 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-17 02:29:35,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2021-12-17 02:29:35,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 86. [2021-12-17 02:29:35,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 85 states have (on average 1.0705882352941176) internal successors, (91), 85 states have internal predecessors, (91), 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) [2021-12-17 02:29:35,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 91 transitions. [2021-12-17 02:29:35,879 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 91 transitions. Word has length 44 [2021-12-17 02:29:35,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 02:29:35,880 INFO L470 AbstractCegarLoop]: Abstraction has 86 states and 91 transitions. [2021-12-17 02:29:35,880 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.8823529411764706) internal successors, (66), 17 states have internal predecessors, (66), 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) [2021-12-17 02:29:35,881 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 91 transitions. [2021-12-17 02:29:35,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-12-17 02:29:35,881 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 02:29:35,881 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 02:29:35,915 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2021-12-17 02:29:36,107 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2021-12-17 02:29:36,107 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 02:29:36,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 02:29:36,108 INFO L85 PathProgramCache]: Analyzing trace with hash -1258986306, now seen corresponding path program 3 times [2021-12-17 02:29:36,108 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 02:29:36,108 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458614375] [2021-12-17 02:29:36,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 02:29:36,108 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 02:29:36,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 02:29:37,450 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-17 02:29:37,451 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 02:29:37,451 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458614375] [2021-12-17 02:29:37,451 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1458614375] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 02:29:37,451 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1414363750] [2021-12-17 02:29:37,451 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-17 02:29:37,451 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 02:29:37,452 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 02:29:37,456 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-17 02:29:37,457 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2021-12-17 02:29:37,548 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2021-12-17 02:29:37,548 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 02:29:37,550 INFO L263 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 76 conjunts are in the unsatisfiable core [2021-12-17 02:29:37,552 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 02:29:37,565 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:29:37,568 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-12-17 02:29:37,568 INFO L388 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 19 treesize of output 15 [2021-12-17 02:29:37,743 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-12-17 02:29:37,854 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:29:37,855 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2021-12-17 02:29:37,950 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-12-17 02:29:37,950 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2021-12-17 02:29:38,194 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:29:38,195 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2021-12-17 02:29:38,293 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:29:38,294 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2021-12-17 02:29:38,395 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:29:38,397 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-12-17 02:29:38,397 INFO L388 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 1 case distinctions, treesize of input 30 treesize of output 32 [2021-12-17 02:29:38,607 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:29:38,608 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 02:29:38,613 INFO L354 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2021-12-17 02:29:38,613 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 48 treesize of output 49 [2021-12-17 02:29:38,876 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:29:38,877 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:29:38,882 INFO L354 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2021-12-17 02:29:38,882 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 57 treesize of output 57 [2021-12-17 02:29:39,030 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:29:39,052 INFO L354 Elim1Store]: treesize reduction 100, result has 13.0 percent of original size [2021-12-17 02:29:39,052 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 57 treesize of output 64 [2021-12-17 02:29:40,839 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:29:40,843 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:29:40,869 INFO L354 Elim1Store]: treesize reduction 66, result has 14.3 percent of original size [2021-12-17 02:29:40,869 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 3 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 8 case distinctions, treesize of input 142 treesize of output 70 [2021-12-17 02:29:40,926 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 1 proven. 25 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2021-12-17 02:29:40,926 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 02:30:54,351 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-17 02:30:54,352 INFO L388 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 278 treesize of output 236 [2021-12-17 02:31:23,745 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_246| Int) (|v_ULTIMATE.start_main_~i~0#1_247| Int) (v_arrayElimArr_2 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_241| Int) (|v_ULTIMATE.start_main_~i~0#1_254| Int) (v_ArrVal_857 Int) (v_ArrVal_867 Int)) (let ((.cse1 (let ((.cse4 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|) (+ |c_ULTIMATE.start_main_~b~0#1.offset| (* |c_ULTIMATE.start_main_~i~0#1| 4) 4) v_ArrVal_857) (+ |c_ULTIMATE.start_main_~b~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_254| 4)) 1)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_2))) (let ((.cse2 (store (store (select .cse4 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset| (+ (select (select .cse4 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|) (select v_arrayElimArr_2 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_247| 8)) v_ArrVal_867))) (store .cse2 (+ (* |v_ULTIMATE.start_main_~i~0#1_246| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) (let ((.cse3 (store .cse4 |c_ULTIMATE.start_main_~a~0#1.base| .cse2))) (+ (select (select .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select (select .cse3 |c_ULTIMATE.start_main_~b~0#1.base|) (+ |c_ULTIMATE.start_main_~b~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_246| 4)))))))))) (let ((.cse0 (select .cse1 |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (< |v_ULTIMATE.start_main_~i~0#1_241| 2) (< (+ |v_ULTIMATE.start_main_~i~0#1_246| 2) .cse0) (< (+ |v_ULTIMATE.start_main_~i~0#1_254| 2) .cse0) (< |v_ULTIMATE.start_main_~i~0#1_247| 1) (<= .cse0 (+ |v_ULTIMATE.start_main_~i~0#1_254| 1)) (< (+ |c_ULTIMATE.start_main_~i~0#1| 2) |v_ULTIMATE.start_main_~i~0#1_254|) (<= .cse0 (+ |v_ULTIMATE.start_main_~i~0#1_241| 1)) (<= .cse0 (+ |v_ULTIMATE.start_main_~i~0#1_246| 1)) (= (select .cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_241| 8))) .cse0))))) is different from false [2021-12-17 02:31:23,807 INFO L354 Elim1Store]: treesize reduction 116, result has 29.7 percent of original size [2021-12-17 02:31:23,807 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 2336 treesize of output 872 [2021-12-17 02:31:23,944 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-17 02:31:23,946 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15359 treesize of output 14353 [2021-12-17 02:31:25,036 INFO L354 Elim1Store]: treesize reduction 12, result has 83.6 percent of original size [2021-12-17 02:31:25,041 INFO L388 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 899299 treesize of output 797987 [2021-12-17 02:31:50,819 WARN L227 SmtUtils]: Spent 25.77s on a formula simplification. DAG size of input: 4798 DAG size of output: 4565 (called from [L1066] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) Killed by 15