./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-examples/standard_copy5_ground-2.i --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-examples/standard_copy5_ground-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0541c5d3cb2bb522edbd5a6d03bcb344a1d82e4bcd281d695c3c7a0d3bc33956 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 14:02:44,891 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 14:02:44,893 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 14:02:44,950 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 14:02:44,950 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 14:02:44,953 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 14:02:44,954 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 14:02:44,956 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 14:02:44,957 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 14:02:44,962 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 14:02:44,962 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 14:02:44,963 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 14:02:44,964 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 14:02:44,965 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 14:02:44,966 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 14:02:44,967 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 14:02:44,970 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 14:02:44,971 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 14:02:44,971 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 14:02:44,973 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 14:02:44,976 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 14:02:44,977 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 14:02:44,978 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 14:02:44,979 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 14:02:44,980 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 14:02:44,982 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 14:02:44,982 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 14:02:44,983 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 14:02:44,984 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 14:02:44,984 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 14:02:44,984 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 14:02:44,985 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 14:02:44,986 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 14:02:44,987 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 14:02:44,988 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 14:02:44,988 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 14:02:44,989 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 14:02:44,989 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 14:02:44,989 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 14:02:44,990 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 14:02:44,990 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 14:02:44,991 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:02:45,026 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 14:02:45,027 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 14:02:45,027 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 14:02:45,027 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 14:02:45,027 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 14:02:45,027 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 14:02:45,028 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 14:02:45,028 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 14:02:45,028 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 14:02:45,028 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 14:02:45,028 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 14:02:45,028 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 14:02:45,028 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 14:02:45,028 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 14:02:45,028 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 14:02:45,029 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 14:02:45,029 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 14:02:45,029 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 14:02:45,029 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 14:02:45,029 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 14:02:45,029 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 14:02:45,029 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 14:02:45,029 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 14:02:45,029 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 14:02:45,029 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 14:02:45,029 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 14:02:45,029 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 14:02:45,030 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 14:02:45,030 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 14:02:45,030 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 14:02:45,030 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 14:02:45,030 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 14:02:45,030 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 14:02:45,030 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 -> 0541c5d3cb2bb522edbd5a6d03bcb344a1d82e4bcd281d695c3c7a0d3bc33956 [2022-02-20 14:02:45,196 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 14:02:45,219 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 14:02:45,221 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 14:02:45,221 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 14:02:45,222 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 14:02:45,223 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-examples/standard_copy5_ground-2.i [2022-02-20 14:02:45,266 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fdae75e4c/18ad457655aa4c079afbe1e28b14eee2/FLAG98675a0c7 [2022-02-20 14:02:45,616 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 14:02:45,617 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-examples/standard_copy5_ground-2.i [2022-02-20 14:02:45,622 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fdae75e4c/18ad457655aa4c079afbe1e28b14eee2/FLAG98675a0c7 [2022-02-20 14:02:46,148 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fdae75e4c/18ad457655aa4c079afbe1e28b14eee2 [2022-02-20 14:02:46,151 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 14:02:46,152 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 14:02:46,153 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 14:02:46,153 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 14:02:46,155 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 14:02:46,156 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 02:02:46" (1/1) ... [2022-02-20 14:02:46,157 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@455eff40 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:02:46, skipping insertion in model container [2022-02-20 14:02:46,157 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 02:02:46" (1/1) ... [2022-02-20 14:02:46,328 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 14:02:46,592 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 14:02:46,762 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-examples/standard_copy5_ground-2.i[816,829] [2022-02-20 14:02:46,794 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 14:02:46,801 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 14:02:46,810 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-examples/standard_copy5_ground-2.i[816,829] [2022-02-20 14:02:46,841 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 14:02:46,864 INFO L208 MainTranslator]: Completed translation [2022-02-20 14:02:46,865 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:02:46 WrapperNode [2022-02-20 14:02:46,865 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 14:02:46,866 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 14:02:46,866 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 14:02:46,866 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 14:02:46,872 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:02:46" (1/1) ... [2022-02-20 14:02:46,885 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:02:46" (1/1) ... [2022-02-20 14:02:46,929 INFO L137 Inliner]: procedures = 16, calls = 39, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 131 [2022-02-20 14:02:46,929 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 14:02:46,930 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 14:02:46,930 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 14:02:46,930 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 14:02:46,941 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:02:46" (1/1) ... [2022-02-20 14:02:46,941 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:02:46" (1/1) ... [2022-02-20 14:02:46,952 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:02:46" (1/1) ... [2022-02-20 14:02:46,952 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:02:46" (1/1) ... [2022-02-20 14:02:46,957 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:02:46" (1/1) ... [2022-02-20 14:02:46,960 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:02:46" (1/1) ... [2022-02-20 14:02:46,961 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:02:46" (1/1) ... [2022-02-20 14:02:46,963 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 14:02:46,963 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 14:02:46,964 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 14:02:46,964 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 14:02:46,973 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:02:46" (1/1) ... [2022-02-20 14:02:46,978 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 14:02:46,987 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:02:47,009 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:02:47,043 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:02:47,057 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 14:02:47,057 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 14:02:47,058 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 14:02:47,058 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-20 14:02:47,058 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 14:02:47,058 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 14:02:47,058 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-20 14:02:47,058 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 14:02:47,305 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 14:02:47,306 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 14:02:48,132 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 14:02:48,137 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 14:02:48,142 INFO L299 CfgBuilder]: Removed 7 assume(true) statements. [2022-02-20 14:02:48,144 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 02:02:48 BoogieIcfgContainer [2022-02-20 14:02:48,149 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 14:02:48,151 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 14:02:48,151 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 14:02:48,180 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 14:02:48,181 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 02:02:46" (1/3) ... [2022-02-20 14:02:48,181 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@490c2f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 02:02:48, skipping insertion in model container [2022-02-20 14:02:48,181 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:02:46" (2/3) ... [2022-02-20 14:02:48,181 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@490c2f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 02:02:48, skipping insertion in model container [2022-02-20 14:02:48,182 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 02:02:48" (3/3) ... [2022-02-20 14:02:48,183 INFO L111 eAbstractionObserver]: Analyzing ICFG standard_copy5_ground-2.i [2022-02-20 14:02:48,187 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 14:02:48,187 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 14:02:48,856 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 14:02:48,896 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:02:48,896 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 14:02:48,936 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 28 states have (on average 1.5714285714285714) internal successors, (44), 29 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:02:48,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-02-20 14:02:48,942 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:02:48,942 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:02:48,943 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:02:48,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:02:48,952 INFO L85 PathProgramCache]: Analyzing trace with hash -18882701, now seen corresponding path program 1 times [2022-02-20 14:02:48,976 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:02:48,977 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035032789] [2022-02-20 14:02:48,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:02:48,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:02:49,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:02:49,285 INFO L290 TraceCheckUtils]: 0: Hoare triple {33#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); {33#true} is VALID [2022-02-20 14:02:49,286 INFO L290 TraceCheckUtils]: 1: Hoare triple {33#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~nondet3#1, main_#t~post1#1, main_#t~mem5#1, main_#t~post4#1, main_#t~mem7#1, main_#t~post6#1, main_#t~mem9#1, main_#t~post8#1, main_#t~mem11#1, main_#t~post10#1, main_#t~mem13#1, main_#t~post12#1, main_#t~mem15#1, main_#t~mem16#1, main_#t~post14#1, main_~#a1~0#1.base, main_~#a1~0#1.offset, main_~#a2~0#1.base, main_~#a2~0#1.offset, main_~#a3~0#1.base, main_~#a3~0#1.offset, main_~#a4~0#1.base, main_~#a4~0#1.offset, main_~#a5~0#1.base, main_~#a5~0#1.offset, main_~#a6~0#1.base, main_~#a6~0#1.offset, main_~a~0#1, main_~i~0#1, main_~x~0#1;call main_~#a1~0#1.base, main_~#a1~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a2~0#1.base, main_~#a2~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a3~0#1.base, main_~#a3~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a4~0#1.base, main_~#a4~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a5~0#1.base, main_~#a5~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a6~0#1.base, main_~#a6~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~a~0#1;main_~a~0#1 := 0; {35#(= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-20 14:02:49,287 INFO L290 TraceCheckUtils]: 2: Hoare triple {35#(= |ULTIMATE.start_main_~a~0#1| 0)} assume !(main_~a~0#1 < 100000); {34#false} is VALID [2022-02-20 14:02:49,287 INFO L290 TraceCheckUtils]: 3: Hoare triple {34#false} havoc main_~i~0#1;main_~i~0#1 := 0; {34#false} is VALID [2022-02-20 14:02:49,287 INFO L290 TraceCheckUtils]: 4: Hoare triple {34#false} assume !(main_~i~0#1 < 100000); {34#false} is VALID [2022-02-20 14:02:49,287 INFO L290 TraceCheckUtils]: 5: Hoare triple {34#false} main_~i~0#1 := 0; {34#false} is VALID [2022-02-20 14:02:49,288 INFO L290 TraceCheckUtils]: 6: Hoare triple {34#false} assume !(main_~i~0#1 < 100000); {34#false} is VALID [2022-02-20 14:02:49,288 INFO L290 TraceCheckUtils]: 7: Hoare triple {34#false} main_~i~0#1 := 0; {34#false} is VALID [2022-02-20 14:02:49,288 INFO L290 TraceCheckUtils]: 8: Hoare triple {34#false} assume !(main_~i~0#1 < 100000); {34#false} is VALID [2022-02-20 14:02:49,288 INFO L290 TraceCheckUtils]: 9: Hoare triple {34#false} main_~i~0#1 := 0; {34#false} is VALID [2022-02-20 14:02:49,288 INFO L290 TraceCheckUtils]: 10: Hoare triple {34#false} assume !(main_~i~0#1 < 100000); {34#false} is VALID [2022-02-20 14:02:49,288 INFO L290 TraceCheckUtils]: 11: Hoare triple {34#false} main_~i~0#1 := 0; {34#false} is VALID [2022-02-20 14:02:49,289 INFO L290 TraceCheckUtils]: 12: Hoare triple {34#false} assume !true; {34#false} is VALID [2022-02-20 14:02:49,289 INFO L290 TraceCheckUtils]: 13: Hoare triple {34#false} havoc main_~x~0#1;main_~x~0#1 := 0; {34#false} is VALID [2022-02-20 14:02:49,289 INFO L290 TraceCheckUtils]: 14: Hoare triple {34#false} assume !!(main_~x~0#1 < 100000);call main_#t~mem15#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~x~0#1, 4);call main_#t~mem16#1 := read~int(main_~#a6~0#1.base, main_~#a6~0#1.offset + 4 * main_~x~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem15#1 == main_#t~mem16#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {34#false} is VALID [2022-02-20 14:02:49,289 INFO L290 TraceCheckUtils]: 15: Hoare triple {34#false} assume 0 == __VERIFIER_assert_~cond#1; {34#false} is VALID [2022-02-20 14:02:49,289 INFO L290 TraceCheckUtils]: 16: Hoare triple {34#false} assume !false; {34#false} is VALID [2022-02-20 14:02:49,290 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:02:49,290 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:02:49,290 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035032789] [2022-02-20 14:02:49,291 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1035032789] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:02:49,291 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:02:49,291 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 14:02:49,292 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212202569] [2022-02-20 14:02:49,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:02:49,297 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-02-20 14:02:49,298 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:02:49,300 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:02:49,324 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:02:49,324 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 14:02:49,325 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:02:49,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 14:02:49,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 14:02:49,341 INFO L87 Difference]: Start difference. First operand has 30 states, 28 states have (on average 1.5714285714285714) internal successors, (44), 29 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:02:49,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:02:49,410 INFO L93 Difference]: Finished difference Result 58 states and 86 transitions. [2022-02-20 14:02:49,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 14:02:49,410 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-02-20 14:02:49,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:02:49,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:02:49,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 86 transitions. [2022-02-20 14:02:49,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:02:49,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 86 transitions. [2022-02-20 14:02:49,416 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 86 transitions. [2022-02-20 14:02:49,477 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 86 edges. 86 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:02:49,482 INFO L225 Difference]: With dead ends: 58 [2022-02-20 14:02:49,482 INFO L226 Difference]: Without dead ends: 28 [2022-02-20 14:02:49,485 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 14:02:49,487 INFO L933 BasicCegarLoop]: 34 mSDtfsCounter, 1 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 14:02:49,488 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 66 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 14:02:49,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-02-20 14:02:49,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2022-02-20 14:02:49,506 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:02:49,507 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand has 27 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 26 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:02:49,507 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand has 27 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 26 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:02:49,508 INFO L87 Difference]: Start difference. First operand 28 states. Second operand has 27 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 26 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:02:49,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:02:49,509 INFO L93 Difference]: Finished difference Result 28 states and 34 transitions. [2022-02-20 14:02:49,509 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2022-02-20 14:02:49,510 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:02:49,510 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:02:49,510 INFO L74 IsIncluded]: Start isIncluded. First operand has 27 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 26 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 28 states. [2022-02-20 14:02:49,510 INFO L87 Difference]: Start difference. First operand has 27 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 26 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 28 states. [2022-02-20 14:02:49,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:02:49,512 INFO L93 Difference]: Finished difference Result 28 states and 34 transitions. [2022-02-20 14:02:49,512 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2022-02-20 14:02:49,512 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:02:49,512 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:02:49,512 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:02:49,512 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:02:49,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 26 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:02:49,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 33 transitions. [2022-02-20 14:02:49,514 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 33 transitions. Word has length 17 [2022-02-20 14:02:49,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:02:49,514 INFO L470 AbstractCegarLoop]: Abstraction has 27 states and 33 transitions. [2022-02-20 14:02:49,514 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:02:49,514 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 33 transitions. [2022-02-20 14:02:49,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-02-20 14:02:49,515 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:02:49,515 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:02:49,515 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 14:02:49,515 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:02:49,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:02:49,516 INFO L85 PathProgramCache]: Analyzing trace with hash -1592499797, now seen corresponding path program 1 times [2022-02-20 14:02:49,516 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:02:49,516 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085088164] [2022-02-20 14:02:49,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:02:49,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:02:49,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:02:49,620 INFO L290 TraceCheckUtils]: 0: Hoare triple {203#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); {203#true} is VALID [2022-02-20 14:02:49,620 INFO L290 TraceCheckUtils]: 1: Hoare triple {203#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~nondet3#1, main_#t~post1#1, main_#t~mem5#1, main_#t~post4#1, main_#t~mem7#1, main_#t~post6#1, main_#t~mem9#1, main_#t~post8#1, main_#t~mem11#1, main_#t~post10#1, main_#t~mem13#1, main_#t~post12#1, main_#t~mem15#1, main_#t~mem16#1, main_#t~post14#1, main_~#a1~0#1.base, main_~#a1~0#1.offset, main_~#a2~0#1.base, main_~#a2~0#1.offset, main_~#a3~0#1.base, main_~#a3~0#1.offset, main_~#a4~0#1.base, main_~#a4~0#1.offset, main_~#a5~0#1.base, main_~#a5~0#1.offset, main_~#a6~0#1.base, main_~#a6~0#1.offset, main_~a~0#1, main_~i~0#1, main_~x~0#1;call main_~#a1~0#1.base, main_~#a1~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a2~0#1.base, main_~#a2~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a3~0#1.base, main_~#a3~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a4~0#1.base, main_~#a4~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a5~0#1.base, main_~#a5~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a6~0#1.base, main_~#a6~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~a~0#1;main_~a~0#1 := 0; {205#(= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-20 14:02:49,621 INFO L290 TraceCheckUtils]: 2: Hoare triple {205#(= |ULTIMATE.start_main_~a~0#1| 0)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {205#(= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-20 14:02:49,621 INFO L290 TraceCheckUtils]: 3: Hoare triple {205#(= |ULTIMATE.start_main_~a~0#1| 0)} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {206#(<= |ULTIMATE.start_main_~a~0#1| 1)} is VALID [2022-02-20 14:02:49,622 INFO L290 TraceCheckUtils]: 4: Hoare triple {206#(<= |ULTIMATE.start_main_~a~0#1| 1)} assume !(main_~a~0#1 < 100000); {204#false} is VALID [2022-02-20 14:02:49,622 INFO L290 TraceCheckUtils]: 5: Hoare triple {204#false} havoc main_~i~0#1;main_~i~0#1 := 0; {204#false} is VALID [2022-02-20 14:02:49,622 INFO L290 TraceCheckUtils]: 6: Hoare triple {204#false} assume !(main_~i~0#1 < 100000); {204#false} is VALID [2022-02-20 14:02:49,622 INFO L290 TraceCheckUtils]: 7: Hoare triple {204#false} main_~i~0#1 := 0; {204#false} is VALID [2022-02-20 14:02:49,623 INFO L290 TraceCheckUtils]: 8: Hoare triple {204#false} assume !(main_~i~0#1 < 100000); {204#false} is VALID [2022-02-20 14:02:49,623 INFO L290 TraceCheckUtils]: 9: Hoare triple {204#false} main_~i~0#1 := 0; {204#false} is VALID [2022-02-20 14:02:49,623 INFO L290 TraceCheckUtils]: 10: Hoare triple {204#false} assume !(main_~i~0#1 < 100000); {204#false} is VALID [2022-02-20 14:02:49,623 INFO L290 TraceCheckUtils]: 11: Hoare triple {204#false} main_~i~0#1 := 0; {204#false} is VALID [2022-02-20 14:02:49,623 INFO L290 TraceCheckUtils]: 12: Hoare triple {204#false} assume !(main_~i~0#1 < 100000); {204#false} is VALID [2022-02-20 14:02:49,623 INFO L290 TraceCheckUtils]: 13: Hoare triple {204#false} main_~i~0#1 := 0; {204#false} is VALID [2022-02-20 14:02:49,623 INFO L290 TraceCheckUtils]: 14: Hoare triple {204#false} assume !(main_~i~0#1 < 100000); {204#false} is VALID [2022-02-20 14:02:49,623 INFO L290 TraceCheckUtils]: 15: Hoare triple {204#false} havoc main_~x~0#1;main_~x~0#1 := 0; {204#false} is VALID [2022-02-20 14:02:49,624 INFO L290 TraceCheckUtils]: 16: Hoare triple {204#false} assume !!(main_~x~0#1 < 100000);call main_#t~mem15#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~x~0#1, 4);call main_#t~mem16#1 := read~int(main_~#a6~0#1.base, main_~#a6~0#1.offset + 4 * main_~x~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem15#1 == main_#t~mem16#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {204#false} is VALID [2022-02-20 14:02:49,624 INFO L290 TraceCheckUtils]: 17: Hoare triple {204#false} assume 0 == __VERIFIER_assert_~cond#1; {204#false} is VALID [2022-02-20 14:02:49,624 INFO L290 TraceCheckUtils]: 18: Hoare triple {204#false} assume !false; {204#false} is VALID [2022-02-20 14:02:49,624 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:02:49,624 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:02:49,624 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085088164] [2022-02-20 14:02:49,624 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1085088164] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 14:02:49,625 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [235667324] [2022-02-20 14:02:49,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:02:49,625 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:02:49,625 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:02:49,626 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:02:49,627 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:02:49,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:02:49,706 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-20 14:02:49,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:02:49,716 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:02:49,763 INFO L290 TraceCheckUtils]: 0: Hoare triple {203#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); {203#true} is VALID [2022-02-20 14:02:49,764 INFO L290 TraceCheckUtils]: 1: Hoare triple {203#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~nondet3#1, main_#t~post1#1, main_#t~mem5#1, main_#t~post4#1, main_#t~mem7#1, main_#t~post6#1, main_#t~mem9#1, main_#t~post8#1, main_#t~mem11#1, main_#t~post10#1, main_#t~mem13#1, main_#t~post12#1, main_#t~mem15#1, main_#t~mem16#1, main_#t~post14#1, main_~#a1~0#1.base, main_~#a1~0#1.offset, main_~#a2~0#1.base, main_~#a2~0#1.offset, main_~#a3~0#1.base, main_~#a3~0#1.offset, main_~#a4~0#1.base, main_~#a4~0#1.offset, main_~#a5~0#1.base, main_~#a5~0#1.offset, main_~#a6~0#1.base, main_~#a6~0#1.offset, main_~a~0#1, main_~i~0#1, main_~x~0#1;call main_~#a1~0#1.base, main_~#a1~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a2~0#1.base, main_~#a2~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a3~0#1.base, main_~#a3~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a4~0#1.base, main_~#a4~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a5~0#1.base, main_~#a5~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a6~0#1.base, main_~#a6~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~a~0#1;main_~a~0#1 := 0; {203#true} is VALID [2022-02-20 14:02:49,764 INFO L290 TraceCheckUtils]: 2: Hoare triple {203#true} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {203#true} is VALID [2022-02-20 14:02:49,764 INFO L290 TraceCheckUtils]: 3: Hoare triple {203#true} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {203#true} is VALID [2022-02-20 14:02:49,764 INFO L290 TraceCheckUtils]: 4: Hoare triple {203#true} assume !(main_~a~0#1 < 100000); {203#true} is VALID [2022-02-20 14:02:49,765 INFO L290 TraceCheckUtils]: 5: Hoare triple {203#true} havoc main_~i~0#1;main_~i~0#1 := 0; {225#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:02:49,766 INFO L290 TraceCheckUtils]: 6: Hoare triple {225#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !(main_~i~0#1 < 100000); {204#false} is VALID [2022-02-20 14:02:49,766 INFO L290 TraceCheckUtils]: 7: Hoare triple {204#false} main_~i~0#1 := 0; {204#false} is VALID [2022-02-20 14:02:49,766 INFO L290 TraceCheckUtils]: 8: Hoare triple {204#false} assume !(main_~i~0#1 < 100000); {204#false} is VALID [2022-02-20 14:02:49,766 INFO L290 TraceCheckUtils]: 9: Hoare triple {204#false} main_~i~0#1 := 0; {204#false} is VALID [2022-02-20 14:02:49,766 INFO L290 TraceCheckUtils]: 10: Hoare triple {204#false} assume !(main_~i~0#1 < 100000); {204#false} is VALID [2022-02-20 14:02:49,766 INFO L290 TraceCheckUtils]: 11: Hoare triple {204#false} main_~i~0#1 := 0; {204#false} is VALID [2022-02-20 14:02:49,766 INFO L290 TraceCheckUtils]: 12: Hoare triple {204#false} assume !(main_~i~0#1 < 100000); {204#false} is VALID [2022-02-20 14:02:49,766 INFO L290 TraceCheckUtils]: 13: Hoare triple {204#false} main_~i~0#1 := 0; {204#false} is VALID [2022-02-20 14:02:49,767 INFO L290 TraceCheckUtils]: 14: Hoare triple {204#false} assume !(main_~i~0#1 < 100000); {204#false} is VALID [2022-02-20 14:02:49,767 INFO L290 TraceCheckUtils]: 15: Hoare triple {204#false} havoc main_~x~0#1;main_~x~0#1 := 0; {204#false} is VALID [2022-02-20 14:02:49,767 INFO L290 TraceCheckUtils]: 16: Hoare triple {204#false} assume !!(main_~x~0#1 < 100000);call main_#t~mem15#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~x~0#1, 4);call main_#t~mem16#1 := read~int(main_~#a6~0#1.base, main_~#a6~0#1.offset + 4 * main_~x~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem15#1 == main_#t~mem16#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {204#false} is VALID [2022-02-20 14:02:49,767 INFO L290 TraceCheckUtils]: 17: Hoare triple {204#false} assume 0 == __VERIFIER_assert_~cond#1; {204#false} is VALID [2022-02-20 14:02:49,767 INFO L290 TraceCheckUtils]: 18: Hoare triple {204#false} assume !false; {204#false} is VALID [2022-02-20 14:02:49,767 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-20 14:02:49,767 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 14:02:49,767 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [235667324] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:02:49,768 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-20 14:02:49,768 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2022-02-20 14:02:49,768 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063029099] [2022-02-20 14:02:49,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:02:49,769 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-02-20 14:02:49,769 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:02:49,769 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:02:49,785 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:02:49,786 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 14:02:49,786 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:02:49,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 14:02:49,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-02-20 14:02:49,786 INFO L87 Difference]: Start difference. First operand 27 states and 33 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:02:49,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:02:49,856 INFO L93 Difference]: Finished difference Result 56 states and 71 transitions. [2022-02-20 14:02:49,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 14:02:49,856 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-02-20 14:02:49,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:02:49,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:02:49,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 70 transitions. [2022-02-20 14:02:49,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:02:49,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 70 transitions. [2022-02-20 14:02:49,859 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 70 transitions. [2022-02-20 14:02:49,908 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:02:49,909 INFO L225 Difference]: With dead ends: 56 [2022-02-20 14:02:49,909 INFO L226 Difference]: Without dead ends: 37 [2022-02-20 14:02:49,909 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-02-20 14:02:49,910 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 5 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 14:02:49,911 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 33 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 14:02:49,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-02-20 14:02:49,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 32. [2022-02-20 14:02:49,917 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:02:49,917 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand has 32 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 31 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:02:49,918 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand has 32 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 31 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:02:49,918 INFO L87 Difference]: Start difference. First operand 37 states. Second operand has 32 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 31 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:02:49,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:02:49,919 INFO L93 Difference]: Finished difference Result 37 states and 43 transitions. [2022-02-20 14:02:49,919 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 43 transitions. [2022-02-20 14:02:49,919 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:02:49,919 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:02:49,920 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 31 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) Second operand 37 states. [2022-02-20 14:02:49,920 INFO L87 Difference]: Start difference. First operand has 32 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 31 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) Second operand 37 states. [2022-02-20 14:02:49,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:02:49,921 INFO L93 Difference]: Finished difference Result 37 states and 43 transitions. [2022-02-20 14:02:49,921 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 43 transitions. [2022-02-20 14:02:49,921 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:02:49,921 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:02:49,921 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:02:49,921 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:02:49,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 31 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:02:49,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 38 transitions. [2022-02-20 14:02:49,923 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 38 transitions. Word has length 19 [2022-02-20 14:02:49,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:02:49,923 INFO L470 AbstractCegarLoop]: Abstraction has 32 states and 38 transitions. [2022-02-20 14:02:49,923 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:02:49,923 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2022-02-20 14:02:49,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-02-20 14:02:49,923 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:02:49,923 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:02:49,961 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:02:50,143 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:02:50,144 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:02:50,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:02:50,144 INFO L85 PathProgramCache]: Analyzing trace with hash 722749857, now seen corresponding path program 1 times [2022-02-20 14:02:50,144 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:02:50,144 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975117156] [2022-02-20 14:02:50,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:02:50,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:02:50,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:02:50,276 INFO L290 TraceCheckUtils]: 0: Hoare triple {457#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); {457#true} is VALID [2022-02-20 14:02:50,279 INFO L290 TraceCheckUtils]: 1: Hoare triple {457#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~nondet3#1, main_#t~post1#1, main_#t~mem5#1, main_#t~post4#1, main_#t~mem7#1, main_#t~post6#1, main_#t~mem9#1, main_#t~post8#1, main_#t~mem11#1, main_#t~post10#1, main_#t~mem13#1, main_#t~post12#1, main_#t~mem15#1, main_#t~mem16#1, main_#t~post14#1, main_~#a1~0#1.base, main_~#a1~0#1.offset, main_~#a2~0#1.base, main_~#a2~0#1.offset, main_~#a3~0#1.base, main_~#a3~0#1.offset, main_~#a4~0#1.base, main_~#a4~0#1.offset, main_~#a5~0#1.base, main_~#a5~0#1.offset, main_~#a6~0#1.base, main_~#a6~0#1.offset, main_~a~0#1, main_~i~0#1, main_~x~0#1;call main_~#a1~0#1.base, main_~#a1~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a2~0#1.base, main_~#a2~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a3~0#1.base, main_~#a3~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a4~0#1.base, main_~#a4~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a5~0#1.base, main_~#a5~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a6~0#1.base, main_~#a6~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~a~0#1;main_~a~0#1 := 0; {459#(= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-20 14:02:50,279 INFO L290 TraceCheckUtils]: 2: Hoare triple {459#(= |ULTIMATE.start_main_~a~0#1| 0)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {459#(= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-20 14:02:50,280 INFO L290 TraceCheckUtils]: 3: Hoare triple {459#(= |ULTIMATE.start_main_~a~0#1| 0)} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {460#(<= |ULTIMATE.start_main_~a~0#1| 1)} is VALID [2022-02-20 14:02:50,280 INFO L290 TraceCheckUtils]: 4: Hoare triple {460#(<= |ULTIMATE.start_main_~a~0#1| 1)} assume !(main_~a~0#1 < 100000); {458#false} is VALID [2022-02-20 14:02:50,280 INFO L290 TraceCheckUtils]: 5: Hoare triple {458#false} havoc main_~i~0#1;main_~i~0#1 := 0; {458#false} is VALID [2022-02-20 14:02:50,281 INFO L290 TraceCheckUtils]: 6: Hoare triple {458#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem5#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem5#1, main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem5#1; {458#false} is VALID [2022-02-20 14:02:50,281 INFO L290 TraceCheckUtils]: 7: Hoare triple {458#false} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {458#false} is VALID [2022-02-20 14:02:50,281 INFO L290 TraceCheckUtils]: 8: Hoare triple {458#false} assume !(main_~i~0#1 < 100000); {458#false} is VALID [2022-02-20 14:02:50,281 INFO L290 TraceCheckUtils]: 9: Hoare triple {458#false} main_~i~0#1 := 0; {458#false} is VALID [2022-02-20 14:02:50,281 INFO L290 TraceCheckUtils]: 10: Hoare triple {458#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem7#1 := read~int(main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem7#1, main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem7#1; {458#false} is VALID [2022-02-20 14:02:50,281 INFO L290 TraceCheckUtils]: 11: Hoare triple {458#false} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {458#false} is VALID [2022-02-20 14:02:50,281 INFO L290 TraceCheckUtils]: 12: Hoare triple {458#false} assume !(main_~i~0#1 < 100000); {458#false} is VALID [2022-02-20 14:02:50,281 INFO L290 TraceCheckUtils]: 13: Hoare triple {458#false} main_~i~0#1 := 0; {458#false} is VALID [2022-02-20 14:02:50,282 INFO L290 TraceCheckUtils]: 14: Hoare triple {458#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem9#1 := read~int(main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem9#1, main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem9#1; {458#false} is VALID [2022-02-20 14:02:50,282 INFO L290 TraceCheckUtils]: 15: Hoare triple {458#false} main_#t~post8#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; {458#false} is VALID [2022-02-20 14:02:50,282 INFO L290 TraceCheckUtils]: 16: Hoare triple {458#false} assume !(main_~i~0#1 < 100000); {458#false} is VALID [2022-02-20 14:02:50,282 INFO L290 TraceCheckUtils]: 17: Hoare triple {458#false} main_~i~0#1 := 0; {458#false} is VALID [2022-02-20 14:02:50,282 INFO L290 TraceCheckUtils]: 18: Hoare triple {458#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem11#1 := read~int(main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem11#1, main_~#a6~0#1.base, main_~#a6~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem11#1; {458#false} is VALID [2022-02-20 14:02:50,282 INFO L290 TraceCheckUtils]: 19: Hoare triple {458#false} main_#t~post10#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; {458#false} is VALID [2022-02-20 14:02:50,282 INFO L290 TraceCheckUtils]: 20: Hoare triple {458#false} assume !(main_~i~0#1 < 100000); {458#false} is VALID [2022-02-20 14:02:50,282 INFO L290 TraceCheckUtils]: 21: Hoare triple {458#false} main_~i~0#1 := 0; {458#false} is VALID [2022-02-20 14:02:50,282 INFO L290 TraceCheckUtils]: 22: Hoare triple {458#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem13#1 := read~int(main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem13#1, main_~#a6~0#1.base, main_~#a6~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem13#1; {458#false} is VALID [2022-02-20 14:02:50,283 INFO L290 TraceCheckUtils]: 23: Hoare triple {458#false} main_#t~post12#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post12#1;havoc main_#t~post12#1; {458#false} is VALID [2022-02-20 14:02:50,283 INFO L290 TraceCheckUtils]: 24: Hoare triple {458#false} assume !(main_~i~0#1 < 100000); {458#false} is VALID [2022-02-20 14:02:50,284 INFO L290 TraceCheckUtils]: 25: Hoare triple {458#false} havoc main_~x~0#1;main_~x~0#1 := 0; {458#false} is VALID [2022-02-20 14:02:50,284 INFO L290 TraceCheckUtils]: 26: Hoare triple {458#false} assume !!(main_~x~0#1 < 100000);call main_#t~mem15#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~x~0#1, 4);call main_#t~mem16#1 := read~int(main_~#a6~0#1.base, main_~#a6~0#1.offset + 4 * main_~x~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem15#1 == main_#t~mem16#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {458#false} is VALID [2022-02-20 14:02:50,284 INFO L290 TraceCheckUtils]: 27: Hoare triple {458#false} assume 0 == __VERIFIER_assert_~cond#1; {458#false} is VALID [2022-02-20 14:02:50,284 INFO L290 TraceCheckUtils]: 28: Hoare triple {458#false} assume !false; {458#false} is VALID [2022-02-20 14:02:50,285 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-02-20 14:02:50,285 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:02:50,285 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975117156] [2022-02-20 14:02:50,285 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1975117156] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 14:02:50,287 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1659661024] [2022-02-20 14:02:50,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:02:50,294 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:02:50,294 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:02:50,295 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:02:50,306 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:02:50,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:02:50,368 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-20 14:02:50,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:02:50,378 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:02:50,458 INFO L290 TraceCheckUtils]: 0: Hoare triple {457#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); {457#true} is VALID [2022-02-20 14:02:50,459 INFO L290 TraceCheckUtils]: 1: Hoare triple {457#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~nondet3#1, main_#t~post1#1, main_#t~mem5#1, main_#t~post4#1, main_#t~mem7#1, main_#t~post6#1, main_#t~mem9#1, main_#t~post8#1, main_#t~mem11#1, main_#t~post10#1, main_#t~mem13#1, main_#t~post12#1, main_#t~mem15#1, main_#t~mem16#1, main_#t~post14#1, main_~#a1~0#1.base, main_~#a1~0#1.offset, main_~#a2~0#1.base, main_~#a2~0#1.offset, main_~#a3~0#1.base, main_~#a3~0#1.offset, main_~#a4~0#1.base, main_~#a4~0#1.offset, main_~#a5~0#1.base, main_~#a5~0#1.offset, main_~#a6~0#1.base, main_~#a6~0#1.offset, main_~a~0#1, main_~i~0#1, main_~x~0#1;call main_~#a1~0#1.base, main_~#a1~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a2~0#1.base, main_~#a2~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a3~0#1.base, main_~#a3~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a4~0#1.base, main_~#a4~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a5~0#1.base, main_~#a5~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a6~0#1.base, main_~#a6~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~a~0#1;main_~a~0#1 := 0; {467#(<= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-20 14:02:50,459 INFO L290 TraceCheckUtils]: 2: Hoare triple {467#(<= |ULTIMATE.start_main_~a~0#1| 0)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {467#(<= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-20 14:02:50,462 INFO L290 TraceCheckUtils]: 3: Hoare triple {467#(<= |ULTIMATE.start_main_~a~0#1| 0)} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {460#(<= |ULTIMATE.start_main_~a~0#1| 1)} is VALID [2022-02-20 14:02:50,463 INFO L290 TraceCheckUtils]: 4: Hoare triple {460#(<= |ULTIMATE.start_main_~a~0#1| 1)} assume !(main_~a~0#1 < 100000); {458#false} is VALID [2022-02-20 14:02:50,463 INFO L290 TraceCheckUtils]: 5: Hoare triple {458#false} havoc main_~i~0#1;main_~i~0#1 := 0; {458#false} is VALID [2022-02-20 14:02:50,463 INFO L290 TraceCheckUtils]: 6: Hoare triple {458#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem5#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem5#1, main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem5#1; {458#false} is VALID [2022-02-20 14:02:50,463 INFO L290 TraceCheckUtils]: 7: Hoare triple {458#false} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {458#false} is VALID [2022-02-20 14:02:50,463 INFO L290 TraceCheckUtils]: 8: Hoare triple {458#false} assume !(main_~i~0#1 < 100000); {458#false} is VALID [2022-02-20 14:02:50,463 INFO L290 TraceCheckUtils]: 9: Hoare triple {458#false} main_~i~0#1 := 0; {458#false} is VALID [2022-02-20 14:02:50,463 INFO L290 TraceCheckUtils]: 10: Hoare triple {458#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem7#1 := read~int(main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem7#1, main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem7#1; {458#false} is VALID [2022-02-20 14:02:50,463 INFO L290 TraceCheckUtils]: 11: Hoare triple {458#false} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {458#false} is VALID [2022-02-20 14:02:50,463 INFO L290 TraceCheckUtils]: 12: Hoare triple {458#false} assume !(main_~i~0#1 < 100000); {458#false} is VALID [2022-02-20 14:02:50,463 INFO L290 TraceCheckUtils]: 13: Hoare triple {458#false} main_~i~0#1 := 0; {458#false} is VALID [2022-02-20 14:02:50,464 INFO L290 TraceCheckUtils]: 14: Hoare triple {458#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem9#1 := read~int(main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem9#1, main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem9#1; {458#false} is VALID [2022-02-20 14:02:50,464 INFO L290 TraceCheckUtils]: 15: Hoare triple {458#false} main_#t~post8#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; {458#false} is VALID [2022-02-20 14:02:50,464 INFO L290 TraceCheckUtils]: 16: Hoare triple {458#false} assume !(main_~i~0#1 < 100000); {458#false} is VALID [2022-02-20 14:02:50,464 INFO L290 TraceCheckUtils]: 17: Hoare triple {458#false} main_~i~0#1 := 0; {458#false} is VALID [2022-02-20 14:02:50,464 INFO L290 TraceCheckUtils]: 18: Hoare triple {458#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem11#1 := read~int(main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem11#1, main_~#a6~0#1.base, main_~#a6~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem11#1; {458#false} is VALID [2022-02-20 14:02:50,464 INFO L290 TraceCheckUtils]: 19: Hoare triple {458#false} main_#t~post10#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; {458#false} is VALID [2022-02-20 14:02:50,464 INFO L290 TraceCheckUtils]: 20: Hoare triple {458#false} assume !(main_~i~0#1 < 100000); {458#false} is VALID [2022-02-20 14:02:50,464 INFO L290 TraceCheckUtils]: 21: Hoare triple {458#false} main_~i~0#1 := 0; {458#false} is VALID [2022-02-20 14:02:50,464 INFO L290 TraceCheckUtils]: 22: Hoare triple {458#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem13#1 := read~int(main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem13#1, main_~#a6~0#1.base, main_~#a6~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem13#1; {458#false} is VALID [2022-02-20 14:02:50,465 INFO L290 TraceCheckUtils]: 23: Hoare triple {458#false} main_#t~post12#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post12#1;havoc main_#t~post12#1; {458#false} is VALID [2022-02-20 14:02:50,465 INFO L290 TraceCheckUtils]: 24: Hoare triple {458#false} assume !(main_~i~0#1 < 100000); {458#false} is VALID [2022-02-20 14:02:50,465 INFO L290 TraceCheckUtils]: 25: Hoare triple {458#false} havoc main_~x~0#1;main_~x~0#1 := 0; {458#false} is VALID [2022-02-20 14:02:50,465 INFO L290 TraceCheckUtils]: 26: Hoare triple {458#false} assume !!(main_~x~0#1 < 100000);call main_#t~mem15#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~x~0#1, 4);call main_#t~mem16#1 := read~int(main_~#a6~0#1.base, main_~#a6~0#1.offset + 4 * main_~x~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem15#1 == main_#t~mem16#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {458#false} is VALID [2022-02-20 14:02:50,465 INFO L290 TraceCheckUtils]: 27: Hoare triple {458#false} assume 0 == __VERIFIER_assert_~cond#1; {458#false} is VALID [2022-02-20 14:02:50,465 INFO L290 TraceCheckUtils]: 28: Hoare triple {458#false} assume !false; {458#false} is VALID [2022-02-20 14:02:50,465 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-02-20 14:02:50,465 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 14:02:50,584 INFO L290 TraceCheckUtils]: 28: Hoare triple {458#false} assume !false; {458#false} is VALID [2022-02-20 14:02:50,585 INFO L290 TraceCheckUtils]: 27: Hoare triple {458#false} assume 0 == __VERIFIER_assert_~cond#1; {458#false} is VALID [2022-02-20 14:02:50,585 INFO L290 TraceCheckUtils]: 26: Hoare triple {458#false} assume !!(main_~x~0#1 < 100000);call main_#t~mem15#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~x~0#1, 4);call main_#t~mem16#1 := read~int(main_~#a6~0#1.base, main_~#a6~0#1.offset + 4 * main_~x~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem15#1 == main_#t~mem16#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {458#false} is VALID [2022-02-20 14:02:50,585 INFO L290 TraceCheckUtils]: 25: Hoare triple {458#false} havoc main_~x~0#1;main_~x~0#1 := 0; {458#false} is VALID [2022-02-20 14:02:50,585 INFO L290 TraceCheckUtils]: 24: Hoare triple {458#false} assume !(main_~i~0#1 < 100000); {458#false} is VALID [2022-02-20 14:02:50,585 INFO L290 TraceCheckUtils]: 23: Hoare triple {458#false} main_#t~post12#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post12#1;havoc main_#t~post12#1; {458#false} is VALID [2022-02-20 14:02:50,585 INFO L290 TraceCheckUtils]: 22: Hoare triple {458#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem13#1 := read~int(main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem13#1, main_~#a6~0#1.base, main_~#a6~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem13#1; {458#false} is VALID [2022-02-20 14:02:50,585 INFO L290 TraceCheckUtils]: 21: Hoare triple {458#false} main_~i~0#1 := 0; {458#false} is VALID [2022-02-20 14:02:50,585 INFO L290 TraceCheckUtils]: 20: Hoare triple {458#false} assume !(main_~i~0#1 < 100000); {458#false} is VALID [2022-02-20 14:02:50,585 INFO L290 TraceCheckUtils]: 19: Hoare triple {458#false} main_#t~post10#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; {458#false} is VALID [2022-02-20 14:02:50,586 INFO L290 TraceCheckUtils]: 18: Hoare triple {458#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem11#1 := read~int(main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem11#1, main_~#a6~0#1.base, main_~#a6~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem11#1; {458#false} is VALID [2022-02-20 14:02:50,586 INFO L290 TraceCheckUtils]: 17: Hoare triple {458#false} main_~i~0#1 := 0; {458#false} is VALID [2022-02-20 14:02:50,586 INFO L290 TraceCheckUtils]: 16: Hoare triple {458#false} assume !(main_~i~0#1 < 100000); {458#false} is VALID [2022-02-20 14:02:50,586 INFO L290 TraceCheckUtils]: 15: Hoare triple {458#false} main_#t~post8#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; {458#false} is VALID [2022-02-20 14:02:50,586 INFO L290 TraceCheckUtils]: 14: Hoare triple {458#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem9#1 := read~int(main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem9#1, main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem9#1; {458#false} is VALID [2022-02-20 14:02:50,586 INFO L290 TraceCheckUtils]: 13: Hoare triple {458#false} main_~i~0#1 := 0; {458#false} is VALID [2022-02-20 14:02:50,586 INFO L290 TraceCheckUtils]: 12: Hoare triple {458#false} assume !(main_~i~0#1 < 100000); {458#false} is VALID [2022-02-20 14:02:50,586 INFO L290 TraceCheckUtils]: 11: Hoare triple {458#false} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {458#false} is VALID [2022-02-20 14:02:50,586 INFO L290 TraceCheckUtils]: 10: Hoare triple {458#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem7#1 := read~int(main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem7#1, main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem7#1; {458#false} is VALID [2022-02-20 14:02:50,586 INFO L290 TraceCheckUtils]: 9: Hoare triple {458#false} main_~i~0#1 := 0; {458#false} is VALID [2022-02-20 14:02:50,586 INFO L290 TraceCheckUtils]: 8: Hoare triple {458#false} assume !(main_~i~0#1 < 100000); {458#false} is VALID [2022-02-20 14:02:50,587 INFO L290 TraceCheckUtils]: 7: Hoare triple {458#false} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {458#false} is VALID [2022-02-20 14:02:50,587 INFO L290 TraceCheckUtils]: 6: Hoare triple {458#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem5#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem5#1, main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem5#1; {458#false} is VALID [2022-02-20 14:02:50,587 INFO L290 TraceCheckUtils]: 5: Hoare triple {458#false} havoc main_~i~0#1;main_~i~0#1 := 0; {458#false} is VALID [2022-02-20 14:02:50,587 INFO L290 TraceCheckUtils]: 4: Hoare triple {621#(< |ULTIMATE.start_main_~a~0#1| 100000)} assume !(main_~a~0#1 < 100000); {458#false} is VALID [2022-02-20 14:02:50,588 INFO L290 TraceCheckUtils]: 3: Hoare triple {625#(< |ULTIMATE.start_main_~a~0#1| 99999)} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {621#(< |ULTIMATE.start_main_~a~0#1| 100000)} is VALID [2022-02-20 14:02:50,588 INFO L290 TraceCheckUtils]: 2: Hoare triple {625#(< |ULTIMATE.start_main_~a~0#1| 99999)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {625#(< |ULTIMATE.start_main_~a~0#1| 99999)} is VALID [2022-02-20 14:02:50,589 INFO L290 TraceCheckUtils]: 1: Hoare triple {457#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~nondet3#1, main_#t~post1#1, main_#t~mem5#1, main_#t~post4#1, main_#t~mem7#1, main_#t~post6#1, main_#t~mem9#1, main_#t~post8#1, main_#t~mem11#1, main_#t~post10#1, main_#t~mem13#1, main_#t~post12#1, main_#t~mem15#1, main_#t~mem16#1, main_#t~post14#1, main_~#a1~0#1.base, main_~#a1~0#1.offset, main_~#a2~0#1.base, main_~#a2~0#1.offset, main_~#a3~0#1.base, main_~#a3~0#1.offset, main_~#a4~0#1.base, main_~#a4~0#1.offset, main_~#a5~0#1.base, main_~#a5~0#1.offset, main_~#a6~0#1.base, main_~#a6~0#1.offset, main_~a~0#1, main_~i~0#1, main_~x~0#1;call main_~#a1~0#1.base, main_~#a1~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a2~0#1.base, main_~#a2~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a3~0#1.base, main_~#a3~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a4~0#1.base, main_~#a4~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a5~0#1.base, main_~#a5~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a6~0#1.base, main_~#a6~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~a~0#1;main_~a~0#1 := 0; {625#(< |ULTIMATE.start_main_~a~0#1| 99999)} is VALID [2022-02-20 14:02:50,589 INFO L290 TraceCheckUtils]: 0: Hoare triple {457#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); {457#true} is VALID [2022-02-20 14:02:50,589 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-02-20 14:02:50,589 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1659661024] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 14:02:50,589 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 14:02:50,589 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2022-02-20 14:02:50,590 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404101655] [2022-02-20 14:02:50,590 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 14:02:50,590 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-02-20 14:02:50,590 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:02:50,590 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:02:50,621 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:02:50,621 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 14:02:50,621 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:02:50,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 14:02:50,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-02-20 14:02:50,622 INFO L87 Difference]: Start difference. First operand 32 states and 38 transitions. Second operand has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:02:50,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:02:50,706 INFO L93 Difference]: Finished difference Result 65 states and 79 transitions. [2022-02-20 14:02:50,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 14:02:50,706 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-02-20 14:02:50,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:02:50,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:02:50,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 69 transitions. [2022-02-20 14:02:50,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:02:50,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 69 transitions. [2022-02-20 14:02:50,708 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 69 transitions. [2022-02-20 14:02:50,757 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:02:50,758 INFO L225 Difference]: With dead ends: 65 [2022-02-20 14:02:50,758 INFO L226 Difference]: Without dead ends: 38 [2022-02-20 14:02:50,759 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-02-20 14:02:50,759 INFO L933 BasicCegarLoop]: 30 mSDtfsCounter, 4 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 14:02:50,759 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 114 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 14:02:50,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-02-20 14:02:50,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2022-02-20 14:02:50,766 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:02:50,766 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand has 38 states, 37 states have (on average 1.1891891891891893) internal successors, (44), 37 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:02:50,766 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand has 38 states, 37 states have (on average 1.1891891891891893) internal successors, (44), 37 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:02:50,766 INFO L87 Difference]: Start difference. First operand 38 states. Second operand has 38 states, 37 states have (on average 1.1891891891891893) internal successors, (44), 37 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:02:50,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:02:50,767 INFO L93 Difference]: Finished difference Result 38 states and 44 transitions. [2022-02-20 14:02:50,767 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 44 transitions. [2022-02-20 14:02:50,768 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:02:50,768 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:02:50,768 INFO L74 IsIncluded]: Start isIncluded. First operand has 38 states, 37 states have (on average 1.1891891891891893) internal successors, (44), 37 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 38 states. [2022-02-20 14:02:50,768 INFO L87 Difference]: Start difference. First operand has 38 states, 37 states have (on average 1.1891891891891893) internal successors, (44), 37 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 38 states. [2022-02-20 14:02:50,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:02:50,769 INFO L93 Difference]: Finished difference Result 38 states and 44 transitions. [2022-02-20 14:02:50,769 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 44 transitions. [2022-02-20 14:02:50,769 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:02:50,769 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:02:50,769 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:02:50,769 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:02:50,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 37 states have (on average 1.1891891891891893) internal successors, (44), 37 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:02:50,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 44 transitions. [2022-02-20 14:02:50,775 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 44 transitions. Word has length 29 [2022-02-20 14:02:50,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:02:50,776 INFO L470 AbstractCegarLoop]: Abstraction has 38 states and 44 transitions. [2022-02-20 14:02:50,776 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:02:50,776 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 44 transitions. [2022-02-20 14:02:50,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-02-20 14:02:50,776 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:02:50,776 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:02:50,794 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:02:50,994 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-02-20 14:02:50,994 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:02:50,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:02:50,995 INFO L85 PathProgramCache]: Analyzing trace with hash 1141885403, now seen corresponding path program 2 times [2022-02-20 14:02:50,995 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:02:50,995 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380122469] [2022-02-20 14:02:50,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:02:50,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:02:51,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:02:51,088 INFO L290 TraceCheckUtils]: 0: Hoare triple {856#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); {856#true} is VALID [2022-02-20 14:02:51,088 INFO L290 TraceCheckUtils]: 1: Hoare triple {856#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~nondet3#1, main_#t~post1#1, main_#t~mem5#1, main_#t~post4#1, main_#t~mem7#1, main_#t~post6#1, main_#t~mem9#1, main_#t~post8#1, main_#t~mem11#1, main_#t~post10#1, main_#t~mem13#1, main_#t~post12#1, main_#t~mem15#1, main_#t~mem16#1, main_#t~post14#1, main_~#a1~0#1.base, main_~#a1~0#1.offset, main_~#a2~0#1.base, main_~#a2~0#1.offset, main_~#a3~0#1.base, main_~#a3~0#1.offset, main_~#a4~0#1.base, main_~#a4~0#1.offset, main_~#a5~0#1.base, main_~#a5~0#1.offset, main_~#a6~0#1.base, main_~#a6~0#1.offset, main_~a~0#1, main_~i~0#1, main_~x~0#1;call main_~#a1~0#1.base, main_~#a1~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a2~0#1.base, main_~#a2~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a3~0#1.base, main_~#a3~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a4~0#1.base, main_~#a4~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a5~0#1.base, main_~#a5~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a6~0#1.base, main_~#a6~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~a~0#1;main_~a~0#1 := 0; {856#true} is VALID [2022-02-20 14:02:51,089 INFO L290 TraceCheckUtils]: 2: Hoare triple {856#true} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {856#true} is VALID [2022-02-20 14:02:51,089 INFO L290 TraceCheckUtils]: 3: Hoare triple {856#true} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {856#true} is VALID [2022-02-20 14:02:51,089 INFO L290 TraceCheckUtils]: 4: Hoare triple {856#true} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {856#true} is VALID [2022-02-20 14:02:51,089 INFO L290 TraceCheckUtils]: 5: Hoare triple {856#true} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {856#true} is VALID [2022-02-20 14:02:51,089 INFO L290 TraceCheckUtils]: 6: Hoare triple {856#true} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {856#true} is VALID [2022-02-20 14:02:51,089 INFO L290 TraceCheckUtils]: 7: Hoare triple {856#true} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {856#true} is VALID [2022-02-20 14:02:51,089 INFO L290 TraceCheckUtils]: 8: Hoare triple {856#true} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {856#true} is VALID [2022-02-20 14:02:51,089 INFO L290 TraceCheckUtils]: 9: Hoare triple {856#true} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {856#true} is VALID [2022-02-20 14:02:51,089 INFO L290 TraceCheckUtils]: 10: Hoare triple {856#true} assume !(main_~a~0#1 < 100000); {856#true} is VALID [2022-02-20 14:02:51,090 INFO L290 TraceCheckUtils]: 11: Hoare triple {856#true} havoc main_~i~0#1;main_~i~0#1 := 0; {858#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:02:51,090 INFO L290 TraceCheckUtils]: 12: Hoare triple {858#(= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < 100000);call main_#t~mem5#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem5#1, main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem5#1; {858#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:02:51,090 INFO L290 TraceCheckUtils]: 13: Hoare triple {858#(= |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; {859#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 14:02:51,091 INFO L290 TraceCheckUtils]: 14: Hoare triple {859#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !(main_~i~0#1 < 100000); {857#false} is VALID [2022-02-20 14:02:51,091 INFO L290 TraceCheckUtils]: 15: Hoare triple {857#false} main_~i~0#1 := 0; {857#false} is VALID [2022-02-20 14:02:51,091 INFO L290 TraceCheckUtils]: 16: Hoare triple {857#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem7#1 := read~int(main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem7#1, main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem7#1; {857#false} is VALID [2022-02-20 14:02:51,091 INFO L290 TraceCheckUtils]: 17: Hoare triple {857#false} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {857#false} is VALID [2022-02-20 14:02:51,091 INFO L290 TraceCheckUtils]: 18: Hoare triple {857#false} assume !(main_~i~0#1 < 100000); {857#false} is VALID [2022-02-20 14:02:51,091 INFO L290 TraceCheckUtils]: 19: Hoare triple {857#false} main_~i~0#1 := 0; {857#false} is VALID [2022-02-20 14:02:51,091 INFO L290 TraceCheckUtils]: 20: Hoare triple {857#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem9#1 := read~int(main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem9#1, main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem9#1; {857#false} is VALID [2022-02-20 14:02:51,091 INFO L290 TraceCheckUtils]: 21: Hoare triple {857#false} main_#t~post8#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; {857#false} is VALID [2022-02-20 14:02:51,092 INFO L290 TraceCheckUtils]: 22: Hoare triple {857#false} assume !(main_~i~0#1 < 100000); {857#false} is VALID [2022-02-20 14:02:51,092 INFO L290 TraceCheckUtils]: 23: Hoare triple {857#false} main_~i~0#1 := 0; {857#false} is VALID [2022-02-20 14:02:51,092 INFO L290 TraceCheckUtils]: 24: Hoare triple {857#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem11#1 := read~int(main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem11#1, main_~#a6~0#1.base, main_~#a6~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem11#1; {857#false} is VALID [2022-02-20 14:02:51,092 INFO L290 TraceCheckUtils]: 25: Hoare triple {857#false} main_#t~post10#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; {857#false} is VALID [2022-02-20 14:02:51,092 INFO L290 TraceCheckUtils]: 26: Hoare triple {857#false} assume !(main_~i~0#1 < 100000); {857#false} is VALID [2022-02-20 14:02:51,092 INFO L290 TraceCheckUtils]: 27: Hoare triple {857#false} main_~i~0#1 := 0; {857#false} is VALID [2022-02-20 14:02:51,092 INFO L290 TraceCheckUtils]: 28: Hoare triple {857#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem13#1 := read~int(main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem13#1, main_~#a6~0#1.base, main_~#a6~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem13#1; {857#false} is VALID [2022-02-20 14:02:51,092 INFO L290 TraceCheckUtils]: 29: Hoare triple {857#false} main_#t~post12#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post12#1;havoc main_#t~post12#1; {857#false} is VALID [2022-02-20 14:02:51,092 INFO L290 TraceCheckUtils]: 30: Hoare triple {857#false} assume !(main_~i~0#1 < 100000); {857#false} is VALID [2022-02-20 14:02:51,092 INFO L290 TraceCheckUtils]: 31: Hoare triple {857#false} havoc main_~x~0#1;main_~x~0#1 := 0; {857#false} is VALID [2022-02-20 14:02:51,092 INFO L290 TraceCheckUtils]: 32: Hoare triple {857#false} assume !!(main_~x~0#1 < 100000);call main_#t~mem15#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~x~0#1, 4);call main_#t~mem16#1 := read~int(main_~#a6~0#1.base, main_~#a6~0#1.offset + 4 * main_~x~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem15#1 == main_#t~mem16#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {857#false} is VALID [2022-02-20 14:02:51,093 INFO L290 TraceCheckUtils]: 33: Hoare triple {857#false} assume 0 == __VERIFIER_assert_~cond#1; {857#false} is VALID [2022-02-20 14:02:51,093 INFO L290 TraceCheckUtils]: 34: Hoare triple {857#false} assume !false; {857#false} is VALID [2022-02-20 14:02:51,093 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-02-20 14:02:51,093 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:02:51,093 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380122469] [2022-02-20 14:02:51,093 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1380122469] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 14:02:51,093 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1777207190] [2022-02-20 14:02:51,093 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-20 14:02:51,093 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:02:51,094 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:02:51,095 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:02:51,096 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:02:51,190 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-20 14:02:51,190 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 14:02:51,191 INFO L263 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-20 14:02:51,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:02:51,210 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:02:51,351 INFO L290 TraceCheckUtils]: 0: Hoare triple {856#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); {856#true} is VALID [2022-02-20 14:02:51,352 INFO L290 TraceCheckUtils]: 1: Hoare triple {856#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~nondet3#1, main_#t~post1#1, main_#t~mem5#1, main_#t~post4#1, main_#t~mem7#1, main_#t~post6#1, main_#t~mem9#1, main_#t~post8#1, main_#t~mem11#1, main_#t~post10#1, main_#t~mem13#1, main_#t~post12#1, main_#t~mem15#1, main_#t~mem16#1, main_#t~post14#1, main_~#a1~0#1.base, main_~#a1~0#1.offset, main_~#a2~0#1.base, main_~#a2~0#1.offset, main_~#a3~0#1.base, main_~#a3~0#1.offset, main_~#a4~0#1.base, main_~#a4~0#1.offset, main_~#a5~0#1.base, main_~#a5~0#1.offset, main_~#a6~0#1.base, main_~#a6~0#1.offset, main_~a~0#1, main_~i~0#1, main_~x~0#1;call main_~#a1~0#1.base, main_~#a1~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a2~0#1.base, main_~#a2~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a3~0#1.base, main_~#a3~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a4~0#1.base, main_~#a4~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a5~0#1.base, main_~#a5~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a6~0#1.base, main_~#a6~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~a~0#1;main_~a~0#1 := 0; {866#(<= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-20 14:02:51,353 INFO L290 TraceCheckUtils]: 2: Hoare triple {866#(<= |ULTIMATE.start_main_~a~0#1| 0)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {866#(<= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-20 14:02:51,354 INFO L290 TraceCheckUtils]: 3: Hoare triple {866#(<= |ULTIMATE.start_main_~a~0#1| 0)} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {873#(<= |ULTIMATE.start_main_~a~0#1| 1)} is VALID [2022-02-20 14:02:51,354 INFO L290 TraceCheckUtils]: 4: Hoare triple {873#(<= |ULTIMATE.start_main_~a~0#1| 1)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {873#(<= |ULTIMATE.start_main_~a~0#1| 1)} is VALID [2022-02-20 14:02:51,355 INFO L290 TraceCheckUtils]: 5: Hoare triple {873#(<= |ULTIMATE.start_main_~a~0#1| 1)} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {880#(<= |ULTIMATE.start_main_~a~0#1| 2)} is VALID [2022-02-20 14:02:51,355 INFO L290 TraceCheckUtils]: 6: Hoare triple {880#(<= |ULTIMATE.start_main_~a~0#1| 2)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {880#(<= |ULTIMATE.start_main_~a~0#1| 2)} is VALID [2022-02-20 14:02:51,356 INFO L290 TraceCheckUtils]: 7: Hoare triple {880#(<= |ULTIMATE.start_main_~a~0#1| 2)} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {887#(<= |ULTIMATE.start_main_~a~0#1| 3)} is VALID [2022-02-20 14:02:51,359 INFO L290 TraceCheckUtils]: 8: Hoare triple {887#(<= |ULTIMATE.start_main_~a~0#1| 3)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {887#(<= |ULTIMATE.start_main_~a~0#1| 3)} is VALID [2022-02-20 14:02:51,557 INFO L290 TraceCheckUtils]: 9: Hoare triple {887#(<= |ULTIMATE.start_main_~a~0#1| 3)} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {894#(<= |ULTIMATE.start_main_~a~0#1| 4)} is VALID [2022-02-20 14:02:51,557 INFO L290 TraceCheckUtils]: 10: Hoare triple {894#(<= |ULTIMATE.start_main_~a~0#1| 4)} assume !(main_~a~0#1 < 100000); {857#false} is VALID [2022-02-20 14:02:51,557 INFO L290 TraceCheckUtils]: 11: Hoare triple {857#false} havoc main_~i~0#1;main_~i~0#1 := 0; {857#false} is VALID [2022-02-20 14:02:51,557 INFO L290 TraceCheckUtils]: 12: Hoare triple {857#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem5#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem5#1, main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem5#1; {857#false} is VALID [2022-02-20 14:02:51,558 INFO L290 TraceCheckUtils]: 13: Hoare triple {857#false} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {857#false} is VALID [2022-02-20 14:02:51,558 INFO L290 TraceCheckUtils]: 14: Hoare triple {857#false} assume !(main_~i~0#1 < 100000); {857#false} is VALID [2022-02-20 14:02:51,559 INFO L290 TraceCheckUtils]: 15: Hoare triple {857#false} main_~i~0#1 := 0; {857#false} is VALID [2022-02-20 14:02:51,559 INFO L290 TraceCheckUtils]: 16: Hoare triple {857#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem7#1 := read~int(main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem7#1, main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem7#1; {857#false} is VALID [2022-02-20 14:02:51,559 INFO L290 TraceCheckUtils]: 17: Hoare triple {857#false} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {857#false} is VALID [2022-02-20 14:02:51,559 INFO L290 TraceCheckUtils]: 18: Hoare triple {857#false} assume !(main_~i~0#1 < 100000); {857#false} is VALID [2022-02-20 14:02:51,559 INFO L290 TraceCheckUtils]: 19: Hoare triple {857#false} main_~i~0#1 := 0; {857#false} is VALID [2022-02-20 14:02:51,559 INFO L290 TraceCheckUtils]: 20: Hoare triple {857#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem9#1 := read~int(main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem9#1, main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem9#1; {857#false} is VALID [2022-02-20 14:02:51,559 INFO L290 TraceCheckUtils]: 21: Hoare triple {857#false} main_#t~post8#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; {857#false} is VALID [2022-02-20 14:02:51,559 INFO L290 TraceCheckUtils]: 22: Hoare triple {857#false} assume !(main_~i~0#1 < 100000); {857#false} is VALID [2022-02-20 14:02:51,559 INFO L290 TraceCheckUtils]: 23: Hoare triple {857#false} main_~i~0#1 := 0; {857#false} is VALID [2022-02-20 14:02:51,560 INFO L290 TraceCheckUtils]: 24: Hoare triple {857#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem11#1 := read~int(main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem11#1, main_~#a6~0#1.base, main_~#a6~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem11#1; {857#false} is VALID [2022-02-20 14:02:51,560 INFO L290 TraceCheckUtils]: 25: Hoare triple {857#false} main_#t~post10#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; {857#false} is VALID [2022-02-20 14:02:52,097 INFO L290 TraceCheckUtils]: 26: Hoare triple {857#false} assume !(main_~i~0#1 < 100000); {857#false} is VALID [2022-02-20 14:02:52,098 INFO L290 TraceCheckUtils]: 27: Hoare triple {857#false} main_~i~0#1 := 0; {857#false} is VALID [2022-02-20 14:02:52,098 INFO L290 TraceCheckUtils]: 28: Hoare triple {857#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem13#1 := read~int(main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem13#1, main_~#a6~0#1.base, main_~#a6~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem13#1; {857#false} is VALID [2022-02-20 14:02:52,098 INFO L290 TraceCheckUtils]: 29: Hoare triple {857#false} main_#t~post12#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post12#1;havoc main_#t~post12#1; {857#false} is VALID [2022-02-20 14:02:52,098 INFO L290 TraceCheckUtils]: 30: Hoare triple {857#false} assume !(main_~i~0#1 < 100000); {857#false} is VALID [2022-02-20 14:02:52,099 INFO L290 TraceCheckUtils]: 31: Hoare triple {857#false} havoc main_~x~0#1;main_~x~0#1 := 0; {857#false} is VALID [2022-02-20 14:02:52,103 INFO L290 TraceCheckUtils]: 32: Hoare triple {857#false} assume !!(main_~x~0#1 < 100000);call main_#t~mem15#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~x~0#1, 4);call main_#t~mem16#1 := read~int(main_~#a6~0#1.base, main_~#a6~0#1.offset + 4 * main_~x~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem15#1 == main_#t~mem16#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {857#false} is VALID [2022-02-20 14:02:52,103 INFO L290 TraceCheckUtils]: 33: Hoare triple {857#false} assume 0 == __VERIFIER_assert_~cond#1; {857#false} is VALID [2022-02-20 14:02:52,103 INFO L290 TraceCheckUtils]: 34: Hoare triple {857#false} assume !false; {857#false} is VALID [2022-02-20 14:02:52,104 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-02-20 14:02:52,104 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 14:02:52,320 INFO L290 TraceCheckUtils]: 34: Hoare triple {857#false} assume !false; {857#false} is VALID [2022-02-20 14:02:52,320 INFO L290 TraceCheckUtils]: 33: Hoare triple {857#false} assume 0 == __VERIFIER_assert_~cond#1; {857#false} is VALID [2022-02-20 14:02:52,320 INFO L290 TraceCheckUtils]: 32: Hoare triple {857#false} assume !!(main_~x~0#1 < 100000);call main_#t~mem15#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~x~0#1, 4);call main_#t~mem16#1 := read~int(main_~#a6~0#1.base, main_~#a6~0#1.offset + 4 * main_~x~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem15#1 == main_#t~mem16#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {857#false} is VALID [2022-02-20 14:02:52,320 INFO L290 TraceCheckUtils]: 31: Hoare triple {857#false} havoc main_~x~0#1;main_~x~0#1 := 0; {857#false} is VALID [2022-02-20 14:02:52,320 INFO L290 TraceCheckUtils]: 30: Hoare triple {857#false} assume !(main_~i~0#1 < 100000); {857#false} is VALID [2022-02-20 14:02:52,320 INFO L290 TraceCheckUtils]: 29: Hoare triple {857#false} main_#t~post12#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post12#1;havoc main_#t~post12#1; {857#false} is VALID [2022-02-20 14:02:52,320 INFO L290 TraceCheckUtils]: 28: Hoare triple {857#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem13#1 := read~int(main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem13#1, main_~#a6~0#1.base, main_~#a6~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem13#1; {857#false} is VALID [2022-02-20 14:02:52,320 INFO L290 TraceCheckUtils]: 27: Hoare triple {857#false} main_~i~0#1 := 0; {857#false} is VALID [2022-02-20 14:02:52,321 INFO L290 TraceCheckUtils]: 26: Hoare triple {857#false} assume !(main_~i~0#1 < 100000); {857#false} is VALID [2022-02-20 14:02:52,321 INFO L290 TraceCheckUtils]: 25: Hoare triple {857#false} main_#t~post10#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; {857#false} is VALID [2022-02-20 14:02:52,321 INFO L290 TraceCheckUtils]: 24: Hoare triple {857#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem11#1 := read~int(main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem11#1, main_~#a6~0#1.base, main_~#a6~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem11#1; {857#false} is VALID [2022-02-20 14:02:52,321 INFO L290 TraceCheckUtils]: 23: Hoare triple {857#false} main_~i~0#1 := 0; {857#false} is VALID [2022-02-20 14:02:52,321 INFO L290 TraceCheckUtils]: 22: Hoare triple {857#false} assume !(main_~i~0#1 < 100000); {857#false} is VALID [2022-02-20 14:02:52,321 INFO L290 TraceCheckUtils]: 21: Hoare triple {857#false} main_#t~post8#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; {857#false} is VALID [2022-02-20 14:02:52,321 INFO L290 TraceCheckUtils]: 20: Hoare triple {857#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem9#1 := read~int(main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem9#1, main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem9#1; {857#false} is VALID [2022-02-20 14:02:52,321 INFO L290 TraceCheckUtils]: 19: Hoare triple {857#false} main_~i~0#1 := 0; {857#false} is VALID [2022-02-20 14:02:52,321 INFO L290 TraceCheckUtils]: 18: Hoare triple {857#false} assume !(main_~i~0#1 < 100000); {857#false} is VALID [2022-02-20 14:02:52,321 INFO L290 TraceCheckUtils]: 17: Hoare triple {857#false} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {857#false} is VALID [2022-02-20 14:02:52,322 INFO L290 TraceCheckUtils]: 16: Hoare triple {857#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem7#1 := read~int(main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem7#1, main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem7#1; {857#false} is VALID [2022-02-20 14:02:52,331 INFO L290 TraceCheckUtils]: 15: Hoare triple {857#false} main_~i~0#1 := 0; {857#false} is VALID [2022-02-20 14:02:52,331 INFO L290 TraceCheckUtils]: 14: Hoare triple {857#false} assume !(main_~i~0#1 < 100000); {857#false} is VALID [2022-02-20 14:02:52,331 INFO L290 TraceCheckUtils]: 13: Hoare triple {857#false} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {857#false} is VALID [2022-02-20 14:02:52,332 INFO L290 TraceCheckUtils]: 12: Hoare triple {857#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem5#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem5#1, main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem5#1; {857#false} is VALID [2022-02-20 14:02:52,332 INFO L290 TraceCheckUtils]: 11: Hoare triple {857#false} havoc main_~i~0#1;main_~i~0#1 := 0; {857#false} is VALID [2022-02-20 14:02:52,333 INFO L290 TraceCheckUtils]: 10: Hoare triple {1042#(< |ULTIMATE.start_main_~a~0#1| 100000)} assume !(main_~a~0#1 < 100000); {857#false} is VALID [2022-02-20 14:02:52,334 INFO L290 TraceCheckUtils]: 9: Hoare triple {1046#(< |ULTIMATE.start_main_~a~0#1| 99999)} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1042#(< |ULTIMATE.start_main_~a~0#1| 100000)} is VALID [2022-02-20 14:02:52,334 INFO L290 TraceCheckUtils]: 8: Hoare triple {1046#(< |ULTIMATE.start_main_~a~0#1| 99999)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {1046#(< |ULTIMATE.start_main_~a~0#1| 99999)} is VALID [2022-02-20 14:02:52,335 INFO L290 TraceCheckUtils]: 7: Hoare triple {1053#(< |ULTIMATE.start_main_~a~0#1| 99998)} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1046#(< |ULTIMATE.start_main_~a~0#1| 99999)} is VALID [2022-02-20 14:02:52,335 INFO L290 TraceCheckUtils]: 6: Hoare triple {1053#(< |ULTIMATE.start_main_~a~0#1| 99998)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {1053#(< |ULTIMATE.start_main_~a~0#1| 99998)} is VALID [2022-02-20 14:02:52,336 INFO L290 TraceCheckUtils]: 5: Hoare triple {1060#(< |ULTIMATE.start_main_~a~0#1| 99997)} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1053#(< |ULTIMATE.start_main_~a~0#1| 99998)} is VALID [2022-02-20 14:02:52,336 INFO L290 TraceCheckUtils]: 4: Hoare triple {1060#(< |ULTIMATE.start_main_~a~0#1| 99997)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {1060#(< |ULTIMATE.start_main_~a~0#1| 99997)} is VALID [2022-02-20 14:02:52,337 INFO L290 TraceCheckUtils]: 3: Hoare triple {1067#(< |ULTIMATE.start_main_~a~0#1| 99996)} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1060#(< |ULTIMATE.start_main_~a~0#1| 99997)} is VALID [2022-02-20 14:02:52,337 INFO L290 TraceCheckUtils]: 2: Hoare triple {1067#(< |ULTIMATE.start_main_~a~0#1| 99996)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {1067#(< |ULTIMATE.start_main_~a~0#1| 99996)} is VALID [2022-02-20 14:02:52,338 INFO L290 TraceCheckUtils]: 1: Hoare triple {856#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~nondet3#1, main_#t~post1#1, main_#t~mem5#1, main_#t~post4#1, main_#t~mem7#1, main_#t~post6#1, main_#t~mem9#1, main_#t~post8#1, main_#t~mem11#1, main_#t~post10#1, main_#t~mem13#1, main_#t~post12#1, main_#t~mem15#1, main_#t~mem16#1, main_#t~post14#1, main_~#a1~0#1.base, main_~#a1~0#1.offset, main_~#a2~0#1.base, main_~#a2~0#1.offset, main_~#a3~0#1.base, main_~#a3~0#1.offset, main_~#a4~0#1.base, main_~#a4~0#1.offset, main_~#a5~0#1.base, main_~#a5~0#1.offset, main_~#a6~0#1.base, main_~#a6~0#1.offset, main_~a~0#1, main_~i~0#1, main_~x~0#1;call main_~#a1~0#1.base, main_~#a1~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a2~0#1.base, main_~#a2~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a3~0#1.base, main_~#a3~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a4~0#1.base, main_~#a4~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a5~0#1.base, main_~#a5~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a6~0#1.base, main_~#a6~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~a~0#1;main_~a~0#1 := 0; {1067#(< |ULTIMATE.start_main_~a~0#1| 99996)} is VALID [2022-02-20 14:02:52,338 INFO L290 TraceCheckUtils]: 0: Hoare triple {856#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); {856#true} is VALID [2022-02-20 14:02:52,339 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-02-20 14:02:52,339 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1777207190] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 14:02:52,339 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 14:02:52,339 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 7, 7] total 14 [2022-02-20 14:02:52,339 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592232995] [2022-02-20 14:02:52,340 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 14:02:52,340 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.7857142857142856) internal successors, (53), 14 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) Word has length 35 [2022-02-20 14:02:52,340 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:02:52,341 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 3.7857142857142856) internal successors, (53), 14 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:02:52,389 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:02:52,389 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-02-20 14:02:52,389 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:02:52,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-02-20 14:02:52,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-02-20 14:02:52,390 INFO L87 Difference]: Start difference. First operand 38 states and 44 transitions. Second operand has 14 states, 14 states have (on average 3.7857142857142856) internal successors, (53), 14 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:02:52,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:02:52,630 INFO L93 Difference]: Finished difference Result 92 states and 114 transitions. [2022-02-20 14:02:52,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-02-20 14:02:52,630 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.7857142857142856) internal successors, (53), 14 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) Word has length 35 [2022-02-20 14:02:52,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:02:52,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 3.7857142857142856) internal successors, (53), 14 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:02:52,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 109 transitions. [2022-02-20 14:02:52,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 3.7857142857142856) internal successors, (53), 14 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:02:52,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 109 transitions. [2022-02-20 14:02:52,634 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 109 transitions. [2022-02-20 14:02:52,720 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 109 edges. 109 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:02:52,721 INFO L225 Difference]: With dead ends: 92 [2022-02-20 14:02:52,721 INFO L226 Difference]: Without dead ends: 65 [2022-02-20 14:02:52,722 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-02-20 14:02:52,722 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 24 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 14:02:52,723 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 83 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 14:02:52,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-02-20 14:02:52,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 60. [2022-02-20 14:02:52,747 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:02:52,747 INFO L82 GeneralOperation]: Start isEquivalent. First operand 65 states. Second operand has 60 states, 59 states have (on average 1.11864406779661) internal successors, (66), 59 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:02:52,747 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states. Second operand has 60 states, 59 states have (on average 1.11864406779661) internal successors, (66), 59 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:02:52,748 INFO L87 Difference]: Start difference. First operand 65 states. Second operand has 60 states, 59 states have (on average 1.11864406779661) internal successors, (66), 59 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:02:52,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:02:52,749 INFO L93 Difference]: Finished difference Result 65 states and 71 transitions. [2022-02-20 14:02:52,749 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 71 transitions. [2022-02-20 14:02:52,750 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:02:52,750 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:02:52,750 INFO L74 IsIncluded]: Start isIncluded. First operand has 60 states, 59 states have (on average 1.11864406779661) internal successors, (66), 59 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 65 states. [2022-02-20 14:02:52,750 INFO L87 Difference]: Start difference. First operand has 60 states, 59 states have (on average 1.11864406779661) internal successors, (66), 59 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 65 states. [2022-02-20 14:02:52,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:02:52,751 INFO L93 Difference]: Finished difference Result 65 states and 71 transitions. [2022-02-20 14:02:52,752 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 71 transitions. [2022-02-20 14:02:52,752 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:02:52,752 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:02:52,752 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:02:52,752 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:02:52,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 59 states have (on average 1.11864406779661) internal successors, (66), 59 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:02:52,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 66 transitions. [2022-02-20 14:02:52,754 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 66 transitions. Word has length 35 [2022-02-20 14:02:52,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:02:52,754 INFO L470 AbstractCegarLoop]: Abstraction has 60 states and 66 transitions. [2022-02-20 14:02:52,755 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.7857142857142856) internal successors, (53), 14 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:02:52,755 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 66 transitions. [2022-02-20 14:02:52,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-02-20 14:02:52,756 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:02:52,756 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:02:52,777 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:02:52,975 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:02:52,976 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:02:52,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:02:52,976 INFO L85 PathProgramCache]: Analyzing trace with hash 1504312005, now seen corresponding path program 3 times [2022-02-20 14:02:52,976 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:02:52,976 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477800866] [2022-02-20 14:02:52,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:02:52,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:02:53,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:02:53,233 INFO L290 TraceCheckUtils]: 0: Hoare triple {1423#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); {1423#true} is VALID [2022-02-20 14:02:53,238 INFO L290 TraceCheckUtils]: 1: Hoare triple {1423#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~nondet3#1, main_#t~post1#1, main_#t~mem5#1, main_#t~post4#1, main_#t~mem7#1, main_#t~post6#1, main_#t~mem9#1, main_#t~post8#1, main_#t~mem11#1, main_#t~post10#1, main_#t~mem13#1, main_#t~post12#1, main_#t~mem15#1, main_#t~mem16#1, main_#t~post14#1, main_~#a1~0#1.base, main_~#a1~0#1.offset, main_~#a2~0#1.base, main_~#a2~0#1.offset, main_~#a3~0#1.base, main_~#a3~0#1.offset, main_~#a4~0#1.base, main_~#a4~0#1.offset, main_~#a5~0#1.base, main_~#a5~0#1.offset, main_~#a6~0#1.base, main_~#a6~0#1.offset, main_~a~0#1, main_~i~0#1, main_~x~0#1;call main_~#a1~0#1.base, main_~#a1~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a2~0#1.base, main_~#a2~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a3~0#1.base, main_~#a3~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a4~0#1.base, main_~#a4~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a5~0#1.base, main_~#a5~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a6~0#1.base, main_~#a6~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~a~0#1;main_~a~0#1 := 0; {1425#(= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-20 14:02:53,240 INFO L290 TraceCheckUtils]: 2: Hoare triple {1425#(= |ULTIMATE.start_main_~a~0#1| 0)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {1425#(= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-20 14:02:53,241 INFO L290 TraceCheckUtils]: 3: Hoare triple {1425#(= |ULTIMATE.start_main_~a~0#1| 0)} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1426#(<= |ULTIMATE.start_main_~a~0#1| 1)} is VALID [2022-02-20 14:02:53,241 INFO L290 TraceCheckUtils]: 4: Hoare triple {1426#(<= |ULTIMATE.start_main_~a~0#1| 1)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {1426#(<= |ULTIMATE.start_main_~a~0#1| 1)} is VALID [2022-02-20 14:02:53,241 INFO L290 TraceCheckUtils]: 5: Hoare triple {1426#(<= |ULTIMATE.start_main_~a~0#1| 1)} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1427#(<= |ULTIMATE.start_main_~a~0#1| 2)} is VALID [2022-02-20 14:02:53,242 INFO L290 TraceCheckUtils]: 6: Hoare triple {1427#(<= |ULTIMATE.start_main_~a~0#1| 2)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {1427#(<= |ULTIMATE.start_main_~a~0#1| 2)} is VALID [2022-02-20 14:02:53,242 INFO L290 TraceCheckUtils]: 7: Hoare triple {1427#(<= |ULTIMATE.start_main_~a~0#1| 2)} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1428#(<= |ULTIMATE.start_main_~a~0#1| 3)} is VALID [2022-02-20 14:02:53,245 INFO L290 TraceCheckUtils]: 8: Hoare triple {1428#(<= |ULTIMATE.start_main_~a~0#1| 3)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {1428#(<= |ULTIMATE.start_main_~a~0#1| 3)} is VALID [2022-02-20 14:02:53,245 INFO L290 TraceCheckUtils]: 9: Hoare triple {1428#(<= |ULTIMATE.start_main_~a~0#1| 3)} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1429#(<= |ULTIMATE.start_main_~a~0#1| 4)} is VALID [2022-02-20 14:02:53,246 INFO L290 TraceCheckUtils]: 10: Hoare triple {1429#(<= |ULTIMATE.start_main_~a~0#1| 4)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {1429#(<= |ULTIMATE.start_main_~a~0#1| 4)} is VALID [2022-02-20 14:02:53,246 INFO L290 TraceCheckUtils]: 11: Hoare triple {1429#(<= |ULTIMATE.start_main_~a~0#1| 4)} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1430#(<= |ULTIMATE.start_main_~a~0#1| 5)} is VALID [2022-02-20 14:02:53,246 INFO L290 TraceCheckUtils]: 12: Hoare triple {1430#(<= |ULTIMATE.start_main_~a~0#1| 5)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {1430#(<= |ULTIMATE.start_main_~a~0#1| 5)} is VALID [2022-02-20 14:02:53,247 INFO L290 TraceCheckUtils]: 13: Hoare triple {1430#(<= |ULTIMATE.start_main_~a~0#1| 5)} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1431#(<= |ULTIMATE.start_main_~a~0#1| 6)} is VALID [2022-02-20 14:02:53,247 INFO L290 TraceCheckUtils]: 14: Hoare triple {1431#(<= |ULTIMATE.start_main_~a~0#1| 6)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {1431#(<= |ULTIMATE.start_main_~a~0#1| 6)} is VALID [2022-02-20 14:02:53,248 INFO L290 TraceCheckUtils]: 15: Hoare triple {1431#(<= |ULTIMATE.start_main_~a~0#1| 6)} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1432#(<= |ULTIMATE.start_main_~a~0#1| 7)} is VALID [2022-02-20 14:02:53,248 INFO L290 TraceCheckUtils]: 16: Hoare triple {1432#(<= |ULTIMATE.start_main_~a~0#1| 7)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {1432#(<= |ULTIMATE.start_main_~a~0#1| 7)} is VALID [2022-02-20 14:02:53,248 INFO L290 TraceCheckUtils]: 17: Hoare triple {1432#(<= |ULTIMATE.start_main_~a~0#1| 7)} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1433#(<= |ULTIMATE.start_main_~a~0#1| 8)} is VALID [2022-02-20 14:02:53,249 INFO L290 TraceCheckUtils]: 18: Hoare triple {1433#(<= |ULTIMATE.start_main_~a~0#1| 8)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {1433#(<= |ULTIMATE.start_main_~a~0#1| 8)} is VALID [2022-02-20 14:02:53,249 INFO L290 TraceCheckUtils]: 19: Hoare triple {1433#(<= |ULTIMATE.start_main_~a~0#1| 8)} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1434#(<= |ULTIMATE.start_main_~a~0#1| 9)} is VALID [2022-02-20 14:02:53,249 INFO L290 TraceCheckUtils]: 20: Hoare triple {1434#(<= |ULTIMATE.start_main_~a~0#1| 9)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {1434#(<= |ULTIMATE.start_main_~a~0#1| 9)} is VALID [2022-02-20 14:02:53,250 INFO L290 TraceCheckUtils]: 21: Hoare triple {1434#(<= |ULTIMATE.start_main_~a~0#1| 9)} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1435#(<= |ULTIMATE.start_main_~a~0#1| 10)} is VALID [2022-02-20 14:02:53,250 INFO L290 TraceCheckUtils]: 22: Hoare triple {1435#(<= |ULTIMATE.start_main_~a~0#1| 10)} assume !(main_~a~0#1 < 100000); {1424#false} is VALID [2022-02-20 14:02:53,250 INFO L290 TraceCheckUtils]: 23: Hoare triple {1424#false} havoc main_~i~0#1;main_~i~0#1 := 0; {1424#false} is VALID [2022-02-20 14:02:53,251 INFO L290 TraceCheckUtils]: 24: Hoare triple {1424#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem5#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem5#1, main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem5#1; {1424#false} is VALID [2022-02-20 14:02:53,251 INFO L290 TraceCheckUtils]: 25: Hoare triple {1424#false} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {1424#false} is VALID [2022-02-20 14:02:53,251 INFO L290 TraceCheckUtils]: 26: Hoare triple {1424#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem5#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem5#1, main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem5#1; {1424#false} is VALID [2022-02-20 14:02:53,251 INFO L290 TraceCheckUtils]: 27: Hoare triple {1424#false} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {1424#false} is VALID [2022-02-20 14:02:53,251 INFO L290 TraceCheckUtils]: 28: Hoare triple {1424#false} assume !(main_~i~0#1 < 100000); {1424#false} is VALID [2022-02-20 14:02:53,251 INFO L290 TraceCheckUtils]: 29: Hoare triple {1424#false} main_~i~0#1 := 0; {1424#false} is VALID [2022-02-20 14:02:53,251 INFO L290 TraceCheckUtils]: 30: Hoare triple {1424#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem7#1 := read~int(main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem7#1, main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem7#1; {1424#false} is VALID [2022-02-20 14:02:53,252 INFO L290 TraceCheckUtils]: 31: Hoare triple {1424#false} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {1424#false} is VALID [2022-02-20 14:02:53,252 INFO L290 TraceCheckUtils]: 32: Hoare triple {1424#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem7#1 := read~int(main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem7#1, main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem7#1; {1424#false} is VALID [2022-02-20 14:02:53,252 INFO L290 TraceCheckUtils]: 33: Hoare triple {1424#false} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {1424#false} is VALID [2022-02-20 14:02:53,252 INFO L290 TraceCheckUtils]: 34: Hoare triple {1424#false} assume !(main_~i~0#1 < 100000); {1424#false} is VALID [2022-02-20 14:02:53,252 INFO L290 TraceCheckUtils]: 35: Hoare triple {1424#false} main_~i~0#1 := 0; {1424#false} is VALID [2022-02-20 14:02:53,252 INFO L290 TraceCheckUtils]: 36: Hoare triple {1424#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem9#1 := read~int(main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem9#1, main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem9#1; {1424#false} is VALID [2022-02-20 14:02:53,252 INFO L290 TraceCheckUtils]: 37: Hoare triple {1424#false} main_#t~post8#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; {1424#false} is VALID [2022-02-20 14:02:53,253 INFO L290 TraceCheckUtils]: 38: Hoare triple {1424#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem9#1 := read~int(main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem9#1, main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem9#1; {1424#false} is VALID [2022-02-20 14:02:53,253 INFO L290 TraceCheckUtils]: 39: Hoare triple {1424#false} main_#t~post8#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; {1424#false} is VALID [2022-02-20 14:02:53,253 INFO L290 TraceCheckUtils]: 40: Hoare triple {1424#false} assume !(main_~i~0#1 < 100000); {1424#false} is VALID [2022-02-20 14:02:53,253 INFO L290 TraceCheckUtils]: 41: Hoare triple {1424#false} main_~i~0#1 := 0; {1424#false} is VALID [2022-02-20 14:02:53,253 INFO L290 TraceCheckUtils]: 42: Hoare triple {1424#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem11#1 := read~int(main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem11#1, main_~#a6~0#1.base, main_~#a6~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem11#1; {1424#false} is VALID [2022-02-20 14:02:53,253 INFO L290 TraceCheckUtils]: 43: Hoare triple {1424#false} main_#t~post10#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; {1424#false} is VALID [2022-02-20 14:02:53,253 INFO L290 TraceCheckUtils]: 44: Hoare triple {1424#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem11#1 := read~int(main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem11#1, main_~#a6~0#1.base, main_~#a6~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem11#1; {1424#false} is VALID [2022-02-20 14:02:53,254 INFO L290 TraceCheckUtils]: 45: Hoare triple {1424#false} main_#t~post10#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; {1424#false} is VALID [2022-02-20 14:02:53,254 INFO L290 TraceCheckUtils]: 46: Hoare triple {1424#false} assume !(main_~i~0#1 < 100000); {1424#false} is VALID [2022-02-20 14:02:53,254 INFO L290 TraceCheckUtils]: 47: Hoare triple {1424#false} main_~i~0#1 := 0; {1424#false} is VALID [2022-02-20 14:02:53,254 INFO L290 TraceCheckUtils]: 48: Hoare triple {1424#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem13#1 := read~int(main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem13#1, main_~#a6~0#1.base, main_~#a6~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem13#1; {1424#false} is VALID [2022-02-20 14:02:53,254 INFO L290 TraceCheckUtils]: 49: Hoare triple {1424#false} main_#t~post12#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post12#1;havoc main_#t~post12#1; {1424#false} is VALID [2022-02-20 14:02:53,254 INFO L290 TraceCheckUtils]: 50: Hoare triple {1424#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem13#1 := read~int(main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem13#1, main_~#a6~0#1.base, main_~#a6~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem13#1; {1424#false} is VALID [2022-02-20 14:02:53,254 INFO L290 TraceCheckUtils]: 51: Hoare triple {1424#false} main_#t~post12#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post12#1;havoc main_#t~post12#1; {1424#false} is VALID [2022-02-20 14:02:53,255 INFO L290 TraceCheckUtils]: 52: Hoare triple {1424#false} assume !(main_~i~0#1 < 100000); {1424#false} is VALID [2022-02-20 14:02:53,255 INFO L290 TraceCheckUtils]: 53: Hoare triple {1424#false} havoc main_~x~0#1;main_~x~0#1 := 0; {1424#false} is VALID [2022-02-20 14:02:53,255 INFO L290 TraceCheckUtils]: 54: Hoare triple {1424#false} assume !!(main_~x~0#1 < 100000);call main_#t~mem15#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~x~0#1, 4);call main_#t~mem16#1 := read~int(main_~#a6~0#1.base, main_~#a6~0#1.offset + 4 * main_~x~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem15#1 == main_#t~mem16#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {1424#false} is VALID [2022-02-20 14:02:53,255 INFO L290 TraceCheckUtils]: 55: Hoare triple {1424#false} assume 0 == __VERIFIER_assert_~cond#1; {1424#false} is VALID [2022-02-20 14:02:53,255 INFO L290 TraceCheckUtils]: 56: Hoare triple {1424#false} assume !false; {1424#false} is VALID [2022-02-20 14:02:53,256 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-02-20 14:02:53,256 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:02:53,256 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477800866] [2022-02-20 14:02:53,256 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [477800866] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 14:02:53,256 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1609464256] [2022-02-20 14:02:53,256 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-20 14:02:53,256 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:02:53,257 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:02:53,258 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:02:53,259 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:02:53,393 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-02-20 14:02:53,393 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 14:02:53,395 INFO L263 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-20 14:02:53,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:02:53,411 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:02:53,554 INFO L290 TraceCheckUtils]: 0: Hoare triple {1423#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); {1423#true} is VALID [2022-02-20 14:02:53,554 INFO L290 TraceCheckUtils]: 1: Hoare triple {1423#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~nondet3#1, main_#t~post1#1, main_#t~mem5#1, main_#t~post4#1, main_#t~mem7#1, main_#t~post6#1, main_#t~mem9#1, main_#t~post8#1, main_#t~mem11#1, main_#t~post10#1, main_#t~mem13#1, main_#t~post12#1, main_#t~mem15#1, main_#t~mem16#1, main_#t~post14#1, main_~#a1~0#1.base, main_~#a1~0#1.offset, main_~#a2~0#1.base, main_~#a2~0#1.offset, main_~#a3~0#1.base, main_~#a3~0#1.offset, main_~#a4~0#1.base, main_~#a4~0#1.offset, main_~#a5~0#1.base, main_~#a5~0#1.offset, main_~#a6~0#1.base, main_~#a6~0#1.offset, main_~a~0#1, main_~i~0#1, main_~x~0#1;call main_~#a1~0#1.base, main_~#a1~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a2~0#1.base, main_~#a2~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a3~0#1.base, main_~#a3~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a4~0#1.base, main_~#a4~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a5~0#1.base, main_~#a5~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a6~0#1.base, main_~#a6~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~a~0#1;main_~a~0#1 := 0; {1423#true} is VALID [2022-02-20 14:02:53,554 INFO L290 TraceCheckUtils]: 2: Hoare triple {1423#true} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {1423#true} is VALID [2022-02-20 14:02:53,555 INFO L290 TraceCheckUtils]: 3: Hoare triple {1423#true} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1423#true} is VALID [2022-02-20 14:02:53,555 INFO L290 TraceCheckUtils]: 4: Hoare triple {1423#true} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {1423#true} is VALID [2022-02-20 14:02:53,555 INFO L290 TraceCheckUtils]: 5: Hoare triple {1423#true} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1423#true} is VALID [2022-02-20 14:02:53,555 INFO L290 TraceCheckUtils]: 6: Hoare triple {1423#true} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {1423#true} is VALID [2022-02-20 14:02:53,555 INFO L290 TraceCheckUtils]: 7: Hoare triple {1423#true} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1423#true} is VALID [2022-02-20 14:02:53,555 INFO L290 TraceCheckUtils]: 8: Hoare triple {1423#true} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {1423#true} is VALID [2022-02-20 14:02:53,555 INFO L290 TraceCheckUtils]: 9: Hoare triple {1423#true} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1423#true} is VALID [2022-02-20 14:02:53,556 INFO L290 TraceCheckUtils]: 10: Hoare triple {1423#true} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {1423#true} is VALID [2022-02-20 14:02:53,556 INFO L290 TraceCheckUtils]: 11: Hoare triple {1423#true} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1423#true} is VALID [2022-02-20 14:02:53,556 INFO L290 TraceCheckUtils]: 12: Hoare triple {1423#true} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {1423#true} is VALID [2022-02-20 14:02:53,556 INFO L290 TraceCheckUtils]: 13: Hoare triple {1423#true} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1423#true} is VALID [2022-02-20 14:02:53,556 INFO L290 TraceCheckUtils]: 14: Hoare triple {1423#true} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {1423#true} is VALID [2022-02-20 14:02:53,556 INFO L290 TraceCheckUtils]: 15: Hoare triple {1423#true} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1423#true} is VALID [2022-02-20 14:02:53,557 INFO L290 TraceCheckUtils]: 16: Hoare triple {1423#true} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {1423#true} is VALID [2022-02-20 14:02:53,557 INFO L290 TraceCheckUtils]: 17: Hoare triple {1423#true} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1423#true} is VALID [2022-02-20 14:02:53,557 INFO L290 TraceCheckUtils]: 18: Hoare triple {1423#true} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {1423#true} is VALID [2022-02-20 14:02:53,557 INFO L290 TraceCheckUtils]: 19: Hoare triple {1423#true} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1423#true} is VALID [2022-02-20 14:02:53,557 INFO L290 TraceCheckUtils]: 20: Hoare triple {1423#true} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {1423#true} is VALID [2022-02-20 14:02:53,557 INFO L290 TraceCheckUtils]: 21: Hoare triple {1423#true} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1423#true} is VALID [2022-02-20 14:02:53,557 INFO L290 TraceCheckUtils]: 22: Hoare triple {1423#true} assume !(main_~a~0#1 < 100000); {1423#true} is VALID [2022-02-20 14:02:53,557 INFO L290 TraceCheckUtils]: 23: Hoare triple {1423#true} havoc main_~i~0#1;main_~i~0#1 := 0; {1423#true} is VALID [2022-02-20 14:02:53,558 INFO L290 TraceCheckUtils]: 24: Hoare triple {1423#true} assume !!(main_~i~0#1 < 100000);call main_#t~mem5#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem5#1, main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem5#1; {1423#true} is VALID [2022-02-20 14:02:53,558 INFO L290 TraceCheckUtils]: 25: Hoare triple {1423#true} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {1423#true} is VALID [2022-02-20 14:02:53,558 INFO L290 TraceCheckUtils]: 26: Hoare triple {1423#true} assume !!(main_~i~0#1 < 100000);call main_#t~mem5#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem5#1, main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem5#1; {1423#true} is VALID [2022-02-20 14:02:53,558 INFO L290 TraceCheckUtils]: 27: Hoare triple {1423#true} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {1423#true} is VALID [2022-02-20 14:02:53,558 INFO L290 TraceCheckUtils]: 28: Hoare triple {1423#true} assume !(main_~i~0#1 < 100000); {1423#true} is VALID [2022-02-20 14:02:53,558 INFO L290 TraceCheckUtils]: 29: Hoare triple {1423#true} main_~i~0#1 := 0; {1423#true} is VALID [2022-02-20 14:02:53,558 INFO L290 TraceCheckUtils]: 30: Hoare triple {1423#true} assume !!(main_~i~0#1 < 100000);call main_#t~mem7#1 := read~int(main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem7#1, main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem7#1; {1423#true} is VALID [2022-02-20 14:02:53,559 INFO L290 TraceCheckUtils]: 31: Hoare triple {1423#true} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {1423#true} is VALID [2022-02-20 14:02:53,559 INFO L290 TraceCheckUtils]: 32: Hoare triple {1423#true} assume !!(main_~i~0#1 < 100000);call main_#t~mem7#1 := read~int(main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem7#1, main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem7#1; {1423#true} is VALID [2022-02-20 14:02:53,559 INFO L290 TraceCheckUtils]: 33: Hoare triple {1423#true} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {1423#true} is VALID [2022-02-20 14:02:53,559 INFO L290 TraceCheckUtils]: 34: Hoare triple {1423#true} assume !(main_~i~0#1 < 100000); {1423#true} is VALID [2022-02-20 14:02:53,559 INFO L290 TraceCheckUtils]: 35: Hoare triple {1423#true} main_~i~0#1 := 0; {1423#true} is VALID [2022-02-20 14:02:53,559 INFO L290 TraceCheckUtils]: 36: Hoare triple {1423#true} assume !!(main_~i~0#1 < 100000);call main_#t~mem9#1 := read~int(main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem9#1, main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem9#1; {1423#true} is VALID [2022-02-20 14:02:53,559 INFO L290 TraceCheckUtils]: 37: Hoare triple {1423#true} main_#t~post8#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; {1423#true} is VALID [2022-02-20 14:02:53,560 INFO L290 TraceCheckUtils]: 38: Hoare triple {1423#true} assume !!(main_~i~0#1 < 100000);call main_#t~mem9#1 := read~int(main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem9#1, main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem9#1; {1423#true} is VALID [2022-02-20 14:02:53,560 INFO L290 TraceCheckUtils]: 39: Hoare triple {1423#true} main_#t~post8#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; {1423#true} is VALID [2022-02-20 14:02:53,560 INFO L290 TraceCheckUtils]: 40: Hoare triple {1423#true} assume !(main_~i~0#1 < 100000); {1423#true} is VALID [2022-02-20 14:02:53,560 INFO L290 TraceCheckUtils]: 41: Hoare triple {1423#true} main_~i~0#1 := 0; {1423#true} is VALID [2022-02-20 14:02:53,560 INFO L290 TraceCheckUtils]: 42: Hoare triple {1423#true} assume !!(main_~i~0#1 < 100000);call main_#t~mem11#1 := read~int(main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem11#1, main_~#a6~0#1.base, main_~#a6~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem11#1; {1423#true} is VALID [2022-02-20 14:02:53,560 INFO L290 TraceCheckUtils]: 43: Hoare triple {1423#true} main_#t~post10#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; {1423#true} is VALID [2022-02-20 14:02:53,560 INFO L290 TraceCheckUtils]: 44: Hoare triple {1423#true} assume !!(main_~i~0#1 < 100000);call main_#t~mem11#1 := read~int(main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem11#1, main_~#a6~0#1.base, main_~#a6~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem11#1; {1423#true} is VALID [2022-02-20 14:02:53,561 INFO L290 TraceCheckUtils]: 45: Hoare triple {1423#true} main_#t~post10#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; {1423#true} is VALID [2022-02-20 14:02:53,561 INFO L290 TraceCheckUtils]: 46: Hoare triple {1423#true} assume !(main_~i~0#1 < 100000); {1423#true} is VALID [2022-02-20 14:02:53,563 INFO L290 TraceCheckUtils]: 47: Hoare triple {1423#true} main_~i~0#1 := 0; {1580#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:02:53,563 INFO L290 TraceCheckUtils]: 48: Hoare triple {1580#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < 100000);call main_#t~mem13#1 := read~int(main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem13#1, main_~#a6~0#1.base, main_~#a6~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem13#1; {1580#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:02:53,564 INFO L290 TraceCheckUtils]: 49: Hoare triple {1580#(<= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~post12#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post12#1;havoc main_#t~post12#1; {1587#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 14:02:53,564 INFO L290 TraceCheckUtils]: 50: Hoare triple {1587#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !!(main_~i~0#1 < 100000);call main_#t~mem13#1 := read~int(main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem13#1, main_~#a6~0#1.base, main_~#a6~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem13#1; {1587#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 14:02:53,564 INFO L290 TraceCheckUtils]: 51: Hoare triple {1587#(<= |ULTIMATE.start_main_~i~0#1| 1)} main_#t~post12#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post12#1;havoc main_#t~post12#1; {1594#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-20 14:02:53,575 INFO L290 TraceCheckUtils]: 52: Hoare triple {1594#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !(main_~i~0#1 < 100000); {1424#false} is VALID [2022-02-20 14:02:53,575 INFO L290 TraceCheckUtils]: 53: Hoare triple {1424#false} havoc main_~x~0#1;main_~x~0#1 := 0; {1424#false} is VALID [2022-02-20 14:02:53,576 INFO L290 TraceCheckUtils]: 54: Hoare triple {1424#false} assume !!(main_~x~0#1 < 100000);call main_#t~mem15#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~x~0#1, 4);call main_#t~mem16#1 := read~int(main_~#a6~0#1.base, main_~#a6~0#1.offset + 4 * main_~x~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem15#1 == main_#t~mem16#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {1424#false} is VALID [2022-02-20 14:02:53,576 INFO L290 TraceCheckUtils]: 55: Hoare triple {1424#false} assume 0 == __VERIFIER_assert_~cond#1; {1424#false} is VALID [2022-02-20 14:02:53,576 INFO L290 TraceCheckUtils]: 56: Hoare triple {1424#false} assume !false; {1424#false} is VALID [2022-02-20 14:02:53,576 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2022-02-20 14:02:53,576 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 14:02:53,740 INFO L290 TraceCheckUtils]: 56: Hoare triple {1424#false} assume !false; {1424#false} is VALID [2022-02-20 14:02:53,741 INFO L290 TraceCheckUtils]: 55: Hoare triple {1424#false} assume 0 == __VERIFIER_assert_~cond#1; {1424#false} is VALID [2022-02-20 14:02:53,741 INFO L290 TraceCheckUtils]: 54: Hoare triple {1424#false} assume !!(main_~x~0#1 < 100000);call main_#t~mem15#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~x~0#1, 4);call main_#t~mem16#1 := read~int(main_~#a6~0#1.base, main_~#a6~0#1.offset + 4 * main_~x~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem15#1 == main_#t~mem16#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {1424#false} is VALID [2022-02-20 14:02:53,741 INFO L290 TraceCheckUtils]: 53: Hoare triple {1424#false} havoc main_~x~0#1;main_~x~0#1 := 0; {1424#false} is VALID [2022-02-20 14:02:53,741 INFO L290 TraceCheckUtils]: 52: Hoare triple {1622#(< |ULTIMATE.start_main_~i~0#1| 100000)} assume !(main_~i~0#1 < 100000); {1424#false} is VALID [2022-02-20 14:02:53,744 INFO L290 TraceCheckUtils]: 51: Hoare triple {1626#(< |ULTIMATE.start_main_~i~0#1| 99999)} main_#t~post12#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post12#1;havoc main_#t~post12#1; {1622#(< |ULTIMATE.start_main_~i~0#1| 100000)} is VALID [2022-02-20 14:02:53,745 INFO L290 TraceCheckUtils]: 50: Hoare triple {1626#(< |ULTIMATE.start_main_~i~0#1| 99999)} assume !!(main_~i~0#1 < 100000);call main_#t~mem13#1 := read~int(main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem13#1, main_~#a6~0#1.base, main_~#a6~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem13#1; {1626#(< |ULTIMATE.start_main_~i~0#1| 99999)} is VALID [2022-02-20 14:02:53,746 INFO L290 TraceCheckUtils]: 49: Hoare triple {1633#(< |ULTIMATE.start_main_~i~0#1| 99998)} main_#t~post12#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post12#1;havoc main_#t~post12#1; {1626#(< |ULTIMATE.start_main_~i~0#1| 99999)} is VALID [2022-02-20 14:02:53,746 INFO L290 TraceCheckUtils]: 48: Hoare triple {1633#(< |ULTIMATE.start_main_~i~0#1| 99998)} assume !!(main_~i~0#1 < 100000);call main_#t~mem13#1 := read~int(main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem13#1, main_~#a6~0#1.base, main_~#a6~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem13#1; {1633#(< |ULTIMATE.start_main_~i~0#1| 99998)} is VALID [2022-02-20 14:02:53,746 INFO L290 TraceCheckUtils]: 47: Hoare triple {1423#true} main_~i~0#1 := 0; {1633#(< |ULTIMATE.start_main_~i~0#1| 99998)} is VALID [2022-02-20 14:02:53,746 INFO L290 TraceCheckUtils]: 46: Hoare triple {1423#true} assume !(main_~i~0#1 < 100000); {1423#true} is VALID [2022-02-20 14:02:53,747 INFO L290 TraceCheckUtils]: 45: Hoare triple {1423#true} main_#t~post10#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; {1423#true} is VALID [2022-02-20 14:02:53,747 INFO L290 TraceCheckUtils]: 44: Hoare triple {1423#true} assume !!(main_~i~0#1 < 100000);call main_#t~mem11#1 := read~int(main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem11#1, main_~#a6~0#1.base, main_~#a6~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem11#1; {1423#true} is VALID [2022-02-20 14:02:53,747 INFO L290 TraceCheckUtils]: 43: Hoare triple {1423#true} main_#t~post10#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; {1423#true} is VALID [2022-02-20 14:02:53,747 INFO L290 TraceCheckUtils]: 42: Hoare triple {1423#true} assume !!(main_~i~0#1 < 100000);call main_#t~mem11#1 := read~int(main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem11#1, main_~#a6~0#1.base, main_~#a6~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem11#1; {1423#true} is VALID [2022-02-20 14:02:53,747 INFO L290 TraceCheckUtils]: 41: Hoare triple {1423#true} main_~i~0#1 := 0; {1423#true} is VALID [2022-02-20 14:02:53,748 INFO L290 TraceCheckUtils]: 40: Hoare triple {1423#true} assume !(main_~i~0#1 < 100000); {1423#true} is VALID [2022-02-20 14:02:53,748 INFO L290 TraceCheckUtils]: 39: Hoare triple {1423#true} main_#t~post8#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; {1423#true} is VALID [2022-02-20 14:02:53,748 INFO L290 TraceCheckUtils]: 38: Hoare triple {1423#true} assume !!(main_~i~0#1 < 100000);call main_#t~mem9#1 := read~int(main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem9#1, main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem9#1; {1423#true} is VALID [2022-02-20 14:02:53,748 INFO L290 TraceCheckUtils]: 37: Hoare triple {1423#true} main_#t~post8#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; {1423#true} is VALID [2022-02-20 14:02:53,748 INFO L290 TraceCheckUtils]: 36: Hoare triple {1423#true} assume !!(main_~i~0#1 < 100000);call main_#t~mem9#1 := read~int(main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem9#1, main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem9#1; {1423#true} is VALID [2022-02-20 14:02:53,748 INFO L290 TraceCheckUtils]: 35: Hoare triple {1423#true} main_~i~0#1 := 0; {1423#true} is VALID [2022-02-20 14:02:53,749 INFO L290 TraceCheckUtils]: 34: Hoare triple {1423#true} assume !(main_~i~0#1 < 100000); {1423#true} is VALID [2022-02-20 14:02:53,749 INFO L290 TraceCheckUtils]: 33: Hoare triple {1423#true} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {1423#true} is VALID [2022-02-20 14:02:53,749 INFO L290 TraceCheckUtils]: 32: Hoare triple {1423#true} assume !!(main_~i~0#1 < 100000);call main_#t~mem7#1 := read~int(main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem7#1, main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem7#1; {1423#true} is VALID [2022-02-20 14:02:53,749 INFO L290 TraceCheckUtils]: 31: Hoare triple {1423#true} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {1423#true} is VALID [2022-02-20 14:02:53,749 INFO L290 TraceCheckUtils]: 30: Hoare triple {1423#true} assume !!(main_~i~0#1 < 100000);call main_#t~mem7#1 := read~int(main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem7#1, main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem7#1; {1423#true} is VALID [2022-02-20 14:02:53,749 INFO L290 TraceCheckUtils]: 29: Hoare triple {1423#true} main_~i~0#1 := 0; {1423#true} is VALID [2022-02-20 14:02:53,750 INFO L290 TraceCheckUtils]: 28: Hoare triple {1423#true} assume !(main_~i~0#1 < 100000); {1423#true} is VALID [2022-02-20 14:02:53,750 INFO L290 TraceCheckUtils]: 27: Hoare triple {1423#true} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {1423#true} is VALID [2022-02-20 14:02:53,750 INFO L290 TraceCheckUtils]: 26: Hoare triple {1423#true} assume !!(main_~i~0#1 < 100000);call main_#t~mem5#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem5#1, main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem5#1; {1423#true} is VALID [2022-02-20 14:02:53,750 INFO L290 TraceCheckUtils]: 25: Hoare triple {1423#true} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {1423#true} is VALID [2022-02-20 14:02:53,750 INFO L290 TraceCheckUtils]: 24: Hoare triple {1423#true} assume !!(main_~i~0#1 < 100000);call main_#t~mem5#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem5#1, main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem5#1; {1423#true} is VALID [2022-02-20 14:02:53,751 INFO L290 TraceCheckUtils]: 23: Hoare triple {1423#true} havoc main_~i~0#1;main_~i~0#1 := 0; {1423#true} is VALID [2022-02-20 14:02:53,751 INFO L290 TraceCheckUtils]: 22: Hoare triple {1423#true} assume !(main_~a~0#1 < 100000); {1423#true} is VALID [2022-02-20 14:02:53,751 INFO L290 TraceCheckUtils]: 21: Hoare triple {1423#true} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1423#true} is VALID [2022-02-20 14:02:53,751 INFO L290 TraceCheckUtils]: 20: Hoare triple {1423#true} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {1423#true} is VALID [2022-02-20 14:02:53,751 INFO L290 TraceCheckUtils]: 19: Hoare triple {1423#true} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1423#true} is VALID [2022-02-20 14:02:53,751 INFO L290 TraceCheckUtils]: 18: Hoare triple {1423#true} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {1423#true} is VALID [2022-02-20 14:02:53,752 INFO L290 TraceCheckUtils]: 17: Hoare triple {1423#true} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1423#true} is VALID [2022-02-20 14:02:53,752 INFO L290 TraceCheckUtils]: 16: Hoare triple {1423#true} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {1423#true} is VALID [2022-02-20 14:02:53,752 INFO L290 TraceCheckUtils]: 15: Hoare triple {1423#true} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1423#true} is VALID [2022-02-20 14:02:53,752 INFO L290 TraceCheckUtils]: 14: Hoare triple {1423#true} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {1423#true} is VALID [2022-02-20 14:02:53,752 INFO L290 TraceCheckUtils]: 13: Hoare triple {1423#true} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1423#true} is VALID [2022-02-20 14:02:53,753 INFO L290 TraceCheckUtils]: 12: Hoare triple {1423#true} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {1423#true} is VALID [2022-02-20 14:02:53,753 INFO L290 TraceCheckUtils]: 11: Hoare triple {1423#true} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1423#true} is VALID [2022-02-20 14:02:53,753 INFO L290 TraceCheckUtils]: 10: Hoare triple {1423#true} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {1423#true} is VALID [2022-02-20 14:02:53,753 INFO L290 TraceCheckUtils]: 9: Hoare triple {1423#true} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1423#true} is VALID [2022-02-20 14:02:53,753 INFO L290 TraceCheckUtils]: 8: Hoare triple {1423#true} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {1423#true} is VALID [2022-02-20 14:02:53,754 INFO L290 TraceCheckUtils]: 7: Hoare triple {1423#true} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1423#true} is VALID [2022-02-20 14:02:53,754 INFO L290 TraceCheckUtils]: 6: Hoare triple {1423#true} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {1423#true} is VALID [2022-02-20 14:02:53,754 INFO L290 TraceCheckUtils]: 5: Hoare triple {1423#true} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1423#true} is VALID [2022-02-20 14:02:53,754 INFO L290 TraceCheckUtils]: 4: Hoare triple {1423#true} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {1423#true} is VALID [2022-02-20 14:02:53,754 INFO L290 TraceCheckUtils]: 3: Hoare triple {1423#true} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1423#true} is VALID [2022-02-20 14:02:53,754 INFO L290 TraceCheckUtils]: 2: Hoare triple {1423#true} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {1423#true} is VALID [2022-02-20 14:02:53,755 INFO L290 TraceCheckUtils]: 1: Hoare triple {1423#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~nondet3#1, main_#t~post1#1, main_#t~mem5#1, main_#t~post4#1, main_#t~mem7#1, main_#t~post6#1, main_#t~mem9#1, main_#t~post8#1, main_#t~mem11#1, main_#t~post10#1, main_#t~mem13#1, main_#t~post12#1, main_#t~mem15#1, main_#t~mem16#1, main_#t~post14#1, main_~#a1~0#1.base, main_~#a1~0#1.offset, main_~#a2~0#1.base, main_~#a2~0#1.offset, main_~#a3~0#1.base, main_~#a3~0#1.offset, main_~#a4~0#1.base, main_~#a4~0#1.offset, main_~#a5~0#1.base, main_~#a5~0#1.offset, main_~#a6~0#1.base, main_~#a6~0#1.offset, main_~a~0#1, main_~i~0#1, main_~x~0#1;call main_~#a1~0#1.base, main_~#a1~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a2~0#1.base, main_~#a2~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a3~0#1.base, main_~#a3~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a4~0#1.base, main_~#a4~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a5~0#1.base, main_~#a5~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a6~0#1.base, main_~#a6~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~a~0#1;main_~a~0#1 := 0; {1423#true} is VALID [2022-02-20 14:02:53,755 INFO L290 TraceCheckUtils]: 0: Hoare triple {1423#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); {1423#true} is VALID [2022-02-20 14:02:53,755 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2022-02-20 14:02:53,756 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1609464256] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 14:02:53,756 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 14:02:53,756 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 5, 5] total 19 [2022-02-20 14:02:53,756 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096957916] [2022-02-20 14:02:53,757 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 14:02:53,758 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 4.157894736842105) internal successors, (79), 19 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 57 [2022-02-20 14:02:53,759 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:02:53,759 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 19 states, 19 states have (on average 4.157894736842105) internal successors, (79), 19 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:02:53,822 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:02:53,823 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-02-20 14:02:53,823 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:02:53,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-02-20 14:02:53,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=237, Unknown=0, NotChecked=0, Total=342 [2022-02-20 14:02:53,824 INFO L87 Difference]: Start difference. First operand 60 states and 66 transitions. Second operand has 19 states, 19 states have (on average 4.157894736842105) internal successors, (79), 19 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:02:54,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:02:54,167 INFO L93 Difference]: Finished difference Result 140 states and 172 transitions. [2022-02-20 14:02:54,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-02-20 14:02:54,167 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 4.157894736842105) internal successors, (79), 19 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 57 [2022-02-20 14:02:54,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:02:54,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 4.157894736842105) internal successors, (79), 19 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:02:54,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 157 transitions. [2022-02-20 14:02:54,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 4.157894736842105) internal successors, (79), 19 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:02:54,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 157 transitions. [2022-02-20 14:02:54,172 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states and 157 transitions. [2022-02-20 14:02:54,278 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 157 edges. 157 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:02:54,280 INFO L225 Difference]: With dead ends: 140 [2022-02-20 14:02:54,280 INFO L226 Difference]: Without dead ends: 103 [2022-02-20 14:02:54,281 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=105, Invalid=237, Unknown=0, NotChecked=0, Total=342 [2022-02-20 14:02:54,281 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 61 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 14:02:54,282 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [61 Valid, 74 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 14:02:54,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2022-02-20 14:02:54,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 102. [2022-02-20 14:02:54,306 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:02:54,307 INFO L82 GeneralOperation]: Start isEquivalent. First operand 103 states. Second operand has 102 states, 101 states have (on average 1.0693069306930694) internal successors, (108), 101 states have internal predecessors, (108), 0 states have call successors, (0), 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:02:54,307 INFO L74 IsIncluded]: Start isIncluded. First operand 103 states. Second operand has 102 states, 101 states have (on average 1.0693069306930694) internal successors, (108), 101 states have internal predecessors, (108), 0 states have call successors, (0), 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:02:54,307 INFO L87 Difference]: Start difference. First operand 103 states. Second operand has 102 states, 101 states have (on average 1.0693069306930694) internal successors, (108), 101 states have internal predecessors, (108), 0 states have call successors, (0), 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:02:54,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:02:54,309 INFO L93 Difference]: Finished difference Result 103 states and 109 transitions. [2022-02-20 14:02:54,310 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 109 transitions. [2022-02-20 14:02:54,310 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:02:54,310 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:02:54,311 INFO L74 IsIncluded]: Start isIncluded. First operand has 102 states, 101 states have (on average 1.0693069306930694) internal successors, (108), 101 states have internal predecessors, (108), 0 states have call successors, (0), 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 103 states. [2022-02-20 14:02:54,311 INFO L87 Difference]: Start difference. First operand has 102 states, 101 states have (on average 1.0693069306930694) internal successors, (108), 101 states have internal predecessors, (108), 0 states have call successors, (0), 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 103 states. [2022-02-20 14:02:54,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:02:54,313 INFO L93 Difference]: Finished difference Result 103 states and 109 transitions. [2022-02-20 14:02:54,313 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 109 transitions. [2022-02-20 14:02:54,314 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:02:54,314 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:02:54,314 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:02:54,314 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:02:54,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 101 states have (on average 1.0693069306930694) internal successors, (108), 101 states have internal predecessors, (108), 0 states have call successors, (0), 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:02:54,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 108 transitions. [2022-02-20 14:02:54,316 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 108 transitions. Word has length 57 [2022-02-20 14:02:54,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:02:54,317 INFO L470 AbstractCegarLoop]: Abstraction has 102 states and 108 transitions. [2022-02-20 14:02:54,317 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 4.157894736842105) internal successors, (79), 19 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:02:54,317 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 108 transitions. [2022-02-20 14:02:54,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-02-20 14:02:54,319 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:02:54,319 INFO L514 BasicCegarLoop]: trace histogram [11, 11, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:02:54,338 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:02:54,536 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:02:54,537 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:02:54,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:02:54,537 INFO L85 PathProgramCache]: Analyzing trace with hash 432076507, now seen corresponding path program 4 times [2022-02-20 14:02:54,537 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:02:54,537 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262497867] [2022-02-20 14:02:54,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:02:54,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:02:54,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:02:54,755 INFO L290 TraceCheckUtils]: 0: Hoare triple {2340#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); {2340#true} is VALID [2022-02-20 14:02:54,756 INFO L290 TraceCheckUtils]: 1: Hoare triple {2340#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~nondet3#1, main_#t~post1#1, main_#t~mem5#1, main_#t~post4#1, main_#t~mem7#1, main_#t~post6#1, main_#t~mem9#1, main_#t~post8#1, main_#t~mem11#1, main_#t~post10#1, main_#t~mem13#1, main_#t~post12#1, main_#t~mem15#1, main_#t~mem16#1, main_#t~post14#1, main_~#a1~0#1.base, main_~#a1~0#1.offset, main_~#a2~0#1.base, main_~#a2~0#1.offset, main_~#a3~0#1.base, main_~#a3~0#1.offset, main_~#a4~0#1.base, main_~#a4~0#1.offset, main_~#a5~0#1.base, main_~#a5~0#1.offset, main_~#a6~0#1.base, main_~#a6~0#1.offset, main_~a~0#1, main_~i~0#1, main_~x~0#1;call main_~#a1~0#1.base, main_~#a1~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a2~0#1.base, main_~#a2~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a3~0#1.base, main_~#a3~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a4~0#1.base, main_~#a4~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a5~0#1.base, main_~#a5~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a6~0#1.base, main_~#a6~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~a~0#1;main_~a~0#1 := 0; {2342#(= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-20 14:02:54,756 INFO L290 TraceCheckUtils]: 2: Hoare triple {2342#(= |ULTIMATE.start_main_~a~0#1| 0)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {2342#(= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-20 14:02:54,757 INFO L290 TraceCheckUtils]: 3: Hoare triple {2342#(= |ULTIMATE.start_main_~a~0#1| 0)} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {2343#(<= |ULTIMATE.start_main_~a~0#1| 1)} is VALID [2022-02-20 14:02:54,757 INFO L290 TraceCheckUtils]: 4: Hoare triple {2343#(<= |ULTIMATE.start_main_~a~0#1| 1)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {2343#(<= |ULTIMATE.start_main_~a~0#1| 1)} is VALID [2022-02-20 14:02:54,758 INFO L290 TraceCheckUtils]: 5: Hoare triple {2343#(<= |ULTIMATE.start_main_~a~0#1| 1)} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {2344#(<= |ULTIMATE.start_main_~a~0#1| 2)} is VALID [2022-02-20 14:02:54,758 INFO L290 TraceCheckUtils]: 6: Hoare triple {2344#(<= |ULTIMATE.start_main_~a~0#1| 2)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {2344#(<= |ULTIMATE.start_main_~a~0#1| 2)} is VALID [2022-02-20 14:02:54,760 INFO L290 TraceCheckUtils]: 7: Hoare triple {2344#(<= |ULTIMATE.start_main_~a~0#1| 2)} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {2345#(<= |ULTIMATE.start_main_~a~0#1| 3)} is VALID [2022-02-20 14:02:54,761 INFO L290 TraceCheckUtils]: 8: Hoare triple {2345#(<= |ULTIMATE.start_main_~a~0#1| 3)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {2345#(<= |ULTIMATE.start_main_~a~0#1| 3)} is VALID [2022-02-20 14:02:54,761 INFO L290 TraceCheckUtils]: 9: Hoare triple {2345#(<= |ULTIMATE.start_main_~a~0#1| 3)} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {2346#(<= |ULTIMATE.start_main_~a~0#1| 4)} is VALID [2022-02-20 14:02:54,761 INFO L290 TraceCheckUtils]: 10: Hoare triple {2346#(<= |ULTIMATE.start_main_~a~0#1| 4)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {2346#(<= |ULTIMATE.start_main_~a~0#1| 4)} is VALID [2022-02-20 14:02:54,762 INFO L290 TraceCheckUtils]: 11: Hoare triple {2346#(<= |ULTIMATE.start_main_~a~0#1| 4)} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {2347#(<= |ULTIMATE.start_main_~a~0#1| 5)} is VALID [2022-02-20 14:02:54,762 INFO L290 TraceCheckUtils]: 12: Hoare triple {2347#(<= |ULTIMATE.start_main_~a~0#1| 5)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {2347#(<= |ULTIMATE.start_main_~a~0#1| 5)} is VALID [2022-02-20 14:02:54,763 INFO L290 TraceCheckUtils]: 13: Hoare triple {2347#(<= |ULTIMATE.start_main_~a~0#1| 5)} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {2348#(<= |ULTIMATE.start_main_~a~0#1| 6)} is VALID [2022-02-20 14:02:54,763 INFO L290 TraceCheckUtils]: 14: Hoare triple {2348#(<= |ULTIMATE.start_main_~a~0#1| 6)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {2348#(<= |ULTIMATE.start_main_~a~0#1| 6)} is VALID [2022-02-20 14:02:54,763 INFO L290 TraceCheckUtils]: 15: Hoare triple {2348#(<= |ULTIMATE.start_main_~a~0#1| 6)} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {2349#(<= |ULTIMATE.start_main_~a~0#1| 7)} is VALID [2022-02-20 14:02:54,764 INFO L290 TraceCheckUtils]: 16: Hoare triple {2349#(<= |ULTIMATE.start_main_~a~0#1| 7)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {2349#(<= |ULTIMATE.start_main_~a~0#1| 7)} is VALID [2022-02-20 14:02:54,764 INFO L290 TraceCheckUtils]: 17: Hoare triple {2349#(<= |ULTIMATE.start_main_~a~0#1| 7)} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {2350#(<= |ULTIMATE.start_main_~a~0#1| 8)} is VALID [2022-02-20 14:02:54,765 INFO L290 TraceCheckUtils]: 18: Hoare triple {2350#(<= |ULTIMATE.start_main_~a~0#1| 8)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {2350#(<= |ULTIMATE.start_main_~a~0#1| 8)} is VALID [2022-02-20 14:02:54,765 INFO L290 TraceCheckUtils]: 19: Hoare triple {2350#(<= |ULTIMATE.start_main_~a~0#1| 8)} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {2351#(<= |ULTIMATE.start_main_~a~0#1| 9)} is VALID [2022-02-20 14:02:54,765 INFO L290 TraceCheckUtils]: 20: Hoare triple {2351#(<= |ULTIMATE.start_main_~a~0#1| 9)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {2351#(<= |ULTIMATE.start_main_~a~0#1| 9)} is VALID [2022-02-20 14:02:54,766 INFO L290 TraceCheckUtils]: 21: Hoare triple {2351#(<= |ULTIMATE.start_main_~a~0#1| 9)} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {2352#(<= |ULTIMATE.start_main_~a~0#1| 10)} is VALID [2022-02-20 14:02:54,766 INFO L290 TraceCheckUtils]: 22: Hoare triple {2352#(<= |ULTIMATE.start_main_~a~0#1| 10)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {2352#(<= |ULTIMATE.start_main_~a~0#1| 10)} is VALID [2022-02-20 14:02:54,766 INFO L290 TraceCheckUtils]: 23: Hoare triple {2352#(<= |ULTIMATE.start_main_~a~0#1| 10)} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {2353#(<= |ULTIMATE.start_main_~a~0#1| 11)} is VALID [2022-02-20 14:02:54,767 INFO L290 TraceCheckUtils]: 24: Hoare triple {2353#(<= |ULTIMATE.start_main_~a~0#1| 11)} assume !(main_~a~0#1 < 100000); {2341#false} is VALID [2022-02-20 14:02:54,767 INFO L290 TraceCheckUtils]: 25: Hoare triple {2341#false} havoc main_~i~0#1;main_~i~0#1 := 0; {2341#false} is VALID [2022-02-20 14:02:54,767 INFO L290 TraceCheckUtils]: 26: Hoare triple {2341#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem5#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem5#1, main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem5#1; {2341#false} is VALID [2022-02-20 14:02:54,767 INFO L290 TraceCheckUtils]: 27: Hoare triple {2341#false} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {2341#false} is VALID [2022-02-20 14:02:54,767 INFO L290 TraceCheckUtils]: 28: Hoare triple {2341#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem5#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem5#1, main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem5#1; {2341#false} is VALID [2022-02-20 14:02:54,768 INFO L290 TraceCheckUtils]: 29: Hoare triple {2341#false} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {2341#false} is VALID [2022-02-20 14:02:54,768 INFO L290 TraceCheckUtils]: 30: Hoare triple {2341#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem5#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem5#1, main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem5#1; {2341#false} is VALID [2022-02-20 14:02:54,768 INFO L290 TraceCheckUtils]: 31: Hoare triple {2341#false} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {2341#false} is VALID [2022-02-20 14:02:54,768 INFO L290 TraceCheckUtils]: 32: Hoare triple {2341#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem5#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem5#1, main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem5#1; {2341#false} is VALID [2022-02-20 14:02:54,768 INFO L290 TraceCheckUtils]: 33: Hoare triple {2341#false} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {2341#false} is VALID [2022-02-20 14:02:54,768 INFO L290 TraceCheckUtils]: 34: Hoare triple {2341#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem5#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem5#1, main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem5#1; {2341#false} is VALID [2022-02-20 14:02:54,769 INFO L290 TraceCheckUtils]: 35: Hoare triple {2341#false} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {2341#false} is VALID [2022-02-20 14:02:54,769 INFO L290 TraceCheckUtils]: 36: Hoare triple {2341#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem5#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem5#1, main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem5#1; {2341#false} is VALID [2022-02-20 14:02:54,769 INFO L290 TraceCheckUtils]: 37: Hoare triple {2341#false} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {2341#false} is VALID [2022-02-20 14:02:54,769 INFO L290 TraceCheckUtils]: 38: Hoare triple {2341#false} assume !(main_~i~0#1 < 100000); {2341#false} is VALID [2022-02-20 14:02:54,769 INFO L290 TraceCheckUtils]: 39: Hoare triple {2341#false} main_~i~0#1 := 0; {2341#false} is VALID [2022-02-20 14:02:54,769 INFO L290 TraceCheckUtils]: 40: Hoare triple {2341#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem7#1 := read~int(main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem7#1, main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem7#1; {2341#false} is VALID [2022-02-20 14:02:54,769 INFO L290 TraceCheckUtils]: 41: Hoare triple {2341#false} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {2341#false} is VALID [2022-02-20 14:02:54,770 INFO L290 TraceCheckUtils]: 42: Hoare triple {2341#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem7#1 := read~int(main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem7#1, main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem7#1; {2341#false} is VALID [2022-02-20 14:02:54,770 INFO L290 TraceCheckUtils]: 43: Hoare triple {2341#false} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {2341#false} is VALID [2022-02-20 14:02:54,770 INFO L290 TraceCheckUtils]: 44: Hoare triple {2341#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem7#1 := read~int(main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem7#1, main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem7#1; {2341#false} is VALID [2022-02-20 14:02:54,770 INFO L290 TraceCheckUtils]: 45: Hoare triple {2341#false} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {2341#false} is VALID [2022-02-20 14:02:54,770 INFO L290 TraceCheckUtils]: 46: Hoare triple {2341#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem7#1 := read~int(main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem7#1, main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem7#1; {2341#false} is VALID [2022-02-20 14:02:54,770 INFO L290 TraceCheckUtils]: 47: Hoare triple {2341#false} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {2341#false} is VALID [2022-02-20 14:02:54,770 INFO L290 TraceCheckUtils]: 48: Hoare triple {2341#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem7#1 := read~int(main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem7#1, main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem7#1; {2341#false} is VALID [2022-02-20 14:02:54,771 INFO L290 TraceCheckUtils]: 49: Hoare triple {2341#false} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {2341#false} is VALID [2022-02-20 14:02:54,771 INFO L290 TraceCheckUtils]: 50: Hoare triple {2341#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem7#1 := read~int(main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem7#1, main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem7#1; {2341#false} is VALID [2022-02-20 14:02:54,771 INFO L290 TraceCheckUtils]: 51: Hoare triple {2341#false} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {2341#false} is VALID [2022-02-20 14:02:54,771 INFO L290 TraceCheckUtils]: 52: Hoare triple {2341#false} assume !(main_~i~0#1 < 100000); {2341#false} is VALID [2022-02-20 14:02:54,771 INFO L290 TraceCheckUtils]: 53: Hoare triple {2341#false} main_~i~0#1 := 0; {2341#false} is VALID [2022-02-20 14:02:54,771 INFO L290 TraceCheckUtils]: 54: Hoare triple {2341#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem9#1 := read~int(main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem9#1, main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem9#1; {2341#false} is VALID [2022-02-20 14:02:54,771 INFO L290 TraceCheckUtils]: 55: Hoare triple {2341#false} main_#t~post8#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; {2341#false} is VALID [2022-02-20 14:02:54,772 INFO L290 TraceCheckUtils]: 56: Hoare triple {2341#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem9#1 := read~int(main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem9#1, main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem9#1; {2341#false} is VALID [2022-02-20 14:02:54,772 INFO L290 TraceCheckUtils]: 57: Hoare triple {2341#false} main_#t~post8#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; {2341#false} is VALID [2022-02-20 14:02:54,772 INFO L290 TraceCheckUtils]: 58: Hoare triple {2341#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem9#1 := read~int(main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem9#1, main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem9#1; {2341#false} is VALID [2022-02-20 14:02:54,772 INFO L290 TraceCheckUtils]: 59: Hoare triple {2341#false} main_#t~post8#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; {2341#false} is VALID [2022-02-20 14:02:54,772 INFO L290 TraceCheckUtils]: 60: Hoare triple {2341#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem9#1 := read~int(main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem9#1, main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem9#1; {2341#false} is VALID [2022-02-20 14:02:54,772 INFO L290 TraceCheckUtils]: 61: Hoare triple {2341#false} main_#t~post8#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; {2341#false} is VALID [2022-02-20 14:02:54,772 INFO L290 TraceCheckUtils]: 62: Hoare triple {2341#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem9#1 := read~int(main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem9#1, main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem9#1; {2341#false} is VALID [2022-02-20 14:02:54,773 INFO L290 TraceCheckUtils]: 63: Hoare triple {2341#false} main_#t~post8#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; {2341#false} is VALID [2022-02-20 14:02:54,773 INFO L290 TraceCheckUtils]: 64: Hoare triple {2341#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem9#1 := read~int(main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem9#1, main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem9#1; {2341#false} is VALID [2022-02-20 14:02:54,773 INFO L290 TraceCheckUtils]: 65: Hoare triple {2341#false} main_#t~post8#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; {2341#false} is VALID [2022-02-20 14:02:54,773 INFO L290 TraceCheckUtils]: 66: Hoare triple {2341#false} assume !(main_~i~0#1 < 100000); {2341#false} is VALID [2022-02-20 14:02:54,773 INFO L290 TraceCheckUtils]: 67: Hoare triple {2341#false} main_~i~0#1 := 0; {2341#false} is VALID [2022-02-20 14:02:54,773 INFO L290 TraceCheckUtils]: 68: Hoare triple {2341#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem11#1 := read~int(main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem11#1, main_~#a6~0#1.base, main_~#a6~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem11#1; {2341#false} is VALID [2022-02-20 14:02:54,773 INFO L290 TraceCheckUtils]: 69: Hoare triple {2341#false} main_#t~post10#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; {2341#false} is VALID [2022-02-20 14:02:54,774 INFO L290 TraceCheckUtils]: 70: Hoare triple {2341#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem11#1 := read~int(main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem11#1, main_~#a6~0#1.base, main_~#a6~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem11#1; {2341#false} is VALID [2022-02-20 14:02:54,774 INFO L290 TraceCheckUtils]: 71: Hoare triple {2341#false} main_#t~post10#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; {2341#false} is VALID [2022-02-20 14:02:54,774 INFO L290 TraceCheckUtils]: 72: Hoare triple {2341#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem11#1 := read~int(main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem11#1, main_~#a6~0#1.base, main_~#a6~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem11#1; {2341#false} is VALID [2022-02-20 14:02:54,774 INFO L290 TraceCheckUtils]: 73: Hoare triple {2341#false} main_#t~post10#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; {2341#false} is VALID [2022-02-20 14:02:54,774 INFO L290 TraceCheckUtils]: 74: Hoare triple {2341#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem11#1 := read~int(main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem11#1, main_~#a6~0#1.base, main_~#a6~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem11#1; {2341#false} is VALID [2022-02-20 14:02:54,774 INFO L290 TraceCheckUtils]: 75: Hoare triple {2341#false} main_#t~post10#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; {2341#false} is VALID [2022-02-20 14:02:54,774 INFO L290 TraceCheckUtils]: 76: Hoare triple {2341#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem11#1 := read~int(main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem11#1, main_~#a6~0#1.base, main_~#a6~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem11#1; {2341#false} is VALID [2022-02-20 14:02:54,775 INFO L290 TraceCheckUtils]: 77: Hoare triple {2341#false} main_#t~post10#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; {2341#false} is VALID [2022-02-20 14:02:54,775 INFO L290 TraceCheckUtils]: 78: Hoare triple {2341#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem11#1 := read~int(main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem11#1, main_~#a6~0#1.base, main_~#a6~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem11#1; {2341#false} is VALID [2022-02-20 14:02:54,775 INFO L290 TraceCheckUtils]: 79: Hoare triple {2341#false} main_#t~post10#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; {2341#false} is VALID [2022-02-20 14:02:54,775 INFO L290 TraceCheckUtils]: 80: Hoare triple {2341#false} assume !(main_~i~0#1 < 100000); {2341#false} is VALID [2022-02-20 14:02:54,775 INFO L290 TraceCheckUtils]: 81: Hoare triple {2341#false} main_~i~0#1 := 0; {2341#false} is VALID [2022-02-20 14:02:54,775 INFO L290 TraceCheckUtils]: 82: Hoare triple {2341#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem13#1 := read~int(main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem13#1, main_~#a6~0#1.base, main_~#a6~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem13#1; {2341#false} is VALID [2022-02-20 14:02:54,775 INFO L290 TraceCheckUtils]: 83: Hoare triple {2341#false} main_#t~post12#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post12#1;havoc main_#t~post12#1; {2341#false} is VALID [2022-02-20 14:02:54,776 INFO L290 TraceCheckUtils]: 84: Hoare triple {2341#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem13#1 := read~int(main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem13#1, main_~#a6~0#1.base, main_~#a6~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem13#1; {2341#false} is VALID [2022-02-20 14:02:54,776 INFO L290 TraceCheckUtils]: 85: Hoare triple {2341#false} main_#t~post12#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post12#1;havoc main_#t~post12#1; {2341#false} is VALID [2022-02-20 14:02:54,776 INFO L290 TraceCheckUtils]: 86: Hoare triple {2341#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem13#1 := read~int(main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem13#1, main_~#a6~0#1.base, main_~#a6~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem13#1; {2341#false} is VALID [2022-02-20 14:02:54,776 INFO L290 TraceCheckUtils]: 87: Hoare triple {2341#false} main_#t~post12#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post12#1;havoc main_#t~post12#1; {2341#false} is VALID [2022-02-20 14:02:54,776 INFO L290 TraceCheckUtils]: 88: Hoare triple {2341#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem13#1 := read~int(main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem13#1, main_~#a6~0#1.base, main_~#a6~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem13#1; {2341#false} is VALID [2022-02-20 14:02:54,776 INFO L290 TraceCheckUtils]: 89: Hoare triple {2341#false} main_#t~post12#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post12#1;havoc main_#t~post12#1; {2341#false} is VALID [2022-02-20 14:02:54,776 INFO L290 TraceCheckUtils]: 90: Hoare triple {2341#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem13#1 := read~int(main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem13#1, main_~#a6~0#1.base, main_~#a6~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem13#1; {2341#false} is VALID [2022-02-20 14:02:54,777 INFO L290 TraceCheckUtils]: 91: Hoare triple {2341#false} main_#t~post12#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post12#1;havoc main_#t~post12#1; {2341#false} is VALID [2022-02-20 14:02:54,777 INFO L290 TraceCheckUtils]: 92: Hoare triple {2341#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem13#1 := read~int(main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem13#1, main_~#a6~0#1.base, main_~#a6~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem13#1; {2341#false} is VALID [2022-02-20 14:02:54,777 INFO L290 TraceCheckUtils]: 93: Hoare triple {2341#false} main_#t~post12#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post12#1;havoc main_#t~post12#1; {2341#false} is VALID [2022-02-20 14:02:54,777 INFO L290 TraceCheckUtils]: 94: Hoare triple {2341#false} assume !(main_~i~0#1 < 100000); {2341#false} is VALID [2022-02-20 14:02:54,777 INFO L290 TraceCheckUtils]: 95: Hoare triple {2341#false} havoc main_~x~0#1;main_~x~0#1 := 0; {2341#false} is VALID [2022-02-20 14:02:54,777 INFO L290 TraceCheckUtils]: 96: Hoare triple {2341#false} assume !!(main_~x~0#1 < 100000);call main_#t~mem15#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~x~0#1, 4);call main_#t~mem16#1 := read~int(main_~#a6~0#1.base, main_~#a6~0#1.offset + 4 * main_~x~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem15#1 == main_#t~mem16#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {2341#false} is VALID [2022-02-20 14:02:54,777 INFO L290 TraceCheckUtils]: 97: Hoare triple {2341#false} assume 0 == __VERIFIER_assert_~cond#1; {2341#false} is VALID [2022-02-20 14:02:54,778 INFO L290 TraceCheckUtils]: 98: Hoare triple {2341#false} assume !false; {2341#false} is VALID [2022-02-20 14:02:54,778 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2022-02-20 14:02:54,778 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:02:54,779 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262497867] [2022-02-20 14:02:54,779 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1262497867] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 14:02:54,779 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [840926555] [2022-02-20 14:02:54,779 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-02-20 14:02:54,779 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:02:54,779 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:02:54,781 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:02:54,782 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:02:54,962 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-02-20 14:02:54,962 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 14:02:54,964 INFO L263 TraceCheckSpWp]: Trace formula consists of 542 conjuncts, 13 conjunts are in the unsatisfiable core [2022-02-20 14:02:54,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:02:54,984 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:02:55,213 INFO L290 TraceCheckUtils]: 0: Hoare triple {2340#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); {2340#true} is VALID [2022-02-20 14:02:55,214 INFO L290 TraceCheckUtils]: 1: Hoare triple {2340#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~nondet3#1, main_#t~post1#1, main_#t~mem5#1, main_#t~post4#1, main_#t~mem7#1, main_#t~post6#1, main_#t~mem9#1, main_#t~post8#1, main_#t~mem11#1, main_#t~post10#1, main_#t~mem13#1, main_#t~post12#1, main_#t~mem15#1, main_#t~mem16#1, main_#t~post14#1, main_~#a1~0#1.base, main_~#a1~0#1.offset, main_~#a2~0#1.base, main_~#a2~0#1.offset, main_~#a3~0#1.base, main_~#a3~0#1.offset, main_~#a4~0#1.base, main_~#a4~0#1.offset, main_~#a5~0#1.base, main_~#a5~0#1.offset, main_~#a6~0#1.base, main_~#a6~0#1.offset, main_~a~0#1, main_~i~0#1, main_~x~0#1;call main_~#a1~0#1.base, main_~#a1~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a2~0#1.base, main_~#a2~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a3~0#1.base, main_~#a3~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a4~0#1.base, main_~#a4~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a5~0#1.base, main_~#a5~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a6~0#1.base, main_~#a6~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~a~0#1;main_~a~0#1 := 0; {2360#(<= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-20 14:02:55,214 INFO L290 TraceCheckUtils]: 2: Hoare triple {2360#(<= |ULTIMATE.start_main_~a~0#1| 0)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {2360#(<= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-20 14:02:55,214 INFO L290 TraceCheckUtils]: 3: Hoare triple {2360#(<= |ULTIMATE.start_main_~a~0#1| 0)} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {2343#(<= |ULTIMATE.start_main_~a~0#1| 1)} is VALID [2022-02-20 14:02:55,215 INFO L290 TraceCheckUtils]: 4: Hoare triple {2343#(<= |ULTIMATE.start_main_~a~0#1| 1)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {2343#(<= |ULTIMATE.start_main_~a~0#1| 1)} is VALID [2022-02-20 14:02:55,215 INFO L290 TraceCheckUtils]: 5: Hoare triple {2343#(<= |ULTIMATE.start_main_~a~0#1| 1)} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {2344#(<= |ULTIMATE.start_main_~a~0#1| 2)} is VALID [2022-02-20 14:02:55,215 INFO L290 TraceCheckUtils]: 6: Hoare triple {2344#(<= |ULTIMATE.start_main_~a~0#1| 2)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {2344#(<= |ULTIMATE.start_main_~a~0#1| 2)} is VALID [2022-02-20 14:02:55,216 INFO L290 TraceCheckUtils]: 7: Hoare triple {2344#(<= |ULTIMATE.start_main_~a~0#1| 2)} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {2345#(<= |ULTIMATE.start_main_~a~0#1| 3)} is VALID [2022-02-20 14:02:55,216 INFO L290 TraceCheckUtils]: 8: Hoare triple {2345#(<= |ULTIMATE.start_main_~a~0#1| 3)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {2345#(<= |ULTIMATE.start_main_~a~0#1| 3)} is VALID [2022-02-20 14:02:55,216 INFO L290 TraceCheckUtils]: 9: Hoare triple {2345#(<= |ULTIMATE.start_main_~a~0#1| 3)} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {2346#(<= |ULTIMATE.start_main_~a~0#1| 4)} is VALID [2022-02-20 14:02:55,217 INFO L290 TraceCheckUtils]: 10: Hoare triple {2346#(<= |ULTIMATE.start_main_~a~0#1| 4)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {2346#(<= |ULTIMATE.start_main_~a~0#1| 4)} is VALID [2022-02-20 14:02:55,217 INFO L290 TraceCheckUtils]: 11: Hoare triple {2346#(<= |ULTIMATE.start_main_~a~0#1| 4)} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {2347#(<= |ULTIMATE.start_main_~a~0#1| 5)} is VALID [2022-02-20 14:02:55,217 INFO L290 TraceCheckUtils]: 12: Hoare triple {2347#(<= |ULTIMATE.start_main_~a~0#1| 5)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {2347#(<= |ULTIMATE.start_main_~a~0#1| 5)} is VALID [2022-02-20 14:02:55,218 INFO L290 TraceCheckUtils]: 13: Hoare triple {2347#(<= |ULTIMATE.start_main_~a~0#1| 5)} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {2348#(<= |ULTIMATE.start_main_~a~0#1| 6)} is VALID [2022-02-20 14:02:55,218 INFO L290 TraceCheckUtils]: 14: Hoare triple {2348#(<= |ULTIMATE.start_main_~a~0#1| 6)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {2348#(<= |ULTIMATE.start_main_~a~0#1| 6)} is VALID [2022-02-20 14:02:55,218 INFO L290 TraceCheckUtils]: 15: Hoare triple {2348#(<= |ULTIMATE.start_main_~a~0#1| 6)} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {2349#(<= |ULTIMATE.start_main_~a~0#1| 7)} is VALID [2022-02-20 14:02:55,219 INFO L290 TraceCheckUtils]: 16: Hoare triple {2349#(<= |ULTIMATE.start_main_~a~0#1| 7)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {2349#(<= |ULTIMATE.start_main_~a~0#1| 7)} is VALID [2022-02-20 14:02:55,219 INFO L290 TraceCheckUtils]: 17: Hoare triple {2349#(<= |ULTIMATE.start_main_~a~0#1| 7)} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {2350#(<= |ULTIMATE.start_main_~a~0#1| 8)} is VALID [2022-02-20 14:02:55,219 INFO L290 TraceCheckUtils]: 18: Hoare triple {2350#(<= |ULTIMATE.start_main_~a~0#1| 8)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {2350#(<= |ULTIMATE.start_main_~a~0#1| 8)} is VALID [2022-02-20 14:02:55,220 INFO L290 TraceCheckUtils]: 19: Hoare triple {2350#(<= |ULTIMATE.start_main_~a~0#1| 8)} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {2351#(<= |ULTIMATE.start_main_~a~0#1| 9)} is VALID [2022-02-20 14:02:55,220 INFO L290 TraceCheckUtils]: 20: Hoare triple {2351#(<= |ULTIMATE.start_main_~a~0#1| 9)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {2351#(<= |ULTIMATE.start_main_~a~0#1| 9)} is VALID [2022-02-20 14:02:55,220 INFO L290 TraceCheckUtils]: 21: Hoare triple {2351#(<= |ULTIMATE.start_main_~a~0#1| 9)} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {2352#(<= |ULTIMATE.start_main_~a~0#1| 10)} is VALID [2022-02-20 14:02:55,221 INFO L290 TraceCheckUtils]: 22: Hoare triple {2352#(<= |ULTIMATE.start_main_~a~0#1| 10)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {2352#(<= |ULTIMATE.start_main_~a~0#1| 10)} is VALID [2022-02-20 14:02:55,221 INFO L290 TraceCheckUtils]: 23: Hoare triple {2352#(<= |ULTIMATE.start_main_~a~0#1| 10)} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {2353#(<= |ULTIMATE.start_main_~a~0#1| 11)} is VALID [2022-02-20 14:02:55,221 INFO L290 TraceCheckUtils]: 24: Hoare triple {2353#(<= |ULTIMATE.start_main_~a~0#1| 11)} assume !(main_~a~0#1 < 100000); {2341#false} is VALID [2022-02-20 14:02:55,221 INFO L290 TraceCheckUtils]: 25: Hoare triple {2341#false} havoc main_~i~0#1;main_~i~0#1 := 0; {2341#false} is VALID [2022-02-20 14:02:55,222 INFO L290 TraceCheckUtils]: 26: Hoare triple {2341#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem5#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem5#1, main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem5#1; {2341#false} is VALID [2022-02-20 14:02:55,222 INFO L290 TraceCheckUtils]: 27: Hoare triple {2341#false} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {2341#false} is VALID [2022-02-20 14:02:55,222 INFO L290 TraceCheckUtils]: 28: Hoare triple {2341#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem5#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem5#1, main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem5#1; {2341#false} is VALID [2022-02-20 14:02:55,222 INFO L290 TraceCheckUtils]: 29: Hoare triple {2341#false} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {2341#false} is VALID [2022-02-20 14:02:55,222 INFO L290 TraceCheckUtils]: 30: Hoare triple {2341#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem5#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem5#1, main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem5#1; {2341#false} is VALID [2022-02-20 14:02:55,222 INFO L290 TraceCheckUtils]: 31: Hoare triple {2341#false} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {2341#false} is VALID [2022-02-20 14:02:55,222 INFO L290 TraceCheckUtils]: 32: Hoare triple {2341#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem5#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem5#1, main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem5#1; {2341#false} is VALID [2022-02-20 14:02:55,222 INFO L290 TraceCheckUtils]: 33: Hoare triple {2341#false} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {2341#false} is VALID [2022-02-20 14:02:55,223 INFO L290 TraceCheckUtils]: 34: Hoare triple {2341#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem5#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem5#1, main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem5#1; {2341#false} is VALID [2022-02-20 14:02:55,223 INFO L290 TraceCheckUtils]: 35: Hoare triple {2341#false} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {2341#false} is VALID [2022-02-20 14:02:55,223 INFO L290 TraceCheckUtils]: 36: Hoare triple {2341#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem5#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem5#1, main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem5#1; {2341#false} is VALID [2022-02-20 14:02:55,223 INFO L290 TraceCheckUtils]: 37: Hoare triple {2341#false} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {2341#false} is VALID [2022-02-20 14:02:55,223 INFO L290 TraceCheckUtils]: 38: Hoare triple {2341#false} assume !(main_~i~0#1 < 100000); {2341#false} is VALID [2022-02-20 14:02:55,223 INFO L290 TraceCheckUtils]: 39: Hoare triple {2341#false} main_~i~0#1 := 0; {2341#false} is VALID [2022-02-20 14:02:55,223 INFO L290 TraceCheckUtils]: 40: Hoare triple {2341#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem7#1 := read~int(main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem7#1, main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem7#1; {2341#false} is VALID [2022-02-20 14:02:55,223 INFO L290 TraceCheckUtils]: 41: Hoare triple {2341#false} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {2341#false} is VALID [2022-02-20 14:02:55,224 INFO L290 TraceCheckUtils]: 42: Hoare triple {2341#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem7#1 := read~int(main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem7#1, main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem7#1; {2341#false} is VALID [2022-02-20 14:02:55,224 INFO L290 TraceCheckUtils]: 43: Hoare triple {2341#false} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {2341#false} is VALID [2022-02-20 14:02:55,224 INFO L290 TraceCheckUtils]: 44: Hoare triple {2341#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem7#1 := read~int(main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem7#1, main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem7#1; {2341#false} is VALID [2022-02-20 14:02:55,224 INFO L290 TraceCheckUtils]: 45: Hoare triple {2341#false} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {2341#false} is VALID [2022-02-20 14:02:55,224 INFO L290 TraceCheckUtils]: 46: Hoare triple {2341#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem7#1 := read~int(main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem7#1, main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem7#1; {2341#false} is VALID [2022-02-20 14:02:55,224 INFO L290 TraceCheckUtils]: 47: Hoare triple {2341#false} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {2341#false} is VALID [2022-02-20 14:02:55,224 INFO L290 TraceCheckUtils]: 48: Hoare triple {2341#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem7#1 := read~int(main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem7#1, main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem7#1; {2341#false} is VALID [2022-02-20 14:02:55,224 INFO L290 TraceCheckUtils]: 49: Hoare triple {2341#false} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {2341#false} is VALID [2022-02-20 14:02:55,225 INFO L290 TraceCheckUtils]: 50: Hoare triple {2341#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem7#1 := read~int(main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem7#1, main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem7#1; {2341#false} is VALID [2022-02-20 14:02:55,225 INFO L290 TraceCheckUtils]: 51: Hoare triple {2341#false} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {2341#false} is VALID [2022-02-20 14:02:55,225 INFO L290 TraceCheckUtils]: 52: Hoare triple {2341#false} assume !(main_~i~0#1 < 100000); {2341#false} is VALID [2022-02-20 14:02:55,225 INFO L290 TraceCheckUtils]: 53: Hoare triple {2341#false} main_~i~0#1 := 0; {2341#false} is VALID [2022-02-20 14:02:55,225 INFO L290 TraceCheckUtils]: 54: Hoare triple {2341#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem9#1 := read~int(main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem9#1, main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem9#1; {2341#false} is VALID [2022-02-20 14:02:55,225 INFO L290 TraceCheckUtils]: 55: Hoare triple {2341#false} main_#t~post8#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; {2341#false} is VALID [2022-02-20 14:02:55,225 INFO L290 TraceCheckUtils]: 56: Hoare triple {2341#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem9#1 := read~int(main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem9#1, main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem9#1; {2341#false} is VALID [2022-02-20 14:02:55,225 INFO L290 TraceCheckUtils]: 57: Hoare triple {2341#false} main_#t~post8#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; {2341#false} is VALID [2022-02-20 14:02:55,225 INFO L290 TraceCheckUtils]: 58: Hoare triple {2341#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem9#1 := read~int(main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem9#1, main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem9#1; {2341#false} is VALID [2022-02-20 14:02:55,226 INFO L290 TraceCheckUtils]: 59: Hoare triple {2341#false} main_#t~post8#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; {2341#false} is VALID [2022-02-20 14:02:55,226 INFO L290 TraceCheckUtils]: 60: Hoare triple {2341#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem9#1 := read~int(main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem9#1, main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem9#1; {2341#false} is VALID [2022-02-20 14:02:55,226 INFO L290 TraceCheckUtils]: 61: Hoare triple {2341#false} main_#t~post8#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; {2341#false} is VALID [2022-02-20 14:02:55,226 INFO L290 TraceCheckUtils]: 62: Hoare triple {2341#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem9#1 := read~int(main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem9#1, main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem9#1; {2341#false} is VALID [2022-02-20 14:02:55,226 INFO L290 TraceCheckUtils]: 63: Hoare triple {2341#false} main_#t~post8#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; {2341#false} is VALID [2022-02-20 14:02:55,226 INFO L290 TraceCheckUtils]: 64: Hoare triple {2341#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem9#1 := read~int(main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem9#1, main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem9#1; {2341#false} is VALID [2022-02-20 14:02:55,226 INFO L290 TraceCheckUtils]: 65: Hoare triple {2341#false} main_#t~post8#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; {2341#false} is VALID [2022-02-20 14:02:55,226 INFO L290 TraceCheckUtils]: 66: Hoare triple {2341#false} assume !(main_~i~0#1 < 100000); {2341#false} is VALID [2022-02-20 14:02:55,227 INFO L290 TraceCheckUtils]: 67: Hoare triple {2341#false} main_~i~0#1 := 0; {2341#false} is VALID [2022-02-20 14:02:55,227 INFO L290 TraceCheckUtils]: 68: Hoare triple {2341#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem11#1 := read~int(main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem11#1, main_~#a6~0#1.base, main_~#a6~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem11#1; {2341#false} is VALID [2022-02-20 14:02:55,227 INFO L290 TraceCheckUtils]: 69: Hoare triple {2341#false} main_#t~post10#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; {2341#false} is VALID [2022-02-20 14:02:55,227 INFO L290 TraceCheckUtils]: 70: Hoare triple {2341#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem11#1 := read~int(main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem11#1, main_~#a6~0#1.base, main_~#a6~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem11#1; {2341#false} is VALID [2022-02-20 14:02:55,227 INFO L290 TraceCheckUtils]: 71: Hoare triple {2341#false} main_#t~post10#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; {2341#false} is VALID [2022-02-20 14:02:55,227 INFO L290 TraceCheckUtils]: 72: Hoare triple {2341#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem11#1 := read~int(main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem11#1, main_~#a6~0#1.base, main_~#a6~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem11#1; {2341#false} is VALID [2022-02-20 14:02:55,227 INFO L290 TraceCheckUtils]: 73: Hoare triple {2341#false} main_#t~post10#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; {2341#false} is VALID [2022-02-20 14:02:55,227 INFO L290 TraceCheckUtils]: 74: Hoare triple {2341#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem11#1 := read~int(main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem11#1, main_~#a6~0#1.base, main_~#a6~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem11#1; {2341#false} is VALID [2022-02-20 14:02:55,228 INFO L290 TraceCheckUtils]: 75: Hoare triple {2341#false} main_#t~post10#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; {2341#false} is VALID [2022-02-20 14:02:55,228 INFO L290 TraceCheckUtils]: 76: Hoare triple {2341#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem11#1 := read~int(main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem11#1, main_~#a6~0#1.base, main_~#a6~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem11#1; {2341#false} is VALID [2022-02-20 14:02:55,228 INFO L290 TraceCheckUtils]: 77: Hoare triple {2341#false} main_#t~post10#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; {2341#false} is VALID [2022-02-20 14:02:55,228 INFO L290 TraceCheckUtils]: 78: Hoare triple {2341#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem11#1 := read~int(main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem11#1, main_~#a6~0#1.base, main_~#a6~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem11#1; {2341#false} is VALID [2022-02-20 14:02:55,228 INFO L290 TraceCheckUtils]: 79: Hoare triple {2341#false} main_#t~post10#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; {2341#false} is VALID [2022-02-20 14:02:55,228 INFO L290 TraceCheckUtils]: 80: Hoare triple {2341#false} assume !(main_~i~0#1 < 100000); {2341#false} is VALID [2022-02-20 14:02:55,228 INFO L290 TraceCheckUtils]: 81: Hoare triple {2341#false} main_~i~0#1 := 0; {2341#false} is VALID [2022-02-20 14:02:55,228 INFO L290 TraceCheckUtils]: 82: Hoare triple {2341#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem13#1 := read~int(main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem13#1, main_~#a6~0#1.base, main_~#a6~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem13#1; {2341#false} is VALID [2022-02-20 14:02:55,229 INFO L290 TraceCheckUtils]: 83: Hoare triple {2341#false} main_#t~post12#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post12#1;havoc main_#t~post12#1; {2341#false} is VALID [2022-02-20 14:02:55,229 INFO L290 TraceCheckUtils]: 84: Hoare triple {2341#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem13#1 := read~int(main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem13#1, main_~#a6~0#1.base, main_~#a6~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem13#1; {2341#false} is VALID [2022-02-20 14:02:55,229 INFO L290 TraceCheckUtils]: 85: Hoare triple {2341#false} main_#t~post12#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post12#1;havoc main_#t~post12#1; {2341#false} is VALID [2022-02-20 14:02:55,229 INFO L290 TraceCheckUtils]: 86: Hoare triple {2341#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem13#1 := read~int(main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem13#1, main_~#a6~0#1.base, main_~#a6~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem13#1; {2341#false} is VALID [2022-02-20 14:02:55,229 INFO L290 TraceCheckUtils]: 87: Hoare triple {2341#false} main_#t~post12#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post12#1;havoc main_#t~post12#1; {2341#false} is VALID [2022-02-20 14:02:55,229 INFO L290 TraceCheckUtils]: 88: Hoare triple {2341#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem13#1 := read~int(main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem13#1, main_~#a6~0#1.base, main_~#a6~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem13#1; {2341#false} is VALID [2022-02-20 14:02:55,229 INFO L290 TraceCheckUtils]: 89: Hoare triple {2341#false} main_#t~post12#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post12#1;havoc main_#t~post12#1; {2341#false} is VALID [2022-02-20 14:02:55,229 INFO L290 TraceCheckUtils]: 90: Hoare triple {2341#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem13#1 := read~int(main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem13#1, main_~#a6~0#1.base, main_~#a6~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem13#1; {2341#false} is VALID [2022-02-20 14:02:55,229 INFO L290 TraceCheckUtils]: 91: Hoare triple {2341#false} main_#t~post12#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post12#1;havoc main_#t~post12#1; {2341#false} is VALID [2022-02-20 14:02:55,230 INFO L290 TraceCheckUtils]: 92: Hoare triple {2341#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem13#1 := read~int(main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem13#1, main_~#a6~0#1.base, main_~#a6~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem13#1; {2341#false} is VALID [2022-02-20 14:02:55,230 INFO L290 TraceCheckUtils]: 93: Hoare triple {2341#false} main_#t~post12#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post12#1;havoc main_#t~post12#1; {2341#false} is VALID [2022-02-20 14:02:55,230 INFO L290 TraceCheckUtils]: 94: Hoare triple {2341#false} assume !(main_~i~0#1 < 100000); {2341#false} is VALID [2022-02-20 14:02:55,230 INFO L290 TraceCheckUtils]: 95: Hoare triple {2341#false} havoc main_~x~0#1;main_~x~0#1 := 0; {2341#false} is VALID [2022-02-20 14:02:55,230 INFO L290 TraceCheckUtils]: 96: Hoare triple {2341#false} assume !!(main_~x~0#1 < 100000);call main_#t~mem15#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~x~0#1, 4);call main_#t~mem16#1 := read~int(main_~#a6~0#1.base, main_~#a6~0#1.offset + 4 * main_~x~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem15#1 == main_#t~mem16#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {2341#false} is VALID [2022-02-20 14:02:55,230 INFO L290 TraceCheckUtils]: 97: Hoare triple {2341#false} assume 0 == __VERIFIER_assert_~cond#1; {2341#false} is VALID [2022-02-20 14:02:55,230 INFO L290 TraceCheckUtils]: 98: Hoare triple {2341#false} assume !false; {2341#false} is VALID [2022-02-20 14:02:55,231 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2022-02-20 14:02:55,231 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 14:02:55,726 INFO L290 TraceCheckUtils]: 98: Hoare triple {2341#false} assume !false; {2341#false} is VALID [2022-02-20 14:02:55,726 INFO L290 TraceCheckUtils]: 97: Hoare triple {2341#false} assume 0 == __VERIFIER_assert_~cond#1; {2341#false} is VALID [2022-02-20 14:02:55,726 INFO L290 TraceCheckUtils]: 96: Hoare triple {2341#false} assume !!(main_~x~0#1 < 100000);call main_#t~mem15#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~x~0#1, 4);call main_#t~mem16#1 := read~int(main_~#a6~0#1.base, main_~#a6~0#1.offset + 4 * main_~x~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem15#1 == main_#t~mem16#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {2341#false} is VALID [2022-02-20 14:02:55,726 INFO L290 TraceCheckUtils]: 95: Hoare triple {2341#false} havoc main_~x~0#1;main_~x~0#1 := 0; {2341#false} is VALID [2022-02-20 14:02:55,726 INFO L290 TraceCheckUtils]: 94: Hoare triple {2341#false} assume !(main_~i~0#1 < 100000); {2341#false} is VALID [2022-02-20 14:02:55,727 INFO L290 TraceCheckUtils]: 93: Hoare triple {2341#false} main_#t~post12#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post12#1;havoc main_#t~post12#1; {2341#false} is VALID [2022-02-20 14:02:55,727 INFO L290 TraceCheckUtils]: 92: Hoare triple {2341#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem13#1 := read~int(main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem13#1, main_~#a6~0#1.base, main_~#a6~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem13#1; {2341#false} is VALID [2022-02-20 14:02:55,727 INFO L290 TraceCheckUtils]: 91: Hoare triple {2341#false} main_#t~post12#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post12#1;havoc main_#t~post12#1; {2341#false} is VALID [2022-02-20 14:02:55,727 INFO L290 TraceCheckUtils]: 90: Hoare triple {2341#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem13#1 := read~int(main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem13#1, main_~#a6~0#1.base, main_~#a6~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem13#1; {2341#false} is VALID [2022-02-20 14:02:55,727 INFO L290 TraceCheckUtils]: 89: Hoare triple {2341#false} main_#t~post12#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post12#1;havoc main_#t~post12#1; {2341#false} is VALID [2022-02-20 14:02:55,727 INFO L290 TraceCheckUtils]: 88: Hoare triple {2341#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem13#1 := read~int(main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem13#1, main_~#a6~0#1.base, main_~#a6~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem13#1; {2341#false} is VALID [2022-02-20 14:02:55,727 INFO L290 TraceCheckUtils]: 87: Hoare triple {2341#false} main_#t~post12#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post12#1;havoc main_#t~post12#1; {2341#false} is VALID [2022-02-20 14:02:55,727 INFO L290 TraceCheckUtils]: 86: Hoare triple {2341#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem13#1 := read~int(main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem13#1, main_~#a6~0#1.base, main_~#a6~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem13#1; {2341#false} is VALID [2022-02-20 14:02:55,728 INFO L290 TraceCheckUtils]: 85: Hoare triple {2341#false} main_#t~post12#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post12#1;havoc main_#t~post12#1; {2341#false} is VALID [2022-02-20 14:02:55,728 INFO L290 TraceCheckUtils]: 84: Hoare triple {2341#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem13#1 := read~int(main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem13#1, main_~#a6~0#1.base, main_~#a6~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem13#1; {2341#false} is VALID [2022-02-20 14:02:55,728 INFO L290 TraceCheckUtils]: 83: Hoare triple {2341#false} main_#t~post12#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post12#1;havoc main_#t~post12#1; {2341#false} is VALID [2022-02-20 14:02:55,728 INFO L290 TraceCheckUtils]: 82: Hoare triple {2341#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem13#1 := read~int(main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem13#1, main_~#a6~0#1.base, main_~#a6~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem13#1; {2341#false} is VALID [2022-02-20 14:02:55,728 INFO L290 TraceCheckUtils]: 81: Hoare triple {2341#false} main_~i~0#1 := 0; {2341#false} is VALID [2022-02-20 14:02:55,728 INFO L290 TraceCheckUtils]: 80: Hoare triple {2341#false} assume !(main_~i~0#1 < 100000); {2341#false} is VALID [2022-02-20 14:02:55,728 INFO L290 TraceCheckUtils]: 79: Hoare triple {2341#false} main_#t~post10#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; {2341#false} is VALID [2022-02-20 14:02:55,729 INFO L290 TraceCheckUtils]: 78: Hoare triple {2341#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem11#1 := read~int(main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem11#1, main_~#a6~0#1.base, main_~#a6~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem11#1; {2341#false} is VALID [2022-02-20 14:02:55,729 INFO L290 TraceCheckUtils]: 77: Hoare triple {2341#false} main_#t~post10#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; {2341#false} is VALID [2022-02-20 14:02:55,729 INFO L290 TraceCheckUtils]: 76: Hoare triple {2341#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem11#1 := read~int(main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem11#1, main_~#a6~0#1.base, main_~#a6~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem11#1; {2341#false} is VALID [2022-02-20 14:02:55,729 INFO L290 TraceCheckUtils]: 75: Hoare triple {2341#false} main_#t~post10#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; {2341#false} is VALID [2022-02-20 14:02:55,729 INFO L290 TraceCheckUtils]: 74: Hoare triple {2341#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem11#1 := read~int(main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem11#1, main_~#a6~0#1.base, main_~#a6~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem11#1; {2341#false} is VALID [2022-02-20 14:02:55,729 INFO L290 TraceCheckUtils]: 73: Hoare triple {2341#false} main_#t~post10#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; {2341#false} is VALID [2022-02-20 14:02:55,729 INFO L290 TraceCheckUtils]: 72: Hoare triple {2341#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem11#1 := read~int(main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem11#1, main_~#a6~0#1.base, main_~#a6~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem11#1; {2341#false} is VALID [2022-02-20 14:02:55,729 INFO L290 TraceCheckUtils]: 71: Hoare triple {2341#false} main_#t~post10#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; {2341#false} is VALID [2022-02-20 14:02:55,730 INFO L290 TraceCheckUtils]: 70: Hoare triple {2341#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem11#1 := read~int(main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem11#1, main_~#a6~0#1.base, main_~#a6~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem11#1; {2341#false} is VALID [2022-02-20 14:02:55,730 INFO L290 TraceCheckUtils]: 69: Hoare triple {2341#false} main_#t~post10#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; {2341#false} is VALID [2022-02-20 14:02:55,730 INFO L290 TraceCheckUtils]: 68: Hoare triple {2341#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem11#1 := read~int(main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem11#1, main_~#a6~0#1.base, main_~#a6~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem11#1; {2341#false} is VALID [2022-02-20 14:02:55,730 INFO L290 TraceCheckUtils]: 67: Hoare triple {2341#false} main_~i~0#1 := 0; {2341#false} is VALID [2022-02-20 14:02:55,730 INFO L290 TraceCheckUtils]: 66: Hoare triple {2341#false} assume !(main_~i~0#1 < 100000); {2341#false} is VALID [2022-02-20 14:02:55,730 INFO L290 TraceCheckUtils]: 65: Hoare triple {2341#false} main_#t~post8#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; {2341#false} is VALID [2022-02-20 14:02:55,730 INFO L290 TraceCheckUtils]: 64: Hoare triple {2341#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem9#1 := read~int(main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem9#1, main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem9#1; {2341#false} is VALID [2022-02-20 14:02:55,731 INFO L290 TraceCheckUtils]: 63: Hoare triple {2341#false} main_#t~post8#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; {2341#false} is VALID [2022-02-20 14:02:55,731 INFO L290 TraceCheckUtils]: 62: Hoare triple {2341#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem9#1 := read~int(main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem9#1, main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem9#1; {2341#false} is VALID [2022-02-20 14:02:55,731 INFO L290 TraceCheckUtils]: 61: Hoare triple {2341#false} main_#t~post8#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; {2341#false} is VALID [2022-02-20 14:02:55,731 INFO L290 TraceCheckUtils]: 60: Hoare triple {2341#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem9#1 := read~int(main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem9#1, main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem9#1; {2341#false} is VALID [2022-02-20 14:02:55,731 INFO L290 TraceCheckUtils]: 59: Hoare triple {2341#false} main_#t~post8#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; {2341#false} is VALID [2022-02-20 14:02:55,731 INFO L290 TraceCheckUtils]: 58: Hoare triple {2341#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem9#1 := read~int(main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem9#1, main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem9#1; {2341#false} is VALID [2022-02-20 14:02:55,731 INFO L290 TraceCheckUtils]: 57: Hoare triple {2341#false} main_#t~post8#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; {2341#false} is VALID [2022-02-20 14:02:55,731 INFO L290 TraceCheckUtils]: 56: Hoare triple {2341#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem9#1 := read~int(main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem9#1, main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem9#1; {2341#false} is VALID [2022-02-20 14:02:55,732 INFO L290 TraceCheckUtils]: 55: Hoare triple {2341#false} main_#t~post8#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; {2341#false} is VALID [2022-02-20 14:02:55,732 INFO L290 TraceCheckUtils]: 54: Hoare triple {2341#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem9#1 := read~int(main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem9#1, main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem9#1; {2341#false} is VALID [2022-02-20 14:02:55,732 INFO L290 TraceCheckUtils]: 53: Hoare triple {2341#false} main_~i~0#1 := 0; {2341#false} is VALID [2022-02-20 14:02:55,732 INFO L290 TraceCheckUtils]: 52: Hoare triple {2341#false} assume !(main_~i~0#1 < 100000); {2341#false} is VALID [2022-02-20 14:02:55,732 INFO L290 TraceCheckUtils]: 51: Hoare triple {2341#false} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {2341#false} is VALID [2022-02-20 14:02:55,732 INFO L290 TraceCheckUtils]: 50: Hoare triple {2341#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem7#1 := read~int(main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem7#1, main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem7#1; {2341#false} is VALID [2022-02-20 14:02:55,732 INFO L290 TraceCheckUtils]: 49: Hoare triple {2341#false} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {2341#false} is VALID [2022-02-20 14:02:55,733 INFO L290 TraceCheckUtils]: 48: Hoare triple {2341#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem7#1 := read~int(main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem7#1, main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem7#1; {2341#false} is VALID [2022-02-20 14:02:55,733 INFO L290 TraceCheckUtils]: 47: Hoare triple {2341#false} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {2341#false} is VALID [2022-02-20 14:02:55,733 INFO L290 TraceCheckUtils]: 46: Hoare triple {2341#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem7#1 := read~int(main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem7#1, main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem7#1; {2341#false} is VALID [2022-02-20 14:02:55,733 INFO L290 TraceCheckUtils]: 45: Hoare triple {2341#false} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {2341#false} is VALID [2022-02-20 14:02:55,733 INFO L290 TraceCheckUtils]: 44: Hoare triple {2341#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem7#1 := read~int(main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem7#1, main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem7#1; {2341#false} is VALID [2022-02-20 14:02:55,733 INFO L290 TraceCheckUtils]: 43: Hoare triple {2341#false} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {2341#false} is VALID [2022-02-20 14:02:55,733 INFO L290 TraceCheckUtils]: 42: Hoare triple {2341#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem7#1 := read~int(main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem7#1, main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem7#1; {2341#false} is VALID [2022-02-20 14:02:55,734 INFO L290 TraceCheckUtils]: 41: Hoare triple {2341#false} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {2341#false} is VALID [2022-02-20 14:02:55,734 INFO L290 TraceCheckUtils]: 40: Hoare triple {2341#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem7#1 := read~int(main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem7#1, main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem7#1; {2341#false} is VALID [2022-02-20 14:02:55,734 INFO L290 TraceCheckUtils]: 39: Hoare triple {2341#false} main_~i~0#1 := 0; {2341#false} is VALID [2022-02-20 14:02:55,734 INFO L290 TraceCheckUtils]: 38: Hoare triple {2341#false} assume !(main_~i~0#1 < 100000); {2341#false} is VALID [2022-02-20 14:02:55,734 INFO L290 TraceCheckUtils]: 37: Hoare triple {2341#false} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {2341#false} is VALID [2022-02-20 14:02:55,734 INFO L290 TraceCheckUtils]: 36: Hoare triple {2341#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem5#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem5#1, main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem5#1; {2341#false} is VALID [2022-02-20 14:02:55,734 INFO L290 TraceCheckUtils]: 35: Hoare triple {2341#false} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {2341#false} is VALID [2022-02-20 14:02:55,734 INFO L290 TraceCheckUtils]: 34: Hoare triple {2341#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem5#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem5#1, main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem5#1; {2341#false} is VALID [2022-02-20 14:02:55,735 INFO L290 TraceCheckUtils]: 33: Hoare triple {2341#false} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {2341#false} is VALID [2022-02-20 14:02:55,735 INFO L290 TraceCheckUtils]: 32: Hoare triple {2341#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem5#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem5#1, main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem5#1; {2341#false} is VALID [2022-02-20 14:02:55,735 INFO L290 TraceCheckUtils]: 31: Hoare triple {2341#false} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {2341#false} is VALID [2022-02-20 14:02:55,735 INFO L290 TraceCheckUtils]: 30: Hoare triple {2341#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem5#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem5#1, main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem5#1; {2341#false} is VALID [2022-02-20 14:02:55,735 INFO L290 TraceCheckUtils]: 29: Hoare triple {2341#false} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {2341#false} is VALID [2022-02-20 14:02:55,735 INFO L290 TraceCheckUtils]: 28: Hoare triple {2341#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem5#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem5#1, main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem5#1; {2341#false} is VALID [2022-02-20 14:02:55,736 INFO L290 TraceCheckUtils]: 27: Hoare triple {2341#false} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {2341#false} is VALID [2022-02-20 14:02:55,736 INFO L290 TraceCheckUtils]: 26: Hoare triple {2341#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem5#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem5#1, main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem5#1; {2341#false} is VALID [2022-02-20 14:02:55,736 INFO L290 TraceCheckUtils]: 25: Hoare triple {2341#false} havoc main_~i~0#1;main_~i~0#1 := 0; {2341#false} is VALID [2022-02-20 14:02:55,738 INFO L290 TraceCheckUtils]: 24: Hoare triple {2874#(< |ULTIMATE.start_main_~a~0#1| 100000)} assume !(main_~a~0#1 < 100000); {2341#false} is VALID [2022-02-20 14:02:55,739 INFO L290 TraceCheckUtils]: 23: Hoare triple {2878#(< |ULTIMATE.start_main_~a~0#1| 99999)} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {2874#(< |ULTIMATE.start_main_~a~0#1| 100000)} is VALID [2022-02-20 14:02:55,739 INFO L290 TraceCheckUtils]: 22: Hoare triple {2878#(< |ULTIMATE.start_main_~a~0#1| 99999)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {2878#(< |ULTIMATE.start_main_~a~0#1| 99999)} is VALID [2022-02-20 14:02:55,739 INFO L290 TraceCheckUtils]: 21: Hoare triple {2885#(< |ULTIMATE.start_main_~a~0#1| 99998)} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {2878#(< |ULTIMATE.start_main_~a~0#1| 99999)} is VALID [2022-02-20 14:02:55,740 INFO L290 TraceCheckUtils]: 20: Hoare triple {2885#(< |ULTIMATE.start_main_~a~0#1| 99998)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {2885#(< |ULTIMATE.start_main_~a~0#1| 99998)} is VALID [2022-02-20 14:02:55,740 INFO L290 TraceCheckUtils]: 19: Hoare triple {2892#(< |ULTIMATE.start_main_~a~0#1| 99997)} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {2885#(< |ULTIMATE.start_main_~a~0#1| 99998)} is VALID [2022-02-20 14:02:55,741 INFO L290 TraceCheckUtils]: 18: Hoare triple {2892#(< |ULTIMATE.start_main_~a~0#1| 99997)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {2892#(< |ULTIMATE.start_main_~a~0#1| 99997)} is VALID [2022-02-20 14:02:55,741 INFO L290 TraceCheckUtils]: 17: Hoare triple {2899#(< |ULTIMATE.start_main_~a~0#1| 99996)} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {2892#(< |ULTIMATE.start_main_~a~0#1| 99997)} is VALID [2022-02-20 14:02:55,741 INFO L290 TraceCheckUtils]: 16: Hoare triple {2899#(< |ULTIMATE.start_main_~a~0#1| 99996)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {2899#(< |ULTIMATE.start_main_~a~0#1| 99996)} is VALID [2022-02-20 14:02:55,742 INFO L290 TraceCheckUtils]: 15: Hoare triple {2906#(< |ULTIMATE.start_main_~a~0#1| 99995)} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {2899#(< |ULTIMATE.start_main_~a~0#1| 99996)} is VALID [2022-02-20 14:02:55,742 INFO L290 TraceCheckUtils]: 14: Hoare triple {2906#(< |ULTIMATE.start_main_~a~0#1| 99995)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {2906#(< |ULTIMATE.start_main_~a~0#1| 99995)} is VALID [2022-02-20 14:02:55,743 INFO L290 TraceCheckUtils]: 13: Hoare triple {2913#(< |ULTIMATE.start_main_~a~0#1| 99994)} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {2906#(< |ULTIMATE.start_main_~a~0#1| 99995)} is VALID [2022-02-20 14:02:55,743 INFO L290 TraceCheckUtils]: 12: Hoare triple {2913#(< |ULTIMATE.start_main_~a~0#1| 99994)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {2913#(< |ULTIMATE.start_main_~a~0#1| 99994)} is VALID [2022-02-20 14:02:55,743 INFO L290 TraceCheckUtils]: 11: Hoare triple {2920#(< |ULTIMATE.start_main_~a~0#1| 99993)} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {2913#(< |ULTIMATE.start_main_~a~0#1| 99994)} is VALID [2022-02-20 14:02:55,744 INFO L290 TraceCheckUtils]: 10: Hoare triple {2920#(< |ULTIMATE.start_main_~a~0#1| 99993)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {2920#(< |ULTIMATE.start_main_~a~0#1| 99993)} is VALID [2022-02-20 14:02:55,744 INFO L290 TraceCheckUtils]: 9: Hoare triple {2927#(< |ULTIMATE.start_main_~a~0#1| 99992)} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {2920#(< |ULTIMATE.start_main_~a~0#1| 99993)} is VALID [2022-02-20 14:02:55,744 INFO L290 TraceCheckUtils]: 8: Hoare triple {2927#(< |ULTIMATE.start_main_~a~0#1| 99992)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {2927#(< |ULTIMATE.start_main_~a~0#1| 99992)} is VALID [2022-02-20 14:02:55,745 INFO L290 TraceCheckUtils]: 7: Hoare triple {2934#(< |ULTIMATE.start_main_~a~0#1| 99991)} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {2927#(< |ULTIMATE.start_main_~a~0#1| 99992)} is VALID [2022-02-20 14:02:55,745 INFO L290 TraceCheckUtils]: 6: Hoare triple {2934#(< |ULTIMATE.start_main_~a~0#1| 99991)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {2934#(< |ULTIMATE.start_main_~a~0#1| 99991)} is VALID [2022-02-20 14:02:55,746 INFO L290 TraceCheckUtils]: 5: Hoare triple {2941#(< |ULTIMATE.start_main_~a~0#1| 99990)} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {2934#(< |ULTIMATE.start_main_~a~0#1| 99991)} is VALID [2022-02-20 14:02:55,746 INFO L290 TraceCheckUtils]: 4: Hoare triple {2941#(< |ULTIMATE.start_main_~a~0#1| 99990)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {2941#(< |ULTIMATE.start_main_~a~0#1| 99990)} is VALID [2022-02-20 14:02:55,746 INFO L290 TraceCheckUtils]: 3: Hoare triple {2948#(< |ULTIMATE.start_main_~a~0#1| 99989)} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {2941#(< |ULTIMATE.start_main_~a~0#1| 99990)} is VALID [2022-02-20 14:02:55,747 INFO L290 TraceCheckUtils]: 2: Hoare triple {2948#(< |ULTIMATE.start_main_~a~0#1| 99989)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {2948#(< |ULTIMATE.start_main_~a~0#1| 99989)} is VALID [2022-02-20 14:02:55,747 INFO L290 TraceCheckUtils]: 1: Hoare triple {2340#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~nondet3#1, main_#t~post1#1, main_#t~mem5#1, main_#t~post4#1, main_#t~mem7#1, main_#t~post6#1, main_#t~mem9#1, main_#t~post8#1, main_#t~mem11#1, main_#t~post10#1, main_#t~mem13#1, main_#t~post12#1, main_#t~mem15#1, main_#t~mem16#1, main_#t~post14#1, main_~#a1~0#1.base, main_~#a1~0#1.offset, main_~#a2~0#1.base, main_~#a2~0#1.offset, main_~#a3~0#1.base, main_~#a3~0#1.offset, main_~#a4~0#1.base, main_~#a4~0#1.offset, main_~#a5~0#1.base, main_~#a5~0#1.offset, main_~#a6~0#1.base, main_~#a6~0#1.offset, main_~a~0#1, main_~i~0#1, main_~x~0#1;call main_~#a1~0#1.base, main_~#a1~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a2~0#1.base, main_~#a2~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a3~0#1.base, main_~#a3~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a4~0#1.base, main_~#a4~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a5~0#1.base, main_~#a5~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a6~0#1.base, main_~#a6~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~a~0#1;main_~a~0#1 := 0; {2948#(< |ULTIMATE.start_main_~a~0#1| 99989)} is VALID [2022-02-20 14:02:55,748 INFO L290 TraceCheckUtils]: 0: Hoare triple {2340#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); {2340#true} is VALID [2022-02-20 14:02:55,748 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2022-02-20 14:02:55,748 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [840926555] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 14:02:55,748 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 14:02:55,748 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 27 [2022-02-20 14:02:55,749 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899986983] [2022-02-20 14:02:55,749 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 14:02:55,750 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 2.814814814814815) internal successors, (76), 27 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2022-02-20 14:02:55,750 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:02:55,750 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 27 states, 27 states have (on average 2.814814814814815) internal successors, (76), 27 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:02:55,806 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:02:55,806 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-02-20 14:02:55,806 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:02:55,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-02-20 14:02:55,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2022-02-20 14:02:55,807 INFO L87 Difference]: Start difference. First operand 102 states and 108 transitions. Second operand has 27 states, 27 states have (on average 2.814814814814815) internal successors, (76), 27 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:02:56,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:02:56,015 INFO L93 Difference]: Finished difference Result 205 states and 229 transitions. [2022-02-20 14:02:56,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-02-20 14:02:56,015 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 2.814814814814815) internal successors, (76), 27 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2022-02-20 14:02:56,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:02:56,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 27 states have (on average 2.814814814814815) internal successors, (76), 27 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:02:56,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 119 transitions. [2022-02-20 14:02:56,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 27 states have (on average 2.814814814814815) internal successors, (76), 27 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:02:56,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 119 transitions. [2022-02-20 14:02:56,026 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 26 states and 119 transitions. [2022-02-20 14:02:56,112 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 119 edges. 119 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:02:56,114 INFO L225 Difference]: With dead ends: 205 [2022-02-20 14:02:56,115 INFO L226 Difference]: Without dead ends: 128 [2022-02-20 14:02:56,115 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2022-02-20 14:02:56,116 INFO L933 BasicCegarLoop]: 30 mSDtfsCounter, 36 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 14:02:56,117 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [36 Valid, 114 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 14:02:56,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2022-02-20 14:02:56,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2022-02-20 14:02:56,156 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:02:56,157 INFO L82 GeneralOperation]: Start isEquivalent. First operand 128 states. Second operand has 128 states, 127 states have (on average 1.0551181102362204) internal successors, (134), 127 states have internal predecessors, (134), 0 states have call successors, (0), 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:02:56,157 INFO L74 IsIncluded]: Start isIncluded. First operand 128 states. Second operand has 128 states, 127 states have (on average 1.0551181102362204) internal successors, (134), 127 states have internal predecessors, (134), 0 states have call successors, (0), 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:02:56,158 INFO L87 Difference]: Start difference. First operand 128 states. Second operand has 128 states, 127 states have (on average 1.0551181102362204) internal successors, (134), 127 states have internal predecessors, (134), 0 states have call successors, (0), 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:02:56,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:02:56,161 INFO L93 Difference]: Finished difference Result 128 states and 134 transitions. [2022-02-20 14:02:56,161 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 134 transitions. [2022-02-20 14:02:56,162 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:02:56,162 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:02:56,162 INFO L74 IsIncluded]: Start isIncluded. First operand has 128 states, 127 states have (on average 1.0551181102362204) internal successors, (134), 127 states have internal predecessors, (134), 0 states have call successors, (0), 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 128 states. [2022-02-20 14:02:56,163 INFO L87 Difference]: Start difference. First operand has 128 states, 127 states have (on average 1.0551181102362204) internal successors, (134), 127 states have internal predecessors, (134), 0 states have call successors, (0), 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 128 states. [2022-02-20 14:02:56,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:02:56,166 INFO L93 Difference]: Finished difference Result 128 states and 134 transitions. [2022-02-20 14:02:56,166 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 134 transitions. [2022-02-20 14:02:56,167 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:02:56,167 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:02:56,167 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:02:56,167 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:02:56,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 127 states have (on average 1.0551181102362204) internal successors, (134), 127 states have internal predecessors, (134), 0 states have call successors, (0), 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:02:56,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 134 transitions. [2022-02-20 14:02:56,171 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 134 transitions. Word has length 99 [2022-02-20 14:02:56,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:02:56,171 INFO L470 AbstractCegarLoop]: Abstraction has 128 states and 134 transitions. [2022-02-20 14:02:56,171 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 2.814814814814815) internal successors, (76), 27 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:02:56,172 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 134 transitions. [2022-02-20 14:02:56,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2022-02-20 14:02:56,173 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:02:56,173 INFO L514 BasicCegarLoop]: trace histogram [24, 24, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:02:56,197 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-02-20 14:02:56,387 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:02:56,387 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:02:56,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:02:56,388 INFO L85 PathProgramCache]: Analyzing trace with hash -450730367, now seen corresponding path program 5 times [2022-02-20 14:02:56,388 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:02:56,388 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451480324] [2022-02-20 14:02:56,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:02:56,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:02:56,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:02:56,845 INFO L290 TraceCheckUtils]: 0: Hoare triple {3704#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); {3704#true} is VALID [2022-02-20 14:02:56,846 INFO L290 TraceCheckUtils]: 1: Hoare triple {3704#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~nondet3#1, main_#t~post1#1, main_#t~mem5#1, main_#t~post4#1, main_#t~mem7#1, main_#t~post6#1, main_#t~mem9#1, main_#t~post8#1, main_#t~mem11#1, main_#t~post10#1, main_#t~mem13#1, main_#t~post12#1, main_#t~mem15#1, main_#t~mem16#1, main_#t~post14#1, main_~#a1~0#1.base, main_~#a1~0#1.offset, main_~#a2~0#1.base, main_~#a2~0#1.offset, main_~#a3~0#1.base, main_~#a3~0#1.offset, main_~#a4~0#1.base, main_~#a4~0#1.offset, main_~#a5~0#1.base, main_~#a5~0#1.offset, main_~#a6~0#1.base, main_~#a6~0#1.offset, main_~a~0#1, main_~i~0#1, main_~x~0#1;call main_~#a1~0#1.base, main_~#a1~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a2~0#1.base, main_~#a2~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a3~0#1.base, main_~#a3~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a4~0#1.base, main_~#a4~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a5~0#1.base, main_~#a5~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a6~0#1.base, main_~#a6~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~a~0#1;main_~a~0#1 := 0; {3706#(= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-20 14:02:56,846 INFO L290 TraceCheckUtils]: 2: Hoare triple {3706#(= |ULTIMATE.start_main_~a~0#1| 0)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {3706#(= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-20 14:02:56,847 INFO L290 TraceCheckUtils]: 3: Hoare triple {3706#(= |ULTIMATE.start_main_~a~0#1| 0)} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {3707#(<= |ULTIMATE.start_main_~a~0#1| 1)} is VALID [2022-02-20 14:02:56,847 INFO L290 TraceCheckUtils]: 4: Hoare triple {3707#(<= |ULTIMATE.start_main_~a~0#1| 1)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {3707#(<= |ULTIMATE.start_main_~a~0#1| 1)} is VALID [2022-02-20 14:02:56,847 INFO L290 TraceCheckUtils]: 5: Hoare triple {3707#(<= |ULTIMATE.start_main_~a~0#1| 1)} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {3708#(<= |ULTIMATE.start_main_~a~0#1| 2)} is VALID [2022-02-20 14:02:56,848 INFO L290 TraceCheckUtils]: 6: Hoare triple {3708#(<= |ULTIMATE.start_main_~a~0#1| 2)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {3708#(<= |ULTIMATE.start_main_~a~0#1| 2)} is VALID [2022-02-20 14:02:56,848 INFO L290 TraceCheckUtils]: 7: Hoare triple {3708#(<= |ULTIMATE.start_main_~a~0#1| 2)} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {3709#(<= |ULTIMATE.start_main_~a~0#1| 3)} is VALID [2022-02-20 14:02:56,849 INFO L290 TraceCheckUtils]: 8: Hoare triple {3709#(<= |ULTIMATE.start_main_~a~0#1| 3)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {3709#(<= |ULTIMATE.start_main_~a~0#1| 3)} is VALID [2022-02-20 14:02:56,849 INFO L290 TraceCheckUtils]: 9: Hoare triple {3709#(<= |ULTIMATE.start_main_~a~0#1| 3)} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {3710#(<= |ULTIMATE.start_main_~a~0#1| 4)} is VALID [2022-02-20 14:02:56,850 INFO L290 TraceCheckUtils]: 10: Hoare triple {3710#(<= |ULTIMATE.start_main_~a~0#1| 4)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {3710#(<= |ULTIMATE.start_main_~a~0#1| 4)} is VALID [2022-02-20 14:02:56,850 INFO L290 TraceCheckUtils]: 11: Hoare triple {3710#(<= |ULTIMATE.start_main_~a~0#1| 4)} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {3711#(<= |ULTIMATE.start_main_~a~0#1| 5)} is VALID [2022-02-20 14:02:56,850 INFO L290 TraceCheckUtils]: 12: Hoare triple {3711#(<= |ULTIMATE.start_main_~a~0#1| 5)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {3711#(<= |ULTIMATE.start_main_~a~0#1| 5)} is VALID [2022-02-20 14:02:56,851 INFO L290 TraceCheckUtils]: 13: Hoare triple {3711#(<= |ULTIMATE.start_main_~a~0#1| 5)} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {3712#(<= |ULTIMATE.start_main_~a~0#1| 6)} is VALID [2022-02-20 14:02:56,851 INFO L290 TraceCheckUtils]: 14: Hoare triple {3712#(<= |ULTIMATE.start_main_~a~0#1| 6)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {3712#(<= |ULTIMATE.start_main_~a~0#1| 6)} is VALID [2022-02-20 14:02:56,852 INFO L290 TraceCheckUtils]: 15: Hoare triple {3712#(<= |ULTIMATE.start_main_~a~0#1| 6)} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {3713#(<= |ULTIMATE.start_main_~a~0#1| 7)} is VALID [2022-02-20 14:02:56,852 INFO L290 TraceCheckUtils]: 16: Hoare triple {3713#(<= |ULTIMATE.start_main_~a~0#1| 7)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {3713#(<= |ULTIMATE.start_main_~a~0#1| 7)} is VALID [2022-02-20 14:02:56,852 INFO L290 TraceCheckUtils]: 17: Hoare triple {3713#(<= |ULTIMATE.start_main_~a~0#1| 7)} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {3714#(<= |ULTIMATE.start_main_~a~0#1| 8)} is VALID [2022-02-20 14:02:56,853 INFO L290 TraceCheckUtils]: 18: Hoare triple {3714#(<= |ULTIMATE.start_main_~a~0#1| 8)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {3714#(<= |ULTIMATE.start_main_~a~0#1| 8)} is VALID [2022-02-20 14:02:56,853 INFO L290 TraceCheckUtils]: 19: Hoare triple {3714#(<= |ULTIMATE.start_main_~a~0#1| 8)} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {3715#(<= |ULTIMATE.start_main_~a~0#1| 9)} is VALID [2022-02-20 14:02:56,853 INFO L290 TraceCheckUtils]: 20: Hoare triple {3715#(<= |ULTIMATE.start_main_~a~0#1| 9)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {3715#(<= |ULTIMATE.start_main_~a~0#1| 9)} is VALID [2022-02-20 14:02:56,854 INFO L290 TraceCheckUtils]: 21: Hoare triple {3715#(<= |ULTIMATE.start_main_~a~0#1| 9)} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {3716#(<= |ULTIMATE.start_main_~a~0#1| 10)} is VALID [2022-02-20 14:02:56,854 INFO L290 TraceCheckUtils]: 22: Hoare triple {3716#(<= |ULTIMATE.start_main_~a~0#1| 10)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {3716#(<= |ULTIMATE.start_main_~a~0#1| 10)} is VALID [2022-02-20 14:02:56,855 INFO L290 TraceCheckUtils]: 23: Hoare triple {3716#(<= |ULTIMATE.start_main_~a~0#1| 10)} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {3717#(<= |ULTIMATE.start_main_~a~0#1| 11)} is VALID [2022-02-20 14:02:56,855 INFO L290 TraceCheckUtils]: 24: Hoare triple {3717#(<= |ULTIMATE.start_main_~a~0#1| 11)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {3717#(<= |ULTIMATE.start_main_~a~0#1| 11)} is VALID [2022-02-20 14:02:56,855 INFO L290 TraceCheckUtils]: 25: Hoare triple {3717#(<= |ULTIMATE.start_main_~a~0#1| 11)} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {3718#(<= |ULTIMATE.start_main_~a~0#1| 12)} is VALID [2022-02-20 14:02:56,856 INFO L290 TraceCheckUtils]: 26: Hoare triple {3718#(<= |ULTIMATE.start_main_~a~0#1| 12)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {3718#(<= |ULTIMATE.start_main_~a~0#1| 12)} is VALID [2022-02-20 14:02:56,856 INFO L290 TraceCheckUtils]: 27: Hoare triple {3718#(<= |ULTIMATE.start_main_~a~0#1| 12)} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {3719#(<= |ULTIMATE.start_main_~a~0#1| 13)} is VALID [2022-02-20 14:02:56,856 INFO L290 TraceCheckUtils]: 28: Hoare triple {3719#(<= |ULTIMATE.start_main_~a~0#1| 13)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {3719#(<= |ULTIMATE.start_main_~a~0#1| 13)} is VALID [2022-02-20 14:02:56,857 INFO L290 TraceCheckUtils]: 29: Hoare triple {3719#(<= |ULTIMATE.start_main_~a~0#1| 13)} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {3720#(<= |ULTIMATE.start_main_~a~0#1| 14)} is VALID [2022-02-20 14:02:56,857 INFO L290 TraceCheckUtils]: 30: Hoare triple {3720#(<= |ULTIMATE.start_main_~a~0#1| 14)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {3720#(<= |ULTIMATE.start_main_~a~0#1| 14)} is VALID [2022-02-20 14:02:56,858 INFO L290 TraceCheckUtils]: 31: Hoare triple {3720#(<= |ULTIMATE.start_main_~a~0#1| 14)} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {3721#(<= |ULTIMATE.start_main_~a~0#1| 15)} is VALID [2022-02-20 14:02:56,858 INFO L290 TraceCheckUtils]: 32: Hoare triple {3721#(<= |ULTIMATE.start_main_~a~0#1| 15)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {3721#(<= |ULTIMATE.start_main_~a~0#1| 15)} is VALID [2022-02-20 14:02:56,858 INFO L290 TraceCheckUtils]: 33: Hoare triple {3721#(<= |ULTIMATE.start_main_~a~0#1| 15)} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {3722#(<= |ULTIMATE.start_main_~a~0#1| 16)} is VALID [2022-02-20 14:02:56,859 INFO L290 TraceCheckUtils]: 34: Hoare triple {3722#(<= |ULTIMATE.start_main_~a~0#1| 16)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {3722#(<= |ULTIMATE.start_main_~a~0#1| 16)} is VALID [2022-02-20 14:02:56,859 INFO L290 TraceCheckUtils]: 35: Hoare triple {3722#(<= |ULTIMATE.start_main_~a~0#1| 16)} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {3723#(<= |ULTIMATE.start_main_~a~0#1| 17)} is VALID [2022-02-20 14:02:56,860 INFO L290 TraceCheckUtils]: 36: Hoare triple {3723#(<= |ULTIMATE.start_main_~a~0#1| 17)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {3723#(<= |ULTIMATE.start_main_~a~0#1| 17)} is VALID [2022-02-20 14:02:56,860 INFO L290 TraceCheckUtils]: 37: Hoare triple {3723#(<= |ULTIMATE.start_main_~a~0#1| 17)} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {3724#(<= |ULTIMATE.start_main_~a~0#1| 18)} is VALID [2022-02-20 14:02:56,860 INFO L290 TraceCheckUtils]: 38: Hoare triple {3724#(<= |ULTIMATE.start_main_~a~0#1| 18)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {3724#(<= |ULTIMATE.start_main_~a~0#1| 18)} is VALID [2022-02-20 14:02:56,861 INFO L290 TraceCheckUtils]: 39: Hoare triple {3724#(<= |ULTIMATE.start_main_~a~0#1| 18)} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {3725#(<= |ULTIMATE.start_main_~a~0#1| 19)} is VALID [2022-02-20 14:02:56,861 INFO L290 TraceCheckUtils]: 40: Hoare triple {3725#(<= |ULTIMATE.start_main_~a~0#1| 19)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {3725#(<= |ULTIMATE.start_main_~a~0#1| 19)} is VALID [2022-02-20 14:02:56,861 INFO L290 TraceCheckUtils]: 41: Hoare triple {3725#(<= |ULTIMATE.start_main_~a~0#1| 19)} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {3726#(<= |ULTIMATE.start_main_~a~0#1| 20)} is VALID [2022-02-20 14:02:56,862 INFO L290 TraceCheckUtils]: 42: Hoare triple {3726#(<= |ULTIMATE.start_main_~a~0#1| 20)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {3726#(<= |ULTIMATE.start_main_~a~0#1| 20)} is VALID [2022-02-20 14:02:56,862 INFO L290 TraceCheckUtils]: 43: Hoare triple {3726#(<= |ULTIMATE.start_main_~a~0#1| 20)} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {3727#(<= |ULTIMATE.start_main_~a~0#1| 21)} is VALID [2022-02-20 14:02:56,862 INFO L290 TraceCheckUtils]: 44: Hoare triple {3727#(<= |ULTIMATE.start_main_~a~0#1| 21)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {3727#(<= |ULTIMATE.start_main_~a~0#1| 21)} is VALID [2022-02-20 14:02:56,863 INFO L290 TraceCheckUtils]: 45: Hoare triple {3727#(<= |ULTIMATE.start_main_~a~0#1| 21)} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {3728#(<= |ULTIMATE.start_main_~a~0#1| 22)} is VALID [2022-02-20 14:02:56,863 INFO L290 TraceCheckUtils]: 46: Hoare triple {3728#(<= |ULTIMATE.start_main_~a~0#1| 22)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {3728#(<= |ULTIMATE.start_main_~a~0#1| 22)} is VALID [2022-02-20 14:02:56,863 INFO L290 TraceCheckUtils]: 47: Hoare triple {3728#(<= |ULTIMATE.start_main_~a~0#1| 22)} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {3729#(<= |ULTIMATE.start_main_~a~0#1| 23)} is VALID [2022-02-20 14:02:56,864 INFO L290 TraceCheckUtils]: 48: Hoare triple {3729#(<= |ULTIMATE.start_main_~a~0#1| 23)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {3729#(<= |ULTIMATE.start_main_~a~0#1| 23)} is VALID [2022-02-20 14:02:56,864 INFO L290 TraceCheckUtils]: 49: Hoare triple {3729#(<= |ULTIMATE.start_main_~a~0#1| 23)} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {3730#(<= |ULTIMATE.start_main_~a~0#1| 24)} is VALID [2022-02-20 14:02:56,865 INFO L290 TraceCheckUtils]: 50: Hoare triple {3730#(<= |ULTIMATE.start_main_~a~0#1| 24)} assume !(main_~a~0#1 < 100000); {3705#false} is VALID [2022-02-20 14:02:56,865 INFO L290 TraceCheckUtils]: 51: Hoare triple {3705#false} havoc main_~i~0#1;main_~i~0#1 := 0; {3705#false} is VALID [2022-02-20 14:02:56,865 INFO L290 TraceCheckUtils]: 52: Hoare triple {3705#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem5#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem5#1, main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem5#1; {3705#false} is VALID [2022-02-20 14:02:56,865 INFO L290 TraceCheckUtils]: 53: Hoare triple {3705#false} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {3705#false} is VALID [2022-02-20 14:02:56,865 INFO L290 TraceCheckUtils]: 54: Hoare triple {3705#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem5#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem5#1, main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem5#1; {3705#false} is VALID [2022-02-20 14:02:56,865 INFO L290 TraceCheckUtils]: 55: Hoare triple {3705#false} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {3705#false} is VALID [2022-02-20 14:02:56,865 INFO L290 TraceCheckUtils]: 56: Hoare triple {3705#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem5#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem5#1, main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem5#1; {3705#false} is VALID [2022-02-20 14:02:56,865 INFO L290 TraceCheckUtils]: 57: Hoare triple {3705#false} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {3705#false} is VALID [2022-02-20 14:02:56,866 INFO L290 TraceCheckUtils]: 58: Hoare triple {3705#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem5#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem5#1, main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem5#1; {3705#false} is VALID [2022-02-20 14:02:56,866 INFO L290 TraceCheckUtils]: 59: Hoare triple {3705#false} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {3705#false} is VALID [2022-02-20 14:02:56,866 INFO L290 TraceCheckUtils]: 60: Hoare triple {3705#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem5#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem5#1, main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem5#1; {3705#false} is VALID [2022-02-20 14:02:56,866 INFO L290 TraceCheckUtils]: 61: Hoare triple {3705#false} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {3705#false} is VALID [2022-02-20 14:02:56,866 INFO L290 TraceCheckUtils]: 62: Hoare triple {3705#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem5#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem5#1, main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem5#1; {3705#false} is VALID [2022-02-20 14:02:56,866 INFO L290 TraceCheckUtils]: 63: Hoare triple {3705#false} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {3705#false} is VALID [2022-02-20 14:02:56,866 INFO L290 TraceCheckUtils]: 64: Hoare triple {3705#false} assume !(main_~i~0#1 < 100000); {3705#false} is VALID [2022-02-20 14:02:56,867 INFO L290 TraceCheckUtils]: 65: Hoare triple {3705#false} main_~i~0#1 := 0; {3705#false} is VALID [2022-02-20 14:02:56,867 INFO L290 TraceCheckUtils]: 66: Hoare triple {3705#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem7#1 := read~int(main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem7#1, main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem7#1; {3705#false} is VALID [2022-02-20 14:02:56,867 INFO L290 TraceCheckUtils]: 67: Hoare triple {3705#false} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {3705#false} is VALID [2022-02-20 14:02:56,867 INFO L290 TraceCheckUtils]: 68: Hoare triple {3705#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem7#1 := read~int(main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem7#1, main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem7#1; {3705#false} is VALID [2022-02-20 14:02:56,867 INFO L290 TraceCheckUtils]: 69: Hoare triple {3705#false} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {3705#false} is VALID [2022-02-20 14:02:56,867 INFO L290 TraceCheckUtils]: 70: Hoare triple {3705#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem7#1 := read~int(main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem7#1, main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem7#1; {3705#false} is VALID [2022-02-20 14:02:56,867 INFO L290 TraceCheckUtils]: 71: Hoare triple {3705#false} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {3705#false} is VALID [2022-02-20 14:02:56,867 INFO L290 TraceCheckUtils]: 72: Hoare triple {3705#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem7#1 := read~int(main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem7#1, main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem7#1; {3705#false} is VALID [2022-02-20 14:02:56,868 INFO L290 TraceCheckUtils]: 73: Hoare triple {3705#false} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {3705#false} is VALID [2022-02-20 14:02:56,868 INFO L290 TraceCheckUtils]: 74: Hoare triple {3705#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem7#1 := read~int(main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem7#1, main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem7#1; {3705#false} is VALID [2022-02-20 14:02:56,868 INFO L290 TraceCheckUtils]: 75: Hoare triple {3705#false} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {3705#false} is VALID [2022-02-20 14:02:56,868 INFO L290 TraceCheckUtils]: 76: Hoare triple {3705#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem7#1 := read~int(main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem7#1, main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem7#1; {3705#false} is VALID [2022-02-20 14:02:56,868 INFO L290 TraceCheckUtils]: 77: Hoare triple {3705#false} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {3705#false} is VALID [2022-02-20 14:02:56,868 INFO L290 TraceCheckUtils]: 78: Hoare triple {3705#false} assume !(main_~i~0#1 < 100000); {3705#false} is VALID [2022-02-20 14:02:56,868 INFO L290 TraceCheckUtils]: 79: Hoare triple {3705#false} main_~i~0#1 := 0; {3705#false} is VALID [2022-02-20 14:02:56,868 INFO L290 TraceCheckUtils]: 80: Hoare triple {3705#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem9#1 := read~int(main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem9#1, main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem9#1; {3705#false} is VALID [2022-02-20 14:02:56,869 INFO L290 TraceCheckUtils]: 81: Hoare triple {3705#false} main_#t~post8#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; {3705#false} is VALID [2022-02-20 14:02:56,869 INFO L290 TraceCheckUtils]: 82: Hoare triple {3705#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem9#1 := read~int(main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem9#1, main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem9#1; {3705#false} is VALID [2022-02-20 14:02:56,869 INFO L290 TraceCheckUtils]: 83: Hoare triple {3705#false} main_#t~post8#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; {3705#false} is VALID [2022-02-20 14:02:56,869 INFO L290 TraceCheckUtils]: 84: Hoare triple {3705#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem9#1 := read~int(main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem9#1, main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem9#1; {3705#false} is VALID [2022-02-20 14:02:56,869 INFO L290 TraceCheckUtils]: 85: Hoare triple {3705#false} main_#t~post8#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; {3705#false} is VALID [2022-02-20 14:02:56,869 INFO L290 TraceCheckUtils]: 86: Hoare triple {3705#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem9#1 := read~int(main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem9#1, main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem9#1; {3705#false} is VALID [2022-02-20 14:02:56,869 INFO L290 TraceCheckUtils]: 87: Hoare triple {3705#false} main_#t~post8#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; {3705#false} is VALID [2022-02-20 14:02:56,870 INFO L290 TraceCheckUtils]: 88: Hoare triple {3705#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem9#1 := read~int(main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem9#1, main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem9#1; {3705#false} is VALID [2022-02-20 14:02:56,870 INFO L290 TraceCheckUtils]: 89: Hoare triple {3705#false} main_#t~post8#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; {3705#false} is VALID [2022-02-20 14:02:56,870 INFO L290 TraceCheckUtils]: 90: Hoare triple {3705#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem9#1 := read~int(main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem9#1, main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem9#1; {3705#false} is VALID [2022-02-20 14:02:56,870 INFO L290 TraceCheckUtils]: 91: Hoare triple {3705#false} main_#t~post8#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; {3705#false} is VALID [2022-02-20 14:02:56,870 INFO L290 TraceCheckUtils]: 92: Hoare triple {3705#false} assume !(main_~i~0#1 < 100000); {3705#false} is VALID [2022-02-20 14:02:56,870 INFO L290 TraceCheckUtils]: 93: Hoare triple {3705#false} main_~i~0#1 := 0; {3705#false} is VALID [2022-02-20 14:02:56,870 INFO L290 TraceCheckUtils]: 94: Hoare triple {3705#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem11#1 := read~int(main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem11#1, main_~#a6~0#1.base, main_~#a6~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem11#1; {3705#false} is VALID [2022-02-20 14:02:56,870 INFO L290 TraceCheckUtils]: 95: Hoare triple {3705#false} main_#t~post10#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; {3705#false} is VALID [2022-02-20 14:02:56,871 INFO L290 TraceCheckUtils]: 96: Hoare triple {3705#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem11#1 := read~int(main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem11#1, main_~#a6~0#1.base, main_~#a6~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem11#1; {3705#false} is VALID [2022-02-20 14:02:56,871 INFO L290 TraceCheckUtils]: 97: Hoare triple {3705#false} main_#t~post10#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; {3705#false} is VALID [2022-02-20 14:02:56,871 INFO L290 TraceCheckUtils]: 98: Hoare triple {3705#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem11#1 := read~int(main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem11#1, main_~#a6~0#1.base, main_~#a6~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem11#1; {3705#false} is VALID [2022-02-20 14:02:56,871 INFO L290 TraceCheckUtils]: 99: Hoare triple {3705#false} main_#t~post10#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; {3705#false} is VALID [2022-02-20 14:02:56,871 INFO L290 TraceCheckUtils]: 100: Hoare triple {3705#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem11#1 := read~int(main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem11#1, main_~#a6~0#1.base, main_~#a6~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem11#1; {3705#false} is VALID [2022-02-20 14:02:56,871 INFO L290 TraceCheckUtils]: 101: Hoare triple {3705#false} main_#t~post10#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; {3705#false} is VALID [2022-02-20 14:02:56,871 INFO L290 TraceCheckUtils]: 102: Hoare triple {3705#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem11#1 := read~int(main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem11#1, main_~#a6~0#1.base, main_~#a6~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem11#1; {3705#false} is VALID [2022-02-20 14:02:56,872 INFO L290 TraceCheckUtils]: 103: Hoare triple {3705#false} main_#t~post10#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; {3705#false} is VALID [2022-02-20 14:02:56,872 INFO L290 TraceCheckUtils]: 104: Hoare triple {3705#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem11#1 := read~int(main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem11#1, main_~#a6~0#1.base, main_~#a6~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem11#1; {3705#false} is VALID [2022-02-20 14:02:56,872 INFO L290 TraceCheckUtils]: 105: Hoare triple {3705#false} main_#t~post10#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; {3705#false} is VALID [2022-02-20 14:02:56,872 INFO L290 TraceCheckUtils]: 106: Hoare triple {3705#false} assume !(main_~i~0#1 < 100000); {3705#false} is VALID [2022-02-20 14:02:56,872 INFO L290 TraceCheckUtils]: 107: Hoare triple {3705#false} main_~i~0#1 := 0; {3705#false} is VALID [2022-02-20 14:02:56,872 INFO L290 TraceCheckUtils]: 108: Hoare triple {3705#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem13#1 := read~int(main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem13#1, main_~#a6~0#1.base, main_~#a6~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem13#1; {3705#false} is VALID [2022-02-20 14:02:56,872 INFO L290 TraceCheckUtils]: 109: Hoare triple {3705#false} main_#t~post12#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post12#1;havoc main_#t~post12#1; {3705#false} is VALID [2022-02-20 14:02:56,873 INFO L290 TraceCheckUtils]: 110: Hoare triple {3705#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem13#1 := read~int(main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem13#1, main_~#a6~0#1.base, main_~#a6~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem13#1; {3705#false} is VALID [2022-02-20 14:02:56,873 INFO L290 TraceCheckUtils]: 111: Hoare triple {3705#false} main_#t~post12#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post12#1;havoc main_#t~post12#1; {3705#false} is VALID [2022-02-20 14:02:56,873 INFO L290 TraceCheckUtils]: 112: Hoare triple {3705#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem13#1 := read~int(main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem13#1, main_~#a6~0#1.base, main_~#a6~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem13#1; {3705#false} is VALID [2022-02-20 14:02:56,873 INFO L290 TraceCheckUtils]: 113: Hoare triple {3705#false} main_#t~post12#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post12#1;havoc main_#t~post12#1; {3705#false} is VALID [2022-02-20 14:02:56,873 INFO L290 TraceCheckUtils]: 114: Hoare triple {3705#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem13#1 := read~int(main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem13#1, main_~#a6~0#1.base, main_~#a6~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem13#1; {3705#false} is VALID [2022-02-20 14:02:56,873 INFO L290 TraceCheckUtils]: 115: Hoare triple {3705#false} main_#t~post12#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post12#1;havoc main_#t~post12#1; {3705#false} is VALID [2022-02-20 14:02:56,873 INFO L290 TraceCheckUtils]: 116: Hoare triple {3705#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem13#1 := read~int(main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem13#1, main_~#a6~0#1.base, main_~#a6~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem13#1; {3705#false} is VALID [2022-02-20 14:02:56,874 INFO L290 TraceCheckUtils]: 117: Hoare triple {3705#false} main_#t~post12#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post12#1;havoc main_#t~post12#1; {3705#false} is VALID [2022-02-20 14:02:56,874 INFO L290 TraceCheckUtils]: 118: Hoare triple {3705#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem13#1 := read~int(main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem13#1, main_~#a6~0#1.base, main_~#a6~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem13#1; {3705#false} is VALID [2022-02-20 14:02:56,874 INFO L290 TraceCheckUtils]: 119: Hoare triple {3705#false} main_#t~post12#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post12#1;havoc main_#t~post12#1; {3705#false} is VALID [2022-02-20 14:02:56,874 INFO L290 TraceCheckUtils]: 120: Hoare triple {3705#false} assume !(main_~i~0#1 < 100000); {3705#false} is VALID [2022-02-20 14:02:56,874 INFO L290 TraceCheckUtils]: 121: Hoare triple {3705#false} havoc main_~x~0#1;main_~x~0#1 := 0; {3705#false} is VALID [2022-02-20 14:02:56,874 INFO L290 TraceCheckUtils]: 122: Hoare triple {3705#false} assume !!(main_~x~0#1 < 100000);call main_#t~mem15#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~x~0#1, 4);call main_#t~mem16#1 := read~int(main_~#a6~0#1.base, main_~#a6~0#1.offset + 4 * main_~x~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem15#1 == main_#t~mem16#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {3705#false} is VALID [2022-02-20 14:02:56,874 INFO L290 TraceCheckUtils]: 123: Hoare triple {3705#false} assume 0 == __VERIFIER_assert_~cond#1; {3705#false} is VALID [2022-02-20 14:02:56,874 INFO L290 TraceCheckUtils]: 124: Hoare triple {3705#false} assume !false; {3705#false} is VALID [2022-02-20 14:02:56,875 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 576 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2022-02-20 14:02:56,875 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:02:56,876 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451480324] [2022-02-20 14:02:56,876 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1451480324] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 14:02:56,876 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1846253421] [2022-02-20 14:02:56,876 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-02-20 14:02:56,876 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:02:56,876 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:02:56,878 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:02:56,879 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process