./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-fpi/s4if.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6c24879c 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/s4if.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 5fe0a71bff946f0cc68d0dab1416e0ef991c6bf06ad7cbb70643ca18073a3c7e --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-11 23:31:17,346 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-11 23:31:17,348 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-11 23:31:17,383 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-11 23:31:17,383 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-11 23:31:17,384 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-11 23:31:17,386 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-11 23:31:17,388 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-11 23:31:17,389 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-11 23:31:17,394 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-11 23:31:17,395 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-11 23:31:17,396 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-11 23:31:17,396 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-11 23:31:17,397 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-11 23:31:17,398 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-11 23:31:17,399 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-11 23:31:17,401 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-11 23:31:17,402 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-11 23:31:17,403 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-11 23:31:17,404 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-11 23:31:17,408 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-11 23:31:17,409 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-11 23:31:17,410 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-11 23:31:17,410 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-11 23:31:17,411 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-11 23:31:17,414 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-11 23:31:17,415 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-11 23:31:17,415 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-11 23:31:17,416 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-11 23:31:17,416 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-11 23:31:17,417 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-11 23:31:17,417 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-11 23:31:17,418 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-11 23:31:17,419 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-11 23:31:17,419 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-11 23:31:17,420 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-11 23:31:17,420 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-11 23:31:17,420 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-11 23:31:17,420 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-11 23:31:17,421 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-11 23:31:17,421 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-11 23:31:17,423 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-11 23:31:17,424 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-11 23:31:17,447 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-11 23:31:17,448 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-11 23:31:17,448 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-11 23:31:17,448 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-11 23:31:17,449 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-11 23:31:17,449 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-11 23:31:17,449 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-11 23:31:17,449 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-11 23:31:17,449 INFO L138 SettingsManager]: * Use SBE=true [2022-07-11 23:31:17,450 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-11 23:31:17,450 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-11 23:31:17,451 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-11 23:31:17,451 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-11 23:31:17,451 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-11 23:31:17,451 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-11 23:31:17,451 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-11 23:31:17,451 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-11 23:31:17,451 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-11 23:31:17,451 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-11 23:31:17,453 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-11 23:31:17,453 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-11 23:31:17,453 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-11 23:31:17,453 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-11 23:31:17,453 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-11 23:31:17,453 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-11 23:31:17,454 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-11 23:31:17,454 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-11 23:31:17,454 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-11 23:31:17,454 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-11 23:31:17,454 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-11 23:31:17,454 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-11 23:31:17,454 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-11 23:31:17,455 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-11 23:31:17,455 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 -> 5fe0a71bff946f0cc68d0dab1416e0ef991c6bf06ad7cbb70643ca18073a3c7e [2022-07-11 23:31:17,633 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-11 23:31:17,658 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-11 23:31:17,659 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-11 23:31:17,660 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-11 23:31:17,661 INFO L275 PluginConnector]: CDTParser initialized [2022-07-11 23:31:17,662 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-fpi/s4if.c [2022-07-11 23:31:17,698 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a60ebb1c9/3592780b3742455ab06d3df35b0aedf5/FLAG0597ad900 [2022-07-11 23:31:18,062 INFO L306 CDTParser]: Found 1 translation units. [2022-07-11 23:31:18,062 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/s4if.c [2022-07-11 23:31:18,066 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a60ebb1c9/3592780b3742455ab06d3df35b0aedf5/FLAG0597ad900 [2022-07-11 23:31:18,088 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a60ebb1c9/3592780b3742455ab06d3df35b0aedf5 [2022-07-11 23:31:18,090 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-11 23:31:18,091 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-11 23:31:18,092 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-11 23:31:18,092 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-11 23:31:18,094 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-11 23:31:18,095 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.07 11:31:18" (1/1) ... [2022-07-11 23:31:18,096 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6bb1a825 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:31:18, skipping insertion in model container [2022-07-11 23:31:18,096 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.07 11:31:18" (1/1) ... [2022-07-11 23:31:18,100 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-11 23:31:18,108 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-11 23:31:18,235 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/s4if.c[587,600] [2022-07-11 23:31:18,254 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-11 23:31:18,264 INFO L203 MainTranslator]: Completed pre-run [2022-07-11 23:31:18,274 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/s4if.c[587,600] [2022-07-11 23:31:18,282 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-11 23:31:18,290 INFO L208 MainTranslator]: Completed translation [2022-07-11 23:31:18,291 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:31:18 WrapperNode [2022-07-11 23:31:18,291 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-11 23:31:18,291 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-11 23:31:18,292 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-11 23:31:18,292 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-11 23:31:18,296 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:31:18" (1/1) ... [2022-07-11 23:31:18,301 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:31:18" (1/1) ... [2022-07-11 23:31:18,312 INFO L137 Inliner]: procedures = 17, calls = 30, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 79 [2022-07-11 23:31:18,312 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-11 23:31:18,313 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-11 23:31:18,313 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-11 23:31:18,313 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-11 23:31:18,318 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:31:18" (1/1) ... [2022-07-11 23:31:18,318 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:31:18" (1/1) ... [2022-07-11 23:31:18,327 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:31:18" (1/1) ... [2022-07-11 23:31:18,328 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:31:18" (1/1) ... [2022-07-11 23:31:18,331 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:31:18" (1/1) ... [2022-07-11 23:31:18,334 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:31:18" (1/1) ... [2022-07-11 23:31:18,335 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:31:18" (1/1) ... [2022-07-11 23:31:18,336 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-11 23:31:18,337 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-11 23:31:18,337 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-11 23:31:18,337 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-11 23:31:18,338 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:31:18" (1/1) ... [2022-07-11 23:31:18,342 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-11 23:31:18,351 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:31:18,377 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-11 23:31:18,382 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-11 23:31:18,399 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-11 23:31:18,399 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-11 23:31:18,400 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-11 23:31:18,400 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-11 23:31:18,400 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-11 23:31:18,400 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-11 23:31:18,400 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-11 23:31:18,400 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-11 23:31:18,400 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-11 23:31:18,440 INFO L234 CfgBuilder]: Building ICFG [2022-07-11 23:31:18,441 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-11 23:31:18,584 INFO L275 CfgBuilder]: Performing block encoding [2022-07-11 23:31:18,588 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-11 23:31:18,588 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-07-11 23:31:18,589 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.07 11:31:18 BoogieIcfgContainer [2022-07-11 23:31:18,590 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-11 23:31:18,591 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-11 23:31:18,591 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-11 23:31:18,593 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-11 23:31:18,593 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.07 11:31:18" (1/3) ... [2022-07-11 23:31:18,594 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3109fedf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.07 11:31:18, skipping insertion in model container [2022-07-11 23:31:18,594 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:31:18" (2/3) ... [2022-07-11 23:31:18,594 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3109fedf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.07 11:31:18, skipping insertion in model container [2022-07-11 23:31:18,594 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.07 11:31:18" (3/3) ... [2022-07-11 23:31:18,595 INFO L111 eAbstractionObserver]: Analyzing ICFG s4if.c [2022-07-11 23:31:18,605 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-11 23:31:18,605 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-11 23:31:18,641 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-11 23:31:18,645 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@114249c, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@582de7ba [2022-07-11 23:31:18,647 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-11 23:31:18,664 INFO L276 IsEmpty]: Start isEmpty. Operand has 19 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 18 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:31:18,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-11 23:31:18,669 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:31:18,669 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:31:18,670 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:31:18,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:31:18,678 INFO L85 PathProgramCache]: Analyzing trace with hash 356661439, now seen corresponding path program 1 times [2022-07-11 23:31:18,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:31:18,685 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437000643] [2022-07-11 23:31:18,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:31:18,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:31:18,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:31:18,799 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:31:18,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:31:18,800 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437000643] [2022-07-11 23:31:18,801 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [437000643] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:31:18,801 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:31:18,801 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-11 23:31:18,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016551776] [2022-07-11 23:31:18,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:31:18,805 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-11 23:31:18,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:31:18,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-11 23:31:18,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-11 23:31:18,824 INFO L87 Difference]: Start difference. First operand has 19 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 18 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:31:18,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:31:18,833 INFO L93 Difference]: Finished difference Result 34 states and 46 transitions. [2022-07-11 23:31:18,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-11 23:31:18,834 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-07-11 23:31:18,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:31:18,839 INFO L225 Difference]: With dead ends: 34 [2022-07-11 23:31:18,839 INFO L226 Difference]: Without dead ends: 15 [2022-07-11 23:31:18,841 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-11 23:31:18,844 INFO L413 NwaCegarLoop]: 22 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, 22 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-11 23:31:18,844 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-11 23:31:18,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-07-11 23:31:18,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-07-11 23:31:18,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:31:18,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2022-07-11 23:31:18,866 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 17 transitions. Word has length 11 [2022-07-11 23:31:18,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:31:18,866 INFO L495 AbstractCegarLoop]: Abstraction has 15 states and 17 transitions. [2022-07-11 23:31:18,867 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:31:18,867 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2022-07-11 23:31:18,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-11 23:31:18,867 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:31:18,868 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:31:18,868 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-11 23:31:18,868 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:31:18,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:31:18,869 INFO L85 PathProgramCache]: Analyzing trace with hash -452685187, now seen corresponding path program 1 times [2022-07-11 23:31:18,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:31:18,870 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605686349] [2022-07-11 23:31:18,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:31:18,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:31:18,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:31:18,928 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:31:18,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:31:18,929 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605686349] [2022-07-11 23:31:18,929 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1605686349] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:31:18,929 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:31:18,930 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-11 23:31:18,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028058377] [2022-07-11 23:31:18,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:31:18,931 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:31:18,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:31:18,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:31:18,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:31:18,932 INFO L87 Difference]: Start difference. First operand 15 states and 17 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:31:19,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:31:19,001 INFO L93 Difference]: Finished difference Result 28 states and 34 transitions. [2022-07-11 23:31:19,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-11 23:31:19,002 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-07-11 23:31:19,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:31:19,003 INFO L225 Difference]: With dead ends: 28 [2022-07-11 23:31:19,003 INFO L226 Difference]: Without dead ends: 20 [2022-07-11 23:31:19,003 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:31:19,004 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 21 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-11 23:31:19,005 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 10 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-11 23:31:19,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-07-11 23:31:19,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 17. [2022-07-11 23:31:19,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.1875) internal successors, (19), 16 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:31:19,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2022-07-11 23:31:19,008 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 11 [2022-07-11 23:31:19,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:31:19,008 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2022-07-11 23:31:19,008 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:31:19,009 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-07-11 23:31:19,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-11 23:31:19,009 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:31:19,009 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:31:19,009 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-11 23:31:19,009 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:31:19,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:31:19,010 INFO L85 PathProgramCache]: Analyzing trace with hash 623611495, now seen corresponding path program 1 times [2022-07-11 23:31:19,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:31:19,010 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657655713] [2022-07-11 23:31:19,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:31:19,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:31:19,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:31:19,238 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:31:19,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:31:19,239 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657655713] [2022-07-11 23:31:19,239 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1657655713] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-11 23:31:19,239 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [85332364] [2022-07-11 23:31:19,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:31:19,240 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:31:19,240 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:31:19,241 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-11 23:31:19,242 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-11 23:31:19,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:31:19,320 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 26 conjunts are in the unsatisfiable core [2022-07-11 23:31:19,324 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:31:19,381 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-11 23:31:19,394 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-07-11 23:31:19,445 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-11 23:31:19,546 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 27 [2022-07-11 23:31:19,668 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 27 [2022-07-11 23:31:19,701 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:31:19,702 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-11 23:31:19,967 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-11 23:31:19,967 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2022-07-11 23:31:19,970 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-11 23:31:19,973 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 18 [2022-07-11 23:31:19,976 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2022-07-11 23:31:19,986 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-11 23:31:19,986 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 1 [2022-07-11 23:31:19,994 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:31:19,994 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [85332364] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-11 23:31:19,994 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-11 23:31:19,994 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 10] total 19 [2022-07-11 23:31:19,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24329680] [2022-07-11 23:31:19,995 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-11 23:31:19,995 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-07-11 23:31:19,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:31:19,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-07-11 23:31:19,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=269, Unknown=0, NotChecked=0, Total=342 [2022-07-11 23:31:19,996 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:31:20,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:31:20,093 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2022-07-11 23:31:20,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-11 23:31:20,094 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-07-11 23:31:20,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:31:20,095 INFO L225 Difference]: With dead ends: 36 [2022-07-11 23:31:20,095 INFO L226 Difference]: Without dead ends: 32 [2022-07-11 23:31:20,096 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 20 SyntacticMatches, 4 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=116, Invalid=346, Unknown=0, NotChecked=0, Total=462 [2022-07-11 23:31:20,096 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 37 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 41 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-11 23:31:20,097 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 49 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 79 Invalid, 0 Unknown, 41 Unchecked, 0.1s Time] [2022-07-11 23:31:20,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-07-11 23:31:20,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 25. [2022-07-11 23:31:20,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 1.25) internal successors, (30), 24 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:31:20,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 30 transitions. [2022-07-11 23:31:20,100 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 30 transitions. Word has length 16 [2022-07-11 23:31:20,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:31:20,101 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 30 transitions. [2022-07-11 23:31:20,101 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:31:20,101 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 30 transitions. [2022-07-11 23:31:20,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-11 23:31:20,102 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:31:20,102 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:31:20,126 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-11 23:31:20,318 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:31:20,319 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:31:20,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:31:20,319 INFO L85 PathProgramCache]: Analyzing trace with hash 680869797, now seen corresponding path program 1 times [2022-07-11 23:31:20,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:31:20,320 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286538846] [2022-07-11 23:31:20,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:31:20,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:31:20,336 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-11 23:31:20,339 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1833979192] [2022-07-11 23:31:20,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:31:20,340 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:31:20,340 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:31:20,343 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-11 23:31:20,390 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-11 23:31:20,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:31:20,399 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 13 conjunts are in the unsatisfiable core [2022-07-11 23:31:20,400 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:31:20,411 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-11 23:31:20,434 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-11 23:31:20,439 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:31:20,439 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-11 23:31:20,460 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2022-07-11 23:31:20,462 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2022-07-11 23:31:20,472 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:31:20,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:31:20,472 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286538846] [2022-07-11 23:31:20,472 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-11 23:31:20,473 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1833979192] [2022-07-11 23:31:20,473 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1833979192] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-11 23:31:20,473 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-11 23:31:20,473 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2022-07-11 23:31:20,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579838492] [2022-07-11 23:31:20,473 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-11 23:31:20,474 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-11 23:31:20,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:31:20,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-11 23:31:20,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-07-11 23:31:20,475 INFO L87 Difference]: Start difference. First operand 25 states and 30 transitions. Second operand has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:31:20,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:31:20,530 INFO L93 Difference]: Finished difference Result 38 states and 46 transitions. [2022-07-11 23:31:20,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-11 23:31:20,530 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-07-11 23:31:20,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:31:20,531 INFO L225 Difference]: With dead ends: 38 [2022-07-11 23:31:20,531 INFO L226 Difference]: Without dead ends: 26 [2022-07-11 23:31:20,531 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2022-07-11 23:31:20,532 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 6 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-11 23:31:20,532 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 43 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-11 23:31:20,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-07-11 23:31:20,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2022-07-11 23:31:20,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:31:20,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2022-07-11 23:31:20,536 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 16 [2022-07-11 23:31:20,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:31:20,536 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2022-07-11 23:31:20,536 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:31:20,536 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2022-07-11 23:31:20,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-11 23:31:20,537 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:31:20,537 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:31:20,555 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-11 23:31:20,744 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-07-11 23:31:20,745 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:31:20,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:31:20,745 INFO L85 PathProgramCache]: Analyzing trace with hash -1137819675, now seen corresponding path program 2 times [2022-07-11 23:31:20,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:31:20,745 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016817524] [2022-07-11 23:31:20,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:31:20,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:31:20,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:31:20,834 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:31:20,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:31:20,834 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016817524] [2022-07-11 23:31:20,834 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2016817524] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-11 23:31:20,834 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [152535266] [2022-07-11 23:31:20,834 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-11 23:31:20,835 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:31:20,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:31:20,847 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-11 23:31:20,848 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-11 23:31:20,889 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-11 23:31:20,889 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-11 23:31:20,890 INFO L263 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-11 23:31:20,891 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:31:20,929 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:31:20,929 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-11 23:31:20,952 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:31:20,952 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [152535266] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-11 23:31:20,953 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-11 23:31:20,953 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2022-07-11 23:31:20,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871531270] [2022-07-11 23:31:20,953 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-11 23:31:20,953 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-11 23:31:20,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:31:20,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-11 23:31:20,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-07-11 23:31:20,954 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand has 11 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:31:21,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:31:21,124 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2022-07-11 23:31:21,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-11 23:31:21,125 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-07-11 23:31:21,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:31:21,125 INFO L225 Difference]: With dead ends: 33 [2022-07-11 23:31:21,125 INFO L226 Difference]: Without dead ends: 29 [2022-07-11 23:31:21,126 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 30 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2022-07-11 23:31:21,126 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 28 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-11 23:31:21,126 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 25 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-11 23:31:21,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-07-11 23:31:21,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 20. [2022-07-11 23:31:21,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 19 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:31:21,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2022-07-11 23:31:21,129 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 22 transitions. Word has length 18 [2022-07-11 23:31:21,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:31:21,129 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 22 transitions. [2022-07-11 23:31:21,129 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:31:21,129 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2022-07-11 23:31:21,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-07-11 23:31:21,129 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:31:21,129 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:31:21,159 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-11 23:31:21,330 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:31:21,330 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:31:21,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:31:21,330 INFO L85 PathProgramCache]: Analyzing trace with hash -479454913, now seen corresponding path program 3 times [2022-07-11 23:31:21,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:31:21,330 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141627682] [2022-07-11 23:31:21,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:31:21,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:31:21,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:31:21,386 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:31:21,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:31:21,387 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141627682] [2022-07-11 23:31:21,387 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1141627682] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-11 23:31:21,387 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [172662385] [2022-07-11 23:31:21,387 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-11 23:31:21,387 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:31:21,387 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:31:21,411 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-11 23:31:21,412 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-11 23:31:21,456 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-07-11 23:31:21,457 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-11 23:31:21,457 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-11 23:31:21,459 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:31:21,490 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:31:21,490 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-11 23:31:21,510 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:31:21,510 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [172662385] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-11 23:31:21,510 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-11 23:31:21,511 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2022-07-11 23:31:21,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318207696] [2022-07-11 23:31:21,511 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-11 23:31:21,512 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-11 23:31:21,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:31:21,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-11 23:31:21,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-07-11 23:31:21,512 INFO L87 Difference]: Start difference. First operand 20 states and 22 transitions. Second operand has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 11 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:31:21,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:31:21,567 INFO L93 Difference]: Finished difference Result 37 states and 42 transitions. [2022-07-11 23:31:21,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-11 23:31:21,568 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 11 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-07-11 23:31:21,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:31:21,569 INFO L225 Difference]: With dead ends: 37 [2022-07-11 23:31:21,570 INFO L226 Difference]: Without dead ends: 25 [2022-07-11 23:31:21,570 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2022-07-11 23:31:21,571 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 23 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-11 23:31:21,572 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 26 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-11 23:31:21,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-07-11 23:31:21,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 22. [2022-07-11 23:31:21,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 21 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:31:21,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2022-07-11 23:31:21,578 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 19 [2022-07-11 23:31:21,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:31:21,579 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2022-07-11 23:31:21,579 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 11 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:31:21,579 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2022-07-11 23:31:21,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-07-11 23:31:21,580 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:31:21,580 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:31:21,609 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-11 23:31:21,791 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:31:21,792 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:31:21,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:31:21,792 INFO L85 PathProgramCache]: Analyzing trace with hash 634982145, now seen corresponding path program 4 times [2022-07-11 23:31:21,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:31:21,792 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833135072] [2022-07-11 23:31:21,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:31:21,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:31:21,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:31:22,029 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:31:22,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:31:22,029 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833135072] [2022-07-11 23:31:22,030 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1833135072] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-11 23:31:22,030 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1716342420] [2022-07-11 23:31:22,030 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-11 23:31:22,030 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:31:22,030 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:31:22,031 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-11 23:31:22,032 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-11 23:31:22,066 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-11 23:31:22,066 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-11 23:31:22,067 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 36 conjunts are in the unsatisfiable core [2022-07-11 23:31:22,069 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:31:22,073 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-11 23:31:22,094 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:31:22,095 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-11 23:31:22,123 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:31:22,124 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-11 23:31:22,227 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:31:22,228 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 27 [2022-07-11 23:31:22,299 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:31:22,302 INFO L356 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-07-11 23:31:22,302 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 43 [2022-07-11 23:31:22,373 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:31:22,375 INFO L356 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-07-11 23:31:22,376 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 71 treesize of output 35 [2022-07-11 23:31:22,399 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:31:22,399 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-11 23:31:23,431 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((~N~0 Int)) (or (< (+ |c_ULTIMATE.start_main_~i~0#1| 1) ~N~0) (forall ((|ULTIMATE.start_main_~i~0#1| Int) (|ULTIMATE.start_main_~a~0#1.offset| Int) (v_ArrVal_152 (Array Int Int))) (or (forall ((v_subst_2 Int)) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_152))) (let ((.cse4 (select .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse0 (select .cse4 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse2 (select v_ArrVal_152 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))))) (let ((.cse1 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .cse2))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_2))))) (or (<= (* ~N~0 4) (+ .cse0 .cse1 .cse2)) (not (= .cse1 4)))))))) (not (= (select v_ArrVal_152 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) 4)))) (not (< |c_ULTIMATE.start_main_~i~0#1| ~N~0)))) (forall ((~N~0 Int)) (or (< (+ |c_ULTIMATE.start_main_~i~0#1| 1) ~N~0) (not (< |c_ULTIMATE.start_main_~i~0#1| ~N~0)) (forall ((|ULTIMATE.start_main_~i~0#1| Int) (|ULTIMATE.start_main_~a~0#1.offset| Int) (v_ArrVal_152 (Array Int Int))) (or (forall ((v_subst_1 Int)) (let ((.cse8 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_152))) (let ((.cse9 (select .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse5 (select .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse6 (select v_ArrVal_152 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))))) (let ((.cse7 (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse5 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_1))))) (or (<= (+ .cse5 .cse6 .cse7) (* ~N~0 4)) (not (= 4 .cse7)))))))) (not (= (select v_ArrVal_152 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) 4))))))) is different from false [2022-07-11 23:31:23,503 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((~N~0 Int)) (or (< (+ 2 |c_ULTIMATE.start_main_~i~0#1|) ~N~0) (not (< (+ |c_ULTIMATE.start_main_~i~0#1| 1) ~N~0)) (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int) (v_ArrVal_152 (Array Int Int)) (v_subst_4 Int)) (or (forall ((v_subst_1 Int)) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_152))) (let ((.cse4 (select .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse0 (select .cse4 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse2 (select v_ArrVal_152 (+ |ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_4))))) (let ((.cse1 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .cse2))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_1))))) (or (<= (+ .cse0 .cse1 .cse2) (* ~N~0 4)) (not (= .cse1 4)))))))) (not (= (select v_ArrVal_152 (+ |ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_4))) 4)))))) (forall ((~N~0 Int)) (or (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int) (v_ArrVal_152 (Array Int Int)) (v_subst_3 Int)) (or (not (= (select v_ArrVal_152 (+ |ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_3))) 4)) (forall ((v_subst_2 Int)) (let ((.cse8 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_152))) (let ((.cse9 (select .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse5 (select .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse6 (select v_ArrVal_152 (+ |ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_3))))) (let ((.cse7 (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse5 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_2))))) (or (<= (* ~N~0 4) (+ .cse5 .cse6 .cse7)) (not (= 4 .cse7)))))))))) (< (+ 2 |c_ULTIMATE.start_main_~i~0#1|) ~N~0) (not (< (+ |c_ULTIMATE.start_main_~i~0#1| 1) ~N~0))))) is different from false [2022-07-11 23:31:23,619 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2022-07-11 23:31:23,619 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1716342420] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-11 23:31:23,620 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-11 23:31:23,620 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 12] total 32 [2022-07-11 23:31:23,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505718223] [2022-07-11 23:31:23,620 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-11 23:31:23,621 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-07-11 23:31:23,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:31:23,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-07-11 23:31:23,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=762, Unknown=2, NotChecked=114, Total=992 [2022-07-11 23:31:23,622 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand has 32 states, 32 states have (on average 1.5625) internal successors, (50), 32 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:31:23,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:31:23,861 INFO L93 Difference]: Finished difference Result 36 states and 40 transitions. [2022-07-11 23:31:23,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-11 23:31:23,862 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 1.5625) internal successors, (50), 32 states have internal predecessors, (50), 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 [2022-07-11 23:31:23,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:31:23,863 INFO L225 Difference]: With dead ends: 36 [2022-07-11 23:31:23,863 INFO L226 Difference]: Without dead ends: 32 [2022-07-11 23:31:23,864 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 23 SyntacticMatches, 4 SemanticMatches, 34 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 335 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=165, Invalid=963, Unknown=2, NotChecked=130, Total=1260 [2022-07-11 23:31:23,865 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 12 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 152 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-11 23:31:23,865 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 71 Invalid, 251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 92 Invalid, 0 Unknown, 152 Unchecked, 0.0s Time] [2022-07-11 23:31:23,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-07-11 23:31:23,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2022-07-11 23:31:23,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 29 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:31:23,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2022-07-11 23:31:23,874 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 21 [2022-07-11 23:31:23,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:31:23,875 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2022-07-11 23:31:23,875 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 1.5625) internal successors, (50), 32 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:31:23,875 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2022-07-11 23:31:23,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-07-11 23:31:23,875 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:31:23,876 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:31:23,908 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-11 23:31:24,108 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:31:24,108 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:31:24,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:31:24,109 INFO L85 PathProgramCache]: Analyzing trace with hash 692240447, now seen corresponding path program 1 times [2022-07-11 23:31:24,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:31:24,109 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012020200] [2022-07-11 23:31:24,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:31:24,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:31:24,128 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-11 23:31:24,131 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [909761844] [2022-07-11 23:31:24,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:31:24,141 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:31:24,142 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:31:24,143 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-11 23:31:24,143 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-11 23:31:24,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:31:24,206 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 20 conjunts are in the unsatisfiable core [2022-07-11 23:31:24,207 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:31:24,229 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-11 23:31:24,263 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:31:24,264 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-11 23:31:24,285 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-11 23:31:24,292 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:31:24,292 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-11 23:31:24,316 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_189 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_189) |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)) 4)) is different from false [2022-07-11 23:31:24,321 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_189 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_189) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 4)) is different from false [2022-07-11 23:31:24,328 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-11 23:31:24,329 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 25 [2022-07-11 23:31:24,333 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-11 23:31:24,334 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 38 [2022-07-11 23:31:24,336 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-11 23:31:24,364 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2022-07-11 23:31:24,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:31:24,364 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012020200] [2022-07-11 23:31:24,364 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-11 23:31:24,364 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [909761844] [2022-07-11 23:31:24,364 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [909761844] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-11 23:31:24,365 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-11 23:31:24,365 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2022-07-11 23:31:24,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51259272] [2022-07-11 23:31:24,365 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-11 23:31:24,365 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-07-11 23:31:24,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:31:24,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-07-11 23:31:24,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=126, Unknown=2, NotChecked=46, Total=210 [2022-07-11 23:31:24,366 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand has 15 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 15 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:31:24,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:31:24,496 INFO L93 Difference]: Finished difference Result 41 states and 47 transitions. [2022-07-11 23:31:24,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-11 23:31:24,496 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 15 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-07-11 23:31:24,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:31:24,497 INFO L225 Difference]: With dead ends: 41 [2022-07-11 23:31:24,497 INFO L226 Difference]: Without dead ends: 34 [2022-07-11 23:31:24,497 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 27 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=215, Unknown=2, NotChecked=62, Total=342 [2022-07-11 23:31:24,498 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 17 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 45 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-11 23:31:24,498 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 52 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 117 Invalid, 0 Unknown, 45 Unchecked, 0.1s Time] [2022-07-11 23:31:24,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-07-11 23:31:24,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2022-07-11 23:31:24,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 32 states have (on average 1.125) internal successors, (36), 32 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:31:24,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 36 transitions. [2022-07-11 23:31:24,501 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 36 transitions. Word has length 21 [2022-07-11 23:31:24,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:31:24,501 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 36 transitions. [2022-07-11 23:31:24,501 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 15 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:31:24,501 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2022-07-11 23:31:24,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-07-11 23:31:24,501 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:31:24,501 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:31:24,518 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-07-11 23:31:24,711 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:31:24,711 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:31:24,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:31:24,712 INFO L85 PathProgramCache]: Analyzing trace with hash -2132829117, now seen corresponding path program 5 times [2022-07-11 23:31:24,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:31:24,712 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554351711] [2022-07-11 23:31:24,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:31:24,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:31:24,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:31:24,787 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:31:24,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:31:24,787 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554351711] [2022-07-11 23:31:24,788 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [554351711] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-11 23:31:24,788 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1508386103] [2022-07-11 23:31:24,788 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-11 23:31:24,788 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:31:24,788 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:31:24,804 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-11 23:31:24,805 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-07-11 23:31:24,858 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-07-11 23:31:24,858 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-11 23:31:24,859 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-11 23:31:24,860 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:31:24,926 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:31:24,926 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-11 23:31:24,957 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:31:24,958 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1508386103] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-11 23:31:24,958 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-11 23:31:24,958 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2022-07-11 23:31:24,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188474835] [2022-07-11 23:31:24,958 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-11 23:31:24,959 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-11 23:31:24,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:31:24,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-11 23:31:24,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2022-07-11 23:31:24,960 INFO L87 Difference]: Start difference. First operand 33 states and 36 transitions. Second operand has 14 states, 14 states have (on average 2.7142857142857144) internal successors, (38), 14 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:31:25,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:31:25,094 INFO L93 Difference]: Finished difference Result 41 states and 45 transitions. [2022-07-11 23:31:25,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-11 23:31:25,095 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.7142857142857144) internal successors, (38), 14 states have internal predecessors, (38), 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 [2022-07-11 23:31:25,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:31:25,095 INFO L225 Difference]: With dead ends: 41 [2022-07-11 23:31:25,095 INFO L226 Difference]: Without dead ends: 37 [2022-07-11 23:31:25,096 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 39 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=280, Unknown=0, NotChecked=0, Total=380 [2022-07-11 23:31:25,096 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 29 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-11 23:31:25,096 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 37 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-11 23:31:25,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-07-11 23:31:25,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 25. [2022-07-11 23:31:25,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 1.125) internal successors, (27), 24 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:31:25,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2022-07-11 23:31:25,099 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 23 [2022-07-11 23:31:25,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:31:25,099 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2022-07-11 23:31:25,099 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.7142857142857144) internal successors, (38), 14 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:31:25,099 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2022-07-11 23:31:25,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-11 23:31:25,099 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:31:25,100 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:31:25,117 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-07-11 23:31:25,309 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:31:25,309 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:31:25,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:31:25,309 INFO L85 PathProgramCache]: Analyzing trace with hash -1038837147, now seen corresponding path program 6 times [2022-07-11 23:31:25,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:31:25,309 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646492196] [2022-07-11 23:31:25,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:31:25,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:31:25,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:31:25,353 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:31:25,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:31:25,354 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646492196] [2022-07-11 23:31:25,354 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1646492196] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-11 23:31:25,354 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [920698275] [2022-07-11 23:31:25,354 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-07-11 23:31:25,354 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:31:25,354 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:31:25,372 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-11 23:31:25,380 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-07-11 23:31:25,426 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-07-11 23:31:25,426 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-11 23:31:25,427 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-11 23:31:25,428 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:31:25,477 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:31:25,477 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-11 23:31:25,510 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:31:25,511 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [920698275] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-11 23:31:25,511 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-11 23:31:25,511 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2022-07-11 23:31:25,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717755007] [2022-07-11 23:31:25,511 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-11 23:31:25,511 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-11 23:31:25,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:31:25,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-11 23:31:25,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2022-07-11 23:31:25,512 INFO L87 Difference]: Start difference. First operand 25 states and 27 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) [2022-07-11 23:31:25,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:31:25,611 INFO L93 Difference]: Finished difference Result 45 states and 50 transitions. [2022-07-11 23:31:25,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-11 23:31:25,611 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 24 [2022-07-11 23:31:25,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:31:25,612 INFO L225 Difference]: With dead ends: 45 [2022-07-11 23:31:25,612 INFO L226 Difference]: Without dead ends: 30 [2022-07-11 23:31:25,613 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2022-07-11 23:31:25,613 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 35 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-11 23:31:25,614 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 27 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-11 23:31:25,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-07-11 23:31:25,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 27. [2022-07-11 23:31:25,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 26 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:31:25,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2022-07-11 23:31:25,620 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 24 [2022-07-11 23:31:25,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:31:25,621 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2022-07-11 23:31:25,622 INFO L496 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) [2022-07-11 23:31:25,622 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2022-07-11 23:31:25,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-07-11 23:31:25,624 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:31:25,624 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:31:25,644 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-07-11 23:31:25,844 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-07-11 23:31:25,845 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:31:25,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:31:25,845 INFO L85 PathProgramCache]: Analyzing trace with hash -2121994781, now seen corresponding path program 7 times [2022-07-11 23:31:25,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:31:25,845 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788889717] [2022-07-11 23:31:25,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:31:25,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:31:25,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:31:26,328 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:31:26,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:31:26,329 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788889717] [2022-07-11 23:31:26,329 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [788889717] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-11 23:31:26,329 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1415635575] [2022-07-11 23:31:26,329 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-07-11 23:31:26,329 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:31:26,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:31:26,330 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-11 23:31:26,331 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-07-11 23:31:26,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:31:26,379 INFO L263 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 51 conjunts are in the unsatisfiable core [2022-07-11 23:31:26,381 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:31:26,385 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-11 23:31:26,387 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-07-11 23:31:26,392 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-11 23:31:26,412 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-11 23:31:26,433 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-11 23:31:26,543 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 27 [2022-07-11 23:31:26,631 INFO L356 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-07-11 23:31:26,631 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 43 [2022-07-11 23:31:26,717 INFO L356 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-07-11 23:31:26,717 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 41 [2022-07-11 23:31:26,794 INFO L356 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-07-11 23:31:26,794 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 34 [2022-07-11 23:31:26,813 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:31:26,814 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-11 23:31:37,499 WARN L833 $PredicateComparison]: unable to prove that (forall ((~N~0 Int)) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_91| Int) (|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_88| Int) (|v_ULTIMATE.start_main_~i~0#1_86| Int) (v_ArrVal_302 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_302))) (let ((.cse5 (select .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse1 (select v_ArrVal_302 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_91| 4)))) (.cse3 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse0 (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse3))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_88| 4))))) (let ((.cse2 (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse3 .cse0))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_86| 4))))) (or (not (= .cse0 4)) (not (= .cse1 4)) (not (= .cse2 4)) (= (* ~N~0 4) (+ .cse2 .cse1 .cse3 .cse0))))))))) (< (+ |c_ULTIMATE.start_main_~i~0#1| 1) ~N~0) (not (< |c_ULTIMATE.start_main_~i~0#1| ~N~0)))) is different from false [2022-07-11 23:31:37,531 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_91| Int) (|ULTIMATE.start_main_~a~0#1.offset| Int) (~N~0 Int) (|v_ULTIMATE.start_main_~i~0#1_88| Int) (|v_ULTIMATE.start_main_~i~0#1_86| Int) (v_ArrVal_302 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_302))) (let ((.cse5 (select .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse1 (select v_ArrVal_302 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_91| 4)))) (.cse3 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse0 (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse3))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_88| 4))))) (let ((.cse2 (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse3 .cse0))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_86| 4))))) (or (not (= .cse0 4)) (< (+ 2 |c_ULTIMATE.start_main_~i~0#1|) ~N~0) (not (< (+ |c_ULTIMATE.start_main_~i~0#1| 1) ~N~0)) (not (= .cse1 4)) (not (= .cse2 4)) (= (* ~N~0 4) (+ .cse2 .cse1 .cse3 .cse0))))))))) is different from false [2022-07-11 23:31:37,589 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_91| Int) (|ULTIMATE.start_main_~a~0#1.offset| Int) (~N~0 Int) (|v_ULTIMATE.start_main_~i~0#1_88| Int) (|v_ULTIMATE.start_main_~i~0#1_86| Int) (v_ArrVal_302 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_302))) (let ((.cse5 (select .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse1 (select v_ArrVal_302 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_91| 4)))) (.cse3 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse0 (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse3))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_88| 4))))) (let ((.cse2 (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse3 .cse0))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_86| 4))))) (or (not (= .cse0 4)) (< (+ 3 |c_ULTIMATE.start_main_~i~0#1|) ~N~0) (not (= .cse1 4)) (not (= .cse2 4)) (= (* ~N~0 4) (+ .cse2 .cse1 .cse3 .cse0)) (not (< (+ 2 |c_ULTIMATE.start_main_~i~0#1|) ~N~0))))))))) is different from false [2022-07-11 23:31:37,629 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 9 not checked. [2022-07-11 23:31:37,629 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1415635575] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-11 23:31:37,630 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-11 23:31:37,630 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 15, 15] total 42 [2022-07-11 23:31:37,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827500138] [2022-07-11 23:31:37,630 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-11 23:31:37,630 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-07-11 23:31:37,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:31:37,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-07-11 23:31:37,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=1329, Unknown=9, NotChecked=228, Total=1722 [2022-07-11 23:31:37,631 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. Second operand has 42 states, 42 states have (on average 1.5476190476190477) internal successors, (65), 42 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:31:37,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:31:37,847 INFO L93 Difference]: Finished difference Result 45 states and 49 transitions. [2022-07-11 23:31:37,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-11 23:31:37,847 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 1.5476190476190477) internal successors, (65), 42 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-07-11 23:31:37,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:31:37,847 INFO L225 Difference]: With dead ends: 45 [2022-07-11 23:31:37,847 INFO L226 Difference]: Without dead ends: 41 [2022-07-11 23:31:37,848 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 30 SyntacticMatches, 4 SemanticMatches, 43 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 526 ImplicationChecksByTransitivity, 11.0s TimeCoverageRelationStatistics Valid=203, Invalid=1522, Unknown=9, NotChecked=246, Total=1980 [2022-07-11 23:31:37,849 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 9 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 420 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 230 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-11 23:31:37,849 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 126 Invalid, 420 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 178 Invalid, 0 Unknown, 230 Unchecked, 0.1s Time] [2022-07-11 23:31:37,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-07-11 23:31:37,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 38. [2022-07-11 23:31:37,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 37 states have (on average 1.135135135135135) internal successors, (42), 37 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:31:37,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2022-07-11 23:31:37,853 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 26 [2022-07-11 23:31:37,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:31:37,853 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2022-07-11 23:31:37,854 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 1.5476190476190477) internal successors, (65), 42 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:31:37,854 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2022-07-11 23:31:37,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-07-11 23:31:37,856 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:31:37,856 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:31:37,872 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-07-11 23:31:38,071 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:31:38,072 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:31:38,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:31:38,072 INFO L85 PathProgramCache]: Analyzing trace with hash -2064736479, now seen corresponding path program 2 times [2022-07-11 23:31:38,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:31:38,073 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057821606] [2022-07-11 23:31:38,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:31:38,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:31:38,089 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-11 23:31:38,089 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [430688621] [2022-07-11 23:31:38,089 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-11 23:31:38,090 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:31:38,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:31:38,103 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-11 23:31:38,123 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-07-11 23:31:38,171 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-11 23:31:38,171 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-11 23:31:38,172 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 25 conjunts are in the unsatisfiable core [2022-07-11 23:31:38,174 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:31:38,177 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-07-11 23:31:38,203 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-11 23:31:38,238 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-11 23:31:38,268 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-11 23:31:38,291 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-07-11 23:31:38,299 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 5 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:31:38,299 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-11 23:31:38,320 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_351 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_351) |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)) 4)) is different from false [2022-07-11 23:31:38,325 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_351 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_351) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) 4)) is different from false [2022-07-11 23:31:38,334 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_351 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_351) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) 4)) is different from false [2022-07-11 23:31:38,343 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-11 23:31:38,343 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 25 [2022-07-11 23:31:38,349 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-11 23:31:38,350 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 38 [2022-07-11 23:31:38,352 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-11 23:31:38,377 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 12 not checked. [2022-07-11 23:31:38,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:31:38,377 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057821606] [2022-07-11 23:31:38,377 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-11 23:31:38,378 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [430688621] [2022-07-11 23:31:38,378 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [430688621] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-11 23:31:38,378 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-11 23:31:38,378 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 16 [2022-07-11 23:31:38,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180693487] [2022-07-11 23:31:38,378 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-11 23:31:38,378 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-07-11 23:31:38,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:31:38,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-07-11 23:31:38,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=128, Unknown=3, NotChecked=72, Total=240 [2022-07-11 23:31:38,379 INFO L87 Difference]: Start difference. First operand 38 states and 42 transitions. Second operand has 16 states, 16 states have (on average 2.3125) internal successors, (37), 16 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:31:38,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:31:38,596 INFO L93 Difference]: Finished difference Result 49 states and 55 transitions. [2022-07-11 23:31:38,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-11 23:31:38,597 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.3125) internal successors, (37), 16 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-07-11 23:31:38,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:31:38,597 INFO L225 Difference]: With dead ends: 49 [2022-07-11 23:31:38,597 INFO L226 Difference]: Without dead ends: 42 [2022-07-11 23:31:38,598 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 34 SyntacticMatches, 6 SemanticMatches, 19 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=250, Unknown=3, NotChecked=102, Total=420 [2022-07-11 23:31:38,598 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 17 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 74 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-11 23:31:38,602 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 56 Invalid, 271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 173 Invalid, 0 Unknown, 74 Unchecked, 0.1s Time] [2022-07-11 23:31:38,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-07-11 23:31:38,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2022-07-11 23:31:38,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 40 states have (on average 1.1) internal successors, (44), 40 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:31:38,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 44 transitions. [2022-07-11 23:31:38,610 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 44 transitions. Word has length 26 [2022-07-11 23:31:38,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:31:38,610 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 44 transitions. [2022-07-11 23:31:38,610 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.3125) internal successors, (37), 16 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:31:38,610 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 44 transitions. [2022-07-11 23:31:38,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-07-11 23:31:38,612 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:31:38,612 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:31:38,628 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-07-11 23:31:38,824 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-07-11 23:31:38,824 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:31:38,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:31:38,825 INFO L85 PathProgramCache]: Analyzing trace with hash 640571873, now seen corresponding path program 8 times [2022-07-11 23:31:38,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:31:38,825 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75765282] [2022-07-11 23:31:38,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:31:38,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:31:38,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:31:38,946 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 4 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:31:38,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:31:38,946 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75765282] [2022-07-11 23:31:38,946 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [75765282] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-11 23:31:38,947 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1413875381] [2022-07-11 23:31:38,947 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-11 23:31:38,947 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:31:38,947 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:31:38,948 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-11 23:31:38,949 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-07-11 23:31:39,013 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-11 23:31:39,014 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-11 23:31:39,015 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-11 23:31:39,015 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:31:39,092 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 9 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:31:39,092 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-11 23:31:39,128 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 9 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:31:39,128 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1413875381] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-11 23:31:39,129 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-11 23:31:39,129 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 17 [2022-07-11 23:31:39,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264232987] [2022-07-11 23:31:39,129 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-11 23:31:39,129 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-07-11 23:31:39,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:31:39,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-07-11 23:31:39,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2022-07-11 23:31:39,129 INFO L87 Difference]: Start difference. First operand 41 states and 44 transitions. Second operand has 17 states, 17 states have (on average 2.7058823529411766) internal successors, (46), 17 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) [2022-07-11 23:31:39,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:31:39,329 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2022-07-11 23:31:39,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-11 23:31:39,330 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.7058823529411766) internal successors, (46), 17 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 28 [2022-07-11 23:31:39,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:31:39,330 INFO L225 Difference]: With dead ends: 49 [2022-07-11 23:31:39,330 INFO L226 Difference]: Without dead ends: 45 [2022-07-11 23:31:39,331 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 48 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=148, Invalid=452, Unknown=0, NotChecked=0, Total=600 [2022-07-11 23:31:39,331 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 49 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 334 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 352 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-11 23:31:39,331 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 36 Invalid, 352 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 334 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-11 23:31:39,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-07-11 23:31:39,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 30. [2022-07-11 23:31:39,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 1.103448275862069) internal successors, (32), 29 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:31:39,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2022-07-11 23:31:39,335 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 32 transitions. Word has length 28 [2022-07-11 23:31:39,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:31:39,335 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 32 transitions. [2022-07-11 23:31:39,335 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.7058823529411766) internal successors, (46), 17 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) [2022-07-11 23:31:39,335 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2022-07-11 23:31:39,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-07-11 23:31:39,335 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:31:39,335 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:31:39,352 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-07-11 23:31:39,543 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-07-11 23:31:39,543 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:31:39,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:31:39,544 INFO L85 PathProgramCache]: Analyzing trace with hash -1478838205, now seen corresponding path program 9 times [2022-07-11 23:31:39,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:31:39,544 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543588813] [2022-07-11 23:31:39,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:31:39,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:31:39,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:31:39,609 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 15 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:31:39,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:31:39,609 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543588813] [2022-07-11 23:31:39,609 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1543588813] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-11 23:31:39,610 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1142200814] [2022-07-11 23:31:39,610 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-11 23:31:39,610 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:31:39,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:31:39,611 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) [2022-07-11 23:31:39,612 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-07-11 23:31:39,682 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-07-11 23:31:39,683 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-11 23:31:39,683 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-11 23:31:39,684 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:31:39,785 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 22 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:31:39,785 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-11 23:31:39,831 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 22 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:31:39,832 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1142200814] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-11 23:31:39,832 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-11 23:31:39,832 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 17 [2022-07-11 23:31:39,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680841623] [2022-07-11 23:31:39,832 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-11 23:31:39,832 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-07-11 23:31:39,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:31:39,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-07-11 23:31:39,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2022-07-11 23:31:39,834 INFO L87 Difference]: Start difference. First operand 30 states and 32 transitions. Second operand has 17 states, 17 states have (on average 2.764705882352941) internal successors, (47), 17 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:31:39,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:31:39,964 INFO L93 Difference]: Finished difference Result 53 states and 58 transitions. [2022-07-11 23:31:39,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-11 23:31:39,964 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.764705882352941) internal successors, (47), 17 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-07-11 23:31:39,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:31:39,966 INFO L225 Difference]: With dead ends: 53 [2022-07-11 23:31:39,966 INFO L226 Difference]: Without dead ends: 35 [2022-07-11 23:31:39,966 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 51 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=117, Invalid=303, Unknown=0, NotChecked=0, Total=420 [2022-07-11 23:31:39,966 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 38 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-11 23:31:39,967 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 33 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-11 23:31:39,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-07-11 23:31:39,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 32. [2022-07-11 23:31:39,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 31 states have (on average 1.096774193548387) internal successors, (34), 31 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:31:39,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2022-07-11 23:31:39,975 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 29 [2022-07-11 23:31:39,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:31:39,975 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 34 transitions. [2022-07-11 23:31:39,976 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.764705882352941) internal successors, (47), 17 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:31:39,976 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2022-07-11 23:31:39,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-07-11 23:31:39,978 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:31:39,978 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:31:40,001 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-07-11 23:31:40,191 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-07-11 23:31:40,191 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:31:40,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:31:40,192 INFO L85 PathProgramCache]: Analyzing trace with hash -2018974843, now seen corresponding path program 10 times [2022-07-11 23:31:40,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:31:40,192 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859930210] [2022-07-11 23:31:40,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:31:40,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:31:40,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:31:40,625 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:31:40,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:31:40,625 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859930210] [2022-07-11 23:31:40,625 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [859930210] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-11 23:31:40,625 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1765011097] [2022-07-11 23:31:40,625 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-11 23:31:40,625 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:31:40,625 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:31:40,626 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) [2022-07-11 23:31:40,628 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-07-11 23:31:40,678 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-11 23:31:40,678 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-11 23:31:40,679 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 58 conjunts are in the unsatisfiable core [2022-07-11 23:31:40,681 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:31:40,689 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-11 23:31:40,718 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:31:40,719 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-11 23:31:40,754 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:31:40,755 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-11 23:31:40,790 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:31:40,791 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-11 23:31:40,826 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:31:40,826 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-11 23:31:40,970 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:31:40,970 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 27 [2022-07-11 23:31:41,097 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:31:41,100 INFO L356 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-07-11 23:31:41,101 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 45 [2022-07-11 23:31:41,244 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:31:41,248 INFO L356 Elim1Store]: treesize reduction 48, result has 2.0 percent of original size [2022-07-11 23:31:41,248 INFO L390 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 84 treesize of output 57 [2022-07-11 23:31:41,362 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:31:41,365 INFO L356 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-07-11 23:31:41,365 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 41 [2022-07-11 23:31:41,445 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:31:41,448 INFO L356 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-07-11 23:31:41,448 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 68 treesize of output 32 [2022-07-11 23:31:41,476 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:31:41,476 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-11 23:32:06,816 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((~N~0 Int)) (or (forall ((|ULTIMATE.start_main_~i~0#1| Int) (|ULTIMATE.start_main_~a~0#1.offset| Int) (v_ArrVal_487 (Array Int Int))) (or (not (= (select v_ArrVal_487 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) 4)) (forall ((v_subst_9 Int)) (or (not (= (select (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_487))) (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| (+ (select .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select v_ArrVal_487 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))))))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_9))) 4)) (forall ((v_subst_8 Int)) (or (forall ((v_subst_6 Int)) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_487))) (let ((.cse8 (select .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse2 (select .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse5 (select v_ArrVal_487 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))))) (let ((.cse4 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_9))))) (let ((.cse6 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse4 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_8))))) (let ((.cse3 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse4 .cse5 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_6))))) (or (<= (* ~N~0 4) (+ .cse2 .cse3 .cse4 .cse5 .cse6)) (not (= .cse3 4)))))))))) (not (= 4 (select (select (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_487))) (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|)) (.cse12 (select v_ArrVal_487 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))))) (+ .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))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_9))) .cse12)))))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_8))))))))))) (< (+ |c_ULTIMATE.start_main_~i~0#1| 1) ~N~0) (not (< |c_ULTIMATE.start_main_~i~0#1| ~N~0)))) (forall ((~N~0 Int)) (or (forall ((|ULTIMATE.start_main_~i~0#1| Int) (|ULTIMATE.start_main_~a~0#1.offset| Int) (v_ArrVal_487 (Array Int Int))) (or (not (= (select v_ArrVal_487 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) 4)) (forall ((v_subst_10 Int)) (or (not (= (select (select (let ((.cse13 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_487))) (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse14 (select .cse13 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse14 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ (select .cse14 |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select v_ArrVal_487 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))))))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_10 4))) 4)) (forall ((v_subst_7 Int)) (or (forall ((v_subst_5 Int)) (let ((.cse20 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_487))) (let ((.cse21 (select .cse20 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse16 (select .cse21 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse19 (select v_ArrVal_487 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))))) (let ((.cse17 (select (select (store .cse20 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse21 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse16 .cse19))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_10 4))))) (let ((.cse18 (select (select (store .cse20 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse21 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse16 .cse17 .cse19))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_7))))) (let ((.cse15 (select (select (store .cse20 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse21 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse16 .cse17 .cse18 .cse19))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_5))))) (or (not (= 4 .cse15)) (<= (+ .cse16 .cse17 .cse18 .cse19 .cse15) (* ~N~0 4)))))))))) (not (= (select (select (let ((.cse22 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_487))) (store .cse22 |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse23 (select .cse22 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse23 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse24 (select .cse23 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse25 (select v_ArrVal_487 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))))) (+ .cse24 (select (select (store .cse22 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse23 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse24 .cse25))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_10 4))) .cse25)))))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_7))) 4)))))))) (< (+ |c_ULTIMATE.start_main_~i~0#1| 1) ~N~0) (not (< |c_ULTIMATE.start_main_~i~0#1| ~N~0))))) is different from false [2022-07-11 23:32:06,937 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((~N~0 Int)) (or (< (+ 2 |c_ULTIMATE.start_main_~i~0#1|) ~N~0) (not (< (+ |c_ULTIMATE.start_main_~i~0#1| 1) ~N~0)) (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int) (v_subst_11 Int) (v_ArrVal_487 (Array Int Int))) (or (forall ((v_subst_10 Int)) (or (not (= 4 (select (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_487))) (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| (+ (select .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select v_ArrVal_487 (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_11 4)))))))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_10 4))))) (forall ((v_subst_7 Int)) (or (not (= (select (select (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_487))) (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse3 (select .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse4 (select .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse5 (select v_ArrVal_487 (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_11 4))))) (+ .cse4 .cse5 (select (select (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse4 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_10 4))))))))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_7))) 4)) (forall ((v_subst_5 Int)) (let ((.cse11 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_487))) (let ((.cse12 (select .cse11 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse7 (select .cse12 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse8 (select v_ArrVal_487 (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_11 4))))) (let ((.cse10 (select (select (store .cse11 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse12 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse7 .cse8))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_10 4))))) (let ((.cse9 (select (select (store .cse11 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse12 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse7 .cse8 .cse10))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_7))))) (let ((.cse6 (select (select (store .cse11 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse12 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse7 .cse8 .cse9 .cse10))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_5))))) (or (not (= .cse6 4)) (<= (+ .cse7 .cse8 .cse9 .cse6 .cse10) (* ~N~0 4)))))))))))))) (not (= (select v_ArrVal_487 (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_11 4))) 4)))))) (forall ((~N~0 Int)) (or (< (+ 2 |c_ULTIMATE.start_main_~i~0#1|) ~N~0) (not (< (+ |c_ULTIMATE.start_main_~i~0#1| 1) ~N~0)) (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int) (v_subst_12 Int) (v_ArrVal_487 (Array Int Int))) (or (forall ((v_subst_9 Int)) (or (not (= (select (select (let ((.cse13 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_487))) (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse14 (select .cse13 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse14 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ (select .cse14 |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select v_ArrVal_487 (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_12 4)))))))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_9))) 4)) (forall ((v_subst_8 Int)) (or (not (= (select (select (let ((.cse15 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_487))) (store .cse15 |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse16 (select .cse15 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse16 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse17 (select .cse16 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse18 (select v_ArrVal_487 (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_12 4))))) (+ .cse17 .cse18 (select (select (store .cse15 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse16 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse17 .cse18))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_9))))))))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_8))) 4)) (forall ((v_subst_6 Int)) (let ((.cse24 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_487))) (let ((.cse25 (select .cse24 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse20 (select .cse25 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse21 (select v_ArrVal_487 (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_12 4))))) (let ((.cse22 (select (select (store .cse24 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse25 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse20 .cse21))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_9))))) (let ((.cse23 (select (select (store .cse24 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse25 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse20 .cse21 .cse22))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_8))))) (let ((.cse19 (select (select (store .cse24 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse25 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse20 .cse21 .cse22 .cse23))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_6))))) (or (not (= .cse19 4)) (<= (* ~N~0 4) (+ .cse20 .cse19 .cse21 .cse22 .cse23)))))))))))))) (not (= (select v_ArrVal_487 (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_12 4))) 4))))))) is different from false [2022-07-11 23:32:07,157 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((~N~0 Int)) (or (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int) (v_subst_11 Int) (v_ArrVal_487 (Array Int Int))) (or (forall ((v_subst_10 Int)) (or (not (= 4 (select (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_487))) (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| (+ (select .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select v_ArrVal_487 (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_11 4)))))))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_10 4))))) (forall ((v_subst_7 Int)) (or (not (= (select (select (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_487))) (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse3 (select .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse4 (select .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse5 (select v_ArrVal_487 (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_11 4))))) (+ .cse4 .cse5 (select (select (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse4 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_10 4))))))))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_7))) 4)) (forall ((v_subst_5 Int)) (let ((.cse11 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_487))) (let ((.cse12 (select .cse11 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse7 (select .cse12 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse8 (select v_ArrVal_487 (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_11 4))))) (let ((.cse10 (select (select (store .cse11 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse12 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse7 .cse8))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_10 4))))) (let ((.cse9 (select (select (store .cse11 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse12 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse7 .cse8 .cse10))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_7))))) (let ((.cse6 (select (select (store .cse11 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse12 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse7 .cse8 .cse9 .cse10))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_5))))) (or (not (= .cse6 4)) (<= (+ .cse7 .cse8 .cse9 .cse6 .cse10) (* ~N~0 4)))))))))))))) (not (= (select v_ArrVal_487 (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_11 4))) 4)))) (< (+ 3 |c_ULTIMATE.start_main_~i~0#1|) ~N~0) (not (< (+ 2 |c_ULTIMATE.start_main_~i~0#1|) ~N~0)))) (forall ((~N~0 Int)) (or (< (+ 3 |c_ULTIMATE.start_main_~i~0#1|) ~N~0) (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int) (v_subst_12 Int) (v_ArrVal_487 (Array Int Int))) (or (forall ((v_subst_9 Int)) (or (not (= (select (select (let ((.cse13 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_487))) (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse14 (select .cse13 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse14 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ (select .cse14 |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select v_ArrVal_487 (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_12 4)))))))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_9))) 4)) (forall ((v_subst_8 Int)) (or (not (= (select (select (let ((.cse15 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_487))) (store .cse15 |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse16 (select .cse15 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse16 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse17 (select .cse16 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse18 (select v_ArrVal_487 (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_12 4))))) (+ .cse17 .cse18 (select (select (store .cse15 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse16 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse17 .cse18))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_9))))))))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_8))) 4)) (forall ((v_subst_6 Int)) (let ((.cse24 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_487))) (let ((.cse25 (select .cse24 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse20 (select .cse25 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse21 (select v_ArrVal_487 (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_12 4))))) (let ((.cse22 (select (select (store .cse24 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse25 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse20 .cse21))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_9))))) (let ((.cse23 (select (select (store .cse24 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse25 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse20 .cse21 .cse22))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_8))))) (let ((.cse19 (select (select (store .cse24 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse25 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse20 .cse21 .cse22 .cse23))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_6))))) (or (not (= .cse19 4)) (<= (* ~N~0 4) (+ .cse20 .cse19 .cse21 .cse22 .cse23)))))))))))))) (not (= (select v_ArrVal_487 (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_12 4))) 4)))) (not (< (+ 2 |c_ULTIMATE.start_main_~i~0#1|) ~N~0))))) is different from false [2022-07-11 23:32:07,377 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((~N~0 Int)) (or (< (+ |c_ULTIMATE.start_main_~i~0#1| 4) ~N~0) (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int) (v_subst_12 Int) (v_ArrVal_487 (Array Int Int))) (or (forall ((v_subst_9 Int)) (or (not (= (select (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_487))) (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| (+ (select .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select v_ArrVal_487 (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_12 4)))))))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_9))) 4)) (forall ((v_subst_8 Int)) (or (not (= (select (select (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_487))) (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse3 (select .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse4 (select .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse5 (select v_ArrVal_487 (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_12 4))))) (+ .cse4 .cse5 (select (select (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse4 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_9))))))))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_8))) 4)) (forall ((v_subst_6 Int)) (let ((.cse11 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_487))) (let ((.cse12 (select .cse11 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse7 (select .cse12 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse8 (select v_ArrVal_487 (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_12 4))))) (let ((.cse9 (select (select (store .cse11 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse12 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse7 .cse8))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_9))))) (let ((.cse10 (select (select (store .cse11 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse12 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse7 .cse8 .cse9))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_8))))) (let ((.cse6 (select (select (store .cse11 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse12 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse7 .cse8 .cse9 .cse10))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_6))))) (or (not (= .cse6 4)) (<= (* ~N~0 4) (+ .cse7 .cse6 .cse8 .cse9 .cse10)))))))))))))) (not (= (select v_ArrVal_487 (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_12 4))) 4)))) (not (< (+ 3 |c_ULTIMATE.start_main_~i~0#1|) ~N~0)))) (forall ((~N~0 Int)) (or (< (+ |c_ULTIMATE.start_main_~i~0#1| 4) ~N~0) (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int) (v_subst_11 Int) (v_ArrVal_487 (Array Int Int))) (or (forall ((v_subst_10 Int)) (or (not (= 4 (select (select (let ((.cse13 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_487))) (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse14 (select .cse13 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse14 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ (select .cse14 |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select v_ArrVal_487 (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_11 4)))))))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_10 4))))) (forall ((v_subst_7 Int)) (or (not (= (select (select (let ((.cse15 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_487))) (store .cse15 |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse16 (select .cse15 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse16 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse17 (select .cse16 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse18 (select v_ArrVal_487 (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_11 4))))) (+ .cse17 .cse18 (select (select (store .cse15 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse16 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse17 .cse18))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_10 4))))))))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_7))) 4)) (forall ((v_subst_5 Int)) (let ((.cse24 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_487))) (let ((.cse25 (select .cse24 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse20 (select .cse25 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse21 (select v_ArrVal_487 (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_11 4))))) (let ((.cse23 (select (select (store .cse24 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse25 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse20 .cse21))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_10 4))))) (let ((.cse22 (select (select (store .cse24 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse25 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse20 .cse21 .cse23))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_7))))) (let ((.cse19 (select (select (store .cse24 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse25 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse20 .cse21 .cse22 .cse23))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_5))))) (or (not (= .cse19 4)) (<= (+ .cse20 .cse21 .cse22 .cse19 .cse23) (* ~N~0 4)))))))))))))) (not (= (select v_ArrVal_487 (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_11 4))) 4)))) (not (< (+ 3 |c_ULTIMATE.start_main_~i~0#1|) ~N~0))))) is different from false [2022-07-11 23:32:07,540 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 16 not checked. [2022-07-11 23:32:07,540 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1765011097] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-11 23:32:07,540 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-11 23:32:07,541 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 18, 18] total 52 [2022-07-11 23:32:07,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442434246] [2022-07-11 23:32:07,541 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-11 23:32:07,543 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2022-07-11 23:32:07,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:32:07,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2022-07-11 23:32:07,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=2076, Unknown=14, NotChecked=380, Total=2652 [2022-07-11 23:32:07,544 INFO L87 Difference]: Start difference. First operand 32 states and 34 transitions. Second operand has 52 states, 52 states have (on average 1.5384615384615385) internal successors, (80), 52 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:32:08,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:32:08,119 INFO L93 Difference]: Finished difference Result 53 states and 57 transitions. [2022-07-11 23:32:08,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-07-11 23:32:08,119 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 52 states have (on average 1.5384615384615385) internal successors, (80), 52 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-07-11 23:32:08,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:32:08,120 INFO L225 Difference]: With dead ends: 53 [2022-07-11 23:32:08,120 INFO L226 Difference]: Without dead ends: 49 [2022-07-11 23:32:08,120 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 33 SyntacticMatches, 6 SemanticMatches, 54 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 855 ImplicationChecksByTransitivity, 25.9s TimeCoverageRelationStatistics Valid=233, Invalid=2421, Unknown=14, NotChecked=412, Total=3080 [2022-07-11 23:32:08,121 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 10 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 558 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 308 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-11 23:32:08,121 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 117 Invalid, 558 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 241 Invalid, 0 Unknown, 308 Unchecked, 0.1s Time] [2022-07-11 23:32:08,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-07-11 23:32:08,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 46. [2022-07-11 23:32:08,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 45 states have (on average 1.1111111111111112) internal successors, (50), 45 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:32:08,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 50 transitions. [2022-07-11 23:32:08,126 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 50 transitions. Word has length 31 [2022-07-11 23:32:08,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:32:08,126 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 50 transitions. [2022-07-11 23:32:08,127 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 52 states have (on average 1.5384615384615385) internal successors, (80), 52 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:32:08,127 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 50 transitions. [2022-07-11 23:32:08,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-07-11 23:32:08,127 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:32:08,127 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:32:08,144 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2022-07-11 23:32:08,343 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-07-11 23:32:08,344 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:32:08,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:32:08,344 INFO L85 PathProgramCache]: Analyzing trace with hash -1961716541, now seen corresponding path program 3 times [2022-07-11 23:32:08,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:32:08,344 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49023875] [2022-07-11 23:32:08,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:32:08,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:32:08,352 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-11 23:32:08,352 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [395151342] [2022-07-11 23:32:08,352 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-11 23:32:08,352 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:32:08,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:32:08,353 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) [2022-07-11 23:32:08,354 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-07-11 23:32:08,421 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-07-11 23:32:08,421 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-11 23:32:08,422 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 20 conjunts are in the unsatisfiable core [2022-07-11 23:32:08,423 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:32:08,426 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-07-11 23:32:08,438 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-07-11 23:32:08,496 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-11 23:32:08,518 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-11 23:32:08,539 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-11 23:32:08,562 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-11 23:32:08,562 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 23 [2022-07-11 23:32:08,594 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 7 proven. 15 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-07-11 23:32:08,594 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-11 23:32:08,636 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~i~0#1| Int) (v_ArrVal_547 (Array Int Int))) (or (< (+ |ULTIMATE.start_main_~i~0#1| 1) c_~N~0) (not (< |ULTIMATE.start_main_~i~0#1| c_~N~0)) (= 4 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_547) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|))))) is different from false [2022-07-11 23:32:08,750 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-11 23:32:08,750 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2022-07-11 23:32:08,756 INFO L356 Elim1Store]: treesize reduction 12, result has 25.0 percent of original size [2022-07-11 23:32:08,756 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 30 [2022-07-11 23:32:08,766 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 16 trivial. 13 not checked. [2022-07-11 23:32:08,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:32:08,767 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49023875] [2022-07-11 23:32:08,767 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-11 23:32:08,767 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [395151342] [2022-07-11 23:32:08,767 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [395151342] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-11 23:32:08,767 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-11 23:32:08,767 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 15 [2022-07-11 23:32:08,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518798743] [2022-07-11 23:32:08,768 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-11 23:32:08,768 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-07-11 23:32:08,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:32:08,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-07-11 23:32:08,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=129, Unknown=6, NotChecked=24, Total=210 [2022-07-11 23:32:08,769 INFO L87 Difference]: Start difference. First operand 46 states and 50 transitions. Second operand has 15 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 15 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:32:08,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:32:08,859 INFO L93 Difference]: Finished difference Result 55 states and 61 transitions. [2022-07-11 23:32:08,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-11 23:32:08,860 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 15 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-07-11 23:32:08,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:32:08,860 INFO L225 Difference]: With dead ends: 55 [2022-07-11 23:32:08,860 INFO L226 Difference]: Without dead ends: 51 [2022-07-11 23:32:08,861 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 47 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 1 IntricatePredicates, 1 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=145, Unknown=6, NotChecked=26, Total=240 [2022-07-11 23:32:08,865 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 6 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 61 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-11 23:32:08,866 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 38 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 24 Invalid, 0 Unknown, 61 Unchecked, 0.0s Time] [2022-07-11 23:32:08,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-07-11 23:32:08,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2022-07-11 23:32:08,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 50 states have (on average 1.14) internal successors, (57), 50 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:32:08,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 57 transitions. [2022-07-11 23:32:08,877 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 57 transitions. Word has length 31 [2022-07-11 23:32:08,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:32:08,878 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 57 transitions. [2022-07-11 23:32:08,878 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 15 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:32:08,878 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 57 transitions. [2022-07-11 23:32:08,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-07-11 23:32:08,879 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:32:08,879 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:32:08,905 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-07-11 23:32:09,095 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:32:09,095 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:32:09,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:32:09,096 INFO L85 PathProgramCache]: Analyzing trace with hash -1399241145, now seen corresponding path program 11 times [2022-07-11 23:32:09,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:32:09,096 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216397736] [2022-07-11 23:32:09,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:32:09,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:32:09,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:32:09,188 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 9 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:32:09,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:32:09,189 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216397736] [2022-07-11 23:32:09,189 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [216397736] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-11 23:32:09,189 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1685215796] [2022-07-11 23:32:09,189 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-11 23:32:09,189 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:32:09,189 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:32:09,204 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) [2022-07-11 23:32:09,206 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-07-11 23:32:09,285 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2022-07-11 23:32:09,286 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-11 23:32:09,287 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-11 23:32:09,287 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:32:09,378 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 16 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:32:09,378 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-11 23:32:09,422 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 16 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:32:09,422 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1685215796] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-11 23:32:09,422 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-11 23:32:09,422 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 20 [2022-07-11 23:32:09,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607875476] [2022-07-11 23:32:09,422 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-11 23:32:09,422 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-07-11 23:32:09,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:32:09,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-07-11 23:32:09,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=279, Unknown=0, NotChecked=0, Total=380 [2022-07-11 23:32:09,423 INFO L87 Difference]: Start difference. First operand 51 states and 57 transitions. Second operand has 20 states, 20 states have (on average 2.7) internal successors, (54), 20 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) [2022-07-11 23:32:09,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:32:09,629 INFO L93 Difference]: Finished difference Result 69 states and 78 transitions. [2022-07-11 23:32:09,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-11 23:32:09,629 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.7) internal successors, (54), 20 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 33 [2022-07-11 23:32:09,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:32:09,630 INFO L225 Difference]: With dead ends: 69 [2022-07-11 23:32:09,630 INFO L226 Difference]: Without dead ends: 65 [2022-07-11 23:32:09,630 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 57 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=206, Invalid=664, Unknown=0, NotChecked=0, Total=870 [2022-07-11 23:32:09,631 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 53 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 282 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 282 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-11 23:32:09,631 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 33 Invalid, 305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 282 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-11 23:32:09,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-07-11 23:32:09,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 40. [2022-07-11 23:32:09,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 39 states have (on average 1.1538461538461537) internal successors, (45), 39 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) [2022-07-11 23:32:09,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 45 transitions. [2022-07-11 23:32:09,637 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 45 transitions. Word has length 33 [2022-07-11 23:32:09,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:32:09,637 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 45 transitions. [2022-07-11 23:32:09,637 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.7) internal successors, (54), 20 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) [2022-07-11 23:32:09,637 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 45 transitions. [2022-07-11 23:32:09,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-11 23:32:09,638 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:32:09,638 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:32:09,656 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-07-11 23:32:09,838 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-07-11 23:32:09,838 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:32:09,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:32:09,839 INFO L85 PathProgramCache]: Analyzing trace with hash 981485409, now seen corresponding path program 12 times [2022-07-11 23:32:09,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:32:09,839 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621653393] [2022-07-11 23:32:09,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:32:09,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:32:09,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:32:09,940 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 25 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:32:09,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:32:09,940 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621653393] [2022-07-11 23:32:09,940 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [621653393] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-11 23:32:09,940 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1457328739] [2022-07-11 23:32:09,940 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-07-11 23:32:09,940 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:32:09,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:32:09,941 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) [2022-07-11 23:32:09,942 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-07-11 23:32:10,012 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2022-07-11 23:32:10,012 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-11 23:32:10,013 INFO L263 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-11 23:32:10,014 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:32:10,111 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 35 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:32:10,111 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-11 23:32:10,153 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 35 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:32:10,153 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1457328739] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-11 23:32:10,154 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-11 23:32:10,154 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 20 [2022-07-11 23:32:10,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288893190] [2022-07-11 23:32:10,154 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-11 23:32:10,154 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-07-11 23:32:10,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:32:10,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-07-11 23:32:10,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=279, Unknown=0, NotChecked=0, Total=380 [2022-07-11 23:32:10,155 INFO L87 Difference]: Start difference. First operand 40 states and 45 transitions. Second operand has 20 states, 20 states have (on average 2.75) internal successors, (55), 20 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:32:10,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:32:10,278 INFO L93 Difference]: Finished difference Result 78 states and 90 transitions. [2022-07-11 23:32:10,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-11 23:32:10,279 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.75) internal successors, (55), 20 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 34 [2022-07-11 23:32:10,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:32:10,279 INFO L225 Difference]: With dead ends: 78 [2022-07-11 23:32:10,279 INFO L226 Difference]: Without dead ends: 50 [2022-07-11 23:32:10,280 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 60 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=161, Invalid=439, Unknown=0, NotChecked=0, Total=600 [2022-07-11 23:32:10,280 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 60 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-11 23:32:10,280 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 30 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-11 23:32:10,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-07-11 23:32:10,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 42. [2022-07-11 23:32:10,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 41 states have (on average 1.146341463414634) internal successors, (47), 41 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:32:10,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 47 transitions. [2022-07-11 23:32:10,295 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 47 transitions. Word has length 34 [2022-07-11 23:32:10,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:32:10,295 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 47 transitions. [2022-07-11 23:32:10,295 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.75) internal successors, (55), 20 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:32:10,296 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2022-07-11 23:32:10,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-11 23:32:10,296 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:32:10,296 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:32:10,316 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-07-11 23:32:10,499 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-07-11 23:32:10,500 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:32:10,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:32:10,500 INFO L85 PathProgramCache]: Analyzing trace with hash -596322977, now seen corresponding path program 13 times [2022-07-11 23:32:10,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:32:10,500 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119605544] [2022-07-11 23:32:10,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:32:10,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:32:10,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:32:11,178 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:32:11,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:32:11,179 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119605544] [2022-07-11 23:32:11,179 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1119605544] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-11 23:32:11,179 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2011589139] [2022-07-11 23:32:11,179 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-07-11 23:32:11,179 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:32:11,179 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:32:11,180 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) [2022-07-11 23:32:11,181 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-07-11 23:32:11,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:32:11,259 INFO L263 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 73 conjunts are in the unsatisfiable core [2022-07-11 23:32:11,262 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:32:11,267 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-07-11 23:32:11,270 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-11 23:32:11,277 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-11 23:32:11,294 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-11 23:32:11,309 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-11 23:32:11,325 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-11 23:32:11,340 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-11 23:32:11,513 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 27 [2022-07-11 23:32:11,629 INFO L356 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-07-11 23:32:11,630 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 43 [2022-07-11 23:32:11,765 INFO L356 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-07-11 23:32:11,766 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 41 [2022-07-11 23:32:11,905 INFO L356 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-07-11 23:32:11,905 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 43 [2022-07-11 23:32:12,057 INFO L356 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-07-11 23:32:12,058 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 43 [2022-07-11 23:32:12,148 INFO L356 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-07-11 23:32:12,148 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 68 treesize of output 32 [2022-07-11 23:32:12,176 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:32:12,176 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-11 23:33:07,621 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((~N~0 Int)) (or (< (+ |c_ULTIMATE.start_main_~i~0#1| 1) ~N~0) (forall ((v_ArrVal_710 (Array Int Int)) (|ULTIMATE.start_main_~i~0#1| Int) (|ULTIMATE.start_main_~a~0#1.offset| Int)) (or (not (= (select v_ArrVal_710 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) 4)) (forall ((v_subst_20 Int)) (or (forall ((v_subst_17 Int)) (or (not (= (select (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_710))) (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 v_ArrVal_710 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (.cse3 (select .cse1 |c_ULTIMATE.start_main_~#sum~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))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_20 4))) .cse2 .cse3)))))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_17 4))) 4)) (forall ((v_subst_16 Int)) (or (forall ((v_subst_14 Int)) (let ((.cse10 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_710))) (let ((.cse11 (select .cse10 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse7 (select v_ArrVal_710 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (.cse8 (select .cse11 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse6 (select (select (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse11 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse7 .cse8))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_20 4))))) (let ((.cse5 (select (select (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse11 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse6 .cse7 .cse8))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_17 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| (+ .cse5 .cse6 .cse7 .cse8))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_16 4))))) (let ((.cse4 (select (select (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse11 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse5 .cse6 .cse7 .cse8 .cse9))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_14 4))))) (or (<= (* ~N~0 4) (+ .cse4 .cse5 .cse6 .cse7 .cse8 .cse9)) (not (= .cse4 4))))))))))) (not (= (select (select (let ((.cse12 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_710))) (store .cse12 |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse13 (select .cse12 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse15 (select v_ArrVal_710 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (.cse16 (select .cse13 |c_ULTIMATE.start_main_~#sum~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| (+ .cse15 .cse16))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_20 4))))) (+ (select (select (store .cse12 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse14 .cse15 .cse16))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_17 4))) .cse14 .cse15 .cse16))))))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_16 4))) 4)))))) (not (= (select (select (let ((.cse17 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_710))) (store .cse17 |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse18 (select .cse17 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse18 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ (select v_ArrVal_710 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) (select .cse18 |c_ULTIMATE.start_main_~#sum~0#1.offset|)))))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_20 4))) 4)))))) (not (< |c_ULTIMATE.start_main_~i~0#1| ~N~0)))) (forall ((~N~0 Int)) (or (forall ((v_ArrVal_710 (Array Int Int)) (|ULTIMATE.start_main_~i~0#1| Int) (|ULTIMATE.start_main_~a~0#1.offset| Int)) (or (forall ((v_subst_19 Int)) (or (not (= 4 (select (select (let ((.cse19 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_710))) (store .cse19 |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse20 (select .cse19 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse20 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ (select v_ArrVal_710 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) (select .cse20 |c_ULTIMATE.start_main_~#sum~0#1.offset|)))))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_19 4))))) (forall ((v_subst_18 Int)) (or (not (= (select (select (let ((.cse21 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_710))) (store .cse21 |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse22 (select .cse21 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse22 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse23 (select v_ArrVal_710 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (.cse24 (select .cse22 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ .cse23 .cse24 (select (select (store .cse21 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse22 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse23 .cse24))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_19 4))))))))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_18 4))) 4)) (forall ((v_subst_15 Int)) (or (forall ((v_subst_13 Int)) (let ((.cse31 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_710))) (let ((.cse32 (select .cse31 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse28 (select v_ArrVal_710 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (.cse29 (select .cse32 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse30 (select (select (store .cse31 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse32 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse28 .cse29))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_19 4))))) (let ((.cse27 (select (select (store .cse31 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse32 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse28 .cse29 .cse30))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_18 4))))) (let ((.cse26 (select (select (store .cse31 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse32 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse27 .cse28 .cse29 .cse30))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_15 4))))) (let ((.cse25 (select (select (store .cse31 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse32 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse26 .cse27 .cse28 .cse29 .cse30))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* v_subst_13 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (or (not (= .cse25 4)) (<= (+ .cse25 .cse26 .cse27 .cse28 .cse29 .cse30) (* ~N~0 4))))))))))) (not (= (select (select (let ((.cse33 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_710))) (store .cse33 |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse34 (select .cse33 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse34 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse35 (select v_ArrVal_710 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (.cse36 (select .cse34 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse37 (select (select (store .cse33 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse34 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse35 .cse36))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_19 4))))) (+ (select (select (store .cse33 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse34 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse35 .cse36 .cse37))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_18 4))) .cse35 .cse36 .cse37))))))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_15 4))) 4)))))))) (not (= (select v_ArrVal_710 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) 4)))) (< (+ |c_ULTIMATE.start_main_~i~0#1| 1) ~N~0) (not (< |c_ULTIMATE.start_main_~i~0#1| ~N~0))))) is different from false [2022-07-11 23:33:07,875 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((~N~0 Int)) (or (< (+ 2 |c_ULTIMATE.start_main_~i~0#1|) ~N~0) (not (< (+ |c_ULTIMATE.start_main_~i~0#1| 1) ~N~0)) (forall ((v_ArrVal_710 (Array Int Int)) (|ULTIMATE.start_main_~a~0#1.offset| Int) (v_subst_22 Int)) (or (not (= (select v_ArrVal_710 (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_22 4))) 4)) (forall ((v_subst_20 Int)) (or (not (= 4 (select (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_710))) (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| (+ (select v_ArrVal_710 (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_22 4))) (select .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset|)))))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_20 4))))) (forall ((v_subst_17 Int)) (or (not (= (select (select (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_710))) (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse3 (select .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse4 (select v_ArrVal_710 (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_22 4)))) (.cse5 (select .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ .cse4 .cse5 (select (select (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse4 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_20 4))))))))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_17 4))) 4)) (forall ((v_subst_16 Int)) (or (not (= (select (select (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_710))) (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse7 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse8 (select v_ArrVal_710 (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_22 4)))) (.cse9 (select .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse10 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse8 .cse9))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_20 4))))) (+ (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse8 .cse9 .cse10))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_17 4))) .cse8 .cse9 .cse10))))))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_16 4))) 4)) (forall ((v_subst_14 Int)) (let ((.cse17 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_710))) (let ((.cse18 (select .cse17 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse14 (select v_ArrVal_710 (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_22 4)))) (.cse15 (select .cse18 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse16 (select (select (store .cse17 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse18 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse14 .cse15))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_20 4))))) (let ((.cse13 (select (select (store .cse17 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse18 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse14 .cse15 .cse16))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_17 4))))) (let ((.cse12 (select (select (store .cse17 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse18 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse13 .cse14 .cse15 .cse16))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_16 4))))) (let ((.cse11 (select (select (store .cse17 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse18 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse12 .cse13 .cse14 .cse15 .cse16))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_14 4))))) (or (not (= .cse11 4)) (<= (* ~N~0 4) (+ .cse12 .cse13 .cse14 .cse15 .cse11 .cse16))))))))))))))))))))) (forall ((~N~0 Int)) (or (forall ((v_ArrVal_710 (Array Int Int)) (|ULTIMATE.start_main_~a~0#1.offset| Int) (v_subst_21 Int)) (or (forall ((v_subst_19 Int)) (or (not (= (select (select (let ((.cse19 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_710))) (store .cse19 |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse20 (select .cse19 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse20 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ (select .cse20 |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select v_ArrVal_710 (+ (* v_subst_21 4) |ULTIMATE.start_main_~a~0#1.offset|))))))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_19 4))) 4)) (forall ((v_subst_18 Int)) (or (not (= (select (select (let ((.cse21 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_710))) (store .cse21 |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse22 (select .cse21 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse22 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse23 (select .cse22 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse24 (select v_ArrVal_710 (+ (* v_subst_21 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (+ (select (select (store .cse21 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse22 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse23 .cse24))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_19 4))) .cse23 .cse24)))))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_18 4))) 4)) (forall ((v_subst_15 Int)) (or (not (= (select (select (let ((.cse25 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_710))) (store .cse25 |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse26 (select .cse25 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse26 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse28 (select .cse26 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse29 (select v_ArrVal_710 (+ (* v_subst_21 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse27 (select (select (store .cse25 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse26 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse28 .cse29))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_19 4))))) (+ (select (select (store .cse25 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse26 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse27 .cse28 .cse29))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_18 4))) .cse27 .cse28 .cse29))))))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_15 4))) 4)) (forall ((v_subst_13 Int)) (let ((.cse36 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_710))) (let ((.cse37 (select .cse36 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse34 (select .cse37 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse35 (select v_ArrVal_710 (+ (* v_subst_21 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse33 (select (select (store .cse36 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse37 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse34 .cse35))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_19 4))))) (let ((.cse32 (select (select (store .cse36 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse37 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse33 .cse34 .cse35))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_18 4))))) (let ((.cse31 (select (select (store .cse36 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse37 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse32 .cse33 .cse34 .cse35))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_15 4))))) (let ((.cse30 (select (select (store .cse36 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse37 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse31 .cse32 .cse33 .cse34 .cse35))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* v_subst_13 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (or (not (= .cse30 4)) (<= (+ .cse31 .cse32 .cse30 .cse33 .cse34 .cse35) (* ~N~0 4))))))))))))))))) (not (= (select v_ArrVal_710 (+ (* v_subst_21 4) |ULTIMATE.start_main_~a~0#1.offset|)) 4)))) (< (+ 2 |c_ULTIMATE.start_main_~i~0#1|) ~N~0) (not (< (+ |c_ULTIMATE.start_main_~i~0#1| 1) ~N~0))))) is different from false [2022-07-11 23:33:08,228 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((~N~0 Int)) (or (forall ((v_ArrVal_710 (Array Int Int)) (|ULTIMATE.start_main_~a~0#1.offset| Int) (v_subst_21 Int)) (or (forall ((v_subst_19 Int)) (or (not (= (select (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_710))) (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| (+ (select .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select v_ArrVal_710 (+ (* v_subst_21 4) |ULTIMATE.start_main_~a~0#1.offset|))))))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_19 4))) 4)) (forall ((v_subst_18 Int)) (or (not (= (select (select (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_710))) (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse3 (select .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse4 (select .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse5 (select v_ArrVal_710 (+ (* v_subst_21 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (+ (select (select (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse4 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_19 4))) .cse4 .cse5)))))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_18 4))) 4)) (forall ((v_subst_15 Int)) (or (not (= (select (select (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_710))) (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse7 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse9 (select .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse10 (select v_ArrVal_710 (+ (* v_subst_21 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse8 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse9 .cse10))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_19 4))))) (+ (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse8 .cse9 .cse10))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_18 4))) .cse8 .cse9 .cse10))))))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_15 4))) 4)) (forall ((v_subst_13 Int)) (let ((.cse17 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_710))) (let ((.cse18 (select .cse17 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse15 (select .cse18 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse16 (select v_ArrVal_710 (+ (* v_subst_21 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse14 (select (select (store .cse17 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse18 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse15 .cse16))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_19 4))))) (let ((.cse13 (select (select (store .cse17 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse18 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse14 .cse15 .cse16))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_18 4))))) (let ((.cse12 (select (select (store .cse17 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse18 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse13 .cse14 .cse15 .cse16))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_15 4))))) (let ((.cse11 (select (select (store .cse17 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse18 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse12 .cse13 .cse14 .cse15 .cse16))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* v_subst_13 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (or (not (= .cse11 4)) (<= (+ .cse12 .cse13 .cse11 .cse14 .cse15 .cse16) (* ~N~0 4))))))))))))))))) (not (= (select v_ArrVal_710 (+ (* v_subst_21 4) |ULTIMATE.start_main_~a~0#1.offset|)) 4)))) (< (+ 3 |c_ULTIMATE.start_main_~i~0#1|) ~N~0) (not (< (+ 2 |c_ULTIMATE.start_main_~i~0#1|) ~N~0)))) (forall ((~N~0 Int)) (or (< (+ 3 |c_ULTIMATE.start_main_~i~0#1|) ~N~0) (not (< (+ 2 |c_ULTIMATE.start_main_~i~0#1|) ~N~0)) (forall ((v_ArrVal_710 (Array Int Int)) (|ULTIMATE.start_main_~a~0#1.offset| Int) (v_subst_22 Int)) (or (not (= (select v_ArrVal_710 (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_22 4))) 4)) (forall ((v_subst_20 Int)) (or (not (= 4 (select (select (let ((.cse19 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_710))) (store .cse19 |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse20 (select .cse19 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse20 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ (select v_ArrVal_710 (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_22 4))) (select .cse20 |c_ULTIMATE.start_main_~#sum~0#1.offset|)))))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_20 4))))) (forall ((v_subst_17 Int)) (or (not (= (select (select (let ((.cse21 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_710))) (store .cse21 |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse22 (select .cse21 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse22 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse23 (select v_ArrVal_710 (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_22 4)))) (.cse24 (select .cse22 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ .cse23 .cse24 (select (select (store .cse21 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse22 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse23 .cse24))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_20 4))))))))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_17 4))) 4)) (forall ((v_subst_16 Int)) (or (not (= (select (select (let ((.cse25 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_710))) (store .cse25 |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse26 (select .cse25 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse26 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse27 (select v_ArrVal_710 (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_22 4)))) (.cse28 (select .cse26 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse29 (select (select (store .cse25 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse26 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse27 .cse28))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_20 4))))) (+ (select (select (store .cse25 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse26 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse27 .cse28 .cse29))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_17 4))) .cse27 .cse28 .cse29))))))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_16 4))) 4)) (forall ((v_subst_14 Int)) (let ((.cse36 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_710))) (let ((.cse37 (select .cse36 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse33 (select v_ArrVal_710 (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_22 4)))) (.cse34 (select .cse37 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse35 (select (select (store .cse36 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse37 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse33 .cse34))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_20 4))))) (let ((.cse32 (select (select (store .cse36 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse37 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse33 .cse34 .cse35))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_17 4))))) (let ((.cse31 (select (select (store .cse36 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse37 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse32 .cse33 .cse34 .cse35))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_16 4))))) (let ((.cse30 (select (select (store .cse36 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse37 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse31 .cse32 .cse33 .cse34 .cse35))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_14 4))))) (or (not (= .cse30 4)) (<= (* ~N~0 4) (+ .cse31 .cse32 .cse33 .cse34 .cse30 .cse35)))))))))))))))))))))) is different from false [2022-07-11 23:33:08,546 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((~N~0 Int)) (or (forall ((v_ArrVal_710 (Array Int Int)) (|ULTIMATE.start_main_~a~0#1.offset| Int) (v_subst_21 Int)) (or (forall ((v_subst_19 Int)) (or (not (= (select (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_710))) (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| (+ (select .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select v_ArrVal_710 (+ (* v_subst_21 4) |ULTIMATE.start_main_~a~0#1.offset|))))))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_19 4))) 4)) (forall ((v_subst_18 Int)) (or (not (= (select (select (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_710))) (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse3 (select .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse4 (select .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse5 (select v_ArrVal_710 (+ (* v_subst_21 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (+ (select (select (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse4 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_19 4))) .cse4 .cse5)))))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_18 4))) 4)) (forall ((v_subst_15 Int)) (or (not (= (select (select (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_710))) (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse7 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse9 (select .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse10 (select v_ArrVal_710 (+ (* v_subst_21 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse8 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse9 .cse10))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_19 4))))) (+ (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse8 .cse9 .cse10))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_18 4))) .cse8 .cse9 .cse10))))))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_15 4))) 4)) (forall ((v_subst_13 Int)) (let ((.cse17 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_710))) (let ((.cse18 (select .cse17 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse15 (select .cse18 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse16 (select v_ArrVal_710 (+ (* v_subst_21 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse14 (select (select (store .cse17 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse18 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse15 .cse16))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_19 4))))) (let ((.cse13 (select (select (store .cse17 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse18 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse14 .cse15 .cse16))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_18 4))))) (let ((.cse12 (select (select (store .cse17 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse18 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse13 .cse14 .cse15 .cse16))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_15 4))))) (let ((.cse11 (select (select (store .cse17 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse18 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse12 .cse13 .cse14 .cse15 .cse16))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* v_subst_13 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (or (not (= .cse11 4)) (<= (+ .cse12 .cse13 .cse11 .cse14 .cse15 .cse16) (* ~N~0 4))))))))))))))))) (not (= (select v_ArrVal_710 (+ (* v_subst_21 4) |ULTIMATE.start_main_~a~0#1.offset|)) 4)))) (< (+ |c_ULTIMATE.start_main_~i~0#1| 4) ~N~0) (not (< (+ 3 |c_ULTIMATE.start_main_~i~0#1|) ~N~0)))) (forall ((~N~0 Int)) (or (< (+ |c_ULTIMATE.start_main_~i~0#1| 4) ~N~0) (not (< (+ 3 |c_ULTIMATE.start_main_~i~0#1|) ~N~0)) (forall ((v_ArrVal_710 (Array Int Int)) (|ULTIMATE.start_main_~a~0#1.offset| Int) (v_subst_22 Int)) (or (not (= (select v_ArrVal_710 (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_22 4))) 4)) (forall ((v_subst_20 Int)) (or (not (= 4 (select (select (let ((.cse19 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_710))) (store .cse19 |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse20 (select .cse19 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse20 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ (select v_ArrVal_710 (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_22 4))) (select .cse20 |c_ULTIMATE.start_main_~#sum~0#1.offset|)))))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_20 4))))) (forall ((v_subst_17 Int)) (or (not (= (select (select (let ((.cse21 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_710))) (store .cse21 |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse22 (select .cse21 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse22 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse23 (select v_ArrVal_710 (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_22 4)))) (.cse24 (select .cse22 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ .cse23 .cse24 (select (select (store .cse21 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse22 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse23 .cse24))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_20 4))))))))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_17 4))) 4)) (forall ((v_subst_16 Int)) (or (not (= (select (select (let ((.cse25 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_710))) (store .cse25 |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse26 (select .cse25 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse26 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse27 (select v_ArrVal_710 (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_22 4)))) (.cse28 (select .cse26 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse29 (select (select (store .cse25 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse26 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse27 .cse28))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_20 4))))) (+ (select (select (store .cse25 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse26 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse27 .cse28 .cse29))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_17 4))) .cse27 .cse28 .cse29))))))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_16 4))) 4)) (forall ((v_subst_14 Int)) (let ((.cse36 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_710))) (let ((.cse37 (select .cse36 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse33 (select v_ArrVal_710 (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_22 4)))) (.cse34 (select .cse37 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse35 (select (select (store .cse36 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse37 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse33 .cse34))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_20 4))))) (let ((.cse32 (select (select (store .cse36 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse37 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse33 .cse34 .cse35))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_17 4))))) (let ((.cse31 (select (select (store .cse36 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse37 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse32 .cse33 .cse34 .cse35))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_16 4))))) (let ((.cse30 (select (select (store .cse36 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse37 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse31 .cse32 .cse33 .cse34 .cse35))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_14 4))))) (or (not (= .cse30 4)) (<= (* ~N~0 4) (+ .cse31 .cse32 .cse33 .cse34 .cse30 .cse35)))))))))))))))))))))) is different from false [2022-07-11 23:33:08,944 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((~N~0 Int)) (or (not (< (+ |c_ULTIMATE.start_main_~i~0#1| 4) ~N~0)) (< (+ 5 |c_ULTIMATE.start_main_~i~0#1|) ~N~0) (forall ((v_ArrVal_710 (Array Int Int)) (|ULTIMATE.start_main_~a~0#1.offset| Int) (v_subst_22 Int)) (or (not (= (select v_ArrVal_710 (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_22 4))) 4)) (forall ((v_subst_20 Int)) (or (not (= 4 (select (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_710))) (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| (+ (select v_ArrVal_710 (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_22 4))) (select .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset|)))))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_20 4))))) (forall ((v_subst_17 Int)) (or (not (= (select (select (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_710))) (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse3 (select .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse4 (select v_ArrVal_710 (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_22 4)))) (.cse5 (select .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ .cse4 .cse5 (select (select (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse4 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_20 4))))))))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_17 4))) 4)) (forall ((v_subst_16 Int)) (or (not (= (select (select (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_710))) (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse7 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse8 (select v_ArrVal_710 (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_22 4)))) (.cse9 (select .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse10 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse8 .cse9))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_20 4))))) (+ (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse8 .cse9 .cse10))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_17 4))) .cse8 .cse9 .cse10))))))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_16 4))) 4)) (forall ((v_subst_14 Int)) (let ((.cse17 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_710))) (let ((.cse18 (select .cse17 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse14 (select v_ArrVal_710 (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_22 4)))) (.cse15 (select .cse18 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse16 (select (select (store .cse17 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse18 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse14 .cse15))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_20 4))))) (let ((.cse13 (select (select (store .cse17 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse18 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse14 .cse15 .cse16))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_17 4))))) (let ((.cse12 (select (select (store .cse17 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse18 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse13 .cse14 .cse15 .cse16))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_16 4))))) (let ((.cse11 (select (select (store .cse17 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse18 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse12 .cse13 .cse14 .cse15 .cse16))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_14 4))))) (or (not (= .cse11 4)) (<= (* ~N~0 4) (+ .cse12 .cse13 .cse14 .cse15 .cse11 .cse16))))))))))))))))))))) (forall ((~N~0 Int)) (or (forall ((v_ArrVal_710 (Array Int Int)) (|ULTIMATE.start_main_~a~0#1.offset| Int) (v_subst_21 Int)) (or (forall ((v_subst_19 Int)) (or (not (= (select (select (let ((.cse19 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_710))) (store .cse19 |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse20 (select .cse19 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse20 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ (select .cse20 |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select v_ArrVal_710 (+ (* v_subst_21 4) |ULTIMATE.start_main_~a~0#1.offset|))))))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_19 4))) 4)) (forall ((v_subst_18 Int)) (or (not (= (select (select (let ((.cse21 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_710))) (store .cse21 |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse22 (select .cse21 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse22 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse23 (select .cse22 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse24 (select v_ArrVal_710 (+ (* v_subst_21 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (+ (select (select (store .cse21 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse22 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse23 .cse24))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_19 4))) .cse23 .cse24)))))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_18 4))) 4)) (forall ((v_subst_15 Int)) (or (not (= (select (select (let ((.cse25 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_710))) (store .cse25 |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse26 (select .cse25 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse26 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse28 (select .cse26 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse29 (select v_ArrVal_710 (+ (* v_subst_21 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse27 (select (select (store .cse25 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse26 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse28 .cse29))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_19 4))))) (+ (select (select (store .cse25 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse26 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse27 .cse28 .cse29))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_18 4))) .cse27 .cse28 .cse29))))))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_15 4))) 4)) (forall ((v_subst_13 Int)) (let ((.cse36 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_710))) (let ((.cse37 (select .cse36 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse34 (select .cse37 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse35 (select v_ArrVal_710 (+ (* v_subst_21 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse33 (select (select (store .cse36 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse37 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse34 .cse35))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_19 4))))) (let ((.cse32 (select (select (store .cse36 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse37 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse33 .cse34 .cse35))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_18 4))))) (let ((.cse31 (select (select (store .cse36 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse37 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse32 .cse33 .cse34 .cse35))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_15 4))))) (let ((.cse30 (select (select (store .cse36 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse37 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse31 .cse32 .cse33 .cse34 .cse35))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* v_subst_13 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (or (not (= .cse30 4)) (<= (+ .cse31 .cse32 .cse30 .cse33 .cse34 .cse35) (* ~N~0 4))))))))))))))))) (not (= (select v_ArrVal_710 (+ (* v_subst_21 4) |ULTIMATE.start_main_~a~0#1.offset|)) 4)))) (not (< (+ |c_ULTIMATE.start_main_~i~0#1| 4) ~N~0)) (< (+ 5 |c_ULTIMATE.start_main_~i~0#1|) ~N~0)))) is different from false [2022-07-11 23:33:09,243 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-11 23:33:09,244 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 1901 treesize of output 1 [2022-07-11 23:33:09,272 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-11 23:33:09,273 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 1901 treesize of output 1 [2022-07-11 23:33:09,276 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 25 not checked. [2022-07-11 23:33:09,276 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2011589139] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-11 23:33:09,276 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-11 23:33:09,276 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 21, 21] total 57 [2022-07-11 23:33:09,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432480638] [2022-07-11 23:33:09,276 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-11 23:33:09,278 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2022-07-11 23:33:09,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:33:09,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2022-07-11 23:33:09,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=200, Invalid=2444, Unknown=28, NotChecked=520, Total=3192 [2022-07-11 23:33:09,279 INFO L87 Difference]: Start difference. First operand 42 states and 47 transitions. Second operand has 57 states, 57 states have (on average 1.5087719298245614) internal successors, (86), 57 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:33:10,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:33:10,037 INFO L93 Difference]: Finished difference Result 65 states and 73 transitions. [2022-07-11 23:33:10,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-07-11 23:33:10,038 INFO L78 Accepts]: Start accepts. Automaton has has 57 states, 57 states have (on average 1.5087719298245614) internal successors, (86), 57 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2022-07-11 23:33:10,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:33:10,039 INFO L225 Difference]: With dead ends: 65 [2022-07-11 23:33:10,039 INFO L226 Difference]: Without dead ends: 61 [2022-07-11 23:33:10,040 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 42 SyntacticMatches, 8 SemanticMatches, 58 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 839 ImplicationChecksByTransitivity, 56.2s TimeCoverageRelationStatistics Valid=240, Invalid=2722, Unknown=28, NotChecked=550, Total=3540 [2022-07-11 23:33:10,041 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 20 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 335 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 920 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 335 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 582 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-11 23:33:10,041 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 184 Invalid, 920 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 335 Invalid, 0 Unknown, 582 Unchecked, 0.3s Time] [2022-07-11 23:33:10,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-07-11 23:33:10,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 56. [2022-07-11 23:33:10,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 55 states have (on average 1.1454545454545455) internal successors, (63), 55 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) [2022-07-11 23:33:10,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 63 transitions. [2022-07-11 23:33:10,048 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 63 transitions. Word has length 36 [2022-07-11 23:33:10,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:33:10,049 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 63 transitions. [2022-07-11 23:33:10,049 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 57 states have (on average 1.5087719298245614) internal successors, (86), 57 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:33:10,049 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 63 transitions. [2022-07-11 23:33:10,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-11 23:33:10,049 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:33:10,049 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:33:10,069 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-07-11 23:33:10,259 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:33:10,260 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:33:10,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:33:10,260 INFO L85 PathProgramCache]: Analyzing trace with hash 83735393, now seen corresponding path program 4 times [2022-07-11 23:33:10,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:33:10,260 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410454130] [2022-07-11 23:33:10,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:33:10,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:33:10,276 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-11 23:33:10,276 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1661492637] [2022-07-11 23:33:10,276 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-11 23:33:10,276 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:33:10,276 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:33:10,296 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) [2022-07-11 23:33:10,297 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-07-11 23:33:10,365 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-11 23:33:10,365 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-11 23:33:10,366 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 31 conjunts are in the unsatisfiable core [2022-07-11 23:33:10,368 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:33:10,474 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-07-11 23:33:10,553 INFO L356 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-07-11 23:33:10,553 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2022-07-11 23:33:10,646 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:33:10,647 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-11 23:33:10,700 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:33:10,701 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-11 23:33:10,757 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:33:10,757 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-11 23:33:10,812 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-07-11 23:33:10,834 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 18 proven. 40 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-11 23:33:10,834 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-11 23:33:10,915 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_781 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_781) |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)) 4)) is different from false [2022-07-11 23:33:10,925 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_781 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_781) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) 4)) is different from false [2022-07-11 23:33:10,937 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_781 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_781) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) 12 |c_ULTIMATE.start_main_~a~0#1.offset|)) 4)) is different from false [2022-07-11 23:33:10,957 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_781 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_781) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 12 |c_ULTIMATE.start_main_~a~0#1.offset|)) 4)) is different from false [2022-07-11 23:33:10,970 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_781 (Array Int Int)) (v_ArrVal_777 Int)) (= 4 (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_777)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_781) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 12 |c_ULTIMATE.start_main_~a~0#1.offset|)))) is different from false [2022-07-11 23:33:10,988 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_243| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_243|)) (forall ((v_ArrVal_781 (Array Int Int)) (v_ArrVal_777 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_243| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_777)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_781) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 12 |c_ULTIMATE.start_main_~a~0#1.offset|)) 4)))) is different from false [2022-07-11 23:33:11,025 INFO L356 Elim1Store]: treesize reduction 37, result has 40.3 percent of original size [2022-07-11 23:33:11,025 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 37 [2022-07-11 23:33:11,039 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-11 23:33:11,040 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 38 [2022-07-11 23:33:11,044 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-11 23:33:11,178 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 18 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 31 not checked. [2022-07-11 23:33:11,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:33:11,178 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410454130] [2022-07-11 23:33:11,178 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-11 23:33:11,178 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1661492637] [2022-07-11 23:33:11,178 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1661492637] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-11 23:33:11,178 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-11 23:33:11,178 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 27 [2022-07-11 23:33:11,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240484057] [2022-07-11 23:33:11,179 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-11 23:33:11,179 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-07-11 23:33:11,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:33:11,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-07-11 23:33:11,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=364, Unknown=6, NotChecked=258, Total=702 [2022-07-11 23:33:11,179 INFO L87 Difference]: Start difference. First operand 56 states and 63 transitions. Second operand has 27 states, 27 states have (on average 2.1481481481481484) internal successors, (58), 27 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:33:13,338 WARN L833 $PredicateComparison]: unable to prove that (and (< (+ |c_ULTIMATE.start_main_~a~0#1.base| 1) |c_ULTIMATE.start_main_~#sum~0#1.base|) (= (+ (- 2) |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) (forall ((|v_ULTIMATE.start_main_~i~0#1_243| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_243|)) (forall ((v_ArrVal_781 (Array Int Int)) (v_ArrVal_777 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_243| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_777)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_781) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 12 |c_ULTIMATE.start_main_~a~0#1.offset|)) 4))))) is different from false [2022-07-11 23:33:13,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:33:13,764 INFO L93 Difference]: Finished difference Result 69 states and 78 transitions. [2022-07-11 23:33:13,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-11 23:33:13,765 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 2.1481481481481484) internal successors, (58), 27 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2022-07-11 23:33:13,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:33:13,765 INFO L225 Difference]: With dead ends: 69 [2022-07-11 23:33:13,765 INFO L226 Difference]: Without dead ends: 60 [2022-07-11 23:33:13,765 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 45 SyntacticMatches, 5 SemanticMatches, 31 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=105, Invalid=566, Unknown=7, NotChecked=378, Total=1056 [2022-07-11 23:33:13,766 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 28 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 294 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 529 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 294 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 193 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-11 23:33:13,766 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 66 Invalid, 529 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 294 Invalid, 0 Unknown, 193 Unchecked, 0.3s Time] [2022-07-11 23:33:13,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-07-11 23:33:13,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 59. [2022-07-11 23:33:13,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 58 states have (on average 1.1206896551724137) internal successors, (65), 58 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:33:13,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 65 transitions. [2022-07-11 23:33:13,773 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 65 transitions. Word has length 36 [2022-07-11 23:33:13,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:33:13,773 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 65 transitions. [2022-07-11 23:33:13,773 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 2.1481481481481484) internal successors, (58), 27 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:33:13,773 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 65 transitions. [2022-07-11 23:33:13,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-07-11 23:33:13,773 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:33:13,773 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:33:13,793 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2022-07-11 23:33:13,993 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:33:13,994 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:33:13,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:33:13,994 INFO L85 PathProgramCache]: Analyzing trace with hash -746726435, now seen corresponding path program 14 times [2022-07-11 23:33:13,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:33:13,994 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616694994] [2022-07-11 23:33:13,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:33:13,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:33:14,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:33:14,145 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 16 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:33:14,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:33:14,145 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616694994] [2022-07-11 23:33:14,145 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [616694994] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-11 23:33:14,145 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1324222729] [2022-07-11 23:33:14,145 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-11 23:33:14,145 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:33:14,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:33:14,146 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) [2022-07-11 23:33:14,150 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-07-11 23:33:14,218 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-11 23:33:14,218 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-11 23:33:14,219 INFO L263 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 14 conjunts are in the unsatisfiable core [2022-07-11 23:33:14,220 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:33:14,386 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 25 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:33:14,386 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-11 23:33:14,467 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 25 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:33:14,467 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1324222729] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-11 23:33:14,468 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-11 23:33:14,468 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 23 [2022-07-11 23:33:14,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971152803] [2022-07-11 23:33:14,468 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-11 23:33:14,468 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-07-11 23:33:14,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:33:14,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-07-11 23:33:14,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=375, Unknown=0, NotChecked=0, Total=506 [2022-07-11 23:33:14,469 INFO L87 Difference]: Start difference. First operand 59 states and 65 transitions. Second operand has 23 states, 23 states have (on average 2.6956521739130435) internal successors, (62), 23 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:33:14,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:33:14,880 INFO L93 Difference]: Finished difference Result 77 states and 86 transitions. [2022-07-11 23:33:14,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-07-11 23:33:14,881 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.6956521739130435) internal successors, (62), 23 states have internal predecessors, (62), 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 38 [2022-07-11 23:33:14,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:33:14,881 INFO L225 Difference]: With dead ends: 77 [2022-07-11 23:33:14,881 INFO L226 Difference]: Without dead ends: 73 [2022-07-11 23:33:14,881 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 66 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 319 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=274, Invalid=916, Unknown=0, NotChecked=0, Total=1190 [2022-07-11 23:33:14,882 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 62 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 369 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 393 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 369 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-11 23:33:14,882 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 25 Invalid, 393 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 369 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-11 23:33:14,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-07-11 23:33:14,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 45. [2022-07-11 23:33:14,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 44 states have (on average 1.1363636363636365) internal successors, (50), 44 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:33:14,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 50 transitions. [2022-07-11 23:33:14,887 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 50 transitions. Word has length 38 [2022-07-11 23:33:14,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:33:14,888 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 50 transitions. [2022-07-11 23:33:14,888 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.6956521739130435) internal successors, (62), 23 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:33:14,888 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 50 transitions. [2022-07-11 23:33:14,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-07-11 23:33:14,888 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:33:14,888 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:33:14,906 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-07-11 23:33:15,101 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:33:15,101 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:33:15,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:33:15,102 INFO L85 PathProgramCache]: Analyzing trace with hash 465948487, now seen corresponding path program 15 times [2022-07-11 23:33:15,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:33:15,102 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906711730] [2022-07-11 23:33:15,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:33:15,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:33:15,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:33:15,291 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 38 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:33:15,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:33:15,291 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906711730] [2022-07-11 23:33:15,292 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [906711730] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-11 23:33:15,292 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [197571497] [2022-07-11 23:33:15,292 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-11 23:33:15,292 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:33:15,292 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:33:15,300 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) [2022-07-11 23:33:15,301 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-07-11 23:33:15,393 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2022-07-11 23:33:15,393 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-11 23:33:15,394 INFO L263 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 14 conjunts are in the unsatisfiable core [2022-07-11 23:33:15,395 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:33:15,538 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 51 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:33:15,538 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-11 23:33:15,605 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 51 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:33:15,606 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [197571497] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-11 23:33:15,606 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-11 23:33:15,606 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 23 [2022-07-11 23:33:15,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993679717] [2022-07-11 23:33:15,606 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-11 23:33:15,607 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-07-11 23:33:15,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:33:15,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-07-11 23:33:15,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=375, Unknown=0, NotChecked=0, Total=506 [2022-07-11 23:33:15,607 INFO L87 Difference]: Start difference. First operand 45 states and 50 transitions. Second operand has 23 states, 23 states have (on average 2.739130434782609) internal successors, (63), 23 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) [2022-07-11 23:33:15,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:33:15,839 INFO L93 Difference]: Finished difference Result 86 states and 98 transitions. [2022-07-11 23:33:15,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-11 23:33:15,864 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.739130434782609) internal successors, (63), 23 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 39 [2022-07-11 23:33:15,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:33:15,864 INFO L225 Difference]: With dead ends: 86 [2022-07-11 23:33:15,864 INFO L226 Difference]: Without dead ends: 55 [2022-07-11 23:33:15,866 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 69 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 211 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=212, Invalid=600, Unknown=0, NotChecked=0, Total=812 [2022-07-11 23:33:15,867 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 68 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 208 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-11 23:33:15,868 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 34 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 208 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-11 23:33:15,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-07-11 23:33:15,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 47. [2022-07-11 23:33:15,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 46 states have (on average 1.1304347826086956) internal successors, (52), 46 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) [2022-07-11 23:33:15,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 52 transitions. [2022-07-11 23:33:15,874 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 52 transitions. Word has length 39 [2022-07-11 23:33:15,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:33:15,874 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 52 transitions. [2022-07-11 23:33:15,874 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.739130434782609) internal successors, (63), 23 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) [2022-07-11 23:33:15,874 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 52 transitions. [2022-07-11 23:33:15,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-07-11 23:33:15,874 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:33:15,874 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:33:15,893 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-07-11 23:33:16,090 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-07-11 23:33:16,090 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:33:16,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:33:16,091 INFO L85 PathProgramCache]: Analyzing trace with hash -552579063, now seen corresponding path program 16 times [2022-07-11 23:33:16,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:33:16,091 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458369619] [2022-07-11 23:33:16,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:33:16,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:33:16,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:33:17,350 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:33:17,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:33:17,350 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458369619] [2022-07-11 23:33:17,350 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [458369619] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-11 23:33:17,350 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [156315538] [2022-07-11 23:33:17,350 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-11 23:33:17,350 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:33:17,350 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:33:17,351 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) [2022-07-11 23:33:17,355 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-07-11 23:33:17,431 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-11 23:33:17,431 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-11 23:33:17,433 WARN L261 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 80 conjunts are in the unsatisfiable core [2022-07-11 23:33:17,435 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:33:17,447 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-11 23:33:17,529 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:33:17,530 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-11 23:33:17,617 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:33:17,619 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-11 23:33:17,708 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:33:17,709 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-11 23:33:17,816 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:33:17,817 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-11 23:33:17,954 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:33:17,955 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-11 23:33:18,057 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:33:18,058 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-11 23:33:18,503 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:33:18,504 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 27 [2022-07-11 23:33:18,828 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:33:18,831 INFO L356 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-07-11 23:33:18,831 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 45 [2022-07-11 23:33:19,097 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:33:19,100 INFO L356 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-07-11 23:33:19,101 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 41 [2022-07-11 23:33:19,442 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:33:19,445 INFO L356 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-07-11 23:33:19,446 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 43 [2022-07-11 23:33:19,774 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:33:19,777 INFO L356 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-07-11 23:33:19,777 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 41 [2022-07-11 23:33:20,141 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:33:20,143 INFO L356 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-07-11 23:33:20,144 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 43 [2022-07-11 23:33:20,344 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:33:20,347 INFO L356 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-07-11 23:33:20,347 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 30 [2022-07-11 23:33:20,424 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:33:20,424 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-11 23:35:39,220 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((~N~0 Int)) (or (forall ((|ULTIMATE.start_main_~i~0#1| Int) (|ULTIMATE.start_main_~a~0#1.offset| Int) (v_ArrVal_967 (Array Int Int))) (or (not (= (select v_ArrVal_967 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) 4)) (forall ((v_subst_32 Int)) (or (not (= (select (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_967))) (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| (+ (select .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select v_ArrVal_967 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))))))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_32 4))) 4)) (forall ((v_subst_29 Int)) (or (forall ((v_subst_27 Int)) (or (forall ((v_subst_25 Int)) (or (forall ((v_subst_24 Int)) (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_967))) (let ((.cse10 (select .cse9 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse6 (select .cse10 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse8 (select v_ArrVal_967 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))))) (let ((.cse4 (select (select (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse6 .cse8))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_32 4))))) (let ((.cse5 (select (select (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse4 .cse6 .cse8))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_29 4))))) (let ((.cse7 (select (select (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse4 .cse5 .cse6 .cse8))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_27 4))))) (let ((.cse3 (select (select (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse4 .cse5 .cse6 .cse7 .cse8))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_25 4))))) (let ((.cse2 (select (select (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse4 .cse5 .cse6 .cse7 .cse8))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_24 4))))) (or (<= (+ .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (* ~N~0 4)) (not (= .cse2 4)))))))))))) (not (= (select (select (let ((.cse11 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_967))) (store .cse11 |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse12 (select .cse11 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse12 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse15 (select .cse12 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse16 (select v_ArrVal_967 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 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| (+ .cse15 .cse16))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_32 4))))) (let ((.cse14 (select (select (store .cse11 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse12 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse13 .cse15 .cse16))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_29 4))))) (+ .cse13 .cse14 .cse15 (select (select (store .cse11 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse12 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse13 .cse14 .cse15 .cse16))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_27 4))) .cse16)))))))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_25 4))) 4)))) (not (= (select (select (let ((.cse17 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_967))) (store .cse17 |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse18 (select .cse17 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse18 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse20 (select .cse18 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse21 (select v_ArrVal_967 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))))) (let ((.cse19 (select (select (store .cse17 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse18 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse20 .cse21))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_32 4))))) (+ .cse19 (select (select (store .cse17 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse18 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse19 .cse20 .cse21))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_29 4))) .cse20 .cse21))))))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_27 4))) 4)))) (not (= (select (select (let ((.cse22 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_967))) (store .cse22 |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse23 (select .cse22 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse23 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse24 (select .cse23 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse25 (select v_ArrVal_967 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))))) (+ (select (select (store .cse22 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse23 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse24 .cse25))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_32 4))) .cse24 .cse25)))))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_29 4))) 4)))))))) (< (+ |c_ULTIMATE.start_main_~i~0#1| 1) ~N~0) (not (< |c_ULTIMATE.start_main_~i~0#1| ~N~0)))) (forall ((~N~0 Int)) (or (forall ((|ULTIMATE.start_main_~i~0#1| Int) (|ULTIMATE.start_main_~a~0#1.offset| Int) (v_ArrVal_967 (Array Int Int))) (or (forall ((v_subst_31 Int)) (or (forall ((v_subst_30 Int)) (or (not (= 4 (select (select (let ((.cse26 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_967))) (store .cse26 |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse27 (select .cse26 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse27 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse28 (select .cse27 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse29 (select v_ArrVal_967 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))))) (+ .cse28 (select (select (store .cse26 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse27 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse28 .cse29))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_31 4))) .cse29)))))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_30 4))))) (forall ((v_subst_28 Int)) (or (not (= (select (select (let ((.cse30 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_967))) (store .cse30 |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse31 (select .cse30 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse31 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse32 (select .cse31 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse34 (select v_ArrVal_967 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))))) (let ((.cse33 (select (select (store .cse30 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse31 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse32 .cse34))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_31 4))))) (+ .cse32 .cse33 .cse34 (select (select (store .cse30 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse31 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse32 .cse33 .cse34))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_30 4)))))))))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_28 4))) 4)) (forall ((v_subst_26 Int)) (or (not (= 4 (select (select (let ((.cse35 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_967))) (store .cse35 |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse36 (select .cse35 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse36 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse37 (select .cse36 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse39 (select v_ArrVal_967 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))))) (let ((.cse38 (select (select (store .cse35 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse36 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse37 .cse39))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_31 4))))) (let ((.cse40 (select (select (store .cse35 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse36 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse37 .cse38 .cse39))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_30 4))))) (+ (select (select (store .cse35 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse36 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse37 .cse38 .cse39 .cse40))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_28 4))) .cse37 .cse38 .cse39 .cse40)))))))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_26 4))))) (forall ((v_subst_23 Int)) (let ((.cse48 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_967))) (let ((.cse49 (select .cse48 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse43 (select .cse49 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse45 (select v_ArrVal_967 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))))) (let ((.cse44 (select (select (store .cse48 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse49 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse43 .cse45))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_31 4))))) (let ((.cse46 (select (select (store .cse48 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse49 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse43 .cse44 .cse45))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_30 4))))) (let ((.cse42 (select (select (store .cse48 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse49 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse43 .cse44 .cse45 .cse46))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_28 4))))) (let ((.cse47 (select (select (store .cse48 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse49 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse42 .cse43 .cse44 .cse45 .cse46))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_26 4))))) (let ((.cse41 (select (select (store .cse48 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse49 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse42 .cse43 .cse44 .cse45 .cse46 .cse47))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_23 4))))) (or (not (= .cse41 4)) (<= (* ~N~0 4) (+ .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47)))))))))))))))))) (not (= (select (select (let ((.cse50 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_967))) (store .cse50 |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse51 (select .cse50 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse51 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ (select .cse51 |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select v_ArrVal_967 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))))))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_31 4))) 4)))) (not (= (select v_ArrVal_967 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) 4)))) (< (+ |c_ULTIMATE.start_main_~i~0#1| 1) ~N~0) (not (< |c_ULTIMATE.start_main_~i~0#1| ~N~0))))) is different from false [2022-07-11 23:35:39,769 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((~N~0 Int)) (or (< (+ 2 |c_ULTIMATE.start_main_~i~0#1|) ~N~0) (not (< (+ |c_ULTIMATE.start_main_~i~0#1| 1) ~N~0)) (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int) (v_subst_34 Int) (v_ArrVal_967 (Array Int Int))) (or (not (= (select v_ArrVal_967 (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_34 4))) 4)) (forall ((v_subst_32 Int)) (or (forall ((v_subst_29 Int)) (or (forall ((v_subst_27 Int)) (or (not (= (select (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_967))) (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 v_ArrVal_967 (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_34 4)))) (.cse3 (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 .cse3))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_32 4))))) (+ .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))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_29 4)))))))))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_27 4))) 4)) (forall ((v_subst_25 Int)) (or (forall ((v_subst_24 Int)) (let ((.cse12 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_967))) (let ((.cse13 (select .cse12 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse6 (select v_ArrVal_967 (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_34 4)))) (.cse7 (select .cse13 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse10 (select (select (store .cse12 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse6 .cse7))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_32 4))))) (let ((.cse11 (select (select (store .cse12 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse6 .cse7 .cse10))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_29 4))))) (let ((.cse8 (select (select (store .cse12 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse6 .cse7 .cse10 .cse11))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_27 4))))) (let ((.cse9 (select (select (store .cse12 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse6 .cse7 .cse8 .cse10 .cse11))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_25 4))))) (let ((.cse5 (select (select (store .cse12 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse6 .cse7 .cse8 .cse9 .cse10 .cse11))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_24 4))))) (or (not (= 4 .cse5)) (<= (+ .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse5) (* ~N~0 4)))))))))))) (not (= (select (select (let ((.cse14 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_967))) (store .cse14 |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse15 (select .cse14 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse15 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse16 (select v_ArrVal_967 (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_34 4)))) (.cse17 (select .cse15 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse18 (select (select (store .cse14 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse15 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse16 .cse17))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_32 4))))) (let ((.cse19 (select (select (store .cse14 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse15 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse16 .cse17 .cse18))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_29 4))))) (+ .cse16 .cse17 (select (select (store .cse14 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse15 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse16 .cse17 .cse18 .cse19))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_27 4))) .cse18 .cse19)))))))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_25 4))) 4)))))) (not (= (select (select (let ((.cse20 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_967))) (store .cse20 |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse21 (select .cse20 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse21 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse22 (select v_ArrVal_967 (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_34 4)))) (.cse23 (select .cse21 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ .cse22 .cse23 (select (select (store .cse20 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse21 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse22 .cse23))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_32 4))))))))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_29 4))) 4)))) (not (= (select (select (let ((.cse24 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_967))) (store .cse24 |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse25 (select .cse24 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse25 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ (select v_ArrVal_967 (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_34 4))) (select .cse25 |c_ULTIMATE.start_main_~#sum~0#1.offset|)))))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_32 4))) 4)))))))) (forall ((~N~0 Int)) (or (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int) (v_ArrVal_967 (Array Int Int)) (v_subst_33 Int)) (or (not (= 4 (select v_ArrVal_967 (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_33 4))))) (forall ((v_subst_31 Int)) (or (not (= (select (select (let ((.cse26 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_967))) (store .cse26 |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse27 (select .cse26 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse27 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ (select .cse27 |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select v_ArrVal_967 (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_33 4)))))))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_31 4))) 4)) (forall ((v_subst_30 Int)) (or (forall ((v_subst_28 Int)) (or (not (= (select (select (let ((.cse28 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_967))) (store .cse28 |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse29 (select .cse28 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse29 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse31 (select .cse29 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse32 (select v_ArrVal_967 (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_33 4))))) (let ((.cse30 (select (select (store .cse28 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse29 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse31 .cse32))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_31 4))))) (+ .cse30 (select (select (store .cse28 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse29 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse30 .cse31 .cse32))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_30 4))) .cse31 .cse32))))))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_28 4))) 4)) (forall ((v_subst_26 Int)) (or (forall ((v_subst_23 Int)) (let ((.cse40 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_967))) (let ((.cse41 (select .cse40 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse38 (select .cse41 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse39 (select v_ArrVal_967 (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_33 4))))) (let ((.cse34 (select (select (store .cse40 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse41 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse38 .cse39))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_31 4))))) (let ((.cse37 (select (select (store .cse40 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse41 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse34 .cse38 .cse39))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_30 4))))) (let ((.cse35 (select (select (store .cse40 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse41 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse34 .cse37 .cse38 .cse39))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_28 4))))) (let ((.cse33 (select (select (store .cse40 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse41 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse34 .cse35 .cse37 .cse38 .cse39))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_26 4))))) (let ((.cse36 (select (select (store .cse40 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse41 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse33 .cse34 .cse35 .cse37 .cse38 .cse39))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_23 4))))) (or (<= (* ~N~0 4) (+ .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39)) (not (= .cse36 4)))))))))))) (not (= (select (select (let ((.cse42 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_967))) (store .cse42 |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse43 (select .cse42 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse43 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse46 (select .cse43 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse47 (select v_ArrVal_967 (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_33 4))))) (let ((.cse44 (select (select (store .cse42 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse43 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse46 .cse47))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_31 4))))) (let ((.cse45 (select (select (store .cse42 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse43 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse44 .cse46 .cse47))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_30 4))))) (+ .cse44 (select (select (store .cse42 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse43 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse44 .cse45 .cse46 .cse47))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_28 4))) .cse45 .cse46 .cse47)))))))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_26 4))) 4)))))) (not (= (select (select (let ((.cse48 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_967))) (store .cse48 |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse49 (select .cse48 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse49 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse50 (select .cse49 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse51 (select v_ArrVal_967 (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_33 4))))) (+ (select (select (store .cse48 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse49 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse50 .cse51))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_31 4))) .cse50 .cse51)))))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_30 4))) 4)))))))) (< (+ 2 |c_ULTIMATE.start_main_~i~0#1|) ~N~0) (not (< (+ |c_ULTIMATE.start_main_~i~0#1| 1) ~N~0))))) is different from false [2022-07-11 23:35:40,488 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((~N~0 Int)) (or (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int) (v_subst_34 Int) (v_ArrVal_967 (Array Int Int))) (or (not (= (select v_ArrVal_967 (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_34 4))) 4)) (forall ((v_subst_32 Int)) (or (forall ((v_subst_29 Int)) (or (forall ((v_subst_27 Int)) (or (not (= (select (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_967))) (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 v_ArrVal_967 (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_34 4)))) (.cse3 (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 .cse3))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_32 4))))) (+ .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))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_29 4)))))))))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_27 4))) 4)) (forall ((v_subst_25 Int)) (or (forall ((v_subst_24 Int)) (let ((.cse12 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_967))) (let ((.cse13 (select .cse12 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse6 (select v_ArrVal_967 (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_34 4)))) (.cse7 (select .cse13 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse10 (select (select (store .cse12 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse6 .cse7))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_32 4))))) (let ((.cse11 (select (select (store .cse12 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse6 .cse7 .cse10))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_29 4))))) (let ((.cse8 (select (select (store .cse12 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse6 .cse7 .cse10 .cse11))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_27 4))))) (let ((.cse9 (select (select (store .cse12 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse6 .cse7 .cse8 .cse10 .cse11))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_25 4))))) (let ((.cse5 (select (select (store .cse12 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse6 .cse7 .cse8 .cse9 .cse10 .cse11))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_24 4))))) (or (not (= 4 .cse5)) (<= (+ .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse5) (* ~N~0 4)))))))))))) (not (= (select (select (let ((.cse14 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_967))) (store .cse14 |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse15 (select .cse14 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse15 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse16 (select v_ArrVal_967 (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_34 4)))) (.cse17 (select .cse15 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse18 (select (select (store .cse14 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse15 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse16 .cse17))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_32 4))))) (let ((.cse19 (select (select (store .cse14 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse15 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse16 .cse17 .cse18))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_29 4))))) (+ .cse16 .cse17 (select (select (store .cse14 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse15 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse16 .cse17 .cse18 .cse19))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_27 4))) .cse18 .cse19)))))))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_25 4))) 4)))))) (not (= (select (select (let ((.cse20 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_967))) (store .cse20 |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse21 (select .cse20 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse21 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse22 (select v_ArrVal_967 (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_34 4)))) (.cse23 (select .cse21 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ .cse22 .cse23 (select (select (store .cse20 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse21 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse22 .cse23))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_32 4))))))))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_29 4))) 4)))) (not (= (select (select (let ((.cse24 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_967))) (store .cse24 |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse25 (select .cse24 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse25 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ (select v_ArrVal_967 (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_34 4))) (select .cse25 |c_ULTIMATE.start_main_~#sum~0#1.offset|)))))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_32 4))) 4)))))) (< (+ 3 |c_ULTIMATE.start_main_~i~0#1|) ~N~0) (not (< (+ 2 |c_ULTIMATE.start_main_~i~0#1|) ~N~0)))) (forall ((~N~0 Int)) (or (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int) (v_ArrVal_967 (Array Int Int)) (v_subst_33 Int)) (or (not (= 4 (select v_ArrVal_967 (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_33 4))))) (forall ((v_subst_31 Int)) (or (not (= (select (select (let ((.cse26 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_967))) (store .cse26 |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse27 (select .cse26 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse27 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ (select .cse27 |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select v_ArrVal_967 (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_33 4)))))))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_31 4))) 4)) (forall ((v_subst_30 Int)) (or (forall ((v_subst_28 Int)) (or (not (= (select (select (let ((.cse28 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_967))) (store .cse28 |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse29 (select .cse28 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse29 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse31 (select .cse29 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse32 (select v_ArrVal_967 (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_33 4))))) (let ((.cse30 (select (select (store .cse28 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse29 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse31 .cse32))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_31 4))))) (+ .cse30 (select (select (store .cse28 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse29 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse30 .cse31 .cse32))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_30 4))) .cse31 .cse32))))))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_28 4))) 4)) (forall ((v_subst_26 Int)) (or (forall ((v_subst_23 Int)) (let ((.cse40 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_967))) (let ((.cse41 (select .cse40 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse38 (select .cse41 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse39 (select v_ArrVal_967 (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_33 4))))) (let ((.cse34 (select (select (store .cse40 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse41 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse38 .cse39))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_31 4))))) (let ((.cse37 (select (select (store .cse40 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse41 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse34 .cse38 .cse39))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_30 4))))) (let ((.cse35 (select (select (store .cse40 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse41 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse34 .cse37 .cse38 .cse39))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_28 4))))) (let ((.cse33 (select (select (store .cse40 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse41 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse34 .cse35 .cse37 .cse38 .cse39))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_26 4))))) (let ((.cse36 (select (select (store .cse40 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse41 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse33 .cse34 .cse35 .cse37 .cse38 .cse39))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_23 4))))) (or (<= (* ~N~0 4) (+ .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39)) (not (= .cse36 4)))))))))))) (not (= (select (select (let ((.cse42 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_967))) (store .cse42 |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse43 (select .cse42 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse43 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse46 (select .cse43 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse47 (select v_ArrVal_967 (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_33 4))))) (let ((.cse44 (select (select (store .cse42 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse43 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse46 .cse47))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_31 4))))) (let ((.cse45 (select (select (store .cse42 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse43 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse44 .cse46 .cse47))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_30 4))))) (+ .cse44 (select (select (store .cse42 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse43 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse44 .cse45 .cse46 .cse47))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_28 4))) .cse45 .cse46 .cse47)))))))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_26 4))) 4)))))) (not (= (select (select (let ((.cse48 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_967))) (store .cse48 |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse49 (select .cse48 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse49 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse50 (select .cse49 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse51 (select v_ArrVal_967 (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_33 4))))) (+ (select (select (store .cse48 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse49 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse50 .cse51))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_31 4))) .cse50 .cse51)))))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_30 4))) 4)))))))) (< (+ 3 |c_ULTIMATE.start_main_~i~0#1|) ~N~0) (not (< (+ 2 |c_ULTIMATE.start_main_~i~0#1|) ~N~0))))) is different from false [2022-07-11 23:35:41,198 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((~N~0 Int)) (or (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int) (v_ArrVal_967 (Array Int Int)) (v_subst_33 Int)) (or (not (= 4 (select v_ArrVal_967 (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_33 4))))) (forall ((v_subst_31 Int)) (or (not (= (select (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_967))) (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| (+ (select .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select v_ArrVal_967 (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_33 4)))))))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_31 4))) 4)) (forall ((v_subst_30 Int)) (or (forall ((v_subst_28 Int)) (or (not (= (select (select (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_967))) (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse3 (select .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse5 (select .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse6 (select v_ArrVal_967 (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_33 4))))) (let ((.cse4 (select (select (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse5 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_31 4))))) (+ .cse4 (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))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_30 4))) .cse5 .cse6))))))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_28 4))) 4)) (forall ((v_subst_26 Int)) (or (forall ((v_subst_23 Int)) (let ((.cse14 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_967))) (let ((.cse15 (select .cse14 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse12 (select .cse15 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse13 (select v_ArrVal_967 (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_33 4))))) (let ((.cse8 (select (select (store .cse14 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse15 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse12 .cse13))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_31 4))))) (let ((.cse11 (select (select (store .cse14 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse15 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse8 .cse12 .cse13))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_30 4))))) (let ((.cse9 (select (select (store .cse14 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse15 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse8 .cse11 .cse12 .cse13))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_28 4))))) (let ((.cse7 (select (select (store .cse14 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse15 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse8 .cse9 .cse11 .cse12 .cse13))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_26 4))))) (let ((.cse10 (select (select (store .cse14 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse15 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse7 .cse8 .cse9 .cse11 .cse12 .cse13))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_23 4))))) (or (<= (* ~N~0 4) (+ .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13)) (not (= .cse10 4)))))))))))) (not (= (select (select (let ((.cse16 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_967))) (store .cse16 |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse17 (select .cse16 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse17 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse20 (select .cse17 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse21 (select v_ArrVal_967 (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_33 4))))) (let ((.cse18 (select (select (store .cse16 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse17 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse20 .cse21))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_31 4))))) (let ((.cse19 (select (select (store .cse16 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse17 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse18 .cse20 .cse21))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_30 4))))) (+ .cse18 (select (select (store .cse16 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse17 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse18 .cse19 .cse20 .cse21))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_28 4))) .cse19 .cse20 .cse21)))))))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_26 4))) 4)))))) (not (= (select (select (let ((.cse22 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_967))) (store .cse22 |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse23 (select .cse22 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse23 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse24 (select .cse23 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse25 (select v_ArrVal_967 (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_33 4))))) (+ (select (select (store .cse22 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse23 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse24 .cse25))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_31 4))) .cse24 .cse25)))))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_30 4))) 4)))))))) (< (+ |c_ULTIMATE.start_main_~i~0#1| 4) ~N~0) (not (< (+ 3 |c_ULTIMATE.start_main_~i~0#1|) ~N~0)))) (forall ((~N~0 Int)) (or (< (+ |c_ULTIMATE.start_main_~i~0#1| 4) ~N~0) (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int) (v_subst_34 Int) (v_ArrVal_967 (Array Int Int))) (or (not (= (select v_ArrVal_967 (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_34 4))) 4)) (forall ((v_subst_32 Int)) (or (forall ((v_subst_29 Int)) (or (forall ((v_subst_27 Int)) (or (not (= (select (select (let ((.cse26 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_967))) (store .cse26 |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse27 (select .cse26 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse27 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse28 (select v_ArrVal_967 (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_34 4)))) (.cse29 (select .cse27 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse30 (select (select (store .cse26 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse27 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse28 .cse29))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_32 4))))) (+ .cse28 .cse29 .cse30 (select (select (store .cse26 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse27 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse28 .cse29 .cse30))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_29 4)))))))))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_27 4))) 4)) (forall ((v_subst_25 Int)) (or (forall ((v_subst_24 Int)) (let ((.cse38 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_967))) (let ((.cse39 (select .cse38 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse32 (select v_ArrVal_967 (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_34 4)))) (.cse33 (select .cse39 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse36 (select (select (store .cse38 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse39 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse32 .cse33))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_32 4))))) (let ((.cse37 (select (select (store .cse38 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse39 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse32 .cse33 .cse36))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_29 4))))) (let ((.cse34 (select (select (store .cse38 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse39 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse32 .cse33 .cse36 .cse37))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_27 4))))) (let ((.cse35 (select (select (store .cse38 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse39 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse32 .cse33 .cse34 .cse36 .cse37))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_25 4))))) (let ((.cse31 (select (select (store .cse38 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse39 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse32 .cse33 .cse34 .cse35 .cse36 .cse37))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_24 4))))) (or (not (= 4 .cse31)) (<= (+ .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse31) (* ~N~0 4)))))))))))) (not (= (select (select (let ((.cse40 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_967))) (store .cse40 |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse41 (select .cse40 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse41 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse42 (select v_ArrVal_967 (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_34 4)))) (.cse43 (select .cse41 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse44 (select (select (store .cse40 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse41 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse42 .cse43))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_32 4))))) (let ((.cse45 (select (select (store .cse40 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse41 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse42 .cse43 .cse44))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_29 4))))) (+ .cse42 .cse43 (select (select (store .cse40 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse41 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse42 .cse43 .cse44 .cse45))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_27 4))) .cse44 .cse45)))))))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_25 4))) 4)))))) (not (= (select (select (let ((.cse46 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_967))) (store .cse46 |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse47 (select .cse46 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse47 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse48 (select v_ArrVal_967 (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_34 4)))) (.cse49 (select .cse47 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ .cse48 .cse49 (select (select (store .cse46 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse47 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse48 .cse49))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_32 4))))))))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_29 4))) 4)))) (not (= (select (select (let ((.cse50 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_967))) (store .cse50 |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse51 (select .cse50 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse51 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ (select v_ArrVal_967 (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_34 4))) (select .cse51 |c_ULTIMATE.start_main_~#sum~0#1.offset|)))))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_32 4))) 4)))))) (not (< (+ 3 |c_ULTIMATE.start_main_~i~0#1|) ~N~0))))) is different from false [2022-07-11 23:35:41,948 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((~N~0 Int)) (or (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int) (v_ArrVal_967 (Array Int Int)) (v_subst_33 Int)) (or (not (= 4 (select v_ArrVal_967 (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_33 4))))) (forall ((v_subst_31 Int)) (or (not (= (select (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_967))) (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| (+ (select .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select v_ArrVal_967 (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_33 4)))))))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_31 4))) 4)) (forall ((v_subst_30 Int)) (or (forall ((v_subst_28 Int)) (or (not (= (select (select (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_967))) (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse3 (select .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse5 (select .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse6 (select v_ArrVal_967 (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_33 4))))) (let ((.cse4 (select (select (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse5 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_31 4))))) (+ .cse4 (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))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_30 4))) .cse5 .cse6))))))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_28 4))) 4)) (forall ((v_subst_26 Int)) (or (forall ((v_subst_23 Int)) (let ((.cse14 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_967))) (let ((.cse15 (select .cse14 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse12 (select .cse15 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse13 (select v_ArrVal_967 (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_33 4))))) (let ((.cse8 (select (select (store .cse14 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse15 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse12 .cse13))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_31 4))))) (let ((.cse11 (select (select (store .cse14 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse15 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse8 .cse12 .cse13))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_30 4))))) (let ((.cse9 (select (select (store .cse14 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse15 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse8 .cse11 .cse12 .cse13))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_28 4))))) (let ((.cse7 (select (select (store .cse14 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse15 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse8 .cse9 .cse11 .cse12 .cse13))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_26 4))))) (let ((.cse10 (select (select (store .cse14 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse15 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse7 .cse8 .cse9 .cse11 .cse12 .cse13))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_23 4))))) (or (<= (* ~N~0 4) (+ .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13)) (not (= .cse10 4)))))))))))) (not (= (select (select (let ((.cse16 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_967))) (store .cse16 |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse17 (select .cse16 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse17 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse20 (select .cse17 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse21 (select v_ArrVal_967 (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_33 4))))) (let ((.cse18 (select (select (store .cse16 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse17 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse20 .cse21))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_31 4))))) (let ((.cse19 (select (select (store .cse16 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse17 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse18 .cse20 .cse21))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_30 4))))) (+ .cse18 (select (select (store .cse16 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse17 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse18 .cse19 .cse20 .cse21))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_28 4))) .cse19 .cse20 .cse21)))))))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_26 4))) 4)))))) (not (= (select (select (let ((.cse22 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_967))) (store .cse22 |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse23 (select .cse22 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse23 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse24 (select .cse23 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse25 (select v_ArrVal_967 (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_33 4))))) (+ (select (select (store .cse22 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse23 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse24 .cse25))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_31 4))) .cse24 .cse25)))))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_30 4))) 4)))))))) (not (< (+ |c_ULTIMATE.start_main_~i~0#1| 4) ~N~0)) (< (+ 5 |c_ULTIMATE.start_main_~i~0#1|) ~N~0))) (forall ((~N~0 Int)) (or (not (< (+ |c_ULTIMATE.start_main_~i~0#1| 4) ~N~0)) (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int) (v_subst_34 Int) (v_ArrVal_967 (Array Int Int))) (or (not (= (select v_ArrVal_967 (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_34 4))) 4)) (forall ((v_subst_32 Int)) (or (forall ((v_subst_29 Int)) (or (forall ((v_subst_27 Int)) (or (not (= (select (select (let ((.cse26 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_967))) (store .cse26 |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse27 (select .cse26 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse27 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse28 (select v_ArrVal_967 (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_34 4)))) (.cse29 (select .cse27 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse30 (select (select (store .cse26 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse27 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse28 .cse29))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_32 4))))) (+ .cse28 .cse29 .cse30 (select (select (store .cse26 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse27 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse28 .cse29 .cse30))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_29 4)))))))))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_27 4))) 4)) (forall ((v_subst_25 Int)) (or (forall ((v_subst_24 Int)) (let ((.cse38 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_967))) (let ((.cse39 (select .cse38 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse32 (select v_ArrVal_967 (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_34 4)))) (.cse33 (select .cse39 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse36 (select (select (store .cse38 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse39 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse32 .cse33))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_32 4))))) (let ((.cse37 (select (select (store .cse38 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse39 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse32 .cse33 .cse36))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_29 4))))) (let ((.cse34 (select (select (store .cse38 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse39 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse32 .cse33 .cse36 .cse37))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_27 4))))) (let ((.cse35 (select (select (store .cse38 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse39 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse32 .cse33 .cse34 .cse36 .cse37))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_25 4))))) (let ((.cse31 (select (select (store .cse38 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse39 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse32 .cse33 .cse34 .cse35 .cse36 .cse37))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_24 4))))) (or (not (= 4 .cse31)) (<= (+ .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse31) (* ~N~0 4)))))))))))) (not (= (select (select (let ((.cse40 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_967))) (store .cse40 |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse41 (select .cse40 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse41 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse42 (select v_ArrVal_967 (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_34 4)))) (.cse43 (select .cse41 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse44 (select (select (store .cse40 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse41 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse42 .cse43))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_32 4))))) (let ((.cse45 (select (select (store .cse40 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse41 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse42 .cse43 .cse44))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_29 4))))) (+ .cse42 .cse43 (select (select (store .cse40 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse41 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse42 .cse43 .cse44 .cse45))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_27 4))) .cse44 .cse45)))))))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_25 4))) 4)))))) (not (= (select (select (let ((.cse46 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_967))) (store .cse46 |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse47 (select .cse46 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse47 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse48 (select v_ArrVal_967 (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_34 4)))) (.cse49 (select .cse47 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ .cse48 .cse49 (select (select (store .cse46 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse47 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse48 .cse49))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_32 4))))))))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_29 4))) 4)))) (not (= (select (select (let ((.cse50 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_967))) (store .cse50 |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse51 (select .cse50 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse51 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ (select v_ArrVal_967 (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_34 4))) (select .cse51 |c_ULTIMATE.start_main_~#sum~0#1.offset|)))))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_32 4))) 4)))))) (< (+ 5 |c_ULTIMATE.start_main_~i~0#1|) ~N~0)))) is different from false [2022-07-11 23:35:42,718 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((~N~0 Int)) (or (not (< (+ 5 |c_ULTIMATE.start_main_~i~0#1|) ~N~0)) (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int) (v_subst_34 Int) (v_ArrVal_967 (Array Int Int))) (or (not (= (select v_ArrVal_967 (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_34 4))) 4)) (forall ((v_subst_32 Int)) (or (forall ((v_subst_29 Int)) (or (forall ((v_subst_27 Int)) (or (not (= (select (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_967))) (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 v_ArrVal_967 (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_34 4)))) (.cse3 (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 .cse3))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_32 4))))) (+ .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))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_29 4)))))))))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_27 4))) 4)) (forall ((v_subst_25 Int)) (or (forall ((v_subst_24 Int)) (let ((.cse12 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_967))) (let ((.cse13 (select .cse12 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse6 (select v_ArrVal_967 (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_34 4)))) (.cse7 (select .cse13 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse10 (select (select (store .cse12 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse6 .cse7))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_32 4))))) (let ((.cse11 (select (select (store .cse12 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse6 .cse7 .cse10))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_29 4))))) (let ((.cse8 (select (select (store .cse12 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse6 .cse7 .cse10 .cse11))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_27 4))))) (let ((.cse9 (select (select (store .cse12 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse6 .cse7 .cse8 .cse10 .cse11))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_25 4))))) (let ((.cse5 (select (select (store .cse12 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse6 .cse7 .cse8 .cse9 .cse10 .cse11))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_24 4))))) (or (not (= 4 .cse5)) (<= (+ .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse5) (* ~N~0 4)))))))))))) (not (= (select (select (let ((.cse14 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_967))) (store .cse14 |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse15 (select .cse14 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse15 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse16 (select v_ArrVal_967 (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_34 4)))) (.cse17 (select .cse15 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse18 (select (select (store .cse14 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse15 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse16 .cse17))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_32 4))))) (let ((.cse19 (select (select (store .cse14 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse15 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse16 .cse17 .cse18))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_29 4))))) (+ .cse16 .cse17 (select (select (store .cse14 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse15 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse16 .cse17 .cse18 .cse19))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_27 4))) .cse18 .cse19)))))))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_25 4))) 4)))))) (not (= (select (select (let ((.cse20 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_967))) (store .cse20 |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse21 (select .cse20 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse21 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse22 (select v_ArrVal_967 (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_34 4)))) (.cse23 (select .cse21 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ .cse22 .cse23 (select (select (store .cse20 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse21 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse22 .cse23))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_32 4))))))))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_29 4))) 4)))) (not (= (select (select (let ((.cse24 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_967))) (store .cse24 |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse25 (select .cse24 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse25 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ (select v_ArrVal_967 (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_34 4))) (select .cse25 |c_ULTIMATE.start_main_~#sum~0#1.offset|)))))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_32 4))) 4)))))) (< (+ 6 |c_ULTIMATE.start_main_~i~0#1|) ~N~0))) (forall ((~N~0 Int)) (or (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int) (v_ArrVal_967 (Array Int Int)) (v_subst_33 Int)) (or (not (= 4 (select v_ArrVal_967 (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_33 4))))) (forall ((v_subst_31 Int)) (or (not (= (select (select (let ((.cse26 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_967))) (store .cse26 |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse27 (select .cse26 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse27 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ (select .cse27 |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select v_ArrVal_967 (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_33 4)))))))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_31 4))) 4)) (forall ((v_subst_30 Int)) (or (forall ((v_subst_28 Int)) (or (not (= (select (select (let ((.cse28 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_967))) (store .cse28 |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse29 (select .cse28 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse29 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse31 (select .cse29 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse32 (select v_ArrVal_967 (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_33 4))))) (let ((.cse30 (select (select (store .cse28 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse29 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse31 .cse32))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_31 4))))) (+ .cse30 (select (select (store .cse28 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse29 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse30 .cse31 .cse32))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_30 4))) .cse31 .cse32))))))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_28 4))) 4)) (forall ((v_subst_26 Int)) (or (forall ((v_subst_23 Int)) (let ((.cse40 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_967))) (let ((.cse41 (select .cse40 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse38 (select .cse41 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse39 (select v_ArrVal_967 (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_33 4))))) (let ((.cse34 (select (select (store .cse40 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse41 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse38 .cse39))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_31 4))))) (let ((.cse37 (select (select (store .cse40 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse41 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse34 .cse38 .cse39))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_30 4))))) (let ((.cse35 (select (select (store .cse40 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse41 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse34 .cse37 .cse38 .cse39))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_28 4))))) (let ((.cse33 (select (select (store .cse40 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse41 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse34 .cse35 .cse37 .cse38 .cse39))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_26 4))))) (let ((.cse36 (select (select (store .cse40 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse41 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse33 .cse34 .cse35 .cse37 .cse38 .cse39))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_23 4))))) (or (<= (* ~N~0 4) (+ .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39)) (not (= .cse36 4)))))))))))) (not (= (select (select (let ((.cse42 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_967))) (store .cse42 |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse43 (select .cse42 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse43 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse46 (select .cse43 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse47 (select v_ArrVal_967 (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_33 4))))) (let ((.cse44 (select (select (store .cse42 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse43 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse46 .cse47))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_31 4))))) (let ((.cse45 (select (select (store .cse42 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse43 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse44 .cse46 .cse47))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_30 4))))) (+ .cse44 (select (select (store .cse42 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse43 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse44 .cse45 .cse46 .cse47))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_28 4))) .cse45 .cse46 .cse47)))))))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_26 4))) 4)))))) (not (= (select (select (let ((.cse48 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_967))) (store .cse48 |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse49 (select .cse48 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse49 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse50 (select .cse49 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse51 (select v_ArrVal_967 (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_33 4))))) (+ (select (select (store .cse48 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse49 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse50 .cse51))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_31 4))) .cse50 .cse51)))))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_30 4))) 4)))))))) (not (< (+ 5 |c_ULTIMATE.start_main_~i~0#1|) ~N~0)) (< (+ 6 |c_ULTIMATE.start_main_~i~0#1|) ~N~0)))) is different from false [2022-07-11 23:35:43,190 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 36 not checked. [2022-07-11 23:35:43,190 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [156315538] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-11 23:35:43,191 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-11 23:35:43,191 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 24, 24] total 72 [2022-07-11 23:35:43,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690910225] [2022-07-11 23:35:43,191 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-11 23:35:43,191 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 72 states [2022-07-11 23:35:43,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:35:43,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2022-07-11 23:35:43,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=250, Invalid=4008, Unknown=56, NotChecked=798, Total=5112 [2022-07-11 23:35:43,193 INFO L87 Difference]: Start difference. First operand 47 states and 52 transitions. Second operand has 72 states, 72 states have (on average 1.5277777777777777) internal successors, (110), 72 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:35:47,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:35:47,922 INFO L93 Difference]: Finished difference Result 74 states and 82 transitions. [2022-07-11 23:35:47,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-07-11 23:35:47,923 INFO L78 Accepts]: Start accepts. Automaton has has 72 states, 72 states have (on average 1.5277777777777777) internal successors, (110), 72 states have internal predecessors, (110), 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 41 [2022-07-11 23:35:47,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:35:47,923 INFO L225 Difference]: With dead ends: 74 [2022-07-11 23:35:47,923 INFO L226 Difference]: Without dead ends: 70 [2022-07-11 23:35:47,925 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 43 SyntacticMatches, 8 SemanticMatches, 74 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 1600 ImplicationChecksByTransitivity, 143.3s TimeCoverageRelationStatistics Valid=301, Invalid=4497, Unknown=56, NotChecked=846, Total=5700 [2022-07-11 23:35:47,925 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 13 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 446 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 1145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 446 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 690 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-07-11 23:35:47,925 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 161 Invalid, 1145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 446 Invalid, 0 Unknown, 690 Unchecked, 1.4s Time] [2022-07-11 23:35:47,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-07-11 23:35:47,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 64. [2022-07-11 23:35:47,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 63 states have (on average 1.126984126984127) internal successors, (71), 63 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:35:47,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 71 transitions. [2022-07-11 23:35:47,938 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 71 transitions. Word has length 41 [2022-07-11 23:35:47,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:35:47,939 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 71 transitions. [2022-07-11 23:35:47,939 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 72 states, 72 states have (on average 1.5277777777777777) internal successors, (110), 72 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:35:47,939 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 71 transitions. [2022-07-11 23:35:47,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-07-11 23:35:47,939 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:35:47,939 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:35:47,956 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-07-11 23:35:48,142 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-07-11 23:35:48,142 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:35:48,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:35:48,143 INFO L85 PathProgramCache]: Analyzing trace with hash 127479307, now seen corresponding path program 5 times [2022-07-11 23:35:48,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:35:48,143 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711681295] [2022-07-11 23:35:48,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:35:48,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:35:48,162 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-11 23:35:48,162 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [614813515] [2022-07-11 23:35:48,162 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-11 23:35:48,175 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:35:48,175 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:35:48,176 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) [2022-07-11 23:35:48,177 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-07-11 23:35:48,320 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2022-07-11 23:35:48,320 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-11 23:35:48,322 INFO L263 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 38 conjunts are in the unsatisfiable core [2022-07-11 23:35:48,323 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:35:48,337 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-07-11 23:35:48,626 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-07-11 23:35:48,850 INFO L356 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-07-11 23:35:48,851 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2022-07-11 23:35:49,074 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-11 23:35:49,216 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-11 23:35:49,342 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-11 23:35:49,493 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-11 23:35:49,679 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-07-11 23:35:49,758 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 23 proven. 62 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-11 23:35:49,758 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-11 23:35:49,964 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1050 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1050) |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)) 4)) is different from false [2022-07-11 23:35:49,998 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1050 (Array Int Int))) (= 4 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1050) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) 8 |c_ULTIMATE.start_main_~a~0#1.offset|)))) is different from false [2022-07-11 23:35:50,037 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1050 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1050) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) 12 |c_ULTIMATE.start_main_~a~0#1.offset|)) 4)) is different from false [2022-07-11 23:35:50,074 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1050 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1050) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) 16 |c_ULTIMATE.start_main_~a~0#1.offset|)) 4)) is different from false [2022-07-11 23:35:50,109 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1050 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1050) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 16 |c_ULTIMATE.start_main_~a~0#1.offset|)) 4)) is different from false [2022-07-11 23:35:50,145 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1046 Int) (v_ArrVal_1050 (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_1046)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1050) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 16 |c_ULTIMATE.start_main_~a~0#1.offset|)) 4)) is different from false [2022-07-11 23:35:50,179 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_338| Int)) (or (forall ((v_ArrVal_1046 Int) (v_ArrVal_1050 (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_338| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1046)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1050) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 16 |c_ULTIMATE.start_main_~a~0#1.offset|)) 4)) (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_338|)))) is different from false [2022-07-11 23:35:50,252 INFO L356 Elim1Store]: treesize reduction 37, result has 40.3 percent of original size [2022-07-11 23:35:50,252 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 37 [2022-07-11 23:35:50,279 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-11 23:35:50,279 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 38 [2022-07-11 23:35:50,286 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-11 23:35:50,444 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 23 proven. 16 refuted. 0 times theorem prover too weak. 2 trivial. 46 not checked. [2022-07-11 23:35:50,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:35:50,444 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711681295] [2022-07-11 23:35:50,444 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-11 23:35:50,444 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [614813515] [2022-07-11 23:35:50,444 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [614813515] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-11 23:35:50,445 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-11 23:35:50,445 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 26 [2022-07-11 23:35:50,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404744885] [2022-07-11 23:35:50,445 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-11 23:35:50,445 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-07-11 23:35:50,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:35:50,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-07-11 23:35:50,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=297, Unknown=7, NotChecked=280, Total=650 [2022-07-11 23:35:50,446 INFO L87 Difference]: Start difference. First operand 64 states and 71 transitions. Second operand has 26 states, 26 states have (on average 2.269230769230769) internal successors, (59), 26 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) [2022-07-11 23:35:53,151 WARN L833 $PredicateComparison]: unable to prove that (and (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_338| Int)) (or (forall ((v_ArrVal_1046 Int) (v_ArrVal_1050 (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_338| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1046)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1050) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 16 |c_ULTIMATE.start_main_~a~0#1.offset|)) 4)) (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_338|)))) (= (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) (= (+ (- 4) |c_ULTIMATE.start_main_~i~0#1|) 0)) is different from false [2022-07-11 23:35:54,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:35:54,673 INFO L93 Difference]: Finished difference Result 77 states and 86 transitions. [2022-07-11 23:35:54,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-07-11 23:35:54,673 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.269230769230769) internal successors, (59), 26 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 41 [2022-07-11 23:35:54,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:35:54,674 INFO L225 Difference]: With dead ends: 77 [2022-07-11 23:35:54,674 INFO L226 Difference]: Without dead ends: 68 [2022-07-11 23:35:54,674 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 55 SyntacticMatches, 7 SemanticMatches, 31 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=97, Invalid=527, Unknown=8, NotChecked=424, Total=1056 [2022-07-11 23:35:54,675 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 23 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 433 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 727 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 433 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 259 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-07-11 23:35:54,675 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 78 Invalid, 727 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 433 Invalid, 0 Unknown, 259 Unchecked, 1.5s Time] [2022-07-11 23:35:54,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2022-07-11 23:35:54,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 67. [2022-07-11 23:35:54,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 66 states have (on average 1.106060606060606) internal successors, (73), 66 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:35:54,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 73 transitions. [2022-07-11 23:35:54,685 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 73 transitions. Word has length 41 [2022-07-11 23:35:54,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:35:54,685 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 73 transitions. [2022-07-11 23:35:54,685 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 2.269230769230769) internal successors, (59), 26 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) [2022-07-11 23:35:54,685 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 73 transitions. [2022-07-11 23:35:54,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-07-11 23:35:54,685 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:35:54,686 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:35:54,703 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2022-07-11 23:35:54,903 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:35:54,904 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:35:54,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:35:54,904 INFO L85 PathProgramCache]: Analyzing trace with hash -105011125, now seen corresponding path program 17 times [2022-07-11 23:35:54,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:35:54,904 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973281606] [2022-07-11 23:35:54,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:35:54,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:35:54,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:35:55,727 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 25 proven. 75 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:35:55,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:35:55,727 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973281606] [2022-07-11 23:35:55,727 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [973281606] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-11 23:35:55,727 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [285297063] [2022-07-11 23:35:55,727 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-11 23:35:55,727 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:35:55,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:35:55,728 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) [2022-07-11 23:35:55,734 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-07-11 23:35:55,853 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2022-07-11 23:35:55,853 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-11 23:35:55,855 INFO L263 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 16 conjunts are in the unsatisfiable core [2022-07-11 23:35:55,855 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:35:56,755 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 36 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:35:56,756 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-11 23:35:57,132 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 36 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:35:57,132 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [285297063] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-11 23:35:57,132 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-11 23:35:57,132 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 26 [2022-07-11 23:35:57,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495920521] [2022-07-11 23:35:57,132 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-11 23:35:57,133 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-07-11 23:35:57,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:35:57,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-07-11 23:35:57,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=485, Unknown=0, NotChecked=0, Total=650 [2022-07-11 23:35:57,133 INFO L87 Difference]: Start difference. First operand 67 states and 73 transitions. Second operand has 26 states, 26 states have (on average 2.6923076923076925) internal successors, (70), 26 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:35:59,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:35:59,745 INFO L93 Difference]: Finished difference Result 85 states and 94 transitions. [2022-07-11 23:35:59,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-07-11 23:35:59,747 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.6923076923076925) internal successors, (70), 26 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2022-07-11 23:35:59,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:35:59,747 INFO L225 Difference]: With dead ends: 85 [2022-07-11 23:35:59,747 INFO L226 Difference]: Without dead ends: 81 [2022-07-11 23:35:59,748 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 75 SyntacticMatches, 2 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 427 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=352, Invalid=1208, Unknown=0, NotChecked=0, Total=1560 [2022-07-11 23:35:59,748 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 77 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 548 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 575 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 548 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-07-11 23:35:59,748 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 37 Invalid, 575 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 548 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-07-11 23:35:59,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2022-07-11 23:35:59,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 50. [2022-07-11 23:35:59,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 49 states have (on average 1.1224489795918366) internal successors, (55), 49 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:35:59,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 55 transitions. [2022-07-11 23:35:59,755 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 55 transitions. Word has length 43 [2022-07-11 23:35:59,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:35:59,755 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 55 transitions. [2022-07-11 23:35:59,755 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 2.6923076923076925) internal successors, (70), 26 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:35:59,756 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 55 transitions. [2022-07-11 23:35:59,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-07-11 23:35:59,756 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:35:59,756 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:35:59,773 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2022-07-11 23:35:59,967 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:35:59,967 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:35:59,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:35:59,968 INFO L85 PathProgramCache]: Analyzing trace with hash -2029167523, now seen corresponding path program 18 times [2022-07-11 23:35:59,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:35:59,968 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661395935] [2022-07-11 23:35:59,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:35:59,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:35:59,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:36:00,680 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 54 proven. 52 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:36:00,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:36:00,680 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661395935] [2022-07-11 23:36:00,681 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [661395935] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-11 23:36:00,681 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1222956814] [2022-07-11 23:36:00,681 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-07-11 23:36:00,681 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:36:00,681 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:36:00,682 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) [2022-07-11 23:36:00,683 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-07-11 23:36:00,806 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2022-07-11 23:36:00,806 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-11 23:36:00,807 INFO L263 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 16 conjunts are in the unsatisfiable core [2022-07-11 23:36:00,807 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:36:01,742 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 70 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:36:01,743 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-11 23:36:02,110 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 70 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:36:02,111 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1222956814] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-11 23:36:02,111 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-11 23:36:02,111 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 26 [2022-07-11 23:36:02,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261928694] [2022-07-11 23:36:02,111 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-11 23:36:02,111 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-07-11 23:36:02,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:36:02,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-07-11 23:36:02,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=485, Unknown=0, NotChecked=0, Total=650 [2022-07-11 23:36:02,112 INFO L87 Difference]: Start difference. First operand 50 states and 55 transitions. Second operand has 26 states, 26 states have (on average 2.730769230769231) internal successors, (71), 26 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:36:03,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:36:03,187 INFO L93 Difference]: Finished difference Result 94 states and 106 transitions. [2022-07-11 23:36:03,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-07-11 23:36:03,188 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.730769230769231) internal successors, (71), 26 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2022-07-11 23:36:03,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:36:03,188 INFO L225 Difference]: With dead ends: 94 [2022-07-11 23:36:03,188 INFO L226 Difference]: Without dead ends: 60 [2022-07-11 23:36:03,189 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 78 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 275 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=270, Invalid=786, Unknown=0, NotChecked=0, Total=1056 [2022-07-11 23:36:03,189 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 103 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-11 23:36:03,189 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 35 Invalid, 282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-07-11 23:36:03,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-07-11 23:36:03,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 52. [2022-07-11 23:36:03,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 51 states have (on average 1.1176470588235294) internal successors, (57), 51 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:36:03,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 57 transitions. [2022-07-11 23:36:03,196 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 57 transitions. Word has length 44 [2022-07-11 23:36:03,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:36:03,196 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 57 transitions. [2022-07-11 23:36:03,197 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 2.730769230769231) internal successors, (71), 26 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:36:03,197 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 57 transitions. [2022-07-11 23:36:03,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-07-11 23:36:03,197 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:36:03,197 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:36:03,214 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0