./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-cav19/array_init_var_plus_ind.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -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-cav19/array_init_var_plus_ind.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 c51b17720ce1dad8733576d816f307564aabdff8c7a86cf8d9848ed8571cafd2 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 14:25:50,158 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 14:25:50,160 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 14:25:50,187 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 14:25:50,187 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 14:25:50,188 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 14:25:50,189 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 14:25:50,191 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 14:25:50,192 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 14:25:50,193 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 14:25:50,194 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 14:25:50,195 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 14:25:50,195 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 14:25:50,196 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 14:25:50,198 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 14:25:50,200 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 14:25:50,201 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 14:25:50,205 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 14:25:50,206 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 14:25:50,213 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 14:25:50,214 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 14:25:50,215 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 14:25:50,216 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 14:25:50,216 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 14:25:50,218 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 14:25:50,220 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 14:25:50,222 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 14:25:50,223 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 14:25:50,223 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 14:25:50,224 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 14:25:50,225 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 14:25:50,225 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 14:25:50,227 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 14:25:50,228 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 14:25:50,229 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 14:25:50,230 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 14:25:50,231 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 14:25:50,231 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 14:25:50,231 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 14:25:50,232 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 14:25:50,232 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 14:25:50,234 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-02-20 14:25:50,252 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 14:25:50,255 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 14:25:50,255 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 14:25:50,255 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 14:25:50,256 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 14:25:50,256 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 14:25:50,257 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 14:25:50,257 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 14:25:50,257 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 14:25:50,258 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 14:25:50,258 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 14:25:50,259 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 14:25:50,259 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 14:25:50,259 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 14:25:50,259 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 14:25:50,259 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 14:25:50,259 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 14:25:50,260 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 14:25:50,260 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 14:25:50,260 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 14:25:50,260 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 14:25:50,260 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 14:25:50,260 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 14:25:50,261 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 14:25:50,261 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 14:25:50,261 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 14:25:50,261 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 14:25:50,261 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 14:25:50,261 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 14:25:50,262 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 14:25:50,262 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 14:25:50,262 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 14:25:50,262 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 14:25:50,262 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 -> c51b17720ce1dad8733576d816f307564aabdff8c7a86cf8d9848ed8571cafd2 [2022-02-20 14:25:50,433 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 14:25:50,452 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 14:25:50,455 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 14:25:50,456 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 14:25:50,456 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 14:25:50,457 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-cav19/array_init_var_plus_ind.c [2022-02-20 14:25:50,517 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f862b4c3c/1d5ffb777a7043cd930d363aa15e780e/FLAGe05d7f7e9 [2022-02-20 14:25:50,876 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 14:25:50,876 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-cav19/array_init_var_plus_ind.c [2022-02-20 14:25:50,885 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f862b4c3c/1d5ffb777a7043cd930d363aa15e780e/FLAGe05d7f7e9 [2022-02-20 14:25:50,902 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f862b4c3c/1d5ffb777a7043cd930d363aa15e780e [2022-02-20 14:25:50,904 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 14:25:50,906 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 14:25:50,907 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 14:25:50,908 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 14:25:50,910 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 14:25:50,911 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 02:25:50" (1/1) ... [2022-02-20 14:25:50,912 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c32c71f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:25:50, skipping insertion in model container [2022-02-20 14:25:50,912 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 02:25:50" (1/1) ... [2022-02-20 14:25:50,917 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 14:25:50,927 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 14:25:51,079 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-cav19/array_init_var_plus_ind.c[414,427] [2022-02-20 14:25:51,104 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 14:25:51,113 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 14:25:51,124 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-cav19/array_init_var_plus_ind.c[414,427] [2022-02-20 14:25:51,131 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 14:25:51,141 INFO L208 MainTranslator]: Completed translation [2022-02-20 14:25:51,142 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:25:51 WrapperNode [2022-02-20 14:25:51,142 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 14:25:51,143 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 14:25:51,143 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 14:25:51,143 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 14:25:51,148 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:25:51" (1/1) ... [2022-02-20 14:25:51,153 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:25:51" (1/1) ... [2022-02-20 14:25:51,172 INFO L137 Inliner]: procedures = 15, calls = 13, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 51 [2022-02-20 14:25:51,172 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 14:25:51,173 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 14:25:51,174 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 14:25:51,174 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 14:25:51,179 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:25:51" (1/1) ... [2022-02-20 14:25:51,179 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:25:51" (1/1) ... [2022-02-20 14:25:51,187 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:25:51" (1/1) ... [2022-02-20 14:25:51,187 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:25:51" (1/1) ... [2022-02-20 14:25:51,198 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:25:51" (1/1) ... [2022-02-20 14:25:51,204 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:25:51" (1/1) ... [2022-02-20 14:25:51,207 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:25:51" (1/1) ... [2022-02-20 14:25:51,209 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 14:25:51,210 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 14:25:51,210 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 14:25:51,211 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 14:25:51,212 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:25:51" (1/1) ... [2022-02-20 14:25:51,217 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 14:25:51,224 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:25:51,235 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-02-20 14:25:51,255 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-02-20 14:25:51,276 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 14:25:51,276 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 14:25:51,276 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 14:25:51,276 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-20 14:25:51,277 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 14:25:51,277 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 14:25:51,277 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-20 14:25:51,277 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 14:25:51,326 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 14:25:51,327 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 14:25:51,498 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 14:25:51,503 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 14:25:51,504 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-02-20 14:25:51,523 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 02:25:51 BoogieIcfgContainer [2022-02-20 14:25:51,524 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 14:25:51,525 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 14:25:51,525 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 14:25:51,527 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 14:25:51,528 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 02:25:50" (1/3) ... [2022-02-20 14:25:51,529 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c5617be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 02:25:51, skipping insertion in model container [2022-02-20 14:25:51,529 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:25:51" (2/3) ... [2022-02-20 14:25:51,530 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c5617be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 02:25:51, skipping insertion in model container [2022-02-20 14:25:51,530 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 02:25:51" (3/3) ... [2022-02-20 14:25:51,531 INFO L111 eAbstractionObserver]: Analyzing ICFG array_init_var_plus_ind.c [2022-02-20 14:25:51,535 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 14:25:51,536 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 14:25:51,578 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 14:25:51,586 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-20 14:25:51,586 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 14:25:51,608 INFO L276 IsEmpty]: Start isEmpty. Operand has 16 states, 14 states have (on average 1.5) internal successors, (21), 15 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:25:51,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-02-20 14:25:51,611 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:25:51,612 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:25:51,613 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:25:51,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:25:51,617 INFO L85 PathProgramCache]: Analyzing trace with hash 1818270042, now seen corresponding path program 1 times [2022-02-20 14:25:51,623 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:25:51,624 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178495689] [2022-02-20 14:25:51,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:25:51,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:25:51,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:25:51,793 INFO L290 TraceCheckUtils]: 0: Hoare triple {19#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2);call #Ultimate.allocInit(12, 3);~N~0 := 100000; {19#true} is VALID [2022-02-20 14:25:51,795 INFO L290 TraceCheckUtils]: 1: Hoare triple {19#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~post4#1, main_~x~0#1, main_#t~mem7#1, main_#t~post6#1, main_~k~0#1, main_~i~0#1, main_~j~0#1, main_~#a~0#1.base, main_~#a~0#1.offset;havoc main_~i~0#1;main_~j~0#1 := 0;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4 * ~N~0);main_~i~0#1 := 0; {19#true} is VALID [2022-02-20 14:25:51,796 INFO L290 TraceCheckUtils]: 2: Hoare triple {19#true} assume !true; {20#false} is VALID [2022-02-20 14:25:51,796 INFO L290 TraceCheckUtils]: 3: Hoare triple {20#false} main_~k~0#1 := 1; {20#false} is VALID [2022-02-20 14:25:51,797 INFO L290 TraceCheckUtils]: 4: Hoare triple {20#false} assume !!(main_~k~0#1 < main_~i~0#1);call main_#t~mem7#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~k~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem7#1 >= 0 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {20#false} is VALID [2022-02-20 14:25:51,797 INFO L290 TraceCheckUtils]: 5: Hoare triple {20#false} assume 0 == __VERIFIER_assert_~cond#1; {20#false} is VALID [2022-02-20 14:25:51,797 INFO L290 TraceCheckUtils]: 6: Hoare triple {20#false} assume !false; {20#false} is VALID [2022-02-20 14:25:51,798 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 14:25:51,799 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:25:51,799 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178495689] [2022-02-20 14:25:51,800 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [178495689] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:25:51,800 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:25:51,801 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 14:25:51,802 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113216041] [2022-02-20 14:25:51,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:25:51,806 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 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 7 [2022-02-20 14:25:51,807 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:25:51,809 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 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-02-20 14:25:51,824 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:25:51,825 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 14:25:51,825 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:25:51,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 14:25:51,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 14:25:51,850 INFO L87 Difference]: Start difference. First operand has 16 states, 14 states have (on average 1.5) internal successors, (21), 15 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 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-02-20 14:25:51,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:25:51,896 INFO L93 Difference]: Finished difference Result 27 states and 34 transitions. [2022-02-20 14:25:51,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 14:25:51,897 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 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 7 [2022-02-20 14:25:51,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:25:51,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 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-02-20 14:25:51,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 34 transitions. [2022-02-20 14:25:51,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 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-02-20 14:25:51,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 34 transitions. [2022-02-20 14:25:51,906 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 34 transitions. [2022-02-20 14:25:51,959 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:25:51,966 INFO L225 Difference]: With dead ends: 27 [2022-02-20 14:25:51,971 INFO L226 Difference]: Without dead ends: 12 [2022-02-20 14:25:51,974 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 14:25:51,978 INFO L933 BasicCegarLoop]: 18 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, 18 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-02-20 14:25:51,979 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 14:25:51,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2022-02-20 14:25:52,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2022-02-20 14:25:52,003 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:25:52,003 INFO L82 GeneralOperation]: Start isEquivalent. First operand 12 states. Second operand has 12 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:25:52,004 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states. Second operand has 12 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:25:52,005 INFO L87 Difference]: Start difference. First operand 12 states. Second operand has 12 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:25:52,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:25:52,008 INFO L93 Difference]: Finished difference Result 12 states and 14 transitions. [2022-02-20 14:25:52,008 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 14 transitions. [2022-02-20 14:25:52,008 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:25:52,008 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:25:52,009 INFO L74 IsIncluded]: Start isIncluded. First operand has 12 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 12 states. [2022-02-20 14:25:52,010 INFO L87 Difference]: Start difference. First operand has 12 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 12 states. [2022-02-20 14:25:52,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:25:52,018 INFO L93 Difference]: Finished difference Result 12 states and 14 transitions. [2022-02-20 14:25:52,018 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 14 transitions. [2022-02-20 14:25:52,018 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:25:52,018 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:25:52,018 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:25:52,019 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:25:52,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:25:52,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 14 transitions. [2022-02-20 14:25:52,023 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 14 transitions. Word has length 7 [2022-02-20 14:25:52,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:25:52,023 INFO L470 AbstractCegarLoop]: Abstraction has 12 states and 14 transitions. [2022-02-20 14:25:52,023 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 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-02-20 14:25:52,023 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 14 transitions. [2022-02-20 14:25:52,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-02-20 14:25:52,024 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:25:52,024 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:25:52,024 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 14:25:52,024 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:25:52,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:25:52,025 INFO L85 PathProgramCache]: Analyzing trace with hash 1808111311, now seen corresponding path program 1 times [2022-02-20 14:25:52,025 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:25:52,025 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821743760] [2022-02-20 14:25:52,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:25:52,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:25:52,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:25:52,109 INFO L290 TraceCheckUtils]: 0: Hoare triple {93#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2);call #Ultimate.allocInit(12, 3);~N~0 := 100000; {95#(<= 100000 ~N~0)} is VALID [2022-02-20 14:25:52,120 INFO L290 TraceCheckUtils]: 1: Hoare triple {95#(<= 100000 ~N~0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~post4#1, main_~x~0#1, main_#t~mem7#1, main_#t~post6#1, main_~k~0#1, main_~i~0#1, main_~j~0#1, main_~#a~0#1.base, main_~#a~0#1.offset;havoc main_~i~0#1;main_~j~0#1 := 0;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4 * ~N~0);main_~i~0#1 := 0; {96#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 100000 ~N~0))} is VALID [2022-02-20 14:25:52,122 INFO L290 TraceCheckUtils]: 2: Hoare triple {96#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 100000 ~N~0))} assume !(main_~i~0#1 < ~N~0); {94#false} is VALID [2022-02-20 14:25:52,122 INFO L290 TraceCheckUtils]: 3: Hoare triple {94#false} main_~k~0#1 := 1; {94#false} is VALID [2022-02-20 14:25:52,122 INFO L290 TraceCheckUtils]: 4: Hoare triple {94#false} assume !!(main_~k~0#1 < main_~i~0#1);call main_#t~mem7#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~k~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem7#1 >= 0 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {94#false} is VALID [2022-02-20 14:25:52,123 INFO L290 TraceCheckUtils]: 5: Hoare triple {94#false} assume 0 == __VERIFIER_assert_~cond#1; {94#false} is VALID [2022-02-20 14:25:52,123 INFO L290 TraceCheckUtils]: 6: Hoare triple {94#false} assume !false; {94#false} is VALID [2022-02-20 14:25:52,123 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 14:25:52,123 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:25:52,124 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821743760] [2022-02-20 14:25:52,124 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1821743760] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:25:52,124 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:25:52,124 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 14:25:52,125 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997114037] [2022-02-20 14:25:52,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:25:52,126 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 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 7 [2022-02-20 14:25:52,126 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:25:52,126 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 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-02-20 14:25:52,134 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:25:52,134 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 14:25:52,135 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:25:52,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 14:25:52,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-02-20 14:25:52,136 INFO L87 Difference]: Start difference. First operand 12 states and 14 transitions. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 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-02-20 14:25:52,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:25:52,204 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2022-02-20 14:25:52,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 14:25:52,205 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 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 7 [2022-02-20 14:25:52,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:25:52,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 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-02-20 14:25:52,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 33 transitions. [2022-02-20 14:25:52,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 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-02-20 14:25:52,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 33 transitions. [2022-02-20 14:25:52,211 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 33 transitions. [2022-02-20 14:25:52,237 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:25:52,238 INFO L225 Difference]: With dead ends: 29 [2022-02-20 14:25:52,238 INFO L226 Difference]: Without dead ends: 22 [2022-02-20 14:25:52,239 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-02-20 14:25:52,240 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 23 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 14:25:52,240 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 15 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 14:25:52,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-02-20 14:25:52,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 13. [2022-02-20 14:25:52,246 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:25:52,246 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand has 13 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 0 states have call successors, (0), 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-02-20 14:25:52,246 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand has 13 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 0 states have call successors, (0), 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-02-20 14:25:52,246 INFO L87 Difference]: Start difference. First operand 22 states. Second operand has 13 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 0 states have call successors, (0), 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-02-20 14:25:52,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:25:52,248 INFO L93 Difference]: Finished difference Result 22 states and 25 transitions. [2022-02-20 14:25:52,248 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2022-02-20 14:25:52,248 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:25:52,248 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:25:52,249 INFO L74 IsIncluded]: Start isIncluded. First operand has 13 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 0 states have call successors, (0), 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 22 states. [2022-02-20 14:25:52,249 INFO L87 Difference]: Start difference. First operand has 13 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 0 states have call successors, (0), 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 22 states. [2022-02-20 14:25:52,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:25:52,250 INFO L93 Difference]: Finished difference Result 22 states and 25 transitions. [2022-02-20 14:25:52,250 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2022-02-20 14:25:52,251 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:25:52,251 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:25:52,251 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:25:52,251 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:25:52,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 0 states have call successors, (0), 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-02-20 14:25:52,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 15 transitions. [2022-02-20 14:25:52,252 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 15 transitions. Word has length 7 [2022-02-20 14:25:52,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:25:52,253 INFO L470 AbstractCegarLoop]: Abstraction has 13 states and 15 transitions. [2022-02-20 14:25:52,253 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 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-02-20 14:25:52,253 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 15 transitions. [2022-02-20 14:25:52,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-02-20 14:25:52,254 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:25:52,254 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:25:52,254 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 14:25:52,254 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:25:52,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:25:52,255 INFO L85 PathProgramCache]: Analyzing trace with hash 266504688, now seen corresponding path program 1 times [2022-02-20 14:25:52,255 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:25:52,255 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996599767] [2022-02-20 14:25:52,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:25:52,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:25:52,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:25:52,296 INFO L290 TraceCheckUtils]: 0: Hoare triple {193#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2);call #Ultimate.allocInit(12, 3);~N~0 := 100000; {193#true} is VALID [2022-02-20 14:25:52,297 INFO L290 TraceCheckUtils]: 1: Hoare triple {193#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~post4#1, main_~x~0#1, main_#t~mem7#1, main_#t~post6#1, main_~k~0#1, main_~i~0#1, main_~j~0#1, main_~#a~0#1.base, main_~#a~0#1.offset;havoc main_~i~0#1;main_~j~0#1 := 0;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4 * ~N~0);main_~i~0#1 := 0; {195#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:25:52,298 INFO L290 TraceCheckUtils]: 2: Hoare triple {195#(= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < ~N~0);assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~x~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {195#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:25:52,298 INFO L290 TraceCheckUtils]: 3: Hoare triple {195#(= |ULTIMATE.start_main_~i~0#1| 0)} assume 0 != main_~x~0#1; {195#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:25:52,299 INFO L290 TraceCheckUtils]: 4: Hoare triple {195#(= |ULTIMATE.start_main_~i~0#1| 0)} main_~k~0#1 := 1; {196#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= (+ (- 1) |ULTIMATE.start_main_~k~0#1|) 0))} is VALID [2022-02-20 14:25:52,300 INFO L290 TraceCheckUtils]: 5: Hoare triple {196#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= (+ (- 1) |ULTIMATE.start_main_~k~0#1|) 0))} assume !!(main_~k~0#1 < main_~i~0#1);call main_#t~mem7#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~k~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem7#1 >= 0 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {194#false} is VALID [2022-02-20 14:25:52,300 INFO L290 TraceCheckUtils]: 6: Hoare triple {194#false} assume 0 == __VERIFIER_assert_~cond#1; {194#false} is VALID [2022-02-20 14:25:52,300 INFO L290 TraceCheckUtils]: 7: Hoare triple {194#false} assume !false; {194#false} is VALID [2022-02-20 14:25:52,301 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 14:25:52,301 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:25:52,301 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996599767] [2022-02-20 14:25:52,301 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [996599767] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:25:52,301 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:25:52,302 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 14:25:52,302 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456764735] [2022-02-20 14:25:52,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:25:52,302 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 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 8 [2022-02-20 14:25:52,303 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:25:52,303 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 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-02-20 14:25:52,311 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:25:52,312 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 14:25:52,312 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:25:52,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 14:25:52,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-02-20 14:25:52,313 INFO L87 Difference]: Start difference. First operand 13 states and 15 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 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-02-20 14:25:52,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:25:52,381 INFO L93 Difference]: Finished difference Result 23 states and 26 transitions. [2022-02-20 14:25:52,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 14:25:52,381 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 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 8 [2022-02-20 14:25:52,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:25:52,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 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-02-20 14:25:52,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 26 transitions. [2022-02-20 14:25:52,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 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-02-20 14:25:52,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 26 transitions. [2022-02-20 14:25:52,384 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 26 transitions. [2022-02-20 14:25:52,416 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:25:52,417 INFO L225 Difference]: With dead ends: 23 [2022-02-20 14:25:52,418 INFO L226 Difference]: Without dead ends: 15 [2022-02-20 14:25:52,418 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-02-20 14:25:52,419 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 2 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 14:25:52,421 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 20 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 14:25:52,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-02-20 14:25:52,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2022-02-20 14:25:52,428 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:25:52,428 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states. Second operand has 14 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:25:52,429 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand has 14 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:25:52,429 INFO L87 Difference]: Start difference. First operand 15 states. Second operand has 14 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:25:52,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:25:52,430 INFO L93 Difference]: Finished difference Result 15 states and 17 transitions. [2022-02-20 14:25:52,430 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2022-02-20 14:25:52,430 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:25:52,430 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:25:52,430 INFO L74 IsIncluded]: Start isIncluded. First operand has 14 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 15 states. [2022-02-20 14:25:52,431 INFO L87 Difference]: Start difference. First operand has 14 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 15 states. [2022-02-20 14:25:52,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:25:52,432 INFO L93 Difference]: Finished difference Result 15 states and 17 transitions. [2022-02-20 14:25:52,432 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2022-02-20 14:25:52,432 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:25:52,432 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:25:52,432 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:25:52,432 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:25:52,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:25:52,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2022-02-20 14:25:52,433 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 16 transitions. Word has length 8 [2022-02-20 14:25:52,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:25:52,434 INFO L470 AbstractCegarLoop]: Abstraction has 14 states and 16 transitions. [2022-02-20 14:25:52,434 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 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-02-20 14:25:52,434 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 16 transitions. [2022-02-20 14:25:52,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-02-20 14:25:52,434 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:25:52,434 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:25:52,435 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 14:25:52,435 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:25:52,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:25:52,435 INFO L85 PathProgramCache]: Analyzing trace with hash 53732745, now seen corresponding path program 1 times [2022-02-20 14:25:52,436 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:25:52,436 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389315472] [2022-02-20 14:25:52,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:25:52,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:25:52,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:25:52,524 INFO L290 TraceCheckUtils]: 0: Hoare triple {274#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2);call #Ultimate.allocInit(12, 3);~N~0 := 100000; {274#true} is VALID [2022-02-20 14:25:52,525 INFO L290 TraceCheckUtils]: 1: Hoare triple {274#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~post4#1, main_~x~0#1, main_#t~mem7#1, main_#t~post6#1, main_~k~0#1, main_~i~0#1, main_~j~0#1, main_~#a~0#1.base, main_~#a~0#1.offset;havoc main_~i~0#1;main_~j~0#1 := 0;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4 * ~N~0);main_~i~0#1 := 0; {276#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:25:52,526 INFO L290 TraceCheckUtils]: 2: Hoare triple {276#(= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < ~N~0);assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~x~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {276#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:25:52,527 INFO L290 TraceCheckUtils]: 3: Hoare triple {276#(= |ULTIMATE.start_main_~i~0#1| 0)} assume !(0 != main_~x~0#1);call write~int(main_~j~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~j~0#1 := main_~j~0#1 + main_~i~0#1; {276#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:25:52,528 INFO L290 TraceCheckUtils]: 4: Hoare triple {276#(= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {277#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 14:25:52,529 INFO L290 TraceCheckUtils]: 5: Hoare triple {277#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !(main_~i~0#1 < ~N~0); {277#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 14:25:52,529 INFO L290 TraceCheckUtils]: 6: Hoare triple {277#(<= |ULTIMATE.start_main_~i~0#1| 1)} main_~k~0#1 := 1; {278#(and (= (+ (- 1) |ULTIMATE.start_main_~k~0#1|) 0) (<= |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-20 14:25:52,530 INFO L290 TraceCheckUtils]: 7: Hoare triple {278#(and (= (+ (- 1) |ULTIMATE.start_main_~k~0#1|) 0) (<= |ULTIMATE.start_main_~i~0#1| 1))} assume !!(main_~k~0#1 < main_~i~0#1);call main_#t~mem7#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~k~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem7#1 >= 0 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {275#false} is VALID [2022-02-20 14:25:52,530 INFO L290 TraceCheckUtils]: 8: Hoare triple {275#false} assume 0 == __VERIFIER_assert_~cond#1; {275#false} is VALID [2022-02-20 14:25:52,530 INFO L290 TraceCheckUtils]: 9: Hoare triple {275#false} assume !false; {275#false} is VALID [2022-02-20 14:25:52,531 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 14:25:52,531 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:25:52,531 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389315472] [2022-02-20 14:25:52,532 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [389315472] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 14:25:52,532 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [803346226] [2022-02-20 14:25:52,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:25:52,532 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:25:52,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:25:52,548 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-02-20 14:25:52,555 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-02-20 14:25:52,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:25:52,638 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-20 14:25:52,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:25:52,647 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:25:52,799 INFO L290 TraceCheckUtils]: 0: Hoare triple {274#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2);call #Ultimate.allocInit(12, 3);~N~0 := 100000; {282#(<= 100000 ~N~0)} is VALID [2022-02-20 14:25:52,807 INFO L290 TraceCheckUtils]: 1: Hoare triple {282#(<= 100000 ~N~0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~post4#1, main_~x~0#1, main_#t~mem7#1, main_#t~post6#1, main_~k~0#1, main_~i~0#1, main_~j~0#1, main_~#a~0#1.base, main_~#a~0#1.offset;havoc main_~i~0#1;main_~j~0#1 := 0;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4 * ~N~0);main_~i~0#1 := 0; {286#(and (<= |ULTIMATE.start_main_~i~0#1| 0) (<= 100000 ~N~0))} is VALID [2022-02-20 14:25:52,808 INFO L290 TraceCheckUtils]: 2: Hoare triple {286#(and (<= |ULTIMATE.start_main_~i~0#1| 0) (<= 100000 ~N~0))} assume !!(main_~i~0#1 < ~N~0);assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~x~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {286#(and (<= |ULTIMATE.start_main_~i~0#1| 0) (<= 100000 ~N~0))} is VALID [2022-02-20 14:25:52,809 INFO L290 TraceCheckUtils]: 3: Hoare triple {286#(and (<= |ULTIMATE.start_main_~i~0#1| 0) (<= 100000 ~N~0))} assume !(0 != main_~x~0#1);call write~int(main_~j~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~j~0#1 := main_~j~0#1 + main_~i~0#1; {286#(and (<= |ULTIMATE.start_main_~i~0#1| 0) (<= 100000 ~N~0))} is VALID [2022-02-20 14:25:52,810 INFO L290 TraceCheckUtils]: 4: Hoare triple {286#(and (<= |ULTIMATE.start_main_~i~0#1| 0) (<= 100000 ~N~0))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {296#(and (<= 100000 ~N~0) (<= |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-20 14:25:52,810 INFO L290 TraceCheckUtils]: 5: Hoare triple {296#(and (<= 100000 ~N~0) (<= |ULTIMATE.start_main_~i~0#1| 1))} assume !(main_~i~0#1 < ~N~0); {275#false} is VALID [2022-02-20 14:25:52,810 INFO L290 TraceCheckUtils]: 6: Hoare triple {275#false} main_~k~0#1 := 1; {275#false} is VALID [2022-02-20 14:25:52,810 INFO L290 TraceCheckUtils]: 7: Hoare triple {275#false} assume !!(main_~k~0#1 < main_~i~0#1);call main_#t~mem7#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~k~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem7#1 >= 0 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {275#false} is VALID [2022-02-20 14:25:52,811 INFO L290 TraceCheckUtils]: 8: Hoare triple {275#false} assume 0 == __VERIFIER_assert_~cond#1; {275#false} is VALID [2022-02-20 14:25:52,811 INFO L290 TraceCheckUtils]: 9: Hoare triple {275#false} assume !false; {275#false} is VALID [2022-02-20 14:25:52,811 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 14:25:52,812 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 14:25:52,894 INFO L290 TraceCheckUtils]: 9: Hoare triple {275#false} assume !false; {275#false} is VALID [2022-02-20 14:25:52,894 INFO L290 TraceCheckUtils]: 8: Hoare triple {275#false} assume 0 == __VERIFIER_assert_~cond#1; {275#false} is VALID [2022-02-20 14:25:52,895 INFO L290 TraceCheckUtils]: 7: Hoare triple {275#false} assume !!(main_~k~0#1 < main_~i~0#1);call main_#t~mem7#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~k~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem7#1 >= 0 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {275#false} is VALID [2022-02-20 14:25:52,895 INFO L290 TraceCheckUtils]: 6: Hoare triple {275#false} main_~k~0#1 := 1; {275#false} is VALID [2022-02-20 14:25:52,896 INFO L290 TraceCheckUtils]: 5: Hoare triple {324#(< |ULTIMATE.start_main_~i~0#1| ~N~0)} assume !(main_~i~0#1 < ~N~0); {275#false} is VALID [2022-02-20 14:25:52,896 INFO L290 TraceCheckUtils]: 4: Hoare triple {328#(< (+ |ULTIMATE.start_main_~i~0#1| 1) ~N~0)} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {324#(< |ULTIMATE.start_main_~i~0#1| ~N~0)} is VALID [2022-02-20 14:25:52,897 INFO L290 TraceCheckUtils]: 3: Hoare triple {328#(< (+ |ULTIMATE.start_main_~i~0#1| 1) ~N~0)} assume !(0 != main_~x~0#1);call write~int(main_~j~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~j~0#1 := main_~j~0#1 + main_~i~0#1; {328#(< (+ |ULTIMATE.start_main_~i~0#1| 1) ~N~0)} is VALID [2022-02-20 14:25:52,897 INFO L290 TraceCheckUtils]: 2: Hoare triple {328#(< (+ |ULTIMATE.start_main_~i~0#1| 1) ~N~0)} assume !!(main_~i~0#1 < ~N~0);assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~x~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {328#(< (+ |ULTIMATE.start_main_~i~0#1| 1) ~N~0)} is VALID [2022-02-20 14:25:52,898 INFO L290 TraceCheckUtils]: 1: Hoare triple {338#(< 1 ~N~0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~post4#1, main_~x~0#1, main_#t~mem7#1, main_#t~post6#1, main_~k~0#1, main_~i~0#1, main_~j~0#1, main_~#a~0#1.base, main_~#a~0#1.offset;havoc main_~i~0#1;main_~j~0#1 := 0;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4 * ~N~0);main_~i~0#1 := 0; {328#(< (+ |ULTIMATE.start_main_~i~0#1| 1) ~N~0)} is VALID [2022-02-20 14:25:52,899 INFO L290 TraceCheckUtils]: 0: Hoare triple {274#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2);call #Ultimate.allocInit(12, 3);~N~0 := 100000; {338#(< 1 ~N~0)} is VALID [2022-02-20 14:25:52,899 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 14:25:52,899 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [803346226] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 14:25:52,900 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 14:25:52,900 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 11 [2022-02-20 14:25:52,900 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992293390] [2022-02-20 14:25:52,900 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 14:25:52,908 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 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) Word has length 10 [2022-02-20 14:25:52,908 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:25:52,908 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 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-02-20 14:25:52,933 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:25:52,934 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-02-20 14:25:52,934 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:25:52,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-02-20 14:25:52,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2022-02-20 14:25:52,940 INFO L87 Difference]: Start difference. First operand 14 states and 16 transitions. Second operand has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 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-02-20 14:25:53,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:25:53,168 INFO L93 Difference]: Finished difference Result 45 states and 52 transitions. [2022-02-20 14:25:53,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-20 14:25:53,168 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 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) Word has length 10 [2022-02-20 14:25:53,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:25:53,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 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-02-20 14:25:53,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 52 transitions. [2022-02-20 14:25:53,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 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-02-20 14:25:53,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 52 transitions. [2022-02-20 14:25:53,172 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 52 transitions. [2022-02-20 14:25:53,227 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:25:53,229 INFO L225 Difference]: With dead ends: 45 [2022-02-20 14:25:53,229 INFO L226 Difference]: Without dead ends: 36 [2022-02-20 14:25:53,230 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=137, Unknown=0, NotChecked=0, Total=210 [2022-02-20 14:25:53,231 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 120 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 14:25:53,231 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [120 Valid, 39 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 14:25:53,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-02-20 14:25:53,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 22. [2022-02-20 14:25:53,240 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:25:53,241 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand has 22 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 21 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:25:53,241 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand has 22 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 21 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:25:53,241 INFO L87 Difference]: Start difference. First operand 36 states. Second operand has 22 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 21 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:25:53,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:25:53,243 INFO L93 Difference]: Finished difference Result 36 states and 39 transitions. [2022-02-20 14:25:53,243 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 39 transitions. [2022-02-20 14:25:53,243 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:25:53,244 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:25:53,244 INFO L74 IsIncluded]: Start isIncluded. First operand has 22 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 21 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 36 states. [2022-02-20 14:25:53,244 INFO L87 Difference]: Start difference. First operand has 22 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 21 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 36 states. [2022-02-20 14:25:53,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:25:53,246 INFO L93 Difference]: Finished difference Result 36 states and 39 transitions. [2022-02-20 14:25:53,246 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 39 transitions. [2022-02-20 14:25:53,246 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:25:53,246 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:25:53,247 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:25:53,247 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:25:53,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 21 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:25:53,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2022-02-20 14:25:53,248 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 25 transitions. Word has length 10 [2022-02-20 14:25:53,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:25:53,248 INFO L470 AbstractCegarLoop]: Abstraction has 22 states and 25 transitions. [2022-02-20 14:25:53,249 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 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-02-20 14:25:53,249 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2022-02-20 14:25:53,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-02-20 14:25:53,249 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:25:53,250 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:25:53,289 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-02-20 14:25:53,467 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:25:53,468 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:25:53,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:25:53,468 INFO L85 PathProgramCache]: Analyzing trace with hash -334334928, now seen corresponding path program 1 times [2022-02-20 14:25:53,468 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:25:53,468 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040057441] [2022-02-20 14:25:53,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:25:53,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:25:53,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:25:53,645 INFO L290 TraceCheckUtils]: 0: Hoare triple {504#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2);call #Ultimate.allocInit(12, 3);~N~0 := 100000; {504#true} is VALID [2022-02-20 14:25:53,646 INFO L290 TraceCheckUtils]: 1: Hoare triple {504#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~post4#1, main_~x~0#1, main_#t~mem7#1, main_#t~post6#1, main_~k~0#1, main_~i~0#1, main_~j~0#1, main_~#a~0#1.base, main_~#a~0#1.offset;havoc main_~i~0#1;main_~j~0#1 := 0;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4 * ~N~0);main_~i~0#1 := 0; {506#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-20 14:25:53,646 INFO L290 TraceCheckUtils]: 2: Hoare triple {506#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~j~0#1| 0))} assume !!(main_~i~0#1 < ~N~0);assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~x~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {506#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-20 14:25:53,647 INFO L290 TraceCheckUtils]: 3: Hoare triple {506#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~j~0#1| 0))} assume !(0 != main_~x~0#1);call write~int(main_~j~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~j~0#1 := main_~j~0#1 + main_~i~0#1; {507#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~j~0#1|))} is VALID [2022-02-20 14:25:53,647 INFO L290 TraceCheckUtils]: 4: Hoare triple {507#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~j~0#1|))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {508#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= 0 |ULTIMATE.start_main_~j~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-20 14:25:53,648 INFO L290 TraceCheckUtils]: 5: Hoare triple {508#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= 0 |ULTIMATE.start_main_~j~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 1))} assume !!(main_~i~0#1 < ~N~0);assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~x~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {508#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= 0 |ULTIMATE.start_main_~j~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-20 14:25:53,648 INFO L290 TraceCheckUtils]: 6: Hoare triple {508#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= 0 |ULTIMATE.start_main_~j~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 1))} assume !(0 != main_~x~0#1);call write~int(main_~j~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~j~0#1 := main_~j~0#1 + main_~i~0#1; {509#(and (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-20 14:25:53,649 INFO L290 TraceCheckUtils]: 7: Hoare triple {509#(and (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 1))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {510#(<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 4)))} is VALID [2022-02-20 14:25:53,649 INFO L290 TraceCheckUtils]: 8: Hoare triple {510#(<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 4)))} assume !!(main_~i~0#1 < ~N~0);assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~x~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {510#(<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 4)))} is VALID [2022-02-20 14:25:53,650 INFO L290 TraceCheckUtils]: 9: Hoare triple {510#(<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 4)))} assume 0 != main_~x~0#1; {510#(<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 4)))} is VALID [2022-02-20 14:25:53,650 INFO L290 TraceCheckUtils]: 10: Hoare triple {510#(<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 4)))} main_~k~0#1 := 1; {511#(and (= (+ (- 1) |ULTIMATE.start_main_~k~0#1|) 0) (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ (* |ULTIMATE.start_main_~k~0#1| 4) |ULTIMATE.start_main_~#a~0#1.offset|))))} is VALID [2022-02-20 14:25:53,651 INFO L290 TraceCheckUtils]: 11: Hoare triple {511#(and (= (+ (- 1) |ULTIMATE.start_main_~k~0#1|) 0) (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ (* |ULTIMATE.start_main_~k~0#1| 4) |ULTIMATE.start_main_~#a~0#1.offset|))))} assume !!(main_~k~0#1 < main_~i~0#1);call main_#t~mem7#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~k~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem7#1 >= 0 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {512#(not (= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0))} is VALID [2022-02-20 14:25:53,651 INFO L290 TraceCheckUtils]: 12: Hoare triple {512#(not (= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0))} assume 0 == __VERIFIER_assert_~cond#1; {505#false} is VALID [2022-02-20 14:25:53,652 INFO L290 TraceCheckUtils]: 13: Hoare triple {505#false} assume !false; {505#false} is VALID [2022-02-20 14:25:53,652 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 14:25:53,652 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:25:53,652 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040057441] [2022-02-20 14:25:53,652 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2040057441] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 14:25:53,652 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [855003822] [2022-02-20 14:25:53,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:25:53,653 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:25:53,653 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:25:53,654 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-02-20 14:25:53,655 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-02-20 14:25:53,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:25:53,712 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 15 conjunts are in the unsatisfiable core [2022-02-20 14:25:53,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:25:53,737 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:25:53,946 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-02-20 14:25:54,199 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-02-20 14:25:54,317 INFO L290 TraceCheckUtils]: 0: Hoare triple {504#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2);call #Ultimate.allocInit(12, 3);~N~0 := 100000; {504#true} is VALID [2022-02-20 14:25:54,318 INFO L290 TraceCheckUtils]: 1: Hoare triple {504#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~post4#1, main_~x~0#1, main_#t~mem7#1, main_#t~post6#1, main_~k~0#1, main_~i~0#1, main_~j~0#1, main_~#a~0#1.base, main_~#a~0#1.offset;havoc main_~i~0#1;main_~j~0#1 := 0;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4 * ~N~0);main_~i~0#1 := 0; {507#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~j~0#1|))} is VALID [2022-02-20 14:25:54,319 INFO L290 TraceCheckUtils]: 2: Hoare triple {507#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~j~0#1|))} assume !!(main_~i~0#1 < ~N~0);assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~x~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {507#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~j~0#1|))} is VALID [2022-02-20 14:25:54,319 INFO L290 TraceCheckUtils]: 3: Hoare triple {507#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~j~0#1|))} assume !(0 != main_~x~0#1);call write~int(main_~j~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~j~0#1 := main_~j~0#1 + main_~i~0#1; {507#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~j~0#1|))} is VALID [2022-02-20 14:25:54,320 INFO L290 TraceCheckUtils]: 4: Hoare triple {507#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~j~0#1|))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {508#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= 0 |ULTIMATE.start_main_~j~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-20 14:25:54,321 INFO L290 TraceCheckUtils]: 5: Hoare triple {508#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= 0 |ULTIMATE.start_main_~j~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 1))} assume !!(main_~i~0#1 < ~N~0);assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~x~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {508#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= 0 |ULTIMATE.start_main_~j~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-20 14:25:54,322 INFO L290 TraceCheckUtils]: 6: Hoare triple {508#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= 0 |ULTIMATE.start_main_~j~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 1))} assume !(0 != main_~x~0#1);call write~int(main_~j~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~j~0#1 := main_~j~0#1 + main_~i~0#1; {510#(<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 4)))} is VALID [2022-02-20 14:25:54,322 INFO L290 TraceCheckUtils]: 7: Hoare triple {510#(<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 4)))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {510#(<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 4)))} is VALID [2022-02-20 14:25:54,324 INFO L290 TraceCheckUtils]: 8: Hoare triple {510#(<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 4)))} assume !!(main_~i~0#1 < ~N~0);assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~x~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {510#(<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 4)))} is VALID [2022-02-20 14:25:54,325 INFO L290 TraceCheckUtils]: 9: Hoare triple {510#(<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 4)))} assume 0 != main_~x~0#1; {510#(<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 4)))} is VALID [2022-02-20 14:25:54,325 INFO L290 TraceCheckUtils]: 10: Hoare triple {510#(<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 4)))} main_~k~0#1 := 1; {511#(and (= (+ (- 1) |ULTIMATE.start_main_~k~0#1|) 0) (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ (* |ULTIMATE.start_main_~k~0#1| 4) |ULTIMATE.start_main_~#a~0#1.offset|))))} is VALID [2022-02-20 14:25:54,326 INFO L290 TraceCheckUtils]: 11: Hoare triple {511#(and (= (+ (- 1) |ULTIMATE.start_main_~k~0#1|) 0) (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ (* |ULTIMATE.start_main_~k~0#1| 4) |ULTIMATE.start_main_~#a~0#1.offset|))))} assume !!(main_~k~0#1 < main_~i~0#1);call main_#t~mem7#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~k~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem7#1 >= 0 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {549#(<= 1 |ULTIMATE.start___VERIFIER_assert_~cond#1|)} is VALID [2022-02-20 14:25:54,326 INFO L290 TraceCheckUtils]: 12: Hoare triple {549#(<= 1 |ULTIMATE.start___VERIFIER_assert_~cond#1|)} assume 0 == __VERIFIER_assert_~cond#1; {505#false} is VALID [2022-02-20 14:25:54,326 INFO L290 TraceCheckUtils]: 13: Hoare triple {505#false} assume !false; {505#false} is VALID [2022-02-20 14:25:54,327 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 14:25:54,327 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 14:25:54,544 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 16 treesize of output 14 [2022-02-20 14:25:54,565 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 28 [2022-02-20 14:25:54,711 INFO L290 TraceCheckUtils]: 13: Hoare triple {505#false} assume !false; {505#false} is VALID [2022-02-20 14:25:54,712 INFO L290 TraceCheckUtils]: 12: Hoare triple {549#(<= 1 |ULTIMATE.start___VERIFIER_assert_~cond#1|)} assume 0 == __VERIFIER_assert_~cond#1; {505#false} is VALID [2022-02-20 14:25:54,712 INFO L290 TraceCheckUtils]: 11: Hoare triple {562#(<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ (* |ULTIMATE.start_main_~k~0#1| 4) |ULTIMATE.start_main_~#a~0#1.offset|)))} assume !!(main_~k~0#1 < main_~i~0#1);call main_#t~mem7#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~k~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem7#1 >= 0 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {549#(<= 1 |ULTIMATE.start___VERIFIER_assert_~cond#1|)} is VALID [2022-02-20 14:25:54,713 INFO L290 TraceCheckUtils]: 10: Hoare triple {510#(<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 4)))} main_~k~0#1 := 1; {562#(<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ (* |ULTIMATE.start_main_~k~0#1| 4) |ULTIMATE.start_main_~#a~0#1.offset|)))} is VALID [2022-02-20 14:25:54,713 INFO L290 TraceCheckUtils]: 9: Hoare triple {510#(<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 4)))} assume 0 != main_~x~0#1; {510#(<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 4)))} is VALID [2022-02-20 14:25:54,714 INFO L290 TraceCheckUtils]: 8: Hoare triple {510#(<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 4)))} assume !!(main_~i~0#1 < ~N~0);assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~x~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {510#(<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 4)))} is VALID [2022-02-20 14:25:54,714 INFO L290 TraceCheckUtils]: 7: Hoare triple {510#(<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 4)))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {510#(<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 4)))} is VALID [2022-02-20 14:25:54,715 INFO L290 TraceCheckUtils]: 6: Hoare triple {508#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= 0 |ULTIMATE.start_main_~j~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 1))} assume !(0 != main_~x~0#1);call write~int(main_~j~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~j~0#1 := main_~j~0#1 + main_~i~0#1; {510#(<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 4)))} is VALID [2022-02-20 14:25:54,715 INFO L290 TraceCheckUtils]: 5: Hoare triple {508#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= 0 |ULTIMATE.start_main_~j~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 1))} assume !!(main_~i~0#1 < ~N~0);assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~x~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {508#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= 0 |ULTIMATE.start_main_~j~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-20 14:25:54,716 INFO L290 TraceCheckUtils]: 4: Hoare triple {507#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~j~0#1|))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {508#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= 0 |ULTIMATE.start_main_~j~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-20 14:25:54,716 INFO L290 TraceCheckUtils]: 3: Hoare triple {507#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~j~0#1|))} assume !(0 != main_~x~0#1);call write~int(main_~j~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~j~0#1 := main_~j~0#1 + main_~i~0#1; {507#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~j~0#1|))} is VALID [2022-02-20 14:25:54,717 INFO L290 TraceCheckUtils]: 2: Hoare triple {507#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~j~0#1|))} assume !!(main_~i~0#1 < ~N~0);assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~x~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {507#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~j~0#1|))} is VALID [2022-02-20 14:25:54,717 INFO L290 TraceCheckUtils]: 1: Hoare triple {504#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~post4#1, main_~x~0#1, main_#t~mem7#1, main_#t~post6#1, main_~k~0#1, main_~i~0#1, main_~j~0#1, main_~#a~0#1.base, main_~#a~0#1.offset;havoc main_~i~0#1;main_~j~0#1 := 0;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4 * ~N~0);main_~i~0#1 := 0; {507#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~j~0#1|))} is VALID [2022-02-20 14:25:54,718 INFO L290 TraceCheckUtils]: 0: Hoare triple {504#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2);call #Ultimate.allocInit(12, 3);~N~0 := 100000; {504#true} is VALID [2022-02-20 14:25:54,718 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 14:25:54,718 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [855003822] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 14:25:54,718 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 14:25:54,718 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 11 [2022-02-20 14:25:54,719 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238831181] [2022-02-20 14:25:54,719 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 14:25:54,719 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-02-20 14:25:54,719 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:25:54,720 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 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-02-20 14:25:54,734 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:25:54,734 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-02-20 14:25:54,735 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:25:54,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-02-20 14:25:54,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2022-02-20 14:25:54,736 INFO L87 Difference]: Start difference. First operand 22 states and 25 transitions. Second operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 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-02-20 14:25:55,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:25:55,052 INFO L93 Difference]: Finished difference Result 37 states and 40 transitions. [2022-02-20 14:25:55,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-20 14:25:55,052 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-02-20 14:25:55,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:25:55,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 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-02-20 14:25:55,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 38 transitions. [2022-02-20 14:25:55,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 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-02-20 14:25:55,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 38 transitions. [2022-02-20 14:25:55,054 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 38 transitions. [2022-02-20 14:25:55,090 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:25:55,092 INFO L225 Difference]: With dead ends: 37 [2022-02-20 14:25:55,092 INFO L226 Difference]: Without dead ends: 35 [2022-02-20 14:25:55,092 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 17 SyntacticMatches, 9 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2022-02-20 14:25:55,093 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 15 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 14:25:55,093 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 84 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 14:25:55,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-02-20 14:25:55,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 25. [2022-02-20 14:25:55,113 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:25:55,113 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second 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-02-20 14:25:55,113 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second 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-02-20 14:25:55,113 INFO L87 Difference]: Start difference. First operand 35 states. Second 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-02-20 14:25:55,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:25:55,115 INFO L93 Difference]: Finished difference Result 35 states and 38 transitions. [2022-02-20 14:25:55,115 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2022-02-20 14:25:55,118 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:25:55,119 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:25:55,119 INFO L74 IsIncluded]: Start isIncluded. First 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) Second operand 35 states. [2022-02-20 14:25:55,120 INFO L87 Difference]: Start difference. First 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) Second operand 35 states. [2022-02-20 14:25:55,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:25:55,122 INFO L93 Difference]: Finished difference Result 35 states and 38 transitions. [2022-02-20 14:25:55,122 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2022-02-20 14:25:55,122 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:25:55,122 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:25:55,123 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:25:55,123 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:25:55,123 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-02-20 14:25:55,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2022-02-20 14:25:55,124 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 14 [2022-02-20 14:25:55,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:25:55,124 INFO L470 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2022-02-20 14:25:55,124 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 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-02-20 14:25:55,124 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2022-02-20 14:25:55,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-02-20 14:25:55,125 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:25:55,125 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:25:55,149 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-02-20 14:25:55,335 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:25:55,335 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:25:55,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:25:55,336 INFO L85 PathProgramCache]: Analyzing trace with hash -768933834, now seen corresponding path program 2 times [2022-02-20 14:25:55,336 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:25:55,336 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356583390] [2022-02-20 14:25:55,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:25:55,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:25:55,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:25:55,521 INFO L290 TraceCheckUtils]: 0: Hoare triple {752#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2);call #Ultimate.allocInit(12, 3);~N~0 := 100000; {752#true} is VALID [2022-02-20 14:25:55,522 INFO L290 TraceCheckUtils]: 1: Hoare triple {752#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~post4#1, main_~x~0#1, main_#t~mem7#1, main_#t~post6#1, main_~k~0#1, main_~i~0#1, main_~j~0#1, main_~#a~0#1.base, main_~#a~0#1.offset;havoc main_~i~0#1;main_~j~0#1 := 0;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4 * ~N~0);main_~i~0#1 := 0; {754#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-20 14:25:55,522 INFO L290 TraceCheckUtils]: 2: Hoare triple {754#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~j~0#1| 0))} assume !!(main_~i~0#1 < ~N~0);assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~x~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {754#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-20 14:25:55,523 INFO L290 TraceCheckUtils]: 3: Hoare triple {754#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~j~0#1| 0))} assume !(0 != main_~x~0#1);call write~int(main_~j~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~j~0#1 := main_~j~0#1 + main_~i~0#1; {754#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-20 14:25:55,523 INFO L290 TraceCheckUtils]: 4: Hoare triple {754#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~j~0#1| 0))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {755#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (= |ULTIMATE.start_main_~j~0#1| 0) (<= |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-20 14:25:55,524 INFO L290 TraceCheckUtils]: 5: Hoare triple {755#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (= |ULTIMATE.start_main_~j~0#1| 0) (<= |ULTIMATE.start_main_~i~0#1| 1))} assume !!(main_~i~0#1 < ~N~0);assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~x~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {755#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (= |ULTIMATE.start_main_~j~0#1| 0) (<= |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-20 14:25:55,524 INFO L290 TraceCheckUtils]: 6: Hoare triple {755#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (= |ULTIMATE.start_main_~j~0#1| 0) (<= |ULTIMATE.start_main_~i~0#1| 1))} assume !(0 != main_~x~0#1);call write~int(main_~j~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~j~0#1 := main_~j~0#1 + main_~i~0#1; {756#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (= (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) 0) (<= |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-20 14:25:55,525 INFO L290 TraceCheckUtils]: 7: Hoare triple {756#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (= (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) 0) (<= |ULTIMATE.start_main_~i~0#1| 1))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {757#(and (not (= (+ |ULTIMATE.start_main_~#a~0#1.offset| 4) (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (= (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 4)) 0))} is VALID [2022-02-20 14:25:55,525 INFO L290 TraceCheckUtils]: 8: Hoare triple {757#(and (not (= (+ |ULTIMATE.start_main_~#a~0#1.offset| 4) (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (= (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 4)) 0))} assume !!(main_~i~0#1 < ~N~0);assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~x~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {757#(and (not (= (+ |ULTIMATE.start_main_~#a~0#1.offset| 4) (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (= (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 4)) 0))} is VALID [2022-02-20 14:25:55,526 INFO L290 TraceCheckUtils]: 9: Hoare triple {757#(and (not (= (+ |ULTIMATE.start_main_~#a~0#1.offset| 4) (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (= (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 4)) 0))} assume !(0 != main_~x~0#1);call write~int(main_~j~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~j~0#1 := main_~j~0#1 + main_~i~0#1; {758#(= (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 4)) 0)} is VALID [2022-02-20 14:25:55,526 INFO L290 TraceCheckUtils]: 10: Hoare triple {758#(= (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 4)) 0)} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {758#(= (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 4)) 0)} is VALID [2022-02-20 14:25:55,527 INFO L290 TraceCheckUtils]: 11: Hoare triple {758#(= (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 4)) 0)} assume !!(main_~i~0#1 < ~N~0);assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~x~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {758#(= (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 4)) 0)} is VALID [2022-02-20 14:25:55,530 INFO L290 TraceCheckUtils]: 12: Hoare triple {758#(= (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 4)) 0)} assume 0 != main_~x~0#1; {758#(= (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 4)) 0)} is VALID [2022-02-20 14:25:55,530 INFO L290 TraceCheckUtils]: 13: Hoare triple {758#(= (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 4)) 0)} main_~k~0#1 := 1; {759#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ (* |ULTIMATE.start_main_~k~0#1| 4) |ULTIMATE.start_main_~#a~0#1.offset|)) 0) (= (+ (- 1) |ULTIMATE.start_main_~k~0#1|) 0))} is VALID [2022-02-20 14:25:55,531 INFO L290 TraceCheckUtils]: 14: Hoare triple {759#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ (* |ULTIMATE.start_main_~k~0#1| 4) |ULTIMATE.start_main_~#a~0#1.offset|)) 0) (= (+ (- 1) |ULTIMATE.start_main_~k~0#1|) 0))} assume !!(main_~k~0#1 < main_~i~0#1);call main_#t~mem7#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~k~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem7#1 >= 0 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {760#(not (= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0))} is VALID [2022-02-20 14:25:55,531 INFO L290 TraceCheckUtils]: 15: Hoare triple {760#(not (= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0))} assume 0 == __VERIFIER_assert_~cond#1; {753#false} is VALID [2022-02-20 14:25:55,531 INFO L290 TraceCheckUtils]: 16: Hoare triple {753#false} assume !false; {753#false} is VALID [2022-02-20 14:25:55,531 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 14:25:55,531 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:25:55,532 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356583390] [2022-02-20 14:25:55,532 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [356583390] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 14:25:55,532 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1582850695] [2022-02-20 14:25:55,532 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-20 14:25:55,532 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:25:55,532 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:25:55,548 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-02-20 14:25:55,549 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-02-20 14:25:55,585 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-20 14:25:55,586 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 14:25:55,586 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 18 conjunts are in the unsatisfiable core [2022-02-20 14:25:55,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:25:55,594 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:25:55,694 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-02-20 14:25:55,770 INFO L356 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-02-20 14:25:55,771 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-02-20 14:25:55,926 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-02-20 14:25:55,988 INFO L290 TraceCheckUtils]: 0: Hoare triple {752#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2);call #Ultimate.allocInit(12, 3);~N~0 := 100000; {752#true} is VALID [2022-02-20 14:25:55,989 INFO L290 TraceCheckUtils]: 1: Hoare triple {752#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~post4#1, main_~x~0#1, main_#t~mem7#1, main_#t~post6#1, main_~k~0#1, main_~i~0#1, main_~j~0#1, main_~#a~0#1.base, main_~#a~0#1.offset;havoc main_~i~0#1;main_~j~0#1 := 0;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4 * ~N~0);main_~i~0#1 := 0; {767#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 0 |ULTIMATE.start_main_~j~0#1|))} is VALID [2022-02-20 14:25:55,990 INFO L290 TraceCheckUtils]: 2: Hoare triple {767#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 0 |ULTIMATE.start_main_~j~0#1|))} assume !!(main_~i~0#1 < ~N~0);assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~x~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {767#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 0 |ULTIMATE.start_main_~j~0#1|))} is VALID [2022-02-20 14:25:55,990 INFO L290 TraceCheckUtils]: 3: Hoare triple {767#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 0 |ULTIMATE.start_main_~j~0#1|))} assume !(0 != main_~x~0#1);call write~int(main_~j~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~j~0#1 := main_~j~0#1 + main_~i~0#1; {767#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 0 |ULTIMATE.start_main_~j~0#1|))} is VALID [2022-02-20 14:25:55,995 INFO L290 TraceCheckUtils]: 4: Hoare triple {767#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 0 |ULTIMATE.start_main_~j~0#1|))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {777#(and (= |ULTIMATE.start_main_~i~0#1| 1) (<= 0 |ULTIMATE.start_main_~j~0#1|))} is VALID [2022-02-20 14:25:56,004 INFO L290 TraceCheckUtils]: 5: Hoare triple {777#(and (= |ULTIMATE.start_main_~i~0#1| 1) (<= 0 |ULTIMATE.start_main_~j~0#1|))} assume !!(main_~i~0#1 < ~N~0);assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~x~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {777#(and (= |ULTIMATE.start_main_~i~0#1| 1) (<= 0 |ULTIMATE.start_main_~j~0#1|))} is VALID [2022-02-20 14:25:56,005 INFO L290 TraceCheckUtils]: 6: Hoare triple {777#(and (= |ULTIMATE.start_main_~i~0#1| 1) (<= 0 |ULTIMATE.start_main_~j~0#1|))} assume !(0 != main_~x~0#1);call write~int(main_~j~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~j~0#1 := main_~j~0#1 + main_~i~0#1; {784#(and (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (= |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-20 14:25:56,006 INFO L290 TraceCheckUtils]: 7: Hoare triple {784#(and (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (= |ULTIMATE.start_main_~i~0#1| 1))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {788#(and (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 4))) (<= 2 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-20 14:25:56,006 INFO L290 TraceCheckUtils]: 8: Hoare triple {788#(and (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 4))) (<= 2 |ULTIMATE.start_main_~i~0#1|))} assume !!(main_~i~0#1 < ~N~0);assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~x~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {788#(and (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 4))) (<= 2 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-20 14:25:56,007 INFO L290 TraceCheckUtils]: 9: Hoare triple {788#(and (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 4))) (<= 2 |ULTIMATE.start_main_~i~0#1|))} assume !(0 != main_~x~0#1);call write~int(main_~j~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~j~0#1 := main_~j~0#1 + main_~i~0#1; {795#(<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 4)))} is VALID [2022-02-20 14:25:56,007 INFO L290 TraceCheckUtils]: 10: Hoare triple {795#(<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 4)))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {795#(<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 4)))} is VALID [2022-02-20 14:25:56,007 INFO L290 TraceCheckUtils]: 11: Hoare triple {795#(<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 4)))} assume !!(main_~i~0#1 < ~N~0);assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~x~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {795#(<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 4)))} is VALID [2022-02-20 14:25:56,008 INFO L290 TraceCheckUtils]: 12: Hoare triple {795#(<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 4)))} assume 0 != main_~x~0#1; {795#(<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 4)))} is VALID [2022-02-20 14:25:56,008 INFO L290 TraceCheckUtils]: 13: Hoare triple {795#(<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 4)))} main_~k~0#1 := 1; {808#(and (= |ULTIMATE.start_main_~k~0#1| 1) (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 4))))} is VALID [2022-02-20 14:25:56,010 INFO L290 TraceCheckUtils]: 14: Hoare triple {808#(and (= |ULTIMATE.start_main_~k~0#1| 1) (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 4))))} assume !!(main_~k~0#1 < main_~i~0#1);call main_#t~mem7#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~k~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem7#1 >= 0 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {812#(<= 1 |ULTIMATE.start___VERIFIER_assert_~cond#1|)} is VALID [2022-02-20 14:25:56,010 INFO L290 TraceCheckUtils]: 15: Hoare triple {812#(<= 1 |ULTIMATE.start___VERIFIER_assert_~cond#1|)} assume 0 == __VERIFIER_assert_~cond#1; {753#false} is VALID [2022-02-20 14:25:56,010 INFO L290 TraceCheckUtils]: 16: Hoare triple {753#false} assume !false; {753#false} is VALID [2022-02-20 14:25:56,010 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 14:25:56,010 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 14:25:58,240 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_21| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_21|)) (forall ((v_ArrVal_48 Int)) (<= 0 (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#a~0#1.base|) (+ |c_ULTIMATE.start_main_~#a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_21| 4)) v_ArrVal_48) (+ |c_ULTIMATE.start_main_~#a~0#1.offset| 4)))))) is different from false [2022-02-20 14:25:58,422 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 23 treesize of output 21 [2022-02-20 14:25:58,468 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 82 treesize of output 78 [2022-02-20 14:25:58,684 INFO L290 TraceCheckUtils]: 16: Hoare triple {753#false} assume !false; {753#false} is VALID [2022-02-20 14:25:58,684 INFO L290 TraceCheckUtils]: 15: Hoare triple {812#(<= 1 |ULTIMATE.start___VERIFIER_assert_~cond#1|)} assume 0 == __VERIFIER_assert_~cond#1; {753#false} is VALID [2022-02-20 14:25:58,685 INFO L290 TraceCheckUtils]: 14: Hoare triple {825#(<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ (* |ULTIMATE.start_main_~k~0#1| 4) |ULTIMATE.start_main_~#a~0#1.offset|)))} assume !!(main_~k~0#1 < main_~i~0#1);call main_#t~mem7#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~k~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem7#1 >= 0 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {812#(<= 1 |ULTIMATE.start___VERIFIER_assert_~cond#1|)} is VALID [2022-02-20 14:25:58,685 INFO L290 TraceCheckUtils]: 13: Hoare triple {795#(<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 4)))} main_~k~0#1 := 1; {825#(<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ (* |ULTIMATE.start_main_~k~0#1| 4) |ULTIMATE.start_main_~#a~0#1.offset|)))} is VALID [2022-02-20 14:25:58,686 INFO L290 TraceCheckUtils]: 12: Hoare triple {795#(<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 4)))} assume 0 != main_~x~0#1; {795#(<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 4)))} is VALID [2022-02-20 14:25:58,686 INFO L290 TraceCheckUtils]: 11: Hoare triple {795#(<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 4)))} assume !!(main_~i~0#1 < ~N~0);assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~x~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {795#(<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 4)))} is VALID [2022-02-20 14:25:58,686 INFO L290 TraceCheckUtils]: 10: Hoare triple {795#(<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 4)))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {795#(<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 4)))} is VALID [2022-02-20 14:25:58,687 INFO L290 TraceCheckUtils]: 9: Hoare triple {841#(forall ((v_ArrVal_48 Int)) (<= 0 (select (store (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)) v_ArrVal_48) (+ |ULTIMATE.start_main_~#a~0#1.offset| 4))))} assume !(0 != main_~x~0#1);call write~int(main_~j~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~j~0#1 := main_~j~0#1 + main_~i~0#1; {795#(<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 4)))} is VALID [2022-02-20 14:25:58,688 INFO L290 TraceCheckUtils]: 8: Hoare triple {841#(forall ((v_ArrVal_48 Int)) (<= 0 (select (store (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)) v_ArrVal_48) (+ |ULTIMATE.start_main_~#a~0#1.offset| 4))))} assume !!(main_~i~0#1 < ~N~0);assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~x~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {841#(forall ((v_ArrVal_48 Int)) (<= 0 (select (store (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)) v_ArrVal_48) (+ |ULTIMATE.start_main_~#a~0#1.offset| 4))))} is VALID [2022-02-20 14:25:58,688 INFO L290 TraceCheckUtils]: 7: Hoare triple {848#(forall ((|v_ULTIMATE.start_main_~i~0#1_21| Int)) (or (not (<= (+ |ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_21|)) (forall ((v_ArrVal_48 Int)) (<= 0 (select (store (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_21| 4)) v_ArrVal_48) (+ |ULTIMATE.start_main_~#a~0#1.offset| 4))))))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {841#(forall ((v_ArrVal_48 Int)) (<= 0 (select (store (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)) v_ArrVal_48) (+ |ULTIMATE.start_main_~#a~0#1.offset| 4))))} is VALID [2022-02-20 14:25:58,689 INFO L290 TraceCheckUtils]: 6: Hoare triple {777#(and (= |ULTIMATE.start_main_~i~0#1| 1) (<= 0 |ULTIMATE.start_main_~j~0#1|))} assume !(0 != main_~x~0#1);call write~int(main_~j~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~j~0#1 := main_~j~0#1 + main_~i~0#1; {848#(forall ((|v_ULTIMATE.start_main_~i~0#1_21| Int)) (or (not (<= (+ |ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_21|)) (forall ((v_ArrVal_48 Int)) (<= 0 (select (store (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_21| 4)) v_ArrVal_48) (+ |ULTIMATE.start_main_~#a~0#1.offset| 4))))))} is VALID [2022-02-20 14:25:58,690 INFO L290 TraceCheckUtils]: 5: Hoare triple {777#(and (= |ULTIMATE.start_main_~i~0#1| 1) (<= 0 |ULTIMATE.start_main_~j~0#1|))} assume !!(main_~i~0#1 < ~N~0);assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~x~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {777#(and (= |ULTIMATE.start_main_~i~0#1| 1) (<= 0 |ULTIMATE.start_main_~j~0#1|))} is VALID [2022-02-20 14:25:58,690 INFO L290 TraceCheckUtils]: 4: Hoare triple {767#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 0 |ULTIMATE.start_main_~j~0#1|))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {777#(and (= |ULTIMATE.start_main_~i~0#1| 1) (<= 0 |ULTIMATE.start_main_~j~0#1|))} is VALID [2022-02-20 14:25:58,691 INFO L290 TraceCheckUtils]: 3: Hoare triple {767#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 0 |ULTIMATE.start_main_~j~0#1|))} assume !(0 != main_~x~0#1);call write~int(main_~j~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~j~0#1 := main_~j~0#1 + main_~i~0#1; {767#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 0 |ULTIMATE.start_main_~j~0#1|))} is VALID [2022-02-20 14:25:58,691 INFO L290 TraceCheckUtils]: 2: Hoare triple {767#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 0 |ULTIMATE.start_main_~j~0#1|))} assume !!(main_~i~0#1 < ~N~0);assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~x~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {767#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 0 |ULTIMATE.start_main_~j~0#1|))} is VALID [2022-02-20 14:25:58,692 INFO L290 TraceCheckUtils]: 1: Hoare triple {752#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~post4#1, main_~x~0#1, main_#t~mem7#1, main_#t~post6#1, main_~k~0#1, main_~i~0#1, main_~j~0#1, main_~#a~0#1.base, main_~#a~0#1.offset;havoc main_~i~0#1;main_~j~0#1 := 0;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4 * ~N~0);main_~i~0#1 := 0; {767#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 0 |ULTIMATE.start_main_~j~0#1|))} is VALID [2022-02-20 14:25:58,692 INFO L290 TraceCheckUtils]: 0: Hoare triple {752#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2);call #Ultimate.allocInit(12, 3);~N~0 := 100000; {752#true} is VALID [2022-02-20 14:25:58,692 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-02-20 14:25:58,692 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1582850695] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 14:25:58,692 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 14:25:58,692 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 19 [2022-02-20 14:25:58,693 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668042591] [2022-02-20 14:25:58,693 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 14:25:58,693 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.0) internal successors, (38), 19 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 17 [2022-02-20 14:25:58,693 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:25:58,694 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 19 states, 19 states have (on average 2.0) internal successors, (38), 19 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-02-20 14:25:58,722 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:25:58,723 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-02-20 14:25:58,723 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:25:58,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-02-20 14:25:58,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=254, Unknown=1, NotChecked=32, Total=342 [2022-02-20 14:25:58,724 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand has 19 states, 19 states have (on average 2.0) internal successors, (38), 19 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-02-20 14:26:00,804 WARN L838 $PredicateComparison]: unable to prove that (and (<= 0 |c_ULTIMATE.start_main_~j~0#1|) (<= 1 |c_ULTIMATE.start_main_~i~0#1|) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~#a~0#1.offset|)) 0) (forall ((|v_ULTIMATE.start_main_~i~0#1_21| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_21|)) (forall ((v_ArrVal_48 Int)) (<= 0 (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#a~0#1.base|) (+ |c_ULTIMATE.start_main_~#a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_21| 4)) v_ArrVal_48) (+ |c_ULTIMATE.start_main_~#a~0#1.offset| 4)))))) (<= |c_ULTIMATE.start_main_~i~0#1| 1) (= |c_ULTIMATE.start_main_~i~0#1| 1)) is different from false [2022-02-20 14:26:01,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:26:01,048 INFO L93 Difference]: Finished difference Result 41 states and 45 transitions. [2022-02-20 14:26:01,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-02-20 14:26:01,048 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.0) internal successors, (38), 19 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 17 [2022-02-20 14:26:01,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:26:01,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 2.0) internal successors, (38), 19 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-02-20 14:26:01,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 44 transitions. [2022-02-20 14:26:01,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 2.0) internal successors, (38), 19 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-02-20 14:26:01,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 44 transitions. [2022-02-20 14:26:01,050 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 44 transitions. [2022-02-20 14:26:01,082 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:26:01,083 INFO L225 Difference]: With dead ends: 41 [2022-02-20 14:26:01,083 INFO L226 Difference]: Without dead ends: 39 [2022-02-20 14:26:01,083 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 21 SyntacticMatches, 5 SemanticMatches, 23 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=103, Invalid=409, Unknown=2, NotChecked=86, Total=600 [2022-02-20 14:26:01,084 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 44 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 30 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 14:26:01,084 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [44 Valid, 70 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 107 Invalid, 0 Unknown, 30 Unchecked, 0.1s Time] [2022-02-20 14:26:01,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-02-20 14:26:01,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 26. [2022-02-20 14:26:01,101 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:26:01,101 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand has 26 states, 25 states have (on average 1.2) internal successors, (30), 25 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-02-20 14:26:01,101 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand has 26 states, 25 states have (on average 1.2) internal successors, (30), 25 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-02-20 14:26:01,101 INFO L87 Difference]: Start difference. First operand 39 states. Second operand has 26 states, 25 states have (on average 1.2) internal successors, (30), 25 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-02-20 14:26:01,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:26:01,102 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2022-02-20 14:26:01,103 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2022-02-20 14:26:01,103 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:26:01,103 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:26:01,103 INFO L74 IsIncluded]: Start isIncluded. First operand has 26 states, 25 states have (on average 1.2) internal successors, (30), 25 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) Second operand 39 states. [2022-02-20 14:26:01,103 INFO L87 Difference]: Start difference. First operand has 26 states, 25 states have (on average 1.2) internal successors, (30), 25 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) Second operand 39 states. [2022-02-20 14:26:01,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:26:01,104 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2022-02-20 14:26:01,104 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2022-02-20 14:26:01,104 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:26:01,104 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:26:01,104 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:26:01,104 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:26:01,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.2) internal successors, (30), 25 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-02-20 14:26:01,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2022-02-20 14:26:01,105 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 17 [2022-02-20 14:26:01,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:26:01,106 INFO L470 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2022-02-20 14:26:01,106 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.0) internal successors, (38), 19 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-02-20 14:26:01,106 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2022-02-20 14:26:01,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-02-20 14:26:01,106 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:26:01,106 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:26:01,126 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-02-20 14:26:01,319 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:26:01,320 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:26:01,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:26:01,320 INFO L85 PathProgramCache]: Analyzing trace with hash 20881638, now seen corresponding path program 1 times [2022-02-20 14:26:01,320 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:26:01,320 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877725719] [2022-02-20 14:26:01,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:26:01,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:26:01,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:26:01,384 INFO L290 TraceCheckUtils]: 0: Hoare triple {1045#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2);call #Ultimate.allocInit(12, 3);~N~0 := 100000; {1045#true} is VALID [2022-02-20 14:26:01,385 INFO L290 TraceCheckUtils]: 1: Hoare triple {1045#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~post4#1, main_~x~0#1, main_#t~mem7#1, main_#t~post6#1, main_~k~0#1, main_~i~0#1, main_~j~0#1, main_~#a~0#1.base, main_~#a~0#1.offset;havoc main_~i~0#1;main_~j~0#1 := 0;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4 * ~N~0);main_~i~0#1 := 0; {1047#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:26:01,385 INFO L290 TraceCheckUtils]: 2: Hoare triple {1047#(= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < ~N~0);assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~x~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {1047#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:26:01,385 INFO L290 TraceCheckUtils]: 3: Hoare triple {1047#(= |ULTIMATE.start_main_~i~0#1| 0)} assume !(0 != main_~x~0#1);call write~int(main_~j~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~j~0#1 := main_~j~0#1 + main_~i~0#1; {1047#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:26:01,386 INFO L290 TraceCheckUtils]: 4: Hoare triple {1047#(= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {1048#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 14:26:01,386 INFO L290 TraceCheckUtils]: 5: Hoare triple {1048#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !!(main_~i~0#1 < ~N~0);assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~x~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {1048#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 14:26:01,387 INFO L290 TraceCheckUtils]: 6: Hoare triple {1048#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !(0 != main_~x~0#1);call write~int(main_~j~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~j~0#1 := main_~j~0#1 + main_~i~0#1; {1048#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 14:26:01,387 INFO L290 TraceCheckUtils]: 7: Hoare triple {1048#(<= |ULTIMATE.start_main_~i~0#1| 1)} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {1049#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-20 14:26:01,387 INFO L290 TraceCheckUtils]: 8: Hoare triple {1049#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !!(main_~i~0#1 < ~N~0);assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~x~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {1049#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-20 14:26:01,388 INFO L290 TraceCheckUtils]: 9: Hoare triple {1049#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume 0 != main_~x~0#1; {1049#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-20 14:26:01,388 INFO L290 TraceCheckUtils]: 10: Hoare triple {1049#(<= |ULTIMATE.start_main_~i~0#1| 2)} main_~k~0#1 := 1; {1050#(and (<= |ULTIMATE.start_main_~i~0#1| 2) (= (+ (- 1) |ULTIMATE.start_main_~k~0#1|) 0))} is VALID [2022-02-20 14:26:01,389 INFO L290 TraceCheckUtils]: 11: Hoare triple {1050#(and (<= |ULTIMATE.start_main_~i~0#1| 2) (= (+ (- 1) |ULTIMATE.start_main_~k~0#1|) 0))} assume !!(main_~k~0#1 < main_~i~0#1);call main_#t~mem7#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~k~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem7#1 >= 0 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {1050#(and (<= |ULTIMATE.start_main_~i~0#1| 2) (= (+ (- 1) |ULTIMATE.start_main_~k~0#1|) 0))} is VALID [2022-02-20 14:26:01,389 INFO L290 TraceCheckUtils]: 12: Hoare triple {1050#(and (<= |ULTIMATE.start_main_~i~0#1| 2) (= (+ (- 1) |ULTIMATE.start_main_~k~0#1|) 0))} assume !(0 == __VERIFIER_assert_~cond#1); {1050#(and (<= |ULTIMATE.start_main_~i~0#1| 2) (= (+ (- 1) |ULTIMATE.start_main_~k~0#1|) 0))} is VALID [2022-02-20 14:26:01,390 INFO L290 TraceCheckUtils]: 13: Hoare triple {1050#(and (<= |ULTIMATE.start_main_~i~0#1| 2) (= (+ (- 1) |ULTIMATE.start_main_~k~0#1|) 0))} assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem7#1; {1050#(and (<= |ULTIMATE.start_main_~i~0#1| 2) (= (+ (- 1) |ULTIMATE.start_main_~k~0#1|) 0))} is VALID [2022-02-20 14:26:01,390 INFO L290 TraceCheckUtils]: 14: Hoare triple {1050#(and (<= |ULTIMATE.start_main_~i~0#1| 2) (= (+ (- 1) |ULTIMATE.start_main_~k~0#1|) 0))} main_#t~post6#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {1051#(<= |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~k~0#1|)} is VALID [2022-02-20 14:26:01,390 INFO L290 TraceCheckUtils]: 15: Hoare triple {1051#(<= |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~k~0#1|)} assume !!(main_~k~0#1 < main_~i~0#1);call main_#t~mem7#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~k~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem7#1 >= 0 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {1046#false} is VALID [2022-02-20 14:26:01,391 INFO L290 TraceCheckUtils]: 16: Hoare triple {1046#false} assume 0 == __VERIFIER_assert_~cond#1; {1046#false} is VALID [2022-02-20 14:26:01,391 INFO L290 TraceCheckUtils]: 17: Hoare triple {1046#false} assume !false; {1046#false} is VALID [2022-02-20 14:26:01,391 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 14:26:01,391 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:26:01,391 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877725719] [2022-02-20 14:26:01,392 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1877725719] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 14:26:01,392 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2034076115] [2022-02-20 14:26:01,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:26:01,392 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:26:01,392 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:26:01,408 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-02-20 14:26:01,409 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-02-20 14:26:01,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:26:01,452 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-20 14:26:01,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:26:01,460 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:26:01,627 INFO L290 TraceCheckUtils]: 0: Hoare triple {1045#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2);call #Ultimate.allocInit(12, 3);~N~0 := 100000; {1045#true} is VALID [2022-02-20 14:26:01,627 INFO L290 TraceCheckUtils]: 1: Hoare triple {1045#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~post4#1, main_~x~0#1, main_#t~mem7#1, main_#t~post6#1, main_~k~0#1, main_~i~0#1, main_~j~0#1, main_~#a~0#1.base, main_~#a~0#1.offset;havoc main_~i~0#1;main_~j~0#1 := 0;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4 * ~N~0);main_~i~0#1 := 0; {1058#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:26:01,628 INFO L290 TraceCheckUtils]: 2: Hoare triple {1058#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < ~N~0);assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~x~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {1058#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:26:01,628 INFO L290 TraceCheckUtils]: 3: Hoare triple {1058#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !(0 != main_~x~0#1);call write~int(main_~j~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~j~0#1 := main_~j~0#1 + main_~i~0#1; {1058#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:26:01,628 INFO L290 TraceCheckUtils]: 4: Hoare triple {1058#(<= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {1048#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 14:26:01,629 INFO L290 TraceCheckUtils]: 5: Hoare triple {1048#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !!(main_~i~0#1 < ~N~0);assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~x~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {1048#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 14:26:01,629 INFO L290 TraceCheckUtils]: 6: Hoare triple {1048#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !(0 != main_~x~0#1);call write~int(main_~j~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~j~0#1 := main_~j~0#1 + main_~i~0#1; {1048#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 14:26:01,630 INFO L290 TraceCheckUtils]: 7: Hoare triple {1048#(<= |ULTIMATE.start_main_~i~0#1| 1)} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {1049#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-20 14:26:01,630 INFO L290 TraceCheckUtils]: 8: Hoare triple {1049#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !!(main_~i~0#1 < ~N~0);assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~x~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {1049#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-20 14:26:01,630 INFO L290 TraceCheckUtils]: 9: Hoare triple {1049#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume 0 != main_~x~0#1; {1049#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-20 14:26:01,631 INFO L290 TraceCheckUtils]: 10: Hoare triple {1049#(<= |ULTIMATE.start_main_~i~0#1| 2)} main_~k~0#1 := 1; {1086#(and (<= |ULTIMATE.start_main_~i~0#1| 2) (<= 1 |ULTIMATE.start_main_~k~0#1|))} is VALID [2022-02-20 14:26:01,631 INFO L290 TraceCheckUtils]: 11: Hoare triple {1086#(and (<= |ULTIMATE.start_main_~i~0#1| 2) (<= 1 |ULTIMATE.start_main_~k~0#1|))} assume !!(main_~k~0#1 < main_~i~0#1);call main_#t~mem7#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~k~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem7#1 >= 0 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {1086#(and (<= |ULTIMATE.start_main_~i~0#1| 2) (<= 1 |ULTIMATE.start_main_~k~0#1|))} is VALID [2022-02-20 14:26:01,632 INFO L290 TraceCheckUtils]: 12: Hoare triple {1086#(and (<= |ULTIMATE.start_main_~i~0#1| 2) (<= 1 |ULTIMATE.start_main_~k~0#1|))} assume !(0 == __VERIFIER_assert_~cond#1); {1086#(and (<= |ULTIMATE.start_main_~i~0#1| 2) (<= 1 |ULTIMATE.start_main_~k~0#1|))} is VALID [2022-02-20 14:26:01,632 INFO L290 TraceCheckUtils]: 13: Hoare triple {1086#(and (<= |ULTIMATE.start_main_~i~0#1| 2) (<= 1 |ULTIMATE.start_main_~k~0#1|))} assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem7#1; {1086#(and (<= |ULTIMATE.start_main_~i~0#1| 2) (<= 1 |ULTIMATE.start_main_~k~0#1|))} is VALID [2022-02-20 14:26:01,632 INFO L290 TraceCheckUtils]: 14: Hoare triple {1086#(and (<= |ULTIMATE.start_main_~i~0#1| 2) (<= 1 |ULTIMATE.start_main_~k~0#1|))} main_#t~post6#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {1099#(and (<= 2 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 2))} is VALID [2022-02-20 14:26:01,634 INFO L290 TraceCheckUtils]: 15: Hoare triple {1099#(and (<= 2 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 2))} assume !!(main_~k~0#1 < main_~i~0#1);call main_#t~mem7#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~k~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem7#1 >= 0 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {1046#false} is VALID [2022-02-20 14:26:01,634 INFO L290 TraceCheckUtils]: 16: Hoare triple {1046#false} assume 0 == __VERIFIER_assert_~cond#1; {1046#false} is VALID [2022-02-20 14:26:01,634 INFO L290 TraceCheckUtils]: 17: Hoare triple {1046#false} assume !false; {1046#false} is VALID [2022-02-20 14:26:01,634 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 14:26:01,635 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 14:26:01,718 INFO L290 TraceCheckUtils]: 17: Hoare triple {1046#false} assume !false; {1046#false} is VALID [2022-02-20 14:26:01,718 INFO L290 TraceCheckUtils]: 16: Hoare triple {1046#false} assume 0 == __VERIFIER_assert_~cond#1; {1046#false} is VALID [2022-02-20 14:26:01,719 INFO L290 TraceCheckUtils]: 15: Hoare triple {1051#(<= |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~k~0#1|)} assume !!(main_~k~0#1 < main_~i~0#1);call main_#t~mem7#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~k~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem7#1 >= 0 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {1046#false} is VALID [2022-02-20 14:26:01,719 INFO L290 TraceCheckUtils]: 14: Hoare triple {1118#(<= |ULTIMATE.start_main_~i~0#1| (+ |ULTIMATE.start_main_~k~0#1| 1))} main_#t~post6#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {1051#(<= |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~k~0#1|)} is VALID [2022-02-20 14:26:01,720 INFO L290 TraceCheckUtils]: 13: Hoare triple {1118#(<= |ULTIMATE.start_main_~i~0#1| (+ |ULTIMATE.start_main_~k~0#1| 1))} assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem7#1; {1118#(<= |ULTIMATE.start_main_~i~0#1| (+ |ULTIMATE.start_main_~k~0#1| 1))} is VALID [2022-02-20 14:26:01,720 INFO L290 TraceCheckUtils]: 12: Hoare triple {1118#(<= |ULTIMATE.start_main_~i~0#1| (+ |ULTIMATE.start_main_~k~0#1| 1))} assume !(0 == __VERIFIER_assert_~cond#1); {1118#(<= |ULTIMATE.start_main_~i~0#1| (+ |ULTIMATE.start_main_~k~0#1| 1))} is VALID [2022-02-20 14:26:01,721 INFO L290 TraceCheckUtils]: 11: Hoare triple {1118#(<= |ULTIMATE.start_main_~i~0#1| (+ |ULTIMATE.start_main_~k~0#1| 1))} assume !!(main_~k~0#1 < main_~i~0#1);call main_#t~mem7#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~k~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem7#1 >= 0 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {1118#(<= |ULTIMATE.start_main_~i~0#1| (+ |ULTIMATE.start_main_~k~0#1| 1))} is VALID [2022-02-20 14:26:01,721 INFO L290 TraceCheckUtils]: 10: Hoare triple {1049#(<= |ULTIMATE.start_main_~i~0#1| 2)} main_~k~0#1 := 1; {1118#(<= |ULTIMATE.start_main_~i~0#1| (+ |ULTIMATE.start_main_~k~0#1| 1))} is VALID [2022-02-20 14:26:01,721 INFO L290 TraceCheckUtils]: 9: Hoare triple {1049#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume 0 != main_~x~0#1; {1049#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-20 14:26:01,721 INFO L290 TraceCheckUtils]: 8: Hoare triple {1049#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !!(main_~i~0#1 < ~N~0);assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~x~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {1049#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-20 14:26:01,722 INFO L290 TraceCheckUtils]: 7: Hoare triple {1048#(<= |ULTIMATE.start_main_~i~0#1| 1)} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {1049#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-20 14:26:01,723 INFO L290 TraceCheckUtils]: 6: Hoare triple {1048#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !(0 != main_~x~0#1);call write~int(main_~j~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~j~0#1 := main_~j~0#1 + main_~i~0#1; {1048#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 14:26:01,723 INFO L290 TraceCheckUtils]: 5: Hoare triple {1048#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !!(main_~i~0#1 < ~N~0);assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~x~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {1048#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 14:26:01,723 INFO L290 TraceCheckUtils]: 4: Hoare triple {1058#(<= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {1048#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 14:26:01,724 INFO L290 TraceCheckUtils]: 3: Hoare triple {1058#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !(0 != main_~x~0#1);call write~int(main_~j~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~j~0#1 := main_~j~0#1 + main_~i~0#1; {1058#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:26:01,724 INFO L290 TraceCheckUtils]: 2: Hoare triple {1058#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < ~N~0);assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~x~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {1058#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:26:01,725 INFO L290 TraceCheckUtils]: 1: Hoare triple {1045#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~post4#1, main_~x~0#1, main_#t~mem7#1, main_#t~post6#1, main_~k~0#1, main_~i~0#1, main_~j~0#1, main_~#a~0#1.base, main_~#a~0#1.offset;havoc main_~i~0#1;main_~j~0#1 := 0;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4 * ~N~0);main_~i~0#1 := 0; {1058#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:26:01,725 INFO L290 TraceCheckUtils]: 0: Hoare triple {1045#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2);call #Ultimate.allocInit(12, 3);~N~0 := 100000; {1045#true} is VALID [2022-02-20 14:26:01,725 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 14:26:01,725 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2034076115] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 14:26:01,725 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 14:26:01,725 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2022-02-20 14:26:01,725 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168480150] [2022-02-20 14:26:01,725 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 14:26:01,726 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.0) internal successors, (33), 11 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-02-20 14:26:01,726 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:26:01,726 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 3.0) internal successors, (33), 11 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:26:01,769 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:26:01,770 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-02-20 14:26:01,770 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:26:01,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-02-20 14:26:01,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-02-20 14:26:01,770 INFO L87 Difference]: Start difference. First operand 26 states and 30 transitions. Second operand has 11 states, 11 states have (on average 3.0) internal successors, (33), 11 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:26:01,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:26:01,866 INFO L93 Difference]: Finished difference Result 38 states and 42 transitions. [2022-02-20 14:26:01,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 14:26:01,866 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.0) internal successors, (33), 11 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-02-20 14:26:01,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:26:01,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 3.0) internal successors, (33), 11 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:26:01,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 36 transitions. [2022-02-20 14:26:01,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 3.0) internal successors, (33), 11 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:26:01,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 36 transitions. [2022-02-20 14:26:01,867 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 36 transitions. [2022-02-20 14:26:01,890 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:26:01,891 INFO L225 Difference]: With dead ends: 38 [2022-02-20 14:26:01,891 INFO L226 Difference]: Without dead ends: 26 [2022-02-20 14:26:01,891 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-02-20 14:26:01,892 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 7 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 14:26:01,892 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 49 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 14:26:01,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-02-20 14:26:01,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2022-02-20 14:26:01,908 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:26:01,908 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand has 26 states, 25 states have (on average 1.16) internal successors, (29), 25 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:26:01,908 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand has 26 states, 25 states have (on average 1.16) internal successors, (29), 25 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:26:01,908 INFO L87 Difference]: Start difference. First operand 26 states. Second operand has 26 states, 25 states have (on average 1.16) internal successors, (29), 25 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:26:01,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:26:01,909 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2022-02-20 14:26:01,909 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2022-02-20 14:26:01,909 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:26:01,909 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:26:01,910 INFO L74 IsIncluded]: Start isIncluded. First operand has 26 states, 25 states have (on average 1.16) internal successors, (29), 25 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 26 states. [2022-02-20 14:26:01,910 INFO L87 Difference]: Start difference. First operand has 26 states, 25 states have (on average 1.16) internal successors, (29), 25 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 26 states. [2022-02-20 14:26:01,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:26:01,910 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2022-02-20 14:26:01,911 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2022-02-20 14:26:01,911 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:26:01,911 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:26:01,911 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:26:01,911 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:26:01,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.16) internal successors, (29), 25 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:26:01,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2022-02-20 14:26:01,912 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 18 [2022-02-20 14:26:01,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:26:01,912 INFO L470 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2022-02-20 14:26:01,912 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.0) internal successors, (33), 11 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:26:01,913 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2022-02-20 14:26:01,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-02-20 14:26:01,913 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:26:01,913 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:26:01,936 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-02-20 14:26:02,127 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:26:02,127 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:26:02,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:26:02,128 INFO L85 PathProgramCache]: Analyzing trace with hash 1429725775, now seen corresponding path program 2 times [2022-02-20 14:26:02,128 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:26:02,128 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657831881] [2022-02-20 14:26:02,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:26:02,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:26:02,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:26:02,206 INFO L290 TraceCheckUtils]: 0: Hoare triple {1293#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2);call #Ultimate.allocInit(12, 3);~N~0 := 100000; {1295#(<= 100000 ~N~0)} is VALID [2022-02-20 14:26:02,207 INFO L290 TraceCheckUtils]: 1: Hoare triple {1295#(<= 100000 ~N~0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~post4#1, main_~x~0#1, main_#t~mem7#1, main_#t~post6#1, main_~k~0#1, main_~i~0#1, main_~j~0#1, main_~#a~0#1.base, main_~#a~0#1.offset;havoc main_~i~0#1;main_~j~0#1 := 0;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4 * ~N~0);main_~i~0#1 := 0; {1296#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 100000 ~N~0))} is VALID [2022-02-20 14:26:02,207 INFO L290 TraceCheckUtils]: 2: Hoare triple {1296#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 100000 ~N~0))} assume !!(main_~i~0#1 < ~N~0);assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~x~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {1296#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 100000 ~N~0))} is VALID [2022-02-20 14:26:02,208 INFO L290 TraceCheckUtils]: 3: Hoare triple {1296#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 100000 ~N~0))} assume !(0 != main_~x~0#1);call write~int(main_~j~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~j~0#1 := main_~j~0#1 + main_~i~0#1; {1296#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 100000 ~N~0))} is VALID [2022-02-20 14:26:02,208 INFO L290 TraceCheckUtils]: 4: Hoare triple {1296#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 100000 ~N~0))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {1297#(<= (+ 99999 |ULTIMATE.start_main_~i~0#1|) ~N~0)} is VALID [2022-02-20 14:26:02,212 INFO L290 TraceCheckUtils]: 5: Hoare triple {1297#(<= (+ 99999 |ULTIMATE.start_main_~i~0#1|) ~N~0)} assume !!(main_~i~0#1 < ~N~0);assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~x~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {1297#(<= (+ 99999 |ULTIMATE.start_main_~i~0#1|) ~N~0)} is VALID [2022-02-20 14:26:02,213 INFO L290 TraceCheckUtils]: 6: Hoare triple {1297#(<= (+ 99999 |ULTIMATE.start_main_~i~0#1|) ~N~0)} assume !(0 != main_~x~0#1);call write~int(main_~j~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~j~0#1 := main_~j~0#1 + main_~i~0#1; {1297#(<= (+ 99999 |ULTIMATE.start_main_~i~0#1|) ~N~0)} is VALID [2022-02-20 14:26:02,213 INFO L290 TraceCheckUtils]: 7: Hoare triple {1297#(<= (+ 99999 |ULTIMATE.start_main_~i~0#1|) ~N~0)} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {1298#(<= (+ 99998 |ULTIMATE.start_main_~i~0#1|) ~N~0)} is VALID [2022-02-20 14:26:02,214 INFO L290 TraceCheckUtils]: 8: Hoare triple {1298#(<= (+ 99998 |ULTIMATE.start_main_~i~0#1|) ~N~0)} assume !!(main_~i~0#1 < ~N~0);assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~x~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {1298#(<= (+ 99998 |ULTIMATE.start_main_~i~0#1|) ~N~0)} is VALID [2022-02-20 14:26:02,214 INFO L290 TraceCheckUtils]: 9: Hoare triple {1298#(<= (+ 99998 |ULTIMATE.start_main_~i~0#1|) ~N~0)} assume !(0 != main_~x~0#1);call write~int(main_~j~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~j~0#1 := main_~j~0#1 + main_~i~0#1; {1298#(<= (+ 99998 |ULTIMATE.start_main_~i~0#1|) ~N~0)} is VALID [2022-02-20 14:26:02,214 INFO L290 TraceCheckUtils]: 10: Hoare triple {1298#(<= (+ 99998 |ULTIMATE.start_main_~i~0#1|) ~N~0)} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {1299#(<= (+ |ULTIMATE.start_main_~i~0#1| 99997) ~N~0)} is VALID [2022-02-20 14:26:02,215 INFO L290 TraceCheckUtils]: 11: Hoare triple {1299#(<= (+ |ULTIMATE.start_main_~i~0#1| 99997) ~N~0)} assume !!(main_~i~0#1 < ~N~0);assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~x~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {1299#(<= (+ |ULTIMATE.start_main_~i~0#1| 99997) ~N~0)} is VALID [2022-02-20 14:26:02,215 INFO L290 TraceCheckUtils]: 12: Hoare triple {1299#(<= (+ |ULTIMATE.start_main_~i~0#1| 99997) ~N~0)} assume !(0 != main_~x~0#1);call write~int(main_~j~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~j~0#1 := main_~j~0#1 + main_~i~0#1; {1299#(<= (+ |ULTIMATE.start_main_~i~0#1| 99997) ~N~0)} is VALID [2022-02-20 14:26:02,216 INFO L290 TraceCheckUtils]: 13: Hoare triple {1299#(<= (+ |ULTIMATE.start_main_~i~0#1| 99997) ~N~0)} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {1300#(<= (+ |ULTIMATE.start_main_~i~0#1| 99996) ~N~0)} is VALID [2022-02-20 14:26:02,216 INFO L290 TraceCheckUtils]: 14: Hoare triple {1300#(<= (+ |ULTIMATE.start_main_~i~0#1| 99996) ~N~0)} assume !(main_~i~0#1 < ~N~0); {1294#false} is VALID [2022-02-20 14:26:02,216 INFO L290 TraceCheckUtils]: 15: Hoare triple {1294#false} main_~k~0#1 := 1; {1294#false} is VALID [2022-02-20 14:26:02,216 INFO L290 TraceCheckUtils]: 16: Hoare triple {1294#false} assume !!(main_~k~0#1 < main_~i~0#1);call main_#t~mem7#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~k~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem7#1 >= 0 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {1294#false} is VALID [2022-02-20 14:26:02,216 INFO L290 TraceCheckUtils]: 17: Hoare triple {1294#false} assume 0 == __VERIFIER_assert_~cond#1; {1294#false} is VALID [2022-02-20 14:26:02,217 INFO L290 TraceCheckUtils]: 18: Hoare triple {1294#false} assume !false; {1294#false} is VALID [2022-02-20 14:26:02,223 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 14:26:02,223 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:26:02,224 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657831881] [2022-02-20 14:26:02,224 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [657831881] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 14:26:02,224 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [234191556] [2022-02-20 14:26:02,224 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-20 14:26:02,224 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:26:02,224 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:26:02,225 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-02-20 14:26:02,226 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-02-20 14:26:02,271 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-20 14:26:02,271 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 14:26:02,272 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-20 14:26:02,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:26:02,285 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:26:02,457 INFO L290 TraceCheckUtils]: 0: Hoare triple {1293#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2);call #Ultimate.allocInit(12, 3);~N~0 := 100000; {1295#(<= 100000 ~N~0)} is VALID [2022-02-20 14:26:02,458 INFO L290 TraceCheckUtils]: 1: Hoare triple {1295#(<= 100000 ~N~0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~post4#1, main_~x~0#1, main_#t~mem7#1, main_#t~post6#1, main_~k~0#1, main_~i~0#1, main_~j~0#1, main_~#a~0#1.base, main_~#a~0#1.offset;havoc main_~i~0#1;main_~j~0#1 := 0;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4 * ~N~0);main_~i~0#1 := 0; {1307#(and (<= |ULTIMATE.start_main_~i~0#1| 0) (<= 100000 ~N~0))} is VALID [2022-02-20 14:26:02,458 INFO L290 TraceCheckUtils]: 2: Hoare triple {1307#(and (<= |ULTIMATE.start_main_~i~0#1| 0) (<= 100000 ~N~0))} assume !!(main_~i~0#1 < ~N~0);assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~x~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {1307#(and (<= |ULTIMATE.start_main_~i~0#1| 0) (<= 100000 ~N~0))} is VALID [2022-02-20 14:26:02,459 INFO L290 TraceCheckUtils]: 3: Hoare triple {1307#(and (<= |ULTIMATE.start_main_~i~0#1| 0) (<= 100000 ~N~0))} assume !(0 != main_~x~0#1);call write~int(main_~j~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~j~0#1 := main_~j~0#1 + main_~i~0#1; {1307#(and (<= |ULTIMATE.start_main_~i~0#1| 0) (<= 100000 ~N~0))} is VALID [2022-02-20 14:26:02,459 INFO L290 TraceCheckUtils]: 4: Hoare triple {1307#(and (<= |ULTIMATE.start_main_~i~0#1| 0) (<= 100000 ~N~0))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {1317#(and (<= 100000 ~N~0) (<= |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-20 14:26:02,459 INFO L290 TraceCheckUtils]: 5: Hoare triple {1317#(and (<= 100000 ~N~0) (<= |ULTIMATE.start_main_~i~0#1| 1))} assume !!(main_~i~0#1 < ~N~0);assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~x~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {1317#(and (<= 100000 ~N~0) (<= |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-20 14:26:02,460 INFO L290 TraceCheckUtils]: 6: Hoare triple {1317#(and (<= 100000 ~N~0) (<= |ULTIMATE.start_main_~i~0#1| 1))} assume !(0 != main_~x~0#1);call write~int(main_~j~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~j~0#1 := main_~j~0#1 + main_~i~0#1; {1317#(and (<= 100000 ~N~0) (<= |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-20 14:26:02,460 INFO L290 TraceCheckUtils]: 7: Hoare triple {1317#(and (<= 100000 ~N~0) (<= |ULTIMATE.start_main_~i~0#1| 1))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {1327#(and (<= |ULTIMATE.start_main_~i~0#1| 2) (<= 100000 ~N~0))} is VALID [2022-02-20 14:26:02,461 INFO L290 TraceCheckUtils]: 8: Hoare triple {1327#(and (<= |ULTIMATE.start_main_~i~0#1| 2) (<= 100000 ~N~0))} assume !!(main_~i~0#1 < ~N~0);assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~x~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {1327#(and (<= |ULTIMATE.start_main_~i~0#1| 2) (<= 100000 ~N~0))} is VALID [2022-02-20 14:26:02,461 INFO L290 TraceCheckUtils]: 9: Hoare triple {1327#(and (<= |ULTIMATE.start_main_~i~0#1| 2) (<= 100000 ~N~0))} assume !(0 != main_~x~0#1);call write~int(main_~j~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~j~0#1 := main_~j~0#1 + main_~i~0#1; {1327#(and (<= |ULTIMATE.start_main_~i~0#1| 2) (<= 100000 ~N~0))} is VALID [2022-02-20 14:26:02,462 INFO L290 TraceCheckUtils]: 10: Hoare triple {1327#(and (<= |ULTIMATE.start_main_~i~0#1| 2) (<= 100000 ~N~0))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {1337#(and (<= |ULTIMATE.start_main_~i~0#1| 3) (<= 100000 ~N~0))} is VALID [2022-02-20 14:26:02,462 INFO L290 TraceCheckUtils]: 11: Hoare triple {1337#(and (<= |ULTIMATE.start_main_~i~0#1| 3) (<= 100000 ~N~0))} assume !!(main_~i~0#1 < ~N~0);assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~x~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {1337#(and (<= |ULTIMATE.start_main_~i~0#1| 3) (<= 100000 ~N~0))} is VALID [2022-02-20 14:26:02,462 INFO L290 TraceCheckUtils]: 12: Hoare triple {1337#(and (<= |ULTIMATE.start_main_~i~0#1| 3) (<= 100000 ~N~0))} assume !(0 != main_~x~0#1);call write~int(main_~j~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~j~0#1 := main_~j~0#1 + main_~i~0#1; {1337#(and (<= |ULTIMATE.start_main_~i~0#1| 3) (<= 100000 ~N~0))} is VALID [2022-02-20 14:26:02,463 INFO L290 TraceCheckUtils]: 13: Hoare triple {1337#(and (<= |ULTIMATE.start_main_~i~0#1| 3) (<= 100000 ~N~0))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {1347#(and (<= |ULTIMATE.start_main_~i~0#1| 4) (<= 100000 ~N~0))} is VALID [2022-02-20 14:26:02,463 INFO L290 TraceCheckUtils]: 14: Hoare triple {1347#(and (<= |ULTIMATE.start_main_~i~0#1| 4) (<= 100000 ~N~0))} assume !(main_~i~0#1 < ~N~0); {1294#false} is VALID [2022-02-20 14:26:02,463 INFO L290 TraceCheckUtils]: 15: Hoare triple {1294#false} main_~k~0#1 := 1; {1294#false} is VALID [2022-02-20 14:26:02,463 INFO L290 TraceCheckUtils]: 16: Hoare triple {1294#false} assume !!(main_~k~0#1 < main_~i~0#1);call main_#t~mem7#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~k~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem7#1 >= 0 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {1294#false} is VALID [2022-02-20 14:26:02,463 INFO L290 TraceCheckUtils]: 17: Hoare triple {1294#false} assume 0 == __VERIFIER_assert_~cond#1; {1294#false} is VALID [2022-02-20 14:26:02,464 INFO L290 TraceCheckUtils]: 18: Hoare triple {1294#false} assume !false; {1294#false} is VALID [2022-02-20 14:26:02,464 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 14:26:02,464 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 14:26:02,587 INFO L290 TraceCheckUtils]: 18: Hoare triple {1294#false} assume !false; {1294#false} is VALID [2022-02-20 14:26:02,588 INFO L290 TraceCheckUtils]: 17: Hoare triple {1294#false} assume 0 == __VERIFIER_assert_~cond#1; {1294#false} is VALID [2022-02-20 14:26:02,588 INFO L290 TraceCheckUtils]: 16: Hoare triple {1294#false} assume !!(main_~k~0#1 < main_~i~0#1);call main_#t~mem7#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~k~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem7#1 >= 0 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {1294#false} is VALID [2022-02-20 14:26:02,588 INFO L290 TraceCheckUtils]: 15: Hoare triple {1294#false} main_~k~0#1 := 1; {1294#false} is VALID [2022-02-20 14:26:02,594 INFO L290 TraceCheckUtils]: 14: Hoare triple {1375#(< |ULTIMATE.start_main_~i~0#1| ~N~0)} assume !(main_~i~0#1 < ~N~0); {1294#false} is VALID [2022-02-20 14:26:02,595 INFO L290 TraceCheckUtils]: 13: Hoare triple {1379#(< (+ |ULTIMATE.start_main_~i~0#1| 1) ~N~0)} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {1375#(< |ULTIMATE.start_main_~i~0#1| ~N~0)} is VALID [2022-02-20 14:26:02,596 INFO L290 TraceCheckUtils]: 12: Hoare triple {1379#(< (+ |ULTIMATE.start_main_~i~0#1| 1) ~N~0)} assume !(0 != main_~x~0#1);call write~int(main_~j~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~j~0#1 := main_~j~0#1 + main_~i~0#1; {1379#(< (+ |ULTIMATE.start_main_~i~0#1| 1) ~N~0)} is VALID [2022-02-20 14:26:02,597 INFO L290 TraceCheckUtils]: 11: Hoare triple {1379#(< (+ |ULTIMATE.start_main_~i~0#1| 1) ~N~0)} assume !!(main_~i~0#1 < ~N~0);assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~x~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {1379#(< (+ |ULTIMATE.start_main_~i~0#1| 1) ~N~0)} is VALID [2022-02-20 14:26:02,599 INFO L290 TraceCheckUtils]: 10: Hoare triple {1389#(< (+ 2 |ULTIMATE.start_main_~i~0#1|) ~N~0)} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {1379#(< (+ |ULTIMATE.start_main_~i~0#1| 1) ~N~0)} is VALID [2022-02-20 14:26:02,600 INFO L290 TraceCheckUtils]: 9: Hoare triple {1389#(< (+ 2 |ULTIMATE.start_main_~i~0#1|) ~N~0)} assume !(0 != main_~x~0#1);call write~int(main_~j~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~j~0#1 := main_~j~0#1 + main_~i~0#1; {1389#(< (+ 2 |ULTIMATE.start_main_~i~0#1|) ~N~0)} is VALID [2022-02-20 14:26:02,600 INFO L290 TraceCheckUtils]: 8: Hoare triple {1389#(< (+ 2 |ULTIMATE.start_main_~i~0#1|) ~N~0)} assume !!(main_~i~0#1 < ~N~0);assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~x~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {1389#(< (+ 2 |ULTIMATE.start_main_~i~0#1|) ~N~0)} is VALID [2022-02-20 14:26:02,601 INFO L290 TraceCheckUtils]: 7: Hoare triple {1399#(< (+ 3 |ULTIMATE.start_main_~i~0#1|) ~N~0)} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {1389#(< (+ 2 |ULTIMATE.start_main_~i~0#1|) ~N~0)} is VALID [2022-02-20 14:26:02,601 INFO L290 TraceCheckUtils]: 6: Hoare triple {1399#(< (+ 3 |ULTIMATE.start_main_~i~0#1|) ~N~0)} assume !(0 != main_~x~0#1);call write~int(main_~j~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~j~0#1 := main_~j~0#1 + main_~i~0#1; {1399#(< (+ 3 |ULTIMATE.start_main_~i~0#1|) ~N~0)} is VALID [2022-02-20 14:26:02,602 INFO L290 TraceCheckUtils]: 5: Hoare triple {1399#(< (+ 3 |ULTIMATE.start_main_~i~0#1|) ~N~0)} assume !!(main_~i~0#1 < ~N~0);assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~x~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {1399#(< (+ 3 |ULTIMATE.start_main_~i~0#1|) ~N~0)} is VALID [2022-02-20 14:26:02,603 INFO L290 TraceCheckUtils]: 4: Hoare triple {1409#(< (+ |ULTIMATE.start_main_~i~0#1| 4) ~N~0)} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {1399#(< (+ 3 |ULTIMATE.start_main_~i~0#1|) ~N~0)} is VALID [2022-02-20 14:26:02,603 INFO L290 TraceCheckUtils]: 3: Hoare triple {1409#(< (+ |ULTIMATE.start_main_~i~0#1| 4) ~N~0)} assume !(0 != main_~x~0#1);call write~int(main_~j~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~j~0#1 := main_~j~0#1 + main_~i~0#1; {1409#(< (+ |ULTIMATE.start_main_~i~0#1| 4) ~N~0)} is VALID [2022-02-20 14:26:02,603 INFO L290 TraceCheckUtils]: 2: Hoare triple {1409#(< (+ |ULTIMATE.start_main_~i~0#1| 4) ~N~0)} assume !!(main_~i~0#1 < ~N~0);assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~x~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {1409#(< (+ |ULTIMATE.start_main_~i~0#1| 4) ~N~0)} is VALID [2022-02-20 14:26:02,604 INFO L290 TraceCheckUtils]: 1: Hoare triple {1419#(< 4 ~N~0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~post4#1, main_~x~0#1, main_#t~mem7#1, main_#t~post6#1, main_~k~0#1, main_~i~0#1, main_~j~0#1, main_~#a~0#1.base, main_~#a~0#1.offset;havoc main_~i~0#1;main_~j~0#1 := 0;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4 * ~N~0);main_~i~0#1 := 0; {1409#(< (+ |ULTIMATE.start_main_~i~0#1| 4) ~N~0)} is VALID [2022-02-20 14:26:02,607 INFO L290 TraceCheckUtils]: 0: Hoare triple {1293#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2);call #Ultimate.allocInit(12, 3);~N~0 := 100000; {1419#(< 4 ~N~0)} is VALID [2022-02-20 14:26:02,608 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 14:26:02,608 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [234191556] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 14:26:02,608 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 14:26:02,608 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 18 [2022-02-20 14:26:02,608 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881478712] [2022-02-20 14:26:02,608 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 14:26:02,608 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.526315789473684) internal successors, (48), 18 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-02-20 14:26:02,609 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:26:02,609 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 19 states, 19 states have (on average 2.526315789473684) internal successors, (48), 18 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:26:02,641 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:26:02,641 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-02-20 14:26:02,641 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:26:02,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-02-20 14:26:02,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=195, Unknown=0, NotChecked=0, Total=342 [2022-02-20 14:26:02,642 INFO L87 Difference]: Start difference. First operand 26 states and 29 transitions. Second operand has 19 states, 19 states have (on average 2.526315789473684) internal successors, (48), 18 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:26:02,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:26:02,995 INFO L93 Difference]: Finished difference Result 98 states and 112 transitions. [2022-02-20 14:26:02,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-02-20 14:26:02,995 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.526315789473684) internal successors, (48), 18 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-02-20 14:26:02,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:26:02,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 2.526315789473684) internal successors, (48), 18 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:26:02,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 110 transitions. [2022-02-20 14:26:02,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 2.526315789473684) internal successors, (48), 18 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:26:02,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 110 transitions. [2022-02-20 14:26:02,998 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 110 transitions. [2022-02-20 14:26:03,075 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 110 edges. 110 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:26:03,076 INFO L225 Difference]: With dead ends: 98 [2022-02-20 14:26:03,076 INFO L226 Difference]: Without dead ends: 91 [2022-02-20 14:26:03,076 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=222, Invalid=330, Unknown=0, NotChecked=0, Total=552 [2022-02-20 14:26:03,077 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 349 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 349 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 14:26:03,077 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [349 Valid, 86 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 14:26:03,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2022-02-20 14:26:03,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 43. [2022-02-20 14:26:03,102 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:26:03,102 INFO L82 GeneralOperation]: Start isEquivalent. First operand 91 states. Second operand has 43 states, 42 states have (on average 1.2142857142857142) internal successors, (51), 42 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:26:03,102 INFO L74 IsIncluded]: Start isIncluded. First operand 91 states. Second operand has 43 states, 42 states have (on average 1.2142857142857142) internal successors, (51), 42 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:26:03,102 INFO L87 Difference]: Start difference. First operand 91 states. Second operand has 43 states, 42 states have (on average 1.2142857142857142) internal successors, (51), 42 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:26:03,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:26:03,104 INFO L93 Difference]: Finished difference Result 91 states and 99 transitions. [2022-02-20 14:26:03,104 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 99 transitions. [2022-02-20 14:26:03,104 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:26:03,104 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:26:03,105 INFO L74 IsIncluded]: Start isIncluded. First operand has 43 states, 42 states have (on average 1.2142857142857142) internal successors, (51), 42 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 91 states. [2022-02-20 14:26:03,105 INFO L87 Difference]: Start difference. First operand has 43 states, 42 states have (on average 1.2142857142857142) internal successors, (51), 42 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 91 states. [2022-02-20 14:26:03,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:26:03,107 INFO L93 Difference]: Finished difference Result 91 states and 99 transitions. [2022-02-20 14:26:03,107 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 99 transitions. [2022-02-20 14:26:03,107 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:26:03,107 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:26:03,107 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:26:03,107 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:26:03,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 42 states have (on average 1.2142857142857142) internal successors, (51), 42 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:26:03,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 51 transitions. [2022-02-20 14:26:03,108 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 51 transitions. Word has length 19 [2022-02-20 14:26:03,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:26:03,109 INFO L470 AbstractCegarLoop]: Abstraction has 43 states and 51 transitions. [2022-02-20 14:26:03,109 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.526315789473684) internal successors, (48), 18 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:26:03,109 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 51 transitions. [2022-02-20 14:26:03,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-02-20 14:26:03,109 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:26:03,109 INFO L514 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:26:03,128 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-02-20 14:26:03,323 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:26:03,323 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:26:03,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:26:03,324 INFO L85 PathProgramCache]: Analyzing trace with hash 1421454960, now seen corresponding path program 3 times [2022-02-20 14:26:03,324 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:26:03,324 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564770527] [2022-02-20 14:26:03,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:26:03,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:26:03,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:26:03,471 INFO L290 TraceCheckUtils]: 0: Hoare triple {1789#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2);call #Ultimate.allocInit(12, 3);~N~0 := 100000; {1789#true} is VALID [2022-02-20 14:26:03,472 INFO L290 TraceCheckUtils]: 1: Hoare triple {1789#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~post4#1, main_~x~0#1, main_#t~mem7#1, main_#t~post6#1, main_~k~0#1, main_~i~0#1, main_~j~0#1, main_~#a~0#1.base, main_~#a~0#1.offset;havoc main_~i~0#1;main_~j~0#1 := 0;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4 * ~N~0);main_~i~0#1 := 0; {1791#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-20 14:26:03,472 INFO L290 TraceCheckUtils]: 2: Hoare triple {1791#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~j~0#1| 0))} assume !!(main_~i~0#1 < ~N~0);assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~x~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {1791#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-20 14:26:03,473 INFO L290 TraceCheckUtils]: 3: Hoare triple {1791#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~j~0#1| 0))} assume !(0 != main_~x~0#1);call write~int(main_~j~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~j~0#1 := main_~j~0#1 + main_~i~0#1; {1792#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~j~0#1|))} is VALID [2022-02-20 14:26:03,473 INFO L290 TraceCheckUtils]: 4: Hoare triple {1792#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~j~0#1|))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {1793#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= 0 |ULTIMATE.start_main_~j~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-20 14:26:03,474 INFO L290 TraceCheckUtils]: 5: Hoare triple {1793#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= 0 |ULTIMATE.start_main_~j~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 1))} assume !!(main_~i~0#1 < ~N~0);assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~x~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {1793#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= 0 |ULTIMATE.start_main_~j~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-20 14:26:03,474 INFO L290 TraceCheckUtils]: 6: Hoare triple {1793#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= 0 |ULTIMATE.start_main_~j~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 1))} assume !(0 != main_~x~0#1);call write~int(main_~j~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~j~0#1 := main_~j~0#1 + main_~i~0#1; {1794#(and (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-20 14:26:03,475 INFO L290 TraceCheckUtils]: 7: Hoare triple {1794#(and (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 1))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {1795#(and (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 4))) (<= 2 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-20 14:26:03,476 INFO L290 TraceCheckUtils]: 8: Hoare triple {1795#(and (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 4))) (<= 2 |ULTIMATE.start_main_~i~0#1|))} assume !!(main_~i~0#1 < ~N~0);assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~x~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {1795#(and (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 4))) (<= 2 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-20 14:26:03,476 INFO L290 TraceCheckUtils]: 9: Hoare triple {1795#(and (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 4))) (<= 2 |ULTIMATE.start_main_~i~0#1|))} assume !(0 != main_~x~0#1);call write~int(main_~j~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~j~0#1 := main_~j~0#1 + main_~i~0#1; {1795#(and (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 4))) (<= 2 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-20 14:26:03,481 INFO L290 TraceCheckUtils]: 10: Hoare triple {1795#(and (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 4))) (<= 2 |ULTIMATE.start_main_~i~0#1|))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {1796#(and (not (= (+ |ULTIMATE.start_main_~#a~0#1.offset| 4) (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 4))))} is VALID [2022-02-20 14:26:03,482 INFO L290 TraceCheckUtils]: 11: Hoare triple {1796#(and (not (= (+ |ULTIMATE.start_main_~#a~0#1.offset| 4) (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 4))))} assume !!(main_~i~0#1 < ~N~0);assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~x~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {1796#(and (not (= (+ |ULTIMATE.start_main_~#a~0#1.offset| 4) (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 4))))} is VALID [2022-02-20 14:26:03,482 INFO L290 TraceCheckUtils]: 12: Hoare triple {1796#(and (not (= (+ |ULTIMATE.start_main_~#a~0#1.offset| 4) (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 4))))} assume !(0 != main_~x~0#1);call write~int(main_~j~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~j~0#1 := main_~j~0#1 + main_~i~0#1; {1797#(<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 4)))} is VALID [2022-02-20 14:26:03,483 INFO L290 TraceCheckUtils]: 13: Hoare triple {1797#(<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 4)))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {1797#(<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 4)))} is VALID [2022-02-20 14:26:03,483 INFO L290 TraceCheckUtils]: 14: Hoare triple {1797#(<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 4)))} assume !!(main_~i~0#1 < ~N~0);assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~x~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {1797#(<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 4)))} is VALID [2022-02-20 14:26:03,483 INFO L290 TraceCheckUtils]: 15: Hoare triple {1797#(<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 4)))} assume 0 != main_~x~0#1; {1797#(<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 4)))} is VALID [2022-02-20 14:26:03,484 INFO L290 TraceCheckUtils]: 16: Hoare triple {1797#(<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 4)))} main_~k~0#1 := 1; {1798#(and (= (+ (- 1) |ULTIMATE.start_main_~k~0#1|) 0) (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ (* |ULTIMATE.start_main_~k~0#1| 4) |ULTIMATE.start_main_~#a~0#1.offset|))))} is VALID [2022-02-20 14:26:03,484 INFO L290 TraceCheckUtils]: 17: Hoare triple {1798#(and (= (+ (- 1) |ULTIMATE.start_main_~k~0#1|) 0) (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ (* |ULTIMATE.start_main_~k~0#1| 4) |ULTIMATE.start_main_~#a~0#1.offset|))))} assume !!(main_~k~0#1 < main_~i~0#1);call main_#t~mem7#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~k~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem7#1 >= 0 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {1799#(not (= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0))} is VALID [2022-02-20 14:26:03,484 INFO L290 TraceCheckUtils]: 18: Hoare triple {1799#(not (= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0))} assume 0 == __VERIFIER_assert_~cond#1; {1790#false} is VALID [2022-02-20 14:26:03,485 INFO L290 TraceCheckUtils]: 19: Hoare triple {1790#false} assume !false; {1790#false} is VALID [2022-02-20 14:26:03,485 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 14:26:03,485 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:26:03,485 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564770527] [2022-02-20 14:26:03,485 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1564770527] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 14:26:03,485 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1087151992] [2022-02-20 14:26:03,485 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-20 14:26:03,485 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:26:03,485 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:26:03,486 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-02-20 14:26:03,487 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-02-20 14:26:03,529 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-02-20 14:26:03,529 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 14:26:03,530 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 21 conjunts are in the unsatisfiable core [2022-02-20 14:26:03,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:26:03,545 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:26:03,642 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-02-20 14:26:03,771 INFO L356 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-02-20 14:26:03,772 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-02-20 14:26:03,844 INFO L356 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-02-20 14:26:03,844 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-02-20 14:26:04,020 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-02-20 14:26:04,097 INFO L290 TraceCheckUtils]: 0: Hoare triple {1789#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2);call #Ultimate.allocInit(12, 3);~N~0 := 100000; {1789#true} is VALID [2022-02-20 14:26:04,098 INFO L290 TraceCheckUtils]: 1: Hoare triple {1789#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~post4#1, main_~x~0#1, main_#t~mem7#1, main_#t~post6#1, main_~k~0#1, main_~i~0#1, main_~j~0#1, main_~#a~0#1.base, main_~#a~0#1.offset;havoc main_~i~0#1;main_~j~0#1 := 0;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4 * ~N~0);main_~i~0#1 := 0; {1792#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~j~0#1|))} is VALID [2022-02-20 14:26:04,098 INFO L290 TraceCheckUtils]: 2: Hoare triple {1792#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~j~0#1|))} assume !!(main_~i~0#1 < ~N~0);assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~x~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {1792#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~j~0#1|))} is VALID [2022-02-20 14:26:04,099 INFO L290 TraceCheckUtils]: 3: Hoare triple {1792#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~j~0#1|))} assume !(0 != main_~x~0#1);call write~int(main_~j~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~j~0#1 := main_~j~0#1 + main_~i~0#1; {1792#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~j~0#1|))} is VALID [2022-02-20 14:26:04,099 INFO L290 TraceCheckUtils]: 4: Hoare triple {1792#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~j~0#1|))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {1793#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= 0 |ULTIMATE.start_main_~j~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-20 14:26:04,100 INFO L290 TraceCheckUtils]: 5: Hoare triple {1793#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= 0 |ULTIMATE.start_main_~j~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 1))} assume !!(main_~i~0#1 < ~N~0);assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~x~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {1793#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= 0 |ULTIMATE.start_main_~j~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-20 14:26:04,100 INFO L290 TraceCheckUtils]: 6: Hoare triple {1793#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= 0 |ULTIMATE.start_main_~j~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 1))} assume !(0 != main_~x~0#1);call write~int(main_~j~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~j~0#1 := main_~j~0#1 + main_~i~0#1; {1794#(and (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-20 14:26:04,101 INFO L290 TraceCheckUtils]: 7: Hoare triple {1794#(and (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 1))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {1795#(and (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 4))) (<= 2 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-20 14:26:04,101 INFO L290 TraceCheckUtils]: 8: Hoare triple {1795#(and (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 4))) (<= 2 |ULTIMATE.start_main_~i~0#1|))} assume !!(main_~i~0#1 < ~N~0);assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~x~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {1795#(and (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 4))) (<= 2 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-20 14:26:04,102 INFO L290 TraceCheckUtils]: 9: Hoare triple {1795#(and (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 4))) (<= 2 |ULTIMATE.start_main_~i~0#1|))} assume !(0 != main_~x~0#1);call write~int(main_~j~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~j~0#1 := main_~j~0#1 + main_~i~0#1; {1795#(and (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 4))) (<= 2 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-20 14:26:04,103 INFO L290 TraceCheckUtils]: 10: Hoare triple {1795#(and (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 4))) (<= 2 |ULTIMATE.start_main_~i~0#1|))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {1833#(and (<= 3 |ULTIMATE.start_main_~i~0#1|) (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 4))))} is VALID [2022-02-20 14:26:04,103 INFO L290 TraceCheckUtils]: 11: Hoare triple {1833#(and (<= 3 |ULTIMATE.start_main_~i~0#1|) (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 4))))} assume !!(main_~i~0#1 < ~N~0);assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~x~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {1833#(and (<= 3 |ULTIMATE.start_main_~i~0#1|) (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 4))))} is VALID [2022-02-20 14:26:04,104 INFO L290 TraceCheckUtils]: 12: Hoare triple {1833#(and (<= 3 |ULTIMATE.start_main_~i~0#1|) (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 4))))} assume !(0 != main_~x~0#1);call write~int(main_~j~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~j~0#1 := main_~j~0#1 + main_~i~0#1; {1797#(<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 4)))} is VALID [2022-02-20 14:26:04,104 INFO L290 TraceCheckUtils]: 13: Hoare triple {1797#(<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 4)))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {1797#(<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 4)))} is VALID [2022-02-20 14:26:04,104 INFO L290 TraceCheckUtils]: 14: Hoare triple {1797#(<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 4)))} assume !!(main_~i~0#1 < ~N~0);assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~x~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {1797#(<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 4)))} is VALID [2022-02-20 14:26:04,105 INFO L290 TraceCheckUtils]: 15: Hoare triple {1797#(<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 4)))} assume 0 != main_~x~0#1; {1797#(<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 4)))} is VALID [2022-02-20 14:26:04,105 INFO L290 TraceCheckUtils]: 16: Hoare triple {1797#(<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 4)))} main_~k~0#1 := 1; {1798#(and (= (+ (- 1) |ULTIMATE.start_main_~k~0#1|) 0) (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ (* |ULTIMATE.start_main_~k~0#1| 4) |ULTIMATE.start_main_~#a~0#1.offset|))))} is VALID [2022-02-20 14:26:04,106 INFO L290 TraceCheckUtils]: 17: Hoare triple {1798#(and (= (+ (- 1) |ULTIMATE.start_main_~k~0#1|) 0) (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ (* |ULTIMATE.start_main_~k~0#1| 4) |ULTIMATE.start_main_~#a~0#1.offset|))))} assume !!(main_~k~0#1 < main_~i~0#1);call main_#t~mem7#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~k~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem7#1 >= 0 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {1855#(<= 1 |ULTIMATE.start___VERIFIER_assert_~cond#1|)} is VALID [2022-02-20 14:26:04,106 INFO L290 TraceCheckUtils]: 18: Hoare triple {1855#(<= 1 |ULTIMATE.start___VERIFIER_assert_~cond#1|)} assume 0 == __VERIFIER_assert_~cond#1; {1790#false} is VALID [2022-02-20 14:26:04,106 INFO L290 TraceCheckUtils]: 19: Hoare triple {1790#false} assume !false; {1790#false} is VALID [2022-02-20 14:26:04,106 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 14:26:04,106 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 14:26:04,499 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 21 treesize of output 19 [2022-02-20 14:26:04,509 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 37 treesize of output 33 [2022-02-20 14:26:04,649 INFO L290 TraceCheckUtils]: 19: Hoare triple {1790#false} assume !false; {1790#false} is VALID [2022-02-20 14:26:04,650 INFO L290 TraceCheckUtils]: 18: Hoare triple {1855#(<= 1 |ULTIMATE.start___VERIFIER_assert_~cond#1|)} assume 0 == __VERIFIER_assert_~cond#1; {1790#false} is VALID [2022-02-20 14:26:04,650 INFO L290 TraceCheckUtils]: 17: Hoare triple {1868#(<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ (* |ULTIMATE.start_main_~k~0#1| 4) |ULTIMATE.start_main_~#a~0#1.offset|)))} assume !!(main_~k~0#1 < main_~i~0#1);call main_#t~mem7#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~k~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem7#1 >= 0 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {1855#(<= 1 |ULTIMATE.start___VERIFIER_assert_~cond#1|)} is VALID [2022-02-20 14:26:04,651 INFO L290 TraceCheckUtils]: 16: Hoare triple {1797#(<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 4)))} main_~k~0#1 := 1; {1868#(<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ (* |ULTIMATE.start_main_~k~0#1| 4) |ULTIMATE.start_main_~#a~0#1.offset|)))} is VALID [2022-02-20 14:26:04,651 INFO L290 TraceCheckUtils]: 15: Hoare triple {1797#(<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 4)))} assume 0 != main_~x~0#1; {1797#(<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 4)))} is VALID [2022-02-20 14:26:04,654 INFO L290 TraceCheckUtils]: 14: Hoare triple {1797#(<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 4)))} assume !!(main_~i~0#1 < ~N~0);assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~x~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {1797#(<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 4)))} is VALID [2022-02-20 14:26:04,654 INFO L290 TraceCheckUtils]: 13: Hoare triple {1797#(<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 4)))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {1797#(<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 4)))} is VALID [2022-02-20 14:26:04,655 INFO L290 TraceCheckUtils]: 12: Hoare triple {1796#(and (not (= (+ |ULTIMATE.start_main_~#a~0#1.offset| 4) (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 4))))} assume !(0 != main_~x~0#1);call write~int(main_~j~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~j~0#1 := main_~j~0#1 + main_~i~0#1; {1797#(<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 4)))} is VALID [2022-02-20 14:26:04,655 INFO L290 TraceCheckUtils]: 11: Hoare triple {1796#(and (not (= (+ |ULTIMATE.start_main_~#a~0#1.offset| 4) (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 4))))} assume !!(main_~i~0#1 < ~N~0);assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~x~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {1796#(and (not (= (+ |ULTIMATE.start_main_~#a~0#1.offset| 4) (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 4))))} is VALID [2022-02-20 14:26:04,656 INFO L290 TraceCheckUtils]: 10: Hoare triple {1890#(and (not (<= |ULTIMATE.start_main_~i~0#1| 0)) (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 4))))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {1796#(and (not (= (+ |ULTIMATE.start_main_~#a~0#1.offset| 4) (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 4))))} is VALID [2022-02-20 14:26:04,658 INFO L290 TraceCheckUtils]: 9: Hoare triple {1795#(and (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 4))) (<= 2 |ULTIMATE.start_main_~i~0#1|))} assume !(0 != main_~x~0#1);call write~int(main_~j~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~j~0#1 := main_~j~0#1 + main_~i~0#1; {1890#(and (not (<= |ULTIMATE.start_main_~i~0#1| 0)) (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 4))))} is VALID [2022-02-20 14:26:04,658 INFO L290 TraceCheckUtils]: 8: Hoare triple {1795#(and (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 4))) (<= 2 |ULTIMATE.start_main_~i~0#1|))} assume !!(main_~i~0#1 < ~N~0);assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~x~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {1795#(and (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 4))) (<= 2 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-20 14:26:04,659 INFO L290 TraceCheckUtils]: 7: Hoare triple {1890#(and (not (<= |ULTIMATE.start_main_~i~0#1| 0)) (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 4))))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {1795#(and (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 4))) (<= 2 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-20 14:26:04,659 INFO L290 TraceCheckUtils]: 6: Hoare triple {1793#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= 0 |ULTIMATE.start_main_~j~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 1))} assume !(0 != main_~x~0#1);call write~int(main_~j~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~j~0#1 := main_~j~0#1 + main_~i~0#1; {1890#(and (not (<= |ULTIMATE.start_main_~i~0#1| 0)) (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 4))))} is VALID [2022-02-20 14:26:04,660 INFO L290 TraceCheckUtils]: 5: Hoare triple {1793#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= 0 |ULTIMATE.start_main_~j~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 1))} assume !!(main_~i~0#1 < ~N~0);assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~x~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {1793#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= 0 |ULTIMATE.start_main_~j~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-20 14:26:04,660 INFO L290 TraceCheckUtils]: 4: Hoare triple {1792#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~j~0#1|))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {1793#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= 0 |ULTIMATE.start_main_~j~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-20 14:26:04,661 INFO L290 TraceCheckUtils]: 3: Hoare triple {1792#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~j~0#1|))} assume !(0 != main_~x~0#1);call write~int(main_~j~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~j~0#1 := main_~j~0#1 + main_~i~0#1; {1792#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~j~0#1|))} is VALID [2022-02-20 14:26:04,661 INFO L290 TraceCheckUtils]: 2: Hoare triple {1792#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~j~0#1|))} assume !!(main_~i~0#1 < ~N~0);assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~x~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {1792#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~j~0#1|))} is VALID [2022-02-20 14:26:04,661 INFO L290 TraceCheckUtils]: 1: Hoare triple {1789#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~post4#1, main_~x~0#1, main_#t~mem7#1, main_#t~post6#1, main_~k~0#1, main_~i~0#1, main_~j~0#1, main_~#a~0#1.base, main_~#a~0#1.offset;havoc main_~i~0#1;main_~j~0#1 := 0;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4 * ~N~0);main_~i~0#1 := 0; {1792#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~j~0#1|))} is VALID [2022-02-20 14:26:04,662 INFO L290 TraceCheckUtils]: 0: Hoare triple {1789#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2);call #Ultimate.allocInit(12, 3);~N~0 := 100000; {1789#true} is VALID [2022-02-20 14:26:04,662 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-20 14:26:04,662 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1087151992] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 14:26:04,662 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 14:26:04,662 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 15 [2022-02-20 14:26:04,662 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538405979] [2022-02-20 14:26:04,662 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 14:26:04,663 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 20 [2022-02-20 14:26:04,663 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:26:04,663 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 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-02-20 14:26:04,690 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:26:04,690 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-02-20 14:26:04,690 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:26:04,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-02-20 14:26:04,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2022-02-20 14:26:04,691 INFO L87 Difference]: Start difference. First operand 43 states and 51 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-02-20 14:26:05,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:26:05,056 INFO L93 Difference]: Finished difference Result 50 states and 58 transitions. [2022-02-20 14:26:05,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-20 14:26:05,056 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 20 [2022-02-20 14:26:05,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:26:05,056 INFO L82 GeneralOperation]: Start removeUnreachable. 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-02-20 14:26:05,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 30 transitions. [2022-02-20 14:26:05,057 INFO L82 GeneralOperation]: Start removeUnreachable. 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-02-20 14:26:05,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 30 transitions. [2022-02-20 14:26:05,057 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 30 transitions. [2022-02-20 14:26:05,085 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:26:05,086 INFO L225 Difference]: With dead ends: 50 [2022-02-20 14:26:05,086 INFO L226 Difference]: Without dead ends: 48 [2022-02-20 14:26:05,086 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 25 SyntacticMatches, 12 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=291, Unknown=0, NotChecked=0, Total=380 [2022-02-20 14:26:05,087 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 30 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 14:26:05,087 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 52 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 14:26:05,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-02-20 14:26:05,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 42. [2022-02-20 14:26:05,132 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:26:05,132 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand has 42 states, 41 states have (on average 1.2195121951219512) internal successors, (50), 41 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-02-20 14:26:05,132 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand has 42 states, 41 states have (on average 1.2195121951219512) internal successors, (50), 41 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-02-20 14:26:05,132 INFO L87 Difference]: Start difference. First operand 48 states. Second operand has 42 states, 41 states have (on average 1.2195121951219512) internal successors, (50), 41 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-02-20 14:26:05,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:26:05,133 INFO L93 Difference]: Finished difference Result 48 states and 56 transitions. [2022-02-20 14:26:05,133 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 56 transitions. [2022-02-20 14:26:05,133 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:26:05,133 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:26:05,133 INFO L74 IsIncluded]: Start isIncluded. First operand has 42 states, 41 states have (on average 1.2195121951219512) internal successors, (50), 41 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) Second operand 48 states. [2022-02-20 14:26:05,134 INFO L87 Difference]: Start difference. First operand has 42 states, 41 states have (on average 1.2195121951219512) internal successors, (50), 41 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) Second operand 48 states. [2022-02-20 14:26:05,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:26:05,134 INFO L93 Difference]: Finished difference Result 48 states and 56 transitions. [2022-02-20 14:26:05,134 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 56 transitions. [2022-02-20 14:26:05,135 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:26:05,135 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:26:05,135 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:26:05,135 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:26:05,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 41 states have (on average 1.2195121951219512) internal successors, (50), 41 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-02-20 14:26:05,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 50 transitions. [2022-02-20 14:26:05,136 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 50 transitions. Word has length 20 [2022-02-20 14:26:05,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:26:05,136 INFO L470 AbstractCegarLoop]: Abstraction has 42 states and 50 transitions. [2022-02-20 14:26:05,136 INFO L471 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-02-20 14:26:05,136 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 50 transitions. [2022-02-20 14:26:05,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-02-20 14:26:05,136 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:26:05,136 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:26:05,157 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-02-20 14:26:05,353 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:26:05,354 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:26:05,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:26:05,354 INFO L85 PathProgramCache]: Analyzing trace with hash -796542484, now seen corresponding path program 2 times [2022-02-20 14:26:05,354 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:26:05,354 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275488395] [2022-02-20 14:26:05,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:26:05,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:26:05,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:26:05,534 INFO L290 TraceCheckUtils]: 0: Hoare triple {2146#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2);call #Ultimate.allocInit(12, 3);~N~0 := 100000; {2146#true} is VALID [2022-02-20 14:26:05,535 INFO L290 TraceCheckUtils]: 1: Hoare triple {2146#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~post4#1, main_~x~0#1, main_#t~mem7#1, main_#t~post6#1, main_~k~0#1, main_~i~0#1, main_~j~0#1, main_~#a~0#1.base, main_~#a~0#1.offset;havoc main_~i~0#1;main_~j~0#1 := 0;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4 * ~N~0);main_~i~0#1 := 0; {2148#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-20 14:26:05,535 INFO L290 TraceCheckUtils]: 2: Hoare triple {2148#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~j~0#1| 0))} assume !!(main_~i~0#1 < ~N~0);assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~x~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {2148#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-20 14:26:05,535 INFO L290 TraceCheckUtils]: 3: Hoare triple {2148#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~j~0#1| 0))} assume !(0 != main_~x~0#1);call write~int(main_~j~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~j~0#1 := main_~j~0#1 + main_~i~0#1; {2149#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~j~0#1|))} is VALID [2022-02-20 14:26:05,536 INFO L290 TraceCheckUtils]: 4: Hoare triple {2149#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~j~0#1|))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {2150#(and (<= 1 (+ |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~j~0#1|)) (<= |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-20 14:26:05,536 INFO L290 TraceCheckUtils]: 5: Hoare triple {2150#(and (<= 1 (+ |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~j~0#1|)) (<= |ULTIMATE.start_main_~i~0#1| 1))} assume !!(main_~i~0#1 < ~N~0);assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~x~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {2150#(and (<= 1 (+ |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~j~0#1|)) (<= |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-20 14:26:05,537 INFO L290 TraceCheckUtils]: 6: Hoare triple {2150#(and (<= 1 (+ |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~j~0#1|)) (<= |ULTIMATE.start_main_~i~0#1| 1))} assume !(0 != main_~x~0#1);call write~int(main_~j~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~j~0#1 := main_~j~0#1 + main_~i~0#1; {2151#(and (<= 1 |ULTIMATE.start_main_~j~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-20 14:26:05,537 INFO L290 TraceCheckUtils]: 7: Hoare triple {2151#(and (<= 1 |ULTIMATE.start_main_~j~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 1))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {2152#(and (<= |ULTIMATE.start_main_~i~0#1| 2) (<= 1 |ULTIMATE.start_main_~j~0#1|))} is VALID [2022-02-20 14:26:05,538 INFO L290 TraceCheckUtils]: 8: Hoare triple {2152#(and (<= |ULTIMATE.start_main_~i~0#1| 2) (<= 1 |ULTIMATE.start_main_~j~0#1|))} assume !!(main_~i~0#1 < ~N~0);assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~x~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {2152#(and (<= |ULTIMATE.start_main_~i~0#1| 2) (<= 1 |ULTIMATE.start_main_~j~0#1|))} is VALID [2022-02-20 14:26:05,538 INFO L290 TraceCheckUtils]: 9: Hoare triple {2152#(and (<= |ULTIMATE.start_main_~i~0#1| 2) (<= 1 |ULTIMATE.start_main_~j~0#1|))} assume !(0 != main_~x~0#1);call write~int(main_~j~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~j~0#1 := main_~j~0#1 + main_~i~0#1; {2153#(and (<= 1 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (<= |ULTIMATE.start_main_~i~0#1| 2))} is VALID [2022-02-20 14:26:05,539 INFO L290 TraceCheckUtils]: 10: Hoare triple {2153#(and (<= 1 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (<= |ULTIMATE.start_main_~i~0#1| 2))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {2154#(and (<= |ULTIMATE.start_main_~i~0#1| 3) (or (< |ULTIMATE.start_main_~i~0#1| 3) (<= 1 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 8)))))} is VALID [2022-02-20 14:26:05,539 INFO L290 TraceCheckUtils]: 11: Hoare triple {2154#(and (<= |ULTIMATE.start_main_~i~0#1| 3) (or (< |ULTIMATE.start_main_~i~0#1| 3) (<= 1 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 8)))))} assume !!(main_~i~0#1 < ~N~0);assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~x~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {2154#(and (<= |ULTIMATE.start_main_~i~0#1| 3) (or (< |ULTIMATE.start_main_~i~0#1| 3) (<= 1 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 8)))))} is VALID [2022-02-20 14:26:05,540 INFO L290 TraceCheckUtils]: 12: Hoare triple {2154#(and (<= |ULTIMATE.start_main_~i~0#1| 3) (or (< |ULTIMATE.start_main_~i~0#1| 3) (<= 1 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 8)))))} assume 0 != main_~x~0#1; {2154#(and (<= |ULTIMATE.start_main_~i~0#1| 3) (or (< |ULTIMATE.start_main_~i~0#1| 3) (<= 1 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 8)))))} is VALID [2022-02-20 14:26:05,540 INFO L290 TraceCheckUtils]: 13: Hoare triple {2154#(and (<= |ULTIMATE.start_main_~i~0#1| 3) (or (< |ULTIMATE.start_main_~i~0#1| 3) (<= 1 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 8)))))} main_~k~0#1 := 1; {2155#(and (<= |ULTIMATE.start_main_~i~0#1| 3) (or (< |ULTIMATE.start_main_~i~0#1| 3) (<= 1 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 8)))) (= (+ (- 1) |ULTIMATE.start_main_~k~0#1|) 0))} is VALID [2022-02-20 14:26:05,541 INFO L290 TraceCheckUtils]: 14: Hoare triple {2155#(and (<= |ULTIMATE.start_main_~i~0#1| 3) (or (< |ULTIMATE.start_main_~i~0#1| 3) (<= 1 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 8)))) (= (+ (- 1) |ULTIMATE.start_main_~k~0#1|) 0))} assume !!(main_~k~0#1 < main_~i~0#1);call main_#t~mem7#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~k~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem7#1 >= 0 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {2155#(and (<= |ULTIMATE.start_main_~i~0#1| 3) (or (< |ULTIMATE.start_main_~i~0#1| 3) (<= 1 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 8)))) (= (+ (- 1) |ULTIMATE.start_main_~k~0#1|) 0))} is VALID [2022-02-20 14:26:05,541 INFO L290 TraceCheckUtils]: 15: Hoare triple {2155#(and (<= |ULTIMATE.start_main_~i~0#1| 3) (or (< |ULTIMATE.start_main_~i~0#1| 3) (<= 1 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 8)))) (= (+ (- 1) |ULTIMATE.start_main_~k~0#1|) 0))} assume !(0 == __VERIFIER_assert_~cond#1); {2155#(and (<= |ULTIMATE.start_main_~i~0#1| 3) (or (< |ULTIMATE.start_main_~i~0#1| 3) (<= 1 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 8)))) (= (+ (- 1) |ULTIMATE.start_main_~k~0#1|) 0))} is VALID [2022-02-20 14:26:05,542 INFO L290 TraceCheckUtils]: 16: Hoare triple {2155#(and (<= |ULTIMATE.start_main_~i~0#1| 3) (or (< |ULTIMATE.start_main_~i~0#1| 3) (<= 1 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 8)))) (= (+ (- 1) |ULTIMATE.start_main_~k~0#1|) 0))} assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem7#1; {2155#(and (<= |ULTIMATE.start_main_~i~0#1| 3) (or (< |ULTIMATE.start_main_~i~0#1| 3) (<= 1 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 8)))) (= (+ (- 1) |ULTIMATE.start_main_~k~0#1|) 0))} is VALID [2022-02-20 14:26:05,542 INFO L290 TraceCheckUtils]: 17: Hoare triple {2155#(and (<= |ULTIMATE.start_main_~i~0#1| 3) (or (< |ULTIMATE.start_main_~i~0#1| 3) (<= 1 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 8)))) (= (+ (- 1) |ULTIMATE.start_main_~k~0#1|) 0))} main_#t~post6#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {2156#(or (<= |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~k~0#1|) (<= 1 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ (* |ULTIMATE.start_main_~k~0#1| 4) |ULTIMATE.start_main_~#a~0#1.offset|))))} is VALID [2022-02-20 14:26:05,543 INFO L290 TraceCheckUtils]: 18: Hoare triple {2156#(or (<= |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~k~0#1|) (<= 1 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ (* |ULTIMATE.start_main_~k~0#1| 4) |ULTIMATE.start_main_~#a~0#1.offset|))))} assume !!(main_~k~0#1 < main_~i~0#1);call main_#t~mem7#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~k~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem7#1 >= 0 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {2157#(not (= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0))} is VALID [2022-02-20 14:26:05,543 INFO L290 TraceCheckUtils]: 19: Hoare triple {2157#(not (= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0))} assume 0 == __VERIFIER_assert_~cond#1; {2147#false} is VALID [2022-02-20 14:26:05,543 INFO L290 TraceCheckUtils]: 20: Hoare triple {2147#false} assume !false; {2147#false} is VALID [2022-02-20 14:26:05,543 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 14:26:05,544 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:26:05,544 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275488395] [2022-02-20 14:26:05,544 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1275488395] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 14:26:05,544 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2077271452] [2022-02-20 14:26:05,544 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-20 14:26:05,544 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:26:05,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:26:05,545 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-02-20 14:26:05,571 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-02-20 14:26:05,611 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-20 14:26:05,611 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 14:26:05,612 INFO L263 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 19 conjunts are in the unsatisfiable core [2022-02-20 14:26:05,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:26:05,625 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:26:05,784 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-02-20 14:26:06,612 INFO L356 Elim1Store]: treesize reduction 13, result has 18.8 percent of original size [2022-02-20 14:26:06,612 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 10 [2022-02-20 14:26:06,737 INFO L290 TraceCheckUtils]: 0: Hoare triple {2146#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2);call #Ultimate.allocInit(12, 3);~N~0 := 100000; {2146#true} is VALID [2022-02-20 14:26:06,738 INFO L290 TraceCheckUtils]: 1: Hoare triple {2146#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~post4#1, main_~x~0#1, main_#t~mem7#1, main_#t~post6#1, main_~k~0#1, main_~i~0#1, main_~j~0#1, main_~#a~0#1.base, main_~#a~0#1.offset;havoc main_~i~0#1;main_~j~0#1 := 0;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4 * ~N~0);main_~i~0#1 := 0; {2149#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~j~0#1|))} is VALID [2022-02-20 14:26:06,738 INFO L290 TraceCheckUtils]: 2: Hoare triple {2149#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~j~0#1|))} assume !!(main_~i~0#1 < ~N~0);assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~x~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {2149#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~j~0#1|))} is VALID [2022-02-20 14:26:06,739 INFO L290 TraceCheckUtils]: 3: Hoare triple {2149#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~j~0#1|))} assume !(0 != main_~x~0#1);call write~int(main_~j~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~j~0#1 := main_~j~0#1 + main_~i~0#1; {2149#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~j~0#1|))} is VALID [2022-02-20 14:26:06,739 INFO L290 TraceCheckUtils]: 4: Hoare triple {2149#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~j~0#1|))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {2173#(and (= 0 (+ (- 1) |ULTIMATE.start_main_~i~0#1|)) (<= |ULTIMATE.start_main_~i~0#1| (+ |ULTIMATE.start_main_~j~0#1| 1)))} is VALID [2022-02-20 14:26:06,739 INFO L290 TraceCheckUtils]: 5: Hoare triple {2173#(and (= 0 (+ (- 1) |ULTIMATE.start_main_~i~0#1|)) (<= |ULTIMATE.start_main_~i~0#1| (+ |ULTIMATE.start_main_~j~0#1| 1)))} assume !!(main_~i~0#1 < ~N~0);assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~x~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {2173#(and (= 0 (+ (- 1) |ULTIMATE.start_main_~i~0#1|)) (<= |ULTIMATE.start_main_~i~0#1| (+ |ULTIMATE.start_main_~j~0#1| 1)))} is VALID [2022-02-20 14:26:06,740 INFO L290 TraceCheckUtils]: 6: Hoare triple {2173#(and (= 0 (+ (- 1) |ULTIMATE.start_main_~i~0#1|)) (<= |ULTIMATE.start_main_~i~0#1| (+ |ULTIMATE.start_main_~j~0#1| 1)))} assume !(0 != main_~x~0#1);call write~int(main_~j~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~j~0#1 := main_~j~0#1 + main_~i~0#1; {2180#(and (<= (* 2 |ULTIMATE.start_main_~i~0#1|) (+ |ULTIMATE.start_main_~j~0#1| 1)) (= 0 (+ (- 1) |ULTIMATE.start_main_~i~0#1|)))} is VALID [2022-02-20 14:26:06,740 INFO L290 TraceCheckUtils]: 7: Hoare triple {2180#(and (<= (* 2 |ULTIMATE.start_main_~i~0#1|) (+ |ULTIMATE.start_main_~j~0#1| 1)) (= 0 (+ (- 1) |ULTIMATE.start_main_~i~0#1|)))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {2152#(and (<= |ULTIMATE.start_main_~i~0#1| 2) (<= 1 |ULTIMATE.start_main_~j~0#1|))} is VALID [2022-02-20 14:26:06,741 INFO L290 TraceCheckUtils]: 8: Hoare triple {2152#(and (<= |ULTIMATE.start_main_~i~0#1| 2) (<= 1 |ULTIMATE.start_main_~j~0#1|))} assume !!(main_~i~0#1 < ~N~0);assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~x~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {2152#(and (<= |ULTIMATE.start_main_~i~0#1| 2) (<= 1 |ULTIMATE.start_main_~j~0#1|))} is VALID [2022-02-20 14:26:06,741 INFO L290 TraceCheckUtils]: 9: Hoare triple {2152#(and (<= |ULTIMATE.start_main_~i~0#1| 2) (<= 1 |ULTIMATE.start_main_~j~0#1|))} assume !(0 != main_~x~0#1);call write~int(main_~j~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~j~0#1 := main_~j~0#1 + main_~i~0#1; {2153#(and (<= 1 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (<= |ULTIMATE.start_main_~i~0#1| 2))} is VALID [2022-02-20 14:26:06,743 INFO L290 TraceCheckUtils]: 10: Hoare triple {2153#(and (<= 1 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (<= |ULTIMATE.start_main_~i~0#1| 2))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {2193#(exists ((|v_ULTIMATE.start_main_~i~0#1_48| Int)) (and (<= 1 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_48| 4)))) (<= |ULTIMATE.start_main_~i~0#1| (+ |v_ULTIMATE.start_main_~i~0#1_48| 1)) (<= |v_ULTIMATE.start_main_~i~0#1_48| 2)))} is VALID [2022-02-20 14:26:06,744 INFO L290 TraceCheckUtils]: 11: Hoare triple {2193#(exists ((|v_ULTIMATE.start_main_~i~0#1_48| Int)) (and (<= 1 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_48| 4)))) (<= |ULTIMATE.start_main_~i~0#1| (+ |v_ULTIMATE.start_main_~i~0#1_48| 1)) (<= |v_ULTIMATE.start_main_~i~0#1_48| 2)))} assume !!(main_~i~0#1 < ~N~0);assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~x~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {2193#(exists ((|v_ULTIMATE.start_main_~i~0#1_48| Int)) (and (<= 1 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_48| 4)))) (<= |ULTIMATE.start_main_~i~0#1| (+ |v_ULTIMATE.start_main_~i~0#1_48| 1)) (<= |v_ULTIMATE.start_main_~i~0#1_48| 2)))} is VALID [2022-02-20 14:26:06,745 INFO L290 TraceCheckUtils]: 12: Hoare triple {2193#(exists ((|v_ULTIMATE.start_main_~i~0#1_48| Int)) (and (<= 1 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_48| 4)))) (<= |ULTIMATE.start_main_~i~0#1| (+ |v_ULTIMATE.start_main_~i~0#1_48| 1)) (<= |v_ULTIMATE.start_main_~i~0#1_48| 2)))} assume 0 != main_~x~0#1; {2193#(exists ((|v_ULTIMATE.start_main_~i~0#1_48| Int)) (and (<= 1 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_48| 4)))) (<= |ULTIMATE.start_main_~i~0#1| (+ |v_ULTIMATE.start_main_~i~0#1_48| 1)) (<= |v_ULTIMATE.start_main_~i~0#1_48| 2)))} is VALID [2022-02-20 14:26:06,745 INFO L290 TraceCheckUtils]: 13: Hoare triple {2193#(exists ((|v_ULTIMATE.start_main_~i~0#1_48| Int)) (and (<= 1 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_48| 4)))) (<= |ULTIMATE.start_main_~i~0#1| (+ |v_ULTIMATE.start_main_~i~0#1_48| 1)) (<= |v_ULTIMATE.start_main_~i~0#1_48| 2)))} main_~k~0#1 := 1; {2203#(and (exists ((|v_ULTIMATE.start_main_~i~0#1_48| Int)) (and (<= 1 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_48| 4)))) (<= |ULTIMATE.start_main_~i~0#1| (+ |v_ULTIMATE.start_main_~i~0#1_48| 1)) (<= |v_ULTIMATE.start_main_~i~0#1_48| 2))) (<= 1 |ULTIMATE.start_main_~k~0#1|))} is VALID [2022-02-20 14:26:06,746 INFO L290 TraceCheckUtils]: 14: Hoare triple {2203#(and (exists ((|v_ULTIMATE.start_main_~i~0#1_48| Int)) (and (<= 1 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_48| 4)))) (<= |ULTIMATE.start_main_~i~0#1| (+ |v_ULTIMATE.start_main_~i~0#1_48| 1)) (<= |v_ULTIMATE.start_main_~i~0#1_48| 2))) (<= 1 |ULTIMATE.start_main_~k~0#1|))} assume !!(main_~k~0#1 < main_~i~0#1);call main_#t~mem7#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~k~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem7#1 >= 0 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {2203#(and (exists ((|v_ULTIMATE.start_main_~i~0#1_48| Int)) (and (<= 1 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_48| 4)))) (<= |ULTIMATE.start_main_~i~0#1| (+ |v_ULTIMATE.start_main_~i~0#1_48| 1)) (<= |v_ULTIMATE.start_main_~i~0#1_48| 2))) (<= 1 |ULTIMATE.start_main_~k~0#1|))} is VALID [2022-02-20 14:26:06,747 INFO L290 TraceCheckUtils]: 15: Hoare triple {2203#(and (exists ((|v_ULTIMATE.start_main_~i~0#1_48| Int)) (and (<= 1 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_48| 4)))) (<= |ULTIMATE.start_main_~i~0#1| (+ |v_ULTIMATE.start_main_~i~0#1_48| 1)) (<= |v_ULTIMATE.start_main_~i~0#1_48| 2))) (<= 1 |ULTIMATE.start_main_~k~0#1|))} assume !(0 == __VERIFIER_assert_~cond#1); {2203#(and (exists ((|v_ULTIMATE.start_main_~i~0#1_48| Int)) (and (<= 1 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_48| 4)))) (<= |ULTIMATE.start_main_~i~0#1| (+ |v_ULTIMATE.start_main_~i~0#1_48| 1)) (<= |v_ULTIMATE.start_main_~i~0#1_48| 2))) (<= 1 |ULTIMATE.start_main_~k~0#1|))} is VALID [2022-02-20 14:26:06,748 INFO L290 TraceCheckUtils]: 16: Hoare triple {2203#(and (exists ((|v_ULTIMATE.start_main_~i~0#1_48| Int)) (and (<= 1 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_48| 4)))) (<= |ULTIMATE.start_main_~i~0#1| (+ |v_ULTIMATE.start_main_~i~0#1_48| 1)) (<= |v_ULTIMATE.start_main_~i~0#1_48| 2))) (<= 1 |ULTIMATE.start_main_~k~0#1|))} assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem7#1; {2203#(and (exists ((|v_ULTIMATE.start_main_~i~0#1_48| Int)) (and (<= 1 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_48| 4)))) (<= |ULTIMATE.start_main_~i~0#1| (+ |v_ULTIMATE.start_main_~i~0#1_48| 1)) (<= |v_ULTIMATE.start_main_~i~0#1_48| 2))) (<= 1 |ULTIMATE.start_main_~k~0#1|))} is VALID [2022-02-20 14:26:06,749 INFO L290 TraceCheckUtils]: 17: Hoare triple {2203#(and (exists ((|v_ULTIMATE.start_main_~i~0#1_48| Int)) (and (<= 1 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_48| 4)))) (<= |ULTIMATE.start_main_~i~0#1| (+ |v_ULTIMATE.start_main_~i~0#1_48| 1)) (<= |v_ULTIMATE.start_main_~i~0#1_48| 2))) (<= 1 |ULTIMATE.start_main_~k~0#1|))} main_#t~post6#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {2216#(and (<= 2 |ULTIMATE.start_main_~k~0#1|) (exists ((|v_ULTIMATE.start_main_~i~0#1_48| Int)) (and (<= 1 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_48| 4)))) (<= |ULTIMATE.start_main_~i~0#1| (+ |v_ULTIMATE.start_main_~i~0#1_48| 1)) (<= |v_ULTIMATE.start_main_~i~0#1_48| 2))))} is VALID [2022-02-20 14:26:06,751 INFO L290 TraceCheckUtils]: 18: Hoare triple {2216#(and (<= 2 |ULTIMATE.start_main_~k~0#1|) (exists ((|v_ULTIMATE.start_main_~i~0#1_48| Int)) (and (<= 1 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_48| 4)))) (<= |ULTIMATE.start_main_~i~0#1| (+ |v_ULTIMATE.start_main_~i~0#1_48| 1)) (<= |v_ULTIMATE.start_main_~i~0#1_48| 2))))} assume !!(main_~k~0#1 < main_~i~0#1);call main_#t~mem7#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~k~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem7#1 >= 0 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {2220#(<= 1 |ULTIMATE.start___VERIFIER_assert_~cond#1|)} is VALID [2022-02-20 14:26:06,751 INFO L290 TraceCheckUtils]: 19: Hoare triple {2220#(<= 1 |ULTIMATE.start___VERIFIER_assert_~cond#1|)} assume 0 == __VERIFIER_assert_~cond#1; {2147#false} is VALID [2022-02-20 14:26:06,752 INFO L290 TraceCheckUtils]: 20: Hoare triple {2147#false} assume !false; {2147#false} is VALID [2022-02-20 14:26:06,752 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 14:26:06,752 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 14:26:07,648 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 18 treesize of output 16 [2022-02-20 14:26:07,683 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 38 treesize of output 32 [2022-02-20 14:26:08,152 INFO L290 TraceCheckUtils]: 20: Hoare triple {2147#false} assume !false; {2147#false} is VALID [2022-02-20 14:26:08,153 INFO L290 TraceCheckUtils]: 19: Hoare triple {2220#(<= 1 |ULTIMATE.start___VERIFIER_assert_~cond#1|)} assume 0 == __VERIFIER_assert_~cond#1; {2147#false} is VALID [2022-02-20 14:26:08,153 INFO L290 TraceCheckUtils]: 18: Hoare triple {2233#(or (<= |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~k~0#1|) (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ (* |ULTIMATE.start_main_~k~0#1| 4) |ULTIMATE.start_main_~#a~0#1.offset|))))} assume !!(main_~k~0#1 < main_~i~0#1);call main_#t~mem7#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~k~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem7#1 >= 0 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {2220#(<= 1 |ULTIMATE.start___VERIFIER_assert_~cond#1|)} is VALID [2022-02-20 14:26:08,154 INFO L290 TraceCheckUtils]: 17: Hoare triple {2237#(forall ((|v_ULTIMATE.start_main_~k~0#1_22| Int)) (or (not (<= (+ |ULTIMATE.start_main_~k~0#1| 1) |v_ULTIMATE.start_main_~k~0#1_22|)) (<= |ULTIMATE.start_main_~i~0#1| |v_ULTIMATE.start_main_~k~0#1_22|) (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| (* 4 |v_ULTIMATE.start_main_~k~0#1_22|))))))} main_#t~post6#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {2233#(or (<= |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~k~0#1|) (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ (* |ULTIMATE.start_main_~k~0#1| 4) |ULTIMATE.start_main_~#a~0#1.offset|))))} is VALID [2022-02-20 14:26:08,155 INFO L290 TraceCheckUtils]: 16: Hoare triple {2237#(forall ((|v_ULTIMATE.start_main_~k~0#1_22| Int)) (or (not (<= (+ |ULTIMATE.start_main_~k~0#1| 1) |v_ULTIMATE.start_main_~k~0#1_22|)) (<= |ULTIMATE.start_main_~i~0#1| |v_ULTIMATE.start_main_~k~0#1_22|) (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| (* 4 |v_ULTIMATE.start_main_~k~0#1_22|))))))} assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem7#1; {2237#(forall ((|v_ULTIMATE.start_main_~k~0#1_22| Int)) (or (not (<= (+ |ULTIMATE.start_main_~k~0#1| 1) |v_ULTIMATE.start_main_~k~0#1_22|)) (<= |ULTIMATE.start_main_~i~0#1| |v_ULTIMATE.start_main_~k~0#1_22|) (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| (* 4 |v_ULTIMATE.start_main_~k~0#1_22|))))))} is VALID [2022-02-20 14:26:08,155 INFO L290 TraceCheckUtils]: 15: Hoare triple {2237#(forall ((|v_ULTIMATE.start_main_~k~0#1_22| Int)) (or (not (<= (+ |ULTIMATE.start_main_~k~0#1| 1) |v_ULTIMATE.start_main_~k~0#1_22|)) (<= |ULTIMATE.start_main_~i~0#1| |v_ULTIMATE.start_main_~k~0#1_22|) (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| (* 4 |v_ULTIMATE.start_main_~k~0#1_22|))))))} assume !(0 == __VERIFIER_assert_~cond#1); {2237#(forall ((|v_ULTIMATE.start_main_~k~0#1_22| Int)) (or (not (<= (+ |ULTIMATE.start_main_~k~0#1| 1) |v_ULTIMATE.start_main_~k~0#1_22|)) (<= |ULTIMATE.start_main_~i~0#1| |v_ULTIMATE.start_main_~k~0#1_22|) (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| (* 4 |v_ULTIMATE.start_main_~k~0#1_22|))))))} is VALID [2022-02-20 14:26:08,156 INFO L290 TraceCheckUtils]: 14: Hoare triple {2237#(forall ((|v_ULTIMATE.start_main_~k~0#1_22| Int)) (or (not (<= (+ |ULTIMATE.start_main_~k~0#1| 1) |v_ULTIMATE.start_main_~k~0#1_22|)) (<= |ULTIMATE.start_main_~i~0#1| |v_ULTIMATE.start_main_~k~0#1_22|) (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| (* 4 |v_ULTIMATE.start_main_~k~0#1_22|))))))} assume !!(main_~k~0#1 < main_~i~0#1);call main_#t~mem7#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~k~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem7#1 >= 0 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {2237#(forall ((|v_ULTIMATE.start_main_~k~0#1_22| Int)) (or (not (<= (+ |ULTIMATE.start_main_~k~0#1| 1) |v_ULTIMATE.start_main_~k~0#1_22|)) (<= |ULTIMATE.start_main_~i~0#1| |v_ULTIMATE.start_main_~k~0#1_22|) (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| (* 4 |v_ULTIMATE.start_main_~k~0#1_22|))))))} is VALID [2022-02-20 14:26:08,157 INFO L290 TraceCheckUtils]: 13: Hoare triple {2250#(forall ((|v_ULTIMATE.start_main_~k~0#1_22| Int)) (or (<= |ULTIMATE.start_main_~i~0#1| |v_ULTIMATE.start_main_~k~0#1_22|) (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| (* 4 |v_ULTIMATE.start_main_~k~0#1_22|)))) (< |v_ULTIMATE.start_main_~k~0#1_22| 2)))} main_~k~0#1 := 1; {2237#(forall ((|v_ULTIMATE.start_main_~k~0#1_22| Int)) (or (not (<= (+ |ULTIMATE.start_main_~k~0#1| 1) |v_ULTIMATE.start_main_~k~0#1_22|)) (<= |ULTIMATE.start_main_~i~0#1| |v_ULTIMATE.start_main_~k~0#1_22|) (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| (* 4 |v_ULTIMATE.start_main_~k~0#1_22|))))))} is VALID [2022-02-20 14:26:08,157 INFO L290 TraceCheckUtils]: 12: Hoare triple {2250#(forall ((|v_ULTIMATE.start_main_~k~0#1_22| Int)) (or (<= |ULTIMATE.start_main_~i~0#1| |v_ULTIMATE.start_main_~k~0#1_22|) (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| (* 4 |v_ULTIMATE.start_main_~k~0#1_22|)))) (< |v_ULTIMATE.start_main_~k~0#1_22| 2)))} assume 0 != main_~x~0#1; {2250#(forall ((|v_ULTIMATE.start_main_~k~0#1_22| Int)) (or (<= |ULTIMATE.start_main_~i~0#1| |v_ULTIMATE.start_main_~k~0#1_22|) (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| (* 4 |v_ULTIMATE.start_main_~k~0#1_22|)))) (< |v_ULTIMATE.start_main_~k~0#1_22| 2)))} is VALID [2022-02-20 14:26:08,158 INFO L290 TraceCheckUtils]: 11: Hoare triple {2250#(forall ((|v_ULTIMATE.start_main_~k~0#1_22| Int)) (or (<= |ULTIMATE.start_main_~i~0#1| |v_ULTIMATE.start_main_~k~0#1_22|) (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| (* 4 |v_ULTIMATE.start_main_~k~0#1_22|)))) (< |v_ULTIMATE.start_main_~k~0#1_22| 2)))} assume !!(main_~i~0#1 < ~N~0);assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~x~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {2250#(forall ((|v_ULTIMATE.start_main_~k~0#1_22| Int)) (or (<= |ULTIMATE.start_main_~i~0#1| |v_ULTIMATE.start_main_~k~0#1_22|) (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| (* 4 |v_ULTIMATE.start_main_~k~0#1_22|)))) (< |v_ULTIMATE.start_main_~k~0#1_22| 2)))} is VALID [2022-02-20 14:26:08,159 INFO L290 TraceCheckUtils]: 10: Hoare triple {2260#(forall ((|v_ULTIMATE.start_main_~k~0#1_22| Int)) (or (<= (+ |ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~k~0#1_22|) (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| (* 4 |v_ULTIMATE.start_main_~k~0#1_22|)))) (< |v_ULTIMATE.start_main_~k~0#1_22| 2)))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {2250#(forall ((|v_ULTIMATE.start_main_~k~0#1_22| Int)) (or (<= |ULTIMATE.start_main_~i~0#1| |v_ULTIMATE.start_main_~k~0#1_22|) (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| (* 4 |v_ULTIMATE.start_main_~k~0#1_22|)))) (< |v_ULTIMATE.start_main_~k~0#1_22| 2)))} is VALID [2022-02-20 14:26:08,160 INFO L290 TraceCheckUtils]: 9: Hoare triple {2264#(and (<= |ULTIMATE.start_main_~i~0#1| 2) (or (<= 0 |ULTIMATE.start_main_~j~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 1)))} assume !(0 != main_~x~0#1);call write~int(main_~j~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~j~0#1 := main_~j~0#1 + main_~i~0#1; {2260#(forall ((|v_ULTIMATE.start_main_~k~0#1_22| Int)) (or (<= (+ |ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~k~0#1_22|) (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| (* 4 |v_ULTIMATE.start_main_~k~0#1_22|)))) (< |v_ULTIMATE.start_main_~k~0#1_22| 2)))} is VALID [2022-02-20 14:26:08,161 INFO L290 TraceCheckUtils]: 8: Hoare triple {2264#(and (<= |ULTIMATE.start_main_~i~0#1| 2) (or (<= 0 |ULTIMATE.start_main_~j~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 1)))} assume !!(main_~i~0#1 < ~N~0);assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~x~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {2264#(and (<= |ULTIMATE.start_main_~i~0#1| 2) (or (<= 0 |ULTIMATE.start_main_~j~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 1)))} is VALID [2022-02-20 14:26:08,161 INFO L290 TraceCheckUtils]: 7: Hoare triple {2271#(and (or (<= |ULTIMATE.start_main_~i~0#1| 0) (<= 0 |ULTIMATE.start_main_~j~0#1|)) (<= |ULTIMATE.start_main_~i~0#1| 1))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {2264#(and (<= |ULTIMATE.start_main_~i~0#1| 2) (or (<= 0 |ULTIMATE.start_main_~j~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 1)))} is VALID [2022-02-20 14:26:08,167 INFO L290 TraceCheckUtils]: 6: Hoare triple {2275#(and (or (<= 0 (+ |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~j~0#1|)) (<= |ULTIMATE.start_main_~i~0#1| 0)) (<= |ULTIMATE.start_main_~i~0#1| 1))} assume !(0 != main_~x~0#1);call write~int(main_~j~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~j~0#1 := main_~j~0#1 + main_~i~0#1; {2271#(and (or (<= |ULTIMATE.start_main_~i~0#1| 0) (<= 0 |ULTIMATE.start_main_~j~0#1|)) (<= |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-20 14:26:08,168 INFO L290 TraceCheckUtils]: 5: Hoare triple {2275#(and (or (<= 0 (+ |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~j~0#1|)) (<= |ULTIMATE.start_main_~i~0#1| 0)) (<= |ULTIMATE.start_main_~i~0#1| 1))} assume !!(main_~i~0#1 < ~N~0);assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~x~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {2275#(and (or (<= 0 (+ |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~j~0#1|)) (<= |ULTIMATE.start_main_~i~0#1| 0)) (<= |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-20 14:26:08,169 INFO L290 TraceCheckUtils]: 4: Hoare triple {2282#(and (<= |ULTIMATE.start_main_~i~0#1| 0) (or (<= 0 (+ |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~j~0#1| 1)) (<= (+ |ULTIMATE.start_main_~i~0#1| 1) 0)))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {2275#(and (or (<= 0 (+ |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~j~0#1|)) (<= |ULTIMATE.start_main_~i~0#1| 0)) (<= |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-20 14:26:08,169 INFO L290 TraceCheckUtils]: 3: Hoare triple {2282#(and (<= |ULTIMATE.start_main_~i~0#1| 0) (or (<= 0 (+ |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~j~0#1| 1)) (<= (+ |ULTIMATE.start_main_~i~0#1| 1) 0)))} assume !(0 != main_~x~0#1);call write~int(main_~j~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~j~0#1 := main_~j~0#1 + main_~i~0#1; {2282#(and (<= |ULTIMATE.start_main_~i~0#1| 0) (or (<= 0 (+ |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~j~0#1| 1)) (<= (+ |ULTIMATE.start_main_~i~0#1| 1) 0)))} is VALID [2022-02-20 14:26:08,170 INFO L290 TraceCheckUtils]: 2: Hoare triple {2282#(and (<= |ULTIMATE.start_main_~i~0#1| 0) (or (<= 0 (+ |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~j~0#1| 1)) (<= (+ |ULTIMATE.start_main_~i~0#1| 1) 0)))} assume !!(main_~i~0#1 < ~N~0);assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~x~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {2282#(and (<= |ULTIMATE.start_main_~i~0#1| 0) (or (<= 0 (+ |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~j~0#1| 1)) (<= (+ |ULTIMATE.start_main_~i~0#1| 1) 0)))} is VALID [2022-02-20 14:26:08,171 INFO L290 TraceCheckUtils]: 1: Hoare triple {2146#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~post4#1, main_~x~0#1, main_#t~mem7#1, main_#t~post6#1, main_~k~0#1, main_~i~0#1, main_~j~0#1, main_~#a~0#1.base, main_~#a~0#1.offset;havoc main_~i~0#1;main_~j~0#1 := 0;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4 * ~N~0);main_~i~0#1 := 0; {2282#(and (<= |ULTIMATE.start_main_~i~0#1| 0) (or (<= 0 (+ |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~j~0#1| 1)) (<= (+ |ULTIMATE.start_main_~i~0#1| 1) 0)))} is VALID [2022-02-20 14:26:08,171 INFO L290 TraceCheckUtils]: 0: Hoare triple {2146#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2);call #Ultimate.allocInit(12, 3);~N~0 := 100000; {2146#true} is VALID [2022-02-20 14:26:08,171 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 14:26:08,171 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2077271452] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 14:26:08,171 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 14:26:08,172 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 26 [2022-02-20 14:26:08,174 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250686277] [2022-02-20 14:26:08,174 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 14:26:08,175 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.1538461538461537) internal successors, (56), 26 states have internal predecessors, (56), 0 states have call successors, (0), 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-02-20 14:26:08,175 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:26:08,175 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 26 states, 26 states have (on average 2.1538461538461537) internal successors, (56), 26 states have internal predecessors, (56), 0 states have call successors, (0), 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-02-20 14:26:08,237 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:26:08,237 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-02-20 14:26:08,237 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:26:08,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-02-20 14:26:08,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=512, Unknown=0, NotChecked=0, Total=650 [2022-02-20 14:26:08,238 INFO L87 Difference]: Start difference. First operand 42 states and 50 transitions. Second operand has 26 states, 26 states have (on average 2.1538461538461537) internal successors, (56), 26 states have internal predecessors, (56), 0 states have call successors, (0), 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-02-20 14:26:08,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:26:08,579 INFO L93 Difference]: Finished difference Result 54 states and 62 transitions. [2022-02-20 14:26:08,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-02-20 14:26:08,579 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.1538461538461537) internal successors, (56), 26 states have internal predecessors, (56), 0 states have call successors, (0), 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-02-20 14:26:08,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:26:08,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 2.1538461538461537) internal successors, (56), 26 states have internal predecessors, (56), 0 states have call successors, (0), 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-02-20 14:26:08,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 39 transitions. [2022-02-20 14:26:08,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 2.1538461538461537) internal successors, (56), 26 states have internal predecessors, (56), 0 states have call successors, (0), 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-02-20 14:26:08,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 39 transitions. [2022-02-20 14:26:08,581 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 39 transitions. [2022-02-20 14:26:08,617 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:26:08,618 INFO L225 Difference]: With dead ends: 54 [2022-02-20 14:26:08,618 INFO L226 Difference]: Without dead ends: 42 [2022-02-20 14:26:08,618 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 26 SyntacticMatches, 4 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=184, Invalid=746, Unknown=0, NotChecked=0, Total=930 [2022-02-20 14:26:08,619 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 12 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 44 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 14:26:08,620 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 99 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 88 Invalid, 0 Unknown, 44 Unchecked, 0.1s Time] [2022-02-20 14:26:08,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-02-20 14:26:08,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2022-02-20 14:26:08,655 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:26:08,656 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand has 42 states, 41 states have (on average 1.1951219512195121) internal successors, (49), 41 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:26:08,656 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand has 42 states, 41 states have (on average 1.1951219512195121) internal successors, (49), 41 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:26:08,656 INFO L87 Difference]: Start difference. First operand 42 states. Second operand has 42 states, 41 states have (on average 1.1951219512195121) internal successors, (49), 41 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:26:08,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:26:08,657 INFO L93 Difference]: Finished difference Result 42 states and 49 transitions. [2022-02-20 14:26:08,657 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 49 transitions. [2022-02-20 14:26:08,657 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:26:08,657 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:26:08,657 INFO L74 IsIncluded]: Start isIncluded. First operand has 42 states, 41 states have (on average 1.1951219512195121) internal successors, (49), 41 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 42 states. [2022-02-20 14:26:08,657 INFO L87 Difference]: Start difference. First operand has 42 states, 41 states have (on average 1.1951219512195121) internal successors, (49), 41 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 42 states. [2022-02-20 14:26:08,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:26:08,658 INFO L93 Difference]: Finished difference Result 42 states and 49 transitions. [2022-02-20 14:26:08,658 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 49 transitions. [2022-02-20 14:26:08,658 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:26:08,658 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:26:08,658 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:26:08,658 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:26:08,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 41 states have (on average 1.1951219512195121) internal successors, (49), 41 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:26:08,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 49 transitions. [2022-02-20 14:26:08,658 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 49 transitions. Word has length 21 [2022-02-20 14:26:08,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:26:08,659 INFO L470 AbstractCegarLoop]: Abstraction has 42 states and 49 transitions. [2022-02-20 14:26:08,659 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 2.1538461538461537) internal successors, (56), 26 states have internal predecessors, (56), 0 states have call successors, (0), 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-02-20 14:26:08,659 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 49 transitions. [2022-02-20 14:26:08,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-02-20 14:26:08,659 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:26:08,659 INFO L514 BasicCegarLoop]: trace histogram [5, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:26:08,676 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-02-20 14:26:08,863 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:26:08,864 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:26:08,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:26:08,864 INFO L85 PathProgramCache]: Analyzing trace with hash -213992666, now seen corresponding path program 3 times [2022-02-20 14:26:08,864 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:26:08,864 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021023979] [2022-02-20 14:26:08,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:26:08,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:26:08,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:26:09,051 INFO L290 TraceCheckUtils]: 0: Hoare triple {2515#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2);call #Ultimate.allocInit(12, 3);~N~0 := 100000; {2515#true} is VALID [2022-02-20 14:26:09,052 INFO L290 TraceCheckUtils]: 1: Hoare triple {2515#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~post4#1, main_~x~0#1, main_#t~mem7#1, main_#t~post6#1, main_~k~0#1, main_~i~0#1, main_~j~0#1, main_~#a~0#1.base, main_~#a~0#1.offset;havoc main_~i~0#1;main_~j~0#1 := 0;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4 * ~N~0);main_~i~0#1 := 0; {2517#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-20 14:26:09,052 INFO L290 TraceCheckUtils]: 2: Hoare triple {2517#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~j~0#1| 0))} assume !!(main_~i~0#1 < ~N~0);assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~x~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {2517#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-20 14:26:09,053 INFO L290 TraceCheckUtils]: 3: Hoare triple {2517#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~j~0#1| 0))} assume !(0 != main_~x~0#1);call write~int(main_~j~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~j~0#1 := main_~j~0#1 + main_~i~0#1; {2518#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~j~0#1|))} is VALID [2022-02-20 14:26:09,053 INFO L290 TraceCheckUtils]: 4: Hoare triple {2518#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~j~0#1|))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {2519#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= 1 (+ |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~j~0#1|)) (<= |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-20 14:26:09,054 INFO L290 TraceCheckUtils]: 5: Hoare triple {2519#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= 1 (+ |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~j~0#1|)) (<= |ULTIMATE.start_main_~i~0#1| 1))} assume !!(main_~i~0#1 < ~N~0);assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~x~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {2519#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= 1 (+ |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~j~0#1|)) (<= |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-20 14:26:09,054 INFO L290 TraceCheckUtils]: 6: Hoare triple {2519#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= 1 (+ |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~j~0#1|)) (<= |ULTIMATE.start_main_~i~0#1| 1))} assume !(0 != main_~x~0#1);call write~int(main_~j~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~j~0#1 := main_~j~0#1 + main_~i~0#1; {2520#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= 1 |ULTIMATE.start_main_~j~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-20 14:26:09,055 INFO L290 TraceCheckUtils]: 7: Hoare triple {2520#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= 1 |ULTIMATE.start_main_~j~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 1))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {2521#(and (<= |ULTIMATE.start_main_~i~0#1| 2) (<= 1 |ULTIMATE.start_main_~j~0#1|) (<= 2 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-20 14:26:09,055 INFO L290 TraceCheckUtils]: 8: Hoare triple {2521#(and (<= |ULTIMATE.start_main_~i~0#1| 2) (<= 1 |ULTIMATE.start_main_~j~0#1|) (<= 2 |ULTIMATE.start_main_~i~0#1|))} assume !!(main_~i~0#1 < ~N~0);assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~x~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {2521#(and (<= |ULTIMATE.start_main_~i~0#1| 2) (<= 1 |ULTIMATE.start_main_~j~0#1|) (<= 2 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-20 14:26:09,056 INFO L290 TraceCheckUtils]: 9: Hoare triple {2521#(and (<= |ULTIMATE.start_main_~i~0#1| 2) (<= 1 |ULTIMATE.start_main_~j~0#1|) (<= 2 |ULTIMATE.start_main_~i~0#1|))} assume !(0 != main_~x~0#1);call write~int(main_~j~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~j~0#1 := main_~j~0#1 + main_~i~0#1; {2522#(and (<= 1 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (<= |ULTIMATE.start_main_~i~0#1| 2) (<= 2 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-20 14:26:09,056 INFO L290 TraceCheckUtils]: 10: Hoare triple {2522#(and (<= 1 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (<= |ULTIMATE.start_main_~i~0#1| 2) (<= 2 |ULTIMATE.start_main_~i~0#1|))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {2523#(and (not (= (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)) (+ |ULTIMATE.start_main_~#a~0#1.offset| 8))) (<= 1 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 8))))} is VALID [2022-02-20 14:26:09,057 INFO L290 TraceCheckUtils]: 11: Hoare triple {2523#(and (not (= (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)) (+ |ULTIMATE.start_main_~#a~0#1.offset| 8))) (<= 1 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 8))))} assume !!(main_~i~0#1 < ~N~0);assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~x~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {2523#(and (not (= (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)) (+ |ULTIMATE.start_main_~#a~0#1.offset| 8))) (<= 1 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 8))))} is VALID [2022-02-20 14:26:09,058 INFO L290 TraceCheckUtils]: 12: Hoare triple {2523#(and (not (= (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)) (+ |ULTIMATE.start_main_~#a~0#1.offset| 8))) (<= 1 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 8))))} assume !(0 != main_~x~0#1);call write~int(main_~j~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~j~0#1 := main_~j~0#1 + main_~i~0#1; {2524#(<= 1 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 8)))} is VALID [2022-02-20 14:26:09,058 INFO L290 TraceCheckUtils]: 13: Hoare triple {2524#(<= 1 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 8)))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {2524#(<= 1 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 8)))} is VALID [2022-02-20 14:26:09,058 INFO L290 TraceCheckUtils]: 14: Hoare triple {2524#(<= 1 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 8)))} assume !!(main_~i~0#1 < ~N~0);assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~x~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {2524#(<= 1 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 8)))} is VALID [2022-02-20 14:26:09,059 INFO L290 TraceCheckUtils]: 15: Hoare triple {2524#(<= 1 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 8)))} assume 0 != main_~x~0#1; {2524#(<= 1 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 8)))} is VALID [2022-02-20 14:26:09,059 INFO L290 TraceCheckUtils]: 16: Hoare triple {2524#(<= 1 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 8)))} main_~k~0#1 := 1; {2525#(and (<= 1 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 8))) (= (+ (- 1) |ULTIMATE.start_main_~k~0#1|) 0))} is VALID [2022-02-20 14:26:09,059 INFO L290 TraceCheckUtils]: 17: Hoare triple {2525#(and (<= 1 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 8))) (= (+ (- 1) |ULTIMATE.start_main_~k~0#1|) 0))} assume !!(main_~k~0#1 < main_~i~0#1);call main_#t~mem7#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~k~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem7#1 >= 0 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {2525#(and (<= 1 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 8))) (= (+ (- 1) |ULTIMATE.start_main_~k~0#1|) 0))} is VALID [2022-02-20 14:26:09,060 INFO L290 TraceCheckUtils]: 18: Hoare triple {2525#(and (<= 1 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 8))) (= (+ (- 1) |ULTIMATE.start_main_~k~0#1|) 0))} assume !(0 == __VERIFIER_assert_~cond#1); {2525#(and (<= 1 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 8))) (= (+ (- 1) |ULTIMATE.start_main_~k~0#1|) 0))} is VALID [2022-02-20 14:26:09,060 INFO L290 TraceCheckUtils]: 19: Hoare triple {2525#(and (<= 1 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 8))) (= (+ (- 1) |ULTIMATE.start_main_~k~0#1|) 0))} assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem7#1; {2525#(and (<= 1 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 8))) (= (+ (- 1) |ULTIMATE.start_main_~k~0#1|) 0))} is VALID [2022-02-20 14:26:09,060 INFO L290 TraceCheckUtils]: 20: Hoare triple {2525#(and (<= 1 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 8))) (= (+ (- 1) |ULTIMATE.start_main_~k~0#1|) 0))} main_#t~post6#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {2526#(<= 1 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ (* |ULTIMATE.start_main_~k~0#1| 4) |ULTIMATE.start_main_~#a~0#1.offset|)))} is VALID [2022-02-20 14:26:09,061 INFO L290 TraceCheckUtils]: 21: Hoare triple {2526#(<= 1 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ (* |ULTIMATE.start_main_~k~0#1| 4) |ULTIMATE.start_main_~#a~0#1.offset|)))} assume !!(main_~k~0#1 < main_~i~0#1);call main_#t~mem7#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~k~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem7#1 >= 0 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {2527#(not (= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0))} is VALID [2022-02-20 14:26:09,061 INFO L290 TraceCheckUtils]: 22: Hoare triple {2527#(not (= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0))} assume 0 == __VERIFIER_assert_~cond#1; {2516#false} is VALID [2022-02-20 14:26:09,061 INFO L290 TraceCheckUtils]: 23: Hoare triple {2516#false} assume !false; {2516#false} is VALID [2022-02-20 14:26:09,062 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 14:26:09,062 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:26:09,062 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021023979] [2022-02-20 14:26:09,062 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1021023979] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 14:26:09,062 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [293208956] [2022-02-20 14:26:09,062 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-20 14:26:09,062 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:26:09,062 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:26:09,063 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-02-20 14:26:09,064 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-02-20 14:26:09,121 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-02-20 14:26:09,121 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 14:26:09,122 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 24 conjunts are in the unsatisfiable core [2022-02-20 14:26:09,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:26:09,132 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:26:09,267 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-02-20 14:26:09,370 INFO L356 Elim1Store]: treesize reduction 40, result has 23.1 percent of original size [2022-02-20 14:26:09,371 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 28 treesize of output 27 [2022-02-20 14:26:09,585 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-02-20 14:26:09,656 INFO L290 TraceCheckUtils]: 0: Hoare triple {2515#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2);call #Ultimate.allocInit(12, 3);~N~0 := 100000; {2515#true} is VALID [2022-02-20 14:26:09,657 INFO L290 TraceCheckUtils]: 1: Hoare triple {2515#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~post4#1, main_~x~0#1, main_#t~mem7#1, main_#t~post6#1, main_~k~0#1, main_~i~0#1, main_~j~0#1, main_~#a~0#1.base, main_~#a~0#1.offset;havoc main_~i~0#1;main_~j~0#1 := 0;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4 * ~N~0);main_~i~0#1 := 0; {2518#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~j~0#1|))} is VALID [2022-02-20 14:26:09,657 INFO L290 TraceCheckUtils]: 2: Hoare triple {2518#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~j~0#1|))} assume !!(main_~i~0#1 < ~N~0);assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~x~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {2518#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~j~0#1|))} is VALID [2022-02-20 14:26:09,658 INFO L290 TraceCheckUtils]: 3: Hoare triple {2518#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~j~0#1|))} assume !(0 != main_~x~0#1);call write~int(main_~j~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~j~0#1 := main_~j~0#1 + main_~i~0#1; {2518#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~j~0#1|))} is VALID [2022-02-20 14:26:09,658 INFO L290 TraceCheckUtils]: 4: Hoare triple {2518#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~j~0#1|))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {2519#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= 1 (+ |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~j~0#1|)) (<= |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-20 14:26:09,659 INFO L290 TraceCheckUtils]: 5: Hoare triple {2519#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= 1 (+ |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~j~0#1|)) (<= |ULTIMATE.start_main_~i~0#1| 1))} assume !!(main_~i~0#1 < ~N~0);assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~x~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {2519#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= 1 (+ |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~j~0#1|)) (<= |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-20 14:26:09,659 INFO L290 TraceCheckUtils]: 6: Hoare triple {2519#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= 1 (+ |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~j~0#1|)) (<= |ULTIMATE.start_main_~i~0#1| 1))} assume !(0 != main_~x~0#1);call write~int(main_~j~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~j~0#1 := main_~j~0#1 + main_~i~0#1; {2520#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= 1 |ULTIMATE.start_main_~j~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-20 14:26:09,660 INFO L290 TraceCheckUtils]: 7: Hoare triple {2520#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= 1 |ULTIMATE.start_main_~j~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 1))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {2521#(and (<= |ULTIMATE.start_main_~i~0#1| 2) (<= 1 |ULTIMATE.start_main_~j~0#1|) (<= 2 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-20 14:26:09,660 INFO L290 TraceCheckUtils]: 8: Hoare triple {2521#(and (<= |ULTIMATE.start_main_~i~0#1| 2) (<= 1 |ULTIMATE.start_main_~j~0#1|) (<= 2 |ULTIMATE.start_main_~i~0#1|))} assume !!(main_~i~0#1 < ~N~0);assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~x~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {2521#(and (<= |ULTIMATE.start_main_~i~0#1| 2) (<= 1 |ULTIMATE.start_main_~j~0#1|) (<= 2 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-20 14:26:09,661 INFO L290 TraceCheckUtils]: 9: Hoare triple {2521#(and (<= |ULTIMATE.start_main_~i~0#1| 2) (<= 1 |ULTIMATE.start_main_~j~0#1|) (<= 2 |ULTIMATE.start_main_~i~0#1|))} assume !(0 != main_~x~0#1);call write~int(main_~j~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~j~0#1 := main_~j~0#1 + main_~i~0#1; {2522#(and (<= 1 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (<= |ULTIMATE.start_main_~i~0#1| 2) (<= 2 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-20 14:26:09,661 INFO L290 TraceCheckUtils]: 10: Hoare triple {2522#(and (<= 1 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (<= |ULTIMATE.start_main_~i~0#1| 2) (<= 2 |ULTIMATE.start_main_~i~0#1|))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {2561#(and (<= |ULTIMATE.start_main_~i~0#1| 3) (<= 1 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| (- 4) (* |ULTIMATE.start_main_~i~0#1| 4)))) (<= 3 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-20 14:26:09,662 INFO L290 TraceCheckUtils]: 11: Hoare triple {2561#(and (<= |ULTIMATE.start_main_~i~0#1| 3) (<= 1 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| (- 4) (* |ULTIMATE.start_main_~i~0#1| 4)))) (<= 3 |ULTIMATE.start_main_~i~0#1|))} assume !!(main_~i~0#1 < ~N~0);assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~x~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {2561#(and (<= |ULTIMATE.start_main_~i~0#1| 3) (<= 1 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| (- 4) (* |ULTIMATE.start_main_~i~0#1| 4)))) (<= 3 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-20 14:26:09,662 INFO L290 TraceCheckUtils]: 12: Hoare triple {2561#(and (<= |ULTIMATE.start_main_~i~0#1| 3) (<= 1 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| (- 4) (* |ULTIMATE.start_main_~i~0#1| 4)))) (<= 3 |ULTIMATE.start_main_~i~0#1|))} assume !(0 != main_~x~0#1);call write~int(main_~j~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~j~0#1 := main_~j~0#1 + main_~i~0#1; {2524#(<= 1 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 8)))} is VALID [2022-02-20 14:26:09,663 INFO L290 TraceCheckUtils]: 13: Hoare triple {2524#(<= 1 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 8)))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {2524#(<= 1 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 8)))} is VALID [2022-02-20 14:26:09,663 INFO L290 TraceCheckUtils]: 14: Hoare triple {2524#(<= 1 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 8)))} assume !!(main_~i~0#1 < ~N~0);assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~x~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {2524#(<= 1 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 8)))} is VALID [2022-02-20 14:26:09,663 INFO L290 TraceCheckUtils]: 15: Hoare triple {2524#(<= 1 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 8)))} assume 0 != main_~x~0#1; {2524#(<= 1 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 8)))} is VALID [2022-02-20 14:26:09,664 INFO L290 TraceCheckUtils]: 16: Hoare triple {2524#(<= 1 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 8)))} main_~k~0#1 := 1; {2525#(and (<= 1 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 8))) (= (+ (- 1) |ULTIMATE.start_main_~k~0#1|) 0))} is VALID [2022-02-20 14:26:09,664 INFO L290 TraceCheckUtils]: 17: Hoare triple {2525#(and (<= 1 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 8))) (= (+ (- 1) |ULTIMATE.start_main_~k~0#1|) 0))} assume !!(main_~k~0#1 < main_~i~0#1);call main_#t~mem7#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~k~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem7#1 >= 0 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {2525#(and (<= 1 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 8))) (= (+ (- 1) |ULTIMATE.start_main_~k~0#1|) 0))} is VALID [2022-02-20 14:26:09,665 INFO L290 TraceCheckUtils]: 18: Hoare triple {2525#(and (<= 1 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 8))) (= (+ (- 1) |ULTIMATE.start_main_~k~0#1|) 0))} assume !(0 == __VERIFIER_assert_~cond#1); {2525#(and (<= 1 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 8))) (= (+ (- 1) |ULTIMATE.start_main_~k~0#1|) 0))} is VALID [2022-02-20 14:26:09,665 INFO L290 TraceCheckUtils]: 19: Hoare triple {2525#(and (<= 1 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 8))) (= (+ (- 1) |ULTIMATE.start_main_~k~0#1|) 0))} assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem7#1; {2525#(and (<= 1 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 8))) (= (+ (- 1) |ULTIMATE.start_main_~k~0#1|) 0))} is VALID [2022-02-20 14:26:09,665 INFO L290 TraceCheckUtils]: 20: Hoare triple {2525#(and (<= 1 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 8))) (= (+ (- 1) |ULTIMATE.start_main_~k~0#1|) 0))} main_#t~post6#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {2592#(and (<= 1 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 8))) (= 2 |ULTIMATE.start_main_~k~0#1|))} is VALID [2022-02-20 14:26:09,666 INFO L290 TraceCheckUtils]: 21: Hoare triple {2592#(and (<= 1 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 8))) (= 2 |ULTIMATE.start_main_~k~0#1|))} assume !!(main_~k~0#1 < main_~i~0#1);call main_#t~mem7#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~k~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem7#1 >= 0 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {2596#(<= 1 |ULTIMATE.start___VERIFIER_assert_~cond#1|)} is VALID [2022-02-20 14:26:09,666 INFO L290 TraceCheckUtils]: 22: Hoare triple {2596#(<= 1 |ULTIMATE.start___VERIFIER_assert_~cond#1|)} assume 0 == __VERIFIER_assert_~cond#1; {2516#false} is VALID [2022-02-20 14:26:09,666 INFO L290 TraceCheckUtils]: 23: Hoare triple {2516#false} assume !false; {2516#false} is VALID [2022-02-20 14:26:09,667 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 14:26:09,667 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 14:26:10,004 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 24 treesize of output 22 [2022-02-20 14:26:10,032 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 192 treesize of output 184 [2022-02-20 14:26:10,442 INFO L290 TraceCheckUtils]: 23: Hoare triple {2516#false} assume !false; {2516#false} is VALID [2022-02-20 14:26:10,443 INFO L290 TraceCheckUtils]: 22: Hoare triple {2596#(<= 1 |ULTIMATE.start___VERIFIER_assert_~cond#1|)} assume 0 == __VERIFIER_assert_~cond#1; {2516#false} is VALID [2022-02-20 14:26:10,444 INFO L290 TraceCheckUtils]: 21: Hoare triple {2609#(<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ (* |ULTIMATE.start_main_~k~0#1| 4) |ULTIMATE.start_main_~#a~0#1.offset|)))} assume !!(main_~k~0#1 < main_~i~0#1);call main_#t~mem7#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~k~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem7#1 >= 0 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {2596#(<= 1 |ULTIMATE.start___VERIFIER_assert_~cond#1|)} is VALID [2022-02-20 14:26:10,445 INFO L290 TraceCheckUtils]: 20: Hoare triple {2613#(<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ (* |ULTIMATE.start_main_~k~0#1| 4) |ULTIMATE.start_main_~#a~0#1.offset| 4)))} main_#t~post6#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {2609#(<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ (* |ULTIMATE.start_main_~k~0#1| 4) |ULTIMATE.start_main_~#a~0#1.offset|)))} is VALID [2022-02-20 14:26:10,445 INFO L290 TraceCheckUtils]: 19: Hoare triple {2613#(<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ (* |ULTIMATE.start_main_~k~0#1| 4) |ULTIMATE.start_main_~#a~0#1.offset| 4)))} assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem7#1; {2613#(<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ (* |ULTIMATE.start_main_~k~0#1| 4) |ULTIMATE.start_main_~#a~0#1.offset| 4)))} is VALID [2022-02-20 14:26:10,445 INFO L290 TraceCheckUtils]: 18: Hoare triple {2613#(<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ (* |ULTIMATE.start_main_~k~0#1| 4) |ULTIMATE.start_main_~#a~0#1.offset| 4)))} assume !(0 == __VERIFIER_assert_~cond#1); {2613#(<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ (* |ULTIMATE.start_main_~k~0#1| 4) |ULTIMATE.start_main_~#a~0#1.offset| 4)))} is VALID [2022-02-20 14:26:10,446 INFO L290 TraceCheckUtils]: 17: Hoare triple {2613#(<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ (* |ULTIMATE.start_main_~k~0#1| 4) |ULTIMATE.start_main_~#a~0#1.offset| 4)))} assume !!(main_~k~0#1 < main_~i~0#1);call main_#t~mem7#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~k~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem7#1 >= 0 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {2613#(<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ (* |ULTIMATE.start_main_~k~0#1| 4) |ULTIMATE.start_main_~#a~0#1.offset| 4)))} is VALID [2022-02-20 14:26:10,446 INFO L290 TraceCheckUtils]: 16: Hoare triple {2626#(<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 8)))} main_~k~0#1 := 1; {2613#(<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ (* |ULTIMATE.start_main_~k~0#1| 4) |ULTIMATE.start_main_~#a~0#1.offset| 4)))} is VALID [2022-02-20 14:26:10,447 INFO L290 TraceCheckUtils]: 15: Hoare triple {2626#(<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 8)))} assume 0 != main_~x~0#1; {2626#(<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 8)))} is VALID [2022-02-20 14:26:10,447 INFO L290 TraceCheckUtils]: 14: Hoare triple {2626#(<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 8)))} assume !!(main_~i~0#1 < ~N~0);assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~x~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {2626#(<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 8)))} is VALID [2022-02-20 14:26:10,448 INFO L290 TraceCheckUtils]: 13: Hoare triple {2626#(<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 8)))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {2626#(<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 8)))} is VALID [2022-02-20 14:26:10,448 INFO L290 TraceCheckUtils]: 12: Hoare triple {2639#(forall ((v_ArrVal_147 Int)) (<= 0 (select (store (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)) v_ArrVal_147) (+ |ULTIMATE.start_main_~#a~0#1.offset| 8))))} assume !(0 != main_~x~0#1);call write~int(main_~j~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~j~0#1 := main_~j~0#1 + main_~i~0#1; {2626#(<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 8)))} is VALID [2022-02-20 14:26:10,449 INFO L290 TraceCheckUtils]: 11: Hoare triple {2639#(forall ((v_ArrVal_147 Int)) (<= 0 (select (store (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)) v_ArrVal_147) (+ |ULTIMATE.start_main_~#a~0#1.offset| 8))))} assume !!(main_~i~0#1 < ~N~0);assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~x~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {2639#(forall ((v_ArrVal_147 Int)) (<= 0 (select (store (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)) v_ArrVal_147) (+ |ULTIMATE.start_main_~#a~0#1.offset| 8))))} is VALID [2022-02-20 14:26:10,450 INFO L290 TraceCheckUtils]: 10: Hoare triple {2646#(forall ((v_ArrVal_147 Int)) (<= 0 (select (store (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 4) v_ArrVal_147) (+ |ULTIMATE.start_main_~#a~0#1.offset| 8))))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {2639#(forall ((v_ArrVal_147 Int)) (<= 0 (select (store (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)) v_ArrVal_147) (+ |ULTIMATE.start_main_~#a~0#1.offset| 8))))} is VALID [2022-02-20 14:26:10,451 INFO L290 TraceCheckUtils]: 9: Hoare triple {2650#(and (<= 0 |ULTIMATE.start_main_~j~0#1|) (= 8 (* |ULTIMATE.start_main_~i~0#1| 4)))} assume !(0 != main_~x~0#1);call write~int(main_~j~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~j~0#1 := main_~j~0#1 + main_~i~0#1; {2646#(forall ((v_ArrVal_147 Int)) (<= 0 (select (store (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 4) v_ArrVal_147) (+ |ULTIMATE.start_main_~#a~0#1.offset| 8))))} is VALID [2022-02-20 14:26:10,452 INFO L290 TraceCheckUtils]: 8: Hoare triple {2650#(and (<= 0 |ULTIMATE.start_main_~j~0#1|) (= 8 (* |ULTIMATE.start_main_~i~0#1| 4)))} assume !!(main_~i~0#1 < ~N~0);assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~x~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {2650#(and (<= 0 |ULTIMATE.start_main_~j~0#1|) (= 8 (* |ULTIMATE.start_main_~i~0#1| 4)))} is VALID [2022-02-20 14:26:10,452 INFO L290 TraceCheckUtils]: 7: Hoare triple {2519#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= 1 (+ |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~j~0#1|)) (<= |ULTIMATE.start_main_~i~0#1| 1))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {2650#(and (<= 0 |ULTIMATE.start_main_~j~0#1|) (= 8 (* |ULTIMATE.start_main_~i~0#1| 4)))} is VALID [2022-02-20 14:26:10,453 INFO L290 TraceCheckUtils]: 6: Hoare triple {2660#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 1) (<= 1 (+ |ULTIMATE.start_main_~j~0#1| (* 2 |ULTIMATE.start_main_~i~0#1|))))} assume !(0 != main_~x~0#1);call write~int(main_~j~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~j~0#1 := main_~j~0#1 + main_~i~0#1; {2519#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= 1 (+ |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~j~0#1|)) (<= |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-20 14:26:10,453 INFO L290 TraceCheckUtils]: 5: Hoare triple {2660#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 1) (<= 1 (+ |ULTIMATE.start_main_~j~0#1| (* 2 |ULTIMATE.start_main_~i~0#1|))))} assume !!(main_~i~0#1 < ~N~0);assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~x~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {2660#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 1) (<= 1 (+ |ULTIMATE.start_main_~j~0#1| (* 2 |ULTIMATE.start_main_~i~0#1|))))} is VALID [2022-02-20 14:26:10,454 INFO L290 TraceCheckUtils]: 4: Hoare triple {2667#(and (<= |ULTIMATE.start_main_~i~0#1| 0) (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= 0 (+ |ULTIMATE.start_main_~j~0#1| (* 2 |ULTIMATE.start_main_~i~0#1|) 1)))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {2660#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 1) (<= 1 (+ |ULTIMATE.start_main_~j~0#1| (* 2 |ULTIMATE.start_main_~i~0#1|))))} is VALID [2022-02-20 14:26:10,455 INFO L290 TraceCheckUtils]: 3: Hoare triple {2667#(and (<= |ULTIMATE.start_main_~i~0#1| 0) (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= 0 (+ |ULTIMATE.start_main_~j~0#1| (* 2 |ULTIMATE.start_main_~i~0#1|) 1)))} assume !(0 != main_~x~0#1);call write~int(main_~j~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~j~0#1 := main_~j~0#1 + main_~i~0#1; {2667#(and (<= |ULTIMATE.start_main_~i~0#1| 0) (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= 0 (+ |ULTIMATE.start_main_~j~0#1| (* 2 |ULTIMATE.start_main_~i~0#1|) 1)))} is VALID [2022-02-20 14:26:10,455 INFO L290 TraceCheckUtils]: 2: Hoare triple {2667#(and (<= |ULTIMATE.start_main_~i~0#1| 0) (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= 0 (+ |ULTIMATE.start_main_~j~0#1| (* 2 |ULTIMATE.start_main_~i~0#1|) 1)))} assume !!(main_~i~0#1 < ~N~0);assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~x~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {2667#(and (<= |ULTIMATE.start_main_~i~0#1| 0) (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= 0 (+ |ULTIMATE.start_main_~j~0#1| (* 2 |ULTIMATE.start_main_~i~0#1|) 1)))} is VALID [2022-02-20 14:26:10,456 INFO L290 TraceCheckUtils]: 1: Hoare triple {2515#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~post4#1, main_~x~0#1, main_#t~mem7#1, main_#t~post6#1, main_~k~0#1, main_~i~0#1, main_~j~0#1, main_~#a~0#1.base, main_~#a~0#1.offset;havoc main_~i~0#1;main_~j~0#1 := 0;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4 * ~N~0);main_~i~0#1 := 0; {2667#(and (<= |ULTIMATE.start_main_~i~0#1| 0) (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= 0 (+ |ULTIMATE.start_main_~j~0#1| (* 2 |ULTIMATE.start_main_~i~0#1|) 1)))} is VALID [2022-02-20 14:26:10,456 INFO L290 TraceCheckUtils]: 0: Hoare triple {2515#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2);call #Ultimate.allocInit(12, 3);~N~0 := 100000; {2515#true} is VALID [2022-02-20 14:26:10,456 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 14:26:10,456 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [293208956] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 14:26:10,456 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 14:26:10,456 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 24 [2022-02-20 14:26:10,456 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671961377] [2022-02-20 14:26:10,456 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 14:26:10,457 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.25) internal successors, (54), 24 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 24 [2022-02-20 14:26:10,457 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:26:10,457 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 24 states, 24 states have (on average 2.25) internal successors, (54), 24 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-02-20 14:26:10,509 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:26:10,509 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-02-20 14:26:10,509 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:26:10,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-02-20 14:26:10,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=477, Unknown=0, NotChecked=0, Total=552 [2022-02-20 14:26:10,510 INFO L87 Difference]: Start difference. First operand 42 states and 49 transitions. Second operand has 24 states, 24 states have (on average 2.25) internal successors, (54), 24 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-02-20 14:26:11,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:26:11,018 INFO L93 Difference]: Finished difference Result 56 states and 63 transitions. [2022-02-20 14:26:11,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-02-20 14:26:11,018 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.25) internal successors, (54), 24 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 24 [2022-02-20 14:26:11,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:26:11,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 2.25) internal successors, (54), 24 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-02-20 14:26:11,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 48 transitions. [2022-02-20 14:26:11,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 2.25) internal successors, (54), 24 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-02-20 14:26:11,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 48 transitions. [2022-02-20 14:26:11,019 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 48 transitions. [2022-02-20 14:26:11,054 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:26:11,055 INFO L225 Difference]: With dead ends: 56 [2022-02-20 14:26:11,055 INFO L226 Difference]: Without dead ends: 54 [2022-02-20 14:26:11,055 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 30 SyntacticMatches, 8 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=118, Invalid=694, Unknown=0, NotChecked=0, Total=812 [2022-02-20 14:26:11,056 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 28 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 29 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 14:26:11,056 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 101 Invalid, 248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 204 Invalid, 0 Unknown, 29 Unchecked, 0.2s Time] [2022-02-20 14:26:11,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-02-20 14:26:11,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 47. [2022-02-20 14:26:11,102 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:26:11,102 INFO L82 GeneralOperation]: Start isEquivalent. First operand 54 states. Second operand has 47 states, 46 states have (on average 1.173913043478261) internal successors, (54), 46 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-02-20 14:26:11,102 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand has 47 states, 46 states have (on average 1.173913043478261) internal successors, (54), 46 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-02-20 14:26:11,102 INFO L87 Difference]: Start difference. First operand 54 states. Second operand has 47 states, 46 states have (on average 1.173913043478261) internal successors, (54), 46 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-02-20 14:26:11,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:26:11,103 INFO L93 Difference]: Finished difference Result 54 states and 61 transitions. [2022-02-20 14:26:11,103 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 61 transitions. [2022-02-20 14:26:11,103 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:26:11,104 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:26:11,104 INFO L74 IsIncluded]: Start isIncluded. First operand has 47 states, 46 states have (on average 1.173913043478261) internal successors, (54), 46 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) Second operand 54 states. [2022-02-20 14:26:11,104 INFO L87 Difference]: Start difference. First operand has 47 states, 46 states have (on average 1.173913043478261) internal successors, (54), 46 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) Second operand 54 states. [2022-02-20 14:26:11,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:26:11,105 INFO L93 Difference]: Finished difference Result 54 states and 61 transitions. [2022-02-20 14:26:11,105 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 61 transitions. [2022-02-20 14:26:11,105 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:26:11,105 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:26:11,105 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:26:11,105 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:26:11,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 46 states have (on average 1.173913043478261) internal successors, (54), 46 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-02-20 14:26:11,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 54 transitions. [2022-02-20 14:26:11,106 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 54 transitions. Word has length 24 [2022-02-20 14:26:11,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:26:11,106 INFO L470 AbstractCegarLoop]: Abstraction has 47 states and 54 transitions. [2022-02-20 14:26:11,106 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 2.25) internal successors, (54), 24 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-02-20 14:26:11,106 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 54 transitions. [2022-02-20 14:26:11,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-02-20 14:26:11,106 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:26:11,106 INFO L514 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-02-20 14:26:11,126 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-02-20 14:26:11,319 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-02-20 14:26:11,319 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:26:11,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:26:11,320 INFO L85 PathProgramCache]: Analyzing trace with hash 2053274844, now seen corresponding path program 4 times [2022-02-20 14:26:11,320 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:26:11,320 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018524520] [2022-02-20 14:26:11,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:26:11,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:26:11,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:26:11,648 INFO L290 TraceCheckUtils]: 0: Hoare triple {2932#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2);call #Ultimate.allocInit(12, 3);~N~0 := 100000; {2932#true} is VALID [2022-02-20 14:26:11,648 INFO L290 TraceCheckUtils]: 1: Hoare triple {2932#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~post4#1, main_~x~0#1, main_#t~mem7#1, main_#t~post6#1, main_~k~0#1, main_~i~0#1, main_~j~0#1, main_~#a~0#1.base, main_~#a~0#1.offset;havoc main_~i~0#1;main_~j~0#1 := 0;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4 * ~N~0);main_~i~0#1 := 0; {2934#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0) (= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-20 14:26:11,649 INFO L290 TraceCheckUtils]: 2: Hoare triple {2934#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0) (= |ULTIMATE.start_main_~j~0#1| 0))} assume !!(main_~i~0#1 < ~N~0);assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~x~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {2934#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0) (= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-20 14:26:11,649 INFO L290 TraceCheckUtils]: 3: Hoare triple {2934#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0) (= |ULTIMATE.start_main_~j~0#1| 0))} assume !(0 != main_~x~0#1);call write~int(main_~j~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~j~0#1 := main_~j~0#1 + main_~i~0#1; {2935#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~j~0#1|) (= |ULTIMATE.start_main_~#a~0#1.offset| 0))} is VALID [2022-02-20 14:26:11,650 INFO L290 TraceCheckUtils]: 4: Hoare triple {2935#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~j~0#1|) (= |ULTIMATE.start_main_~#a~0#1.offset| 0))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {2936#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= 2 (+ |ULTIMATE.start_main_~j~0#1| (* 2 |ULTIMATE.start_main_~i~0#1|))) (= |ULTIMATE.start_main_~#a~0#1.offset| 0) (<= |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-20 14:26:11,650 INFO L290 TraceCheckUtils]: 5: Hoare triple {2936#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= 2 (+ |ULTIMATE.start_main_~j~0#1| (* 2 |ULTIMATE.start_main_~i~0#1|))) (= |ULTIMATE.start_main_~#a~0#1.offset| 0) (<= |ULTIMATE.start_main_~i~0#1| 1))} assume !!(main_~i~0#1 < ~N~0);assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~x~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {2936#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= 2 (+ |ULTIMATE.start_main_~j~0#1| (* 2 |ULTIMATE.start_main_~i~0#1|))) (= |ULTIMATE.start_main_~#a~0#1.offset| 0) (<= |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-20 14:26:11,651 INFO L290 TraceCheckUtils]: 6: Hoare triple {2936#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= 2 (+ |ULTIMATE.start_main_~j~0#1| (* 2 |ULTIMATE.start_main_~i~0#1|))) (= |ULTIMATE.start_main_~#a~0#1.offset| 0) (<= |ULTIMATE.start_main_~i~0#1| 1))} assume !(0 != main_~x~0#1);call write~int(main_~j~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~j~0#1 := main_~j~0#1 + main_~i~0#1; {2937#(and (<= 2 (+ |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~j~0#1|)) (<= 1 |ULTIMATE.start_main_~i~0#1|) (= |ULTIMATE.start_main_~#a~0#1.offset| 0) (<= |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-20 14:26:11,652 INFO L290 TraceCheckUtils]: 7: Hoare triple {2937#(and (<= 2 (+ |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~j~0#1|)) (<= 1 |ULTIMATE.start_main_~i~0#1|) (= |ULTIMATE.start_main_~#a~0#1.offset| 0) (<= |ULTIMATE.start_main_~i~0#1| 1))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {2938#(and (<= 3 (+ |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~j~0#1|)) (<= |ULTIMATE.start_main_~i~0#1| 2) (<= 2 |ULTIMATE.start_main_~i~0#1|) (= |ULTIMATE.start_main_~#a~0#1.offset| 0))} is VALID [2022-02-20 14:26:11,652 INFO L290 TraceCheckUtils]: 8: Hoare triple {2938#(and (<= 3 (+ |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~j~0#1|)) (<= |ULTIMATE.start_main_~i~0#1| 2) (<= 2 |ULTIMATE.start_main_~i~0#1|) (= |ULTIMATE.start_main_~#a~0#1.offset| 0))} assume !!(main_~i~0#1 < ~N~0);assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~x~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {2938#(and (<= 3 (+ |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~j~0#1|)) (<= |ULTIMATE.start_main_~i~0#1| 2) (<= 2 |ULTIMATE.start_main_~i~0#1|) (= |ULTIMATE.start_main_~#a~0#1.offset| 0))} is VALID [2022-02-20 14:26:11,653 INFO L290 TraceCheckUtils]: 9: Hoare triple {2938#(and (<= 3 (+ |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~j~0#1|)) (<= |ULTIMATE.start_main_~i~0#1| 2) (<= 2 |ULTIMATE.start_main_~i~0#1|) (= |ULTIMATE.start_main_~#a~0#1.offset| 0))} assume !(0 != main_~x~0#1);call write~int(main_~j~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~j~0#1 := main_~j~0#1 + main_~i~0#1; {2939#(and (<= 3 |ULTIMATE.start_main_~j~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 2) (<= 2 |ULTIMATE.start_main_~i~0#1|) (= |ULTIMATE.start_main_~#a~0#1.offset| 0))} is VALID [2022-02-20 14:26:11,653 INFO L290 TraceCheckUtils]: 10: Hoare triple {2939#(and (<= 3 |ULTIMATE.start_main_~j~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 2) (<= 2 |ULTIMATE.start_main_~i~0#1|) (= |ULTIMATE.start_main_~#a~0#1.offset| 0))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {2940#(and (<= 3 |ULTIMATE.start_main_~j~0#1|) (= 12 (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) (= |ULTIMATE.start_main_~#a~0#1.offset| 0))} is VALID [2022-02-20 14:26:11,654 INFO L290 TraceCheckUtils]: 11: Hoare triple {2940#(and (<= 3 |ULTIMATE.start_main_~j~0#1|) (= 12 (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) (= |ULTIMATE.start_main_~#a~0#1.offset| 0))} assume !!(main_~i~0#1 < ~N~0);assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~x~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {2940#(and (<= 3 |ULTIMATE.start_main_~j~0#1|) (= 12 (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) (= |ULTIMATE.start_main_~#a~0#1.offset| 0))} is VALID [2022-02-20 14:26:11,654 INFO L290 TraceCheckUtils]: 12: Hoare triple {2940#(and (<= 3 |ULTIMATE.start_main_~j~0#1|) (= 12 (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) (= |ULTIMATE.start_main_~#a~0#1.offset| 0))} assume !(0 != main_~x~0#1);call write~int(main_~j~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~j~0#1 := main_~j~0#1 + main_~i~0#1; {2941#(and (= 12 (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) (= |ULTIMATE.start_main_~#a~0#1.offset| 0) (<= 3 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))))} is VALID [2022-02-20 14:26:11,655 INFO L290 TraceCheckUtils]: 13: Hoare triple {2941#(and (= 12 (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) (= |ULTIMATE.start_main_~#a~0#1.offset| 0) (<= 3 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {2942#(and (<= |ULTIMATE.start_main_~i~0#1| 4) (<= 3 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) 12)) (= |ULTIMATE.start_main_~#a~0#1.offset| 0))} is VALID [2022-02-20 14:26:11,655 INFO L290 TraceCheckUtils]: 14: Hoare triple {2942#(and (<= |ULTIMATE.start_main_~i~0#1| 4) (<= 3 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) 12)) (= |ULTIMATE.start_main_~#a~0#1.offset| 0))} assume !!(main_~i~0#1 < ~N~0);assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~x~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {2942#(and (<= |ULTIMATE.start_main_~i~0#1| 4) (<= 3 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) 12)) (= |ULTIMATE.start_main_~#a~0#1.offset| 0))} is VALID [2022-02-20 14:26:11,656 INFO L290 TraceCheckUtils]: 15: Hoare triple {2942#(and (<= |ULTIMATE.start_main_~i~0#1| 4) (<= 3 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) 12)) (= |ULTIMATE.start_main_~#a~0#1.offset| 0))} assume 0 != main_~x~0#1; {2942#(and (<= |ULTIMATE.start_main_~i~0#1| 4) (<= 3 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) 12)) (= |ULTIMATE.start_main_~#a~0#1.offset| 0))} is VALID [2022-02-20 14:26:11,656 INFO L290 TraceCheckUtils]: 16: Hoare triple {2942#(and (<= |ULTIMATE.start_main_~i~0#1| 4) (<= 3 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) 12)) (= |ULTIMATE.start_main_~#a~0#1.offset| 0))} main_~k~0#1 := 1; {2943#(and (<= |ULTIMATE.start_main_~i~0#1| 4) (<= 3 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) 12)) (= |ULTIMATE.start_main_~#a~0#1.offset| 0) (= (+ (- 1) |ULTIMATE.start_main_~k~0#1|) 0))} is VALID [2022-02-20 14:26:11,657 INFO L290 TraceCheckUtils]: 17: Hoare triple {2943#(and (<= |ULTIMATE.start_main_~i~0#1| 4) (<= 3 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) 12)) (= |ULTIMATE.start_main_~#a~0#1.offset| 0) (= (+ (- 1) |ULTIMATE.start_main_~k~0#1|) 0))} assume !!(main_~k~0#1 < main_~i~0#1);call main_#t~mem7#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~k~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem7#1 >= 0 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {2943#(and (<= |ULTIMATE.start_main_~i~0#1| 4) (<= 3 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) 12)) (= |ULTIMATE.start_main_~#a~0#1.offset| 0) (= (+ (- 1) |ULTIMATE.start_main_~k~0#1|) 0))} is VALID [2022-02-20 14:26:11,657 INFO L290 TraceCheckUtils]: 18: Hoare triple {2943#(and (<= |ULTIMATE.start_main_~i~0#1| 4) (<= 3 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) 12)) (= |ULTIMATE.start_main_~#a~0#1.offset| 0) (= (+ (- 1) |ULTIMATE.start_main_~k~0#1|) 0))} assume !(0 == __VERIFIER_assert_~cond#1); {2943#(and (<= |ULTIMATE.start_main_~i~0#1| 4) (<= 3 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) 12)) (= |ULTIMATE.start_main_~#a~0#1.offset| 0) (= (+ (- 1) |ULTIMATE.start_main_~k~0#1|) 0))} is VALID [2022-02-20 14:26:11,657 INFO L290 TraceCheckUtils]: 19: Hoare triple {2943#(and (<= |ULTIMATE.start_main_~i~0#1| 4) (<= 3 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) 12)) (= |ULTIMATE.start_main_~#a~0#1.offset| 0) (= (+ (- 1) |ULTIMATE.start_main_~k~0#1|) 0))} assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem7#1; {2943#(and (<= |ULTIMATE.start_main_~i~0#1| 4) (<= 3 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) 12)) (= |ULTIMATE.start_main_~#a~0#1.offset| 0) (= (+ (- 1) |ULTIMATE.start_main_~k~0#1|) 0))} is VALID [2022-02-20 14:26:11,658 INFO L290 TraceCheckUtils]: 20: Hoare triple {2943#(and (<= |ULTIMATE.start_main_~i~0#1| 4) (<= 3 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) 12)) (= |ULTIMATE.start_main_~#a~0#1.offset| 0) (= (+ (- 1) |ULTIMATE.start_main_~k~0#1|) 0))} main_#t~post6#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {2944#(and (<= 2 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 4) (<= 3 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) 12)) (= |ULTIMATE.start_main_~#a~0#1.offset| 0))} is VALID [2022-02-20 14:26:11,658 INFO L290 TraceCheckUtils]: 21: Hoare triple {2944#(and (<= 2 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 4) (<= 3 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) 12)) (= |ULTIMATE.start_main_~#a~0#1.offset| 0))} assume !!(main_~k~0#1 < main_~i~0#1);call main_#t~mem7#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~k~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem7#1 >= 0 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {2944#(and (<= 2 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 4) (<= 3 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) 12)) (= |ULTIMATE.start_main_~#a~0#1.offset| 0))} is VALID [2022-02-20 14:26:11,659 INFO L290 TraceCheckUtils]: 22: Hoare triple {2944#(and (<= 2 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 4) (<= 3 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) 12)) (= |ULTIMATE.start_main_~#a~0#1.offset| 0))} assume !(0 == __VERIFIER_assert_~cond#1); {2944#(and (<= 2 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 4) (<= 3 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) 12)) (= |ULTIMATE.start_main_~#a~0#1.offset| 0))} is VALID [2022-02-20 14:26:11,659 INFO L290 TraceCheckUtils]: 23: Hoare triple {2944#(and (<= 2 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 4) (<= 3 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) 12)) (= |ULTIMATE.start_main_~#a~0#1.offset| 0))} assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem7#1; {2944#(and (<= 2 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 4) (<= 3 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) 12)) (= |ULTIMATE.start_main_~#a~0#1.offset| 0))} is VALID [2022-02-20 14:26:11,661 INFO L290 TraceCheckUtils]: 24: Hoare triple {2944#(and (<= 2 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 4) (<= 3 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) 12)) (= |ULTIMATE.start_main_~#a~0#1.offset| 0))} main_#t~post6#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {2945#(and (or (= (+ (* |ULTIMATE.start_main_~k~0#1| 4) |ULTIMATE.start_main_~#a~0#1.offset|) 12) (and (<= |ULTIMATE.start_main_~i~0#1| 4) (<= 3 |ULTIMATE.start_main_~k~0#1|))) (or (not (= (+ (* |ULTIMATE.start_main_~k~0#1| 4) |ULTIMATE.start_main_~#a~0#1.offset|) 12)) (<= 3 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ (* |ULTIMATE.start_main_~k~0#1| 4) |ULTIMATE.start_main_~#a~0#1.offset|)))) (= |ULTIMATE.start_main_~#a~0#1.offset| 0))} is VALID [2022-02-20 14:26:11,662 INFO L290 TraceCheckUtils]: 25: Hoare triple {2945#(and (or (= (+ (* |ULTIMATE.start_main_~k~0#1| 4) |ULTIMATE.start_main_~#a~0#1.offset|) 12) (and (<= |ULTIMATE.start_main_~i~0#1| 4) (<= 3 |ULTIMATE.start_main_~k~0#1|))) (or (not (= (+ (* |ULTIMATE.start_main_~k~0#1| 4) |ULTIMATE.start_main_~#a~0#1.offset|) 12)) (<= 3 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ (* |ULTIMATE.start_main_~k~0#1| 4) |ULTIMATE.start_main_~#a~0#1.offset|)))) (= |ULTIMATE.start_main_~#a~0#1.offset| 0))} assume !!(main_~k~0#1 < main_~i~0#1);call main_#t~mem7#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~k~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem7#1 >= 0 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {2946#(not (= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0))} is VALID [2022-02-20 14:26:11,662 INFO L290 TraceCheckUtils]: 26: Hoare triple {2946#(not (= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0))} assume 0 == __VERIFIER_assert_~cond#1; {2933#false} is VALID [2022-02-20 14:26:11,662 INFO L290 TraceCheckUtils]: 27: Hoare triple {2933#false} assume !false; {2933#false} is VALID [2022-02-20 14:26:11,662 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 14:26:11,662 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:26:11,662 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018524520] [2022-02-20 14:26:11,663 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2018524520] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 14:26:11,663 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [803967698] [2022-02-20 14:26:11,663 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-02-20 14:26:11,663 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:26:11,663 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:26:11,664 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-02-20 14:26:11,664 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-02-20 14:26:11,738 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-02-20 14:26:11,738 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 14:26:11,739 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 25 conjunts are in the unsatisfiable core [2022-02-20 14:26:11,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:26:11,747 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:26:11,984 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-02-20 14:26:12,236 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-02-20 14:26:12,305 INFO L290 TraceCheckUtils]: 0: Hoare triple {2932#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2);call #Ultimate.allocInit(12, 3);~N~0 := 100000; {2932#true} is VALID [2022-02-20 14:26:12,306 INFO L290 TraceCheckUtils]: 1: Hoare triple {2932#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~post4#1, main_~x~0#1, main_#t~mem7#1, main_#t~post6#1, main_~k~0#1, main_~i~0#1, main_~j~0#1, main_~#a~0#1.base, main_~#a~0#1.offset;havoc main_~i~0#1;main_~j~0#1 := 0;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4 * ~N~0);main_~i~0#1 := 0; {2953#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 0 |ULTIMATE.start_main_~j~0#1|))} is VALID [2022-02-20 14:26:12,306 INFO L290 TraceCheckUtils]: 2: Hoare triple {2953#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 0 |ULTIMATE.start_main_~j~0#1|))} assume !!(main_~i~0#1 < ~N~0);assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~x~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {2953#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 0 |ULTIMATE.start_main_~j~0#1|))} is VALID [2022-02-20 14:26:12,307 INFO L290 TraceCheckUtils]: 3: Hoare triple {2953#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 0 |ULTIMATE.start_main_~j~0#1|))} assume !(0 != main_~x~0#1);call write~int(main_~j~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~j~0#1 := main_~j~0#1 + main_~i~0#1; {2953#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 0 |ULTIMATE.start_main_~j~0#1|))} is VALID [2022-02-20 14:26:12,307 INFO L290 TraceCheckUtils]: 4: Hoare triple {2953#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 0 |ULTIMATE.start_main_~j~0#1|))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {2963#(and (= |ULTIMATE.start_main_~i~0#1| 1) (<= 0 |ULTIMATE.start_main_~j~0#1|))} is VALID [2022-02-20 14:26:12,308 INFO L290 TraceCheckUtils]: 5: Hoare triple {2963#(and (= |ULTIMATE.start_main_~i~0#1| 1) (<= 0 |ULTIMATE.start_main_~j~0#1|))} assume !!(main_~i~0#1 < ~N~0);assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~x~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {2963#(and (= |ULTIMATE.start_main_~i~0#1| 1) (<= 0 |ULTIMATE.start_main_~j~0#1|))} is VALID [2022-02-20 14:26:12,308 INFO L290 TraceCheckUtils]: 6: Hoare triple {2963#(and (= |ULTIMATE.start_main_~i~0#1| 1) (<= 0 |ULTIMATE.start_main_~j~0#1|))} assume !(0 != main_~x~0#1);call write~int(main_~j~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~j~0#1 := main_~j~0#1 + main_~i~0#1; {2970#(and (= |ULTIMATE.start_main_~i~0#1| 1) (<= |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~j~0#1|))} is VALID [2022-02-20 14:26:12,309 INFO L290 TraceCheckUtils]: 7: Hoare triple {2970#(and (= |ULTIMATE.start_main_~i~0#1| 1) (<= |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~j~0#1|))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {2974#(and (<= 1 |ULTIMATE.start_main_~j~0#1|) (= 2 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-20 14:26:12,309 INFO L290 TraceCheckUtils]: 8: Hoare triple {2974#(and (<= 1 |ULTIMATE.start_main_~j~0#1|) (= 2 |ULTIMATE.start_main_~i~0#1|))} assume !!(main_~i~0#1 < ~N~0);assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~x~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {2974#(and (<= 1 |ULTIMATE.start_main_~j~0#1|) (= 2 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-20 14:26:12,310 INFO L290 TraceCheckUtils]: 9: Hoare triple {2974#(and (<= 1 |ULTIMATE.start_main_~j~0#1|) (= 2 |ULTIMATE.start_main_~i~0#1|))} assume !(0 != main_~x~0#1);call write~int(main_~j~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~j~0#1 := main_~j~0#1 + main_~i~0#1; {2981#(and (= 2 |ULTIMATE.start_main_~i~0#1|) (<= (+ |ULTIMATE.start_main_~i~0#1| 1) |ULTIMATE.start_main_~j~0#1|))} is VALID [2022-02-20 14:26:12,310 INFO L290 TraceCheckUtils]: 10: Hoare triple {2981#(and (= 2 |ULTIMATE.start_main_~i~0#1|) (<= (+ |ULTIMATE.start_main_~i~0#1| 1) |ULTIMATE.start_main_~j~0#1|))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {2985#(and (<= |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~j~0#1|) (= 2 (+ (- 1) |ULTIMATE.start_main_~i~0#1|)))} is VALID [2022-02-20 14:26:12,310 INFO L290 TraceCheckUtils]: 11: Hoare triple {2985#(and (<= |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~j~0#1|) (= 2 (+ (- 1) |ULTIMATE.start_main_~i~0#1|)))} assume !!(main_~i~0#1 < ~N~0);assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~x~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {2985#(and (<= |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~j~0#1|) (= 2 (+ (- 1) |ULTIMATE.start_main_~i~0#1|)))} is VALID [2022-02-20 14:26:12,311 INFO L290 TraceCheckUtils]: 12: Hoare triple {2985#(and (<= |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~j~0#1|) (= 2 (+ (- 1) |ULTIMATE.start_main_~i~0#1|)))} assume !(0 != main_~x~0#1);call write~int(main_~j~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~j~0#1 := main_~j~0#1 + main_~i~0#1; {2992#(<= 3 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 12)))} is VALID [2022-02-20 14:26:12,311 INFO L290 TraceCheckUtils]: 13: Hoare triple {2992#(<= 3 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 12)))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {2992#(<= 3 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 12)))} is VALID [2022-02-20 14:26:12,312 INFO L290 TraceCheckUtils]: 14: Hoare triple {2992#(<= 3 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 12)))} assume !!(main_~i~0#1 < ~N~0);assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~x~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {2992#(<= 3 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 12)))} is VALID [2022-02-20 14:26:12,312 INFO L290 TraceCheckUtils]: 15: Hoare triple {2992#(<= 3 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 12)))} assume 0 != main_~x~0#1; {2992#(<= 3 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 12)))} is VALID [2022-02-20 14:26:12,312 INFO L290 TraceCheckUtils]: 16: Hoare triple {2992#(<= 3 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 12)))} main_~k~0#1 := 1; {3005#(and (= |ULTIMATE.start_main_~k~0#1| 1) (<= 3 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 12))))} is VALID [2022-02-20 14:26:12,313 INFO L290 TraceCheckUtils]: 17: Hoare triple {3005#(and (= |ULTIMATE.start_main_~k~0#1| 1) (<= 3 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 12))))} assume !!(main_~k~0#1 < main_~i~0#1);call main_#t~mem7#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~k~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem7#1 >= 0 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {3005#(and (= |ULTIMATE.start_main_~k~0#1| 1) (<= 3 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 12))))} is VALID [2022-02-20 14:26:12,313 INFO L290 TraceCheckUtils]: 18: Hoare triple {3005#(and (= |ULTIMATE.start_main_~k~0#1| 1) (<= 3 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 12))))} assume !(0 == __VERIFIER_assert_~cond#1); {3005#(and (= |ULTIMATE.start_main_~k~0#1| 1) (<= 3 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 12))))} is VALID [2022-02-20 14:26:12,314 INFO L290 TraceCheckUtils]: 19: Hoare triple {3005#(and (= |ULTIMATE.start_main_~k~0#1| 1) (<= 3 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 12))))} assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem7#1; {3005#(and (= |ULTIMATE.start_main_~k~0#1| 1) (<= 3 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 12))))} is VALID [2022-02-20 14:26:12,314 INFO L290 TraceCheckUtils]: 20: Hoare triple {3005#(and (= |ULTIMATE.start_main_~k~0#1| 1) (<= 3 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 12))))} main_#t~post6#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {3018#(and (= (+ (- 1) |ULTIMATE.start_main_~k~0#1|) 1) (<= 3 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 12))))} is VALID [2022-02-20 14:26:12,315 INFO L290 TraceCheckUtils]: 21: Hoare triple {3018#(and (= (+ (- 1) |ULTIMATE.start_main_~k~0#1|) 1) (<= 3 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 12))))} assume !!(main_~k~0#1 < main_~i~0#1);call main_#t~mem7#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~k~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem7#1 >= 0 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {3018#(and (= (+ (- 1) |ULTIMATE.start_main_~k~0#1|) 1) (<= 3 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 12))))} is VALID [2022-02-20 14:26:12,316 INFO L290 TraceCheckUtils]: 22: Hoare triple {3018#(and (= (+ (- 1) |ULTIMATE.start_main_~k~0#1|) 1) (<= 3 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 12))))} assume !(0 == __VERIFIER_assert_~cond#1); {3018#(and (= (+ (- 1) |ULTIMATE.start_main_~k~0#1|) 1) (<= 3 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 12))))} is VALID [2022-02-20 14:26:12,316 INFO L290 TraceCheckUtils]: 23: Hoare triple {3018#(and (= (+ (- 1) |ULTIMATE.start_main_~k~0#1|) 1) (<= 3 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 12))))} assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem7#1; {3018#(and (= (+ (- 1) |ULTIMATE.start_main_~k~0#1|) 1) (<= 3 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 12))))} is VALID [2022-02-20 14:26:12,317 INFO L290 TraceCheckUtils]: 24: Hoare triple {3018#(and (= (+ (- 1) |ULTIMATE.start_main_~k~0#1|) 1) (<= 3 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 12))))} main_#t~post6#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {3031#(and (= 3 |ULTIMATE.start_main_~k~0#1|) (<= 3 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 12))))} is VALID [2022-02-20 14:26:12,317 INFO L290 TraceCheckUtils]: 25: Hoare triple {3031#(and (= 3 |ULTIMATE.start_main_~k~0#1|) (<= 3 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 12))))} assume !!(main_~k~0#1 < main_~i~0#1);call main_#t~mem7#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~k~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem7#1 >= 0 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {3035#(<= 1 |ULTIMATE.start___VERIFIER_assert_~cond#1|)} is VALID [2022-02-20 14:26:12,318 INFO L290 TraceCheckUtils]: 26: Hoare triple {3035#(<= 1 |ULTIMATE.start___VERIFIER_assert_~cond#1|)} assume 0 == __VERIFIER_assert_~cond#1; {2933#false} is VALID [2022-02-20 14:26:12,318 INFO L290 TraceCheckUtils]: 27: Hoare triple {2933#false} assume !false; {2933#false} is VALID [2022-02-20 14:26:12,318 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 14:26:12,318 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 14:26:12,583 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 16 treesize of output 14 [2022-02-20 14:26:12,597 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 28 [2022-02-20 14:26:13,062 INFO L290 TraceCheckUtils]: 27: Hoare triple {2933#false} assume !false; {2933#false} is VALID [2022-02-20 14:26:13,062 INFO L290 TraceCheckUtils]: 26: Hoare triple {3035#(<= 1 |ULTIMATE.start___VERIFIER_assert_~cond#1|)} assume 0 == __VERIFIER_assert_~cond#1; {2933#false} is VALID [2022-02-20 14:26:13,063 INFO L290 TraceCheckUtils]: 25: Hoare triple {3048#(<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ (* |ULTIMATE.start_main_~k~0#1| 4) |ULTIMATE.start_main_~#a~0#1.offset|)))} assume !!(main_~k~0#1 < main_~i~0#1);call main_#t~mem7#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~k~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem7#1 >= 0 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {3035#(<= 1 |ULTIMATE.start___VERIFIER_assert_~cond#1|)} is VALID [2022-02-20 14:26:13,063 INFO L290 TraceCheckUtils]: 24: Hoare triple {3052#(<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ (* |ULTIMATE.start_main_~k~0#1| 4) |ULTIMATE.start_main_~#a~0#1.offset| 4)))} main_#t~post6#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {3048#(<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ (* |ULTIMATE.start_main_~k~0#1| 4) |ULTIMATE.start_main_~#a~0#1.offset|)))} is VALID [2022-02-20 14:26:13,064 INFO L290 TraceCheckUtils]: 23: Hoare triple {3052#(<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ (* |ULTIMATE.start_main_~k~0#1| 4) |ULTIMATE.start_main_~#a~0#1.offset| 4)))} assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem7#1; {3052#(<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ (* |ULTIMATE.start_main_~k~0#1| 4) |ULTIMATE.start_main_~#a~0#1.offset| 4)))} is VALID [2022-02-20 14:26:13,064 INFO L290 TraceCheckUtils]: 22: Hoare triple {3052#(<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ (* |ULTIMATE.start_main_~k~0#1| 4) |ULTIMATE.start_main_~#a~0#1.offset| 4)))} assume !(0 == __VERIFIER_assert_~cond#1); {3052#(<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ (* |ULTIMATE.start_main_~k~0#1| 4) |ULTIMATE.start_main_~#a~0#1.offset| 4)))} is VALID [2022-02-20 14:26:13,065 INFO L290 TraceCheckUtils]: 21: Hoare triple {3052#(<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ (* |ULTIMATE.start_main_~k~0#1| 4) |ULTIMATE.start_main_~#a~0#1.offset| 4)))} assume !!(main_~k~0#1 < main_~i~0#1);call main_#t~mem7#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~k~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem7#1 >= 0 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {3052#(<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ (* |ULTIMATE.start_main_~k~0#1| 4) |ULTIMATE.start_main_~#a~0#1.offset| 4)))} is VALID [2022-02-20 14:26:13,065 INFO L290 TraceCheckUtils]: 20: Hoare triple {3065#(<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ (* |ULTIMATE.start_main_~k~0#1| 4) |ULTIMATE.start_main_~#a~0#1.offset| 8)))} main_#t~post6#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {3052#(<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ (* |ULTIMATE.start_main_~k~0#1| 4) |ULTIMATE.start_main_~#a~0#1.offset| 4)))} is VALID [2022-02-20 14:26:13,066 INFO L290 TraceCheckUtils]: 19: Hoare triple {3065#(<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ (* |ULTIMATE.start_main_~k~0#1| 4) |ULTIMATE.start_main_~#a~0#1.offset| 8)))} assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem7#1; {3065#(<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ (* |ULTIMATE.start_main_~k~0#1| 4) |ULTIMATE.start_main_~#a~0#1.offset| 8)))} is VALID [2022-02-20 14:26:13,066 INFO L290 TraceCheckUtils]: 18: Hoare triple {3065#(<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ (* |ULTIMATE.start_main_~k~0#1| 4) |ULTIMATE.start_main_~#a~0#1.offset| 8)))} assume !(0 == __VERIFIER_assert_~cond#1); {3065#(<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ (* |ULTIMATE.start_main_~k~0#1| 4) |ULTIMATE.start_main_~#a~0#1.offset| 8)))} is VALID [2022-02-20 14:26:13,066 INFO L290 TraceCheckUtils]: 17: Hoare triple {3065#(<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ (* |ULTIMATE.start_main_~k~0#1| 4) |ULTIMATE.start_main_~#a~0#1.offset| 8)))} assume !!(main_~k~0#1 < main_~i~0#1);call main_#t~mem7#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~k~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem7#1 >= 0 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {3065#(<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ (* |ULTIMATE.start_main_~k~0#1| 4) |ULTIMATE.start_main_~#a~0#1.offset| 8)))} is VALID [2022-02-20 14:26:13,067 INFO L290 TraceCheckUtils]: 16: Hoare triple {3078#(<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 12)))} main_~k~0#1 := 1; {3065#(<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ (* |ULTIMATE.start_main_~k~0#1| 4) |ULTIMATE.start_main_~#a~0#1.offset| 8)))} is VALID [2022-02-20 14:26:13,067 INFO L290 TraceCheckUtils]: 15: Hoare triple {3078#(<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 12)))} assume 0 != main_~x~0#1; {3078#(<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 12)))} is VALID [2022-02-20 14:26:13,067 INFO L290 TraceCheckUtils]: 14: Hoare triple {3078#(<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 12)))} assume !!(main_~i~0#1 < ~N~0);assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~x~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {3078#(<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 12)))} is VALID [2022-02-20 14:26:13,068 INFO L290 TraceCheckUtils]: 13: Hoare triple {3078#(<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 12)))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {3078#(<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 12)))} is VALID [2022-02-20 14:26:13,068 INFO L290 TraceCheckUtils]: 12: Hoare triple {3091#(and (<= 0 |ULTIMATE.start_main_~j~0#1|) (forall ((|ULTIMATE.start_main_~#a~0#1.offset| Int)) (= (+ |ULTIMATE.start_main_~#a~0#1.offset| 12) (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))))} assume !(0 != main_~x~0#1);call write~int(main_~j~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~j~0#1 := main_~j~0#1 + main_~i~0#1; {3078#(<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 12)))} is VALID [2022-02-20 14:26:13,069 INFO L290 TraceCheckUtils]: 11: Hoare triple {3091#(and (<= 0 |ULTIMATE.start_main_~j~0#1|) (forall ((|ULTIMATE.start_main_~#a~0#1.offset| Int)) (= (+ |ULTIMATE.start_main_~#a~0#1.offset| 12) (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))))} assume !!(main_~i~0#1 < ~N~0);assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~x~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {3091#(and (<= 0 |ULTIMATE.start_main_~j~0#1|) (forall ((|ULTIMATE.start_main_~#a~0#1.offset| Int)) (= (+ |ULTIMATE.start_main_~#a~0#1.offset| 12) (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))))} is VALID [2022-02-20 14:26:13,069 INFO L290 TraceCheckUtils]: 10: Hoare triple {3098#(and (<= 0 |ULTIMATE.start_main_~j~0#1|) (forall ((|ULTIMATE.start_main_~#a~0#1.offset| Int)) (= (+ |ULTIMATE.start_main_~#a~0#1.offset| 12) (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 4))))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {3091#(and (<= 0 |ULTIMATE.start_main_~j~0#1|) (forall ((|ULTIMATE.start_main_~#a~0#1.offset| Int)) (= (+ |ULTIMATE.start_main_~#a~0#1.offset| 12) (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))))} is VALID [2022-02-20 14:26:13,071 INFO L290 TraceCheckUtils]: 9: Hoare triple {3102#(and (<= 0 (+ |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~j~0#1|)) (forall ((|ULTIMATE.start_main_~#a~0#1.offset| Int)) (= (+ |ULTIMATE.start_main_~#a~0#1.offset| 12) (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 4))))} assume !(0 != main_~x~0#1);call write~int(main_~j~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~j~0#1 := main_~j~0#1 + main_~i~0#1; {3098#(and (<= 0 |ULTIMATE.start_main_~j~0#1|) (forall ((|ULTIMATE.start_main_~#a~0#1.offset| Int)) (= (+ |ULTIMATE.start_main_~#a~0#1.offset| 12) (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 4))))} is VALID [2022-02-20 14:26:13,072 INFO L290 TraceCheckUtils]: 8: Hoare triple {3102#(and (<= 0 (+ |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~j~0#1|)) (forall ((|ULTIMATE.start_main_~#a~0#1.offset| Int)) (= (+ |ULTIMATE.start_main_~#a~0#1.offset| 12) (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 4))))} assume !!(main_~i~0#1 < ~N~0);assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~x~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {3102#(and (<= 0 (+ |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~j~0#1|)) (forall ((|ULTIMATE.start_main_~#a~0#1.offset| Int)) (= (+ |ULTIMATE.start_main_~#a~0#1.offset| 12) (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 4))))} is VALID [2022-02-20 14:26:13,072 INFO L290 TraceCheckUtils]: 7: Hoare triple {3109#(and (<= 0 (+ |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~j~0#1| 1)) (forall ((|ULTIMATE.start_main_~#a~0#1.offset| Int)) (= (+ |ULTIMATE.start_main_~#a~0#1.offset| 12) (+ |ULTIMATE.start_main_~#a~0#1.offset| 8 (* |ULTIMATE.start_main_~i~0#1| 4)))))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {3102#(and (<= 0 (+ |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~j~0#1|)) (forall ((|ULTIMATE.start_main_~#a~0#1.offset| Int)) (= (+ |ULTIMATE.start_main_~#a~0#1.offset| 12) (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 4))))} is VALID [2022-02-20 14:26:13,073 INFO L290 TraceCheckUtils]: 6: Hoare triple {3113#(and (forall ((|ULTIMATE.start_main_~#a~0#1.offset| Int)) (= (+ |ULTIMATE.start_main_~#a~0#1.offset| 12) (+ |ULTIMATE.start_main_~#a~0#1.offset| 8 (* |ULTIMATE.start_main_~i~0#1| 4)))) (<= 0 (+ |ULTIMATE.start_main_~j~0#1| (* 2 |ULTIMATE.start_main_~i~0#1|) 1)))} assume !(0 != main_~x~0#1);call write~int(main_~j~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~j~0#1 := main_~j~0#1 + main_~i~0#1; {3109#(and (<= 0 (+ |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~j~0#1| 1)) (forall ((|ULTIMATE.start_main_~#a~0#1.offset| Int)) (= (+ |ULTIMATE.start_main_~#a~0#1.offset| 12) (+ |ULTIMATE.start_main_~#a~0#1.offset| 8 (* |ULTIMATE.start_main_~i~0#1| 4)))))} is VALID [2022-02-20 14:26:13,073 INFO L290 TraceCheckUtils]: 5: Hoare triple {3113#(and (forall ((|ULTIMATE.start_main_~#a~0#1.offset| Int)) (= (+ |ULTIMATE.start_main_~#a~0#1.offset| 12) (+ |ULTIMATE.start_main_~#a~0#1.offset| 8 (* |ULTIMATE.start_main_~i~0#1| 4)))) (<= 0 (+ |ULTIMATE.start_main_~j~0#1| (* 2 |ULTIMATE.start_main_~i~0#1|) 1)))} assume !!(main_~i~0#1 < ~N~0);assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~x~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {3113#(and (forall ((|ULTIMATE.start_main_~#a~0#1.offset| Int)) (= (+ |ULTIMATE.start_main_~#a~0#1.offset| 12) (+ |ULTIMATE.start_main_~#a~0#1.offset| 8 (* |ULTIMATE.start_main_~i~0#1| 4)))) (<= 0 (+ |ULTIMATE.start_main_~j~0#1| (* 2 |ULTIMATE.start_main_~i~0#1|) 1)))} is VALID [2022-02-20 14:26:13,074 INFO L290 TraceCheckUtils]: 4: Hoare triple {3120#(and (forall ((|ULTIMATE.start_main_~#a~0#1.offset| Int)) (= (+ |ULTIMATE.start_main_~#a~0#1.offset| 12) (+ |ULTIMATE.start_main_~#a~0#1.offset| 12 (* |ULTIMATE.start_main_~i~0#1| 4)))) (<= 0 (+ 3 |ULTIMATE.start_main_~j~0#1| (* 2 |ULTIMATE.start_main_~i~0#1|))))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {3113#(and (forall ((|ULTIMATE.start_main_~#a~0#1.offset| Int)) (= (+ |ULTIMATE.start_main_~#a~0#1.offset| 12) (+ |ULTIMATE.start_main_~#a~0#1.offset| 8 (* |ULTIMATE.start_main_~i~0#1| 4)))) (<= 0 (+ |ULTIMATE.start_main_~j~0#1| (* 2 |ULTIMATE.start_main_~i~0#1|) 1)))} is VALID [2022-02-20 14:26:13,074 INFO L290 TraceCheckUtils]: 3: Hoare triple {3120#(and (forall ((|ULTIMATE.start_main_~#a~0#1.offset| Int)) (= (+ |ULTIMATE.start_main_~#a~0#1.offset| 12) (+ |ULTIMATE.start_main_~#a~0#1.offset| 12 (* |ULTIMATE.start_main_~i~0#1| 4)))) (<= 0 (+ 3 |ULTIMATE.start_main_~j~0#1| (* 2 |ULTIMATE.start_main_~i~0#1|))))} assume !(0 != main_~x~0#1);call write~int(main_~j~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~j~0#1 := main_~j~0#1 + main_~i~0#1; {3120#(and (forall ((|ULTIMATE.start_main_~#a~0#1.offset| Int)) (= (+ |ULTIMATE.start_main_~#a~0#1.offset| 12) (+ |ULTIMATE.start_main_~#a~0#1.offset| 12 (* |ULTIMATE.start_main_~i~0#1| 4)))) (<= 0 (+ 3 |ULTIMATE.start_main_~j~0#1| (* 2 |ULTIMATE.start_main_~i~0#1|))))} is VALID [2022-02-20 14:26:13,075 INFO L290 TraceCheckUtils]: 2: Hoare triple {3120#(and (forall ((|ULTIMATE.start_main_~#a~0#1.offset| Int)) (= (+ |ULTIMATE.start_main_~#a~0#1.offset| 12) (+ |ULTIMATE.start_main_~#a~0#1.offset| 12 (* |ULTIMATE.start_main_~i~0#1| 4)))) (<= 0 (+ 3 |ULTIMATE.start_main_~j~0#1| (* 2 |ULTIMATE.start_main_~i~0#1|))))} assume !!(main_~i~0#1 < ~N~0);assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~x~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {3120#(and (forall ((|ULTIMATE.start_main_~#a~0#1.offset| Int)) (= (+ |ULTIMATE.start_main_~#a~0#1.offset| 12) (+ |ULTIMATE.start_main_~#a~0#1.offset| 12 (* |ULTIMATE.start_main_~i~0#1| 4)))) (<= 0 (+ 3 |ULTIMATE.start_main_~j~0#1| (* 2 |ULTIMATE.start_main_~i~0#1|))))} is VALID [2022-02-20 14:26:13,075 INFO L290 TraceCheckUtils]: 1: Hoare triple {2932#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~post4#1, main_~x~0#1, main_#t~mem7#1, main_#t~post6#1, main_~k~0#1, main_~i~0#1, main_~j~0#1, main_~#a~0#1.base, main_~#a~0#1.offset;havoc main_~i~0#1;main_~j~0#1 := 0;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4 * ~N~0);main_~i~0#1 := 0; {3120#(and (forall ((|ULTIMATE.start_main_~#a~0#1.offset| Int)) (= (+ |ULTIMATE.start_main_~#a~0#1.offset| 12) (+ |ULTIMATE.start_main_~#a~0#1.offset| 12 (* |ULTIMATE.start_main_~i~0#1| 4)))) (<= 0 (+ 3 |ULTIMATE.start_main_~j~0#1| (* 2 |ULTIMATE.start_main_~i~0#1|))))} is VALID [2022-02-20 14:26:13,076 INFO L290 TraceCheckUtils]: 0: Hoare triple {2932#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2);call #Ultimate.allocInit(12, 3);~N~0 := 100000; {2932#true} is VALID [2022-02-20 14:26:13,076 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 14:26:13,076 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [803967698] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 14:26:13,076 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 14:26:13,076 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 13] total 36 [2022-02-20 14:26:13,077 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580979612] [2022-02-20 14:26:13,077 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 14:26:13,077 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 2.1944444444444446) internal successors, (79), 36 states have internal predecessors, (79), 0 states have call successors, (0), 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-02-20 14:26:13,078 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:26:13,078 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 36 states, 36 states have (on average 2.1944444444444446) internal successors, (79), 36 states have internal predecessors, (79), 0 states have call successors, (0), 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-02-20 14:26:13,136 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:26:13,136 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-02-20 14:26:13,136 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:26:13,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-02-20 14:26:13,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=1130, Unknown=0, NotChecked=0, Total=1260 [2022-02-20 14:26:13,138 INFO L87 Difference]: Start difference. First operand 47 states and 54 transitions. Second operand has 36 states, 36 states have (on average 2.1944444444444446) internal successors, (79), 36 states have internal predecessors, (79), 0 states have call successors, (0), 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-02-20 14:26:13,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:26:13,936 INFO L93 Difference]: Finished difference Result 64 states and 71 transitions. [2022-02-20 14:26:13,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-02-20 14:26:13,937 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 2.1944444444444446) internal successors, (79), 36 states have internal predecessors, (79), 0 states have call successors, (0), 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-02-20 14:26:13,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:26:13,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 36 states have (on average 2.1944444444444446) internal successors, (79), 36 states have internal predecessors, (79), 0 states have call successors, (0), 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-02-20 14:26:13,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 46 transitions. [2022-02-20 14:26:13,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 36 states have (on average 2.1944444444444446) internal successors, (79), 36 states have internal predecessors, (79), 0 states have call successors, (0), 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-02-20 14:26:13,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 46 transitions. [2022-02-20 14:26:13,938 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states and 46 transitions. [2022-02-20 14:26:13,979 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:26:13,980 INFO L225 Difference]: With dead ends: 64 [2022-02-20 14:26:13,980 INFO L226 Difference]: Without dead ends: 48 [2022-02-20 14:26:13,981 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 32 SyntacticMatches, 3 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 511 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=198, Invalid=1608, Unknown=0, NotChecked=0, Total=1806 [2022-02-20 14:26:13,981 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 30 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 303 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 408 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 78 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 14:26:13,981 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 175 Invalid, 408 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 303 Invalid, 0 Unknown, 78 Unchecked, 0.2s Time] [2022-02-20 14:26:13,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-02-20 14:26:14,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 47. [2022-02-20 14:26:14,031 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:26:14,031 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand has 47 states, 46 states have (on average 1.1521739130434783) internal successors, (53), 46 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:26:14,031 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand has 47 states, 46 states have (on average 1.1521739130434783) internal successors, (53), 46 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:26:14,031 INFO L87 Difference]: Start difference. First operand 48 states. Second operand has 47 states, 46 states have (on average 1.1521739130434783) internal successors, (53), 46 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:26:14,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:26:14,032 INFO L93 Difference]: Finished difference Result 48 states and 54 transitions. [2022-02-20 14:26:14,032 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 54 transitions. [2022-02-20 14:26:14,032 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:26:14,032 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:26:14,032 INFO L74 IsIncluded]: Start isIncluded. First operand has 47 states, 46 states have (on average 1.1521739130434783) internal successors, (53), 46 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 48 states. [2022-02-20 14:26:14,033 INFO L87 Difference]: Start difference. First operand has 47 states, 46 states have (on average 1.1521739130434783) internal successors, (53), 46 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 48 states. [2022-02-20 14:26:14,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:26:14,033 INFO L93 Difference]: Finished difference Result 48 states and 54 transitions. [2022-02-20 14:26:14,033 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 54 transitions. [2022-02-20 14:26:14,033 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:26:14,033 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:26:14,033 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:26:14,033 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:26:14,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 46 states have (on average 1.1521739130434783) internal successors, (53), 46 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:26:14,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 53 transitions. [2022-02-20 14:26:14,034 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 53 transitions. Word has length 28 [2022-02-20 14:26:14,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:26:14,034 INFO L470 AbstractCegarLoop]: Abstraction has 47 states and 53 transitions. [2022-02-20 14:26:14,035 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 2.1944444444444446) internal successors, (79), 36 states have internal predecessors, (79), 0 states have call successors, (0), 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-02-20 14:26:14,035 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 53 transitions. [2022-02-20 14:26:14,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-02-20 14:26:14,035 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:26:14,035 INFO L514 BasicCegarLoop]: trace histogram [7, 6, 6, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:26:14,064 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-02-20 14:26:14,252 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:26:14,253 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:26:14,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:26:14,253 INFO L85 PathProgramCache]: Analyzing trace with hash 13772134, now seen corresponding path program 5 times [2022-02-20 14:26:14,253 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:26:14,253 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364060225] [2022-02-20 14:26:14,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:26:14,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:26:14,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:26:14,468 INFO L290 TraceCheckUtils]: 0: Hoare triple {3386#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2);call #Ultimate.allocInit(12, 3);~N~0 := 100000; {3386#true} is VALID [2022-02-20 14:26:14,468 INFO L290 TraceCheckUtils]: 1: Hoare triple {3386#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~post4#1, main_~x~0#1, main_#t~mem7#1, main_#t~post6#1, main_~k~0#1, main_~i~0#1, main_~j~0#1, main_~#a~0#1.base, main_~#a~0#1.offset;havoc main_~i~0#1;main_~j~0#1 := 0;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4 * ~N~0);main_~i~0#1 := 0; {3388#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-20 14:26:14,469 INFO L290 TraceCheckUtils]: 2: Hoare triple {3388#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~j~0#1| 0))} assume !!(main_~i~0#1 < ~N~0);assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~x~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {3388#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-20 14:26:14,469 INFO L290 TraceCheckUtils]: 3: Hoare triple {3388#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~j~0#1| 0))} assume !(0 != main_~x~0#1);call write~int(main_~j~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~j~0#1 := main_~j~0#1 + main_~i~0#1; {3389#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~j~0#1|))} is VALID [2022-02-20 14:26:14,470 INFO L290 TraceCheckUtils]: 4: Hoare triple {3389#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~j~0#1|))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {3390#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= 1 (+ |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~j~0#1|)) (<= |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-20 14:26:14,470 INFO L290 TraceCheckUtils]: 5: Hoare triple {3390#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= 1 (+ |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~j~0#1|)) (<= |ULTIMATE.start_main_~i~0#1| 1))} assume !!(main_~i~0#1 < ~N~0);assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~x~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {3390#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= 1 (+ |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~j~0#1|)) (<= |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-20 14:26:14,471 INFO L290 TraceCheckUtils]: 6: Hoare triple {3390#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= 1 (+ |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~j~0#1|)) (<= |ULTIMATE.start_main_~i~0#1| 1))} assume !(0 != main_~x~0#1);call write~int(main_~j~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~j~0#1 := main_~j~0#1 + main_~i~0#1; {3391#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= 1 |ULTIMATE.start_main_~j~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-20 14:26:14,471 INFO L290 TraceCheckUtils]: 7: Hoare triple {3391#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= 1 |ULTIMATE.start_main_~j~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 1))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {3392#(and (<= |ULTIMATE.start_main_~i~0#1| 2) (<= 1 |ULTIMATE.start_main_~j~0#1|) (<= 2 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-20 14:26:14,472 INFO L290 TraceCheckUtils]: 8: Hoare triple {3392#(and (<= |ULTIMATE.start_main_~i~0#1| 2) (<= 1 |ULTIMATE.start_main_~j~0#1|) (<= 2 |ULTIMATE.start_main_~i~0#1|))} assume !!(main_~i~0#1 < ~N~0);assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~x~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {3392#(and (<= |ULTIMATE.start_main_~i~0#1| 2) (<= 1 |ULTIMATE.start_main_~j~0#1|) (<= 2 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-20 14:26:14,472 INFO L290 TraceCheckUtils]: 9: Hoare triple {3392#(and (<= |ULTIMATE.start_main_~i~0#1| 2) (<= 1 |ULTIMATE.start_main_~j~0#1|) (<= 2 |ULTIMATE.start_main_~i~0#1|))} assume !(0 != main_~x~0#1);call write~int(main_~j~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~j~0#1 := main_~j~0#1 + main_~i~0#1; {3393#(and (<= 1 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (<= |ULTIMATE.start_main_~i~0#1| 2) (<= 2 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-20 14:26:14,473 INFO L290 TraceCheckUtils]: 10: Hoare triple {3393#(and (<= 1 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (<= |ULTIMATE.start_main_~i~0#1| 2) (<= 2 |ULTIMATE.start_main_~i~0#1|))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {3394#(and (<= 3 |ULTIMATE.start_main_~i~0#1|) (<= 1 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 8))))} is VALID [2022-02-20 14:26:14,473 INFO L290 TraceCheckUtils]: 11: Hoare triple {3394#(and (<= 3 |ULTIMATE.start_main_~i~0#1|) (<= 1 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 8))))} assume !!(main_~i~0#1 < ~N~0);assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~x~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {3394#(and (<= 3 |ULTIMATE.start_main_~i~0#1|) (<= 1 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 8))))} is VALID [2022-02-20 14:26:14,474 INFO L290 TraceCheckUtils]: 12: Hoare triple {3394#(and (<= 3 |ULTIMATE.start_main_~i~0#1|) (<= 1 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 8))))} assume !(0 != main_~x~0#1);call write~int(main_~j~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~j~0#1 := main_~j~0#1 + main_~i~0#1; {3394#(and (<= 3 |ULTIMATE.start_main_~i~0#1|) (<= 1 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 8))))} is VALID [2022-02-20 14:26:14,474 INFO L290 TraceCheckUtils]: 13: Hoare triple {3394#(and (<= 3 |ULTIMATE.start_main_~i~0#1|) (<= 1 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 8))))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {3395#(and (<= 1 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 8))) (<= 4 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-20 14:26:14,475 INFO L290 TraceCheckUtils]: 14: Hoare triple {3395#(and (<= 1 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 8))) (<= 4 |ULTIMATE.start_main_~i~0#1|))} assume !!(main_~i~0#1 < ~N~0);assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~x~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {3395#(and (<= 1 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 8))) (<= 4 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-20 14:26:14,476 INFO L290 TraceCheckUtils]: 15: Hoare triple {3395#(and (<= 1 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 8))) (<= 4 |ULTIMATE.start_main_~i~0#1|))} assume !(0 != main_~x~0#1);call write~int(main_~j~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~j~0#1 := main_~j~0#1 + main_~i~0#1; {3395#(and (<= 1 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 8))) (<= 4 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-20 14:26:14,476 INFO L290 TraceCheckUtils]: 16: Hoare triple {3395#(and (<= 1 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 8))) (<= 4 |ULTIMATE.start_main_~i~0#1|))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {3396#(and (not (= (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)) (+ |ULTIMATE.start_main_~#a~0#1.offset| 8))) (<= 1 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 8))))} is VALID [2022-02-20 14:26:14,476 INFO L290 TraceCheckUtils]: 17: Hoare triple {3396#(and (not (= (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)) (+ |ULTIMATE.start_main_~#a~0#1.offset| 8))) (<= 1 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 8))))} assume !!(main_~i~0#1 < ~N~0);assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~x~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {3396#(and (not (= (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)) (+ |ULTIMATE.start_main_~#a~0#1.offset| 8))) (<= 1 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 8))))} is VALID [2022-02-20 14:26:14,477 INFO L290 TraceCheckUtils]: 18: Hoare triple {3396#(and (not (= (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)) (+ |ULTIMATE.start_main_~#a~0#1.offset| 8))) (<= 1 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 8))))} assume !(0 != main_~x~0#1);call write~int(main_~j~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~j~0#1 := main_~j~0#1 + main_~i~0#1; {3397#(<= 1 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 8)))} is VALID [2022-02-20 14:26:14,478 INFO L290 TraceCheckUtils]: 19: Hoare triple {3397#(<= 1 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 8)))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {3397#(<= 1 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 8)))} is VALID [2022-02-20 14:26:14,478 INFO L290 TraceCheckUtils]: 20: Hoare triple {3397#(<= 1 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 8)))} assume !!(main_~i~0#1 < ~N~0);assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~x~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {3397#(<= 1 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 8)))} is VALID [2022-02-20 14:26:14,478 INFO L290 TraceCheckUtils]: 21: Hoare triple {3397#(<= 1 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 8)))} assume 0 != main_~x~0#1; {3397#(<= 1 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 8)))} is VALID [2022-02-20 14:26:14,479 INFO L290 TraceCheckUtils]: 22: Hoare triple {3397#(<= 1 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 8)))} main_~k~0#1 := 1; {3398#(and (<= 1 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 8))) (= (+ (- 1) |ULTIMATE.start_main_~k~0#1|) 0))} is VALID [2022-02-20 14:26:14,479 INFO L290 TraceCheckUtils]: 23: Hoare triple {3398#(and (<= 1 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 8))) (= (+ (- 1) |ULTIMATE.start_main_~k~0#1|) 0))} assume !!(main_~k~0#1 < main_~i~0#1);call main_#t~mem7#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~k~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem7#1 >= 0 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {3398#(and (<= 1 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 8))) (= (+ (- 1) |ULTIMATE.start_main_~k~0#1|) 0))} is VALID [2022-02-20 14:26:14,480 INFO L290 TraceCheckUtils]: 24: Hoare triple {3398#(and (<= 1 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 8))) (= (+ (- 1) |ULTIMATE.start_main_~k~0#1|) 0))} assume !(0 == __VERIFIER_assert_~cond#1); {3398#(and (<= 1 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 8))) (= (+ (- 1) |ULTIMATE.start_main_~k~0#1|) 0))} is VALID [2022-02-20 14:26:14,480 INFO L290 TraceCheckUtils]: 25: Hoare triple {3398#(and (<= 1 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 8))) (= (+ (- 1) |ULTIMATE.start_main_~k~0#1|) 0))} assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem7#1; {3398#(and (<= 1 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 8))) (= (+ (- 1) |ULTIMATE.start_main_~k~0#1|) 0))} is VALID [2022-02-20 14:26:14,481 INFO L290 TraceCheckUtils]: 26: Hoare triple {3398#(and (<= 1 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 8))) (= (+ (- 1) |ULTIMATE.start_main_~k~0#1|) 0))} main_#t~post6#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {3399#(<= 1 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ (* |ULTIMATE.start_main_~k~0#1| 4) |ULTIMATE.start_main_~#a~0#1.offset|)))} is VALID [2022-02-20 14:26:14,481 INFO L290 TraceCheckUtils]: 27: Hoare triple {3399#(<= 1 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ (* |ULTIMATE.start_main_~k~0#1| 4) |ULTIMATE.start_main_~#a~0#1.offset|)))} assume !!(main_~k~0#1 < main_~i~0#1);call main_#t~mem7#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~k~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem7#1 >= 0 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {3400#(not (= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0))} is VALID [2022-02-20 14:26:14,481 INFO L290 TraceCheckUtils]: 28: Hoare triple {3400#(not (= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0))} assume 0 == __VERIFIER_assert_~cond#1; {3387#false} is VALID [2022-02-20 14:26:14,482 INFO L290 TraceCheckUtils]: 29: Hoare triple {3387#false} assume !false; {3387#false} is VALID [2022-02-20 14:26:14,482 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 3 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 14:26:14,482 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:26:14,482 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364060225] [2022-02-20 14:26:14,483 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1364060225] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 14:26:14,483 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [838467843] [2022-02-20 14:26:14,483 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-02-20 14:26:14,483 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:26:14,483 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:26:14,500 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-02-20 14:26:14,524 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-02-20 14:26:14,588 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2022-02-20 14:26:14,588 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 14:26:14,589 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 29 conjunts are in the unsatisfiable core [2022-02-20 14:26:14,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:26:14,601 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:26:14,728 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-02-20 14:26:14,836 INFO L356 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-02-20 14:26:14,836 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-02-20 14:26:14,879 INFO L356 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-02-20 14:26:14,880 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-02-20 14:26:14,954 INFO L356 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-02-20 14:26:14,954 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-02-20 14:26:15,136 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-02-20 14:26:15,204 INFO L290 TraceCheckUtils]: 0: Hoare triple {3386#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2);call #Ultimate.allocInit(12, 3);~N~0 := 100000; {3386#true} is VALID [2022-02-20 14:26:15,205 INFO L290 TraceCheckUtils]: 1: Hoare triple {3386#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~post4#1, main_~x~0#1, main_#t~mem7#1, main_#t~post6#1, main_~k~0#1, main_~i~0#1, main_~j~0#1, main_~#a~0#1.base, main_~#a~0#1.offset;havoc main_~i~0#1;main_~j~0#1 := 0;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4 * ~N~0);main_~i~0#1 := 0; {3389#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~j~0#1|))} is VALID [2022-02-20 14:26:15,205 INFO L290 TraceCheckUtils]: 2: Hoare triple {3389#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~j~0#1|))} assume !!(main_~i~0#1 < ~N~0);assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~x~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {3389#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~j~0#1|))} is VALID [2022-02-20 14:26:15,206 INFO L290 TraceCheckUtils]: 3: Hoare triple {3389#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~j~0#1|))} assume !(0 != main_~x~0#1);call write~int(main_~j~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~j~0#1 := main_~j~0#1 + main_~i~0#1; {3389#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~j~0#1|))} is VALID [2022-02-20 14:26:15,206 INFO L290 TraceCheckUtils]: 4: Hoare triple {3389#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~j~0#1|))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {3390#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= 1 (+ |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~j~0#1|)) (<= |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-20 14:26:15,207 INFO L290 TraceCheckUtils]: 5: Hoare triple {3390#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= 1 (+ |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~j~0#1|)) (<= |ULTIMATE.start_main_~i~0#1| 1))} assume !!(main_~i~0#1 < ~N~0);assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~x~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {3390#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= 1 (+ |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~j~0#1|)) (<= |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-20 14:26:15,207 INFO L290 TraceCheckUtils]: 6: Hoare triple {3390#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= 1 (+ |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~j~0#1|)) (<= |ULTIMATE.start_main_~i~0#1| 1))} assume !(0 != main_~x~0#1);call write~int(main_~j~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~j~0#1 := main_~j~0#1 + main_~i~0#1; {3391#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= 1 |ULTIMATE.start_main_~j~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-20 14:26:15,208 INFO L290 TraceCheckUtils]: 7: Hoare triple {3391#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= 1 |ULTIMATE.start_main_~j~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 1))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {3392#(and (<= |ULTIMATE.start_main_~i~0#1| 2) (<= 1 |ULTIMATE.start_main_~j~0#1|) (<= 2 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-20 14:26:15,208 INFO L290 TraceCheckUtils]: 8: Hoare triple {3392#(and (<= |ULTIMATE.start_main_~i~0#1| 2) (<= 1 |ULTIMATE.start_main_~j~0#1|) (<= 2 |ULTIMATE.start_main_~i~0#1|))} assume !!(main_~i~0#1 < ~N~0);assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~x~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {3392#(and (<= |ULTIMATE.start_main_~i~0#1| 2) (<= 1 |ULTIMATE.start_main_~j~0#1|) (<= 2 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-20 14:26:15,236 INFO L290 TraceCheckUtils]: 9: Hoare triple {3392#(and (<= |ULTIMATE.start_main_~i~0#1| 2) (<= 1 |ULTIMATE.start_main_~j~0#1|) (<= 2 |ULTIMATE.start_main_~i~0#1|))} assume !(0 != main_~x~0#1);call write~int(main_~j~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~j~0#1 := main_~j~0#1 + main_~i~0#1; {3393#(and (<= 1 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (<= |ULTIMATE.start_main_~i~0#1| 2) (<= 2 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-20 14:26:15,237 INFO L290 TraceCheckUtils]: 10: Hoare triple {3393#(and (<= 1 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (<= |ULTIMATE.start_main_~i~0#1| 2) (<= 2 |ULTIMATE.start_main_~i~0#1|))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {3394#(and (<= 3 |ULTIMATE.start_main_~i~0#1|) (<= 1 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 8))))} is VALID [2022-02-20 14:26:15,237 INFO L290 TraceCheckUtils]: 11: Hoare triple {3394#(and (<= 3 |ULTIMATE.start_main_~i~0#1|) (<= 1 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 8))))} assume !!(main_~i~0#1 < ~N~0);assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~x~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {3394#(and (<= 3 |ULTIMATE.start_main_~i~0#1|) (<= 1 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 8))))} is VALID [2022-02-20 14:26:15,238 INFO L290 TraceCheckUtils]: 12: Hoare triple {3394#(and (<= 3 |ULTIMATE.start_main_~i~0#1|) (<= 1 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 8))))} assume !(0 != main_~x~0#1);call write~int(main_~j~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~j~0#1 := main_~j~0#1 + main_~i~0#1; {3394#(and (<= 3 |ULTIMATE.start_main_~i~0#1|) (<= 1 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 8))))} is VALID [2022-02-20 14:26:15,238 INFO L290 TraceCheckUtils]: 13: Hoare triple {3394#(and (<= 3 |ULTIMATE.start_main_~i~0#1|) (<= 1 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 8))))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {3395#(and (<= 1 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 8))) (<= 4 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-20 14:26:15,239 INFO L290 TraceCheckUtils]: 14: Hoare triple {3395#(and (<= 1 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 8))) (<= 4 |ULTIMATE.start_main_~i~0#1|))} assume !!(main_~i~0#1 < ~N~0);assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~x~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {3395#(and (<= 1 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 8))) (<= 4 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-20 14:26:15,239 INFO L290 TraceCheckUtils]: 15: Hoare triple {3395#(and (<= 1 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 8))) (<= 4 |ULTIMATE.start_main_~i~0#1|))} assume !(0 != main_~x~0#1);call write~int(main_~j~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~j~0#1 := main_~j~0#1 + main_~i~0#1; {3395#(and (<= 1 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 8))) (<= 4 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-20 14:26:15,240 INFO L290 TraceCheckUtils]: 16: Hoare triple {3395#(and (<= 1 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 8))) (<= 4 |ULTIMATE.start_main_~i~0#1|))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {3452#(and (<= 5 |ULTIMATE.start_main_~i~0#1|) (<= 1 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 8))))} is VALID [2022-02-20 14:26:15,240 INFO L290 TraceCheckUtils]: 17: Hoare triple {3452#(and (<= 5 |ULTIMATE.start_main_~i~0#1|) (<= 1 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 8))))} assume !!(main_~i~0#1 < ~N~0);assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~x~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {3452#(and (<= 5 |ULTIMATE.start_main_~i~0#1|) (<= 1 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 8))))} is VALID [2022-02-20 14:26:15,241 INFO L290 TraceCheckUtils]: 18: Hoare triple {3452#(and (<= 5 |ULTIMATE.start_main_~i~0#1|) (<= 1 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 8))))} assume !(0 != main_~x~0#1);call write~int(main_~j~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~j~0#1 := main_~j~0#1 + main_~i~0#1; {3397#(<= 1 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 8)))} is VALID [2022-02-20 14:26:15,241 INFO L290 TraceCheckUtils]: 19: Hoare triple {3397#(<= 1 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 8)))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {3397#(<= 1 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 8)))} is VALID [2022-02-20 14:26:15,242 INFO L290 TraceCheckUtils]: 20: Hoare triple {3397#(<= 1 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 8)))} assume !!(main_~i~0#1 < ~N~0);assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~x~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {3397#(<= 1 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 8)))} is VALID [2022-02-20 14:26:15,242 INFO L290 TraceCheckUtils]: 21: Hoare triple {3397#(<= 1 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 8)))} assume 0 != main_~x~0#1; {3397#(<= 1 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 8)))} is VALID [2022-02-20 14:26:15,242 INFO L290 TraceCheckUtils]: 22: Hoare triple {3397#(<= 1 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 8)))} main_~k~0#1 := 1; {3398#(and (<= 1 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 8))) (= (+ (- 1) |ULTIMATE.start_main_~k~0#1|) 0))} is VALID [2022-02-20 14:26:15,243 INFO L290 TraceCheckUtils]: 23: Hoare triple {3398#(and (<= 1 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 8))) (= (+ (- 1) |ULTIMATE.start_main_~k~0#1|) 0))} assume !!(main_~k~0#1 < main_~i~0#1);call main_#t~mem7#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~k~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem7#1 >= 0 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {3398#(and (<= 1 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 8))) (= (+ (- 1) |ULTIMATE.start_main_~k~0#1|) 0))} is VALID [2022-02-20 14:26:15,243 INFO L290 TraceCheckUtils]: 24: Hoare triple {3398#(and (<= 1 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 8))) (= (+ (- 1) |ULTIMATE.start_main_~k~0#1|) 0))} assume !(0 == __VERIFIER_assert_~cond#1); {3398#(and (<= 1 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 8))) (= (+ (- 1) |ULTIMATE.start_main_~k~0#1|) 0))} is VALID [2022-02-20 14:26:15,244 INFO L290 TraceCheckUtils]: 25: Hoare triple {3398#(and (<= 1 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 8))) (= (+ (- 1) |ULTIMATE.start_main_~k~0#1|) 0))} assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem7#1; {3398#(and (<= 1 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 8))) (= (+ (- 1) |ULTIMATE.start_main_~k~0#1|) 0))} is VALID [2022-02-20 14:26:15,244 INFO L290 TraceCheckUtils]: 26: Hoare triple {3398#(and (<= 1 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 8))) (= (+ (- 1) |ULTIMATE.start_main_~k~0#1|) 0))} main_#t~post6#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {3483#(and (= (+ (- 2) |ULTIMATE.start_main_~k~0#1|) 0) (<= 1 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 8))))} is VALID [2022-02-20 14:26:15,245 INFO L290 TraceCheckUtils]: 27: Hoare triple {3483#(and (= (+ (- 2) |ULTIMATE.start_main_~k~0#1|) 0) (<= 1 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 8))))} assume !!(main_~k~0#1 < main_~i~0#1);call main_#t~mem7#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~k~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem7#1 >= 0 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {3487#(<= 1 |ULTIMATE.start___VERIFIER_assert_~cond#1|)} is VALID [2022-02-20 14:26:15,245 INFO L290 TraceCheckUtils]: 28: Hoare triple {3487#(<= 1 |ULTIMATE.start___VERIFIER_assert_~cond#1|)} assume 0 == __VERIFIER_assert_~cond#1; {3387#false} is VALID [2022-02-20 14:26:15,245 INFO L290 TraceCheckUtils]: 29: Hoare triple {3387#false} assume !false; {3387#false} is VALID [2022-02-20 14:26:15,245 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 7 proven. 52 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 14:26:15,245 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 14:26:17,516 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_75| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_75|)) (forall ((v_ArrVal_205 Int)) (<= 0 (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_75| 4) |c_ULTIMATE.start_main_~#a~0#1.offset|) v_ArrVal_205) (+ |c_ULTIMATE.start_main_~#a~0#1.offset| 8)))))) is different from false [2022-02-20 14:26:24,355 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_76| Int)) (or (forall ((v_ArrVal_203 Int) (|v_ULTIMATE.start_main_~i~0#1_75| Int) (v_ArrVal_205 Int)) (or (<= 0 (select (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_76| 4) |c_ULTIMATE.start_main_~#a~0#1.offset|) v_ArrVal_203) (+ (* |v_ULTIMATE.start_main_~i~0#1_75| 4) |c_ULTIMATE.start_main_~#a~0#1.offset|) v_ArrVal_205) (+ |c_ULTIMATE.start_main_~#a~0#1.offset| 8))) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_76| 1) |v_ULTIMATE.start_main_~i~0#1_75|)))) (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_76|)))) is different from false