./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-fpi/condg.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/condg.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 2909e53e12aac54327f6ce090ad489c978c1fbcfb0ae8bd4172abe8a99b2cb53 --- Real Ultimate output --- This is Ultimate 0.2.2-tmp.no-commuhash-c3fed41 [2021-12-17 01:25:03,055 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-17 01:25:03,057 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-17 01:25:03,091 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-17 01:25:03,092 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-17 01:25:03,095 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-17 01:25:03,096 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-17 01:25:03,098 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-17 01:25:03,099 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-17 01:25:03,102 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-17 01:25:03,103 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-17 01:25:03,104 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-17 01:25:03,104 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-17 01:25:03,106 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-17 01:25:03,108 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-17 01:25:03,115 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-17 01:25:03,116 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-17 01:25:03,116 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-17 01:25:03,117 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-17 01:25:03,118 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-17 01:25:03,119 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-17 01:25:03,120 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-17 01:25:03,121 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-17 01:25:03,122 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-17 01:25:03,123 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-17 01:25:03,125 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-17 01:25:03,126 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-17 01:25:03,126 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-17 01:25:03,127 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-17 01:25:03,128 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-17 01:25:03,128 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-17 01:25:03,129 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-17 01:25:03,130 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-17 01:25:03,131 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-17 01:25:03,132 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-17 01:25:03,132 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-17 01:25:03,133 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-17 01:25:03,133 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-17 01:25:03,133 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-17 01:25:03,134 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-17 01:25:03,135 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-17 01:25:03,137 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-17 01:25:03,176 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-17 01:25:03,176 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-17 01:25:03,177 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-17 01:25:03,177 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-17 01:25:03,178 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-17 01:25:03,178 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-17 01:25:03,186 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-17 01:25:03,187 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-17 01:25:03,187 INFO L138 SettingsManager]: * Use SBE=true [2021-12-17 01:25:03,187 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-17 01:25:03,188 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-17 01:25:03,188 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-17 01:25:03,188 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-17 01:25:03,188 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-17 01:25:03,188 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-17 01:25:03,188 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-17 01:25:03,189 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-17 01:25:03,189 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-17 01:25:03,189 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-17 01:25:03,189 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-17 01:25:03,189 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-17 01:25:03,189 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-17 01:25:03,189 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-17 01:25:03,190 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-17 01:25:03,190 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-17 01:25:03,190 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-17 01:25:03,190 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-17 01:25:03,191 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-17 01:25:03,191 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-17 01:25:03,191 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-17 01:25:03,191 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-17 01:25:03,191 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-17 01:25:03,192 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-17 01:25:03,192 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-17 01:25:03,192 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 -> 2909e53e12aac54327f6ce090ad489c978c1fbcfb0ae8bd4172abe8a99b2cb53 [2021-12-17 01:25:03,358 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-17 01:25:03,383 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-17 01:25:03,386 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-17 01:25:03,386 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-17 01:25:03,387 INFO L275 PluginConnector]: CDTParser initialized [2021-12-17 01:25:03,388 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-fpi/condg.c [2021-12-17 01:25:03,437 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7c57dced9/9486465702bd4ee4bdbe51347ca4057f/FLAGd5bb86324 [2021-12-17 01:25:03,779 INFO L306 CDTParser]: Found 1 translation units. [2021-12-17 01:25:03,780 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/condg.c [2021-12-17 01:25:03,785 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7c57dced9/9486465702bd4ee4bdbe51347ca4057f/FLAGd5bb86324 [2021-12-17 01:25:04,200 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7c57dced9/9486465702bd4ee4bdbe51347ca4057f [2021-12-17 01:25:04,202 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-17 01:25:04,204 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-17 01:25:04,206 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-17 01:25:04,206 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-17 01:25:04,209 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-17 01:25:04,209 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.12 01:25:04" (1/1) ... [2021-12-17 01:25:04,210 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@676fa201 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 01:25:04, skipping insertion in model container [2021-12-17 01:25:04,210 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.12 01:25:04" (1/1) ... [2021-12-17 01:25:04,215 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-17 01:25:04,225 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-17 01:25:04,307 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/condg.c[588,601] [2021-12-17 01:25:04,327 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-17 01:25:04,333 INFO L203 MainTranslator]: Completed pre-run [2021-12-17 01:25:04,341 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/condg.c[588,601] [2021-12-17 01:25:04,347 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-17 01:25:04,356 INFO L208 MainTranslator]: Completed translation [2021-12-17 01:25:04,357 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 01:25:04 WrapperNode [2021-12-17 01:25:04,357 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-17 01:25:04,358 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-17 01:25:04,358 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-17 01:25:04,359 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-17 01:25:04,363 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 01:25:04" (1/1) ... [2021-12-17 01:25:04,368 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 01:25:04" (1/1) ... [2021-12-17 01:25:04,388 INFO L137 Inliner]: procedures = 17, calls = 24, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 89 [2021-12-17 01:25:04,389 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-17 01:25:04,390 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-17 01:25:04,390 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-17 01:25:04,390 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-17 01:25:04,396 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 01:25:04" (1/1) ... [2021-12-17 01:25:04,396 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 01:25:04" (1/1) ... [2021-12-17 01:25:04,409 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 01:25:04" (1/1) ... [2021-12-17 01:25:04,410 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 01:25:04" (1/1) ... [2021-12-17 01:25:04,418 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 01:25:04" (1/1) ... [2021-12-17 01:25:04,424 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 01:25:04" (1/1) ... [2021-12-17 01:25:04,426 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 01:25:04" (1/1) ... [2021-12-17 01:25:04,427 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-17 01:25:04,427 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-17 01:25:04,428 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-17 01:25:04,428 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-17 01:25:04,428 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 01:25:04" (1/1) ... [2021-12-17 01:25:04,433 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-17 01:25:04,440 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 01:25:04,449 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 01:25:04,455 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 01:25:04,482 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-17 01:25:04,482 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-17 01:25:04,482 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-17 01:25:04,483 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-17 01:25:04,483 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-17 01:25:04,483 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-17 01:25:04,483 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-17 01:25:04,483 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-17 01:25:04,483 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-17 01:25:04,526 INFO L236 CfgBuilder]: Building ICFG [2021-12-17 01:25:04,528 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-17 01:25:04,662 INFO L277 CfgBuilder]: Performing block encoding [2021-12-17 01:25:04,667 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-17 01:25:04,675 INFO L301 CfgBuilder]: Removed 4 assume(true) statements. [2021-12-17 01:25:04,681 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 01:25:04 BoogieIcfgContainer [2021-12-17 01:25:04,681 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-17 01:25:04,698 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-17 01:25:04,698 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-17 01:25:04,701 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-17 01:25:04,710 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.12 01:25:04" (1/3) ... [2021-12-17 01:25:04,711 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4cdcf91d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.12 01:25:04, skipping insertion in model container [2021-12-17 01:25:04,712 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 01:25:04" (2/3) ... [2021-12-17 01:25:04,712 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4cdcf91d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.12 01:25:04, skipping insertion in model container [2021-12-17 01:25:04,712 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 01:25:04" (3/3) ... [2021-12-17 01:25:04,713 INFO L111 eAbstractionObserver]: Analyzing ICFG condg.c [2021-12-17 01:25:04,717 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-17 01:25:04,717 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-17 01:25:04,763 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-17 01:25:04,769 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 01:25:04,770 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-17 01:25:04,786 INFO L276 IsEmpty]: Start isEmpty. Operand has 25 states, 23 states have (on average 1.565217391304348) internal successors, (36), 24 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 01:25:04,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-12-17 01:25:04,793 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 01:25:04,794 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 01:25:04,795 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 01:25:04,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 01:25:04,799 INFO L85 PathProgramCache]: Analyzing trace with hash -592817118, now seen corresponding path program 1 times [2021-12-17 01:25:04,805 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 01:25:04,805 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846062852] [2021-12-17 01:25:04,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 01:25:04,806 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 01:25:04,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 01:25:04,933 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 01:25:04,934 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 01:25:04,934 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846062852] [2021-12-17 01:25:04,935 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [846062852] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 01:25:04,935 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 01:25:04,936 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-17 01:25:04,937 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432043966] [2021-12-17 01:25:04,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 01:25:04,940 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-12-17 01:25:04,940 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 01:25:04,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-12-17 01:25:04,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-17 01:25:04,969 INFO L87 Difference]: Start difference. First operand has 25 states, 23 states have (on average 1.565217391304348) internal successors, (36), 24 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) Second operand has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 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 01:25:04,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 01:25:04,985 INFO L93 Difference]: Finished difference Result 46 states and 66 transitions. [2021-12-17 01:25:04,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-12-17 01:25:04,988 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 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 14 [2021-12-17 01:25:04,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 01:25:04,994 INFO L225 Difference]: With dead ends: 46 [2021-12-17 01:25:04,994 INFO L226 Difference]: Without dead ends: 21 [2021-12-17 01:25:04,997 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 01:25:05,001 INFO L933 BasicCegarLoop]: 30 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, 30 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 01:25:05,002 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 01:25:05,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2021-12-17 01:25:05,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2021-12-17 01:25:05,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 1.25) internal successors, (25), 20 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 01:25:05,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2021-12-17 01:25:05,030 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 14 [2021-12-17 01:25:05,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 01:25:05,031 INFO L470 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2021-12-17 01:25:05,031 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 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 01:25:05,031 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2021-12-17 01:25:05,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-12-17 01:25:05,032 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 01:25:05,032 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 01:25:05,032 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-17 01:25:05,033 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 01:25:05,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 01:25:05,034 INFO L85 PathProgramCache]: Analyzing trace with hash 108247460, now seen corresponding path program 1 times [2021-12-17 01:25:05,034 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 01:25:05,035 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21683139] [2021-12-17 01:25:05,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 01:25:05,035 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 01:25:05,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 01:25:05,136 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 01:25:05,136 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 01:25:05,137 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21683139] [2021-12-17 01:25:05,137 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [21683139] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 01:25:05,137 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 01:25:05,138 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-17 01:25:05,138 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067802139] [2021-12-17 01:25:05,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 01:25:05,140 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-17 01:25:05,141 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 01:25:05,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-17 01:25:05,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-17 01:25:05,142 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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 01:25:05,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 01:25:05,196 INFO L93 Difference]: Finished difference Result 48 states and 59 transitions. [2021-12-17 01:25:05,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-17 01:25:05,198 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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 14 [2021-12-17 01:25:05,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 01:25:05,198 INFO L225 Difference]: With dead ends: 48 [2021-12-17 01:25:05,199 INFO L226 Difference]: Without dead ends: 34 [2021-12-17 01:25:05,199 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 01:25:05,200 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 41 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 01:25:05,202 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [41 Valid, 16 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 01:25:05,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2021-12-17 01:25:05,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 24. [2021-12-17 01:25:05,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 23 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 01:25:05,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2021-12-17 01:25:05,218 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 14 [2021-12-17 01:25:05,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 01:25:05,218 INFO L470 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2021-12-17 01:25:05,219 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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 01:25:05,220 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2021-12-17 01:25:05,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-12-17 01:25:05,220 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 01:25:05,220 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] [2021-12-17 01:25:05,220 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-17 01:25:05,220 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 01:25:05,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 01:25:05,221 INFO L85 PathProgramCache]: Analyzing trace with hash -1242970242, now seen corresponding path program 1 times [2021-12-17 01:25:05,221 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 01:25:05,221 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125503510] [2021-12-17 01:25:05,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 01:25:05,221 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 01:25:05,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 01:25:05,472 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 01:25:05,473 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 01:25:05,473 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125503510] [2021-12-17 01:25:05,473 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1125503510] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 01:25:05,473 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1473219609] [2021-12-17 01:25:05,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 01:25:05,473 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 01:25:05,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 01:25:05,496 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 01:25:05,535 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 01:25:05,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 01:25:05,594 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 28 conjunts are in the unsatisfiable core [2021-12-17 01:25:05,598 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 01:25:05,668 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 01:25:05,686 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 01:25:05,744 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 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-17 01:25:05,807 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-12-17 01:25:05,875 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 01:25:05,876 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 01:25:05,951 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_45 (Array Int Int))) (= 1 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_45) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) is different from false [2021-12-17 01:25:05,968 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-17 01:25:05,968 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 1 case distinctions, treesize of input 22 treesize of output 23 [2021-12-17 01:25:05,974 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-17 01:25:05,974 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 34 treesize of output 34 [2021-12-17 01:25:05,978 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 9 treesize of output 7 [2021-12-17 01:25:06,010 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2021-12-17 01:25:06,022 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1473219609] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 01:25:06,022 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-17 01:25:06,022 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 17 [2021-12-17 01:25:06,023 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739237167] [2021-12-17 01:25:06,023 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-17 01:25:06,023 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-12-17 01:25:06,023 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 01:25:06,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-12-17 01:25:06,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=193, Unknown=1, NotChecked=28, Total=272 [2021-12-17 01:25:06,025 INFO L87 Difference]: Start difference. First operand 24 states and 28 transitions. Second operand has 17 states, 17 states have (on average 2.4705882352941178) internal successors, (42), 17 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 01:25:06,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 01:25:06,190 INFO L93 Difference]: Finished difference Result 56 states and 65 transitions. [2021-12-17 01:25:06,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-17 01:25:06,190 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.4705882352941178) internal successors, (42), 17 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 21 [2021-12-17 01:25:06,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 01:25:06,191 INFO L225 Difference]: With dead ends: 56 [2021-12-17 01:25:06,191 INFO L226 Difference]: Without dead ends: 54 [2021-12-17 01:25:06,192 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 30 SyntacticMatches, 8 SemanticMatches, 21 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=370, Unknown=1, NotChecked=40, Total=506 [2021-12-17 01:25:06,193 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 62 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 30 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-17 01:25:06,193 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [62 Valid, 96 Invalid, 232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 158 Invalid, 0 Unknown, 30 Unchecked, 0.1s Time] [2021-12-17 01:25:06,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2021-12-17 01:25:06,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 33. [2021-12-17 01:25:06,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 32 states have (on average 1.28125) internal successors, (41), 32 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 01:25:06,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 41 transitions. [2021-12-17 01:25:06,198 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 41 transitions. Word has length 21 [2021-12-17 01:25:06,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 01:25:06,198 INFO L470 AbstractCegarLoop]: Abstraction has 33 states and 41 transitions. [2021-12-17 01:25:06,199 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.4705882352941178) internal successors, (42), 17 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 01:25:06,199 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 41 transitions. [2021-12-17 01:25:06,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-12-17 01:25:06,199 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 01:25:06,199 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 01:25:06,234 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 01:25:06,415 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 01:25:06,416 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 01:25:06,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 01:25:06,417 INFO L85 PathProgramCache]: Analyzing trace with hash 532037120, now seen corresponding path program 1 times [2021-12-17 01:25:06,417 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 01:25:06,417 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346474486] [2021-12-17 01:25:06,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 01:25:06,417 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 01:25:06,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 01:25:06,630 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 01:25:06,630 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 01:25:06,630 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346474486] [2021-12-17 01:25:06,630 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [346474486] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 01:25:06,630 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [656357950] [2021-12-17 01:25:06,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 01:25:06,630 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 01:25:06,630 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 01:25:06,644 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 01:25:06,659 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 01:25:06,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 01:25:06,704 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 30 conjunts are in the unsatisfiable core [2021-12-17 01:25:06,706 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 01:25:06,734 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 01:25:06,738 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 01:25:06,757 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 0 case distinctions, treesize of input 23 treesize of output 22 [2021-12-17 01:25:06,897 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2021-12-17 01:25:06,960 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 10 [2021-12-17 01:25:06,981 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 01:25:06,981 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 01:25:07,099 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 01:25:07,112 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 01:25:07,112 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [656357950] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 01:25:07,113 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-17 01:25:07,113 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 24 [2021-12-17 01:25:07,113 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165198414] [2021-12-17 01:25:07,113 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-17 01:25:07,113 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2021-12-17 01:25:07,114 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 01:25:07,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-12-17 01:25:07,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=435, Unknown=0, NotChecked=0, Total=552 [2021-12-17 01:25:07,115 INFO L87 Difference]: Start difference. First operand 33 states and 41 transitions. Second operand has 24 states, 24 states have (on average 1.75) internal successors, (42), 24 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 01:25:07,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 01:25:07,291 INFO L93 Difference]: Finished difference Result 66 states and 80 transitions. [2021-12-17 01:25:07,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-17 01:25:07,291 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.75) internal successors, (42), 24 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 21 [2021-12-17 01:25:07,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 01:25:07,292 INFO L225 Difference]: With dead ends: 66 [2021-12-17 01:25:07,292 INFO L226 Difference]: Without dead ends: 56 [2021-12-17 01:25:07,293 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 30 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 243 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=160, Invalid=596, Unknown=0, NotChecked=0, Total=756 [2021-12-17 01:25:07,294 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 25 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 8 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-17 01:25:07,294 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [25 Valid, 106 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 171 Invalid, 0 Unknown, 8 Unchecked, 0.1s Time] [2021-12-17 01:25:07,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2021-12-17 01:25:07,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 42. [2021-12-17 01:25:07,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 41 states have (on average 1.2682926829268293) internal successors, (52), 41 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 01:25:07,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 52 transitions. [2021-12-17 01:25:07,298 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 52 transitions. Word has length 21 [2021-12-17 01:25:07,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 01:25:07,299 INFO L470 AbstractCegarLoop]: Abstraction has 42 states and 52 transitions. [2021-12-17 01:25:07,299 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 1.75) internal successors, (42), 24 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 01:25:07,299 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 52 transitions. [2021-12-17 01:25:07,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-12-17 01:25:07,300 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 01:25:07,300 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] [2021-12-17 01:25:07,340 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 01:25:07,540 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 01:25:07,540 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 01:25:07,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 01:25:07,541 INFO L85 PathProgramCache]: Analyzing trace with hash -1912499326, now seen corresponding path program 2 times [2021-12-17 01:25:07,541 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 01:25:07,541 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664378917] [2021-12-17 01:25:07,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 01:25:07,541 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 01:25:07,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 01:25:07,599 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-17 01:25:07,599 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 01:25:07,599 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664378917] [2021-12-17 01:25:07,600 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [664378917] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 01:25:07,600 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1006655765] [2021-12-17 01:25:07,600 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-17 01:25:07,600 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 01:25:07,600 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 01:25:07,601 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 01:25:07,602 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 01:25:07,642 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-17 01:25:07,643 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 01:25:07,644 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-17 01:25:07,652 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 01:25:07,735 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-17 01:25:07,735 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 01:25:07,778 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-17 01:25:07,778 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1006655765] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 01:25:07,779 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-17 01:25:07,779 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2021-12-17 01:25:07,779 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834155999] [2021-12-17 01:25:07,779 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-17 01:25:07,779 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-12-17 01:25:07,779 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 01:25:07,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-12-17 01:25:07,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2021-12-17 01:25:07,780 INFO L87 Difference]: Start difference. First operand 42 states and 52 transitions. Second operand has 14 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 14 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 01:25:07,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 01:25:07,991 INFO L93 Difference]: Finished difference Result 93 states and 114 transitions. [2021-12-17 01:25:07,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-17 01:25:07,991 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 14 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2021-12-17 01:25:07,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 01:25:07,992 INFO L225 Difference]: With dead ends: 93 [2021-12-17 01:25:07,992 INFO L226 Difference]: Without dead ends: 55 [2021-12-17 01:25:07,992 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=110, Invalid=396, Unknown=0, NotChecked=0, Total=506 [2021-12-17 01:25:07,993 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 161 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 317 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-17 01:25:07,993 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [161 Valid, 82 Invalid, 317 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-17 01:25:07,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2021-12-17 01:25:07,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 39. [2021-12-17 01:25:07,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 38 states have (on average 1.2105263157894737) internal successors, (46), 38 states have internal predecessors, (46), 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 01:25:07,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 46 transitions. [2021-12-17 01:25:07,996 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 46 transitions. Word has length 23 [2021-12-17 01:25:07,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 01:25:07,996 INFO L470 AbstractCegarLoop]: Abstraction has 39 states and 46 transitions. [2021-12-17 01:25:07,996 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 14 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 01:25:07,997 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 46 transitions. [2021-12-17 01:25:07,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-12-17 01:25:07,997 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 01:25:07,997 INFO L514 BasicCegarLoop]: trace histogram [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 01:25:08,015 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 01:25:08,205 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 01:25:08,206 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 01:25:08,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 01:25:08,206 INFO L85 PathProgramCache]: Analyzing trace with hash 550852762, now seen corresponding path program 1 times [2021-12-17 01:25:08,206 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 01:25:08,206 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860079089] [2021-12-17 01:25:08,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 01:25:08,206 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 01:25:08,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 01:25:08,251 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-12-17 01:25:08,251 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 01:25:08,252 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860079089] [2021-12-17 01:25:08,252 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860079089] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 01:25:08,252 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1162980980] [2021-12-17 01:25:08,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 01:25:08,252 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 01:25:08,252 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 01:25:08,254 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 01:25:08,267 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 01:25:08,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 01:25:08,315 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 18 conjunts are in the unsatisfiable core [2021-12-17 01:25:08,316 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 01:25:08,356 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 01:25:08,399 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:25:08,399 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 0 case distinctions, treesize of input 15 treesize of output 17 [2021-12-17 01:25:08,407 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2021-12-17 01:25:08,415 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-17 01:25:08,415 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 01:25:08,435 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_152 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~mem11#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_152) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) is different from false [2021-12-17 01:25:08,440 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_152 (Array Int Int))) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_152) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) is different from false [2021-12-17 01:25:08,455 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-17 01:25:08,456 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 1 case distinctions, treesize of input 18 treesize of output 19 [2021-12-17 01:25:08,457 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2021-12-17 01:25:08,475 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 5 not checked. [2021-12-17 01:25:08,475 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1162980980] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 01:25:08,475 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-17 01:25:08,476 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 11 [2021-12-17 01:25:08,476 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052628559] [2021-12-17 01:25:08,476 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-17 01:25:08,476 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-17 01:25:08,476 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 01:25:08,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-17 01:25:08,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=52, Unknown=2, NotChecked=30, Total=110 [2021-12-17 01:25:08,477 INFO L87 Difference]: Start difference. First operand 39 states and 46 transitions. Second operand has 11 states, 11 states have (on average 3.909090909090909) internal successors, (43), 11 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 01:25:08,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 01:25:08,595 INFO L93 Difference]: Finished difference Result 76 states and 88 transitions. [2021-12-17 01:25:08,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-17 01:25:08,596 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.909090909090909) internal successors, (43), 11 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2021-12-17 01:25:08,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 01:25:08,597 INFO L225 Difference]: With dead ends: 76 [2021-12-17 01:25:08,597 INFO L226 Difference]: Without dead ends: 66 [2021-12-17 01:25:08,597 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 51 SyntacticMatches, 4 SemanticMatches, 13 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=108, Unknown=2, NotChecked=46, Total=210 [2021-12-17 01:25:08,598 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 41 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 94 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-17 01:25:08,598 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [41 Valid, 83 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 107 Invalid, 0 Unknown, 94 Unchecked, 0.1s Time] [2021-12-17 01:25:08,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2021-12-17 01:25:08,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 44. [2021-12-17 01:25:08,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 43 states have (on average 1.2325581395348837) internal successors, (53), 43 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 01:25:08,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 53 transitions. [2021-12-17 01:25:08,614 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 53 transitions. Word has length 28 [2021-12-17 01:25:08,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 01:25:08,615 INFO L470 AbstractCegarLoop]: Abstraction has 44 states and 53 transitions. [2021-12-17 01:25:08,616 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.909090909090909) internal successors, (43), 11 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 01:25:08,616 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 53 transitions. [2021-12-17 01:25:08,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-12-17 01:25:08,616 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 01:25:08,617 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 01:25:08,634 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2021-12-17 01:25:08,834 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 01:25:08,834 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 01:25:08,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 01:25:08,835 INFO L85 PathProgramCache]: Analyzing trace with hash -1969107172, now seen corresponding path program 3 times [2021-12-17 01:25:08,835 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 01:25:08,835 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105569260] [2021-12-17 01:25:08,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 01:25:08,835 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 01:25:08,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 01:25:09,593 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-17 01:25:09,593 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 01:25:09,594 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105569260] [2021-12-17 01:25:09,594 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2105569260] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 01:25:09,594 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [880601828] [2021-12-17 01:25:09,594 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-17 01:25:09,594 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 01:25:09,594 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 01:25:09,608 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 01:25:09,609 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 01:25:09,660 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-12-17 01:25:09,660 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 01:25:09,661 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 42 conjunts are in the unsatisfiable core [2021-12-17 01:25:09,663 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 01:25:09,679 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 01:25:09,710 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:25:09,711 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 0 case distinctions, treesize of input 23 treesize of output 22 [2021-12-17 01:25:09,779 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:25:09,787 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-12-17 01:25:09,787 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2021-12-17 01:25:09,987 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:25:09,988 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 01:25:09,992 INFO L354 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2021-12-17 01:25:09,992 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 41 [2021-12-17 01:25:10,109 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:25:10,117 INFO L354 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2021-12-17 01:25:10,117 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 47 treesize of output 44 [2021-12-17 01:25:10,407 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:25:10,421 INFO L354 Elim1Store]: treesize reduction 10, result has 69.7 percent of original size [2021-12-17 01:25:10,421 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 37 [2021-12-17 01:25:10,547 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 01:25:10,547 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 01:25:12,300 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_69| Int)) (or (let ((.cse1 (<= |c_ULTIMATE.start_main_~i~0#1| 0)) (.cse0 (let ((.cse7 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) 1))) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse7))) (let ((.cse5 (select .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse3 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse6 (select .cse7 |c_ULTIMATE.start_main_~a~0#1.offset|))) (+ .cse3 (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_69| 4))) .cse6)))))) (.cse2 (<= |v_ULTIMATE.start_main_~i~0#1_69| 0))) (and (or (<= (+ |v_ULTIMATE.start_main_~i~0#1_69| 1) .cse0) .cse1 .cse2) (or .cse1 (<= .cse0 2) .cse2))) (< 1 |v_ULTIMATE.start_main_~i~0#1_69|))) is different from false [2021-12-17 01:25:29,133 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_69| Int) (|v_ULTIMATE.start_main_~i~0#1_72| Int)) (or (let ((.cse1 (let ((.cse7 (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_72| 4)) 1))) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse7))) (let ((.cse5 (select .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse3 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse6 (select .cse7 |c_ULTIMATE.start_main_~a~0#1.offset|))) (+ .cse3 (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_69| 4))) .cse6)))))) (.cse0 (<= |v_ULTIMATE.start_main_~i~0#1_72| 0)) (.cse2 (<= |v_ULTIMATE.start_main_~i~0#1_69| 0))) (and (or .cse0 (<= .cse1 2) .cse2) (or (<= (+ |v_ULTIMATE.start_main_~i~0#1_69| 1) .cse1) .cse0 .cse2))) (< 1 |v_ULTIMATE.start_main_~i~0#1_69|) (< (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_72|))) is different from false [2021-12-17 01:25:29,163 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2021-12-17 01:25:29,163 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [880601828] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 01:25:29,163 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-17 01:25:29,163 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 18, 18] total 48 [2021-12-17 01:25:29,164 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534497654] [2021-12-17 01:25:29,164 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-17 01:25:29,164 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2021-12-17 01:25:29,164 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 01:25:29,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2021-12-17 01:25:29,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=281, Invalid=1786, Unknown=11, NotChecked=178, Total=2256 [2021-12-17 01:25:29,165 INFO L87 Difference]: Start difference. First operand 44 states and 53 transitions. Second operand has 48 states, 48 states have (on average 1.2708333333333333) internal successors, (61), 48 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 01:25:37,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 01:25:37,898 INFO L93 Difference]: Finished difference Result 90 states and 106 transitions. [2021-12-17 01:25:37,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2021-12-17 01:25:37,899 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 48 states have (on average 1.2708333333333333) internal successors, (61), 48 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 28 [2021-12-17 01:25:37,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 01:25:37,901 INFO L225 Difference]: With dead ends: 90 [2021-12-17 01:25:37,902 INFO L226 Difference]: Without dead ends: 76 [2021-12-17 01:25:37,904 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 62 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1059 ImplicationChecksByTransitivity, 27.2s TimeCoverageRelationStatistics Valid=491, Invalid=3279, Unknown=20, NotChecked=242, Total=4032 [2021-12-17 01:25:37,905 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 24 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 551 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 312 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-17 01:25:37,905 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 132 Invalid, 551 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 187 Invalid, 0 Unknown, 312 Unchecked, 0.1s Time] [2021-12-17 01:25:37,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2021-12-17 01:25:37,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 57. [2021-12-17 01:25:37,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 56 states have (on average 1.2321428571428572) internal successors, (69), 56 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 01:25:37,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 69 transitions. [2021-12-17 01:25:37,926 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 69 transitions. Word has length 28 [2021-12-17 01:25:37,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 01:25:37,926 INFO L470 AbstractCegarLoop]: Abstraction has 57 states and 69 transitions. [2021-12-17 01:25:37,927 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 48 states have (on average 1.2708333333333333) internal successors, (61), 48 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 01:25:37,927 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 69 transitions. [2021-12-17 01:25:37,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-12-17 01:25:37,928 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 01:25:37,928 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 01:25:37,947 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-12-17 01:25:38,145 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 01:25:38,145 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 01:25:38,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 01:25:38,146 INFO L85 PathProgramCache]: Analyzing trace with hash -1202810022, now seen corresponding path program 4 times [2021-12-17 01:25:38,146 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 01:25:38,146 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699934749] [2021-12-17 01:25:38,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 01:25:38,146 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 01:25:38,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 01:25:38,209 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-17 01:25:38,210 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 01:25:38,210 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699934749] [2021-12-17 01:25:38,210 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [699934749] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 01:25:38,210 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1108730697] [2021-12-17 01:25:38,210 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-12-17 01:25:38,210 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 01:25:38,211 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 01:25:38,211 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 01:25:38,212 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 01:25:38,275 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-12-17 01:25:38,276 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 01:25:38,276 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-17 01:25:38,277 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 01:25:38,336 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-17 01:25:38,336 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 01:25:38,373 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-17 01:25:38,373 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1108730697] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 01:25:38,373 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-17 01:25:38,374 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2021-12-17 01:25:38,374 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122754565] [2021-12-17 01:25:38,374 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-17 01:25:38,374 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-12-17 01:25:38,374 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 01:25:38,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-12-17 01:25:38,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2021-12-17 01:25:38,375 INFO L87 Difference]: Start difference. First operand 57 states and 69 transitions. Second operand has 14 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 14 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 01:25:38,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 01:25:38,486 INFO L93 Difference]: Finished difference Result 153 states and 182 transitions. [2021-12-17 01:25:38,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-17 01:25:38,487 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 14 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) Word has length 30 [2021-12-17 01:25:38,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 01:25:38,487 INFO L225 Difference]: With dead ends: 153 [2021-12-17 01:25:38,488 INFO L226 Difference]: Without dead ends: 120 [2021-12-17 01:25:38,488 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 55 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 01:25:38,488 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 185 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-17 01:25:38,489 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [185 Valid, 53 Invalid, 224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-17 01:25:38,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2021-12-17 01:25:38,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 88. [2021-12-17 01:25:38,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 87 states have (on average 1.206896551724138) internal successors, (105), 87 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 01:25:38,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 105 transitions. [2021-12-17 01:25:38,494 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 105 transitions. Word has length 30 [2021-12-17 01:25:38,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 01:25:38,494 INFO L470 AbstractCegarLoop]: Abstraction has 88 states and 105 transitions. [2021-12-17 01:25:38,495 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 14 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 01:25:38,495 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 105 transitions. [2021-12-17 01:25:38,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-12-17 01:25:38,495 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 01:25:38,495 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 01:25:38,514 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 01:25:38,711 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 01:25:38,711 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 01:25:38,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 01:25:38,712 INFO L85 PathProgramCache]: Analyzing trace with hash -736332014, now seen corresponding path program 1 times [2021-12-17 01:25:38,712 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 01:25:38,712 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676640733] [2021-12-17 01:25:38,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 01:25:38,712 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 01:25:38,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 01:25:38,904 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-17 01:25:38,904 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 01:25:38,904 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676640733] [2021-12-17 01:25:38,904 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1676640733] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 01:25:38,904 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [94758195] [2021-12-17 01:25:38,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 01:25:38,905 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 01:25:38,905 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 01:25:38,906 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 01:25:38,907 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 01:25:38,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 01:25:38,959 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 49 conjunts are in the unsatisfiable core [2021-12-17 01:25:38,961 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 01:25:38,973 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 01:25:39,000 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:25:39,001 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 0 case distinctions, treesize of input 23 treesize of output 22 [2021-12-17 01:25:39,058 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:25:39,059 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:25:39,059 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2021-12-17 01:25:39,161 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:25:39,162 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:25:39,162 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 01:25:39,164 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 42 [2021-12-17 01:25:39,250 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:25:39,251 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:25:39,251 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 38 [2021-12-17 01:25:39,405 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:25:39,406 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:25:39,406 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 01:25:39,407 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 42 [2021-12-17 01:25:39,507 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:25:39,508 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 30 [2021-12-17 01:25:39,726 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:25:39,727 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 28 [2021-12-17 01:25:39,752 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 01:25:39,752 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 01:25:41,459 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 01:25:41,459 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [94758195] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 01:25:41,459 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-17 01:25:41,459 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 18, 18] total 43 [2021-12-17 01:25:41,459 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955207042] [2021-12-17 01:25:41,459 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-17 01:25:41,460 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2021-12-17 01:25:41,460 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 01:25:41,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2021-12-17 01:25:41,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=1623, Unknown=0, NotChecked=0, Total=1806 [2021-12-17 01:25:41,461 INFO L87 Difference]: Start difference. First operand 88 states and 105 transitions. Second operand has 43 states, 43 states have (on average 1.930232558139535) internal successors, (83), 43 states have internal predecessors, (83), 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 01:25:42,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 01:25:42,691 INFO L93 Difference]: Finished difference Result 128 states and 149 transitions. [2021-12-17 01:25:42,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2021-12-17 01:25:42,691 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 43 states have (on average 1.930232558139535) internal successors, (83), 43 states have internal predecessors, (83), 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 01:25:42,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 01:25:42,692 INFO L225 Difference]: With dead ends: 128 [2021-12-17 01:25:42,692 INFO L226 Difference]: Without dead ends: 109 [2021-12-17 01:25:42,693 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 37 SyntacticMatches, 4 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1018 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=434, Invalid=3226, Unknown=0, NotChecked=0, Total=3660 [2021-12-17 01:25:42,693 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 41 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 457 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 296 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-17 01:25:42,693 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [41 Valid, 221 Invalid, 457 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 145 Invalid, 0 Unknown, 296 Unchecked, 0.1s Time] [2021-12-17 01:25:42,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2021-12-17 01:25:42,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 102. [2021-12-17 01:25:42,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 101 states have (on average 1.2079207920792079) internal successors, (122), 101 states have internal predecessors, (122), 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 01:25:42,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 122 transitions. [2021-12-17 01:25:42,699 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 122 transitions. Word has length 32 [2021-12-17 01:25:42,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 01:25:42,699 INFO L470 AbstractCegarLoop]: Abstraction has 102 states and 122 transitions. [2021-12-17 01:25:42,699 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 1.930232558139535) internal successors, (83), 43 states have internal predecessors, (83), 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 01:25:42,699 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 122 transitions. [2021-12-17 01:25:42,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-12-17 01:25:42,700 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 01:25:42,700 INFO L514 BasicCegarLoop]: trace histogram [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 01:25:42,719 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 01:25:42,913 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 01:25:42,914 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 01:25:42,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 01:25:42,914 INFO L85 PathProgramCache]: Analyzing trace with hash -35267436, now seen corresponding path program 1 times [2021-12-17 01:25:42,914 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 01:25:42,914 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149893555] [2021-12-17 01:25:42,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 01:25:42,915 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 01:25:42,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 01:25:42,982 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-12-17 01:25:42,983 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 01:25:42,983 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149893555] [2021-12-17 01:25:42,983 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [149893555] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 01:25:42,983 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [212916126] [2021-12-17 01:25:42,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 01:25:42,983 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 01:25:42,983 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 01:25:42,984 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 01:25:42,984 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 01:25:43,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 01:25:43,039 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 18 conjunts are in the unsatisfiable core [2021-12-17 01:25:43,040 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 01:25:43,080 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 01:25:43,105 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:25:43,106 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 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-17 01:25:43,113 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-17 01:25:43,130 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-12-17 01:25:43,130 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 01:25:43,164 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_335 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_335) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) |c_ULTIMATE.start_main_#t~mem11#1|)) is different from false [2021-12-17 01:25:43,169 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_335 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_335) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) is different from false [2021-12-17 01:25:43,182 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-17 01:25:43,182 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 1 case distinctions, treesize of input 18 treesize of output 19 [2021-12-17 01:25:43,184 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2021-12-17 01:25:43,204 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 5 not checked. [2021-12-17 01:25:43,204 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [212916126] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 01:25:43,204 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-17 01:25:43,204 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 11 [2021-12-17 01:25:43,205 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229895199] [2021-12-17 01:25:43,205 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-17 01:25:43,205 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-17 01:25:43,205 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 01:25:43,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-17 01:25:43,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=52, Unknown=2, NotChecked=30, Total=110 [2021-12-17 01:25:43,206 INFO L87 Difference]: Start difference. First operand 102 states and 122 transitions. Second operand has 11 states, 11 states have (on average 4.181818181818182) internal successors, (46), 11 states have internal predecessors, (46), 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 01:25:43,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 01:25:43,302 INFO L93 Difference]: Finished difference Result 144 states and 165 transitions. [2021-12-17 01:25:43,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-17 01:25:43,308 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.181818181818182) internal successors, (46), 11 states have internal predecessors, (46), 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 01:25:43,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 01:25:43,308 INFO L225 Difference]: With dead ends: 144 [2021-12-17 01:25:43,309 INFO L226 Difference]: Without dead ends: 111 [2021-12-17 01:25:43,309 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 57 SyntacticMatches, 6 SemanticMatches, 13 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=108, Unknown=2, NotChecked=46, Total=210 [2021-12-17 01:25:43,309 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 53 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 51 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 01:25:43,310 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [53 Valid, 72 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 88 Invalid, 0 Unknown, 51 Unchecked, 0.0s Time] [2021-12-17 01:25:43,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2021-12-17 01:25:43,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 88. [2021-12-17 01:25:43,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 87 states have (on average 1.160919540229885) internal successors, (101), 87 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 01:25:43,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 101 transitions. [2021-12-17 01:25:43,321 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 101 transitions. Word has length 32 [2021-12-17 01:25:43,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 01:25:43,322 INFO L470 AbstractCegarLoop]: Abstraction has 88 states and 101 transitions. [2021-12-17 01:25:43,322 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.181818181818182) internal successors, (46), 11 states have internal predecessors, (46), 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 01:25:43,322 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 101 transitions. [2021-12-17 01:25:43,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-12-17 01:25:43,326 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 01:25:43,326 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 01:25:43,359 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 01:25:43,539 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 01:25:43,540 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 01:25:43,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 01:25:43,540 INFO L85 PathProgramCache]: Analyzing trace with hash -767176616, now seen corresponding path program 5 times [2021-12-17 01:25:43,540 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 01:25:43,540 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105336016] [2021-12-17 01:25:43,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 01:25:43,540 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 01:25:43,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 01:25:43,600 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-12-17 01:25:43,600 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 01:25:43,600 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105336016] [2021-12-17 01:25:43,600 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [105336016] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 01:25:43,600 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1303116036] [2021-12-17 01:25:43,600 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-12-17 01:25:43,600 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 01:25:43,600 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 01:25:43,601 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 01:25:43,603 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 01:25:43,674 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2021-12-17 01:25:43,674 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 01:25:43,675 INFO L263 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-17 01:25:43,676 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 01:25:43,763 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-12-17 01:25:43,763 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 01:25:43,815 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-12-17 01:25:43,816 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1303116036] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 01:25:43,816 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-17 01:25:43,816 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2021-12-17 01:25:43,816 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460170100] [2021-12-17 01:25:43,817 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-17 01:25:43,817 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-12-17 01:25:43,817 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 01:25:43,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-12-17 01:25:43,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2021-12-17 01:25:43,817 INFO L87 Difference]: Start difference. First operand 88 states and 101 transitions. Second operand has 14 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 14 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 01:25:43,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 01:25:43,940 INFO L93 Difference]: Finished difference Result 113 states and 125 transitions. [2021-12-17 01:25:43,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-17 01:25:43,940 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 14 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-12-17 01:25:43,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 01:25:43,941 INFO L225 Difference]: With dead ends: 113 [2021-12-17 01:25:43,941 INFO L226 Difference]: Without dead ends: 85 [2021-12-17 01:25:43,941 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 57 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 01:25:43,942 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 131 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-17 01:25:43,942 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [131 Valid, 65 Invalid, 228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-17 01:25:43,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2021-12-17 01:25:43,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 46. [2021-12-17 01:25:43,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 45 states have (on average 1.1333333333333333) internal successors, (51), 45 states have internal predecessors, (51), 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 01:25:43,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 51 transitions. [2021-12-17 01:25:43,946 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 51 transitions. Word has length 32 [2021-12-17 01:25:43,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 01:25:43,947 INFO L470 AbstractCegarLoop]: Abstraction has 46 states and 51 transitions. [2021-12-17 01:25:43,947 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 14 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 01:25:43,947 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 51 transitions. [2021-12-17 01:25:43,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-12-17 01:25:43,947 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 01:25:43,947 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 01:25:43,972 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 01:25:44,159 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 01:25:44,160 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 01:25:44,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 01:25:44,160 INFO L85 PathProgramCache]: Analyzing trace with hash -143226682, now seen corresponding path program 2 times [2021-12-17 01:25:44,160 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 01:25:44,160 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451888050] [2021-12-17 01:25:44,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 01:25:44,160 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 01:25:44,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 01:25:44,416 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-12-17 01:25:44,417 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 01:25:44,417 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451888050] [2021-12-17 01:25:44,417 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [451888050] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 01:25:44,417 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1997536623] [2021-12-17 01:25:44,417 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-17 01:25:44,417 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 01:25:44,417 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 01:25:44,418 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 01:25:44,419 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 01:25:44,471 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-17 01:25:44,471 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 01:25:44,472 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 44 conjunts are in the unsatisfiable core [2021-12-17 01:25:44,478 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 01:25:44,507 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 01:25:44,516 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 01:25:44,544 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:25:44,545 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 01:25:44,578 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:25:44,579 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 01:25:44,615 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 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-17 01:25:44,628 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 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-17 01:25:44,645 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 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-17 01:25:44,694 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 01:25:44,696 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-17 01:25:44,696 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 33 treesize of output 29 [2021-12-17 01:25:44,737 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:25:44,738 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 0 case distinctions, treesize of input 23 treesize of output 22 [2021-12-17 01:25:44,772 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:25:44,773 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 0 case distinctions, treesize of input 23 treesize of output 22 [2021-12-17 01:25:44,826 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 23 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-17 01:25:44,826 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 01:25:46,891 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_138| Int)) (or (forall ((v_ArrVal_447 Int)) (= 0 (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_138| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_447) |c_ULTIMATE.start_main_~a~0#1.offset|))) (< |v_ULTIMATE.start_main_~i~0#1_138| (+ |c_ULTIMATE.start_main_~i~0#1| 1)))) is different from false [2021-12-17 01:25:47,271 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_138| Int) (v_ArrVal_447 Int) (v_ArrVal_446 Int)) (or (= 0 (select (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_446) (+ (* |v_ULTIMATE.start_main_~i~0#1_138| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_447) |c_ULTIMATE.start_main_~a~0#1.offset|)) (< |v_ULTIMATE.start_main_~i~0#1_138| (+ |c_ULTIMATE.start_main_~i~0#1| 1)))) is different from false [2021-12-17 01:25:49,295 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_139| Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_139| (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (forall ((|v_ULTIMATE.start_main_~i~0#1_138| Int) (v_ArrVal_447 Int) (v_ArrVal_446 Int)) (or (= 0 (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_139| 4)) v_ArrVal_446) (+ (* |v_ULTIMATE.start_main_~i~0#1_138| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_447) |c_ULTIMATE.start_main_~a~0#1.offset|)) (< |v_ULTIMATE.start_main_~i~0#1_138| (+ |v_ULTIMATE.start_main_~i~0#1_139| 1)))))) is different from false [2021-12-17 01:25:51,325 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_138| Int) (|v_ULTIMATE.start_main_~i~0#1_139| Int) (v_ArrVal_447 Int) (v_ArrVal_446 Int)) (or (= 0 (select (store (store (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse1 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|))) (store .cse0 .cse1 (+ (select .cse0 .cse1) (- 1)))) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_139| 4)) v_ArrVal_446) (+ (* |v_ULTIMATE.start_main_~i~0#1_138| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_447) |c_ULTIMATE.start_main_~a~0#1.offset|)) (< |v_ULTIMATE.start_main_~i~0#1_139| (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (< |v_ULTIMATE.start_main_~i~0#1_138| (+ |v_ULTIMATE.start_main_~i~0#1_139| 1)))) is different from false [2021-12-17 01:25:51,788 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_138| Int) (v_ArrVal_442 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_139| Int) (v_ArrVal_447 Int) (v_ArrVal_446 Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_139| 1) (= 0 (select (store (store (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_442) |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse0 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|) (- 1)))) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_139| 4)) v_ArrVal_446) (+ (* |v_ULTIMATE.start_main_~i~0#1_138| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_447) |c_ULTIMATE.start_main_~a~0#1.offset|)) (< |v_ULTIMATE.start_main_~i~0#1_138| (+ |v_ULTIMATE.start_main_~i~0#1_139| 1)))) is different from false [2021-12-17 01:25:51,873 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_138| Int) (|v_ULTIMATE.start_main_~i~0#1_139| Int) (v_ArrVal_442 (Array Int Int)) (v_ArrVal_447 Int) (v_ArrVal_446 Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_139| 1) (= 0 (select (store (store (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_442) |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse0 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|) (- 1)))) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_139| 4)) v_ArrVal_446) (+ (* |v_ULTIMATE.start_main_~i~0#1_138| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_447) |c_ULTIMATE.start_main_~a~0#1.offset|)) (< |v_ULTIMATE.start_main_~i~0#1_138| (+ |v_ULTIMATE.start_main_~i~0#1_139| 1)))) is different from false [2021-12-17 01:25:51,931 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_138| Int) (v_ArrVal_439 Int) (v_ArrVal_442 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_139| Int) (v_ArrVal_447 Int) (v_ArrVal_446 Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_139| 1) (= 0 (select (store (store (let ((.cse0 (select (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| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_439)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_442) |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse0 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|) (- 1)))) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_139| 4)) v_ArrVal_446) (+ (* |v_ULTIMATE.start_main_~i~0#1_138| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_447) |c_ULTIMATE.start_main_~a~0#1.offset|)) (< |v_ULTIMATE.start_main_~i~0#1_138| (+ |v_ULTIMATE.start_main_~i~0#1_139| 1)))) is different from false [2021-12-17 01:25:51,995 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_146| Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_146| (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (forall ((|v_ULTIMATE.start_main_~i~0#1_138| Int) (v_ArrVal_439 Int) (v_ArrVal_442 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_139| Int) (v_ArrVal_447 Int) (v_ArrVal_446 Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_139| 1) (= 0 (select (store (store (let ((.cse0 (select (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|) (+ (* |v_ULTIMATE.start_main_~i~0#1_146| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_439)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_442) |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse0 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|) (- 1)))) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_139| 4)) v_ArrVal_446) (+ (* |v_ULTIMATE.start_main_~i~0#1_138| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_447) |c_ULTIMATE.start_main_~a~0#1.offset|)) (< |v_ULTIMATE.start_main_~i~0#1_138| (+ |v_ULTIMATE.start_main_~i~0#1_139| 1)))))) is different from false [2021-12-17 01:25:52,049 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_146| Int) (|v_ULTIMATE.start_main_~i~0#1_138| Int) (v_ArrVal_439 Int) (v_ArrVal_437 Int) (v_ArrVal_442 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_139| Int) (v_ArrVal_447 Int) (v_ArrVal_446 Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_139| 1) (< |v_ULTIMATE.start_main_~i~0#1_146| (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (= 0 (select (store (store (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_437) (+ (* |v_ULTIMATE.start_main_~i~0#1_146| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_439)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_442) |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse0 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|) (- 1)))) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_139| 4)) v_ArrVal_446) (+ (* |v_ULTIMATE.start_main_~i~0#1_138| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_447) |c_ULTIMATE.start_main_~a~0#1.offset|)) (< |v_ULTIMATE.start_main_~i~0#1_138| (+ |v_ULTIMATE.start_main_~i~0#1_139| 1)))) is different from false [2021-12-17 01:25:52,155 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_147| Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_147| (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (forall ((|v_ULTIMATE.start_main_~i~0#1_146| Int) (|v_ULTIMATE.start_main_~i~0#1_138| Int) (v_ArrVal_439 Int) (v_ArrVal_437 Int) (v_ArrVal_442 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_139| Int) (v_ArrVal_447 Int) (v_ArrVal_446 Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_139| 1) (= 0 (select (store (store (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_147| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_437) (+ (* |v_ULTIMATE.start_main_~i~0#1_146| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_439)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_442) |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse0 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|) (- 1)))) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_139| 4)) v_ArrVal_446) (+ (* |v_ULTIMATE.start_main_~i~0#1_138| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_447) |c_ULTIMATE.start_main_~a~0#1.offset|)) (< |v_ULTIMATE.start_main_~i~0#1_146| (+ |v_ULTIMATE.start_main_~i~0#1_147| 1)) (< |v_ULTIMATE.start_main_~i~0#1_138| (+ |v_ULTIMATE.start_main_~i~0#1_139| 1)))))) is different from false [2021-12-17 01:25:52,186 INFO L354 Elim1Store]: treesize reduction 122, result has 23.3 percent of original size [2021-12-17 01:25:52,187 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 88 treesize of output 73 [2021-12-17 01:25:52,192 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 72 [2021-12-17 01:25:52,194 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 01:25:52,195 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 01:25:52,197 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 11 treesize of output 9 [2021-12-17 01:25:52,203 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-17 01:25:52,203 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 174 treesize of output 176 [2021-12-17 01:25:52,297 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 25 not checked. [2021-12-17 01:25:52,298 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1997536623] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 01:25:52,298 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-17 01:25:52,298 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 18] total 36 [2021-12-17 01:25:52,298 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812314730] [2021-12-17 01:25:52,298 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-17 01:25:52,298 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2021-12-17 01:25:52,298 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 01:25:52,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2021-12-17 01:25:52,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=547, Unknown=11, NotChecked=570, Total=1260 [2021-12-17 01:25:52,299 INFO L87 Difference]: Start difference. First operand 46 states and 51 transitions. Second operand has 36 states, 36 states have (on average 2.111111111111111) internal successors, (76), 36 states have internal predecessors, (76), 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 01:25:54,317 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|)) 1) (forall ((|v_ULTIMATE.start_main_~i~0#1_147| Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_147| (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (forall ((|v_ULTIMATE.start_main_~i~0#1_146| Int) (|v_ULTIMATE.start_main_~i~0#1_138| Int) (v_ArrVal_439 Int) (v_ArrVal_437 Int) (v_ArrVal_442 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_139| Int) (v_ArrVal_447 Int) (v_ArrVal_446 Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_139| 1) (= 0 (select (store (store (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_147| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_437) (+ (* |v_ULTIMATE.start_main_~i~0#1_146| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_439)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_442) |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse0 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|) (- 1)))) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_139| 4)) v_ArrVal_446) (+ (* |v_ULTIMATE.start_main_~i~0#1_138| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_447) |c_ULTIMATE.start_main_~a~0#1.offset|)) (< |v_ULTIMATE.start_main_~i~0#1_146| (+ |v_ULTIMATE.start_main_~i~0#1_147| 1)) (< |v_ULTIMATE.start_main_~i~0#1_138| (+ |v_ULTIMATE.start_main_~i~0#1_139| 1)))))) (= |c_ULTIMATE.start_main_~i~0#1| 0) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|))) is different from false [2021-12-17 01:25:56,329 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (forall ((|v_ULTIMATE.start_main_~i~0#1_146| Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_146| (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (forall ((|v_ULTIMATE.start_main_~i~0#1_138| Int) (v_ArrVal_439 Int) (v_ArrVal_442 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_139| Int) (v_ArrVal_447 Int) (v_ArrVal_446 Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_139| 1) (= 0 (select (store (store (let ((.cse0 (select (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|) (+ (* |v_ULTIMATE.start_main_~i~0#1_146| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_439)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_442) |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse0 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|) (- 1)))) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_139| 4)) v_ArrVal_446) (+ (* |v_ULTIMATE.start_main_~i~0#1_138| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_447) |c_ULTIMATE.start_main_~a~0#1.offset|)) (< |v_ULTIMATE.start_main_~i~0#1_138| (+ |v_ULTIMATE.start_main_~i~0#1_139| 1)))))) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) 0) 1) (= 4 (+ (* 4 |c_ULTIMATE.start_main_~i~0#1|) |c_ULTIMATE.start_main_~a~0#1.offset|)) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|))) is different from false [2021-12-17 01:25:58,433 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|)) 0) (= |c_ULTIMATE.start_main_~i~0#1| 0) (forall ((|v_ULTIMATE.start_main_~i~0#1_139| Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_139| (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (forall ((|v_ULTIMATE.start_main_~i~0#1_138| Int) (v_ArrVal_447 Int) (v_ArrVal_446 Int)) (or (= 0 (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_139| 4)) v_ArrVal_446) (+ (* |v_ULTIMATE.start_main_~i~0#1_138| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_447) |c_ULTIMATE.start_main_~a~0#1.offset|)) (< |v_ULTIMATE.start_main_~i~0#1_138| (+ |v_ULTIMATE.start_main_~i~0#1_139| 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 01:26:00,465 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) 0) 0) (<= (+ (div (* |c_ULTIMATE.start_main_~a~0#1.offset| (- 1)) 4) 1) |c_ULTIMATE.start_main_~i~0#1|) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (forall ((|v_ULTIMATE.start_main_~i~0#1_138| Int)) (or (forall ((v_ArrVal_447 Int)) (= 0 (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_138| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_447) |c_ULTIMATE.start_main_~a~0#1.offset|))) (< |v_ULTIMATE.start_main_~i~0#1_138| (+ |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 01:26:00,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 01:26:00,599 INFO L93 Difference]: Finished difference Result 66 states and 71 transitions. [2021-12-17 01:26:00,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-12-17 01:26:00,600 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 2.111111111111111) internal successors, (76), 36 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2021-12-17 01:26:00,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 01:26:00,600 INFO L225 Difference]: With dead ends: 66 [2021-12-17 01:26:00,600 INFO L226 Difference]: Without dead ends: 64 [2021-12-17 01:26:00,601 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 48 SyntacticMatches, 16 SemanticMatches, 43 ConstructedPredicates, 14 IntricatePredicates, 0 DeprecatedPredicates, 369 ImplicationChecksByTransitivity, 15.1s TimeCoverageRelationStatistics Valid=196, Invalid=775, Unknown=15, NotChecked=994, Total=1980 [2021-12-17 01:26:00,601 INFO L933 BasicCegarLoop]: 19 mSDtfsCounter, 29 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 388 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 890 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 388 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 462 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-17 01:26:00,602 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [29 Valid, 227 Invalid, 890 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 388 Invalid, 0 Unknown, 462 Unchecked, 0.2s Time] [2021-12-17 01:26:00,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2021-12-17 01:26:00,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 49. [2021-12-17 01:26:00,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 48 states have (on average 1.125) internal successors, (54), 48 states have internal predecessors, (54), 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 01:26:00,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 54 transitions. [2021-12-17 01:26:00,605 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 54 transitions. Word has length 35 [2021-12-17 01:26:00,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 01:26:00,605 INFO L470 AbstractCegarLoop]: Abstraction has 49 states and 54 transitions. [2021-12-17 01:26:00,605 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 2.111111111111111) internal successors, (76), 36 states have internal predecessors, (76), 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 01:26:00,605 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 54 transitions. [2021-12-17 01:26:00,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-12-17 01:26:00,605 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 01:26:00,605 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 01:26:00,624 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 01:26:00,819 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 01:26:00,819 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 01:26:00,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 01:26:00,820 INFO L85 PathProgramCache]: Analyzing trace with hash 651947656, now seen corresponding path program 6 times [2021-12-17 01:26:00,820 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 01:26:00,820 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948618146] [2021-12-17 01:26:00,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 01:26:00,820 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 01:26:00,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 01:26:01,745 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 5 proven. 18 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-12-17 01:26:01,746 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 01:26:01,746 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948618146] [2021-12-17 01:26:01,746 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1948618146] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 01:26:01,746 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1501804668] [2021-12-17 01:26:01,746 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2021-12-17 01:26:01,746 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 01:26:01,746 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 01:26:01,764 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 01:26:01,791 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 01:26:01,859 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2021-12-17 01:26:01,859 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 01:26:01,860 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 61 conjunts are in the unsatisfiable core [2021-12-17 01:26:01,863 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 01:26:01,873 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 01:26:01,877 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 01:26:01,905 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 0 case distinctions, treesize of input 23 treesize of output 22 [2021-12-17 01:26:01,942 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:26:01,944 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2021-12-17 01:26:01,998 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:26:01,999 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:26:02,000 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:26:02,001 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 41 treesize of output 46 [2021-12-17 01:26:02,184 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:26:02,185 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:26:02,186 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 47 [2021-12-17 01:26:02,253 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:26:02,254 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:26:02,256 INFO L354 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2021-12-17 01:26:02,257 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 5 new quantified variables, introduced 3 case distinctions, treesize of input 58 treesize of output 58 [2021-12-17 01:26:02,358 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:26:02,359 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:26:02,360 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:26:02,362 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:26:02,366 INFO L354 Elim1Store]: treesize reduction 62, result has 1.6 percent of original size [2021-12-17 01:26:02,366 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 6 new quantified variables, introduced 5 case distinctions, treesize of input 66 treesize of output 69 [2021-12-17 01:26:02,653 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 01:26:02,654 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:26:02,654 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:26:02,655 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:26:02,655 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 01:26:02,656 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 4 disjoint index pairs (out of 15 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 19 [2021-12-17 01:26:02,701 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 5 proven. 18 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-12-17 01:26:02,702 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 01:26:05,419 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_162| Int)) (or (<= c_~N~0 (+ |v_ULTIMATE.start_main_~i~0#1_162| 1)) (= (let ((.cse3 (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse0 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|))) (.cse1 (select .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse4 (* |v_ULTIMATE.start_main_~i~0#1_162| 4))) (let ((.cse2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .cse1))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse4 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (+ .cse0 .cse1 .cse2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .cse1 .cse2))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse4 |c_ULTIMATE.start_main_~a~0#1.offset| 4)))))) c_~N~0) (< (+ |v_ULTIMATE.start_main_~i~0#1_162| 2) c_~N~0))) is different from false [2021-12-17 01:26:51,133 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~i~0#1_162| Int)) (or (<= (let ((.cse6 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset| 4) 1))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse6))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse2 (select .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse3 (select .cse6 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse5 (* |v_ULTIMATE.start_main_~i~0#1_162| 4))) (let ((.cse4 (select (select (store .cse0 |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|) (+ .cse5 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (+ (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse3 .cse4))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse5 |c_ULTIMATE.start_main_~a~0#1.offset| 4)) .cse2 .cse3 .cse4)))))) (+ |c_ULTIMATE.start_main_~i~0#1| 2)) (<= (+ |v_ULTIMATE.start_main_~i~0#1_162| 1) |c_ULTIMATE.start_main_~i~0#1|) (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_162|))) (forall ((|v_ULTIMATE.start_main_~i~0#1_162| Int)) (or (<= (+ |v_ULTIMATE.start_main_~i~0#1_162| 1) |c_ULTIMATE.start_main_~i~0#1|) (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_162|) (<= (+ |c_ULTIMATE.start_main_~i~0#1| 2) (let ((.cse13 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset| 4) 1))) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse13))) (let ((.cse8 (select .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse9 (select .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse10 (select .cse13 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse12 (* |v_ULTIMATE.start_main_~i~0#1_162| 4))) (let ((.cse11 (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|) (+ .cse12 |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 .cse11))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse12 |c_ULTIMATE.start_main_~a~0#1.offset| 4)) .cse9 .cse10 .cse11)))))))))) is different from false [2021-12-17 01:26:52,024 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 5 proven. 13 refuted. 0 times theorem prover too weak. 7 trivial. 5 not checked. [2021-12-17 01:26:52,024 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1501804668] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 01:26:52,024 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-17 01:26:52,024 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19, 18] total 46 [2021-12-17 01:26:52,024 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155289104] [2021-12-17 01:26:52,024 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-17 01:26:52,024 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2021-12-17 01:26:52,025 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 01:26:52,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2021-12-17 01:26:52,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=238, Invalid=1644, Unknown=18, NotChecked=170, Total=2070 [2021-12-17 01:26:52,025 INFO L87 Difference]: Start difference. First operand 49 states and 54 transitions. Second operand has 46 states, 46 states have (on average 1.3695652173913044) internal successors, (63), 46 states have internal predecessors, (63), 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 01:26:52,989 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse7 (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) (forall ((|v_ULTIMATE.start_main_~i~0#1_162| Int)) (or (<= (let ((.cse6 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset| 4) 1))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse6))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse2 (select .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse3 (select .cse6 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse5 (* |v_ULTIMATE.start_main_~i~0#1_162| 4))) (let ((.cse4 (select (select (store .cse0 |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|) (+ .cse5 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (+ (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse3 .cse4))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse5 |c_ULTIMATE.start_main_~a~0#1.offset| 4)) .cse2 .cse3 .cse4)))))) (+ |c_ULTIMATE.start_main_~i~0#1| 2)) (<= (+ |v_ULTIMATE.start_main_~i~0#1_162| 1) |c_ULTIMATE.start_main_~i~0#1|) (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_162|))) (<= |c_ULTIMATE.start_main_~i~0#1| 1) (= (select .cse7 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|)) 1) (= (select .cse7 0) 1) (<= 1 |c_ULTIMATE.start_main_~i~0#1|) (forall ((|v_ULTIMATE.start_main_~i~0#1_162| Int)) (or (<= (+ |v_ULTIMATE.start_main_~i~0#1_162| 1) |c_ULTIMATE.start_main_~i~0#1|) (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_162|) (<= (+ |c_ULTIMATE.start_main_~i~0#1| 2) (let ((.cse14 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset| 4) 1))) (let ((.cse8 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse14))) (let ((.cse9 (select .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse10 (select .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse11 (select .cse14 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse13 (* |v_ULTIMATE.start_main_~i~0#1_162| 4))) (let ((.cse12 (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse10 .cse11))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse13 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (+ (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse10 .cse11 .cse12))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse13 |c_ULTIMATE.start_main_~a~0#1.offset| 4)) .cse10 .cse11 .cse12))))))))) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)))) is different from false [2021-12-17 01:26:56,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 01:26:56,172 INFO L93 Difference]: Finished difference Result 80 states and 89 transitions. [2021-12-17 01:26:56,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-12-17 01:26:56,173 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 46 states have (on average 1.3695652173913044) internal successors, (63), 46 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2021-12-17 01:26:56,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 01:26:56,173 INFO L225 Difference]: With dead ends: 80 [2021-12-17 01:26:56,173 INFO L226 Difference]: Without dead ends: 65 [2021-12-17 01:26:56,174 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 42 SyntacticMatches, 7 SemanticMatches, 55 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 754 ImplicationChecksByTransitivity, 53.7s TimeCoverageRelationStatistics Valid=356, Invalid=2498, Unknown=20, NotChecked=318, Total=3192 [2021-12-17 01:26:56,175 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 5 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 264 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 569 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 264 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 272 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-17 01:26:56,179 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 144 Invalid, 569 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 264 Invalid, 0 Unknown, 272 Unchecked, 0.2s Time] [2021-12-17 01:26:56,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2021-12-17 01:26:56,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 62. [2021-12-17 01:26:56,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 61 states have (on average 1.1311475409836065) internal successors, (69), 61 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 01:26:56,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 69 transitions. [2021-12-17 01:26:56,184 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 69 transitions. Word has length 35 [2021-12-17 01:26:56,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 01:26:56,184 INFO L470 AbstractCegarLoop]: Abstraction has 62 states and 69 transitions. [2021-12-17 01:26:56,184 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 1.3695652173913044) internal successors, (63), 46 states have internal predecessors, (63), 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 01:26:56,184 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 69 transitions. [2021-12-17 01:26:56,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-12-17 01:26:56,184 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 01:26:56,184 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 01:26:56,203 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 01:26:56,394 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 01:26:56,394 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 01:26:56,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 01:26:56,394 INFO L85 PathProgramCache]: Analyzing trace with hash 1989187722, now seen corresponding path program 7 times [2021-12-17 01:26:56,394 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 01:26:56,395 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604695775] [2021-12-17 01:26:56,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 01:26:56,395 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 01:26:56,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 01:26:56,493 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 11 proven. 14 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-12-17 01:26:56,493 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 01:26:56,493 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604695775] [2021-12-17 01:26:56,493 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1604695775] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 01:26:56,493 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1181366061] [2021-12-17 01:26:56,493 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-12-17 01:26:56,493 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 01:26:56,494 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 01:26:56,508 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 01:26:56,566 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 01:26:56,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 01:26:56,616 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 10 conjunts are in the unsatisfiable core [2021-12-17 01:26:56,617 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 01:26:56,721 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 16 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-12-17 01:26:56,721 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 01:26:56,774 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 16 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-12-17 01:26:56,774 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1181366061] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 01:26:56,774 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-17 01:26:56,774 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 17 [2021-12-17 01:26:56,774 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190185655] [2021-12-17 01:26:56,774 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-17 01:26:56,775 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-12-17 01:26:56,775 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 01:26:56,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-12-17 01:26:56,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2021-12-17 01:26:56,775 INFO L87 Difference]: Start difference. First operand 62 states and 69 transitions. Second operand has 17 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 17 states have internal predecessors, (45), 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 01:26:56,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 01:26:56,947 INFO L93 Difference]: Finished difference Result 175 states and 192 transitions. [2021-12-17 01:26:56,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-17 01:26:56,948 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 17 states have internal predecessors, (45), 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 37 [2021-12-17 01:26:56,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 01:26:56,948 INFO L225 Difference]: With dead ends: 175 [2021-12-17 01:26:56,948 INFO L226 Difference]: Without dead ends: 141 [2021-12-17 01:26:56,949 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 68 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 01:26:56,949 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 156 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-17 01:26:56,950 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [156 Valid, 87 Invalid, 275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-17 01:26:56,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2021-12-17 01:26:56,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 103. [2021-12-17 01:26:56,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 102 states have (on average 1.1274509803921569) internal successors, (115), 102 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 01:26:56,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 115 transitions. [2021-12-17 01:26:56,957 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 115 transitions. Word has length 37 [2021-12-17 01:26:56,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 01:26:56,957 INFO L470 AbstractCegarLoop]: Abstraction has 103 states and 115 transitions. [2021-12-17 01:26:56,957 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 17 states have internal predecessors, (45), 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 01:26:56,958 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 115 transitions. [2021-12-17 01:26:56,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-12-17 01:26:56,958 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 01:26:56,958 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 01:26:56,982 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2021-12-17 01:26:57,167 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2021-12-17 01:26:57,168 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 01:26:57,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 01:26:57,168 INFO L85 PathProgramCache]: Analyzing trace with hash -1015472054, now seen corresponding path program 8 times [2021-12-17 01:26:57,168 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 01:26:57,168 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25547856] [2021-12-17 01:26:57,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 01:26:57,168 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 01:26:57,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 01:26:57,240 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 4 proven. 21 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-12-17 01:26:57,240 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 01:26:57,240 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25547856] [2021-12-17 01:26:57,241 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [25547856] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 01:26:57,241 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1447842505] [2021-12-17 01:26:57,241 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-17 01:26:57,241 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 01:26:57,242 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 01:26:57,247 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-17 01:26:57,287 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2021-12-17 01:26:57,331 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-17 01:26:57,331 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 01:26:57,332 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 10 conjunts are in the unsatisfiable core [2021-12-17 01:26:57,333 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 01:26:57,435 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 9 proven. 16 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-12-17 01:26:57,435 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 01:26:57,494 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 9 proven. 16 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-12-17 01:26:57,495 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1447842505] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 01:26:57,495 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-17 01:26:57,495 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 17 [2021-12-17 01:26:57,495 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982720841] [2021-12-17 01:26:57,495 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-17 01:26:57,495 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-12-17 01:26:57,495 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 01:26:57,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-12-17 01:26:57,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2021-12-17 01:26:57,496 INFO L87 Difference]: Start difference. First operand 103 states and 115 transitions. Second operand has 17 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 17 states have internal predecessors, (45), 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 01:26:57,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 01:26:57,730 INFO L93 Difference]: Finished difference Result 157 states and 167 transitions. [2021-12-17 01:26:57,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-17 01:26:57,731 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 17 states have internal predecessors, (45), 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 37 [2021-12-17 01:26:57,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 01:26:57,731 INFO L225 Difference]: With dead ends: 157 [2021-12-17 01:26:57,731 INFO L226 Difference]: Without dead ends: 122 [2021-12-17 01:26:57,732 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 66 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 01:26:57,732 INFO L933 BasicCegarLoop]: 35 mSDtfsCounter, 215 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 340 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 413 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 340 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-17 01:26:57,732 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [215 Valid, 132 Invalid, 413 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 340 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-17 01:26:57,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2021-12-17 01:26:57,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 89. [2021-12-17 01:26:57,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 88 states have (on average 1.0909090909090908) internal successors, (96), 88 states have internal predecessors, (96), 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 01:26:57,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 96 transitions. [2021-12-17 01:26:57,739 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 96 transitions. Word has length 37 [2021-12-17 01:26:57,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 01:26:57,739 INFO L470 AbstractCegarLoop]: Abstraction has 89 states and 96 transitions. [2021-12-17 01:26:57,740 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 17 states have internal predecessors, (45), 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 01:26:57,740 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 96 transitions. [2021-12-17 01:26:57,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-12-17 01:26:57,740 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 01:26:57,740 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 01:26:57,765 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2021-12-17 01:26:57,943 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2021-12-17 01:26:57,943 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 01:26:57,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 01:26:57,944 INFO L85 PathProgramCache]: Analyzing trace with hash -590527364, now seen corresponding path program 2 times [2021-12-17 01:26:57,944 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 01:26:57,944 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366693750] [2021-12-17 01:26:57,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 01:26:57,944 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 01:26:57,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 01:26:58,750 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 1 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 01:26:58,750 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 01:26:58,750 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366693750] [2021-12-17 01:26:58,750 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [366693750] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 01:26:58,750 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1149902426] [2021-12-17 01:26:58,751 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-17 01:26:58,751 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 01:26:58,752 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 01:26:58,753 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-17 01:26:58,754 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2021-12-17 01:26:58,822 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-17 01:26:58,822 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 01:26:58,823 INFO L263 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 71 conjunts are in the unsatisfiable core [2021-12-17 01:26:58,826 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 01:26:58,849 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 01:26:58,877 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:26:58,878 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 0 case distinctions, treesize of input 23 treesize of output 22 [2021-12-17 01:26:58,959 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:26:58,959 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:26:58,960 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2021-12-17 01:26:59,007 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:26:59,008 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:26:59,009 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2021-12-17 01:26:59,184 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:26:59,186 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 01:26:59,186 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:26:59,187 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 39 [2021-12-17 01:26:59,293 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:26:59,294 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:26:59,294 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:26:59,295 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:26:59,296 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 49 treesize of output 46 [2021-12-17 01:26:59,414 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:26:59,424 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:26:59,425 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:26:59,425 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:26:59,426 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 55 treesize of output 46 [2021-12-17 01:26:59,630 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:26:59,631 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:26:59,631 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:26:59,632 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 01:26:59,632 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:26:59,633 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 68 treesize of output 55 [2021-12-17 01:26:59,782 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:26:59,782 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 01:26:59,786 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:26:59,787 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 45 [2021-12-17 01:26:59,945 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:26:59,946 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:26:59,946 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:26:59,963 INFO L354 Elim1Store]: treesize reduction 25, result has 37.5 percent of original size [2021-12-17 01:26:59,963 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 1 case distinctions, treesize of input 60 treesize of output 59 [2021-12-17 01:27:00,221 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:27:00,222 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 30 [2021-12-17 01:27:00,256 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 01:27:00,256 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 01:27:02,426 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_219| Int)) (or (forall ((v_ArrVal_691 Int)) (= 0 (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_219| 4)) v_ArrVal_691) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (< |v_ULTIMATE.start_main_~i~0#1_219| (+ |c_ULTIMATE.start_main_~i~0#1| 1)))) is different from false [2021-12-17 01:27:11,355 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_691 Int) (|v_ULTIMATE.start_main_~i~0#1_219| Int)) (or (= 0 (select (store (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse1 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (store .cse0 .cse1 (+ (select .cse0 .cse1) (- 1)))) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_219| 4)) v_ArrVal_691) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (< |v_ULTIMATE.start_main_~i~0#1_219| (+ |c_ULTIMATE.start_main_~i~0#1| 2)))) is different from false [2021-12-17 01:27:18,485 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2021-12-17 01:27:18,486 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1149902426] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 01:27:18,486 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-17 01:27:18,486 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 25, 26] total 70 [2021-12-17 01:27:18,486 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088958248] [2021-12-17 01:27:18,486 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-17 01:27:18,486 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 70 states [2021-12-17 01:27:18,486 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 01:27:18,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2021-12-17 01:27:18,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=454, Invalid=4097, Unknown=13, NotChecked=266, Total=4830 [2021-12-17 01:27:18,488 INFO L87 Difference]: Start difference. First operand 89 states and 96 transitions. Second operand has 70 states, 70 states have (on average 1.5142857142857142) internal successors, (106), 70 states have internal predecessors, (106), 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 01:27:32,829 WARN L227 SmtUtils]: Spent 14.09s on a formula simplification. DAG size of input: 120 DAG size of output: 23 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-17 01:27:40,518 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse0 (select .cse1 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|)))) (and (<= .cse0 0) (= (select .cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8)) 1) (let ((.cse2 (* 4 |c_ULTIMATE.start_main_~i~0#1|))) (or (and (= .cse0 0) (= 4 (+ .cse2 |c_ULTIMATE.start_main_~a~0#1.offset|))) (<= (+ .cse2 |c_ULTIMATE.start_main_~a~0#1.offset| 9) (* 4 c_~N~0)))) (forall ((|v_ULTIMATE.start_main_~i~0#1_219| Int)) (or (forall ((v_ArrVal_691 Int)) (= 0 (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_219| 4)) v_ArrVal_691) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (< |v_ULTIMATE.start_main_~i~0#1_219| (+ |c_ULTIMATE.start_main_~i~0#1| 1)))) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (< 0 (+ .cse0 1)) (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (and (< (+ |c_ULTIMATE.start_main_~a~0#1.base| 1) |ULTIMATE.start_main_~#sum~0#1.base|) (= (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |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| 4) |c_ULTIMATE.start_main_~a~0#1.offset|)) 3)))) (= |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 01:27:42,649 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (and (forall ((|v_ULTIMATE.start_main_~i~0#1_219| Int)) (or (forall ((v_ArrVal_691 Int)) (= 0 (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_219| 4)) v_ArrVal_691) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (< |v_ULTIMATE.start_main_~i~0#1_219| (+ |c_ULTIMATE.start_main_~i~0#1| 1)))) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (and (= (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) (+ (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 3)) (< (+ |c_ULTIMATE.start_main_~a~0#1.base| 1) |ULTIMATE.start_main_~#sum~0#1.base|))) (<= .cse0 0) (< 0 (+ .cse0 1)) (forall ((v_ArrVal_691 Int) (|v_ULTIMATE.start_main_~i~0#1_219| Int)) (or (= 0 (select (store (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse2 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (store .cse1 .cse2 (+ (select .cse1 .cse2) (- 1)))) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_219| 4)) v_ArrVal_691) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (< |v_ULTIMATE.start_main_~i~0#1_219| (+ |c_ULTIMATE.start_main_~i~0#1| 2)))))) is different from false [2021-12-17 01:27:43,200 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (and (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (and (= (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) (+ (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 3)) (< (+ |c_ULTIMATE.start_main_~a~0#1.base| 1) |ULTIMATE.start_main_~#sum~0#1.base|))) (<= .cse0 0) (forall ((v_ArrVal_691 Int) (|v_ULTIMATE.start_main_~i~0#1_219| Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_219| (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (= 0 (select (store (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse2 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|))) (store .cse1 .cse2 (+ (select .cse1 .cse2) (- 1)))) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_219| 4)) v_ArrVal_691) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))))) (< 0 (+ .cse0 1)) (forall ((v_ArrVal_691 Int)) (= 0 (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_691) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))))) is different from false [2021-12-17 01:27:43,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 01:27:43,232 INFO L93 Difference]: Finished difference Result 104 states and 112 transitions. [2021-12-17 01:27:43,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2021-12-17 01:27:43,233 INFO L78 Accepts]: Start accepts. Automaton has has 70 states, 70 states have (on average 1.5142857142857142) internal successors, (106), 70 states have internal predecessors, (106), 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 39 [2021-12-17 01:27:43,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 01:27:43,233 INFO L225 Difference]: With dead ends: 104 [2021-12-17 01:27:43,234 INFO L226 Difference]: Without dead ends: 102 [2021-12-17 01:27:43,235 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 36 SyntacticMatches, 3 SemanticMatches, 92 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 2628 ImplicationChecksByTransitivity, 43.3s TimeCoverageRelationStatistics Valid=1026, Invalid=6809, Unknown=17, NotChecked=890, Total=8742 [2021-12-17 01:27:43,235 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 69 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 432 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 291 SdHoareTripleChecker+Invalid, 1145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 432 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 643 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-17 01:27:43,236 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [69 Valid, 291 Invalid, 1145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 432 Invalid, 0 Unknown, 643 Unchecked, 0.2s Time] [2021-12-17 01:27:43,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2021-12-17 01:27:43,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 89. [2021-12-17 01:27:43,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 88 states have (on average 1.0795454545454546) internal successors, (95), 88 states have internal predecessors, (95), 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 01:27:43,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 95 transitions. [2021-12-17 01:27:43,241 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 95 transitions. Word has length 39 [2021-12-17 01:27:43,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 01:27:43,242 INFO L470 AbstractCegarLoop]: Abstraction has 89 states and 95 transitions. [2021-12-17 01:27:43,242 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 70 states, 70 states have (on average 1.5142857142857142) internal successors, (106), 70 states have internal predecessors, (106), 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 01:27:43,242 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 95 transitions. [2021-12-17 01:27:43,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-12-17 01:27:43,242 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 01:27:43,242 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 01:27:43,263 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2021-12-17 01:27:43,443 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 01:27:43,443 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 01:27:43,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 01:27:43,444 INFO L85 PathProgramCache]: Analyzing trace with hash -1487374188, now seen corresponding path program 9 times [2021-12-17 01:27:43,444 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 01:27:43,444 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240843092] [2021-12-17 01:27:43,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 01:27:43,444 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 01:27:43,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 01:27:44,705 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 7 proven. 32 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-12-17 01:27:44,706 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 01:27:44,706 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240843092] [2021-12-17 01:27:44,706 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1240843092] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 01:27:44,706 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1183084257] [2021-12-17 01:27:44,706 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-17 01:27:44,706 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 01:27:44,706 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 01:27:44,707 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-17 01:27:44,708 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2021-12-17 01:27:44,804 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2021-12-17 01:27:44,804 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 01:27:44,806 INFO L263 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 66 conjunts are in the unsatisfiable core [2021-12-17 01:27:44,808 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 01:27:44,832 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 01:27:44,868 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:27:44,869 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 0 case distinctions, treesize of input 23 treesize of output 22 [2021-12-17 01:27:44,941 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:27:44,941 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:27:44,942 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2021-12-17 01:27:44,990 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:27:44,991 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:27:45,002 INFO L354 Elim1Store]: treesize reduction 54, result has 23.9 percent of original size [2021-12-17 01:27:45,003 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 44 [2021-12-17 01:27:45,092 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:27:45,093 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:27:45,096 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:27:45,109 INFO L354 Elim1Store]: treesize reduction 82, result has 17.2 percent of original size [2021-12-17 01:27:45,109 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 4 case distinctions, treesize of input 51 treesize of output 59 [2021-12-17 01:27:45,377 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:27:45,378 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:27:45,379 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:27:45,379 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 01:27:45,384 INFO L354 Elim1Store]: treesize reduction 62, result has 1.6 percent of original size [2021-12-17 01:27:45,384 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 72 treesize of output 68 [2021-12-17 01:27:45,522 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:27:45,524 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:27:45,524 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 01:27:45,525 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:27:45,526 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:27:45,529 INFO L354 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2021-12-17 01:27:45,529 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 4 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 86 treesize of output 71 [2021-12-17 01:27:45,726 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:27:45,728 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:27:45,728 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:27:45,729 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:27:45,729 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:27:45,730 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:27:45,734 INFO L354 Elim1Store]: treesize reduction 75, result has 1.3 percent of original size [2021-12-17 01:27:45,734 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 6 new quantified variables, introduced 5 case distinctions, treesize of input 92 treesize of output 79 [2021-12-17 01:27:45,910 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:27:45,911 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:27:45,912 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:27:45,913 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:27:45,914 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:27:45,915 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:27:45,918 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:27:45,918 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:27:45,919 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:27:45,920 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:27:45,925 INFO L354 Elim1Store]: treesize reduction 38, result has 2.6 percent of original size [2021-12-17 01:27:45,925 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 13 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 3 case distinctions, treesize of input 80 treesize of output 78 [2021-12-17 01:27:46,342 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:27:46,343 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:27:46,344 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:27:46,345 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:27:46,345 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 01:27:46,346 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:27:46,346 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:27:46,347 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 01:27:46,347 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 7 disjoint index pairs (out of 21 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 23 [2021-12-17 01:27:46,404 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 12 proven. 27 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-12-17 01:27:46,404 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 01:27:49,855 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|ULTIMATE.start_main_~i~0#1| Int)) (or (<= 3 |ULTIMATE.start_main_~i~0#1|) (<= (let ((.cse6 (let ((.cse7 (* |ULTIMATE.start_main_~i~0#1| 4))) (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse7 |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (+ .cse7 |c_ULTIMATE.start_main_~a~0#1.offset| 4) 1)))) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse6))) (let ((.cse4 (select .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse1 (select .cse4 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse2 (select .cse6 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse0 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse4 |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| 4)))) (let ((.cse5 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .cse1 .cse2))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8)))) (+ .cse0 .cse1 .cse2 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .cse1 .cse2 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 12)) .cse5))))))) (+ |ULTIMATE.start_main_~i~0#1| 2)) (<= |ULTIMATE.start_main_~i~0#1| 1))) (forall ((|ULTIMATE.start_main_~i~0#1| Int)) (or (<= (+ |ULTIMATE.start_main_~i~0#1| 2) (let ((.cse14 (let ((.cse15 (* |ULTIMATE.start_main_~i~0#1| 4))) (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse15 |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (+ .cse15 |c_ULTIMATE.start_main_~a~0#1.offset| 4) 1)))) (let ((.cse11 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse14))) (let ((.cse12 (select .cse11 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse9 (select .cse12 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse10 (select .cse14 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse8 (select (select (store .cse11 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse12 |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| 4)))) (let ((.cse13 (select (select (store .cse11 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse12 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse8 .cse9 .cse10))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8)))) (+ .cse8 .cse9 .cse10 (select (select (store .cse11 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse12 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse8 .cse9 .cse10 .cse13))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 12)) .cse13)))))))) (<= 3 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 1)))) is different from false [2021-12-17 01:27:51,951 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_subst_2 Int)) (or (<= 3 v_subst_2) (<= (let ((.cse6 (let ((.cse7 (* v_subst_2 4))) (store (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (+ .cse7 |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (+ .cse7 |c_ULTIMATE.start_main_~a~0#1.offset| 4) 1)))) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse6))) (let ((.cse3 (select .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse0 (select .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse5 (select .cse6 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse4 (select (select (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (let ((.cse1 (select (select (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .cse4 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8)))) (+ .cse0 .cse1 (select (select (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .cse1 .cse4 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 12)) .cse4 .cse5))))))) (+ v_subst_2 2)) (<= v_subst_2 1))) (forall ((v_subst_1 Int)) (or (<= v_subst_1 1) (<= 3 v_subst_1) (<= (+ v_subst_1 2) (let ((.cse14 (let ((.cse15 (* v_subst_1 4))) (store (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (+ .cse15 |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (+ .cse15 |c_ULTIMATE.start_main_~a~0#1.offset| 4) 1)))) (let ((.cse10 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse14))) (let ((.cse11 (select .cse10 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse8 (select .cse11 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse12 (select .cse14 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse13 (select (select (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse11 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse8 .cse12))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (let ((.cse9 (select (select (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse11 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse8 .cse12 .cse13))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8)))) (+ .cse8 .cse9 (select (select (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse11 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse8 .cse9 .cse12 .cse13))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 12)) .cse12 .cse13))))))))))) is different from false [2021-12-17 01:27:53,935 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_subst_1 Int)) (or (<= v_subst_1 1) (<= 3 v_subst_1) (<= (+ v_subst_1 2) (let ((.cse6 (let ((.cse7 (* v_subst_1 4))) (store (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset| 4) 1) (+ .cse7 |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (+ .cse7 |c_ULTIMATE.start_main_~a~0#1.offset| 4) 1)))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse6))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse2 (select .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse5 (select .cse6 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse4 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (let ((.cse3 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse4 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8)))) (+ (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse3 .cse4 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 12)) .cse2 .cse3 .cse4 .cse5)))))))))) (forall ((v_subst_2 Int)) (or (<= 3 v_subst_2) (<= (let ((.cse14 (let ((.cse15 (* v_subst_2 4))) (store (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset| 4) 1) (+ .cse15 |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (+ .cse15 |c_ULTIMATE.start_main_~a~0#1.offset| 4) 1)))) (let ((.cse10 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse14))) (let ((.cse11 (select .cse10 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse8 (select .cse11 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse9 (select .cse14 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse12 (select (select (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse11 |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| 4)))) (let ((.cse13 (select (select (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse11 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse8 .cse9 .cse12))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8)))) (+ .cse8 .cse9 (select (select (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse11 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse8 .cse9 .cse12 .cse13))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 12)) .cse12 .cse13))))))) (+ v_subst_2 2)) (<= v_subst_2 1)))) is different from false [2021-12-17 01:27:55,960 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_subst_2 Int)) (or (<= 3 v_subst_2) (<= (let ((.cse6 (let ((.cse8 (* v_subst_2 4))) (store (store (let ((.cse7 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse7 |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (+ .cse7 |c_ULTIMATE.start_main_~a~0#1.offset| 4) 1)) (+ .cse8 |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (+ .cse8 |c_ULTIMATE.start_main_~a~0#1.offset| 4) 1)))) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse6))) (let ((.cse2 (select .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse3 (select .cse2 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse4 (select .cse6 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse0 (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| 4)))) (let ((.cse5 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .cse3 .cse4))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8)))) (+ .cse0 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .cse3 .cse4 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 12)) .cse3 .cse4 .cse5))))))) (+ v_subst_2 2)) (<= v_subst_2 1))) (forall ((v_subst_1 Int)) (or (<= v_subst_1 1) (<= 3 v_subst_1) (<= (+ v_subst_1 2) (let ((.cse15 (let ((.cse17 (* v_subst_1 4))) (store (store (let ((.cse16 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse16 |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (+ .cse16 |c_ULTIMATE.start_main_~a~0#1.offset| 4) 1)) (+ .cse17 |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (+ .cse17 |c_ULTIMATE.start_main_~a~0#1.offset| 4) 1)))) (let ((.cse13 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse15))) (let ((.cse14 (select .cse13 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse9 (select .cse14 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse12 (select .cse15 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse11 (select (select (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse14 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse9 .cse12))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (let ((.cse10 (select (select (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse14 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse9 .cse11 .cse12))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8)))) (+ .cse9 .cse10 .cse11 .cse12 (select (select (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse14 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse9 .cse10 .cse11 .cse12))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 12))))))))))))) is different from false [2021-12-17 01:27:55,999 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 7 proven. 18 refuted. 0 times theorem prover too weak. 15 trivial. 14 not checked. [2021-12-17 01:27:56,000 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1183084257] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 01:27:56,000 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-17 01:27:56,000 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 22, 22] total 64 [2021-12-17 01:27:56,000 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573142884] [2021-12-17 01:27:56,000 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-17 01:27:56,000 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 64 states [2021-12-17 01:27:56,000 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 01:27:56,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2021-12-17 01:27:56,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=425, Invalid=3127, Unknown=4, NotChecked=476, Total=4032 [2021-12-17 01:27:56,002 INFO L87 Difference]: Start difference. First operand 89 states and 95 transitions. Second operand has 64 states, 64 states have (on average 1.265625) internal successors, (81), 64 states have internal predecessors, (81), 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 01:27:57,920 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 (or (and (= (select .cse0 4) 1) (= .cse1 c_~N~0) (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) (+ c_~N~0 (div (+ (* |c_ULTIMATE.start_main_~a~0#1.offset| (- 1)) 4) 4))) (<= c_~N~0 4) (= (select .cse0 0) 1) (< 3 c_~N~0)) (<= (+ (* 4 |c_ULTIMATE.start_main_~i~0#1|) |c_ULTIMATE.start_main_~a~0#1.offset| 1) (* 4 c_~N~0))) (< (+ |c_ULTIMATE.start_main_~a~0#1.base| 1) |c_ULTIMATE.start_main_~#sum~0#1.base|) (= .cse1 0) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (forall ((v_subst_1 Int)) (or (<= v_subst_1 1) (<= 3 v_subst_1) (<= (+ v_subst_1 2) (let ((.cse8 (let ((.cse9 (* v_subst_1 4))) (store (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset| 4) 1) (+ .cse9 |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (+ .cse9 |c_ULTIMATE.start_main_~a~0#1.offset| 4) 1)))) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse8))) (let ((.cse3 (select .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse4 (select .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse7 (select .cse8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse6 (select (select (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse4 .cse7))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (let ((.cse5 (select (select (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse3 |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| 8)))) (+ (select (select (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse4 .cse5 .cse6 .cse7))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 12)) .cse4 .cse5 .cse6 .cse7)))))))))) (forall ((v_subst_2 Int)) (or (<= 3 v_subst_2) (<= (let ((.cse16 (let ((.cse17 (* v_subst_2 4))) (store (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset| 4) 1) (+ .cse17 |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (+ .cse17 |c_ULTIMATE.start_main_~a~0#1.offset| 4) 1)))) (let ((.cse12 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse16))) (let ((.cse13 (select .cse12 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse10 (select .cse13 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse11 (select .cse16 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse14 (select (select (store .cse12 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse10 .cse11))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (let ((.cse15 (select (select (store .cse12 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse10 .cse11 .cse14))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8)))) (+ .cse10 .cse11 (select (select (store .cse12 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse10 .cse11 .cse14 .cse15))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 12)) .cse14 .cse15))))))) (+ v_subst_2 2)) (<= v_subst_2 1))) (= (select .cse0 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|)) 1) (= |c_ULTIMATE.start_main_~i~0#1| 0) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)))) is different from false [2021-12-17 01:27:59,672 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_subst_2 Int)) (or (<= 3 v_subst_2) (<= (let ((.cse6 (let ((.cse7 (* v_subst_2 4))) (store (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (+ .cse7 |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (+ .cse7 |c_ULTIMATE.start_main_~a~0#1.offset| 4) 1)))) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse6))) (let ((.cse3 (select .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse0 (select .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse5 (select .cse6 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse4 (select (select (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (let ((.cse1 (select (select (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .cse4 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8)))) (+ .cse0 .cse1 (select (select (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .cse1 .cse4 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 12)) .cse4 .cse5))))))) (+ v_subst_2 2)) (<= v_subst_2 1))) (< (+ |c_ULTIMATE.start_main_~a~0#1.base| 1) |c_ULTIMATE.start_main_~#sum~0#1.base|) (= (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) (forall ((v_subst_1 Int)) (or (<= v_subst_1 1) (<= 3 v_subst_1) (<= (+ v_subst_1 2) (let ((.cse14 (let ((.cse15 (* v_subst_1 4))) (store (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (+ .cse15 |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (+ .cse15 |c_ULTIMATE.start_main_~a~0#1.offset| 4) 1)))) (let ((.cse10 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse14))) (let ((.cse11 (select .cse10 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse8 (select .cse11 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse12 (select .cse14 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse13 (select (select (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse11 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse8 .cse12))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (let ((.cse9 (select (select (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse11 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse8 .cse12 .cse13))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8)))) (+ .cse8 .cse9 (select (select (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse11 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse8 .cse9 .cse12 .cse13))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 12)) .cse12 .cse13)))))))))) (= |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| 4) |c_ULTIMATE.start_main_~a~0#1.offset| (- 4))) 1)) is different from false [2021-12-17 01:28:01,215 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse8 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (and (< (+ |c_ULTIMATE.start_main_~a~0#1.base| 1) |c_ULTIMATE.start_main_~#sum~0#1.base|) (= (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) (forall ((|ULTIMATE.start_main_~i~0#1| Int)) (or (<= 3 |ULTIMATE.start_main_~i~0#1|) (<= (let ((.cse6 (let ((.cse7 (* |ULTIMATE.start_main_~i~0#1| 4))) (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse7 |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (+ .cse7 |c_ULTIMATE.start_main_~a~0#1.offset| 4) 1)))) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse6))) (let ((.cse4 (select .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse1 (select .cse4 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse2 (select .cse6 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse0 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse4 |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| 4)))) (let ((.cse5 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .cse1 .cse2))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8)))) (+ .cse0 .cse1 .cse2 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .cse1 .cse2 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 12)) .cse5))))))) (+ |ULTIMATE.start_main_~i~0#1| 2)) (<= |ULTIMATE.start_main_~i~0#1| 1))) (= (select .cse8 |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (= (select .cse8 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 1) (<= |c_ULTIMATE.start_main_~i~0#1| 1) (= (select .cse8 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|)) 1) (= (select .cse8 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|)) (forall ((|ULTIMATE.start_main_~i~0#1| Int)) (or (<= (+ |ULTIMATE.start_main_~i~0#1| 2) (let ((.cse15 (let ((.cse16 (* |ULTIMATE.start_main_~i~0#1| 4))) (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse16 |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (+ .cse16 |c_ULTIMATE.start_main_~a~0#1.offset| 4) 1)))) (let ((.cse12 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse15))) (let ((.cse13 (select .cse12 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse10 (select .cse13 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse11 (select .cse15 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse9 (select (select (store .cse12 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse10 .cse11))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (let ((.cse14 (select (select (store .cse12 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse9 .cse10 .cse11))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8)))) (+ .cse9 .cse10 .cse11 (select (select (store .cse12 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse9 .cse10 .cse11 .cse14))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 12)) .cse14)))))))) (<= 3 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 1))))) is different from false [2021-12-17 01:28:02,811 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (and (< (+ |c_ULTIMATE.start_main_~a~0#1.base| 1) |c_ULTIMATE.start_main_~#sum~0#1.base|) (= (select .cse0 4) 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) (forall ((|ULTIMATE.start_main_~i~0#1| Int)) (or (<= 3 |ULTIMATE.start_main_~i~0#1|) (<= (let ((.cse7 (let ((.cse8 (* |ULTIMATE.start_main_~i~0#1| 4))) (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| 4) 1)))) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse7))) (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 .cse7 |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| 4)))) (let ((.cse6 (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |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| 8)))) (+ .cse1 .cse2 .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 .cse3 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 12)) .cse6))))))) (+ |ULTIMATE.start_main_~i~0#1| 2)) (<= |ULTIMATE.start_main_~i~0#1| 1))) (= (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (= (select .cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 1) (<= |c_ULTIMATE.start_main_~i~0#1| 2) (= (select .cse0 0) 1) (forall ((|ULTIMATE.start_main_~i~0#1| Int)) (or (<= (+ |ULTIMATE.start_main_~i~0#1| 2) (let ((.cse15 (let ((.cse16 (* |ULTIMATE.start_main_~i~0#1| 4))) (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse16 |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (+ .cse16 |c_ULTIMATE.start_main_~a~0#1.offset| 4) 1)))) (let ((.cse12 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse15))) (let ((.cse13 (select .cse12 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse10 (select .cse13 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse11 (select .cse15 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse9 (select (select (store .cse12 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse10 .cse11))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (let ((.cse14 (select (select (store .cse12 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse9 .cse10 .cse11))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8)))) (+ .cse9 .cse10 .cse11 (select (select (store .cse12 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse9 .cse10 .cse11 .cse14))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 12)) .cse14)))))))) (<= 3 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 1))) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (<= 2 |c_ULTIMATE.start_main_~i~0#1|))) is different from false [2021-12-17 01:28:16,472 WARN L227 SmtUtils]: Spent 11.17s on a formula simplification. DAG size of input: 173 DAG size of output: 173 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-17 01:28:35,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 01:28:35,196 INFO L93 Difference]: Finished difference Result 147 states and 162 transitions. [2021-12-17 01:28:35,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2021-12-17 01:28:35,197 INFO L78 Accepts]: Start accepts. Automaton has has 64 states, 64 states have (on average 1.265625) internal successors, (81), 64 states have internal predecessors, (81), 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 01:28:35,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 01:28:35,197 INFO L225 Difference]: With dead ends: 147 [2021-12-17 01:28:35,197 INFO L226 Difference]: Without dead ends: 129 [2021-12-17 01:28:35,200 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 49 SyntacticMatches, 2 SemanticMatches, 112 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 3062 ImplicationChecksByTransitivity, 45.9s TimeCoverageRelationStatistics Valid=1323, Invalid=9831, Unknown=8, NotChecked=1720, Total=12882 [2021-12-17 01:28:35,200 INFO L933 BasicCegarLoop]: 19 mSDtfsCounter, 78 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 497 mSolverCounterSat, 138 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 292 SdHoareTripleChecker+Invalid, 1251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 138 IncrementalHoareTripleChecker+Valid, 497 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 616 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2021-12-17 01:28:35,200 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [78 Valid, 292 Invalid, 1251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [138 Valid, 497 Invalid, 0 Unknown, 616 Unchecked, 3.8s Time] [2021-12-17 01:28:35,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2021-12-17 01:28:35,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 106. [2021-12-17 01:28:35,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 105 states have (on average 1.0952380952380953) internal successors, (115), 105 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 01:28:35,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 115 transitions. [2021-12-17 01:28:35,208 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 115 transitions. Word has length 42 [2021-12-17 01:28:35,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 01:28:35,208 INFO L470 AbstractCegarLoop]: Abstraction has 106 states and 115 transitions. [2021-12-17 01:28:35,208 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 64 states, 64 states have (on average 1.265625) internal successors, (81), 64 states have internal predecessors, (81), 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 01:28:35,208 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 115 transitions. [2021-12-17 01:28:35,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-12-17 01:28:35,209 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 01:28:35,209 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 01:28:35,226 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2021-12-17 01:28:35,409 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2021-12-17 01:28:35,409 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 01:28:35,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 01:28:35,410 INFO L85 PathProgramCache]: Analyzing trace with hash 2085827890, now seen corresponding path program 3 times [2021-12-17 01:28:35,410 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 01:28:35,410 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079311787] [2021-12-17 01:28:35,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 01:28:35,410 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 01:28:35,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 01:28:35,915 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 01:28:35,915 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 01:28:35,915 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079311787] [2021-12-17 01:28:35,916 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2079311787] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 01:28:35,916 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [636843926] [2021-12-17 01:28:35,916 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-17 01:28:35,916 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 01:28:35,917 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 01:28:35,917 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-17 01:28:35,918 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2021-12-17 01:28:35,994 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2021-12-17 01:28:35,994 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 01:28:35,995 INFO L263 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 39 conjunts are in the unsatisfiable core [2021-12-17 01:28:35,996 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 01:28:36,026 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 15 treesize of output 11 [2021-12-17 01:28:36,140 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:28:36,141 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 0 case distinctions, treesize of input 18 treesize of output 20 [2021-12-17 01:28:36,185 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:28:36,186 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 0 case distinctions, treesize of input 18 treesize of output 20 [2021-12-17 01:28:36,235 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:28:36,236 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 0 case distinctions, treesize of input 18 treesize of output 20 [2021-12-17 01:28:36,396 INFO L354 Elim1Store]: treesize reduction 29, result has 39.6 percent of original size [2021-12-17 01:28:36,396 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 34 [2021-12-17 01:28:36,483 INFO L354 Elim1Store]: treesize reduction 29, result has 39.6 percent of original size [2021-12-17 01:28:36,484 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 38 [2021-12-17 01:28:36,666 INFO L354 Elim1Store]: treesize reduction 34, result has 48.5 percent of original size [2021-12-17 01:28:36,667 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 52 [2021-12-17 01:28:37,244 INFO L354 Elim1Store]: treesize reduction 13, result has 18.8 percent of original size [2021-12-17 01:28:37,244 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 48 treesize of output 27 [2021-12-17 01:28:37,271 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 13 proven. 21 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-17 01:28:37,271 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 01:30:58,446 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-17 01:30:58,446 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 1 case distinctions, treesize of input 86 treesize of output 75 [2021-12-17 01:30:58,451 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 130 treesize of output 124 [2021-12-17 01:30:58,455 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 01:30:58,455 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 01:30:58,456 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:30:58,458 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 15 treesize of output 9 [2021-12-17 01:30:58,477 INFO L354 Elim1Store]: treesize reduction 40, result has 18.4 percent of original size [2021-12-17 01:30:58,477 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 2314 treesize of output 2208 [2021-12-17 01:30:58,551 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: BigInteger out of long range [2021-12-17 01:30:58,552 INFO L186 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2021-12-17 01:30:58,552 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2021-12-17 01:30:58,552 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120501291] [2021-12-17 01:30:58,552 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2021-12-17 01:30:58,552 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2021-12-17 01:30:58,553 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 01:30:58,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-12-17 01:30:58,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=493, Invalid=3462, Unknown=77, NotChecked=0, Total=4032 [2021-12-17 01:30:58,554 INFO L87 Difference]: Start difference. First operand 106 states and 115 transitions. Second operand has 21 states, 21 states have (on average 2.0476190476190474) internal successors, (43), 21 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 01:31:00,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 01:31:00,537 INFO L93 Difference]: Finished difference Result 111 states and 119 transitions. [2021-12-17 01:31:00,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-12-17 01:31:00,538 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.0476190476190474) internal successors, (43), 21 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2021-12-17 01:31:00,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 01:31:00,538 INFO L225 Difference]: With dead ends: 111 [2021-12-17 01:31:00,538 INFO L226 Difference]: Without dead ends: 79 [2021-12-17 01:31:00,539 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 40 SyntacticMatches, 2 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2258 ImplicationChecksByTransitivity, 142.2s TimeCoverageRelationStatistics Valid=677, Invalid=5098, Unknown=77, NotChecked=0, Total=5852 [2021-12-17 01:31:00,539 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 38 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 394 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 479 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 394 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-17 01:31:00,539 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [38 Valid, 107 Invalid, 479 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 394 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-17 01:31:00,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2021-12-17 01:31:00,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 76. [2021-12-17 01:31:00,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 75 states have (on average 1.12) internal successors, (84), 75 states have internal predecessors, (84), 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 01:31:00,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 84 transitions. [2021-12-17 01:31:00,545 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 84 transitions. Word has length 43 [2021-12-17 01:31:00,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 01:31:00,545 INFO L470 AbstractCegarLoop]: Abstraction has 76 states and 84 transitions. [2021-12-17 01:31:00,545 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.0476190476190474) internal successors, (43), 21 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 01:31:00,546 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 84 transitions. [2021-12-17 01:31:00,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-12-17 01:31:00,546 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 01:31:00,546 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 01:31:00,562 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2021-12-17 01:31:00,746 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2021-12-17 01:31:00,747 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 01:31:00,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 01:31:00,747 INFO L85 PathProgramCache]: Analyzing trace with hash -1990575158, now seen corresponding path program 4 times [2021-12-17 01:31:00,747 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 01:31:00,747 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563626567] [2021-12-17 01:31:00,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 01:31:00,747 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 01:31:00,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 01:31:01,227 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-12-17 01:31:01,228 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 01:31:01,228 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563626567] [2021-12-17 01:31:01,228 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [563626567] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 01:31:01,228 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [232459870] [2021-12-17 01:31:01,228 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-12-17 01:31:01,228 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 01:31:01,228 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 01:31:01,229 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-17 01:31:01,229 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2021-12-17 01:31:01,301 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-12-17 01:31:01,301 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 01:31:01,302 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 45 conjunts are in the unsatisfiable core [2021-12-17 01:31:01,305 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 01:31:01,347 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 15 treesize of output 11 [2021-12-17 01:31:01,397 INFO L354 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2021-12-17 01:31:01,397 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2021-12-17 01:31:01,434 INFO L354 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2021-12-17 01:31:01,434 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2021-12-17 01:31:01,464 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:31:01,465 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 0 case distinctions, treesize of input 16 treesize of output 18 [2021-12-17 01:31:01,484 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:31:01,485 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 0 case distinctions, treesize of input 16 treesize of output 18 [2021-12-17 01:31:01,495 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:31:01,496 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 0 case distinctions, treesize of input 16 treesize of output 18 [2021-12-17 01:31:01,505 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:31:01,505 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 0 case distinctions, treesize of input 16 treesize of output 18 [2021-12-17 01:31:01,552 INFO L354 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2021-12-17 01:31:01,552 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2021-12-17 01:31:01,587 INFO L354 Elim1Store]: treesize reduction 53, result has 5.4 percent of original size [2021-12-17 01:31:01,587 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 20 [2021-12-17 01:31:01,644 INFO L354 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2021-12-17 01:31:01,644 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2021-12-17 01:31:01,683 INFO L354 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2021-12-17 01:31:01,683 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2021-12-17 01:31:01,790 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 3 proven. 44 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-12-17 01:31:01,790 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 01:31:03,947 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_284| Int)) (or (forall ((v_ArrVal_912 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_284| 4)) v_ArrVal_912) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 0)) (< |v_ULTIMATE.start_main_~i~0#1_284| (+ |c_ULTIMATE.start_main_~i~0#1| 1)))) is different from false [2021-12-17 01:31:04,489 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_284| Int) (v_ArrVal_912 Int) (v_ArrVal_910 Int)) (or (= (select (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_910) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_284| 4)) v_ArrVal_912) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 0) (< |v_ULTIMATE.start_main_~i~0#1_284| (+ |c_ULTIMATE.start_main_~i~0#1| 1)))) is different from false [2021-12-17 01:31:06,519 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_285| Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_285| (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (forall ((|v_ULTIMATE.start_main_~i~0#1_284| Int) (v_ArrVal_912 Int) (v_ArrVal_910 Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_284| (+ |v_ULTIMATE.start_main_~i~0#1_285| 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_285| 4)) v_ArrVal_910) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_284| 4)) v_ArrVal_912) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 0))))) is different from false [2021-12-17 01:31:08,544 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_285| Int) (|v_ULTIMATE.start_main_~i~0#1_284| Int) (v_ArrVal_912 Int) (v_ArrVal_910 Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_284| (+ |v_ULTIMATE.start_main_~i~0#1_285| 1)) (< |v_ULTIMATE.start_main_~i~0#1_285| (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (= (select (store (store (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse1 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|))) (store .cse0 .cse1 (+ (select .cse0 .cse1) (- 1)))) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_285| 4)) v_ArrVal_910) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_284| 4)) v_ArrVal_912) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 0))) is different from false [2021-12-17 01:31:10,586 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_285| Int) (|v_ULTIMATE.start_main_~i~0#1_284| Int) (v_ArrVal_912 Int) (v_ArrVal_910 Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_284| (+ |v_ULTIMATE.start_main_~i~0#1_285| 1)) (= (select (store (store (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse1 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (store .cse0 .cse1 (+ (select .cse0 .cse1) (- 1)))) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_285| 4)) v_ArrVal_910) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_284| 4)) v_ArrVal_912) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 0) (< |v_ULTIMATE.start_main_~i~0#1_285| (+ |c_ULTIMATE.start_main_~i~0#1| 2)))) is different from false [2021-12-17 01:31:12,616 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_907 Int) (|v_ULTIMATE.start_main_~i~0#1_285| Int) (|v_ULTIMATE.start_main_~i~0#1_284| Int) (v_ArrVal_912 Int) (v_ArrVal_910 Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_284| (+ |v_ULTIMATE.start_main_~i~0#1_285| 1)) (< |v_ULTIMATE.start_main_~i~0#1_285| (+ |c_ULTIMATE.start_main_~i~0#1| 2)) (= (select (store (store (let ((.cse2 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse0 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse2 |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_907)) (.cse1 (+ .cse2 |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (store .cse0 .cse1 (+ (select .cse0 .cse1) (- 1))))) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_285| 4)) v_ArrVal_910) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_284| 4)) v_ArrVal_912) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 0))) is different from false [2021-12-17 01:31:16,335 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_907 Int) (|v_ULTIMATE.start_main_~i~0#1_285| Int) (v_ArrVal_905 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_284| Int) (v_ArrVal_912 Int) (v_ArrVal_910 Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_284| (+ |v_ULTIMATE.start_main_~i~0#1_285| 1)) (= (let ((.cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (select (store (store (let ((.cse0 (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_905) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset| v_ArrVal_907))) (store .cse0 .cse1 (+ (select .cse0 .cse1) (- 1)))) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_285| 4)) v_ArrVal_910) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_284| 4)) v_ArrVal_912) .cse1)) 0) (< |v_ULTIMATE.start_main_~i~0#1_285| 2))) is different from false [2021-12-17 01:31:16,409 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_907 Int) (|v_ULTIMATE.start_main_~i~0#1_285| Int) (v_ArrVal_905 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_284| Int) (v_ArrVal_912 Int) (v_ArrVal_910 Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_284| (+ |v_ULTIMATE.start_main_~i~0#1_285| 1)) (< |v_ULTIMATE.start_main_~i~0#1_285| 2) (= (let ((.cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (select (store (store (let ((.cse0 (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_905) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset| v_ArrVal_907))) (store .cse0 .cse1 (+ (select .cse0 .cse1) (- 1)))) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_285| 4)) v_ArrVal_910) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_284| 4)) v_ArrVal_912) .cse1)) 0))) is different from false [2021-12-17 01:31:16,547 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_907 Int) (|v_ULTIMATE.start_main_~i~0#1_285| Int) (v_ArrVal_905 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_284| Int) (v_ArrVal_901 Int) (v_ArrVal_912 Int) (v_ArrVal_910 Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_284| (+ |v_ULTIMATE.start_main_~i~0#1_285| 1)) (< |v_ULTIMATE.start_main_~i~0#1_285| 2) (= (let ((.cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (select (store (store (let ((.cse0 (store (select (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| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_901)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_905) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset| v_ArrVal_907))) (store .cse0 .cse1 (+ (select .cse0 .cse1) (- 1)))) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_285| 4)) v_ArrVal_910) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_284| 4)) v_ArrVal_912) .cse1)) 0))) is different from false [2021-12-17 01:31:16,619 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_294| Int)) (or (forall ((v_ArrVal_907 Int) (|v_ULTIMATE.start_main_~i~0#1_285| Int) (v_ArrVal_905 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_284| Int) (v_ArrVal_901 Int) (v_ArrVal_912 Int) (v_ArrVal_910 Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_284| (+ |v_ULTIMATE.start_main_~i~0#1_285| 1)) (= (let ((.cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (select (store (store (let ((.cse0 (store (select (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_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_294| 4)) v_ArrVal_901)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_905) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset| v_ArrVal_907))) (store .cse0 .cse1 (+ (select .cse0 .cse1) (- 1)))) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_285| 4)) v_ArrVal_910) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_284| 4)) v_ArrVal_912) .cse1)) 0) (< |v_ULTIMATE.start_main_~i~0#1_285| 2))) (< |v_ULTIMATE.start_main_~i~0#1_294| (+ |c_ULTIMATE.start_main_~i~0#1| 1)))) is different from false [2021-12-17 01:31:16,680 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_907 Int) (|v_ULTIMATE.start_main_~i~0#1_285| Int) (v_ArrVal_905 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_284| Int) (|v_ULTIMATE.start_main_~i~0#1_294| Int) (v_ArrVal_901 Int) (v_ArrVal_912 Int) (v_ArrVal_899 Int) (v_ArrVal_910 Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_284| (+ |v_ULTIMATE.start_main_~i~0#1_285| 1)) (< |v_ULTIMATE.start_main_~i~0#1_285| 2) (< |v_ULTIMATE.start_main_~i~0#1_294| (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (= (let ((.cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (select (store (store (let ((.cse0 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_899) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_294| 4)) v_ArrVal_901)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_905) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset| v_ArrVal_907))) (store .cse0 .cse1 (+ (select .cse0 .cse1) (- 1)))) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_285| 4)) v_ArrVal_910) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_284| 4)) v_ArrVal_912) .cse1)) 0))) is different from false [2021-12-17 01:31:16,845 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_295| Int)) (or (forall ((v_ArrVal_907 Int) (|v_ULTIMATE.start_main_~i~0#1_285| Int) (v_ArrVal_905 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_284| Int) (|v_ULTIMATE.start_main_~i~0#1_294| Int) (v_ArrVal_901 Int) (v_ArrVal_912 Int) (v_ArrVal_899 Int) (v_ArrVal_910 Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_284| (+ |v_ULTIMATE.start_main_~i~0#1_285| 1)) (= (let ((.cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (select (store (store (let ((.cse0 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (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_295| 4)) v_ArrVal_899) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_294| 4)) v_ArrVal_901)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_905) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset| v_ArrVal_907))) (store .cse0 .cse1 (+ (select .cse0 .cse1) (- 1)))) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_285| 4)) v_ArrVal_910) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_284| 4)) v_ArrVal_912) .cse1)) 0) (< |v_ULTIMATE.start_main_~i~0#1_285| 2) (< |v_ULTIMATE.start_main_~i~0#1_294| (+ |v_ULTIMATE.start_main_~i~0#1_295| 1)))) (< |v_ULTIMATE.start_main_~i~0#1_295| (+ |c_ULTIMATE.start_main_~i~0#1| 1)))) is different from false [2021-12-17 01:31:16,890 INFO L354 Elim1Store]: treesize reduction 122, result has 23.3 percent of original size [2021-12-17 01:31:16,890 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 100 treesize of output 85 [2021-12-17 01:31:16,895 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 96 [2021-12-17 01:31:16,898 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 01:31:16,898 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 01:31:16,898 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 01:31:16,906 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-17 01:31:16,906 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 25 treesize of output 29 [2021-12-17 01:31:16,909 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 01:31:16,910 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 01:31:16,910 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 01:31:16,912 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 13 treesize of output 9 [2021-12-17 01:31:16,978 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 48 not checked. [2021-12-17 01:31:16,978 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [232459870] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 01:31:16,978 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-17 01:31:16,978 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 22] total 50 [2021-12-17 01:31:16,978 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91388229] [2021-12-17 01:31:16,978 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-17 01:31:16,979 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2021-12-17 01:31:16,979 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 01:31:16,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2021-12-17 01:31:16,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=1251, Unknown=17, NotChecked=996, Total=2450 [2021-12-17 01:31:16,979 INFO L87 Difference]: Start difference. First operand 76 states and 84 transitions. Second operand has 50 states, 50 states have (on average 2.28) internal successors, (114), 50 states have internal predecessors, (114), 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 01:31:19,058 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~i~0#1_295| Int)) (or (forall ((v_ArrVal_907 Int) (|v_ULTIMATE.start_main_~i~0#1_285| Int) (v_ArrVal_905 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_284| Int) (|v_ULTIMATE.start_main_~i~0#1_294| Int) (v_ArrVal_901 Int) (v_ArrVal_912 Int) (v_ArrVal_899 Int) (v_ArrVal_910 Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_284| (+ |v_ULTIMATE.start_main_~i~0#1_285| 1)) (= (let ((.cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (select (store (store (let ((.cse0 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (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_295| 4)) v_ArrVal_899) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_294| 4)) v_ArrVal_901)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_905) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset| v_ArrVal_907))) (store .cse0 .cse1 (+ (select .cse0 .cse1) (- 1)))) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_285| 4)) v_ArrVal_910) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_284| 4)) v_ArrVal_912) .cse1)) 0) (< |v_ULTIMATE.start_main_~i~0#1_285| 2) (< |v_ULTIMATE.start_main_~i~0#1_294| (+ |v_ULTIMATE.start_main_~i~0#1_295| 1)))) (< |v_ULTIMATE.start_main_~i~0#1_295| (+ |c_ULTIMATE.start_main_~i~0#1| 1)))) (< (+ |c_ULTIMATE.start_main_~a~0#1.base| 1) |c_ULTIMATE.start_main_~#sum~0#1.base|) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|)) 1) (<= |c_ULTIMATE.start_main_~i~0#1| 1) (<= 1 |c_ULTIMATE.start_main_~i~0#1|) (= |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 01:31:26,164 WARN L227 SmtUtils]: Spent 7.07s on a formula simplification. DAG size of input: 64 DAG size of output: 57 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-17 01:31:28,166 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (and (< (+ |c_ULTIMATE.start_main_~a~0#1.base| 1) |c_ULTIMATE.start_main_~#sum~0#1.base|) (= (select .cse0 4) 1) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= (select .cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 1) (= (+ (* 4 |c_ULTIMATE.start_main_~i~0#1|) |c_ULTIMATE.start_main_~a~0#1.offset|) 8) (forall ((|v_ULTIMATE.start_main_~i~0#1_294| Int)) (or (forall ((v_ArrVal_907 Int) (|v_ULTIMATE.start_main_~i~0#1_285| Int) (v_ArrVal_905 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_284| Int) (v_ArrVal_901 Int) (v_ArrVal_912 Int) (v_ArrVal_910 Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_284| (+ |v_ULTIMATE.start_main_~i~0#1_285| 1)) (= (let ((.cse2 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (select (store (store (let ((.cse1 (store (select (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_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_294| 4)) v_ArrVal_901)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_905) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset| v_ArrVal_907))) (store .cse1 .cse2 (+ (select .cse1 .cse2) (- 1)))) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_285| 4)) v_ArrVal_910) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_284| 4)) v_ArrVal_912) .cse2)) 0) (< |v_ULTIMATE.start_main_~i~0#1_285| 2))) (< |v_ULTIMATE.start_main_~i~0#1_294| (+ |c_ULTIMATE.start_main_~i~0#1| 1)))) (<= 2 |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 01:31:37,381 WARN L838 $PredicateComparison]: unable to prove that (and (< (+ |c_ULTIMATE.start_main_~a~0#1.base| 1) |c_ULTIMATE.start_main_~#sum~0#1.base|) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (<= |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| 4) |c_ULTIMATE.start_main_~a~0#1.offset|)) 0) (<= 1 |c_ULTIMATE.start_main_~i~0#1|) (= |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|)) (forall ((|v_ULTIMATE.start_main_~i~0#1_285| Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_285| (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (forall ((|v_ULTIMATE.start_main_~i~0#1_284| Int) (v_ArrVal_912 Int) (v_ArrVal_910 Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_284| (+ |v_ULTIMATE.start_main_~i~0#1_285| 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_285| 4)) v_ArrVal_910) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_284| 4)) v_ArrVal_912) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 0)))))) is different from false [2021-12-17 01:31:39,425 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) 4) 0) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (forall ((|v_ULTIMATE.start_main_~i~0#1_284| Int)) (or (forall ((v_ArrVal_912 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_284| 4)) v_ArrVal_912) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 0)) (< |v_ULTIMATE.start_main_~i~0#1_284| (+ |c_ULTIMATE.start_main_~i~0#1| 1)))) (<= 2 |c_ULTIMATE.start_main_~i~0#1|) (<= (+ (* 4 |c_ULTIMATE.start_main_~i~0#1|) |c_ULTIMATE.start_main_~a~0#1.offset|) 8) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|))) is different from false [2021-12-17 01:31:39,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 01:31:39,691 INFO L93 Difference]: Finished difference Result 97 states and 105 transitions. [2021-12-17 01:31:39,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-12-17 01:31:39,692 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 2.28) internal successors, (114), 50 states have internal predecessors, (114), 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 46 [2021-12-17 01:31:39,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 01:31:39,692 INFO L225 Difference]: With dead ends: 97 [2021-12-17 01:31:39,692 INFO L226 Difference]: Without dead ends: 95 [2021-12-17 01:31:39,693 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 64 SyntacticMatches, 13 SemanticMatches, 68 ConstructedPredicates, 16 IntricatePredicates, 0 DeprecatedPredicates, 922 ImplicationChecksByTransitivity, 37.2s TimeCoverageRelationStatistics Valid=361, Invalid=2543, Unknown=22, NotChecked=1904, Total=4830 [2021-12-17 01:31:39,693 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 64 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 529 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 1234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 529 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 625 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-17 01:31:39,694 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [64 Valid, 266 Invalid, 1234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 529 Invalid, 0 Unknown, 625 Unchecked, 0.3s Time] [2021-12-17 01:31:39,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2021-12-17 01:31:39,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 80. [2021-12-17 01:31:39,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 79 states have (on average 1.1139240506329113) internal successors, (88), 79 states have internal predecessors, (88), 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 01:31:39,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 88 transitions. [2021-12-17 01:31:39,703 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 88 transitions. Word has length 46 [2021-12-17 01:31:39,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 01:31:39,704 INFO L470 AbstractCegarLoop]: Abstraction has 80 states and 88 transitions. [2021-12-17 01:31:39,704 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 2.28) internal successors, (114), 50 states have internal predecessors, (114), 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 01:31:39,704 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 88 transitions. [2021-12-17 01:31:39,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-12-17 01:31:39,704 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 01:31:39,704 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 01:31:39,723 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2021-12-17 01:31:39,912 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 01:31:39,913 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 01:31:39,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 01:31:39,913 INFO L85 PathProgramCache]: Analyzing trace with hash -1525792624, now seen corresponding path program 10 times [2021-12-17 01:31:39,913 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 01:31:39,913 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145629056] [2021-12-17 01:31:39,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 01:31:39,913 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 01:31:39,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 01:31:40,000 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 27 proven. 25 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2021-12-17 01:31:40,000 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 01:31:40,000 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145629056] [2021-12-17 01:31:40,000 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2145629056] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 01:31:40,000 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [643921476] [2021-12-17 01:31:40,000 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-12-17 01:31:40,000 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 01:31:40,000 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 01:31:40,001 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-17 01:31:40,002 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2021-12-17 01:31:40,076 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-12-17 01:31:40,076 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 01:31:40,077 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 12 conjunts are in the unsatisfiable core [2021-12-17 01:31:40,078 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 01:31:40,210 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 34 proven. 16 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2021-12-17 01:31:40,210 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 01:31:40,273 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 34 proven. 16 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2021-12-17 01:31:40,273 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [643921476] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 01:31:40,273 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-17 01:31:40,273 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 21 [2021-12-17 01:31:40,273 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720194447] [2021-12-17 01:31:40,274 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-17 01:31:40,274 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2021-12-17 01:31:40,274 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 01:31:40,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-12-17 01:31:40,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=312, Unknown=0, NotChecked=0, Total=420 [2021-12-17 01:31:40,275 INFO L87 Difference]: Start difference. First operand 80 states and 88 transitions. Second operand has 21 states, 21 states have (on average 2.619047619047619) internal successors, (55), 21 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 01:31:40,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 01:31:40,470 INFO L93 Difference]: Finished difference Result 214 states and 230 transitions. [2021-12-17 01:31:40,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-17 01:31:40,471 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.619047619047619) internal successors, (55), 21 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2021-12-17 01:31:40,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 01:31:40,471 INFO L225 Difference]: With dead ends: 214 [2021-12-17 01:31:40,471 INFO L226 Difference]: Without dead ends: 165 [2021-12-17 01:31:40,472 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=168, Invalid=482, Unknown=0, NotChecked=0, Total=650 [2021-12-17 01:31:40,472 INFO L933 BasicCegarLoop]: 24 mSDtfsCounter, 207 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 251 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 356 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-17 01:31:40,472 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [207 Valid, 113 Invalid, 356 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 251 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-17 01:31:40,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2021-12-17 01:31:40,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 119. [2021-12-17 01:31:40,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 118 states have (on average 1.1101694915254237) internal successors, (131), 118 states have internal predecessors, (131), 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 01:31:40,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 131 transitions. [2021-12-17 01:31:40,482 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 131 transitions. Word has length 46 [2021-12-17 01:31:40,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 01:31:40,482 INFO L470 AbstractCegarLoop]: Abstraction has 119 states and 131 transitions. [2021-12-17 01:31:40,482 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.619047619047619) internal successors, (55), 21 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 01:31:40,482 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 131 transitions. [2021-12-17 01:31:40,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-12-17 01:31:40,482 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 01:31:40,482 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 01:31:40,500 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2021-12-17 01:31:40,686 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 01:31:40,688 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 01:31:40,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 01:31:40,688 INFO L85 PathProgramCache]: Analyzing trace with hash 716275920, now seen corresponding path program 11 times [2021-12-17 01:31:40,689 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 01:31:40,689 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218585563] [2021-12-17 01:31:40,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 01:31:40,689 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 01:31:40,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 01:31:40,780 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 9 proven. 38 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2021-12-17 01:31:40,781 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 01:31:40,781 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218585563] [2021-12-17 01:31:40,781 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1218585563] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 01:31:40,781 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1371061834] [2021-12-17 01:31:40,781 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-12-17 01:31:40,781 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 01:31:40,781 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 01:31:40,782 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-17 01:31:40,785 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2021-12-17 01:31:41,012 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2021-12-17 01:31:41,012 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 01:31:41,014 INFO L263 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 12 conjunts are in the unsatisfiable core [2021-12-17 01:31:41,015 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 01:31:41,148 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 16 proven. 31 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2021-12-17 01:31:41,148 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 01:31:41,223 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 16 proven. 31 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2021-12-17 01:31:41,223 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1371061834] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 01:31:41,223 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-17 01:31:41,223 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 20 [2021-12-17 01:31:41,224 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745417139] [2021-12-17 01:31:41,224 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-17 01:31:41,224 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-12-17 01:31:41,224 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 01:31:41,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-12-17 01:31:41,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=279, Unknown=0, NotChecked=0, Total=380 [2021-12-17 01:31:41,225 INFO L87 Difference]: Start difference. First operand 119 states and 131 transitions. Second operand has 20 states, 20 states have (on average 2.95) internal successors, (59), 20 states have internal predecessors, (59), 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 01:31:41,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 01:31:41,558 INFO L93 Difference]: Finished difference Result 189 states and 199 transitions. [2021-12-17 01:31:41,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-12-17 01:31:41,558 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.95) internal successors, (59), 20 states have internal predecessors, (59), 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 46 [2021-12-17 01:31:41,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 01:31:41,559 INFO L225 Difference]: With dead ends: 189 [2021-12-17 01:31:41,559 INFO L226 Difference]: Without dead ends: 151 [2021-12-17 01:31:41,559 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 83 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=206, Invalid=664, Unknown=0, NotChecked=0, Total=870 [2021-12-17 01:31:41,559 INFO L933 BasicCegarLoop]: 41 mSDtfsCounter, 182 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 629 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 705 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 629 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-17 01:31:41,560 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [182 Valid, 268 Invalid, 705 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 629 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-17 01:31:41,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2021-12-17 01:31:41,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 112. [2021-12-17 01:31:41,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 111 states have (on average 1.072072072072072) internal successors, (119), 111 states have internal predecessors, (119), 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 01:31:41,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 119 transitions. [2021-12-17 01:31:41,568 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 119 transitions. Word has length 46 [2021-12-17 01:31:41,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 01:31:41,568 INFO L470 AbstractCegarLoop]: Abstraction has 112 states and 119 transitions. [2021-12-17 01:31:41,568 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.95) internal successors, (59), 20 states have internal predecessors, (59), 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 01:31:41,568 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 119 transitions. [2021-12-17 01:31:41,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2021-12-17 01:31:41,569 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 01:31:41,569 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 01:31:41,586 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2021-12-17 01:31:41,769 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 01:31:41,769 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 01:31:41,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 01:31:41,770 INFO L85 PathProgramCache]: Analyzing trace with hash -1027028208, now seen corresponding path program 12 times [2021-12-17 01:31:41,770 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 01:31:41,770 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099682627] [2021-12-17 01:31:41,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 01:31:41,770 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 01:31:41,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 01:31:42,868 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 9 proven. 50 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2021-12-17 01:31:42,868 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 01:31:42,869 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099682627] [2021-12-17 01:31:42,875 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1099682627] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 01:31:42,875 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1868149709] [2021-12-17 01:31:42,875 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2021-12-17 01:31:42,876 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 01:31:42,876 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 01:31:42,876 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-17 01:31:42,877 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2021-12-17 01:31:43,038 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2021-12-17 01:31:43,038 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 01:31:43,040 INFO L263 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 88 conjunts are in the unsatisfiable core [2021-12-17 01:31:43,042 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 01:31:43,051 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 01:31:43,090 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:31:43,090 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 0 case distinctions, treesize of input 23 treesize of output 22 [2021-12-17 01:31:43,166 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:31:43,166 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:31:43,167 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2021-12-17 01:31:43,267 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:31:43,267 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:31:43,268 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:31:43,269 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:31:43,269 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 01:31:43,388 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:31:43,389 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:31:43,389 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:31:43,390 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:31:43,390 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:31:43,391 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:31:43,391 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:31:43,392 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 54 [2021-12-17 01:31:43,474 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:31:43,474 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:31:43,475 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:31:43,476 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:31:43,477 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:31:43,477 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:31:43,478 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:31:43,505 INFO L354 Elim1Store]: treesize reduction 114, result has 23.5 percent of original size [2021-12-17 01:31:43,506 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 4 case distinctions, treesize of input 57 treesize of output 68 [2021-12-17 01:31:43,798 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:31:43,799 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:31:43,799 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 01:31:43,800 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:31:43,800 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:31:43,803 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:31:43,803 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:31:43,804 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:31:43,807 INFO L354 Elim1Store]: treesize reduction 74, result has 1.3 percent of original size [2021-12-17 01:31:43,807 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 5 case distinctions, treesize of input 78 treesize of output 77 [2021-12-17 01:31:43,971 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:31:43,972 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:31:43,973 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:31:43,973 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:31:43,974 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:31:43,975 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 01:31:43,975 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:31:43,976 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:31:43,977 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:31:43,980 INFO L354 Elim1Store]: treesize reduction 72, result has 1.4 percent of original size [2021-12-17 01:31:43,981 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 5 case distinctions, treesize of input 78 treesize of output 75 [2021-12-17 01:31:44,148 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:31:44,148 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:31:44,149 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:31:44,149 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:31:44,150 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:31:44,150 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:31:44,152 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:31:44,154 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:31:44,154 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:31:44,154 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 01:31:44,155 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:31:44,163 INFO L354 Elim1Store]: treesize reduction 30, result has 3.2 percent of original size [2021-12-17 01:31:44,164 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 9 disjoint index pairs (out of 21 index pairs), introduced 6 new quantified variables, introduced 3 case distinctions, treesize of input 87 treesize of output 80 [2021-12-17 01:31:44,330 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:31:44,331 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:31:44,332 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:31:44,332 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:31:44,333 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:31:44,333 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:31:44,334 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:31:44,335 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:31:44,335 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:31:44,336 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:31:44,338 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 01:31:44,338 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:31:44,341 INFO L354 Elim1Store]: treesize reduction 30, result has 3.2 percent of original size [2021-12-17 01:31:44,341 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 9 disjoint index pairs (out of 21 index pairs), introduced 6 new quantified variables, introduced 3 case distinctions, treesize of input 78 treesize of output 75 [2021-12-17 01:31:44,536 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:31:44,536 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:31:44,537 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:31:44,538 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:31:44,539 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:31:44,539 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:31:44,540 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:31:44,540 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:31:44,543 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:31:44,543 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:31:44,544 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:31:44,544 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:31:44,547 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-12-17 01:31:44,547 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 15 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 1 case distinctions, treesize of input 82 treesize of output 80 [2021-12-17 01:31:44,976 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:31:44,976 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 54 [2021-12-17 01:31:44,979 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:31:44,980 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:31:44,980 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 01:31:44,981 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:31:44,981 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 32 [2021-12-17 01:31:45,131 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:31:45,131 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 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-17 01:31:45,257 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-17 01:31:45,323 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 23 proven. 55 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-12-17 01:31:45,324 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 01:31:47,761 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|ULTIMATE.start_main_~i~0#1| Int) (v_ArrVal_1151 (Array Int Int))) (or (<= |ULTIMATE.start_main_~i~0#1| 3) (<= (select (select (store (let ((.cse7 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) 1))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse7))) (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse1 (select .cse0 |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|)) (.cse6 (select .cse7 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse3 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (let ((.cse4 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse3 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8)))) (let ((.cse5 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse3 .cse4 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 12)))) (+ .cse2 .cse3 .cse4 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse3 .cse4 .cse5 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 16)) .cse5 .cse6)))))))))) |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_1151) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 5) (<= 5 |ULTIMATE.start_main_~i~0#1|))) (forall ((|ULTIMATE.start_main_~i~0#1| Int) (v_ArrVal_1151 (Array Int Int))) (or (<= |ULTIMATE.start_main_~i~0#1| 3) (<= 5 (select (select (store (let ((.cse15 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) 1))) (let ((.cse8 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse15))) (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse9 (select .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse10 (select .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse14 (select .cse15 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse11 (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse10 .cse14))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (let ((.cse12 (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse10 .cse11 .cse14))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8)))) (let ((.cse13 (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse10 .cse11 .cse12 .cse14))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 12)))) (+ .cse10 .cse11 .cse12 (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse10 .cse11 .cse12 .cse13 .cse14))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 16)) .cse13 .cse14)))))))))) |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_1151) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (<= 5 |ULTIMATE.start_main_~i~0#1|)))) is different from false [2021-12-17 01:31:49,917 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_subst_3 Int) (v_ArrVal_1151 (Array Int Int))) (or (<= 5 (select (select (store (let ((.cse7 (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (+ (* v_subst_3 4) |c_ULTIMATE.start_main_~a~0#1.offset|) 1))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse7))) (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse3 (select .cse7 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse4 (select .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse2 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |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| 4)))) (let ((.cse5 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse3 .cse4))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8)))) (let ((.cse6 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse3 .cse4 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 12)))) (+ .cse2 .cse3 .cse4 .cse5 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse3 .cse4 .cse5 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 16)) .cse6)))))))))) |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_1151) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (<= 5 v_subst_3) (<= v_subst_3 3))) (forall ((v_subst_4 Int) (v_ArrVal_1151 (Array Int Int))) (or (<= v_subst_4 3) (<= (select (select (store (let ((.cse15 (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (+ (* v_subst_4 4) |c_ULTIMATE.start_main_~a~0#1.offset|) 1))) (let ((.cse8 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse15))) (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse9 (select .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse11 (select .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse14 (select .cse15 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse10 (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse11 .cse14))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (let ((.cse13 (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse10 .cse11 .cse14))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8)))) (let ((.cse12 (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse10 .cse11 .cse13 .cse14))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 12)))) (+ .cse10 .cse11 .cse12 (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse10 .cse11 .cse12 .cse13 .cse14))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 16)) .cse13 .cse14)))))))))) |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_1151) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 5) (<= 5 v_subst_4)))) is different from false [2021-12-17 01:31:51,978 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_subst_3 Int) (v_ArrVal_1151 (Array Int Int))) (or (<= 5 (select (select (store (let ((.cse7 (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset| 4) 1) (+ (* v_subst_3 4) |c_ULTIMATE.start_main_~a~0#1.offset|) 1))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse7))) (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse2 (select .cse7 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse5 (select .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse4 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (let ((.cse3 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse4 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8)))) (let ((.cse6 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse3 .cse4 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 12)))) (+ .cse2 .cse3 .cse4 .cse5 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse3 .cse4 .cse5 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 16)) .cse6)))))))))) |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_1151) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (<= 5 v_subst_3) (<= v_subst_3 3))) (forall ((v_subst_4 Int) (v_ArrVal_1151 (Array Int Int))) (or (<= v_subst_4 3) (<= (select (select (store (let ((.cse15 (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset| 4) 1) (+ (* v_subst_4 4) |c_ULTIMATE.start_main_~a~0#1.offset|) 1))) (let ((.cse8 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse15))) (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse9 (select .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse11 (select .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse13 (select .cse15 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse10 (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse11 .cse13))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (let ((.cse14 (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |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| 8)))) (let ((.cse12 (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse10 .cse11 .cse13 .cse14))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 12)))) (+ .cse10 (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse10 .cse11 .cse12 .cse13 .cse14))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 16)) .cse11 .cse12 .cse13 .cse14)))))))))) |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_1151) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 5) (<= 5 v_subst_4)))) is different from false [2021-12-17 01:31:54,070 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_subst_3 Int) (v_ArrVal_1151 (Array Int Int))) (or (<= 5 v_subst_3) (<= 5 (select (select (store (let ((.cse7 (store (let ((.cse8 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (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| 4) 1)) (+ (* v_subst_3 4) |c_ULTIMATE.start_main_~a~0#1.offset|) 1))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse7))) (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse3 (select .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse4 (select .cse7 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse6 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |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| 4)))) (let ((.cse2 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse4 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8)))) (let ((.cse5 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse3 .cse4 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 12)))) (+ .cse2 .cse3 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse3 .cse4 .cse5 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 16)) .cse4 .cse5 .cse6)))))))))) |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_1151) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (<= v_subst_3 3))) (forall ((v_subst_4 Int) (v_ArrVal_1151 (Array Int Int))) (or (<= (select (select (store (let ((.cse16 (store (let ((.cse17 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (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| 4) 1)) (+ (* v_subst_4 4) |c_ULTIMATE.start_main_~a~0#1.offset|) 1))) (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse16))) (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse10 (select .cse9 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse13 (select .cse16 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse14 (select .cse10 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse11 (select (select (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse13 .cse14))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (let ((.cse15 (select (select (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse11 .cse13 .cse14))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8)))) (let ((.cse12 (select (select (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse11 .cse13 .cse14 .cse15))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 12)))) (+ .cse11 .cse12 .cse13 (select (select (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse11 .cse12 .cse13 .cse14 .cse15))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 16)) .cse14 .cse15)))))))))) |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_1151) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 5) (<= v_subst_4 3) (<= 5 v_subst_4)))) is different from false [2021-12-17 01:31:56,177 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_subst_3 Int) (v_ArrVal_1151 (Array Int Int))) (or (<= 5 (select (select (store (let ((.cse7 (store (let ((.cse8 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse8 |c_ULTIMATE.start_main_~a~0#1.offset| 4) 1) (+ .cse8 |c_ULTIMATE.start_main_~a~0#1.offset| 8) 1)) (+ (* v_subst_3 4) |c_ULTIMATE.start_main_~a~0#1.offset|) 1))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse7))) (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse1 (select .cse0 |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|)) (.cse4 (select .cse7 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse5 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse4))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (let ((.cse3 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse4 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8)))) (let ((.cse6 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse3 .cse4 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 12)))) (+ .cse2 .cse3 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse3 .cse4 .cse5 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 16)) .cse4 .cse5 .cse6)))))))))) |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_1151) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (<= 5 v_subst_3) (<= v_subst_3 3))) (forall ((v_subst_4 Int) (v_ArrVal_1151 (Array Int Int))) (or (<= v_subst_4 3) (<= (select (select (store (let ((.cse16 (store (let ((.cse17 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse17 |c_ULTIMATE.start_main_~a~0#1.offset| 4) 1) (+ .cse17 |c_ULTIMATE.start_main_~a~0#1.offset| 8) 1)) (+ (* v_subst_4 4) |c_ULTIMATE.start_main_~a~0#1.offset|) 1))) (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse16))) (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse10 (select .cse9 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse11 (select .cse16 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse15 (select .cse10 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse13 (select (select (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse11 .cse15))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (let ((.cse14 (select (select (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse11 .cse13 .cse15))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8)))) (let ((.cse12 (select (select (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse11 .cse13 .cse14 .cse15))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 12)))) (+ .cse11 .cse12 .cse13 .cse14 .cse15 (select (select (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse11 .cse12 .cse13 .cse14 .cse15))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 16)))))))))))) |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_1151) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 5) (<= 5 v_subst_4)))) is different from false [2021-12-17 01:31:58,305 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_subst_4 Int) (v_ArrVal_1151 (Array Int Int))) (or (<= v_subst_4 3) (<= (select (select (store (let ((.cse7 (store (let ((.cse8 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (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| 4) 1) (+ .cse8 |c_ULTIMATE.start_main_~a~0#1.offset| 8) 1)) (+ (* v_subst_4 4) |c_ULTIMATE.start_main_~a~0#1.offset|) 1))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse7))) (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse3 (select .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse5 (select .cse7 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse6 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |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| 4)))) (let ((.cse4 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |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| 8)))) (let ((.cse2 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse4 .cse5 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 12)))) (+ .cse2 .cse3 .cse4 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse3 .cse4 .cse5 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 16)) .cse5 .cse6)))))))))) |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_1151) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 5) (<= 5 v_subst_4))) (forall ((v_subst_3 Int) (v_ArrVal_1151 (Array Int Int))) (or (<= 5 v_subst_3) (<= v_subst_3 3) (<= 5 (select (select (store (let ((.cse16 (store (let ((.cse17 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (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| 4) 1) (+ .cse17 |c_ULTIMATE.start_main_~a~0#1.offset| 8) 1)) (+ (* v_subst_3 4) |c_ULTIMATE.start_main_~a~0#1.offset|) 1))) (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse16))) (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse10 (select .cse9 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse13 (select .cse16 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse15 (select .cse10 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse11 (select (select (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse13 .cse15))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (let ((.cse14 (select (select (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse11 .cse13 .cse15))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8)))) (let ((.cse12 (select (select (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse11 .cse13 .cse14 .cse15))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 12)))) (+ .cse11 .cse12 (select (select (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse11 .cse12 .cse13 .cse14 .cse15))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 16)) .cse13 .cse14 .cse15)))))))))) |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_1151) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))))) is different from false [2021-12-17 01:31:58,466 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_subst_3 Int) (v_ArrVal_1151 (Array Int Int))) (or (<= 5 (select (select (store (let ((.cse7 (store (let ((.cse8 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (store (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse8 |c_ULTIMATE.start_main_~a~0#1.offset| 4) 1) (+ .cse8 |c_ULTIMATE.start_main_~a~0#1.offset| 8) 1) (+ .cse8 |c_ULTIMATE.start_main_~a~0#1.offset| 12) 1)) (+ (* v_subst_3 4) |c_ULTIMATE.start_main_~a~0#1.offset|) 1))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse7))) (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse3 (select .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse5 (select .cse7 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse4 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |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| 4)))) (let ((.cse2 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse4 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8)))) (let ((.cse6 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse3 .cse4 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 12)))) (+ .cse2 .cse3 .cse4 .cse5 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse3 .cse4 .cse5 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 16)) .cse6)))))))))) |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_1151) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (<= 5 v_subst_3) (<= v_subst_3 3))) (forall ((v_subst_4 Int) (v_ArrVal_1151 (Array Int Int))) (or (<= v_subst_4 3) (<= (select (select (store (let ((.cse16 (store (let ((.cse17 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (store (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse17 |c_ULTIMATE.start_main_~a~0#1.offset| 4) 1) (+ .cse17 |c_ULTIMATE.start_main_~a~0#1.offset| 8) 1) (+ .cse17 |c_ULTIMATE.start_main_~a~0#1.offset| 12) 1)) (+ (* v_subst_4 4) |c_ULTIMATE.start_main_~a~0#1.offset|) 1))) (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse16))) (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse10 (select .cse9 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse11 (select .cse16 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse12 (select .cse10 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse15 (select (select (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse11 .cse12))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (let ((.cse14 (select (select (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse11 .cse12 .cse15))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8)))) (let ((.cse13 (select (select (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse11 .cse12 .cse14 .cse15))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 12)))) (+ .cse11 .cse12 .cse13 (select (select (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse11 .cse12 .cse13 .cse14 .cse15))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 16)) .cse14 .cse15)))))))))) |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_1151) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 5) (<= 5 v_subst_4)))) is different from false [2021-12-17 01:31:58,701 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_subst_3 Int) (v_ArrVal_1151 (Array Int Int))) (or (<= 5 v_subst_3) (<= 5 (select (select (store (let ((.cse7 (store (let ((.cse8 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (store (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| 4) 1) (+ .cse8 |c_ULTIMATE.start_main_~a~0#1.offset| 8) 1) (+ .cse8 |c_ULTIMATE.start_main_~a~0#1.offset| 12) 1)) (+ (* v_subst_3 4) |c_ULTIMATE.start_main_~a~0#1.offset|) 1))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse7))) (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse2 (select .cse7 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse3 (select .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse5 (select (select (store .cse0 |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| 4)))) (let ((.cse4 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse3 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8)))) (let ((.cse6 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse3 .cse4 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 12)))) (+ .cse2 .cse3 .cse4 .cse5 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse3 .cse4 .cse5 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 16)) .cse6)))))))))) |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_1151) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (<= v_subst_3 3))) (forall ((v_subst_4 Int) (v_ArrVal_1151 (Array Int Int))) (or (<= v_subst_4 3) (<= (select (select (store (let ((.cse16 (store (let ((.cse17 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (store (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| 4) 1) (+ .cse17 |c_ULTIMATE.start_main_~a~0#1.offset| 8) 1) (+ .cse17 |c_ULTIMATE.start_main_~a~0#1.offset| 12) 1)) (+ (* v_subst_4 4) |c_ULTIMATE.start_main_~a~0#1.offset|) 1))) (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse16))) (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse10 (select .cse9 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse13 (select .cse16 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse15 (select .cse10 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse14 (select (select (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse13 .cse15))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (let ((.cse11 (select (select (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse13 .cse14 .cse15))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8)))) (let ((.cse12 (select (select (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse11 .cse13 .cse14 .cse15))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 12)))) (+ .cse11 .cse12 .cse13 (select (select (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse11 .cse12 .cse13 .cse14 .cse15))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 16)) .cse14 .cse15)))))))))) |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_1151) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 5) (<= 5 v_subst_4)))) is different from false [2021-12-17 01:31:58,749 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 25 not checked. [2021-12-17 01:31:58,749 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1868149709] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 01:31:58,749 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-17 01:31:58,749 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 31, 35] total 89 [2021-12-17 01:31:58,749 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635719072] [2021-12-17 01:31:58,749 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-17 01:31:58,749 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 89 states [2021-12-17 01:31:58,750 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 01:31:58,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2021-12-17 01:31:58,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=756, Invalid=5731, Unknown=25, NotChecked=1320, Total=7832 [2021-12-17 01:31:58,751 INFO L87 Difference]: Start difference. First operand 112 states and 119 transitions. Second operand has 89 states, 89 states have (on average 1.2696629213483146) internal successors, (113), 89 states have internal predecessors, (113), 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 01:32:43,725 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_subst_4 Int) (v_ArrVal_1151 (Array Int Int))) (or (<= v_subst_4 3) (<= (select (select (store (let ((.cse7 (store (let ((.cse8 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (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| 4) 1) (+ .cse8 |c_ULTIMATE.start_main_~a~0#1.offset| 8) 1)) (+ (* v_subst_4 4) |c_ULTIMATE.start_main_~a~0#1.offset|) 1))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse7))) (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse3 (select .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse5 (select .cse7 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse6 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |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| 4)))) (let ((.cse4 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |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| 8)))) (let ((.cse2 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse4 .cse5 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 12)))) (+ .cse2 .cse3 .cse4 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse3 .cse4 .cse5 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 16)) .cse5 .cse6)))))))))) |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_1151) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 5) (<= 5 v_subst_4))) (< (+ |c_ULTIMATE.start_main_~a~0#1.base| 1) |c_ULTIMATE.start_main_~#sum~0#1.base|) (= (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 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (forall ((v_subst_3 Int) (v_ArrVal_1151 (Array Int Int))) (or (<= 5 v_subst_3) (<= v_subst_3 3) (<= 5 (select (select (store (let ((.cse16 (store (let ((.cse17 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (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| 4) 1) (+ .cse17 |c_ULTIMATE.start_main_~a~0#1.offset| 8) 1)) (+ (* v_subst_3 4) |c_ULTIMATE.start_main_~a~0#1.offset|) 1))) (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse16))) (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse10 (select .cse9 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse13 (select .cse16 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse15 (select .cse10 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse11 (select (select (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse13 .cse15))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (let ((.cse14 (select (select (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse11 .cse13 .cse15))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8)))) (let ((.cse12 (select (select (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse11 .cse13 .cse14 .cse15))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 12)))) (+ .cse11 .cse12 (select (select (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse11 .cse12 .cse13 .cse14 .cse15))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 16)) .cse13 .cse14 .cse15)))))))))) |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_1151) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)))) (= |c_ULTIMATE.start_main_~i~0#1| 1)) is different from false [2021-12-17 01:32:45,623 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse18 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (and (forall ((v_subst_3 Int) (v_ArrVal_1151 (Array Int Int))) (or (<= 5 (select (select (store (let ((.cse7 (store (let ((.cse8 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse8 |c_ULTIMATE.start_main_~a~0#1.offset| 4) 1) (+ .cse8 |c_ULTIMATE.start_main_~a~0#1.offset| 8) 1)) (+ (* v_subst_3 4) |c_ULTIMATE.start_main_~a~0#1.offset|) 1))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse7))) (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse1 (select .cse0 |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|)) (.cse4 (select .cse7 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse5 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse4))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (let ((.cse3 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse4 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8)))) (let ((.cse6 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse3 .cse4 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 12)))) (+ .cse2 .cse3 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse3 .cse4 .cse5 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 16)) .cse4 .cse5 .cse6)))))))))) |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_1151) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (<= 5 v_subst_3) (<= v_subst_3 3))) (< (+ |c_ULTIMATE.start_main_~a~0#1.base| 1) |c_ULTIMATE.start_main_~#sum~0#1.base|) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 0) (forall ((v_subst_4 Int) (v_ArrVal_1151 (Array Int Int))) (or (<= v_subst_4 3) (<= (select (select (store (let ((.cse16 (store (let ((.cse17 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse17 |c_ULTIMATE.start_main_~a~0#1.offset| 4) 1) (+ .cse17 |c_ULTIMATE.start_main_~a~0#1.offset| 8) 1)) (+ (* v_subst_4 4) |c_ULTIMATE.start_main_~a~0#1.offset|) 1))) (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse16))) (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse10 (select .cse9 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse11 (select .cse16 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse15 (select .cse10 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse13 (select (select (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse11 .cse15))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (let ((.cse14 (select (select (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse11 .cse13 .cse15))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8)))) (let ((.cse12 (select (select (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse11 .cse13 .cse14 .cse15))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 12)))) (+ .cse11 .cse12 .cse13 .cse14 .cse15 (select (select (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse11 .cse12 .cse13 .cse14 .cse15))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 16)))))))))))) |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_1151) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 5) (<= 5 v_subst_4))) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= (select .cse18 |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (= (select .cse18 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|)) 1) (= |c_ULTIMATE.start_main_~i~0#1| 1))) is different from false [2021-12-17 01:32:47,568 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse9 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (and (< (+ |c_ULTIMATE.start_main_~a~0#1.base| 1) |c_ULTIMATE.start_main_~#sum~0#1.base|) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 0) (forall ((v_subst_3 Int) (v_ArrVal_1151 (Array Int Int))) (or (<= 5 v_subst_3) (<= 5 (select (select (store (let ((.cse7 (store (let ((.cse8 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (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| 4) 1)) (+ (* v_subst_3 4) |c_ULTIMATE.start_main_~a~0#1.offset|) 1))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse7))) (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse3 (select .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse4 (select .cse7 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse6 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |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| 4)))) (let ((.cse2 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse4 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8)))) (let ((.cse5 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse3 .cse4 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 12)))) (+ .cse2 .cse3 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse3 .cse4 .cse5 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 16)) .cse4 .cse5 .cse6)))))))))) |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_1151) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (<= v_subst_3 3))) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= (select .cse9 |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (= (select .cse9 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 1) (= |c_ULTIMATE.start_main_~i~0#1| 2) (forall ((v_subst_4 Int) (v_ArrVal_1151 (Array Int Int))) (or (<= (select (select (store (let ((.cse17 (store (let ((.cse18 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse18 |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (+ .cse18 |c_ULTIMATE.start_main_~a~0#1.offset| 4) 1)) (+ (* v_subst_4 4) |c_ULTIMATE.start_main_~a~0#1.offset|) 1))) (let ((.cse10 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse17))) (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse11 (select .cse10 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse11 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse14 (select .cse17 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse15 (select .cse11 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse12 (select (select (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse11 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse14 .cse15))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (let ((.cse16 (select (select (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse11 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse12 .cse14 .cse15))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8)))) (let ((.cse13 (select (select (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse11 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse12 .cse14 .cse15 .cse16))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 12)))) (+ .cse12 .cse13 .cse14 (select (select (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse11 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse12 .cse13 .cse14 .cse15 .cse16))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 16)) .cse15 .cse16)))))))))) |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_1151) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 5) (<= v_subst_4 3) (<= 5 v_subst_4))))) is different from false [2021-12-17 01:32:49,361 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse8 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (and (< (+ |c_ULTIMATE.start_main_~a~0#1.base| 1) |c_ULTIMATE.start_main_~#sum~0#1.base|) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 0) (forall ((v_subst_3 Int) (v_ArrVal_1151 (Array Int Int))) (or (<= 5 (select (select (store (let ((.cse7 (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset| 4) 1) (+ (* v_subst_3 4) |c_ULTIMATE.start_main_~a~0#1.offset|) 1))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse7))) (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse2 (select .cse7 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse5 (select .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse4 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (let ((.cse3 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse4 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8)))) (let ((.cse6 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse3 .cse4 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 12)))) (+ .cse2 .cse3 .cse4 .cse5 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse3 .cse4 .cse5 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 16)) .cse6)))))))))) |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_1151) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (<= 5 v_subst_3) (<= v_subst_3 3))) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= (select .cse8 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 1) (= (select .cse8 |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (= (select .cse8 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|)) 1) (= |c_ULTIMATE.start_main_~i~0#1| 2) (forall ((v_subst_4 Int) (v_ArrVal_1151 (Array Int Int))) (or (<= v_subst_4 3) (<= (select (select (store (let ((.cse16 (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset| 4) 1) (+ (* v_subst_4 4) |c_ULTIMATE.start_main_~a~0#1.offset|) 1))) (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse16))) (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse10 (select .cse9 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse12 (select .cse10 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse14 (select .cse16 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse11 (select (select (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse12 .cse14))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (let ((.cse15 (select (select (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse11 .cse12 .cse14))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8)))) (let ((.cse13 (select (select (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse11 .cse12 .cse14 .cse15))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 12)))) (+ .cse11 (select (select (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse11 .cse12 .cse13 .cse14 .cse15))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 16)) .cse12 .cse13 .cse14 .cse15)))))))))) |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_1151) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 5) (<= 5 v_subst_4))))) is different from false [2021-12-17 01:32:51,099 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse8 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (and (forall ((v_subst_3 Int) (v_ArrVal_1151 (Array Int Int))) (or (<= 5 (select (select (store (let ((.cse7 (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (+ (* v_subst_3 4) |c_ULTIMATE.start_main_~a~0#1.offset|) 1))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse7))) (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse3 (select .cse7 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse4 (select .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse2 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |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| 4)))) (let ((.cse5 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse3 .cse4))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8)))) (let ((.cse6 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse3 .cse4 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 12)))) (+ .cse2 .cse3 .cse4 .cse5 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse3 .cse4 .cse5 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 16)) .cse6)))))))))) |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_1151) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (<= 5 v_subst_3) (<= v_subst_3 3))) (= (select .cse8 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8)) 1) (< (+ |c_ULTIMATE.start_main_~a~0#1.base| 1) |c_ULTIMATE.start_main_~#sum~0#1.base|) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 0) (forall ((v_subst_4 Int) (v_ArrVal_1151 (Array Int Int))) (or (<= v_subst_4 3) (<= (select (select (store (let ((.cse16 (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (+ (* v_subst_4 4) |c_ULTIMATE.start_main_~a~0#1.offset|) 1))) (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse16))) (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse10 (select .cse9 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse12 (select .cse10 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse15 (select .cse16 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse11 (select (select (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse12 .cse15))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (let ((.cse14 (select (select (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse11 .cse12 .cse15))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8)))) (let ((.cse13 (select (select (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse11 .cse12 .cse14 .cse15))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 12)))) (+ .cse11 .cse12 .cse13 (select (select (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse11 .cse12 .cse13 .cse14 .cse15))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 16)) .cse14 .cse15)))))))))) |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_1151) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 5) (<= 5 v_subst_4))) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= (select .cse8 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 1) (= (select .cse8 |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (= |c_ULTIMATE.start_main_~i~0#1| 3))) is different from false [2021-12-17 01:32:53,002 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse8 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (and (<= |c_ULTIMATE.start_main_~i~0#1| 3) (forall ((|ULTIMATE.start_main_~i~0#1| Int) (v_ArrVal_1151 (Array Int Int))) (or (<= |ULTIMATE.start_main_~i~0#1| 3) (<= (select (select (store (let ((.cse7 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) 1))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse7))) (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse1 (select .cse0 |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|)) (.cse6 (select .cse7 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse3 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (let ((.cse4 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse3 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8)))) (let ((.cse5 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse3 .cse4 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 12)))) (+ .cse2 .cse3 .cse4 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse3 .cse4 .cse5 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 16)) .cse5 .cse6)))))))))) |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_1151) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 5) (<= 5 |ULTIMATE.start_main_~i~0#1|))) (= (select .cse8 8) 1) (forall ((|ULTIMATE.start_main_~i~0#1| Int) (v_ArrVal_1151 (Array Int Int))) (or (<= |ULTIMATE.start_main_~i~0#1| 3) (<= 5 (select (select (store (let ((.cse16 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) 1))) (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse16))) (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse10 (select .cse9 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse11 (select .cse10 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse15 (select .cse16 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse12 (select (select (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse11 .cse15))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (let ((.cse13 (select (select (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse11 .cse12 .cse15))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8)))) (let ((.cse14 (select (select (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse11 .cse12 .cse13 .cse15))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 12)))) (+ .cse11 .cse12 .cse13 (select (select (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse11 .cse12 .cse13 .cse14 .cse15))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 16)) .cse14 .cse15)))))))))) |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_1151) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (<= 5 |ULTIMATE.start_main_~i~0#1|))) (= (select .cse8 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 12)) 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 .cse8 |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (= (select .cse8 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|)) 1) (= (select .cse8 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8)) 1) (= (select .cse8 4) 1) (<= (+ (div (+ (* |c_ULTIMATE.start_main_~a~0#1.offset| (- 1)) 8) 4) 1) |c_ULTIMATE.start_main_~i~0#1|) (< (+ |c_ULTIMATE.start_main_~a~0#1.base| 1) |c_ULTIMATE.start_main_~#sum~0#1.base|) (= (select .cse8 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 1) (= (select .cse8 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 01:32:54,726 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse8 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (and (forall ((|ULTIMATE.start_main_~i~0#1| Int) (v_ArrVal_1151 (Array Int Int))) (or (<= |ULTIMATE.start_main_~i~0#1| 3) (<= (select (select (store (let ((.cse7 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) 1))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse7))) (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse1 (select .cse0 |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|)) (.cse6 (select .cse7 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse3 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (let ((.cse4 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse3 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8)))) (let ((.cse5 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse3 .cse4 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 12)))) (+ .cse2 .cse3 .cse4 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse3 .cse4 .cse5 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 16)) .cse5 .cse6)))))))))) |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_1151) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 5) (<= 5 |ULTIMATE.start_main_~i~0#1|))) (= (select .cse8 12) 1) (forall ((|ULTIMATE.start_main_~i~0#1| Int) (v_ArrVal_1151 (Array Int Int))) (or (<= |ULTIMATE.start_main_~i~0#1| 3) (<= 5 (select (select (store (let ((.cse16 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) 1))) (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse16))) (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse10 (select .cse9 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse11 (select .cse10 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse15 (select .cse16 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse12 (select (select (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse11 .cse15))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (let ((.cse13 (select (select (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse11 .cse12 .cse15))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8)))) (let ((.cse14 (select (select (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse11 .cse12 .cse13 .cse15))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 12)))) (+ .cse11 .cse12 .cse13 (select (select (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse11 .cse12 .cse13 .cse14 .cse15))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 16)) .cse14 .cse15)))))))))) |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_1151) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (<= 5 |ULTIMATE.start_main_~i~0#1|))) (= (select .cse8 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 12)) 1) (<= 4 |c_ULTIMATE.start_main_~i~0#1|) (= (select .cse8 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 .cse8 |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (<= |c_ULTIMATE.start_main_~i~0#1| 4) (= (select .cse8 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8)) 1) (< (+ |c_ULTIMATE.start_main_~a~0#1.base| 1) |c_ULTIMATE.start_main_~#sum~0#1.base|) (= (select .cse8 4) 1) (= (select .cse8 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 1) (= (select .cse8 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 01:32:58,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 01:32:58,874 INFO L93 Difference]: Finished difference Result 180 states and 199 transitions. [2021-12-17 01:32:58,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2021-12-17 01:32:58,874 INFO L78 Accepts]: Start accepts. Automaton has has 89 states, 89 states have (on average 1.2696629213483146) internal successors, (113), 89 states have internal predecessors, (113), 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 49 [2021-12-17 01:32:58,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 01:32:58,875 INFO L225 Difference]: With dead ends: 180 [2021-12-17 01:32:58,875 INFO L226 Difference]: Without dead ends: 159 [2021-12-17 01:32:58,876 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 39 SyntacticMatches, 3 SemanticMatches, 135 ConstructedPredicates, 15 IntricatePredicates, 0 DeprecatedPredicates, 3926 ImplicationChecksByTransitivity, 74.3s TimeCoverageRelationStatistics Valid=1767, Invalid=12920, Unknown=135, NotChecked=3810, Total=18632 [2021-12-17 01:32:58,877 INFO L933 BasicCegarLoop]: 23 mSDtfsCounter, 21 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 534 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 458 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 01:32:58,877 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 195 Invalid, 534 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 74 Invalid, 0 Unknown, 458 Unchecked, 0.0s Time] [2021-12-17 01:32:58,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2021-12-17 01:32:58,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 131. [2021-12-17 01:32:58,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 130 states have (on average 1.1076923076923078) internal successors, (144), 130 states have internal predecessors, (144), 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 01:32:58,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 144 transitions. [2021-12-17 01:32:58,891 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 144 transitions. Word has length 49 [2021-12-17 01:32:58,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 01:32:58,892 INFO L470 AbstractCegarLoop]: Abstraction has 131 states and 144 transitions. [2021-12-17 01:32:58,892 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 89 states, 89 states have (on average 1.2696629213483146) internal successors, (113), 89 states have internal predecessors, (113), 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 01:32:58,892 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 144 transitions. [2021-12-17 01:32:58,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2021-12-17 01:32:58,892 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 01:32:58,892 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 01:32:58,910 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2021-12-17 01:32:59,093 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2021-12-17 01:32:59,093 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 01:32:59,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 01:32:59,094 INFO L85 PathProgramCache]: Analyzing trace with hash -1613245056, now seen corresponding path program 5 times [2021-12-17 01:32:59,094 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 01:32:59,094 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469847919] [2021-12-17 01:32:59,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 01:32:59,094 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 01:32:59,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 01:32:59,612 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-12-17 01:32:59,612 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 01:32:59,612 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469847919] [2021-12-17 01:32:59,612 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1469847919] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 01:32:59,612 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1029534545] [2021-12-17 01:32:59,612 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-12-17 01:32:59,612 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 01:32:59,613 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 01:32:59,615 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-17 01:32:59,617 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2021-12-17 01:32:59,780 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2021-12-17 01:32:59,780 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 01:32:59,782 INFO L263 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 65 conjunts are in the unsatisfiable core [2021-12-17 01:32:59,784 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 01:32:59,837 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 15 treesize of output 11 [2021-12-17 01:32:59,889 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:32:59,890 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 0 case distinctions, treesize of input 25 treesize of output 24 [2021-12-17 01:32:59,954 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:32:59,955 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:32:59,956 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:32:59,957 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-17 01:32:59,957 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 34 treesize of output 36 [2021-12-17 01:33:00,046 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-17 01:33:00,046 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 29 [2021-12-17 01:33:00,052 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:33:00,052 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 15 treesize of output 7 [2021-12-17 01:33:00,146 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-17 01:33:00,146 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 34 [2021-12-17 01:33:00,210 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-17 01:33:00,210 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 34 [2021-12-17 01:33:00,236 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:33:00,237 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:33:00,238 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:33:00,239 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-17 01:33:00,239 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 35 treesize of output 37 [2021-12-17 01:33:00,358 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:33:00,359 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 01:33:00,360 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:33:00,360 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:33:00,376 INFO L354 Elim1Store]: treesize reduction 12, result has 62.5 percent of original size [2021-12-17 01:33:00,376 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 7 case distinctions, treesize of input 59 treesize of output 68 [2021-12-17 01:33:00,609 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 01:33:00,610 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:33:00,611 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:33:00,611 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:33:00,612 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 01:33:00,612 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:33:00,614 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-12-17 01:33:00,614 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 6 case distinctions, treesize of input 77 treesize of output 81 [2021-12-17 01:33:00,697 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 01:33:00,699 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-17 01:33:00,699 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 35 treesize of output 31 [2021-12-17 01:33:00,785 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:33:00,786 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 0 case distinctions, treesize of input 27 treesize of output 26 [2021-12-17 01:33:00,932 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 58 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-17 01:33:00,932 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 01:33:03,123 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_394| Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_394| (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (forall ((v_ArrVal_1232 Int)) (= 0 (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_394| 4)) v_ArrVal_1232) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8)))))) is different from false [2021-12-17 01:33:03,724 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1232 Int) (|v_ULTIMATE.start_main_~i~0#1_394| Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_394| (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (= 0 (select (store (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse1 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|))) (store .cse0 .cse1 (+ (select .cse0 .cse1) (- 1)))) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_394| 4)) v_ArrVal_1232) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8))))) is different from false [2021-12-17 01:33:04,394 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1232 Int) (|v_ULTIMATE.start_main_~i~0#1_394| Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_394| (+ |c_ULTIMATE.start_main_~i~0#1| 2)) (= 0 (select (store (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse1 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (store .cse0 .cse1 (+ (select .cse0 .cse1) (- 1)))) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_394| 4)) v_ArrVal_1232) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8))))) is different from false [2021-12-17 01:33:35,162 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-17 01:33:35,163 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 100 treesize of output 91 [2021-12-17 01:34:10,252 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~#sum~0#1.base| Int) (v_arrayElimArr_7 (Array Int Int)) (v_ArrVal_1232 Int) (v_ArrVal_1226 Int) (|v_ULTIMATE.start_main_~i~0#1_394| Int) (v_ArrVal_1227 Int)) (let ((.cse4 (store |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_7))) (let ((.cse0 (select .cse4 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse3 (store .cse0 |c_ULTIMATE.start_main_~a~0#1.offset| v_ArrVal_1226))) (or (< (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|) (+ v_ArrVal_1226 1)) (= 0 (let ((.cse2 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8))) (select (store (let ((.cse1 (store .cse3 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4) v_ArrVal_1227))) (store .cse1 .cse2 (+ (select .cse1 .cse2) (- 1)))) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_394| 4)) v_ArrVal_1232) .cse2))) (< |v_ULTIMATE.start_main_~i~0#1_394| 3) (< (select (select (store .cse4 |c_ULTIMATE.start_main_~a~0#1.base| .cse3) |ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select v_arrayElimArr_7 |c_ULTIMATE.start_main_~#sum~0#1.offset|))))))) is different from false [2021-12-17 01:34:10,287 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~#sum~0#1.base| Int) (v_arrayElimArr_7 (Array Int Int)) (v_ArrVal_1232 Int) (|v_ULTIMATE.start_main_~i~0#1_394| Int) (v_ArrVal_1226 Int) (v_ArrVal_1227 Int)) (let ((.cse4 (store |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_7))) (let ((.cse0 (select .cse4 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse3 (store .cse0 |c_ULTIMATE.start_main_~a~0#1.offset| v_ArrVal_1226))) (or (< (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|) (+ v_ArrVal_1226 1)) (= 0 (let ((.cse2 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8))) (select (store (let ((.cse1 (store .cse3 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4) v_ArrVal_1227))) (store .cse1 .cse2 (+ (select .cse1 .cse2) (- 1)))) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_394| 4)) v_ArrVal_1232) .cse2))) (< |v_ULTIMATE.start_main_~i~0#1_394| 3) (< (select (select (store .cse4 |c_ULTIMATE.start_main_~a~0#1.base| .cse3) |ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select v_arrayElimArr_7 |c_ULTIMATE.start_main_~#sum~0#1.offset|))))))) is different from false [2021-12-17 01:34:10,390 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~#sum~0#1.base| Int) (v_arrayElimArr_7 (Array Int Int)) (v_ArrVal_1232 Int) (v_ArrVal_1226 Int) (|v_ULTIMATE.start_main_~i~0#1_394| Int) (v_ArrVal_1227 Int) (v_ArrVal_1218 Int)) (let ((.cse3 (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| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1218)) |ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_7))) (let ((.cse4 (select .cse3 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse2 (store .cse4 |c_ULTIMATE.start_main_~a~0#1.offset| v_ArrVal_1226))) (or (= 0 (let ((.cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8))) (select (store (let ((.cse0 (store .cse2 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4) v_ArrVal_1227))) (store .cse0 .cse1 (+ (select .cse0 .cse1) (- 1)))) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_394| 4)) v_ArrVal_1232) .cse1))) (< |v_ULTIMATE.start_main_~i~0#1_394| 3) (< (select (select (store .cse3 |c_ULTIMATE.start_main_~a~0#1.base| .cse2) |ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select v_arrayElimArr_7 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (< (select .cse4 |c_ULTIMATE.start_main_~a~0#1.offset|) (+ v_ArrVal_1226 1))))))) is different from false [2021-12-17 01:34:10,485 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_404| Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_404| (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (forall ((|ULTIMATE.start_main_~#sum~0#1.base| Int) (v_arrayElimArr_7 (Array Int Int)) (v_ArrVal_1232 Int) (v_ArrVal_1226 Int) (|v_ULTIMATE.start_main_~i~0#1_394| Int) (v_ArrVal_1227 Int) (v_ArrVal_1218 Int)) (let ((.cse4 (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_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_404| 4)) v_ArrVal_1218)) |ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_7))) (let ((.cse0 (select .cse4 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse3 (store .cse0 |c_ULTIMATE.start_main_~a~0#1.offset| v_ArrVal_1226))) (or (< (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|) (+ v_ArrVal_1226 1)) (= 0 (let ((.cse2 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8))) (select (store (let ((.cse1 (store .cse3 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4) v_ArrVal_1227))) (store .cse1 .cse2 (+ (select .cse1 .cse2) (- 1)))) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_394| 4)) v_ArrVal_1232) .cse2))) (< |v_ULTIMATE.start_main_~i~0#1_394| 3) (< (select (select (store .cse4 |c_ULTIMATE.start_main_~a~0#1.base| .cse3) |ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select v_arrayElimArr_7 |c_ULTIMATE.start_main_~#sum~0#1.offset|))))))))) is different from false [2021-12-17 01:34:10,557 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~#sum~0#1.base| Int) (v_arrayElimArr_7 (Array Int Int)) (v_ArrVal_1232 Int) (v_ArrVal_1226 Int) (|v_ULTIMATE.start_main_~i~0#1_394| Int) (|v_ULTIMATE.start_main_~i~0#1_404| Int) (v_ArrVal_1227 Int) (v_ArrVal_1218 Int)) (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_404| 4)) v_ArrVal_1218)) |ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_7))) (let ((.cse2 (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse1 (store .cse2 |c_ULTIMATE.start_main_~a~0#1.offset| v_ArrVal_1226))) (or (< (select (select (store .cse0 |c_ULTIMATE.start_main_~a~0#1.base| .cse1) |ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select v_arrayElimArr_7 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (< (select .cse2 |c_ULTIMATE.start_main_~a~0#1.offset|) (+ v_ArrVal_1226 1)) (= 0 (let ((.cse4 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8))) (select (store (let ((.cse3 (store .cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4) v_ArrVal_1227))) (store .cse3 .cse4 (+ (select .cse3 .cse4) (- 1)))) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_394| 4)) v_ArrVal_1232) .cse4))) (< |v_ULTIMATE.start_main_~i~0#1_394| 3) (< |v_ULTIMATE.start_main_~i~0#1_404| (+ |c_ULTIMATE.start_main_~i~0#1| 1))))))) is different from false [2021-12-17 01:34:10,640 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~#sum~0#1.base| Int) (v_arrayElimArr_7 (Array Int Int)) (v_ArrVal_1232 Int) (v_ArrVal_1226 Int) (|v_ULTIMATE.start_main_~i~0#1_394| Int) (|v_ULTIMATE.start_main_~i~0#1_404| Int) (v_ArrVal_1227 Int) (v_ArrVal_1218 Int)) (let ((.cse1 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset| 4) 1) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_404| 4)) v_ArrVal_1218)) |ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_7))) (let ((.cse0 (select .cse1 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse2 (store .cse0 |c_ULTIMATE.start_main_~a~0#1.offset| v_ArrVal_1226))) (or (< (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|) (+ v_ArrVal_1226 1)) (< |v_ULTIMATE.start_main_~i~0#1_394| 3) (< (select (select (store .cse1 |c_ULTIMATE.start_main_~a~0#1.base| .cse2) |ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select v_arrayElimArr_7 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (< |v_ULTIMATE.start_main_~i~0#1_404| (+ |c_ULTIMATE.start_main_~i~0#1| 2)) (= 0 (let ((.cse4 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8))) (select (store (let ((.cse3 (store .cse2 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4) v_ArrVal_1227))) (store .cse3 .cse4 (+ (select .cse3 .cse4) (- 1)))) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_394| 4)) v_ArrVal_1232) .cse4)))))))) is different from false [2021-12-17 01:34:10,687 INFO L354 Elim1Store]: treesize reduction 127, result has 23.0 percent of original size [2021-12-17 01:34:10,687 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 222 treesize of output 124 [2021-12-17 01:34:10,691 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 183 treesize of output 171 [2021-12-17 01:34:10,694 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 01:34:10,694 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 01:34:10,695 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 01:34:10,696 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 01:34:10,721 INFO L354 Elim1Store]: treesize reduction 29, result has 59.7 percent of original size [2021-12-17 01:34:10,721 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 48 treesize of output 71 [2021-12-17 01:34:10,740 INFO L354 Elim1Store]: treesize reduction 10, result has 65.5 percent of original size [2021-12-17 01:34:10,740 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 127 treesize of output 137 [2021-12-17 01:34:10,992 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 27 refuted. 2 times theorem prover too weak. 2 trivial. 31 not checked. [2021-12-17 01:34:10,993 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1029534545] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 01:34:10,993 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-17 01:34:10,993 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 25, 28] total 62 [2021-12-17 01:34:10,993 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007667983] [2021-12-17 01:34:10,993 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-17 01:34:10,993 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 62 states [2021-12-17 01:34:10,993 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 01:34:10,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2021-12-17 01:34:10,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=298, Invalid=2421, Unknown=73, NotChecked=990, Total=3782 [2021-12-17 01:34:10,994 INFO L87 Difference]: Start difference. First operand 131 states and 144 transitions. Second operand has 62 states, 62 states have (on average 1.935483870967742) internal successors, (120), 62 states have internal predecessors, (120), 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 01:34:15,790 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (and (= 0 |c_ULTIMATE.start_main_~#sum~0#1.offset|) (forall ((|ULTIMATE.start_main_~#sum~0#1.base| Int) (v_arrayElimArr_7 (Array Int Int)) (v_ArrVal_1232 Int) (v_ArrVal_1226 Int) (|v_ULTIMATE.start_main_~i~0#1_394| Int) (|v_ULTIMATE.start_main_~i~0#1_404| Int) (v_ArrVal_1227 Int) (v_ArrVal_1218 Int)) (let ((.cse1 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset| 4) 1) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_404| 4)) v_ArrVal_1218)) |ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_7))) (let ((.cse0 (select .cse1 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse2 (store .cse0 |c_ULTIMATE.start_main_~a~0#1.offset| v_ArrVal_1226))) (or (< (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|) (+ v_ArrVal_1226 1)) (< |v_ULTIMATE.start_main_~i~0#1_394| 3) (< (select (select (store .cse1 |c_ULTIMATE.start_main_~a~0#1.base| .cse2) |ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select v_arrayElimArr_7 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (< |v_ULTIMATE.start_main_~i~0#1_404| (+ |c_ULTIMATE.start_main_~i~0#1| 2)) (= 0 (let ((.cse4 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8))) (select (store (let ((.cse3 (store .cse2 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4) v_ArrVal_1227))) (store .cse3 .cse4 (+ (select .cse3 .cse4) (- 1)))) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_394| 4)) v_ArrVal_1232) .cse4)))))))) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= (select .cse5 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 1) (forall ((|v_ULTIMATE.start_main_~i~0#1_404| Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_404| (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (forall ((|ULTIMATE.start_main_~#sum~0#1.base| Int) (v_arrayElimArr_7 (Array Int Int)) (v_ArrVal_1232 Int) (v_ArrVal_1226 Int) (|v_ULTIMATE.start_main_~i~0#1_394| Int) (v_ArrVal_1227 Int) (v_ArrVal_1218 Int)) (let ((.cse10 (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_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_404| 4)) v_ArrVal_1218)) |ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_7))) (let ((.cse6 (select .cse10 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse9 (store .cse6 |c_ULTIMATE.start_main_~a~0#1.offset| v_ArrVal_1226))) (or (< (select .cse6 |c_ULTIMATE.start_main_~a~0#1.offset|) (+ v_ArrVal_1226 1)) (= 0 (let ((.cse8 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8))) (select (store (let ((.cse7 (store .cse9 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4) v_ArrVal_1227))) (store .cse7 .cse8 (+ (select .cse7 .cse8) (- 1)))) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_394| 4)) v_ArrVal_1232) .cse8))) (< |v_ULTIMATE.start_main_~i~0#1_394| 3) (< (select (select (store .cse10 |c_ULTIMATE.start_main_~a~0#1.base| .cse9) |ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select v_arrayElimArr_7 |c_ULTIMATE.start_main_~#sum~0#1.offset|))))))))) (= (select .cse5 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|)) 1) (= |c_ULTIMATE.start_main_~i~0#1| 2) (<= (+ (* 4 |c_ULTIMATE.start_main_~i~0#1|) |c_ULTIMATE.start_main_~a~0#1.offset|) 8) (<= 2 |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 01:34:15,796 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (and (= (select .cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8)) 1) (<= (+ (* 4 |c_ULTIMATE.start_main_~i~0#1|) |c_ULTIMATE.start_main_~a~0#1.offset|) 12) (= 0 |c_ULTIMATE.start_main_~#sum~0#1.offset|) (= (select .cse0 8) 1) (<= 3 |c_ULTIMATE.start_main_~i~0#1|) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= (select .cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 1) (forall ((|ULTIMATE.start_main_~#sum~0#1.base| Int) (v_arrayElimArr_7 (Array Int Int)) (v_ArrVal_1232 Int) (v_ArrVal_1226 Int) (|v_ULTIMATE.start_main_~i~0#1_394| Int) (v_ArrVal_1227 Int) (v_ArrVal_1218 Int)) (let ((.cse4 (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| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1218)) |ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_7))) (let ((.cse5 (select .cse4 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse3 (store .cse5 |c_ULTIMATE.start_main_~a~0#1.offset| v_ArrVal_1226))) (or (= 0 (let ((.cse2 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8))) (select (store (let ((.cse1 (store .cse3 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4) v_ArrVal_1227))) (store .cse1 .cse2 (+ (select .cse1 .cse2) (- 1)))) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_394| 4)) v_ArrVal_1232) .cse2))) (< |v_ULTIMATE.start_main_~i~0#1_394| 3) (< (select (select (store .cse4 |c_ULTIMATE.start_main_~a~0#1.base| .cse3) |ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select v_arrayElimArr_7 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (< (select .cse5 |c_ULTIMATE.start_main_~a~0#1.offset|) (+ v_ArrVal_1226 1))))))) (forall ((|ULTIMATE.start_main_~#sum~0#1.base| Int) (v_arrayElimArr_7 (Array Int Int)) (v_ArrVal_1232 Int) (v_ArrVal_1226 Int) (|v_ULTIMATE.start_main_~i~0#1_394| Int) (|v_ULTIMATE.start_main_~i~0#1_404| Int) (v_ArrVal_1227 Int) (v_ArrVal_1218 Int)) (let ((.cse6 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_404| 4)) v_ArrVal_1218)) |ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_7))) (let ((.cse8 (select .cse6 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse7 (store .cse8 |c_ULTIMATE.start_main_~a~0#1.offset| v_ArrVal_1226))) (or (< (select (select (store .cse6 |c_ULTIMATE.start_main_~a~0#1.base| .cse7) |ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select v_arrayElimArr_7 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (< (select .cse8 |c_ULTIMATE.start_main_~a~0#1.offset|) (+ v_ArrVal_1226 1)) (= 0 (let ((.cse10 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8))) (select (store (let ((.cse9 (store .cse7 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4) v_ArrVal_1227))) (store .cse9 .cse10 (+ (select .cse9 .cse10) (- 1)))) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_394| 4)) v_ArrVal_1232) .cse10))) (< |v_ULTIMATE.start_main_~i~0#1_394| 3) (< |v_ULTIMATE.start_main_~i~0#1_404| (+ |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 01:34:15,803 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (and (forall ((|ULTIMATE.start_main_~#sum~0#1.base| Int) (v_arrayElimArr_7 (Array Int Int)) (v_ArrVal_1232 Int) (|v_ULTIMATE.start_main_~i~0#1_394| Int) (v_ArrVal_1226 Int) (v_ArrVal_1227 Int)) (let ((.cse4 (store |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_7))) (let ((.cse0 (select .cse4 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse3 (store .cse0 |c_ULTIMATE.start_main_~a~0#1.offset| v_ArrVal_1226))) (or (< (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|) (+ v_ArrVal_1226 1)) (= 0 (let ((.cse2 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8))) (select (store (let ((.cse1 (store .cse3 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4) v_ArrVal_1227))) (store .cse1 .cse2 (+ (select .cse1 .cse2) (- 1)))) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_394| 4)) v_ArrVal_1232) .cse2))) (< |v_ULTIMATE.start_main_~i~0#1_394| 3) (< (select (select (store .cse4 |c_ULTIMATE.start_main_~a~0#1.base| .cse3) |ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select v_arrayElimArr_7 |c_ULTIMATE.start_main_~#sum~0#1.offset|))))))) (= (select .cse5 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8)) 1) (<= (+ (* 4 |c_ULTIMATE.start_main_~i~0#1|) |c_ULTIMATE.start_main_~a~0#1.offset|) 12) (= (select .cse5 8) 1) (= 0 |c_ULTIMATE.start_main_~#sum~0#1.offset|) (<= 3 |c_ULTIMATE.start_main_~i~0#1|) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= (select .cse5 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 1) (forall ((|v_ULTIMATE.start_main_~i~0#1_404| Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_404| (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (forall ((|ULTIMATE.start_main_~#sum~0#1.base| Int) (v_arrayElimArr_7 (Array Int Int)) (v_ArrVal_1232 Int) (v_ArrVal_1226 Int) (|v_ULTIMATE.start_main_~i~0#1_394| Int) (v_ArrVal_1227 Int) (v_ArrVal_1218 Int)) (let ((.cse10 (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_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_404| 4)) v_ArrVal_1218)) |ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_7))) (let ((.cse6 (select .cse10 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse9 (store .cse6 |c_ULTIMATE.start_main_~a~0#1.offset| v_ArrVal_1226))) (or (< (select .cse6 |c_ULTIMATE.start_main_~a~0#1.offset|) (+ v_ArrVal_1226 1)) (= 0 (let ((.cse8 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8))) (select (store (let ((.cse7 (store .cse9 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4) v_ArrVal_1227))) (store .cse7 .cse8 (+ (select .cse7 .cse8) (- 1)))) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_394| 4)) v_ArrVal_1232) .cse8))) (< |v_ULTIMATE.start_main_~i~0#1_394| 3) (< (select (select (store .cse10 |c_ULTIMATE.start_main_~a~0#1.base| .cse9) |ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select v_arrayElimArr_7 |c_ULTIMATE.start_main_~#sum~0#1.offset|))))))))) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)))) is different from false [2021-12-17 01:34:15,808 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (and (forall ((|ULTIMATE.start_main_~#sum~0#1.base| Int) (v_arrayElimArr_7 (Array Int Int)) (v_ArrVal_1232 Int) (|v_ULTIMATE.start_main_~i~0#1_394| Int) (v_ArrVal_1226 Int) (v_ArrVal_1227 Int)) (let ((.cse4 (store |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_7))) (let ((.cse0 (select .cse4 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse3 (store .cse0 |c_ULTIMATE.start_main_~a~0#1.offset| v_ArrVal_1226))) (or (< (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|) (+ v_ArrVal_1226 1)) (= 0 (let ((.cse2 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8))) (select (store (let ((.cse1 (store .cse3 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4) v_ArrVal_1227))) (store .cse1 .cse2 (+ (select .cse1 .cse2) (- 1)))) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_394| 4)) v_ArrVal_1232) .cse2))) (< |v_ULTIMATE.start_main_~i~0#1_394| 3) (< (select (select (store .cse4 |c_ULTIMATE.start_main_~a~0#1.base| .cse3) |ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select v_arrayElimArr_7 |c_ULTIMATE.start_main_~#sum~0#1.offset|))))))) (= (select .cse5 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8)) 1) (= (select .cse5 8) 1) (= 0 |c_ULTIMATE.start_main_~#sum~0#1.offset|) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (forall ((|ULTIMATE.start_main_~#sum~0#1.base| Int) (v_arrayElimArr_7 (Array Int Int)) (v_ArrVal_1232 Int) (v_ArrVal_1226 Int) (|v_ULTIMATE.start_main_~i~0#1_394| Int) (v_ArrVal_1227 Int) (v_ArrVal_1218 Int)) (let ((.cse9 (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| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1218)) |ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_7))) (let ((.cse10 (select .cse9 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse8 (store .cse10 |c_ULTIMATE.start_main_~a~0#1.offset| v_ArrVal_1226))) (or (= 0 (let ((.cse7 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8))) (select (store (let ((.cse6 (store .cse8 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4) v_ArrVal_1227))) (store .cse6 .cse7 (+ (select .cse6 .cse7) (- 1)))) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_394| 4)) v_ArrVal_1232) .cse7))) (< |v_ULTIMATE.start_main_~i~0#1_394| 3) (< (select (select (store .cse9 |c_ULTIMATE.start_main_~a~0#1.base| .cse8) |ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select v_arrayElimArr_7 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (< (select .cse10 |c_ULTIMATE.start_main_~a~0#1.offset|) (+ v_ArrVal_1226 1))))))) (= (select .cse5 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 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 01:34:15,813 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (and (forall ((|ULTIMATE.start_main_~#sum~0#1.base| Int) (v_arrayElimArr_7 (Array Int Int)) (v_ArrVal_1232 Int) (|v_ULTIMATE.start_main_~i~0#1_394| Int) (v_ArrVal_1226 Int) (v_ArrVal_1227 Int)) (let ((.cse4 (store |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_7))) (let ((.cse0 (select .cse4 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse3 (store .cse0 |c_ULTIMATE.start_main_~a~0#1.offset| v_ArrVal_1226))) (or (< (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|) (+ v_ArrVal_1226 1)) (= 0 (let ((.cse2 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8))) (select (store (let ((.cse1 (store .cse3 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4) v_ArrVal_1227))) (store .cse1 .cse2 (+ (select .cse1 .cse2) (- 1)))) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_394| 4)) v_ArrVal_1232) .cse2))) (< |v_ULTIMATE.start_main_~i~0#1_394| 3) (< (select (select (store .cse4 |c_ULTIMATE.start_main_~a~0#1.base| .cse3) |ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select v_arrayElimArr_7 |c_ULTIMATE.start_main_~#sum~0#1.offset|))))))) (= (select .cse5 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8)) 1) (= (select .cse5 8) 1) (= 0 |c_ULTIMATE.start_main_~#sum~0#1.offset|) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= (select .cse5 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 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 01:34:15,817 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (and (= (select .cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8)) 1) (= 0 |c_ULTIMATE.start_main_~#sum~0#1.offset|) (forall ((|ULTIMATE.start_main_~#sum~0#1.base| Int) (v_arrayElimArr_7 (Array Int Int)) (v_ArrVal_1232 Int) (v_ArrVal_1226 Int) (|v_ULTIMATE.start_main_~i~0#1_394| Int) (v_ArrVal_1227 Int)) (let ((.cse5 (store |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_7))) (let ((.cse1 (select .cse5 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse4 (store .cse1 |c_ULTIMATE.start_main_~a~0#1.offset| v_ArrVal_1226))) (or (< (select .cse1 |c_ULTIMATE.start_main_~a~0#1.offset|) (+ v_ArrVal_1226 1)) (= 0 (let ((.cse3 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8))) (select (store (let ((.cse2 (store .cse4 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4) v_ArrVal_1227))) (store .cse2 .cse3 (+ (select .cse2 .cse3) (- 1)))) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_394| 4)) v_ArrVal_1232) .cse3))) (< |v_ULTIMATE.start_main_~i~0#1_394| 3) (< (select (select (store .cse5 |c_ULTIMATE.start_main_~a~0#1.base| .cse4) |ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select v_arrayElimArr_7 |c_ULTIMATE.start_main_~#sum~0#1.offset|))))))) (= (select .cse0 8) 1) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= (select .cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 1) (= |c_ULTIMATE.start_main_~i~0#1| 0) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)))) is different from false [2021-12-17 01:35:32,033 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (forall ((|v_ULTIMATE.start_main_~i~0#1_394| Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_394| (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (forall ((v_ArrVal_1232 Int)) (= 0 (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_394| 4)) v_ArrVal_1232) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8)))))) (<= |c_ULTIMATE.start_main_~i~0#1| 2) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|)) 0) (<= 2 |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 01:35:34,155 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (forall ((v_ArrVal_1232 Int) (|v_ULTIMATE.start_main_~i~0#1_394| Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_394| (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (= 0 (select (store (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse1 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|))) (store .cse0 .cse1 (+ (select .cse0 .cse1) (- 1)))) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_394| 4)) v_ArrVal_1232) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8))))) (or (forall ((v_ArrVal_1232 Int) (|v_ULTIMATE.start_main_~i~0#1_394| Int) (v_ArrVal_1227 Int)) (or (= 0 (select (store (let ((.cse4 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse2 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse4 |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1227)) (.cse3 (+ .cse4 |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (store .cse2 .cse3 (+ (select .cse2 .cse3) (- 1))))) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_394| 4)) v_ArrVal_1232) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8))) (< |v_ULTIMATE.start_main_~i~0#1_394| (+ |c_ULTIMATE.start_main_~i~0#1| 2)))) (< (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 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) 8) 0)) is different from false [2021-12-17 01:35:34,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 01:35:34,393 INFO L93 Difference]: Finished difference Result 181 states and 201 transitions. [2021-12-17 01:35:34,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2021-12-17 01:35:34,393 INFO L78 Accepts]: Start accepts. Automaton has has 62 states, 62 states have (on average 1.935483870967742) internal successors, (120), 62 states have internal predecessors, (120), 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 50 [2021-12-17 01:35:34,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 01:35:34,394 INFO L225 Difference]: With dead ends: 181 [2021-12-17 01:35:34,394 INFO L226 Difference]: Without dead ends: 179 [2021-12-17 01:35:34,396 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 61 SyntacticMatches, 14 SemanticMatches, 90 ConstructedPredicates, 17 IntricatePredicates, 0 DeprecatedPredicates, 1701 ImplicationChecksByTransitivity, 152.7s TimeCoverageRelationStatistics Valid=641, Invalid=4840, Unknown=137, NotChecked=2754, Total=8372 [2021-12-17 01:35:34,396 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 75 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 482 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 293 SdHoareTripleChecker+Invalid, 1576 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 482 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1042 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-17 01:35:34,396 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [75 Valid, 293 Invalid, 1576 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 482 Invalid, 0 Unknown, 1042 Unchecked, 0.2s Time] [2021-12-17 01:35:34,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2021-12-17 01:35:34,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 131. [2021-12-17 01:35:34,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 130 states have (on average 1.1) internal successors, (143), 130 states have internal predecessors, (143), 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 01:35:34,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 143 transitions. [2021-12-17 01:35:34,410 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 143 transitions. Word has length 50 [2021-12-17 01:35:34,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 01:35:34,411 INFO L470 AbstractCegarLoop]: Abstraction has 131 states and 143 transitions. [2021-12-17 01:35:34,411 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 62 states, 62 states have (on average 1.935483870967742) internal successors, (120), 62 states have internal predecessors, (120), 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 01:35:34,411 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 143 transitions. [2021-12-17 01:35:34,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-12-17 01:35:34,411 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 01:35:34,411 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 01:35:34,445 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2021-12-17 01:35:34,627 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2021-12-17 01:35:34,627 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 01:35:34,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 01:35:34,628 INFO L85 PathProgramCache]: Analyzing trace with hash -1511676874, now seen corresponding path program 6 times [2021-12-17 01:35:34,628 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 01:35:34,628 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422408238] [2021-12-17 01:35:34,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 01:35:34,628 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 01:35:34,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 01:35:36,394 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 2 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 01:35:36,394 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 01:35:36,395 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422408238] [2021-12-17 01:35:36,395 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [422408238] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 01:35:36,395 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [510229530] [2021-12-17 01:35:36,395 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2021-12-17 01:35:36,395 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 01:35:36,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 01:35:36,396 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-17 01:35:36,397 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2021-12-17 01:35:36,536 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2021-12-17 01:35:36,536 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 01:35:36,538 INFO L263 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 52 conjunts are in the unsatisfiable core [2021-12-17 01:35:36,540 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 01:35:36,717 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 13 treesize of output 9 [2021-12-17 01:35:36,777 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:35:36,778 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 0 case distinctions, treesize of input 16 treesize of output 18 [2021-12-17 01:35:36,792 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:35:36,792 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 0 case distinctions, treesize of input 16 treesize of output 18 [2021-12-17 01:35:36,806 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:35:36,807 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 0 case distinctions, treesize of input 16 treesize of output 18 [2021-12-17 01:35:36,819 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:35:36,820 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 0 case distinctions, treesize of input 16 treesize of output 18 [2021-12-17 01:35:36,909 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:35:36,909 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 0 case distinctions, treesize of input 25 treesize of output 24 [2021-12-17 01:35:36,962 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:35:36,962 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 0 case distinctions, treesize of input 25 treesize of output 24 [2021-12-17 01:35:37,061 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:35:37,062 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 0 case distinctions, treesize of input 25 treesize of output 24 [2021-12-17 01:35:37,133 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 01:35:37,135 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-17 01:35:37,135 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 35 treesize of output 31 [2021-12-17 01:35:37,578 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 01:35:37,580 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-17 01:35:37,580 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 36 treesize of output 23 [2021-12-17 01:35:37,617 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 6 proven. 57 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-12-17 01:35:37,617 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 01:36:26,038 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1300 (Array Int Int)) (v_ArrVal_1301 Int) (|v_ULTIMATE.start_main_~i~0#1_418| Int) (v_ArrVal_1305 Int) (v_ArrVal_1304 Int)) (or (= 0 (select (let ((.cse0 (store (store (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1300) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset| v_ArrVal_1301) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4) v_ArrVal_1304) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8) v_ArrVal_1305)) (.cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 12))) (store .cse0 .cse1 (+ (select .cse0 .cse1) (- 1)))) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_418| 4)))) (< |v_ULTIMATE.start_main_~i~0#1_418| 3) (<= 4 |v_ULTIMATE.start_main_~i~0#1_418|))) is different from false [2021-12-17 01:36:26,141 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-17 01:36:26,142 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 1 case distinctions, treesize of input 80 treesize of output 69 [2021-12-17 01:36:26,144 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 118 treesize of output 112 [2021-12-17 01:36:26,147 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 01:36:26,147 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 01:36:26,148 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 01:36:26,148 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:36:26,150 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 13 treesize of output 9 [2021-12-17 01:36:26,169 INFO L354 Elim1Store]: treesize reduction 28, result has 37.8 percent of original size [2021-12-17 01:36:26,170 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 44974 treesize of output 43936 [2021-12-17 01:36:26,512 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: BigInteger out of long range [2021-12-17 01:36:26,512 INFO L186 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2021-12-17 01:36:26,512 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2021-12-17 01:36:26,513 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581280952] [2021-12-17 01:36:26,513 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2021-12-17 01:36:26,513 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2021-12-17 01:36:26,513 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 01:36:26,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2021-12-17 01:36:26,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=486, Invalid=4725, Unknown=49, NotChecked=142, Total=5402 [2021-12-17 01:36:26,514 INFO L87 Difference]: Start difference. First operand 131 states and 143 transitions. Second operand has 38 states, 38 states have (on average 1.4210526315789473) internal successors, (54), 38 states have internal predecessors, (54), 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 01:36:29,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 01:36:29,204 INFO L93 Difference]: Finished difference Result 144 states and 156 transitions. [2021-12-17 01:36:29,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2021-12-17 01:36:29,208 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 1.4210526315789473) internal successors, (54), 38 states have internal predecessors, (54), 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 54 [2021-12-17 01:36:29,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 01:36:29,209 INFO L225 Difference]: With dead ends: 144 [2021-12-17 01:36:29,209 INFO L226 Difference]: Without dead ends: 103 [2021-12-17 01:36:29,210 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 62 SyntacticMatches, 1 SemanticMatches, 105 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2835 ImplicationChecksByTransitivity, 51.9s TimeCoverageRelationStatistics Valid=1003, Invalid=10082, Unknown=49, NotChecked=208, Total=11342 [2021-12-17 01:36:29,210 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 54 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 899 mSolverCounterSat, 149 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 1048 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 149 IncrementalHoareTripleChecker+Valid, 899 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-12-17 01:36:29,211 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [54 Valid, 200 Invalid, 1048 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [149 Valid, 899 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2021-12-17 01:36:29,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2021-12-17 01:36:29,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 92. [2021-12-17 01:36:29,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 91 states have (on average 1.1318681318681318) internal successors, (103), 91 states have internal predecessors, (103), 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 01:36:29,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 103 transitions. [2021-12-17 01:36:29,222 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 103 transitions. Word has length 54 [2021-12-17 01:36:29,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 01:36:29,222 INFO L470 AbstractCegarLoop]: Abstraction has 92 states and 103 transitions. [2021-12-17 01:36:29,222 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 1.4210526315789473) internal successors, (54), 38 states have internal predecessors, (54), 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 01:36:29,222 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 103 transitions. [2021-12-17 01:36:29,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-12-17 01:36:29,223 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 01:36:29,223 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 01:36:29,240 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2021-12-17 01:36:29,423 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 01:36:29,424 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 01:36:29,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 01:36:29,424 INFO L85 PathProgramCache]: Analyzing trace with hash -316108018, now seen corresponding path program 13 times [2021-12-17 01:36:29,424 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 01:36:29,424 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224252942] [2021-12-17 01:36:29,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 01:36:29,424 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 01:36:29,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 01:36:29,544 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 27 proven. 34 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2021-12-17 01:36:29,544 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 01:36:29,544 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224252942] [2021-12-17 01:36:29,544 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1224252942] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 01:36:29,544 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1775458541] [2021-12-17 01:36:29,545 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-12-17 01:36:29,545 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 01:36:29,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 01:36:29,546 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-17 01:36:29,571 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2021-12-17 01:36:29,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 01:36:29,632 INFO L263 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 14 conjunts are in the unsatisfiable core [2021-12-17 01:36:29,633 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 01:36:29,810 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 36 proven. 25 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2021-12-17 01:36:29,810 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 01:36:29,889 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 36 proven. 25 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2021-12-17 01:36:29,889 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1775458541] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 01:36:29,889 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-17 01:36:29,889 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 23 [2021-12-17 01:36:29,889 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545750666] [2021-12-17 01:36:29,889 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-17 01:36:29,890 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2021-12-17 01:36:29,890 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 01:36:29,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-12-17 01:36:29,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=375, Unknown=0, NotChecked=0, Total=506 [2021-12-17 01:36:29,890 INFO L87 Difference]: Start difference. First operand 92 states and 103 transitions. Second operand has 23 states, 23 states have (on average 2.4782608695652173) internal successors, (57), 23 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 01:36:30,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 01:36:30,164 INFO L93 Difference]: Finished difference Result 280 states and 305 transitions. [2021-12-17 01:36:30,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-12-17 01:36:30,179 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.4782608695652173) internal successors, (57), 23 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2021-12-17 01:36:30,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 01:36:30,180 INFO L225 Difference]: With dead ends: 280 [2021-12-17 01:36:30,180 INFO L226 Difference]: Without dead ends: 216 [2021-12-17 01:36:30,181 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 195 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=212, Invalid=600, Unknown=0, NotChecked=0, Total=812 [2021-12-17 01:36:30,181 INFO L933 BasicCegarLoop]: 30 mSDtfsCounter, 289 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 291 mSolverCounterSat, 145 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 289 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 436 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 145 IncrementalHoareTripleChecker+Valid, 291 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-17 01:36:30,181 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [289 Valid, 155 Invalid, 436 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [145 Valid, 291 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-17 01:36:30,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2021-12-17 01:36:30,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 163. [2021-12-17 01:36:30,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 162 states have (on average 1.117283950617284) internal successors, (181), 162 states have internal predecessors, (181), 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 01:36:30,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 181 transitions. [2021-12-17 01:36:30,199 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 181 transitions. Word has length 54 [2021-12-17 01:36:30,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 01:36:30,200 INFO L470 AbstractCegarLoop]: Abstraction has 163 states and 181 transitions. [2021-12-17 01:36:30,200 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.4782608695652173) internal successors, (57), 23 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 01:36:30,200 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 181 transitions. [2021-12-17 01:36:30,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2021-12-17 01:36:30,200 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 01:36:30,200 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 01:36:30,217 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2021-12-17 01:36:30,415 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 01:36:30,416 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 01:36:30,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 01:36:30,416 INFO L85 PathProgramCache]: Analyzing trace with hash -870828532, now seen corresponding path program 14 times [2021-12-17 01:36:30,416 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 01:36:30,416 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651784596] [2021-12-17 01:36:30,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 01:36:30,416 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 01:36:30,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 01:36:32,202 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 11 proven. 72 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2021-12-17 01:36:32,202 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 01:36:32,202 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651784596] [2021-12-17 01:36:32,202 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1651784596] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 01:36:32,202 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1687105519] [2021-12-17 01:36:32,202 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-17 01:36:32,203 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 01:36:32,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 01:36:32,203 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-17 01:36:32,204 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2021-12-17 01:36:32,298 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-17 01:36:32,298 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 01:36:32,299 INFO L263 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 86 conjunts are in the unsatisfiable core [2021-12-17 01:36:32,302 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 01:36:32,314 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 01:36:32,354 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:36:32,355 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 0 case distinctions, treesize of input 23 treesize of output 22 [2021-12-17 01:36:32,440 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:36:32,441 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:36:32,441 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2021-12-17 01:36:32,537 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:36:32,537 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:36:32,538 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:36:32,539 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:36:32,540 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 01:36:32,657 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:36:32,658 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:36:32,658 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:36:32,659 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:36:32,659 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:36:32,660 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:36:32,660 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:36:32,661 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 56 [2021-12-17 01:36:32,780 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:36:32,781 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:36:32,782 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:36:32,782 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:36:32,783 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:36:32,783 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:36:32,784 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:36:32,784 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:36:32,785 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:36:32,785 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:36:32,786 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:36:32,790 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 68 [2021-12-17 01:36:32,932 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:36:32,933 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:36:32,933 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:36:32,934 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:36:32,934 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:36:32,935 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:36:32,935 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:36:32,936 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:36:32,936 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:36:32,937 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:36:32,937 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:36:32,938 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:36:32,938 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:36:32,939 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:36:32,939 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:36:32,940 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:36:32,940 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 83 [2021-12-17 01:36:33,244 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:36:33,245 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:36:33,245 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 01:36:33,246 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:36:33,246 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:36:33,247 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:36:33,247 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:36:33,248 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:36:33,248 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:36:33,249 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:36:33,249 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:36:33,255 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:36:33,256 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:36:33,256 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:36:33,257 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:36:33,258 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:36:33,258 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:36:33,259 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 16 disjoint index pairs (out of 28 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 87 [2021-12-17 01:36:33,418 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:36:33,419 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:36:33,419 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:36:33,420 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:36:33,420 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:36:33,421 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:36:33,421 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:36:33,422 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 01:36:33,422 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:36:33,423 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:36:33,423 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:36:33,424 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:36:33,424 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:36:33,425 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:36:33,425 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:36:33,426 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:36:33,426 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:36:33,427 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:36:33,427 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 16 disjoint index pairs (out of 28 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 85 [2021-12-17 01:36:33,583 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:36:33,584 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:36:33,585 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:36:33,585 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:36:33,586 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:36:33,586 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:36:33,587 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:36:33,587 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:36:33,588 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:36:33,588 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:36:33,589 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:36:33,589 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 01:36:33,590 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:36:33,590 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:36:33,591 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:36:33,591 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:36:33,592 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:36:33,592 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:36:33,593 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 16 disjoint index pairs (out of 28 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 99 treesize of output 90 [2021-12-17 01:36:33,762 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:36:33,763 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:36:33,763 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:36:33,764 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:36:33,764 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:36:33,765 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:36:33,765 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:36:33,766 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:36:33,767 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:36:33,767 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:36:33,768 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:36:33,768 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:36:33,769 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:36:33,770 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:36:33,770 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:36:33,770 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 01:36:33,771 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:36:33,772 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:36:33,772 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:36:33,791 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 16 disjoint index pairs (out of 28 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 93 [2021-12-17 01:36:33,987 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:36:33,987 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:36:33,988 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:36:33,988 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:36:33,989 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:36:33,989 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:36:33,990 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:36:33,991 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:36:33,991 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:36:33,992 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:36:33,992 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:36:33,993 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:36:33,993 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:36:33,994 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:36:33,994 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:36:33,995 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:36:33,995 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 01:36:33,996 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:36:33,996 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:36:33,997 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:36:33,997 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 16 disjoint index pairs (out of 28 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 100 treesize of output 96 [2021-12-17 01:36:34,178 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:36:34,178 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 16 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 75 [2021-12-17 01:36:34,313 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:36:34,314 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 16 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 27 [2021-12-17 01:36:34,383 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 11 proven. 72 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2021-12-17 01:36:34,383 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 01:36:53,912 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 11 proven. 72 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2021-12-17 01:36:53,912 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1687105519] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 01:36:53,912 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-17 01:36:53,912 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 29, 29] total 86 [2021-12-17 01:36:53,912 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962633453] [2021-12-17 01:36:53,912 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-17 01:36:53,912 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 86 states [2021-12-17 01:36:53,912 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 01:36:53,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2021-12-17 01:36:53,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=500, Invalid=6810, Unknown=0, NotChecked=0, Total=7310 [2021-12-17 01:36:53,913 INFO L87 Difference]: Start difference. First operand 163 states and 181 transitions. Second operand has 86 states, 86 states have (on average 1.2209302325581395) internal successors, (105), 86 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 01:37:07,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 01:37:07,621 INFO L93 Difference]: Finished difference Result 246 states and 271 transitions. [2021-12-17 01:37:07,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2021-12-17 01:37:07,623 INFO L78 Accepts]: Start accepts. Automaton has has 86 states, 86 states have (on average 1.2209302325581395) internal successors, (105), 86 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 56 [2021-12-17 01:37:07,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 01:37:07,623 INFO L225 Difference]: With dead ends: 246 [2021-12-17 01:37:07,623 INFO L226 Difference]: Without dead ends: 186 [2021-12-17 01:37:07,624 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3373 ImplicationChecksByTransitivity, 26.0s TimeCoverageRelationStatistics Valid=747, Invalid=9555, Unknown=0, NotChecked=0, Total=10302 [2021-12-17 01:37:07,625 INFO L933 BasicCegarLoop]: 19 mSDtfsCounter, 12 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 1899 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 2159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 1899 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 171 IncrementalHoareTripleChecker+Unchecked, 8.6s IncrementalHoareTripleChecker+Time [2021-12-17 01:37:07,625 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 275 Invalid, 2159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 1899 Invalid, 0 Unknown, 171 Unchecked, 8.6s Time] [2021-12-17 01:37:07,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2021-12-17 01:37:07,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 182. [2021-12-17 01:37:07,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 181 states have (on average 1.1160220994475138) internal successors, (202), 181 states have internal predecessors, (202), 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 01:37:07,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 202 transitions. [2021-12-17 01:37:07,648 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 202 transitions. Word has length 56 [2021-12-17 01:37:07,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 01:37:07,649 INFO L470 AbstractCegarLoop]: Abstraction has 182 states and 202 transitions. [2021-12-17 01:37:07,649 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 86 states, 86 states have (on average 1.2209302325581395) internal successors, (105), 86 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 01:37:07,649 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 202 transitions. [2021-12-17 01:37:07,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-12-17 01:37:07,649 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 01:37:07,650 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 01:37:07,668 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2021-12-17 01:37:07,866 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2021-12-17 01:37:07,867 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 01:37:07,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 01:37:07,867 INFO L85 PathProgramCache]: Analyzing trace with hash -1789277574, now seen corresponding path program 7 times [2021-12-17 01:37:07,867 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 01:37:07,867 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195133474] [2021-12-17 01:37:07,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 01:37:07,868 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 01:37:07,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 01:37:09,241 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 1 proven. 76 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-12-17 01:37:09,241 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 01:37:09,241 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195133474] [2021-12-17 01:37:09,241 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1195133474] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 01:37:09,241 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [77371121] [2021-12-17 01:37:09,241 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-12-17 01:37:09,241 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 01:37:09,241 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 01:37:09,242 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-17 01:37:09,243 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2021-12-17 01:37:09,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 01:37:09,363 INFO L263 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 56 conjunts are in the unsatisfiable core [2021-12-17 01:37:09,365 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 01:37:09,372 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 01:37:09,452 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 01:37:09,526 INFO L354 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2021-12-17 01:37:09,526 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 25 treesize of output 24 [2021-12-17 01:37:09,572 INFO L354 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2021-12-17 01:37:09,573 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 25 treesize of output 24 [2021-12-17 01:37:09,619 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 0 case distinctions, treesize of input 16 treesize of output 18 [2021-12-17 01:37:09,630 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 0 case distinctions, treesize of input 16 treesize of output 18 [2021-12-17 01:37:09,642 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 0 case distinctions, treesize of input 16 treesize of output 18 [2021-12-17 01:37:09,652 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 0 case distinctions, treesize of input 16 treesize of output 18 [2021-12-17 01:37:09,664 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 0 case distinctions, treesize of input 16 treesize of output 18 [2021-12-17 01:37:09,738 INFO L354 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2021-12-17 01:37:09,739 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2021-12-17 01:37:09,792 INFO L354 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2021-12-17 01:37:09,792 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2021-12-17 01:37:09,842 INFO L354 Elim1Store]: treesize reduction 53, result has 5.4 percent of original size [2021-12-17 01:37:09,843 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 20 [2021-12-17 01:37:09,916 INFO L354 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2021-12-17 01:37:09,917 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2021-12-17 01:37:09,971 INFO L354 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2021-12-17 01:37:09,971 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2021-12-17 01:37:10,148 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 3 proven. 74 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-12-17 01:37:10,148 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 01:37:12,373 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_511| Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_511| (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (forall ((v_ArrVal_1598 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_511| 4)) v_ArrVal_1598) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8)) 0)))) is different from false [2021-12-17 01:37:32,984 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_512| Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_512| (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (forall ((|v_ULTIMATE.start_main_~i~0#1_511| Int) (v_ArrVal_1595 Int) (v_ArrVal_1598 Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_511| (+ |v_ULTIMATE.start_main_~i~0#1_512| 1)) (= (select (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_512| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1595) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_511| 4)) v_ArrVal_1598) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8)) 0))))) is different from false [2021-12-17 01:37:35,009 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_512| Int) (|v_ULTIMATE.start_main_~i~0#1_511| Int) (v_ArrVal_1595 Int) (v_ArrVal_1598 Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_512| (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (= (select (store (store (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse1 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|))) (store .cse0 .cse1 (+ (select .cse0 .cse1) (- 1)))) (+ (* |v_ULTIMATE.start_main_~i~0#1_512| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1595) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_511| 4)) v_ArrVal_1598) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8)) 0) (< |v_ULTIMATE.start_main_~i~0#1_511| (+ |v_ULTIMATE.start_main_~i~0#1_512| 1)))) is different from false [2021-12-17 01:37:37,053 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_512| Int) (|v_ULTIMATE.start_main_~i~0#1_511| Int) (v_ArrVal_1595 Int) (v_ArrVal_1598 Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_512| (+ |c_ULTIMATE.start_main_~i~0#1| 2)) (= (select (store (store (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse1 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (store .cse0 .cse1 (+ (select .cse0 .cse1) (- 1)))) (+ (* |v_ULTIMATE.start_main_~i~0#1_512| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1595) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_511| 4)) v_ArrVal_1598) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8)) 0) (< |v_ULTIMATE.start_main_~i~0#1_511| (+ |v_ULTIMATE.start_main_~i~0#1_512| 1)))) is different from false [2021-12-17 01:37:39,083 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_512| Int) (v_ArrVal_1591 Int) (|v_ULTIMATE.start_main_~i~0#1_511| Int) (v_ArrVal_1595 Int) (v_ArrVal_1598 Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_512| (+ |c_ULTIMATE.start_main_~i~0#1| 2)) (= (select (store (store (let ((.cse2 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse0 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse2 |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1591)) (.cse1 (+ .cse2 |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (store .cse0 .cse1 (+ (select .cse0 .cse1) (- 1))))) (+ (* |v_ULTIMATE.start_main_~i~0#1_512| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1595) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_511| 4)) v_ArrVal_1598) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8)) 0) (< |v_ULTIMATE.start_main_~i~0#1_511| (+ |v_ULTIMATE.start_main_~i~0#1_512| 1)))) is different from false [2021-12-17 01:37:41,134 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_512| Int) (v_ArrVal_1591 Int) (|v_ULTIMATE.start_main_~i~0#1_511| Int) (v_ArrVal_1595 Int) (v_ArrVal_1598 Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_511| (+ |v_ULTIMATE.start_main_~i~0#1_512| 1)) (= (select (store (store (let ((.cse2 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse0 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse2 |c_ULTIMATE.start_main_~a~0#1.offset| 4) v_ArrVal_1591)) (.cse1 (+ .cse2 |c_ULTIMATE.start_main_~a~0#1.offset| 8))) (store .cse0 .cse1 (+ (select .cse0 .cse1) (- 1))))) (+ (* |v_ULTIMATE.start_main_~i~0#1_512| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1595) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_511| 4)) v_ArrVal_1598) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8)) 0) (< |v_ULTIMATE.start_main_~i~0#1_512| (+ |c_ULTIMATE.start_main_~i~0#1| 3)))) is different from false [2021-12-17 01:37:43,171 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1590 Int) (|v_ULTIMATE.start_main_~i~0#1_512| Int) (v_ArrVal_1591 Int) (|v_ULTIMATE.start_main_~i~0#1_511| Int) (v_ArrVal_1595 Int) (v_ArrVal_1598 Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_511| (+ |v_ULTIMATE.start_main_~i~0#1_512| 1)) (= (select (store (store (let ((.cse2 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse0 (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse2 |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1590) (+ .cse2 |c_ULTIMATE.start_main_~a~0#1.offset| 4) v_ArrVal_1591)) (.cse1 (+ .cse2 |c_ULTIMATE.start_main_~a~0#1.offset| 8))) (store .cse0 .cse1 (+ (select .cse0 .cse1) (- 1))))) (+ (* |v_ULTIMATE.start_main_~i~0#1_512| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1595) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_511| 4)) v_ArrVal_1598) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8)) 0) (< |v_ULTIMATE.start_main_~i~0#1_512| (+ |c_ULTIMATE.start_main_~i~0#1| 3)))) is different from false [2021-12-17 01:37:43,873 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1588 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1588) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8)) 1)) is different from false [2021-12-17 01:37:43,900 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1583 Int) (v_ArrVal_1588 (Array Int Int))) (= (select (select (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| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1583)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1588) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8)) 1)) is different from false [2021-12-17 01:37:43,911 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_523| Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_523| (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (forall ((v_ArrVal_1583 Int) (v_ArrVal_1588 (Array Int Int))) (= (select (select (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|) (+ (* |v_ULTIMATE.start_main_~i~0#1_523| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1583)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1588) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8)) 1)))) is different from false [2021-12-17 01:37:43,922 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1581 Int) (|v_ULTIMATE.start_main_~i~0#1_523| Int) (v_ArrVal_1583 Int) (v_ArrVal_1588 (Array Int Int))) (or (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1581) (+ (* |v_ULTIMATE.start_main_~i~0#1_523| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1583)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1588) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8)) 1) (< |v_ULTIMATE.start_main_~i~0#1_523| (+ |c_ULTIMATE.start_main_~i~0#1| 1)))) is different from false [2021-12-17 01:37:43,944 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_524| Int)) (or (forall ((v_ArrVal_1581 Int) (|v_ULTIMATE.start_main_~i~0#1_523| Int) (v_ArrVal_1583 Int) (v_ArrVal_1588 (Array Int Int))) (or (< |v_ULTIMATE.start_main_~i~0#1_523| (+ |v_ULTIMATE.start_main_~i~0#1_524| 1)) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (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_524| 4)) v_ArrVal_1581) (+ (* |v_ULTIMATE.start_main_~i~0#1_523| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1583)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1588) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8)) 1))) (< |v_ULTIMATE.start_main_~i~0#1_524| (+ |c_ULTIMATE.start_main_~i~0#1| 1)))) is different from false [2021-12-17 01:37:43,975 INFO L354 Elim1Store]: treesize reduction 122, result has 23.3 percent of original size [2021-12-17 01:37:43,975 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 38 treesize of output 49 [2021-12-17 01:37:43,982 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-17 01:37:43,982 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 38 treesize of output 38 [2021-12-17 01:37:43,987 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 11 treesize of output 7 [2021-12-17 01:37:44,033 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 16 trivial. 61 not checked. [2021-12-17 01:37:44,033 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [77371121] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 01:37:44,034 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-17 01:37:44,034 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 20, 25] total 65 [2021-12-17 01:37:44,034 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971935032] [2021-12-17 01:37:44,034 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-17 01:37:44,034 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 65 states [2021-12-17 01:37:44,034 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 01:37:44,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2021-12-17 01:37:44,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=303, Invalid=2456, Unknown=45, NotChecked=1356, Total=4160 [2021-12-17 01:37:44,035 INFO L87 Difference]: Start difference. First operand 182 states and 202 transitions. Second operand has 65 states, 65 states have (on average 2.046153846153846) internal successors, (133), 65 states have internal predecessors, (133), 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 01:37:46,142 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse1 (select .cse0 0))) (and (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= (select .cse0 4) .cse1) (= (select .cse0 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|)) 1) (= .cse1 1) (forall ((|v_ULTIMATE.start_main_~i~0#1_524| Int)) (or (forall ((v_ArrVal_1581 Int) (|v_ULTIMATE.start_main_~i~0#1_523| Int) (v_ArrVal_1583 Int) (v_ArrVal_1588 (Array Int Int))) (or (< |v_ULTIMATE.start_main_~i~0#1_523| (+ |v_ULTIMATE.start_main_~i~0#1_524| 1)) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (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_524| 4)) v_ArrVal_1581) (+ (* |v_ULTIMATE.start_main_~i~0#1_523| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1583)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1588) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8)) 1))) (< |v_ULTIMATE.start_main_~i~0#1_524| (+ |c_ULTIMATE.start_main_~i~0#1| 1)))) (<= 2 |c_ULTIMATE.start_main_~i~0#1|) (<= (+ (* 4 |c_ULTIMATE.start_main_~i~0#1|) |c_ULTIMATE.start_main_~a~0#1.offset|) 8) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|))))) is different from false [2021-12-17 01:37:48,172 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse1 (select .cse0 8)) (.cse2 (select .cse0 0))) (and (forall ((|v_ULTIMATE.start_main_~i~0#1_523| Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_523| (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (forall ((v_ArrVal_1583 Int) (v_ArrVal_1588 (Array Int Int))) (= (select (select (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|) (+ (* |v_ULTIMATE.start_main_~i~0#1_523| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1583)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1588) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8)) 1)))) (<= (+ (div (+ (* |c_ULTIMATE.start_main_~a~0#1.offset| (- 1)) 8) 4) 1) |c_ULTIMATE.start_main_~i~0#1|) (or (not (= 0 (select .cse0 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|)))) (and (<= |c_ULTIMATE.start_main_~i~0#1| 1) (= .cse1 0) (<= 1 |c_ULTIMATE.start_main_~i~0#1|))) (= .cse1 1) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= (select .cse0 4) .cse2) (= .cse2 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 01:37:53,962 WARN L227 SmtUtils]: Spent 5.21s on a formula simplification. DAG size of input: 71 DAG size of output: 50 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-17 01:37:59,059 WARN L227 SmtUtils]: Spent 5.06s on a formula simplification. DAG size of input: 61 DAG size of output: 47 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-17 01:38:01,703 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse3 (* 4 |c_ULTIMATE.start_main_~i~0#1|)) (.cse0 (* |c_ULTIMATE.start_main_~a~0#1.offset| (- 1))) (.cse4 (not (= 0 (select .cse7 4))))) (let ((.cse1 (= (select .cse7 8) 0)) (.cse2 (and (<= (+ (div (+ .cse0 4) 4) 4) c_~N~0) .cse4)) (.cse6 (= (select .cse7 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|)) 0)) (.cse5 (+ .cse3 |c_ULTIMATE.start_main_~a~0#1.offset|))) (and (forall ((|v_ULTIMATE.start_main_~i~0#1_512| Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_512| (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (forall ((|v_ULTIMATE.start_main_~i~0#1_511| Int) (v_ArrVal_1595 Int) (v_ArrVal_1598 Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_511| (+ |v_ULTIMATE.start_main_~i~0#1_512| 1)) (= (select (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_512| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1595) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_511| 4)) v_ArrVal_1598) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8)) 0))))) (or (and (<= (+ (div (+ .cse0 8) 4) 1) |c_ULTIMATE.start_main_~i~0#1|) .cse1) .cse2 (<= (+ .cse3 |c_ULTIMATE.start_main_~a~0#1.offset| 9) (* 4 c_~N~0))) (or .cse4 .cse1) (or (< 7 .cse5) (<= 5 c_~N~0)) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (or (<= (+ |c_ULTIMATE.start_main_~i~0#1| 4) c_~N~0) .cse2 .cse6) (not (= |c_ULTIMATE.start_main_~a~0#1.base| |c_ULTIMATE.start_main_~#sum~0#1.base|)) .cse6 (= |c_ULTIMATE.start_main_~i~0#1| 2) (<= .cse5 8) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)))))) is different from false [2021-12-17 01:38:03,796 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse2 (not (= 0 (select .cse3 4)))) (.cse1 (= (select .cse3 8) 0))) (and (let ((.cse0 (* |c_ULTIMATE.start_main_~a~0#1.offset| (- 1)))) (or (and (<= (+ (div (+ .cse0 8) 4) 1) |c_ULTIMATE.start_main_~i~0#1|) .cse1) (and (<= (+ (div (+ .cse0 4) 4) 4) c_~N~0) .cse2) (<= (+ (* 4 |c_ULTIMATE.start_main_~i~0#1|) |c_ULTIMATE.start_main_~a~0#1.offset| 9) (* 4 c_~N~0)))) (<= 3 |c_ULTIMATE.start_main_~i~0#1|) (or .cse2 .cse1) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= (select .cse3 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8)) 0) (forall ((|v_ULTIMATE.start_main_~i~0#1_511| Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_511| (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (forall ((v_ArrVal_1598 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_511| 4)) v_ArrVal_1598) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8)) 0)))) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|))))) is different from false [2021-12-17 01:38:04,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 01:38:04,432 INFO L93 Difference]: Finished difference Result 215 states and 237 transitions. [2021-12-17 01:38:04,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2021-12-17 01:38:04,433 INFO L78 Accepts]: Start accepts. Automaton has has 65 states, 65 states have (on average 2.046153846153846) internal successors, (133), 65 states have internal predecessors, (133), 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 57 [2021-12-17 01:38:04,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 01:38:04,434 INFO L225 Difference]: With dead ends: 215 [2021-12-17 01:38:04,434 INFO L226 Difference]: Without dead ends: 213 [2021-12-17 01:38:04,434 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 81 SyntacticMatches, 19 SemanticMatches, 93 ConstructedPredicates, 16 IntricatePredicates, 2 DeprecatedPredicates, 2116 ImplicationChecksByTransitivity, 54.5s TimeCoverageRelationStatistics Valid=728, Invalid=5449, Unknown=49, NotChecked=2704, Total=8930 [2021-12-17 01:38:04,435 INFO L933 BasicCegarLoop]: 23 mSDtfsCounter, 122 mSDsluCounter, 370 mSDsCounter, 0 mSdLazyCounter, 835 mSolverCounterSat, 167 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 393 SdHoareTripleChecker+Invalid, 1743 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 167 IncrementalHoareTripleChecker+Valid, 835 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 741 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-17 01:38:04,435 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [122 Valid, 393 Invalid, 1743 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [167 Valid, 835 Invalid, 0 Unknown, 741 Unchecked, 0.4s Time] [2021-12-17 01:38:04,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2021-12-17 01:38:04,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 190. [2021-12-17 01:38:04,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 189 states have (on average 1.1111111111111112) internal successors, (210), 189 states have internal predecessors, (210), 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 01:38:04,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 210 transitions. [2021-12-17 01:38:04,454 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 210 transitions. Word has length 57 [2021-12-17 01:38:04,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 01:38:04,454 INFO L470 AbstractCegarLoop]: Abstraction has 190 states and 210 transitions. [2021-12-17 01:38:04,454 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 65 states, 65 states have (on average 2.046153846153846) internal successors, (133), 65 states have internal predecessors, (133), 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 01:38:04,455 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 210 transitions. [2021-12-17 01:38:04,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-12-17 01:38:04,455 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 01:38:04,455 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 01:38:04,472 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2021-12-17 01:38:04,663 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2021-12-17 01:38:04,663 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 01:38:04,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 01:38:04,663 INFO L85 PathProgramCache]: Analyzing trace with hash 1311510858, now seen corresponding path program 15 times [2021-12-17 01:38:04,663 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 01:38:04,663 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321812843] [2021-12-17 01:38:04,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 01:38:04,664 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 01:38:04,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 01:38:04,785 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 38 proven. 47 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2021-12-17 01:38:04,785 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 01:38:04,786 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321812843] [2021-12-17 01:38:04,786 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [321812843] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 01:38:04,786 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [691130835] [2021-12-17 01:38:04,786 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-17 01:38:04,786 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 01:38:04,786 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 01:38:04,787 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-17 01:38:04,787 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2021-12-17 01:38:05,175 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2021-12-17 01:38:05,176 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 01:38:05,178 INFO L263 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 16 conjunts are in the unsatisfiable core [2021-12-17 01:38:05,178 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 01:38:05,436 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 36 proven. 64 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2021-12-17 01:38:05,436 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 01:38:05,605 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 36 proven. 64 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2021-12-17 01:38:05,605 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [691130835] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 01:38:05,606 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-17 01:38:05,606 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 39 [2021-12-17 01:38:05,606 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734644961] [2021-12-17 01:38:05,606 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-17 01:38:05,606 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2021-12-17 01:38:05,606 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 01:38:05,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2021-12-17 01:38:05,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=246, Invalid=1236, Unknown=0, NotChecked=0, Total=1482 [2021-12-17 01:38:05,607 INFO L87 Difference]: Start difference. First operand 190 states and 210 transitions. Second operand has 39 states, 39 states have (on average 2.641025641025641) internal successors, (103), 39 states have internal predecessors, (103), 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 01:38:06,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 01:38:06,741 INFO L93 Difference]: Finished difference Result 412 states and 445 transitions. [2021-12-17 01:38:06,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2021-12-17 01:38:06,742 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 2.641025641025641) internal successors, (103), 39 states have internal predecessors, (103), 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 58 [2021-12-17 01:38:06,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 01:38:06,742 INFO L225 Difference]: With dead ends: 412 [2021-12-17 01:38:06,742 INFO L226 Difference]: Without dead ends: 282 [2021-12-17 01:38:06,743 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2292 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=957, Invalid=6015, Unknown=0, NotChecked=0, Total=6972 [2021-12-17 01:38:06,743 INFO L933 BasicCegarLoop]: 60 mSDtfsCounter, 1050 mSDsluCounter, 482 mSDsCounter, 0 mSdLazyCounter, 1435 mSolverCounterSat, 479 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1050 SdHoareTripleChecker+Valid, 542 SdHoareTripleChecker+Invalid, 1914 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 479 IncrementalHoareTripleChecker+Valid, 1435 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2021-12-17 01:38:06,743 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1050 Valid, 542 Invalid, 1914 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [479 Valid, 1435 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2021-12-17 01:38:06,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2021-12-17 01:38:06,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 194. [2021-12-17 01:38:06,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 193 states have (on average 1.0569948186528497) internal successors, (204), 193 states have internal predecessors, (204), 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 01:38:06,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 204 transitions. [2021-12-17 01:38:06,764 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 204 transitions. Word has length 58 [2021-12-17 01:38:06,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 01:38:06,764 INFO L470 AbstractCegarLoop]: Abstraction has 194 states and 204 transitions. [2021-12-17 01:38:06,764 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 2.641025641025641) internal successors, (103), 39 states have internal predecessors, (103), 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 01:38:06,765 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 204 transitions. [2021-12-17 01:38:06,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-12-17 01:38:06,765 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 01:38:06,765 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 01:38:06,785 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2021-12-17 01:38:06,979 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2021-12-17 01:38:06,979 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 01:38:06,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 01:38:06,980 INFO L85 PathProgramCache]: Analyzing trace with hash 1863355440, now seen corresponding path program 8 times [2021-12-17 01:38:06,980 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 01:38:06,980 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706954164] [2021-12-17 01:38:06,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 01:38:06,980 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 01:38:06,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 01:38:07,545 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2021-12-17 01:38:07,545 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 01:38:07,545 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706954164] [2021-12-17 01:38:07,545 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [706954164] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 01:38:07,545 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [141327871] [2021-12-17 01:38:07,545 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-17 01:38:07,545 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 01:38:07,546 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 01:38:07,546 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-17 01:38:07,547 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2021-12-17 01:38:07,660 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-17 01:38:07,660 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 01:38:07,662 INFO L263 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 66 conjunts are in the unsatisfiable core [2021-12-17 01:38:07,665 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 01:38:07,781 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 15 treesize of output 11 [2021-12-17 01:38:07,836 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:38:07,837 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 0 case distinctions, treesize of input 25 treesize of output 24 [2021-12-17 01:38:07,905 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:38:07,905 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 0 case distinctions, treesize of input 16 treesize of output 18 [2021-12-17 01:38:07,944 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:38:07,944 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 0 case distinctions, treesize of input 16 treesize of output 18 [2021-12-17 01:38:07,987 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:38:07,987 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 0 case distinctions, treesize of input 16 treesize of output 18 [2021-12-17 01:38:08,001 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:38:08,001 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 0 case distinctions, treesize of input 16 treesize of output 18 [2021-12-17 01:38:08,013 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:38:08,014 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 0 case distinctions, treesize of input 16 treesize of output 18 [2021-12-17 01:38:08,070 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:38:08,070 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 0 case distinctions, treesize of input 25 treesize of output 24 [2021-12-17 01:38:08,115 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:38:08,115 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 0 case distinctions, treesize of input 25 treesize of output 24 [2021-12-17 01:38:08,158 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:38:08,158 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 0 case distinctions, treesize of input 25 treesize of output 24 [2021-12-17 01:38:08,202 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 01:38:08,204 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-17 01:38:08,204 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 35 treesize of output 31 [2021-12-17 01:38:08,262 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:38:08,263 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 0 case distinctions, treesize of input 25 treesize of output 24 [2021-12-17 01:38:08,416 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 0 proven. 102 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-17 01:38:08,416 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 01:38:10,602 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_575| Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_575| (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (forall ((v_ArrVal_1780 Int)) (= 0 (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_575| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1780) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 12)))))) is different from false [2021-12-17 01:38:11,202 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_575| Int) (v_ArrVal_1780 Int)) (or (= 0 (select (store (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse1 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|))) (store .cse0 .cse1 (+ (select .cse0 .cse1) (- 1)))) (+ (* |v_ULTIMATE.start_main_~i~0#1_575| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1780) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 12))) (< |v_ULTIMATE.start_main_~i~0#1_575| (+ |c_ULTIMATE.start_main_~i~0#1| 1)))) is different from false [2021-12-17 01:38:11,860 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_575| Int) (v_ArrVal_1780 Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_575| (+ |c_ULTIMATE.start_main_~i~0#1| 2)) (= 0 (select (store (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse1 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (store .cse0 .cse1 (+ (select .cse0 .cse1) (- 1)))) (+ (* |v_ULTIMATE.start_main_~i~0#1_575| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1780) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 12))))) is different from false [2021-12-17 01:38:12,554 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_575| Int) (v_ArrVal_1780 Int) (v_ArrVal_1777 Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_575| (+ |c_ULTIMATE.start_main_~i~0#1| 2)) (= 0 (select (store (let ((.cse2 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse0 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse2 |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1777)) (.cse1 (+ .cse2 |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (store .cse0 .cse1 (+ (select .cse0 .cse1) (- 1))))) (+ (* |v_ULTIMATE.start_main_~i~0#1_575| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1780) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 12))))) is different from false [2021-12-17 01:38:33,361 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_575| Int) (v_ArrVal_1780 Int) (v_ArrVal_1771 (Array Int Int)) (v_ArrVal_1773 Int) (v_ArrVal_1775 Int) (v_ArrVal_1777 Int)) (or (= 0 (let ((.cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 12))) (select (store (let ((.cse0 (store (store (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1771) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset| v_ArrVal_1773) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4) v_ArrVal_1775) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8) v_ArrVal_1777))) (store .cse0 .cse1 (+ (select .cse0 .cse1) (- 1)))) (+ (* |v_ULTIMATE.start_main_~i~0#1_575| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1780) .cse1))) (< |v_ULTIMATE.start_main_~i~0#1_575| 4))) is different from false [2021-12-17 01:38:33,465 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_575| Int) (v_ArrVal_1780 Int) (v_ArrVal_1771 (Array Int Int)) (v_ArrVal_1773 Int) (v_ArrVal_1775 Int) (v_ArrVal_1766 Int) (v_ArrVal_1777 Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_575| 4) (= 0 (let ((.cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 12))) (select (store (let ((.cse0 (store (store (store (select (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| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1766)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1771) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset| v_ArrVal_1773) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4) v_ArrVal_1775) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8) v_ArrVal_1777))) (store .cse0 .cse1 (+ (select .cse0 .cse1) (- 1)))) (+ (* |v_ULTIMATE.start_main_~i~0#1_575| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1780) .cse1))))) is different from false [2021-12-17 01:38:33,496 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_587| Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_587| (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (forall ((|v_ULTIMATE.start_main_~i~0#1_575| Int) (v_ArrVal_1780 Int) (v_ArrVal_1771 (Array Int Int)) (v_ArrVal_1773 Int) (v_ArrVal_1775 Int) (v_ArrVal_1766 Int) (v_ArrVal_1777 Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_575| 4) (= 0 (let ((.cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 12))) (select (store (let ((.cse0 (store (store (store (select (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|) (+ (* |v_ULTIMATE.start_main_~i~0#1_587| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1766)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1771) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset| v_ArrVal_1773) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4) v_ArrVal_1775) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8) v_ArrVal_1777))) (store .cse0 .cse1 (+ (select .cse0 .cse1) (- 1)))) (+ (* |v_ULTIMATE.start_main_~i~0#1_575| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1780) .cse1))))))) is different from false [2021-12-17 01:38:33,516 INFO L354 Elim1Store]: treesize reduction 37, result has 40.3 percent of original size [2021-12-17 01:38:33,516 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 2 case distinctions, treesize of input 99 treesize of output 86 [2021-12-17 01:38:33,520 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 128 treesize of output 122 [2021-12-17 01:38:33,522 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 01:38:33,522 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 01:38:33,523 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 01:38:33,523 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 01:38:33,528 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-17 01:38:33,528 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 25 treesize of output 29 [2021-12-17 01:38:33,530 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 01:38:33,530 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 01:38:33,531 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 01:38:33,531 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 01:38:33,532 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 13 treesize of output 9 [2021-12-17 01:38:33,656 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 16 trivial. 48 not checked. [2021-12-17 01:38:33,656 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [141327871] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 01:38:33,656 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-17 01:38:33,657 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 24, 25] total 61 [2021-12-17 01:38:33,657 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902979427] [2021-12-17 01:38:33,657 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-17 01:38:33,657 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 61 states [2021-12-17 01:38:33,657 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 01:38:33,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2021-12-17 01:38:33,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=273, Invalid=2584, Unknown=33, NotChecked=770, Total=3660 [2021-12-17 01:38:33,658 INFO L87 Difference]: Start difference. First operand 194 states and 204 transitions. Second operand has 61 states, 61 states have (on average 2.360655737704918) internal successors, (144), 61 states have internal predecessors, (144), 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 01:38:35,717 WARN L838 $PredicateComparison]: unable to prove that (and (< (+ |c_ULTIMATE.start_main_~a~0#1.base| 1) |c_ULTIMATE.start_main_~#sum~0#1.base|) (forall ((|v_ULTIMATE.start_main_~i~0#1_587| Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_587| (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (forall ((|v_ULTIMATE.start_main_~i~0#1_575| Int) (v_ArrVal_1780 Int) (v_ArrVal_1771 (Array Int Int)) (v_ArrVal_1773 Int) (v_ArrVal_1775 Int) (v_ArrVal_1766 Int) (v_ArrVal_1777 Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_575| 4) (= 0 (let ((.cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 12))) (select (store (let ((.cse0 (store (store (store (select (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|) (+ (* |v_ULTIMATE.start_main_~i~0#1_587| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1766)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1771) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset| v_ArrVal_1773) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4) v_ArrVal_1775) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8) v_ArrVal_1777))) (store .cse0 .cse1 (+ (select .cse0 .cse1) (- 1)))) (+ (* |v_ULTIMATE.start_main_~i~0#1_575| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1780) .cse1))))))) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= |c_ULTIMATE.start_main_~i~0#1| 3) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|)) 1)) is different from false [2021-12-17 01:38:38,215 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (+ (* 4 |c_ULTIMATE.start_main_~i~0#1|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (and (forall ((|v_ULTIMATE.start_main_~i~0#1_575| Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_575| (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (forall ((v_ArrVal_1780 Int)) (= 0 (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_575| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1780) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 12)))))) (<= .cse0 12) (< (+ |c_ULTIMATE.start_main_~a~0#1.base| 1) |c_ULTIMATE.start_main_~#sum~0#1.base|) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= |c_ULTIMATE.start_main_~i~0#1| 3) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|)) 0) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (< 11 .cse0))) is different from false [2021-12-17 01:38:38,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 01:38:38,629 INFO L93 Difference]: Finished difference Result 218 states and 227 transitions. [2021-12-17 01:38:38,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-12-17 01:38:38,630 INFO L78 Accepts]: Start accepts. Automaton has has 61 states, 61 states have (on average 2.360655737704918) internal successors, (144), 61 states have internal predecessors, (144), 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 61 [2021-12-17 01:38:38,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 01:38:38,631 INFO L225 Difference]: With dead ends: 218 [2021-12-17 01:38:38,631 INFO L226 Difference]: Without dead ends: 216 [2021-12-17 01:38:38,632 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 90 SyntacticMatches, 21 SemanticMatches, 72 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 1796 ImplicationChecksByTransitivity, 30.0s TimeCoverageRelationStatistics Valid=412, Invalid=3749, Unknown=35, NotChecked=1206, Total=5402 [2021-12-17 01:38:38,632 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 87 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 844 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 335 SdHoareTripleChecker+Invalid, 1598 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 844 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 674 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-17 01:38:38,632 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [87 Valid, 335 Invalid, 1598 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 844 Invalid, 0 Unknown, 674 Unchecked, 0.4s Time] [2021-12-17 01:38:38,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2021-12-17 01:38:38,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 209. [2021-12-17 01:38:38,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 208 states have (on average 1.0528846153846154) internal successors, (219), 208 states have internal predecessors, (219), 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 01:38:38,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 219 transitions. [2021-12-17 01:38:38,654 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 219 transitions. Word has length 61 [2021-12-17 01:38:38,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 01:38:38,654 INFO L470 AbstractCegarLoop]: Abstraction has 209 states and 219 transitions. [2021-12-17 01:38:38,655 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 61 states, 61 states have (on average 2.360655737704918) internal successors, (144), 61 states have internal predecessors, (144), 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 01:38:38,655 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 219 transitions. [2021-12-17 01:38:38,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-12-17 01:38:38,655 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 01:38:38,655 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 01:38:38,672 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2021-12-17 01:38:38,855 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2021-12-17 01:38:38,856 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 01:38:38,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 01:38:38,856 INFO L85 PathProgramCache]: Analyzing trace with hash 1287410584, now seen corresponding path program 16 times [2021-12-17 01:38:38,856 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 01:38:38,856 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697007450] [2021-12-17 01:38:38,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 01:38:38,857 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 01:38:38,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 01:38:41,070 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 13 proven. 98 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2021-12-17 01:38:41,070 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 01:38:41,070 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697007450] [2021-12-17 01:38:41,070 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1697007450] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 01:38:41,070 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2114289532] [2021-12-17 01:38:41,070 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-12-17 01:38:41,071 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 01:38:41,071 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 01:38:41,071 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-17 01:38:41,072 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2021-12-17 01:38:41,185 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-12-17 01:38:41,185 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 01:38:41,187 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 102 conjunts are in the unsatisfiable core [2021-12-17 01:38:41,194 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 01:38:41,206 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 01:38:41,246 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:38:41,246 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 0 case distinctions, treesize of input 23 treesize of output 22 [2021-12-17 01:38:41,348 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:38:41,349 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:38:41,350 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2021-12-17 01:38:41,454 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:38:41,455 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:38:41,456 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:38:41,456 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:38:41,457 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 42 treesize of output 47 [2021-12-17 01:38:41,580 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:38:41,580 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:38:41,581 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:38:41,582 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:38:41,582 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:38:41,583 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:38:41,583 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:38:41,584 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 62 [2021-12-17 01:38:41,721 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:38:41,722 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:38:41,723 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:38:41,723 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:38:41,724 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:38:41,724 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:38:41,725 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:38:41,725 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:38:41,726 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:38:41,726 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:38:41,727 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:38:41,727 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 68 [2021-12-17 01:38:41,865 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:38:41,865 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:38:41,866 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:38:41,866 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:38:41,867 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:38:41,867 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:38:41,868 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:38:41,868 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:38:41,869 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:38:41,869 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:38:41,870 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:38:41,870 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:38:41,871 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:38:41,872 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:38:41,872 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:38:41,873 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:38:41,873 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 83 [2021-12-17 01:38:42,031 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:38:42,031 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:38:42,032 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:38:42,032 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:38:42,033 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:38:42,034 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:38:42,034 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:38:42,035 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:38:42,035 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:38:42,036 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:38:42,036 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:38:42,037 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:38:42,037 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:38:42,038 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:38:42,038 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:38:42,039 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:38:42,039 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:38:42,040 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:38:42,040 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:38:42,041 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:38:42,041 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:38:42,042 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:38:42,046 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 22 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 98 [2021-12-17 01:38:42,400 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:38:42,401 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:38:42,401 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 01:38:42,402 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:38:42,402 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:38:42,403 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:38:42,403 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:38:42,404 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:38:42,404 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:38:42,405 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:38:42,405 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:38:42,406 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:38:42,406 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:38:42,407 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:38:42,407 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:38:42,408 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:38:42,408 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:38:42,409 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:38:42,409 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:38:42,410 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:38:42,410 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:38:42,411 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:38:42,411 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:38:42,412 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 22 disjoint index pairs (out of 36 index pairs), introduced 8 new quantified variables, introduced 0 case distinctions, treesize of input 94 treesize of output 99 [2021-12-17 01:38:42,589 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:38:42,589 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:38:42,590 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:38:42,591 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:38:42,591 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:38:42,592 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:38:42,592 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:38:42,593 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:38:42,593 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 01:38:42,593 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:38:42,594 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:38:42,595 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:38:42,595 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:38:42,596 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:38:42,596 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:38:42,597 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:38:42,597 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:38:42,598 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:38:42,598 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:38:42,599 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:38:42,599 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:38:42,600 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:38:42,601 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:38:42,601 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:38:42,602 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 22 disjoint index pairs (out of 36 index pairs), introduced 8 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 97 [2021-12-17 01:38:42,787 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:38:42,788 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:38:42,789 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:38:42,789 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:38:42,790 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:38:42,790 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:38:42,791 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:38:42,792 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:38:42,792 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:38:42,793 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:38:42,793 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:38:42,794 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:38:42,794 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:38:42,795 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:38:42,795 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:38:42,796 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:38:42,796 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:38:42,797 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 01:38:42,798 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:38:42,798 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:38:42,799 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:38:42,799 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:38:42,800 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:38:42,801 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:38:42,801 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:38:42,802 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 22 disjoint index pairs (out of 36 index pairs), introduced 8 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 99 [2021-12-17 01:38:42,996 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:38:42,997 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:38:42,998 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:38:42,998 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:38:42,999 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:38:42,999 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:38:43,000 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:38:43,001 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:38:43,001 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:38:43,002 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:38:43,002 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:38:43,003 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:38:43,003 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:38:43,004 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:38:43,004 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:38:43,005 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:38:43,005 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 01:38:43,006 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:38:43,006 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:38:43,007 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:38:43,008 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:38:43,008 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:38:43,009 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:38:43,009 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:38:43,010 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:38:43,011 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 22 disjoint index pairs (out of 36 index pairs), introduced 8 new quantified variables, introduced 0 case distinctions, treesize of input 100 treesize of output 99 [2021-12-17 01:38:43,243 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:38:43,243 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:38:43,244 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:38:43,245 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:38:43,245 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:38:43,246 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:38:43,246 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:38:43,247 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:38:43,247 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:38:43,248 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:38:43,248 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:38:43,249 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:38:43,249 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:38:43,250 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:38:43,250 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 01:38:43,251 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:38:43,251 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:38:43,252 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:38:43,252 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:38:43,253 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:38:43,253 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:38:43,254 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:38:43,254 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:38:43,255 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:38:43,255 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:38:43,256 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 22 disjoint index pairs (out of 36 index pairs), introduced 8 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 99 [2021-12-17 01:38:43,483 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:38:43,484 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:38:43,484 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:38:43,485 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:38:43,486 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:38:43,486 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:38:43,487 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:38:43,487 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:38:43,488 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:38:43,488 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:38:43,489 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:38:43,489 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:38:43,490 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:38:43,490 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:38:43,491 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:38:43,491 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 01:38:43,492 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:38:43,493 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:38:43,493 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:38:43,494 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:38:43,494 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:38:43,495 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:38:43,495 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:38:43,496 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:38:43,496 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:38:43,500 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 22 disjoint index pairs (out of 36 index pairs), introduced 8 new quantified variables, introduced 0 case distinctions, treesize of input 115 treesize of output 103 [2021-12-17 01:38:43,761 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:38:43,764 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 22 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 88 [2021-12-17 01:38:44,040 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:38:44,041 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 22 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 30 [2021-12-17 01:38:44,129 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 13 proven. 98 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2021-12-17 01:38:44,129 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 01:39:24,402 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 13 proven. 98 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2021-12-17 01:39:24,402 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2114289532] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 01:39:24,402 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-17 01:39:24,402 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 34, 33] total 98 [2021-12-17 01:39:24,402 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291013288] [2021-12-17 01:39:24,402 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-17 01:39:24,403 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 98 states [2021-12-17 01:39:24,403 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 01:39:24,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2021-12-17 01:39:24,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=604, Invalid=8902, Unknown=0, NotChecked=0, Total=9506 [2021-12-17 01:39:24,404 INFO L87 Difference]: Start difference. First operand 209 states and 219 transitions. Second operand has 98 states, 98 states have (on average 1.1938775510204083) internal successors, (117), 98 states have internal predecessors, (117), 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) Killed by 15