./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-examples/standard_init5_ground-1.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_init5_ground-1.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 bb3e31ea27a42ae055477cc52227cd03cc6f718b370476afce8b6d4401091af0 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 14:05:25,960 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 14:05:25,966 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 14:05:25,990 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 14:05:25,991 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 14:05:25,992 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 14:05:25,993 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 14:05:25,995 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 14:05:25,997 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 14:05:25,998 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 14:05:25,999 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 14:05:26,000 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 14:05:26,000 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 14:05:26,001 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 14:05:26,002 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 14:05:26,003 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 14:05:26,004 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 14:05:26,004 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 14:05:26,006 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 14:05:26,007 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 14:05:26,008 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 14:05:26,010 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 14:05:26,010 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 14:05:26,011 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 14:05:26,013 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 14:05:26,014 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 14:05:26,014 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 14:05:26,015 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 14:05:26,015 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 14:05:26,016 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 14:05:26,017 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 14:05:26,017 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 14:05:26,018 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 14:05:26,019 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 14:05:26,020 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 14:05:26,020 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 14:05:26,021 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 14:05:26,021 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 14:05:26,021 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 14:05:26,022 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 14:05:26,023 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 14:05:26,024 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:05:26,042 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 14:05:26,046 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 14:05:26,047 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 14:05:26,047 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 14:05:26,048 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 14:05:26,048 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 14:05:26,049 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 14:05:26,049 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 14:05:26,049 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 14:05:26,050 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 14:05:26,051 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 14:05:26,051 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 14:05:26,051 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 14:05:26,051 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 14:05:26,051 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 14:05:26,052 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 14:05:26,052 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 14:05:26,052 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 14:05:26,052 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 14:05:26,052 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 14:05:26,053 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 14:05:26,053 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 14:05:26,053 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 14:05:26,053 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 14:05:26,053 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 14:05:26,054 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 14:05:26,054 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 14:05:26,054 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 14:05:26,054 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 14:05:26,054 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 14:05:26,055 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 14:05:26,055 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 14:05:26,055 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 14:05:26,055 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 -> bb3e31ea27a42ae055477cc52227cd03cc6f718b370476afce8b6d4401091af0 [2022-02-20 14:05:26,285 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 14:05:26,314 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 14:05:26,319 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 14:05:26,320 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 14:05:26,320 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 14:05:26,322 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-examples/standard_init5_ground-1.i [2022-02-20 14:05:26,405 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/563329a03/34681bcbeec4429986c6c7d139323fa9/FLAG40ab5a37a [2022-02-20 14:05:26,864 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 14:05:26,864 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-examples/standard_init5_ground-1.i [2022-02-20 14:05:26,870 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/563329a03/34681bcbeec4429986c6c7d139323fa9/FLAG40ab5a37a [2022-02-20 14:05:27,277 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/563329a03/34681bcbeec4429986c6c7d139323fa9 [2022-02-20 14:05:27,282 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 14:05:27,285 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 14:05:27,286 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 14:05:27,287 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 14:05:27,290 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 14:05:27,291 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 02:05:27" (1/1) ... [2022-02-20 14:05:27,293 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@798cee43 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:05:27, skipping insertion in model container [2022-02-20 14:05:27,294 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 02:05:27" (1/1) ... [2022-02-20 14:05:27,300 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 14:05:27,316 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 14:05:27,456 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_init5_ground-1.i[816,829] [2022-02-20 14:05:27,477 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 14:05:27,483 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 14:05:27,494 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_init5_ground-1.i[816,829] [2022-02-20 14:05:27,512 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 14:05:27,524 INFO L208 MainTranslator]: Completed translation [2022-02-20 14:05:27,525 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:05:27 WrapperNode [2022-02-20 14:05:27,525 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 14:05:27,526 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 14:05:27,526 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 14:05:27,526 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 14:05:27,531 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:05:27" (1/1) ... [2022-02-20 14:05:27,538 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:05:27" (1/1) ... [2022-02-20 14:05:27,555 INFO L137 Inliner]: procedures = 15, calls = 16, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 68 [2022-02-20 14:05:27,556 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 14:05:27,557 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 14:05:27,557 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 14:05:27,557 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 14:05:27,563 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:05:27" (1/1) ... [2022-02-20 14:05:27,563 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:05:27" (1/1) ... [2022-02-20 14:05:27,565 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:05:27" (1/1) ... [2022-02-20 14:05:27,565 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:05:27" (1/1) ... [2022-02-20 14:05:27,572 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:05:27" (1/1) ... [2022-02-20 14:05:27,576 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:05:27" (1/1) ... [2022-02-20 14:05:27,577 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:05:27" (1/1) ... [2022-02-20 14:05:27,578 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 14:05:27,579 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 14:05:27,580 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 14:05:27,581 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 14:05:27,582 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:05:27" (1/1) ... [2022-02-20 14:05:27,591 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 14:05:27,599 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:05:27,609 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:05:27,618 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:05:27,639 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 14:05:27,640 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 14:05:27,640 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 14:05:27,640 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-20 14:05:27,640 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 14:05:27,640 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 14:05:27,640 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-20 14:05:27,641 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 14:05:27,695 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 14:05:27,697 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 14:05:27,874 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 14:05:27,879 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 14:05:27,879 INFO L299 CfgBuilder]: Removed 6 assume(true) statements. [2022-02-20 14:05:27,881 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 02:05:27 BoogieIcfgContainer [2022-02-20 14:05:27,881 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 14:05:27,882 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 14:05:27,882 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 14:05:27,889 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 14:05:27,889 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 02:05:27" (1/3) ... [2022-02-20 14:05:27,890 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b209cf8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 02:05:27, skipping insertion in model container [2022-02-20 14:05:27,890 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:05:27" (2/3) ... [2022-02-20 14:05:27,891 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b209cf8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 02:05:27, skipping insertion in model container [2022-02-20 14:05:27,891 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 02:05:27" (3/3) ... [2022-02-20 14:05:27,892 INFO L111 eAbstractionObserver]: Analyzing ICFG standard_init5_ground-1.i [2022-02-20 14:05:27,897 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 14:05:27,897 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 14:05:27,942 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 14:05:27,949 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:05:27,949 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 14:05:27,977 INFO L276 IsEmpty]: Start isEmpty. Operand has 22 states, 20 states have (on average 1.7) internal successors, (34), 21 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:05:27,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-02-20 14:05:27,981 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:05:27,982 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:05:27,982 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:05:27,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:05:27,987 INFO L85 PathProgramCache]: Analyzing trace with hash 846254768, now seen corresponding path program 1 times [2022-02-20 14:05:27,999 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:05:28,001 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721291378] [2022-02-20 14:05:28,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:05:28,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:05:28,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:05:28,187 INFO L290 TraceCheckUtils]: 0: Hoare triple {25#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); {25#true} is VALID [2022-02-20 14:05:28,189 INFO L290 TraceCheckUtils]: 1: Hoare triple {25#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem2#1, main_#t~post1#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~i~0#1, main_~x~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);main_~i~0#1 := 0; {27#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:05:28,189 INFO L290 TraceCheckUtils]: 2: Hoare triple {27#(= |ULTIMATE.start_main_~i~0#1| 0)} assume !(main_~i~0#1 < 100000); {26#false} is VALID [2022-02-20 14:05:28,190 INFO L290 TraceCheckUtils]: 3: Hoare triple {26#false} main_~i~0#1 := 0; {26#false} is VALID [2022-02-20 14:05:28,190 INFO L290 TraceCheckUtils]: 4: Hoare triple {26#false} assume !(main_~i~0#1 < 100000); {26#false} is VALID [2022-02-20 14:05:28,190 INFO L290 TraceCheckUtils]: 5: Hoare triple {26#false} main_~i~0#1 := 0; {26#false} is VALID [2022-02-20 14:05:28,190 INFO L290 TraceCheckUtils]: 6: Hoare triple {26#false} assume !(main_~i~0#1 < 100000); {26#false} is VALID [2022-02-20 14:05:28,191 INFO L290 TraceCheckUtils]: 7: Hoare triple {26#false} main_~i~0#1 := 0; {26#false} is VALID [2022-02-20 14:05:28,191 INFO L290 TraceCheckUtils]: 8: Hoare triple {26#false} assume !(main_~i~0#1 < 100000); {26#false} is VALID [2022-02-20 14:05:28,191 INFO L290 TraceCheckUtils]: 9: Hoare triple {26#false} main_~i~0#1 := 0; {26#false} is VALID [2022-02-20 14:05:28,191 INFO L290 TraceCheckUtils]: 10: Hoare triple {26#false} assume !true; {26#false} is VALID [2022-02-20 14:05:28,192 INFO L290 TraceCheckUtils]: 11: Hoare triple {26#false} havoc main_~x~0#1;main_~x~0#1 := 0; {26#false} is VALID [2022-02-20 14:05:28,192 INFO L290 TraceCheckUtils]: 12: Hoare triple {26#false} assume !!(main_~x~0#1 < 100000);call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~x~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 46 == main_#t~mem2#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {26#false} is VALID [2022-02-20 14:05:28,192 INFO L290 TraceCheckUtils]: 13: Hoare triple {26#false} assume 0 == __VERIFIER_assert_~cond#1; {26#false} is VALID [2022-02-20 14:05:28,193 INFO L290 TraceCheckUtils]: 14: Hoare triple {26#false} assume !false; {26#false} is VALID [2022-02-20 14:05:28,194 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:05:28,194 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:05:28,195 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721291378] [2022-02-20 14:05:28,196 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1721291378] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:05:28,196 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:05:28,196 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 14:05:28,198 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521143981] [2022-02-20 14:05:28,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:05:28,217 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-02-20 14:05:28,220 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:05:28,222 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:05:28,254 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:05:28,254 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 14:05:28,254 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:05:28,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 14:05:28,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 14:05:28,278 INFO L87 Difference]: Start difference. First operand has 22 states, 20 states have (on average 1.7) internal successors, (34), 21 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:05:28,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:05:28,380 INFO L93 Difference]: Finished difference Result 46 states and 78 transitions. [2022-02-20 14:05:28,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 14:05:28,381 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-02-20 14:05:28,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:05:28,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:05:28,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 78 transitions. [2022-02-20 14:05:28,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:05:28,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 78 transitions. [2022-02-20 14:05:28,397 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 78 transitions. [2022-02-20 14:05:28,459 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:05:28,464 INFO L225 Difference]: With dead ends: 46 [2022-02-20 14:05:28,465 INFO L226 Difference]: Without dead ends: 23 [2022-02-20 14:05:28,467 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:05:28,469 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 0 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 14:05:28,470 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 34 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 14:05:28,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-02-20 14:05:28,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-02-20 14:05:28,487 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:05:28,487 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand has 23 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 22 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:05:28,488 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand has 23 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 22 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:05:28,488 INFO L87 Difference]: Start difference. First operand 23 states. Second operand has 23 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 22 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:05:28,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:05:28,490 INFO L93 Difference]: Finished difference Result 23 states and 28 transitions. [2022-02-20 14:05:28,490 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 28 transitions. [2022-02-20 14:05:28,490 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:05:28,490 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:05:28,491 INFO L74 IsIncluded]: Start isIncluded. First operand has 23 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 22 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 23 states. [2022-02-20 14:05:28,491 INFO L87 Difference]: Start difference. First operand has 23 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 22 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 23 states. [2022-02-20 14:05:28,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:05:28,492 INFO L93 Difference]: Finished difference Result 23 states and 28 transitions. [2022-02-20 14:05:28,492 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 28 transitions. [2022-02-20 14:05:28,492 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:05:28,493 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:05:28,493 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:05:28,493 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:05:28,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 22 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:05:28,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 28 transitions. [2022-02-20 14:05:28,495 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 28 transitions. Word has length 15 [2022-02-20 14:05:28,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:05:28,495 INFO L470 AbstractCegarLoop]: Abstraction has 23 states and 28 transitions. [2022-02-20 14:05:28,495 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:05:28,496 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 28 transitions. [2022-02-20 14:05:28,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-02-20 14:05:28,496 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:05:28,496 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] [2022-02-20 14:05:28,496 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 14:05:28,497 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:05:28,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:05:28,497 INFO L85 PathProgramCache]: Analyzing trace with hash -1299919835, now seen corresponding path program 1 times [2022-02-20 14:05:28,498 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:05:28,498 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504838224] [2022-02-20 14:05:28,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:05:28,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:05:28,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:05:28,555 INFO L290 TraceCheckUtils]: 0: Hoare triple {174#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); {174#true} is VALID [2022-02-20 14:05:28,556 INFO L290 TraceCheckUtils]: 1: Hoare triple {174#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem2#1, main_#t~post1#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~i~0#1, main_~x~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);main_~i~0#1 := 0; {176#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:05:28,559 INFO L290 TraceCheckUtils]: 2: Hoare triple {176#(= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {177#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 14:05:28,560 INFO L290 TraceCheckUtils]: 3: Hoare triple {177#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !(main_~i~0#1 < 100000); {175#false} is VALID [2022-02-20 14:05:28,560 INFO L290 TraceCheckUtils]: 4: Hoare triple {175#false} main_~i~0#1 := 0; {175#false} is VALID [2022-02-20 14:05:28,561 INFO L290 TraceCheckUtils]: 5: Hoare triple {175#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {175#false} is VALID [2022-02-20 14:05:28,561 INFO L290 TraceCheckUtils]: 6: Hoare triple {175#false} assume !(main_~i~0#1 < 100000); {175#false} is VALID [2022-02-20 14:05:28,561 INFO L290 TraceCheckUtils]: 7: Hoare triple {175#false} main_~i~0#1 := 0; {175#false} is VALID [2022-02-20 14:05:28,561 INFO L290 TraceCheckUtils]: 8: Hoare triple {175#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {175#false} is VALID [2022-02-20 14:05:28,561 INFO L290 TraceCheckUtils]: 9: Hoare triple {175#false} assume !(main_~i~0#1 < 100000); {175#false} is VALID [2022-02-20 14:05:28,562 INFO L290 TraceCheckUtils]: 10: Hoare triple {175#false} main_~i~0#1 := 0; {175#false} is VALID [2022-02-20 14:05:28,562 INFO L290 TraceCheckUtils]: 11: Hoare triple {175#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {175#false} is VALID [2022-02-20 14:05:28,563 INFO L290 TraceCheckUtils]: 12: Hoare triple {175#false} assume !(main_~i~0#1 < 100000); {175#false} is VALID [2022-02-20 14:05:28,563 INFO L290 TraceCheckUtils]: 13: Hoare triple {175#false} main_~i~0#1 := 0; {175#false} is VALID [2022-02-20 14:05:28,563 INFO L290 TraceCheckUtils]: 14: Hoare triple {175#false} assume !!(main_~i~0#1 < 100000);call write~int(46, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {175#false} is VALID [2022-02-20 14:05:28,563 INFO L290 TraceCheckUtils]: 15: Hoare triple {175#false} assume !(main_~i~0#1 < 100000); {175#false} is VALID [2022-02-20 14:05:28,564 INFO L290 TraceCheckUtils]: 16: Hoare triple {175#false} havoc main_~x~0#1;main_~x~0#1 := 0; {175#false} is VALID [2022-02-20 14:05:28,564 INFO L290 TraceCheckUtils]: 17: Hoare triple {175#false} assume !!(main_~x~0#1 < 100000);call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~x~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 46 == main_#t~mem2#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {175#false} is VALID [2022-02-20 14:05:28,564 INFO L290 TraceCheckUtils]: 18: Hoare triple {175#false} assume 0 == __VERIFIER_assert_~cond#1; {175#false} is VALID [2022-02-20 14:05:28,564 INFO L290 TraceCheckUtils]: 19: Hoare triple {175#false} assume !false; {175#false} is VALID [2022-02-20 14:05:28,565 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-20 14:05:28,565 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:05:28,566 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504838224] [2022-02-20 14:05:28,566 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1504838224] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 14:05:28,566 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1647676111] [2022-02-20 14:05:28,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:05:28,567 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:05:28,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:05:28,568 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:05:28,608 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:05:28,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:05:28,639 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-20 14:05:28,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:05:28,652 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:05:28,733 INFO L290 TraceCheckUtils]: 0: Hoare triple {174#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); {174#true} is VALID [2022-02-20 14:05:28,734 INFO L290 TraceCheckUtils]: 1: Hoare triple {174#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem2#1, main_#t~post1#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~i~0#1, main_~x~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);main_~i~0#1 := 0; {184#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:05:28,736 INFO L290 TraceCheckUtils]: 2: Hoare triple {184#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {177#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 14:05:28,736 INFO L290 TraceCheckUtils]: 3: Hoare triple {177#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !(main_~i~0#1 < 100000); {175#false} is VALID [2022-02-20 14:05:28,737 INFO L290 TraceCheckUtils]: 4: Hoare triple {175#false} main_~i~0#1 := 0; {175#false} is VALID [2022-02-20 14:05:28,737 INFO L290 TraceCheckUtils]: 5: Hoare triple {175#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {175#false} is VALID [2022-02-20 14:05:28,737 INFO L290 TraceCheckUtils]: 6: Hoare triple {175#false} assume !(main_~i~0#1 < 100000); {175#false} is VALID [2022-02-20 14:05:28,737 INFO L290 TraceCheckUtils]: 7: Hoare triple {175#false} main_~i~0#1 := 0; {175#false} is VALID [2022-02-20 14:05:28,738 INFO L290 TraceCheckUtils]: 8: Hoare triple {175#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {175#false} is VALID [2022-02-20 14:05:28,738 INFO L290 TraceCheckUtils]: 9: Hoare triple {175#false} assume !(main_~i~0#1 < 100000); {175#false} is VALID [2022-02-20 14:05:28,738 INFO L290 TraceCheckUtils]: 10: Hoare triple {175#false} main_~i~0#1 := 0; {175#false} is VALID [2022-02-20 14:05:28,738 INFO L290 TraceCheckUtils]: 11: Hoare triple {175#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {175#false} is VALID [2022-02-20 14:05:28,738 INFO L290 TraceCheckUtils]: 12: Hoare triple {175#false} assume !(main_~i~0#1 < 100000); {175#false} is VALID [2022-02-20 14:05:28,738 INFO L290 TraceCheckUtils]: 13: Hoare triple {175#false} main_~i~0#1 := 0; {175#false} is VALID [2022-02-20 14:05:28,739 INFO L290 TraceCheckUtils]: 14: Hoare triple {175#false} assume !!(main_~i~0#1 < 100000);call write~int(46, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {175#false} is VALID [2022-02-20 14:05:28,741 INFO L290 TraceCheckUtils]: 15: Hoare triple {175#false} assume !(main_~i~0#1 < 100000); {175#false} is VALID [2022-02-20 14:05:28,741 INFO L290 TraceCheckUtils]: 16: Hoare triple {175#false} havoc main_~x~0#1;main_~x~0#1 := 0; {175#false} is VALID [2022-02-20 14:05:28,741 INFO L290 TraceCheckUtils]: 17: Hoare triple {175#false} assume !!(main_~x~0#1 < 100000);call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~x~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 46 == main_#t~mem2#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {175#false} is VALID [2022-02-20 14:05:28,742 INFO L290 TraceCheckUtils]: 18: Hoare triple {175#false} assume 0 == __VERIFIER_assert_~cond#1; {175#false} is VALID [2022-02-20 14:05:28,742 INFO L290 TraceCheckUtils]: 19: Hoare triple {175#false} assume !false; {175#false} is VALID [2022-02-20 14:05:28,742 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-20 14:05:28,742 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 14:05:28,825 INFO L290 TraceCheckUtils]: 19: Hoare triple {175#false} assume !false; {175#false} is VALID [2022-02-20 14:05:28,825 INFO L290 TraceCheckUtils]: 18: Hoare triple {175#false} assume 0 == __VERIFIER_assert_~cond#1; {175#false} is VALID [2022-02-20 14:05:28,826 INFO L290 TraceCheckUtils]: 17: Hoare triple {175#false} assume !!(main_~x~0#1 < 100000);call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~x~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 46 == main_#t~mem2#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {175#false} is VALID [2022-02-20 14:05:28,827 INFO L290 TraceCheckUtils]: 16: Hoare triple {175#false} havoc main_~x~0#1;main_~x~0#1 := 0; {175#false} is VALID [2022-02-20 14:05:28,827 INFO L290 TraceCheckUtils]: 15: Hoare triple {175#false} assume !(main_~i~0#1 < 100000); {175#false} is VALID [2022-02-20 14:05:28,828 INFO L290 TraceCheckUtils]: 14: Hoare triple {175#false} assume !!(main_~i~0#1 < 100000);call write~int(46, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {175#false} is VALID [2022-02-20 14:05:28,828 INFO L290 TraceCheckUtils]: 13: Hoare triple {175#false} main_~i~0#1 := 0; {175#false} is VALID [2022-02-20 14:05:28,828 INFO L290 TraceCheckUtils]: 12: Hoare triple {175#false} assume !(main_~i~0#1 < 100000); {175#false} is VALID [2022-02-20 14:05:28,828 INFO L290 TraceCheckUtils]: 11: Hoare triple {175#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {175#false} is VALID [2022-02-20 14:05:28,828 INFO L290 TraceCheckUtils]: 10: Hoare triple {175#false} main_~i~0#1 := 0; {175#false} is VALID [2022-02-20 14:05:28,829 INFO L290 TraceCheckUtils]: 9: Hoare triple {175#false} assume !(main_~i~0#1 < 100000); {175#false} is VALID [2022-02-20 14:05:28,843 INFO L290 TraceCheckUtils]: 8: Hoare triple {175#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {175#false} is VALID [2022-02-20 14:05:28,843 INFO L290 TraceCheckUtils]: 7: Hoare triple {175#false} main_~i~0#1 := 0; {175#false} is VALID [2022-02-20 14:05:28,843 INFO L290 TraceCheckUtils]: 6: Hoare triple {175#false} assume !(main_~i~0#1 < 100000); {175#false} is VALID [2022-02-20 14:05:28,844 INFO L290 TraceCheckUtils]: 5: Hoare triple {175#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {175#false} is VALID [2022-02-20 14:05:28,844 INFO L290 TraceCheckUtils]: 4: Hoare triple {175#false} main_~i~0#1 := 0; {175#false} is VALID [2022-02-20 14:05:28,844 INFO L290 TraceCheckUtils]: 3: Hoare triple {287#(< |ULTIMATE.start_main_~i~0#1| 100000)} assume !(main_~i~0#1 < 100000); {175#false} is VALID [2022-02-20 14:05:28,845 INFO L290 TraceCheckUtils]: 2: Hoare triple {291#(< |ULTIMATE.start_main_~i~0#1| 99999)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {287#(< |ULTIMATE.start_main_~i~0#1| 100000)} is VALID [2022-02-20 14:05:28,846 INFO L290 TraceCheckUtils]: 1: Hoare triple {174#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem2#1, main_#t~post1#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~i~0#1, main_~x~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);main_~i~0#1 := 0; {291#(< |ULTIMATE.start_main_~i~0#1| 99999)} is VALID [2022-02-20 14:05:28,846 INFO L290 TraceCheckUtils]: 0: Hoare triple {174#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); {174#true} is VALID [2022-02-20 14:05:28,847 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-20 14:05:28,847 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1647676111] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 14:05:28,850 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 14:05:28,850 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2022-02-20 14:05:28,850 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467831128] [2022-02-20 14:05:28,851 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 14:05:28,851 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-02-20 14:05:28,852 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:05:28,852 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:05:28,869 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:05:28,870 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 14:05:28,870 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:05:28,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 14:05:28,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-02-20 14:05:28,871 INFO L87 Difference]: Start difference. First operand 23 states and 28 transitions. Second operand has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:05:29,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:05:29,033 INFO L93 Difference]: Finished difference Result 57 states and 81 transitions. [2022-02-20 14:05:29,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 14:05:29,034 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-02-20 14:05:29,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:05:29,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:05:29,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 77 transitions. [2022-02-20 14:05:29,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:05:29,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 77 transitions. [2022-02-20 14:05:29,041 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 77 transitions. [2022-02-20 14:05:29,105 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:05:29,109 INFO L225 Difference]: With dead ends: 57 [2022-02-20 14:05:29,109 INFO L226 Difference]: Without dead ends: 38 [2022-02-20 14:05:29,110 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 37 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:05:29,112 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 0 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 14:05:29,112 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 42 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 14:05:29,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-02-20 14:05:29,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2022-02-20 14:05:29,132 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:05:29,135 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand has 38 states, 37 states have (on average 1.162162162162162) internal successors, (43), 37 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:05:29,135 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand has 38 states, 37 states have (on average 1.162162162162162) internal successors, (43), 37 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:05:29,135 INFO L87 Difference]: Start difference. First operand 38 states. Second operand has 38 states, 37 states have (on average 1.162162162162162) internal successors, (43), 37 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:05:29,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:05:29,138 INFO L93 Difference]: Finished difference Result 38 states and 43 transitions. [2022-02-20 14:05:29,138 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 43 transitions. [2022-02-20 14:05:29,139 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:05:29,140 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:05:29,141 INFO L74 IsIncluded]: Start isIncluded. First operand has 38 states, 37 states have (on average 1.162162162162162) internal successors, (43), 37 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 38 states. [2022-02-20 14:05:29,141 INFO L87 Difference]: Start difference. First operand has 38 states, 37 states have (on average 1.162162162162162) internal successors, (43), 37 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 38 states. [2022-02-20 14:05:29,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:05:29,142 INFO L93 Difference]: Finished difference Result 38 states and 43 transitions. [2022-02-20 14:05:29,142 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 43 transitions. [2022-02-20 14:05:29,143 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:05:29,143 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:05:29,143 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:05:29,143 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:05:29,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 37 states have (on average 1.162162162162162) internal successors, (43), 37 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:05:29,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 43 transitions. [2022-02-20 14:05:29,144 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 43 transitions. Word has length 20 [2022-02-20 14:05:29,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:05:29,145 INFO L470 AbstractCegarLoop]: Abstraction has 38 states and 43 transitions. [2022-02-20 14:05:29,145 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:05:29,145 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 43 transitions. [2022-02-20 14:05:29,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-02-20 14:05:29,146 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:05:29,146 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:05:29,165 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:05:29,362 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:05:29,363 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:05:29,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:05:29,363 INFO L85 PathProgramCache]: Analyzing trace with hash -1604238356, now seen corresponding path program 2 times [2022-02-20 14:05:29,363 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:05:29,364 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749583973] [2022-02-20 14:05:29,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:05:29,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:05:29,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:05:29,489 INFO L290 TraceCheckUtils]: 0: Hoare triple {529#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); {529#true} is VALID [2022-02-20 14:05:29,490 INFO L290 TraceCheckUtils]: 1: Hoare triple {529#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem2#1, main_#t~post1#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~i~0#1, main_~x~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);main_~i~0#1 := 0; {531#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:05:29,491 INFO L290 TraceCheckUtils]: 2: Hoare triple {531#(= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {532#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 14:05:29,492 INFO L290 TraceCheckUtils]: 3: Hoare triple {532#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {533#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-20 14:05:29,492 INFO L290 TraceCheckUtils]: 4: Hoare triple {533#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {534#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-20 14:05:29,493 INFO L290 TraceCheckUtils]: 5: Hoare triple {534#(<= |ULTIMATE.start_main_~i~0#1| 3)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {535#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-20 14:05:29,493 INFO L290 TraceCheckUtils]: 6: Hoare triple {535#(<= |ULTIMATE.start_main_~i~0#1| 4)} assume !(main_~i~0#1 < 100000); {530#false} is VALID [2022-02-20 14:05:29,493 INFO L290 TraceCheckUtils]: 7: Hoare triple {530#false} main_~i~0#1 := 0; {530#false} is VALID [2022-02-20 14:05:29,494 INFO L290 TraceCheckUtils]: 8: Hoare triple {530#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {530#false} is VALID [2022-02-20 14:05:29,494 INFO L290 TraceCheckUtils]: 9: Hoare triple {530#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {530#false} is VALID [2022-02-20 14:05:29,494 INFO L290 TraceCheckUtils]: 10: Hoare triple {530#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {530#false} is VALID [2022-02-20 14:05:29,494 INFO L290 TraceCheckUtils]: 11: Hoare triple {530#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {530#false} is VALID [2022-02-20 14:05:29,494 INFO L290 TraceCheckUtils]: 12: Hoare triple {530#false} assume !(main_~i~0#1 < 100000); {530#false} is VALID [2022-02-20 14:05:29,494 INFO L290 TraceCheckUtils]: 13: Hoare triple {530#false} main_~i~0#1 := 0; {530#false} is VALID [2022-02-20 14:05:29,495 INFO L290 TraceCheckUtils]: 14: Hoare triple {530#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {530#false} is VALID [2022-02-20 14:05:29,495 INFO L290 TraceCheckUtils]: 15: Hoare triple {530#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {530#false} is VALID [2022-02-20 14:05:29,495 INFO L290 TraceCheckUtils]: 16: Hoare triple {530#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {530#false} is VALID [2022-02-20 14:05:29,495 INFO L290 TraceCheckUtils]: 17: Hoare triple {530#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {530#false} is VALID [2022-02-20 14:05:29,495 INFO L290 TraceCheckUtils]: 18: Hoare triple {530#false} assume !(main_~i~0#1 < 100000); {530#false} is VALID [2022-02-20 14:05:29,496 INFO L290 TraceCheckUtils]: 19: Hoare triple {530#false} main_~i~0#1 := 0; {530#false} is VALID [2022-02-20 14:05:29,496 INFO L290 TraceCheckUtils]: 20: Hoare triple {530#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {530#false} is VALID [2022-02-20 14:05:29,496 INFO L290 TraceCheckUtils]: 21: Hoare triple {530#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {530#false} is VALID [2022-02-20 14:05:29,496 INFO L290 TraceCheckUtils]: 22: Hoare triple {530#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {530#false} is VALID [2022-02-20 14:05:29,496 INFO L290 TraceCheckUtils]: 23: Hoare triple {530#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {530#false} is VALID [2022-02-20 14:05:29,496 INFO L290 TraceCheckUtils]: 24: Hoare triple {530#false} assume !(main_~i~0#1 < 100000); {530#false} is VALID [2022-02-20 14:05:29,497 INFO L290 TraceCheckUtils]: 25: Hoare triple {530#false} main_~i~0#1 := 0; {530#false} is VALID [2022-02-20 14:05:29,497 INFO L290 TraceCheckUtils]: 26: Hoare triple {530#false} assume !!(main_~i~0#1 < 100000);call write~int(46, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {530#false} is VALID [2022-02-20 14:05:29,497 INFO L290 TraceCheckUtils]: 27: Hoare triple {530#false} assume !!(main_~i~0#1 < 100000);call write~int(46, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {530#false} is VALID [2022-02-20 14:05:29,497 INFO L290 TraceCheckUtils]: 28: Hoare triple {530#false} assume !!(main_~i~0#1 < 100000);call write~int(46, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {530#false} is VALID [2022-02-20 14:05:29,497 INFO L290 TraceCheckUtils]: 29: Hoare triple {530#false} assume !!(main_~i~0#1 < 100000);call write~int(46, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {530#false} is VALID [2022-02-20 14:05:29,497 INFO L290 TraceCheckUtils]: 30: Hoare triple {530#false} assume !(main_~i~0#1 < 100000); {530#false} is VALID [2022-02-20 14:05:29,499 INFO L290 TraceCheckUtils]: 31: Hoare triple {530#false} havoc main_~x~0#1;main_~x~0#1 := 0; {530#false} is VALID [2022-02-20 14:05:29,499 INFO L290 TraceCheckUtils]: 32: Hoare triple {530#false} assume !!(main_~x~0#1 < 100000);call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~x~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 46 == main_#t~mem2#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {530#false} is VALID [2022-02-20 14:05:29,499 INFO L290 TraceCheckUtils]: 33: Hoare triple {530#false} assume 0 == __VERIFIER_assert_~cond#1; {530#false} is VALID [2022-02-20 14:05:29,499 INFO L290 TraceCheckUtils]: 34: Hoare triple {530#false} assume !false; {530#false} is VALID [2022-02-20 14:05:29,500 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-02-20 14:05:29,500 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:05:29,500 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749583973] [2022-02-20 14:05:29,500 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1749583973] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 14:05:29,502 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1837050060] [2022-02-20 14:05:29,502 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-20 14:05:29,502 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:05:29,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:05:29,503 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:05:29,506 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:05:29,597 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-20 14:05:29,598 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 14:05:29,599 INFO L263 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-20 14:05:29,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:05:29,609 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:05:29,710 INFO L290 TraceCheckUtils]: 0: Hoare triple {529#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); {529#true} is VALID [2022-02-20 14:05:29,711 INFO L290 TraceCheckUtils]: 1: Hoare triple {529#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem2#1, main_#t~post1#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~i~0#1, main_~x~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);main_~i~0#1 := 0; {542#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:05:29,712 INFO L290 TraceCheckUtils]: 2: Hoare triple {542#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {532#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 14:05:29,712 INFO L290 TraceCheckUtils]: 3: Hoare triple {532#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {533#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-20 14:05:29,713 INFO L290 TraceCheckUtils]: 4: Hoare triple {533#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {534#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-20 14:05:29,714 INFO L290 TraceCheckUtils]: 5: Hoare triple {534#(<= |ULTIMATE.start_main_~i~0#1| 3)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {535#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-20 14:05:29,714 INFO L290 TraceCheckUtils]: 6: Hoare triple {535#(<= |ULTIMATE.start_main_~i~0#1| 4)} assume !(main_~i~0#1 < 100000); {530#false} is VALID [2022-02-20 14:05:29,714 INFO L290 TraceCheckUtils]: 7: Hoare triple {530#false} main_~i~0#1 := 0; {530#false} is VALID [2022-02-20 14:05:29,714 INFO L290 TraceCheckUtils]: 8: Hoare triple {530#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {530#false} is VALID [2022-02-20 14:05:29,715 INFO L290 TraceCheckUtils]: 9: Hoare triple {530#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {530#false} is VALID [2022-02-20 14:05:29,715 INFO L290 TraceCheckUtils]: 10: Hoare triple {530#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {530#false} is VALID [2022-02-20 14:05:29,715 INFO L290 TraceCheckUtils]: 11: Hoare triple {530#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {530#false} is VALID [2022-02-20 14:05:29,715 INFO L290 TraceCheckUtils]: 12: Hoare triple {530#false} assume !(main_~i~0#1 < 100000); {530#false} is VALID [2022-02-20 14:05:29,715 INFO L290 TraceCheckUtils]: 13: Hoare triple {530#false} main_~i~0#1 := 0; {530#false} is VALID [2022-02-20 14:05:29,715 INFO L290 TraceCheckUtils]: 14: Hoare triple {530#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {530#false} is VALID [2022-02-20 14:05:29,716 INFO L290 TraceCheckUtils]: 15: Hoare triple {530#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {530#false} is VALID [2022-02-20 14:05:29,716 INFO L290 TraceCheckUtils]: 16: Hoare triple {530#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {530#false} is VALID [2022-02-20 14:05:29,716 INFO L290 TraceCheckUtils]: 17: Hoare triple {530#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {530#false} is VALID [2022-02-20 14:05:29,716 INFO L290 TraceCheckUtils]: 18: Hoare triple {530#false} assume !(main_~i~0#1 < 100000); {530#false} is VALID [2022-02-20 14:05:29,716 INFO L290 TraceCheckUtils]: 19: Hoare triple {530#false} main_~i~0#1 := 0; {530#false} is VALID [2022-02-20 14:05:29,716 INFO L290 TraceCheckUtils]: 20: Hoare triple {530#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {530#false} is VALID [2022-02-20 14:05:29,717 INFO L290 TraceCheckUtils]: 21: Hoare triple {530#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {530#false} is VALID [2022-02-20 14:05:29,717 INFO L290 TraceCheckUtils]: 22: Hoare triple {530#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {530#false} is VALID [2022-02-20 14:05:29,717 INFO L290 TraceCheckUtils]: 23: Hoare triple {530#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {530#false} is VALID [2022-02-20 14:05:29,717 INFO L290 TraceCheckUtils]: 24: Hoare triple {530#false} assume !(main_~i~0#1 < 100000); {530#false} is VALID [2022-02-20 14:05:29,717 INFO L290 TraceCheckUtils]: 25: Hoare triple {530#false} main_~i~0#1 := 0; {530#false} is VALID [2022-02-20 14:05:29,717 INFO L290 TraceCheckUtils]: 26: Hoare triple {530#false} assume !!(main_~i~0#1 < 100000);call write~int(46, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {530#false} is VALID [2022-02-20 14:05:29,718 INFO L290 TraceCheckUtils]: 27: Hoare triple {530#false} assume !!(main_~i~0#1 < 100000);call write~int(46, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {530#false} is VALID [2022-02-20 14:05:29,718 INFO L290 TraceCheckUtils]: 28: Hoare triple {530#false} assume !!(main_~i~0#1 < 100000);call write~int(46, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {530#false} is VALID [2022-02-20 14:05:29,718 INFO L290 TraceCheckUtils]: 29: Hoare triple {530#false} assume !!(main_~i~0#1 < 100000);call write~int(46, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {530#false} is VALID [2022-02-20 14:05:29,718 INFO L290 TraceCheckUtils]: 30: Hoare triple {530#false} assume !(main_~i~0#1 < 100000); {530#false} is VALID [2022-02-20 14:05:29,718 INFO L290 TraceCheckUtils]: 31: Hoare triple {530#false} havoc main_~x~0#1;main_~x~0#1 := 0; {530#false} is VALID [2022-02-20 14:05:29,718 INFO L290 TraceCheckUtils]: 32: Hoare triple {530#false} assume !!(main_~x~0#1 < 100000);call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~x~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 46 == main_#t~mem2#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {530#false} is VALID [2022-02-20 14:05:29,719 INFO L290 TraceCheckUtils]: 33: Hoare triple {530#false} assume 0 == __VERIFIER_assert_~cond#1; {530#false} is VALID [2022-02-20 14:05:29,719 INFO L290 TraceCheckUtils]: 34: Hoare triple {530#false} assume !false; {530#false} is VALID [2022-02-20 14:05:29,719 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-02-20 14:05:29,719 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 14:05:29,845 INFO L290 TraceCheckUtils]: 34: Hoare triple {530#false} assume !false; {530#false} is VALID [2022-02-20 14:05:29,845 INFO L290 TraceCheckUtils]: 33: Hoare triple {530#false} assume 0 == __VERIFIER_assert_~cond#1; {530#false} is VALID [2022-02-20 14:05:29,845 INFO L290 TraceCheckUtils]: 32: Hoare triple {530#false} assume !!(main_~x~0#1 < 100000);call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~x~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 46 == main_#t~mem2#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {530#false} is VALID [2022-02-20 14:05:29,845 INFO L290 TraceCheckUtils]: 31: Hoare triple {530#false} havoc main_~x~0#1;main_~x~0#1 := 0; {530#false} is VALID [2022-02-20 14:05:29,845 INFO L290 TraceCheckUtils]: 30: Hoare triple {530#false} assume !(main_~i~0#1 < 100000); {530#false} is VALID [2022-02-20 14:05:29,846 INFO L290 TraceCheckUtils]: 29: Hoare triple {530#false} assume !!(main_~i~0#1 < 100000);call write~int(46, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {530#false} is VALID [2022-02-20 14:05:29,846 INFO L290 TraceCheckUtils]: 28: Hoare triple {530#false} assume !!(main_~i~0#1 < 100000);call write~int(46, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {530#false} is VALID [2022-02-20 14:05:29,846 INFO L290 TraceCheckUtils]: 27: Hoare triple {530#false} assume !!(main_~i~0#1 < 100000);call write~int(46, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {530#false} is VALID [2022-02-20 14:05:29,846 INFO L290 TraceCheckUtils]: 26: Hoare triple {530#false} assume !!(main_~i~0#1 < 100000);call write~int(46, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {530#false} is VALID [2022-02-20 14:05:29,846 INFO L290 TraceCheckUtils]: 25: Hoare triple {530#false} main_~i~0#1 := 0; {530#false} is VALID [2022-02-20 14:05:29,846 INFO L290 TraceCheckUtils]: 24: Hoare triple {530#false} assume !(main_~i~0#1 < 100000); {530#false} is VALID [2022-02-20 14:05:29,847 INFO L290 TraceCheckUtils]: 23: Hoare triple {530#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {530#false} is VALID [2022-02-20 14:05:29,847 INFO L290 TraceCheckUtils]: 22: Hoare triple {530#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {530#false} is VALID [2022-02-20 14:05:29,847 INFO L290 TraceCheckUtils]: 21: Hoare triple {530#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {530#false} is VALID [2022-02-20 14:05:29,847 INFO L290 TraceCheckUtils]: 20: Hoare triple {530#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {530#false} is VALID [2022-02-20 14:05:29,847 INFO L290 TraceCheckUtils]: 19: Hoare triple {530#false} main_~i~0#1 := 0; {530#false} is VALID [2022-02-20 14:05:29,847 INFO L290 TraceCheckUtils]: 18: Hoare triple {530#false} assume !(main_~i~0#1 < 100000); {530#false} is VALID [2022-02-20 14:05:29,848 INFO L290 TraceCheckUtils]: 17: Hoare triple {530#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {530#false} is VALID [2022-02-20 14:05:29,848 INFO L290 TraceCheckUtils]: 16: Hoare triple {530#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {530#false} is VALID [2022-02-20 14:05:29,848 INFO L290 TraceCheckUtils]: 15: Hoare triple {530#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {530#false} is VALID [2022-02-20 14:05:29,848 INFO L290 TraceCheckUtils]: 14: Hoare triple {530#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {530#false} is VALID [2022-02-20 14:05:29,848 INFO L290 TraceCheckUtils]: 13: Hoare triple {530#false} main_~i~0#1 := 0; {530#false} is VALID [2022-02-20 14:05:29,848 INFO L290 TraceCheckUtils]: 12: Hoare triple {530#false} assume !(main_~i~0#1 < 100000); {530#false} is VALID [2022-02-20 14:05:29,849 INFO L290 TraceCheckUtils]: 11: Hoare triple {530#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {530#false} is VALID [2022-02-20 14:05:29,849 INFO L290 TraceCheckUtils]: 10: Hoare triple {530#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {530#false} is VALID [2022-02-20 14:05:29,849 INFO L290 TraceCheckUtils]: 9: Hoare triple {530#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {530#false} is VALID [2022-02-20 14:05:29,849 INFO L290 TraceCheckUtils]: 8: Hoare triple {530#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {530#false} is VALID [2022-02-20 14:05:29,849 INFO L290 TraceCheckUtils]: 7: Hoare triple {530#false} main_~i~0#1 := 0; {530#false} is VALID [2022-02-20 14:05:29,850 INFO L290 TraceCheckUtils]: 6: Hoare triple {726#(< |ULTIMATE.start_main_~i~0#1| 100000)} assume !(main_~i~0#1 < 100000); {530#false} is VALID [2022-02-20 14:05:29,850 INFO L290 TraceCheckUtils]: 5: Hoare triple {730#(< |ULTIMATE.start_main_~i~0#1| 99999)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {726#(< |ULTIMATE.start_main_~i~0#1| 100000)} is VALID [2022-02-20 14:05:29,851 INFO L290 TraceCheckUtils]: 4: Hoare triple {734#(< |ULTIMATE.start_main_~i~0#1| 99998)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {730#(< |ULTIMATE.start_main_~i~0#1| 99999)} is VALID [2022-02-20 14:05:29,851 INFO L290 TraceCheckUtils]: 3: Hoare triple {738#(< |ULTIMATE.start_main_~i~0#1| 99997)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {734#(< |ULTIMATE.start_main_~i~0#1| 99998)} is VALID [2022-02-20 14:05:29,852 INFO L290 TraceCheckUtils]: 2: Hoare triple {742#(< |ULTIMATE.start_main_~i~0#1| 99996)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {738#(< |ULTIMATE.start_main_~i~0#1| 99997)} is VALID [2022-02-20 14:05:29,852 INFO L290 TraceCheckUtils]: 1: Hoare triple {529#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem2#1, main_#t~post1#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~i~0#1, main_~x~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);main_~i~0#1 := 0; {742#(< |ULTIMATE.start_main_~i~0#1| 99996)} is VALID [2022-02-20 14:05:29,853 INFO L290 TraceCheckUtils]: 0: Hoare triple {529#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); {529#true} is VALID [2022-02-20 14:05:29,853 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-02-20 14:05:29,853 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1837050060] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 14:05:29,853 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 14:05:29,853 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2022-02-20 14:05:29,853 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456522281] [2022-02-20 14:05:29,854 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 14:05:29,854 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 13 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2022-02-20 14:05:29,854 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:05:29,855 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 13 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:05:29,871 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:05:29,872 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-02-20 14:05:29,872 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:05:29,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-02-20 14:05:29,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2022-02-20 14:05:29,873 INFO L87 Difference]: Start difference. First operand 38 states and 43 transitions. Second operand has 13 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 13 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:05:30,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:05:30,204 INFO L93 Difference]: Finished difference Result 99 states and 138 transitions. [2022-02-20 14:05:30,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-20 14:05:30,204 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 13 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2022-02-20 14:05:30,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:05:30,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 13 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:05:30,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 122 transitions. [2022-02-20 14:05:30,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 13 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:05:30,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 122 transitions. [2022-02-20 14:05:30,209 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 122 transitions. [2022-02-20 14:05:30,308 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 122 edges. 122 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:05:30,310 INFO L225 Difference]: With dead ends: 99 [2022-02-20 14:05:30,311 INFO L226 Difference]: Without dead ends: 68 [2022-02-20 14:05:30,311 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2022-02-20 14:05:30,312 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 0 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 137 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 137 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 14:05:30,313 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 42 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [137 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 14:05:30,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2022-02-20 14:05:30,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2022-02-20 14:05:30,346 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:05:30,346 INFO L82 GeneralOperation]: Start isEquivalent. First operand 68 states. Second operand has 68 states, 67 states have (on average 1.0895522388059702) internal successors, (73), 67 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:05:30,347 INFO L74 IsIncluded]: Start isIncluded. First operand 68 states. Second operand has 68 states, 67 states have (on average 1.0895522388059702) internal successors, (73), 67 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:05:30,347 INFO L87 Difference]: Start difference. First operand 68 states. Second operand has 68 states, 67 states have (on average 1.0895522388059702) internal successors, (73), 67 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:05:30,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:05:30,349 INFO L93 Difference]: Finished difference Result 68 states and 73 transitions. [2022-02-20 14:05:30,349 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 73 transitions. [2022-02-20 14:05:30,350 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:05:30,350 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:05:30,350 INFO L74 IsIncluded]: Start isIncluded. First operand has 68 states, 67 states have (on average 1.0895522388059702) internal successors, (73), 67 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 68 states. [2022-02-20 14:05:30,350 INFO L87 Difference]: Start difference. First operand has 68 states, 67 states have (on average 1.0895522388059702) internal successors, (73), 67 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 68 states. [2022-02-20 14:05:30,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:05:30,352 INFO L93 Difference]: Finished difference Result 68 states and 73 transitions. [2022-02-20 14:05:30,352 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 73 transitions. [2022-02-20 14:05:30,353 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:05:30,353 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:05:30,353 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:05:30,353 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:05:30,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 67 states have (on average 1.0895522388059702) internal successors, (73), 67 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:05:30,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 73 transitions. [2022-02-20 14:05:30,355 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 73 transitions. Word has length 35 [2022-02-20 14:05:30,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:05:30,355 INFO L470 AbstractCegarLoop]: Abstraction has 68 states and 73 transitions. [2022-02-20 14:05:30,356 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 13 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:05:30,356 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 73 transitions. [2022-02-20 14:05:30,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-20 14:05:30,357 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:05:30,357 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:05:30,379 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:05:30,576 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:05:30,577 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:05:30,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:05:30,578 INFO L85 PathProgramCache]: Analyzing trace with hash 1605603020, now seen corresponding path program 3 times [2022-02-20 14:05:30,578 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:05:30,578 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921041893] [2022-02-20 14:05:30,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:05:30,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:05:30,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:05:30,864 INFO L290 TraceCheckUtils]: 0: Hoare triple {1184#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); {1184#true} is VALID [2022-02-20 14:05:30,865 INFO L290 TraceCheckUtils]: 1: Hoare triple {1184#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem2#1, main_#t~post1#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~i~0#1, main_~x~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);main_~i~0#1 := 0; {1186#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:05:30,865 INFO L290 TraceCheckUtils]: 2: Hoare triple {1186#(= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1187#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 14:05:30,866 INFO L290 TraceCheckUtils]: 3: Hoare triple {1187#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1188#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-20 14:05:30,866 INFO L290 TraceCheckUtils]: 4: Hoare triple {1188#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1189#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-20 14:05:30,867 INFO L290 TraceCheckUtils]: 5: Hoare triple {1189#(<= |ULTIMATE.start_main_~i~0#1| 3)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1190#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-20 14:05:30,868 INFO L290 TraceCheckUtils]: 6: Hoare triple {1190#(<= |ULTIMATE.start_main_~i~0#1| 4)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1191#(<= |ULTIMATE.start_main_~i~0#1| 5)} is VALID [2022-02-20 14:05:30,868 INFO L290 TraceCheckUtils]: 7: Hoare triple {1191#(<= |ULTIMATE.start_main_~i~0#1| 5)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1192#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-20 14:05:30,871 INFO L290 TraceCheckUtils]: 8: Hoare triple {1192#(<= |ULTIMATE.start_main_~i~0#1| 6)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1193#(<= |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-20 14:05:30,873 INFO L290 TraceCheckUtils]: 9: Hoare triple {1193#(<= |ULTIMATE.start_main_~i~0#1| 7)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1194#(<= |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-20 14:05:30,873 INFO L290 TraceCheckUtils]: 10: Hoare triple {1194#(<= |ULTIMATE.start_main_~i~0#1| 8)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1195#(<= |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-20 14:05:30,874 INFO L290 TraceCheckUtils]: 11: Hoare triple {1195#(<= |ULTIMATE.start_main_~i~0#1| 9)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1196#(<= |ULTIMATE.start_main_~i~0#1| 10)} is VALID [2022-02-20 14:05:30,875 INFO L290 TraceCheckUtils]: 12: Hoare triple {1196#(<= |ULTIMATE.start_main_~i~0#1| 10)} assume !(main_~i~0#1 < 100000); {1185#false} is VALID [2022-02-20 14:05:30,875 INFO L290 TraceCheckUtils]: 13: Hoare triple {1185#false} main_~i~0#1 := 0; {1185#false} is VALID [2022-02-20 14:05:30,875 INFO L290 TraceCheckUtils]: 14: Hoare triple {1185#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1185#false} is VALID [2022-02-20 14:05:30,875 INFO L290 TraceCheckUtils]: 15: Hoare triple {1185#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1185#false} is VALID [2022-02-20 14:05:30,876 INFO L290 TraceCheckUtils]: 16: Hoare triple {1185#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1185#false} is VALID [2022-02-20 14:05:30,876 INFO L290 TraceCheckUtils]: 17: Hoare triple {1185#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1185#false} is VALID [2022-02-20 14:05:30,876 INFO L290 TraceCheckUtils]: 18: Hoare triple {1185#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1185#false} is VALID [2022-02-20 14:05:30,876 INFO L290 TraceCheckUtils]: 19: Hoare triple {1185#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1185#false} is VALID [2022-02-20 14:05:30,876 INFO L290 TraceCheckUtils]: 20: Hoare triple {1185#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1185#false} is VALID [2022-02-20 14:05:30,876 INFO L290 TraceCheckUtils]: 21: Hoare triple {1185#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1185#false} is VALID [2022-02-20 14:05:30,876 INFO L290 TraceCheckUtils]: 22: Hoare triple {1185#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1185#false} is VALID [2022-02-20 14:05:30,877 INFO L290 TraceCheckUtils]: 23: Hoare triple {1185#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1185#false} is VALID [2022-02-20 14:05:30,877 INFO L290 TraceCheckUtils]: 24: Hoare triple {1185#false} assume !(main_~i~0#1 < 100000); {1185#false} is VALID [2022-02-20 14:05:30,877 INFO L290 TraceCheckUtils]: 25: Hoare triple {1185#false} main_~i~0#1 := 0; {1185#false} is VALID [2022-02-20 14:05:30,877 INFO L290 TraceCheckUtils]: 26: Hoare triple {1185#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1185#false} is VALID [2022-02-20 14:05:30,877 INFO L290 TraceCheckUtils]: 27: Hoare triple {1185#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1185#false} is VALID [2022-02-20 14:05:30,877 INFO L290 TraceCheckUtils]: 28: Hoare triple {1185#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1185#false} is VALID [2022-02-20 14:05:30,878 INFO L290 TraceCheckUtils]: 29: Hoare triple {1185#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1185#false} is VALID [2022-02-20 14:05:30,878 INFO L290 TraceCheckUtils]: 30: Hoare triple {1185#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1185#false} is VALID [2022-02-20 14:05:30,878 INFO L290 TraceCheckUtils]: 31: Hoare triple {1185#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1185#false} is VALID [2022-02-20 14:05:30,878 INFO L290 TraceCheckUtils]: 32: Hoare triple {1185#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1185#false} is VALID [2022-02-20 14:05:30,878 INFO L290 TraceCheckUtils]: 33: Hoare triple {1185#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1185#false} is VALID [2022-02-20 14:05:30,878 INFO L290 TraceCheckUtils]: 34: Hoare triple {1185#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1185#false} is VALID [2022-02-20 14:05:30,879 INFO L290 TraceCheckUtils]: 35: Hoare triple {1185#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1185#false} is VALID [2022-02-20 14:05:30,879 INFO L290 TraceCheckUtils]: 36: Hoare triple {1185#false} assume !(main_~i~0#1 < 100000); {1185#false} is VALID [2022-02-20 14:05:30,879 INFO L290 TraceCheckUtils]: 37: Hoare triple {1185#false} main_~i~0#1 := 0; {1185#false} is VALID [2022-02-20 14:05:30,879 INFO L290 TraceCheckUtils]: 38: Hoare triple {1185#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1185#false} is VALID [2022-02-20 14:05:30,879 INFO L290 TraceCheckUtils]: 39: Hoare triple {1185#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1185#false} is VALID [2022-02-20 14:05:30,879 INFO L290 TraceCheckUtils]: 40: Hoare triple {1185#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1185#false} is VALID [2022-02-20 14:05:30,879 INFO L290 TraceCheckUtils]: 41: Hoare triple {1185#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1185#false} is VALID [2022-02-20 14:05:30,880 INFO L290 TraceCheckUtils]: 42: Hoare triple {1185#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1185#false} is VALID [2022-02-20 14:05:30,880 INFO L290 TraceCheckUtils]: 43: Hoare triple {1185#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1185#false} is VALID [2022-02-20 14:05:30,880 INFO L290 TraceCheckUtils]: 44: Hoare triple {1185#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1185#false} is VALID [2022-02-20 14:05:30,880 INFO L290 TraceCheckUtils]: 45: Hoare triple {1185#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1185#false} is VALID [2022-02-20 14:05:30,880 INFO L290 TraceCheckUtils]: 46: Hoare triple {1185#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1185#false} is VALID [2022-02-20 14:05:30,880 INFO L290 TraceCheckUtils]: 47: Hoare triple {1185#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1185#false} is VALID [2022-02-20 14:05:30,881 INFO L290 TraceCheckUtils]: 48: Hoare triple {1185#false} assume !(main_~i~0#1 < 100000); {1185#false} is VALID [2022-02-20 14:05:30,881 INFO L290 TraceCheckUtils]: 49: Hoare triple {1185#false} main_~i~0#1 := 0; {1185#false} is VALID [2022-02-20 14:05:30,881 INFO L290 TraceCheckUtils]: 50: Hoare triple {1185#false} assume !!(main_~i~0#1 < 100000);call write~int(46, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1185#false} is VALID [2022-02-20 14:05:30,881 INFO L290 TraceCheckUtils]: 51: Hoare triple {1185#false} assume !!(main_~i~0#1 < 100000);call write~int(46, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1185#false} is VALID [2022-02-20 14:05:30,881 INFO L290 TraceCheckUtils]: 52: Hoare triple {1185#false} assume !!(main_~i~0#1 < 100000);call write~int(46, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1185#false} is VALID [2022-02-20 14:05:30,881 INFO L290 TraceCheckUtils]: 53: Hoare triple {1185#false} assume !!(main_~i~0#1 < 100000);call write~int(46, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1185#false} is VALID [2022-02-20 14:05:30,882 INFO L290 TraceCheckUtils]: 54: Hoare triple {1185#false} assume !!(main_~i~0#1 < 100000);call write~int(46, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1185#false} is VALID [2022-02-20 14:05:30,882 INFO L290 TraceCheckUtils]: 55: Hoare triple {1185#false} assume !!(main_~i~0#1 < 100000);call write~int(46, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1185#false} is VALID [2022-02-20 14:05:30,882 INFO L290 TraceCheckUtils]: 56: Hoare triple {1185#false} assume !!(main_~i~0#1 < 100000);call write~int(46, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1185#false} is VALID [2022-02-20 14:05:30,882 INFO L290 TraceCheckUtils]: 57: Hoare triple {1185#false} assume !!(main_~i~0#1 < 100000);call write~int(46, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1185#false} is VALID [2022-02-20 14:05:30,882 INFO L290 TraceCheckUtils]: 58: Hoare triple {1185#false} assume !!(main_~i~0#1 < 100000);call write~int(46, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1185#false} is VALID [2022-02-20 14:05:30,882 INFO L290 TraceCheckUtils]: 59: Hoare triple {1185#false} assume !!(main_~i~0#1 < 100000);call write~int(46, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1185#false} is VALID [2022-02-20 14:05:30,882 INFO L290 TraceCheckUtils]: 60: Hoare triple {1185#false} assume !(main_~i~0#1 < 100000); {1185#false} is VALID [2022-02-20 14:05:30,883 INFO L290 TraceCheckUtils]: 61: Hoare triple {1185#false} havoc main_~x~0#1;main_~x~0#1 := 0; {1185#false} is VALID [2022-02-20 14:05:30,883 INFO L290 TraceCheckUtils]: 62: Hoare triple {1185#false} assume !!(main_~x~0#1 < 100000);call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~x~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 46 == main_#t~mem2#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {1185#false} is VALID [2022-02-20 14:05:30,883 INFO L290 TraceCheckUtils]: 63: Hoare triple {1185#false} assume 0 == __VERIFIER_assert_~cond#1; {1185#false} is VALID [2022-02-20 14:05:30,883 INFO L290 TraceCheckUtils]: 64: Hoare triple {1185#false} assume !false; {1185#false} is VALID [2022-02-20 14:05:30,883 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2022-02-20 14:05:30,884 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:05:30,884 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921041893] [2022-02-20 14:05:30,884 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [921041893] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 14:05:30,884 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [33552599] [2022-02-20 14:05:30,884 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-20 14:05:30,884 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:05:30,885 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:05:30,885 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:05:30,887 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:05:33,441 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2022-02-20 14:05:33,441 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 14:05:33,450 INFO L263 TraceCheckSpWp]: Trace formula consists of 410 conjuncts, 12 conjunts are in the unsatisfiable core [2022-02-20 14:05:33,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:05:33,475 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:05:33,690 INFO L290 TraceCheckUtils]: 0: Hoare triple {1184#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); {1184#true} is VALID [2022-02-20 14:05:33,691 INFO L290 TraceCheckUtils]: 1: Hoare triple {1184#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem2#1, main_#t~post1#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~i~0#1, main_~x~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);main_~i~0#1 := 0; {1184#true} is VALID [2022-02-20 14:05:33,691 INFO L290 TraceCheckUtils]: 2: Hoare triple {1184#true} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1184#true} is VALID [2022-02-20 14:05:33,692 INFO L290 TraceCheckUtils]: 3: Hoare triple {1184#true} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1184#true} is VALID [2022-02-20 14:05:33,694 INFO L290 TraceCheckUtils]: 4: Hoare triple {1184#true} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1184#true} is VALID [2022-02-20 14:05:33,695 INFO L290 TraceCheckUtils]: 5: Hoare triple {1184#true} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1184#true} is VALID [2022-02-20 14:05:33,701 INFO L290 TraceCheckUtils]: 6: Hoare triple {1184#true} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1184#true} is VALID [2022-02-20 14:05:33,702 INFO L290 TraceCheckUtils]: 7: Hoare triple {1184#true} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1184#true} is VALID [2022-02-20 14:05:33,702 INFO L290 TraceCheckUtils]: 8: Hoare triple {1184#true} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1184#true} is VALID [2022-02-20 14:05:33,703 INFO L290 TraceCheckUtils]: 9: Hoare triple {1184#true} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1184#true} is VALID [2022-02-20 14:05:33,703 INFO L290 TraceCheckUtils]: 10: Hoare triple {1184#true} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1184#true} is VALID [2022-02-20 14:05:33,705 INFO L290 TraceCheckUtils]: 11: Hoare triple {1184#true} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1184#true} is VALID [2022-02-20 14:05:33,706 INFO L290 TraceCheckUtils]: 12: Hoare triple {1184#true} assume !(main_~i~0#1 < 100000); {1184#true} is VALID [2022-02-20 14:05:33,706 INFO L290 TraceCheckUtils]: 13: Hoare triple {1184#true} main_~i~0#1 := 0; {1239#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:05:33,707 INFO L290 TraceCheckUtils]: 14: Hoare triple {1239#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1187#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 14:05:33,707 INFO L290 TraceCheckUtils]: 15: Hoare triple {1187#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1188#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-20 14:05:33,708 INFO L290 TraceCheckUtils]: 16: Hoare triple {1188#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1189#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-20 14:05:33,708 INFO L290 TraceCheckUtils]: 17: Hoare triple {1189#(<= |ULTIMATE.start_main_~i~0#1| 3)} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1190#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-20 14:05:33,709 INFO L290 TraceCheckUtils]: 18: Hoare triple {1190#(<= |ULTIMATE.start_main_~i~0#1| 4)} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1191#(<= |ULTIMATE.start_main_~i~0#1| 5)} is VALID [2022-02-20 14:05:33,709 INFO L290 TraceCheckUtils]: 19: Hoare triple {1191#(<= |ULTIMATE.start_main_~i~0#1| 5)} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1192#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-20 14:05:33,710 INFO L290 TraceCheckUtils]: 20: Hoare triple {1192#(<= |ULTIMATE.start_main_~i~0#1| 6)} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1193#(<= |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-20 14:05:33,711 INFO L290 TraceCheckUtils]: 21: Hoare triple {1193#(<= |ULTIMATE.start_main_~i~0#1| 7)} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1194#(<= |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-20 14:05:33,712 INFO L290 TraceCheckUtils]: 22: Hoare triple {1194#(<= |ULTIMATE.start_main_~i~0#1| 8)} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1195#(<= |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-20 14:05:33,712 INFO L290 TraceCheckUtils]: 23: Hoare triple {1195#(<= |ULTIMATE.start_main_~i~0#1| 9)} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1196#(<= |ULTIMATE.start_main_~i~0#1| 10)} is VALID [2022-02-20 14:05:33,713 INFO L290 TraceCheckUtils]: 24: Hoare triple {1196#(<= |ULTIMATE.start_main_~i~0#1| 10)} assume !(main_~i~0#1 < 100000); {1185#false} is VALID [2022-02-20 14:05:33,713 INFO L290 TraceCheckUtils]: 25: Hoare triple {1185#false} main_~i~0#1 := 0; {1185#false} is VALID [2022-02-20 14:05:33,713 INFO L290 TraceCheckUtils]: 26: Hoare triple {1185#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1185#false} is VALID [2022-02-20 14:05:33,713 INFO L290 TraceCheckUtils]: 27: Hoare triple {1185#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1185#false} is VALID [2022-02-20 14:05:33,713 INFO L290 TraceCheckUtils]: 28: Hoare triple {1185#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1185#false} is VALID [2022-02-20 14:05:33,713 INFO L290 TraceCheckUtils]: 29: Hoare triple {1185#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1185#false} is VALID [2022-02-20 14:05:33,714 INFO L290 TraceCheckUtils]: 30: Hoare triple {1185#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1185#false} is VALID [2022-02-20 14:05:33,714 INFO L290 TraceCheckUtils]: 31: Hoare triple {1185#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1185#false} is VALID [2022-02-20 14:05:33,714 INFO L290 TraceCheckUtils]: 32: Hoare triple {1185#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1185#false} is VALID [2022-02-20 14:05:33,714 INFO L290 TraceCheckUtils]: 33: Hoare triple {1185#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1185#false} is VALID [2022-02-20 14:05:33,714 INFO L290 TraceCheckUtils]: 34: Hoare triple {1185#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1185#false} is VALID [2022-02-20 14:05:33,714 INFO L290 TraceCheckUtils]: 35: Hoare triple {1185#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1185#false} is VALID [2022-02-20 14:05:33,714 INFO L290 TraceCheckUtils]: 36: Hoare triple {1185#false} assume !(main_~i~0#1 < 100000); {1185#false} is VALID [2022-02-20 14:05:33,714 INFO L290 TraceCheckUtils]: 37: Hoare triple {1185#false} main_~i~0#1 := 0; {1185#false} is VALID [2022-02-20 14:05:33,715 INFO L290 TraceCheckUtils]: 38: Hoare triple {1185#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1185#false} is VALID [2022-02-20 14:05:33,716 INFO L290 TraceCheckUtils]: 39: Hoare triple {1185#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1185#false} is VALID [2022-02-20 14:05:33,716 INFO L290 TraceCheckUtils]: 40: Hoare triple {1185#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1185#false} is VALID [2022-02-20 14:05:33,716 INFO L290 TraceCheckUtils]: 41: Hoare triple {1185#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1185#false} is VALID [2022-02-20 14:05:33,716 INFO L290 TraceCheckUtils]: 42: Hoare triple {1185#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1185#false} is VALID [2022-02-20 14:05:33,716 INFO L290 TraceCheckUtils]: 43: Hoare triple {1185#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1185#false} is VALID [2022-02-20 14:05:33,716 INFO L290 TraceCheckUtils]: 44: Hoare triple {1185#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1185#false} is VALID [2022-02-20 14:05:33,716 INFO L290 TraceCheckUtils]: 45: Hoare triple {1185#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1185#false} is VALID [2022-02-20 14:05:33,716 INFO L290 TraceCheckUtils]: 46: Hoare triple {1185#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1185#false} is VALID [2022-02-20 14:05:33,717 INFO L290 TraceCheckUtils]: 47: Hoare triple {1185#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1185#false} is VALID [2022-02-20 14:05:33,717 INFO L290 TraceCheckUtils]: 48: Hoare triple {1185#false} assume !(main_~i~0#1 < 100000); {1185#false} is VALID [2022-02-20 14:05:33,717 INFO L290 TraceCheckUtils]: 49: Hoare triple {1185#false} main_~i~0#1 := 0; {1185#false} is VALID [2022-02-20 14:05:33,717 INFO L290 TraceCheckUtils]: 50: Hoare triple {1185#false} assume !!(main_~i~0#1 < 100000);call write~int(46, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1185#false} is VALID [2022-02-20 14:05:33,717 INFO L290 TraceCheckUtils]: 51: Hoare triple {1185#false} assume !!(main_~i~0#1 < 100000);call write~int(46, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1185#false} is VALID [2022-02-20 14:05:33,717 INFO L290 TraceCheckUtils]: 52: Hoare triple {1185#false} assume !!(main_~i~0#1 < 100000);call write~int(46, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1185#false} is VALID [2022-02-20 14:05:33,717 INFO L290 TraceCheckUtils]: 53: Hoare triple {1185#false} assume !!(main_~i~0#1 < 100000);call write~int(46, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1185#false} is VALID [2022-02-20 14:05:33,718 INFO L290 TraceCheckUtils]: 54: Hoare triple {1185#false} assume !!(main_~i~0#1 < 100000);call write~int(46, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1185#false} is VALID [2022-02-20 14:05:33,718 INFO L290 TraceCheckUtils]: 55: Hoare triple {1185#false} assume !!(main_~i~0#1 < 100000);call write~int(46, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1185#false} is VALID [2022-02-20 14:05:33,718 INFO L290 TraceCheckUtils]: 56: Hoare triple {1185#false} assume !!(main_~i~0#1 < 100000);call write~int(46, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1185#false} is VALID [2022-02-20 14:05:33,718 INFO L290 TraceCheckUtils]: 57: Hoare triple {1185#false} assume !!(main_~i~0#1 < 100000);call write~int(46, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1185#false} is VALID [2022-02-20 14:05:33,718 INFO L290 TraceCheckUtils]: 58: Hoare triple {1185#false} assume !!(main_~i~0#1 < 100000);call write~int(46, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1185#false} is VALID [2022-02-20 14:05:33,718 INFO L290 TraceCheckUtils]: 59: Hoare triple {1185#false} assume !!(main_~i~0#1 < 100000);call write~int(46, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1185#false} is VALID [2022-02-20 14:05:33,719 INFO L290 TraceCheckUtils]: 60: Hoare triple {1185#false} assume !(main_~i~0#1 < 100000); {1185#false} is VALID [2022-02-20 14:05:33,719 INFO L290 TraceCheckUtils]: 61: Hoare triple {1185#false} havoc main_~x~0#1;main_~x~0#1 := 0; {1185#false} is VALID [2022-02-20 14:05:33,720 INFO L290 TraceCheckUtils]: 62: Hoare triple {1185#false} assume !!(main_~x~0#1 < 100000);call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~x~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 46 == main_#t~mem2#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {1185#false} is VALID [2022-02-20 14:05:33,720 INFO L290 TraceCheckUtils]: 63: Hoare triple {1185#false} assume 0 == __VERIFIER_assert_~cond#1; {1185#false} is VALID [2022-02-20 14:05:33,720 INFO L290 TraceCheckUtils]: 64: Hoare triple {1185#false} assume !false; {1185#false} is VALID [2022-02-20 14:05:33,722 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2022-02-20 14:05:33,722 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 14:05:34,110 INFO L290 TraceCheckUtils]: 64: Hoare triple {1185#false} assume !false; {1185#false} is VALID [2022-02-20 14:05:34,110 INFO L290 TraceCheckUtils]: 63: Hoare triple {1185#false} assume 0 == __VERIFIER_assert_~cond#1; {1185#false} is VALID [2022-02-20 14:05:34,110 INFO L290 TraceCheckUtils]: 62: Hoare triple {1185#false} assume !!(main_~x~0#1 < 100000);call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~x~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 46 == main_#t~mem2#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {1185#false} is VALID [2022-02-20 14:05:34,110 INFO L290 TraceCheckUtils]: 61: Hoare triple {1185#false} havoc main_~x~0#1;main_~x~0#1 := 0; {1185#false} is VALID [2022-02-20 14:05:34,111 INFO L290 TraceCheckUtils]: 60: Hoare triple {1185#false} assume !(main_~i~0#1 < 100000); {1185#false} is VALID [2022-02-20 14:05:34,111 INFO L290 TraceCheckUtils]: 59: Hoare triple {1185#false} assume !!(main_~i~0#1 < 100000);call write~int(46, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1185#false} is VALID [2022-02-20 14:05:34,111 INFO L290 TraceCheckUtils]: 58: Hoare triple {1185#false} assume !!(main_~i~0#1 < 100000);call write~int(46, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1185#false} is VALID [2022-02-20 14:05:34,111 INFO L290 TraceCheckUtils]: 57: Hoare triple {1185#false} assume !!(main_~i~0#1 < 100000);call write~int(46, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1185#false} is VALID [2022-02-20 14:05:34,111 INFO L290 TraceCheckUtils]: 56: Hoare triple {1185#false} assume !!(main_~i~0#1 < 100000);call write~int(46, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1185#false} is VALID [2022-02-20 14:05:34,111 INFO L290 TraceCheckUtils]: 55: Hoare triple {1185#false} assume !!(main_~i~0#1 < 100000);call write~int(46, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1185#false} is VALID [2022-02-20 14:05:34,111 INFO L290 TraceCheckUtils]: 54: Hoare triple {1185#false} assume !!(main_~i~0#1 < 100000);call write~int(46, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1185#false} is VALID [2022-02-20 14:05:34,111 INFO L290 TraceCheckUtils]: 53: Hoare triple {1185#false} assume !!(main_~i~0#1 < 100000);call write~int(46, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1185#false} is VALID [2022-02-20 14:05:34,111 INFO L290 TraceCheckUtils]: 52: Hoare triple {1185#false} assume !!(main_~i~0#1 < 100000);call write~int(46, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1185#false} is VALID [2022-02-20 14:05:34,111 INFO L290 TraceCheckUtils]: 51: Hoare triple {1185#false} assume !!(main_~i~0#1 < 100000);call write~int(46, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1185#false} is VALID [2022-02-20 14:05:34,111 INFO L290 TraceCheckUtils]: 50: Hoare triple {1185#false} assume !!(main_~i~0#1 < 100000);call write~int(46, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1185#false} is VALID [2022-02-20 14:05:34,111 INFO L290 TraceCheckUtils]: 49: Hoare triple {1185#false} main_~i~0#1 := 0; {1185#false} is VALID [2022-02-20 14:05:34,111 INFO L290 TraceCheckUtils]: 48: Hoare triple {1185#false} assume !(main_~i~0#1 < 100000); {1185#false} is VALID [2022-02-20 14:05:34,111 INFO L290 TraceCheckUtils]: 47: Hoare triple {1185#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1185#false} is VALID [2022-02-20 14:05:34,112 INFO L290 TraceCheckUtils]: 46: Hoare triple {1185#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1185#false} is VALID [2022-02-20 14:05:34,112 INFO L290 TraceCheckUtils]: 45: Hoare triple {1185#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1185#false} is VALID [2022-02-20 14:05:34,112 INFO L290 TraceCheckUtils]: 44: Hoare triple {1185#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1185#false} is VALID [2022-02-20 14:05:34,112 INFO L290 TraceCheckUtils]: 43: Hoare triple {1185#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1185#false} is VALID [2022-02-20 14:05:34,112 INFO L290 TraceCheckUtils]: 42: Hoare triple {1185#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1185#false} is VALID [2022-02-20 14:05:34,112 INFO L290 TraceCheckUtils]: 41: Hoare triple {1185#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1185#false} is VALID [2022-02-20 14:05:34,112 INFO L290 TraceCheckUtils]: 40: Hoare triple {1185#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1185#false} is VALID [2022-02-20 14:05:34,112 INFO L290 TraceCheckUtils]: 39: Hoare triple {1185#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1185#false} is VALID [2022-02-20 14:05:34,113 INFO L290 TraceCheckUtils]: 38: Hoare triple {1185#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1185#false} is VALID [2022-02-20 14:05:34,113 INFO L290 TraceCheckUtils]: 37: Hoare triple {1185#false} main_~i~0#1 := 0; {1185#false} is VALID [2022-02-20 14:05:34,113 INFO L290 TraceCheckUtils]: 36: Hoare triple {1185#false} assume !(main_~i~0#1 < 100000); {1185#false} is VALID [2022-02-20 14:05:34,113 INFO L290 TraceCheckUtils]: 35: Hoare triple {1185#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1185#false} is VALID [2022-02-20 14:05:34,113 INFO L290 TraceCheckUtils]: 34: Hoare triple {1185#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1185#false} is VALID [2022-02-20 14:05:34,113 INFO L290 TraceCheckUtils]: 33: Hoare triple {1185#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1185#false} is VALID [2022-02-20 14:05:34,113 INFO L290 TraceCheckUtils]: 32: Hoare triple {1185#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1185#false} is VALID [2022-02-20 14:05:34,113 INFO L290 TraceCheckUtils]: 31: Hoare triple {1185#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1185#false} is VALID [2022-02-20 14:05:34,114 INFO L290 TraceCheckUtils]: 30: Hoare triple {1185#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1185#false} is VALID [2022-02-20 14:05:34,114 INFO L290 TraceCheckUtils]: 29: Hoare triple {1185#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1185#false} is VALID [2022-02-20 14:05:34,114 INFO L290 TraceCheckUtils]: 28: Hoare triple {1185#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1185#false} is VALID [2022-02-20 14:05:34,114 INFO L290 TraceCheckUtils]: 27: Hoare triple {1185#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1185#false} is VALID [2022-02-20 14:05:34,114 INFO L290 TraceCheckUtils]: 26: Hoare triple {1185#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1185#false} is VALID [2022-02-20 14:05:34,114 INFO L290 TraceCheckUtils]: 25: Hoare triple {1185#false} main_~i~0#1 := 0; {1185#false} is VALID [2022-02-20 14:05:34,115 INFO L290 TraceCheckUtils]: 24: Hoare triple {1513#(< |ULTIMATE.start_main_~i~0#1| 100000)} assume !(main_~i~0#1 < 100000); {1185#false} is VALID [2022-02-20 14:05:34,115 INFO L290 TraceCheckUtils]: 23: Hoare triple {1517#(< |ULTIMATE.start_main_~i~0#1| 99999)} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1513#(< |ULTIMATE.start_main_~i~0#1| 100000)} is VALID [2022-02-20 14:05:34,116 INFO L290 TraceCheckUtils]: 22: Hoare triple {1521#(< |ULTIMATE.start_main_~i~0#1| 99998)} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1517#(< |ULTIMATE.start_main_~i~0#1| 99999)} is VALID [2022-02-20 14:05:34,116 INFO L290 TraceCheckUtils]: 21: Hoare triple {1525#(< |ULTIMATE.start_main_~i~0#1| 99997)} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1521#(< |ULTIMATE.start_main_~i~0#1| 99998)} is VALID [2022-02-20 14:05:34,117 INFO L290 TraceCheckUtils]: 20: Hoare triple {1529#(< |ULTIMATE.start_main_~i~0#1| 99996)} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1525#(< |ULTIMATE.start_main_~i~0#1| 99997)} is VALID [2022-02-20 14:05:34,117 INFO L290 TraceCheckUtils]: 19: Hoare triple {1533#(< |ULTIMATE.start_main_~i~0#1| 99995)} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1529#(< |ULTIMATE.start_main_~i~0#1| 99996)} is VALID [2022-02-20 14:05:34,118 INFO L290 TraceCheckUtils]: 18: Hoare triple {1537#(< |ULTIMATE.start_main_~i~0#1| 99994)} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1533#(< |ULTIMATE.start_main_~i~0#1| 99995)} is VALID [2022-02-20 14:05:34,118 INFO L290 TraceCheckUtils]: 17: Hoare triple {1541#(< |ULTIMATE.start_main_~i~0#1| 99993)} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1537#(< |ULTIMATE.start_main_~i~0#1| 99994)} is VALID [2022-02-20 14:05:34,119 INFO L290 TraceCheckUtils]: 16: Hoare triple {1545#(< |ULTIMATE.start_main_~i~0#1| 99992)} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1541#(< |ULTIMATE.start_main_~i~0#1| 99993)} is VALID [2022-02-20 14:05:34,119 INFO L290 TraceCheckUtils]: 15: Hoare triple {1549#(< |ULTIMATE.start_main_~i~0#1| 99991)} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1545#(< |ULTIMATE.start_main_~i~0#1| 99992)} is VALID [2022-02-20 14:05:34,120 INFO L290 TraceCheckUtils]: 14: Hoare triple {1553#(< |ULTIMATE.start_main_~i~0#1| 99990)} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1549#(< |ULTIMATE.start_main_~i~0#1| 99991)} is VALID [2022-02-20 14:05:34,120 INFO L290 TraceCheckUtils]: 13: Hoare triple {1184#true} main_~i~0#1 := 0; {1553#(< |ULTIMATE.start_main_~i~0#1| 99990)} is VALID [2022-02-20 14:05:34,120 INFO L290 TraceCheckUtils]: 12: Hoare triple {1184#true} assume !(main_~i~0#1 < 100000); {1184#true} is VALID [2022-02-20 14:05:34,120 INFO L290 TraceCheckUtils]: 11: Hoare triple {1184#true} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1184#true} is VALID [2022-02-20 14:05:34,120 INFO L290 TraceCheckUtils]: 10: Hoare triple {1184#true} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1184#true} is VALID [2022-02-20 14:05:34,121 INFO L290 TraceCheckUtils]: 9: Hoare triple {1184#true} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1184#true} is VALID [2022-02-20 14:05:34,121 INFO L290 TraceCheckUtils]: 8: Hoare triple {1184#true} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1184#true} is VALID [2022-02-20 14:05:34,121 INFO L290 TraceCheckUtils]: 7: Hoare triple {1184#true} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1184#true} is VALID [2022-02-20 14:05:34,121 INFO L290 TraceCheckUtils]: 6: Hoare triple {1184#true} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1184#true} is VALID [2022-02-20 14:05:34,121 INFO L290 TraceCheckUtils]: 5: Hoare triple {1184#true} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1184#true} is VALID [2022-02-20 14:05:34,121 INFO L290 TraceCheckUtils]: 4: Hoare triple {1184#true} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1184#true} is VALID [2022-02-20 14:05:34,121 INFO L290 TraceCheckUtils]: 3: Hoare triple {1184#true} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1184#true} is VALID [2022-02-20 14:05:34,121 INFO L290 TraceCheckUtils]: 2: Hoare triple {1184#true} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1184#true} is VALID [2022-02-20 14:05:34,122 INFO L290 TraceCheckUtils]: 1: Hoare triple {1184#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem2#1, main_#t~post1#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~i~0#1, main_~x~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);main_~i~0#1 := 0; {1184#true} is VALID [2022-02-20 14:05:34,122 INFO L290 TraceCheckUtils]: 0: Hoare triple {1184#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); {1184#true} is VALID [2022-02-20 14:05:34,122 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2022-02-20 14:05:34,122 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [33552599] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 14:05:34,122 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 14:05:34,122 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2022-02-20 14:05:34,123 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815395201] [2022-02-20 14:05:34,123 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 14:05:34,123 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.24) internal successors, (56), 25 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2022-02-20 14:05:34,124 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:05:34,124 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 25 states, 25 states have (on average 2.24) internal successors, (56), 25 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:05:34,161 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:05:34,161 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-02-20 14:05:34,162 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:05:34,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-02-20 14:05:34,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2022-02-20 14:05:34,163 INFO L87 Difference]: Start difference. First operand 68 states and 73 transitions. Second operand has 25 states, 25 states have (on average 2.24) internal successors, (56), 25 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:05:34,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:05:34,882 INFO L93 Difference]: Finished difference Result 183 states and 252 transitions. [2022-02-20 14:05:34,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-02-20 14:05:34,882 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.24) internal successors, (56), 25 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2022-02-20 14:05:34,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:05:34,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 2.24) internal successors, (56), 25 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:05:34,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 212 transitions. [2022-02-20 14:05:34,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 2.24) internal successors, (56), 25 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:05:34,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 212 transitions. [2022-02-20 14:05:34,887 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states and 212 transitions. [2022-02-20 14:05:35,039 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 212 edges. 212 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:05:35,042 INFO L225 Difference]: With dead ends: 183 [2022-02-20 14:05:35,042 INFO L226 Difference]: Without dead ends: 128 [2022-02-20 14:05:35,042 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2022-02-20 14:05:35,043 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 0 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 274 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 424 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 274 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 14:05:35,043 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 66 Invalid, 424 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [274 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-20 14:05:35,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2022-02-20 14:05:35,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2022-02-20 14:05:35,106 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:05:35,106 INFO L82 GeneralOperation]: Start isEquivalent. First operand 128 states. Second operand has 128 states, 127 states have (on average 1.047244094488189) internal successors, (133), 127 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:05:35,107 INFO L74 IsIncluded]: Start isIncluded. First operand 128 states. Second operand has 128 states, 127 states have (on average 1.047244094488189) internal successors, (133), 127 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:05:35,107 INFO L87 Difference]: Start difference. First operand 128 states. Second operand has 128 states, 127 states have (on average 1.047244094488189) internal successors, (133), 127 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:05:35,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:05:35,110 INFO L93 Difference]: Finished difference Result 128 states and 133 transitions. [2022-02-20 14:05:35,110 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 133 transitions. [2022-02-20 14:05:35,110 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:05:35,110 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:05:35,111 INFO L74 IsIncluded]: Start isIncluded. First operand has 128 states, 127 states have (on average 1.047244094488189) internal successors, (133), 127 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 128 states. [2022-02-20 14:05:35,111 INFO L87 Difference]: Start difference. First operand has 128 states, 127 states have (on average 1.047244094488189) internal successors, (133), 127 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 128 states. [2022-02-20 14:05:35,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:05:35,113 INFO L93 Difference]: Finished difference Result 128 states and 133 transitions. [2022-02-20 14:05:35,114 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 133 transitions. [2022-02-20 14:05:35,114 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:05:35,114 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:05:35,114 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:05:35,114 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:05:35,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 127 states have (on average 1.047244094488189) internal successors, (133), 127 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:05:35,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 133 transitions. [2022-02-20 14:05:35,131 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 133 transitions. Word has length 65 [2022-02-20 14:05:35,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:05:35,131 INFO L470 AbstractCegarLoop]: Abstraction has 128 states and 133 transitions. [2022-02-20 14:05:35,131 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.24) internal successors, (56), 25 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:05:35,132 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 133 transitions. [2022-02-20 14:05:35,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2022-02-20 14:05:35,134 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:05:35,134 INFO L514 BasicCegarLoop]: trace histogram [22, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:05:35,154 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-02-20 14:05:35,347 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:05:35,348 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:05:35,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:05:35,348 INFO L85 PathProgramCache]: Analyzing trace with hash 1233939596, now seen corresponding path program 4 times [2022-02-20 14:05:35,348 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:05:35,348 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318759374] [2022-02-20 14:05:35,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:05:35,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:05:35,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:05:35,846 INFO L290 TraceCheckUtils]: 0: Hoare triple {2439#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); {2439#true} is VALID [2022-02-20 14:05:35,847 INFO L290 TraceCheckUtils]: 1: Hoare triple {2439#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem2#1, main_#t~post1#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~i~0#1, main_~x~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);main_~i~0#1 := 0; {2441#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:05:35,850 INFO L290 TraceCheckUtils]: 2: Hoare triple {2441#(= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2442#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 14:05:35,852 INFO L290 TraceCheckUtils]: 3: Hoare triple {2442#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2443#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-20 14:05:35,853 INFO L290 TraceCheckUtils]: 4: Hoare triple {2443#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2444#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-20 14:05:35,853 INFO L290 TraceCheckUtils]: 5: Hoare triple {2444#(<= |ULTIMATE.start_main_~i~0#1| 3)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2445#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-20 14:05:35,854 INFO L290 TraceCheckUtils]: 6: Hoare triple {2445#(<= |ULTIMATE.start_main_~i~0#1| 4)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2446#(<= |ULTIMATE.start_main_~i~0#1| 5)} is VALID [2022-02-20 14:05:35,854 INFO L290 TraceCheckUtils]: 7: Hoare triple {2446#(<= |ULTIMATE.start_main_~i~0#1| 5)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2447#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-20 14:05:35,855 INFO L290 TraceCheckUtils]: 8: Hoare triple {2447#(<= |ULTIMATE.start_main_~i~0#1| 6)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2448#(<= |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-20 14:05:35,855 INFO L290 TraceCheckUtils]: 9: Hoare triple {2448#(<= |ULTIMATE.start_main_~i~0#1| 7)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2449#(<= |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-20 14:05:35,856 INFO L290 TraceCheckUtils]: 10: Hoare triple {2449#(<= |ULTIMATE.start_main_~i~0#1| 8)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2450#(<= |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-20 14:05:35,857 INFO L290 TraceCheckUtils]: 11: Hoare triple {2450#(<= |ULTIMATE.start_main_~i~0#1| 9)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2451#(<= |ULTIMATE.start_main_~i~0#1| 10)} is VALID [2022-02-20 14:05:35,857 INFO L290 TraceCheckUtils]: 12: Hoare triple {2451#(<= |ULTIMATE.start_main_~i~0#1| 10)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2452#(<= |ULTIMATE.start_main_~i~0#1| 11)} is VALID [2022-02-20 14:05:35,858 INFO L290 TraceCheckUtils]: 13: Hoare triple {2452#(<= |ULTIMATE.start_main_~i~0#1| 11)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2453#(<= |ULTIMATE.start_main_~i~0#1| 12)} is VALID [2022-02-20 14:05:35,858 INFO L290 TraceCheckUtils]: 14: Hoare triple {2453#(<= |ULTIMATE.start_main_~i~0#1| 12)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2454#(<= |ULTIMATE.start_main_~i~0#1| 13)} is VALID [2022-02-20 14:05:35,859 INFO L290 TraceCheckUtils]: 15: Hoare triple {2454#(<= |ULTIMATE.start_main_~i~0#1| 13)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2455#(<= |ULTIMATE.start_main_~i~0#1| 14)} is VALID [2022-02-20 14:05:35,859 INFO L290 TraceCheckUtils]: 16: Hoare triple {2455#(<= |ULTIMATE.start_main_~i~0#1| 14)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2456#(<= |ULTIMATE.start_main_~i~0#1| 15)} is VALID [2022-02-20 14:05:35,860 INFO L290 TraceCheckUtils]: 17: Hoare triple {2456#(<= |ULTIMATE.start_main_~i~0#1| 15)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2457#(<= |ULTIMATE.start_main_~i~0#1| 16)} is VALID [2022-02-20 14:05:35,869 INFO L290 TraceCheckUtils]: 18: Hoare triple {2457#(<= |ULTIMATE.start_main_~i~0#1| 16)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2458#(<= |ULTIMATE.start_main_~i~0#1| 17)} is VALID [2022-02-20 14:05:35,870 INFO L290 TraceCheckUtils]: 19: Hoare triple {2458#(<= |ULTIMATE.start_main_~i~0#1| 17)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2459#(<= |ULTIMATE.start_main_~i~0#1| 18)} is VALID [2022-02-20 14:05:35,870 INFO L290 TraceCheckUtils]: 20: Hoare triple {2459#(<= |ULTIMATE.start_main_~i~0#1| 18)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2460#(<= |ULTIMATE.start_main_~i~0#1| 19)} is VALID [2022-02-20 14:05:35,871 INFO L290 TraceCheckUtils]: 21: Hoare triple {2460#(<= |ULTIMATE.start_main_~i~0#1| 19)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2461#(<= |ULTIMATE.start_main_~i~0#1| 20)} is VALID [2022-02-20 14:05:35,872 INFO L290 TraceCheckUtils]: 22: Hoare triple {2461#(<= |ULTIMATE.start_main_~i~0#1| 20)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2462#(<= |ULTIMATE.start_main_~i~0#1| 21)} is VALID [2022-02-20 14:05:35,872 INFO L290 TraceCheckUtils]: 23: Hoare triple {2462#(<= |ULTIMATE.start_main_~i~0#1| 21)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2463#(<= |ULTIMATE.start_main_~i~0#1| 22)} is VALID [2022-02-20 14:05:35,873 INFO L290 TraceCheckUtils]: 24: Hoare triple {2463#(<= |ULTIMATE.start_main_~i~0#1| 22)} assume !(main_~i~0#1 < 100000); {2440#false} is VALID [2022-02-20 14:05:35,873 INFO L290 TraceCheckUtils]: 25: Hoare triple {2440#false} main_~i~0#1 := 0; {2440#false} is VALID [2022-02-20 14:05:35,873 INFO L290 TraceCheckUtils]: 26: Hoare triple {2440#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2440#false} is VALID [2022-02-20 14:05:35,873 INFO L290 TraceCheckUtils]: 27: Hoare triple {2440#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2440#false} is VALID [2022-02-20 14:05:35,873 INFO L290 TraceCheckUtils]: 28: Hoare triple {2440#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2440#false} is VALID [2022-02-20 14:05:35,873 INFO L290 TraceCheckUtils]: 29: Hoare triple {2440#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2440#false} is VALID [2022-02-20 14:05:35,874 INFO L290 TraceCheckUtils]: 30: Hoare triple {2440#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2440#false} is VALID [2022-02-20 14:05:35,874 INFO L290 TraceCheckUtils]: 31: Hoare triple {2440#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2440#false} is VALID [2022-02-20 14:05:35,874 INFO L290 TraceCheckUtils]: 32: Hoare triple {2440#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2440#false} is VALID [2022-02-20 14:05:35,874 INFO L290 TraceCheckUtils]: 33: Hoare triple {2440#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2440#false} is VALID [2022-02-20 14:05:35,874 INFO L290 TraceCheckUtils]: 34: Hoare triple {2440#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2440#false} is VALID [2022-02-20 14:05:35,874 INFO L290 TraceCheckUtils]: 35: Hoare triple {2440#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2440#false} is VALID [2022-02-20 14:05:35,874 INFO L290 TraceCheckUtils]: 36: Hoare triple {2440#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2440#false} is VALID [2022-02-20 14:05:35,874 INFO L290 TraceCheckUtils]: 37: Hoare triple {2440#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2440#false} is VALID [2022-02-20 14:05:35,875 INFO L290 TraceCheckUtils]: 38: Hoare triple {2440#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2440#false} is VALID [2022-02-20 14:05:35,875 INFO L290 TraceCheckUtils]: 39: Hoare triple {2440#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2440#false} is VALID [2022-02-20 14:05:35,875 INFO L290 TraceCheckUtils]: 40: Hoare triple {2440#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2440#false} is VALID [2022-02-20 14:05:35,875 INFO L290 TraceCheckUtils]: 41: Hoare triple {2440#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2440#false} is VALID [2022-02-20 14:05:35,875 INFO L290 TraceCheckUtils]: 42: Hoare triple {2440#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2440#false} is VALID [2022-02-20 14:05:35,875 INFO L290 TraceCheckUtils]: 43: Hoare triple {2440#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2440#false} is VALID [2022-02-20 14:05:35,875 INFO L290 TraceCheckUtils]: 44: Hoare triple {2440#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2440#false} is VALID [2022-02-20 14:05:35,875 INFO L290 TraceCheckUtils]: 45: Hoare triple {2440#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2440#false} is VALID [2022-02-20 14:05:35,876 INFO L290 TraceCheckUtils]: 46: Hoare triple {2440#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2440#false} is VALID [2022-02-20 14:05:35,876 INFO L290 TraceCheckUtils]: 47: Hoare triple {2440#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2440#false} is VALID [2022-02-20 14:05:35,876 INFO L290 TraceCheckUtils]: 48: Hoare triple {2440#false} assume !(main_~i~0#1 < 100000); {2440#false} is VALID [2022-02-20 14:05:35,876 INFO L290 TraceCheckUtils]: 49: Hoare triple {2440#false} main_~i~0#1 := 0; {2440#false} is VALID [2022-02-20 14:05:35,876 INFO L290 TraceCheckUtils]: 50: Hoare triple {2440#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2440#false} is VALID [2022-02-20 14:05:35,876 INFO L290 TraceCheckUtils]: 51: Hoare triple {2440#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2440#false} is VALID [2022-02-20 14:05:35,876 INFO L290 TraceCheckUtils]: 52: Hoare triple {2440#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2440#false} is VALID [2022-02-20 14:05:35,876 INFO L290 TraceCheckUtils]: 53: Hoare triple {2440#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2440#false} is VALID [2022-02-20 14:05:35,877 INFO L290 TraceCheckUtils]: 54: Hoare triple {2440#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2440#false} is VALID [2022-02-20 14:05:35,877 INFO L290 TraceCheckUtils]: 55: Hoare triple {2440#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2440#false} is VALID [2022-02-20 14:05:35,877 INFO L290 TraceCheckUtils]: 56: Hoare triple {2440#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2440#false} is VALID [2022-02-20 14:05:35,877 INFO L290 TraceCheckUtils]: 57: Hoare triple {2440#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2440#false} is VALID [2022-02-20 14:05:35,877 INFO L290 TraceCheckUtils]: 58: Hoare triple {2440#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2440#false} is VALID [2022-02-20 14:05:35,877 INFO L290 TraceCheckUtils]: 59: Hoare triple {2440#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2440#false} is VALID [2022-02-20 14:05:35,877 INFO L290 TraceCheckUtils]: 60: Hoare triple {2440#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2440#false} is VALID [2022-02-20 14:05:35,877 INFO L290 TraceCheckUtils]: 61: Hoare triple {2440#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2440#false} is VALID [2022-02-20 14:05:35,877 INFO L290 TraceCheckUtils]: 62: Hoare triple {2440#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2440#false} is VALID [2022-02-20 14:05:35,878 INFO L290 TraceCheckUtils]: 63: Hoare triple {2440#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2440#false} is VALID [2022-02-20 14:05:35,878 INFO L290 TraceCheckUtils]: 64: Hoare triple {2440#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2440#false} is VALID [2022-02-20 14:05:35,878 INFO L290 TraceCheckUtils]: 65: Hoare triple {2440#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2440#false} is VALID [2022-02-20 14:05:35,878 INFO L290 TraceCheckUtils]: 66: Hoare triple {2440#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2440#false} is VALID [2022-02-20 14:05:35,878 INFO L290 TraceCheckUtils]: 67: Hoare triple {2440#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2440#false} is VALID [2022-02-20 14:05:35,878 INFO L290 TraceCheckUtils]: 68: Hoare triple {2440#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2440#false} is VALID [2022-02-20 14:05:35,878 INFO L290 TraceCheckUtils]: 69: Hoare triple {2440#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2440#false} is VALID [2022-02-20 14:05:35,878 INFO L290 TraceCheckUtils]: 70: Hoare triple {2440#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2440#false} is VALID [2022-02-20 14:05:35,879 INFO L290 TraceCheckUtils]: 71: Hoare triple {2440#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2440#false} is VALID [2022-02-20 14:05:35,879 INFO L290 TraceCheckUtils]: 72: Hoare triple {2440#false} assume !(main_~i~0#1 < 100000); {2440#false} is VALID [2022-02-20 14:05:35,879 INFO L290 TraceCheckUtils]: 73: Hoare triple {2440#false} main_~i~0#1 := 0; {2440#false} is VALID [2022-02-20 14:05:35,879 INFO L290 TraceCheckUtils]: 74: Hoare triple {2440#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2440#false} is VALID [2022-02-20 14:05:35,879 INFO L290 TraceCheckUtils]: 75: Hoare triple {2440#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2440#false} is VALID [2022-02-20 14:05:35,879 INFO L290 TraceCheckUtils]: 76: Hoare triple {2440#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2440#false} is VALID [2022-02-20 14:05:35,879 INFO L290 TraceCheckUtils]: 77: Hoare triple {2440#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2440#false} is VALID [2022-02-20 14:05:35,879 INFO L290 TraceCheckUtils]: 78: Hoare triple {2440#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2440#false} is VALID [2022-02-20 14:05:35,879 INFO L290 TraceCheckUtils]: 79: Hoare triple {2440#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2440#false} is VALID [2022-02-20 14:05:35,879 INFO L290 TraceCheckUtils]: 80: Hoare triple {2440#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2440#false} is VALID [2022-02-20 14:05:35,879 INFO L290 TraceCheckUtils]: 81: Hoare triple {2440#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2440#false} is VALID [2022-02-20 14:05:35,879 INFO L290 TraceCheckUtils]: 82: Hoare triple {2440#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2440#false} is VALID [2022-02-20 14:05:35,879 INFO L290 TraceCheckUtils]: 83: Hoare triple {2440#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2440#false} is VALID [2022-02-20 14:05:35,880 INFO L290 TraceCheckUtils]: 84: Hoare triple {2440#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2440#false} is VALID [2022-02-20 14:05:35,880 INFO L290 TraceCheckUtils]: 85: Hoare triple {2440#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2440#false} is VALID [2022-02-20 14:05:35,880 INFO L290 TraceCheckUtils]: 86: Hoare triple {2440#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2440#false} is VALID [2022-02-20 14:05:35,880 INFO L290 TraceCheckUtils]: 87: Hoare triple {2440#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2440#false} is VALID [2022-02-20 14:05:35,880 INFO L290 TraceCheckUtils]: 88: Hoare triple {2440#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2440#false} is VALID [2022-02-20 14:05:35,880 INFO L290 TraceCheckUtils]: 89: Hoare triple {2440#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2440#false} is VALID [2022-02-20 14:05:35,880 INFO L290 TraceCheckUtils]: 90: Hoare triple {2440#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2440#false} is VALID [2022-02-20 14:05:35,880 INFO L290 TraceCheckUtils]: 91: Hoare triple {2440#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2440#false} is VALID [2022-02-20 14:05:35,880 INFO L290 TraceCheckUtils]: 92: Hoare triple {2440#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2440#false} is VALID [2022-02-20 14:05:35,880 INFO L290 TraceCheckUtils]: 93: Hoare triple {2440#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2440#false} is VALID [2022-02-20 14:05:35,880 INFO L290 TraceCheckUtils]: 94: Hoare triple {2440#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2440#false} is VALID [2022-02-20 14:05:35,880 INFO L290 TraceCheckUtils]: 95: Hoare triple {2440#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2440#false} is VALID [2022-02-20 14:05:35,880 INFO L290 TraceCheckUtils]: 96: Hoare triple {2440#false} assume !(main_~i~0#1 < 100000); {2440#false} is VALID [2022-02-20 14:05:35,880 INFO L290 TraceCheckUtils]: 97: Hoare triple {2440#false} main_~i~0#1 := 0; {2440#false} is VALID [2022-02-20 14:05:35,880 INFO L290 TraceCheckUtils]: 98: Hoare triple {2440#false} assume !!(main_~i~0#1 < 100000);call write~int(46, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2440#false} is VALID [2022-02-20 14:05:35,880 INFO L290 TraceCheckUtils]: 99: Hoare triple {2440#false} assume !!(main_~i~0#1 < 100000);call write~int(46, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2440#false} is VALID [2022-02-20 14:05:35,881 INFO L290 TraceCheckUtils]: 100: Hoare triple {2440#false} assume !!(main_~i~0#1 < 100000);call write~int(46, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2440#false} is VALID [2022-02-20 14:05:35,881 INFO L290 TraceCheckUtils]: 101: Hoare triple {2440#false} assume !!(main_~i~0#1 < 100000);call write~int(46, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2440#false} is VALID [2022-02-20 14:05:35,881 INFO L290 TraceCheckUtils]: 102: Hoare triple {2440#false} assume !!(main_~i~0#1 < 100000);call write~int(46, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2440#false} is VALID [2022-02-20 14:05:35,881 INFO L290 TraceCheckUtils]: 103: Hoare triple {2440#false} assume !!(main_~i~0#1 < 100000);call write~int(46, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2440#false} is VALID [2022-02-20 14:05:35,881 INFO L290 TraceCheckUtils]: 104: Hoare triple {2440#false} assume !!(main_~i~0#1 < 100000);call write~int(46, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2440#false} is VALID [2022-02-20 14:05:35,881 INFO L290 TraceCheckUtils]: 105: Hoare triple {2440#false} assume !!(main_~i~0#1 < 100000);call write~int(46, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2440#false} is VALID [2022-02-20 14:05:35,881 INFO L290 TraceCheckUtils]: 106: Hoare triple {2440#false} assume !!(main_~i~0#1 < 100000);call write~int(46, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2440#false} is VALID [2022-02-20 14:05:35,881 INFO L290 TraceCheckUtils]: 107: Hoare triple {2440#false} assume !!(main_~i~0#1 < 100000);call write~int(46, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2440#false} is VALID [2022-02-20 14:05:35,881 INFO L290 TraceCheckUtils]: 108: Hoare triple {2440#false} assume !!(main_~i~0#1 < 100000);call write~int(46, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2440#false} is VALID [2022-02-20 14:05:35,881 INFO L290 TraceCheckUtils]: 109: Hoare triple {2440#false} assume !!(main_~i~0#1 < 100000);call write~int(46, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2440#false} is VALID [2022-02-20 14:05:35,881 INFO L290 TraceCheckUtils]: 110: Hoare triple {2440#false} assume !!(main_~i~0#1 < 100000);call write~int(46, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2440#false} is VALID [2022-02-20 14:05:35,881 INFO L290 TraceCheckUtils]: 111: Hoare triple {2440#false} assume !!(main_~i~0#1 < 100000);call write~int(46, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2440#false} is VALID [2022-02-20 14:05:35,881 INFO L290 TraceCheckUtils]: 112: Hoare triple {2440#false} assume !!(main_~i~0#1 < 100000);call write~int(46, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2440#false} is VALID [2022-02-20 14:05:35,881 INFO L290 TraceCheckUtils]: 113: Hoare triple {2440#false} assume !!(main_~i~0#1 < 100000);call write~int(46, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2440#false} is VALID [2022-02-20 14:05:35,881 INFO L290 TraceCheckUtils]: 114: Hoare triple {2440#false} assume !!(main_~i~0#1 < 100000);call write~int(46, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2440#false} is VALID [2022-02-20 14:05:35,881 INFO L290 TraceCheckUtils]: 115: Hoare triple {2440#false} assume !!(main_~i~0#1 < 100000);call write~int(46, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2440#false} is VALID [2022-02-20 14:05:35,881 INFO L290 TraceCheckUtils]: 116: Hoare triple {2440#false} assume !!(main_~i~0#1 < 100000);call write~int(46, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2440#false} is VALID [2022-02-20 14:05:35,881 INFO L290 TraceCheckUtils]: 117: Hoare triple {2440#false} assume !!(main_~i~0#1 < 100000);call write~int(46, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2440#false} is VALID [2022-02-20 14:05:35,882 INFO L290 TraceCheckUtils]: 118: Hoare triple {2440#false} assume !!(main_~i~0#1 < 100000);call write~int(46, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2440#false} is VALID [2022-02-20 14:05:35,882 INFO L290 TraceCheckUtils]: 119: Hoare triple {2440#false} assume !!(main_~i~0#1 < 100000);call write~int(46, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2440#false} is VALID [2022-02-20 14:05:35,882 INFO L290 TraceCheckUtils]: 120: Hoare triple {2440#false} assume !(main_~i~0#1 < 100000); {2440#false} is VALID [2022-02-20 14:05:35,882 INFO L290 TraceCheckUtils]: 121: Hoare triple {2440#false} havoc main_~x~0#1;main_~x~0#1 := 0; {2440#false} is VALID [2022-02-20 14:05:35,882 INFO L290 TraceCheckUtils]: 122: Hoare triple {2440#false} assume !!(main_~x~0#1 < 100000);call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~x~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 46 == main_#t~mem2#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {2440#false} is VALID [2022-02-20 14:05:35,882 INFO L290 TraceCheckUtils]: 123: Hoare triple {2440#false} assume 0 == __VERIFIER_assert_~cond#1; {2440#false} is VALID [2022-02-20 14:05:35,882 INFO L290 TraceCheckUtils]: 124: Hoare triple {2440#false} assume !false; {2440#false} is VALID [2022-02-20 14:05:35,883 INFO L134 CoverageAnalysis]: Checked inductivity of 1265 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2022-02-20 14:05:35,883 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:05:35,883 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318759374] [2022-02-20 14:05:35,883 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1318759374] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 14:05:35,883 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1548800138] [2022-02-20 14:05:35,883 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-02-20 14:05:35,883 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:05:35,884 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:05:35,884 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:05:35,885 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:05:36,076 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-02-20 14:05:36,077 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 14:05:36,081 INFO L263 TraceCheckSpWp]: Trace formula consists of 830 conjuncts, 24 conjunts are in the unsatisfiable core [2022-02-20 14:05:36,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:05:36,123 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:05:36,577 INFO L290 TraceCheckUtils]: 0: Hoare triple {2439#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); {2439#true} is VALID [2022-02-20 14:05:36,578 INFO L290 TraceCheckUtils]: 1: Hoare triple {2439#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem2#1, main_#t~post1#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~i~0#1, main_~x~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);main_~i~0#1 := 0; {2470#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:05:36,579 INFO L290 TraceCheckUtils]: 2: Hoare triple {2470#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2442#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 14:05:36,579 INFO L290 TraceCheckUtils]: 3: Hoare triple {2442#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2443#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-20 14:05:36,580 INFO L290 TraceCheckUtils]: 4: Hoare triple {2443#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2444#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-20 14:05:36,580 INFO L290 TraceCheckUtils]: 5: Hoare triple {2444#(<= |ULTIMATE.start_main_~i~0#1| 3)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2445#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-20 14:05:36,581 INFO L290 TraceCheckUtils]: 6: Hoare triple {2445#(<= |ULTIMATE.start_main_~i~0#1| 4)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2446#(<= |ULTIMATE.start_main_~i~0#1| 5)} is VALID [2022-02-20 14:05:36,583 INFO L290 TraceCheckUtils]: 7: Hoare triple {2446#(<= |ULTIMATE.start_main_~i~0#1| 5)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2447#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-20 14:05:36,584 INFO L290 TraceCheckUtils]: 8: Hoare triple {2447#(<= |ULTIMATE.start_main_~i~0#1| 6)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2448#(<= |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-20 14:05:36,584 INFO L290 TraceCheckUtils]: 9: Hoare triple {2448#(<= |ULTIMATE.start_main_~i~0#1| 7)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2449#(<= |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-20 14:05:36,585 INFO L290 TraceCheckUtils]: 10: Hoare triple {2449#(<= |ULTIMATE.start_main_~i~0#1| 8)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2450#(<= |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-20 14:05:36,585 INFO L290 TraceCheckUtils]: 11: Hoare triple {2450#(<= |ULTIMATE.start_main_~i~0#1| 9)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2451#(<= |ULTIMATE.start_main_~i~0#1| 10)} is VALID [2022-02-20 14:05:36,586 INFO L290 TraceCheckUtils]: 12: Hoare triple {2451#(<= |ULTIMATE.start_main_~i~0#1| 10)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2452#(<= |ULTIMATE.start_main_~i~0#1| 11)} is VALID [2022-02-20 14:05:36,586 INFO L290 TraceCheckUtils]: 13: Hoare triple {2452#(<= |ULTIMATE.start_main_~i~0#1| 11)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2453#(<= |ULTIMATE.start_main_~i~0#1| 12)} is VALID [2022-02-20 14:05:36,587 INFO L290 TraceCheckUtils]: 14: Hoare triple {2453#(<= |ULTIMATE.start_main_~i~0#1| 12)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2454#(<= |ULTIMATE.start_main_~i~0#1| 13)} is VALID [2022-02-20 14:05:36,587 INFO L290 TraceCheckUtils]: 15: Hoare triple {2454#(<= |ULTIMATE.start_main_~i~0#1| 13)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2455#(<= |ULTIMATE.start_main_~i~0#1| 14)} is VALID [2022-02-20 14:05:36,588 INFO L290 TraceCheckUtils]: 16: Hoare triple {2455#(<= |ULTIMATE.start_main_~i~0#1| 14)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2456#(<= |ULTIMATE.start_main_~i~0#1| 15)} is VALID [2022-02-20 14:05:36,588 INFO L290 TraceCheckUtils]: 17: Hoare triple {2456#(<= |ULTIMATE.start_main_~i~0#1| 15)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2457#(<= |ULTIMATE.start_main_~i~0#1| 16)} is VALID [2022-02-20 14:05:36,589 INFO L290 TraceCheckUtils]: 18: Hoare triple {2457#(<= |ULTIMATE.start_main_~i~0#1| 16)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2458#(<= |ULTIMATE.start_main_~i~0#1| 17)} is VALID [2022-02-20 14:05:36,589 INFO L290 TraceCheckUtils]: 19: Hoare triple {2458#(<= |ULTIMATE.start_main_~i~0#1| 17)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2459#(<= |ULTIMATE.start_main_~i~0#1| 18)} is VALID [2022-02-20 14:05:36,590 INFO L290 TraceCheckUtils]: 20: Hoare triple {2459#(<= |ULTIMATE.start_main_~i~0#1| 18)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2460#(<= |ULTIMATE.start_main_~i~0#1| 19)} is VALID [2022-02-20 14:05:36,590 INFO L290 TraceCheckUtils]: 21: Hoare triple {2460#(<= |ULTIMATE.start_main_~i~0#1| 19)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2461#(<= |ULTIMATE.start_main_~i~0#1| 20)} is VALID [2022-02-20 14:05:36,591 INFO L290 TraceCheckUtils]: 22: Hoare triple {2461#(<= |ULTIMATE.start_main_~i~0#1| 20)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2462#(<= |ULTIMATE.start_main_~i~0#1| 21)} is VALID [2022-02-20 14:05:36,591 INFO L290 TraceCheckUtils]: 23: Hoare triple {2462#(<= |ULTIMATE.start_main_~i~0#1| 21)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2463#(<= |ULTIMATE.start_main_~i~0#1| 22)} is VALID [2022-02-20 14:05:36,592 INFO L290 TraceCheckUtils]: 24: Hoare triple {2463#(<= |ULTIMATE.start_main_~i~0#1| 22)} assume !(main_~i~0#1 < 100000); {2440#false} is VALID [2022-02-20 14:05:36,592 INFO L290 TraceCheckUtils]: 25: Hoare triple {2440#false} main_~i~0#1 := 0; {2440#false} is VALID [2022-02-20 14:05:36,592 INFO L290 TraceCheckUtils]: 26: Hoare triple {2440#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2440#false} is VALID [2022-02-20 14:05:36,592 INFO L290 TraceCheckUtils]: 27: Hoare triple {2440#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2440#false} is VALID [2022-02-20 14:05:36,592 INFO L290 TraceCheckUtils]: 28: Hoare triple {2440#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2440#false} is VALID [2022-02-20 14:05:36,592 INFO L290 TraceCheckUtils]: 29: Hoare triple {2440#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2440#false} is VALID [2022-02-20 14:05:36,592 INFO L290 TraceCheckUtils]: 30: Hoare triple {2440#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2440#false} is VALID [2022-02-20 14:05:36,592 INFO L290 TraceCheckUtils]: 31: Hoare triple {2440#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2440#false} is VALID [2022-02-20 14:05:36,592 INFO L290 TraceCheckUtils]: 32: Hoare triple {2440#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2440#false} is VALID [2022-02-20 14:05:36,592 INFO L290 TraceCheckUtils]: 33: Hoare triple {2440#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2440#false} is VALID [2022-02-20 14:05:36,592 INFO L290 TraceCheckUtils]: 34: Hoare triple {2440#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2440#false} is VALID [2022-02-20 14:05:36,592 INFO L290 TraceCheckUtils]: 35: Hoare triple {2440#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2440#false} is VALID [2022-02-20 14:05:36,592 INFO L290 TraceCheckUtils]: 36: Hoare triple {2440#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2440#false} is VALID [2022-02-20 14:05:36,592 INFO L290 TraceCheckUtils]: 37: Hoare triple {2440#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2440#false} is VALID [2022-02-20 14:05:36,592 INFO L290 TraceCheckUtils]: 38: Hoare triple {2440#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2440#false} is VALID [2022-02-20 14:05:36,592 INFO L290 TraceCheckUtils]: 39: Hoare triple {2440#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2440#false} is VALID [2022-02-20 14:05:36,592 INFO L290 TraceCheckUtils]: 40: Hoare triple {2440#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2440#false} is VALID [2022-02-20 14:05:36,593 INFO L290 TraceCheckUtils]: 41: Hoare triple {2440#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2440#false} is VALID [2022-02-20 14:05:36,593 INFO L290 TraceCheckUtils]: 42: Hoare triple {2440#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2440#false} is VALID [2022-02-20 14:05:36,593 INFO L290 TraceCheckUtils]: 43: Hoare triple {2440#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2440#false} is VALID [2022-02-20 14:05:36,593 INFO L290 TraceCheckUtils]: 44: Hoare triple {2440#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2440#false} is VALID [2022-02-20 14:05:36,593 INFO L290 TraceCheckUtils]: 45: Hoare triple {2440#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2440#false} is VALID [2022-02-20 14:05:36,593 INFO L290 TraceCheckUtils]: 46: Hoare triple {2440#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2440#false} is VALID [2022-02-20 14:05:36,593 INFO L290 TraceCheckUtils]: 47: Hoare triple {2440#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2440#false} is VALID [2022-02-20 14:05:36,593 INFO L290 TraceCheckUtils]: 48: Hoare triple {2440#false} assume !(main_~i~0#1 < 100000); {2440#false} is VALID [2022-02-20 14:05:36,593 INFO L290 TraceCheckUtils]: 49: Hoare triple {2440#false} main_~i~0#1 := 0; {2440#false} is VALID [2022-02-20 14:05:36,593 INFO L290 TraceCheckUtils]: 50: Hoare triple {2440#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2440#false} is VALID [2022-02-20 14:05:36,593 INFO L290 TraceCheckUtils]: 51: Hoare triple {2440#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2440#false} is VALID [2022-02-20 14:05:36,593 INFO L290 TraceCheckUtils]: 52: Hoare triple {2440#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2440#false} is VALID [2022-02-20 14:05:36,593 INFO L290 TraceCheckUtils]: 53: Hoare triple {2440#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2440#false} is VALID [2022-02-20 14:05:36,593 INFO L290 TraceCheckUtils]: 54: Hoare triple {2440#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2440#false} is VALID [2022-02-20 14:05:36,593 INFO L290 TraceCheckUtils]: 55: Hoare triple {2440#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2440#false} is VALID [2022-02-20 14:05:36,593 INFO L290 TraceCheckUtils]: 56: Hoare triple {2440#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2440#false} is VALID [2022-02-20 14:05:36,593 INFO L290 TraceCheckUtils]: 57: Hoare triple {2440#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2440#false} is VALID [2022-02-20 14:05:36,594 INFO L290 TraceCheckUtils]: 58: Hoare triple {2440#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2440#false} is VALID [2022-02-20 14:05:36,594 INFO L290 TraceCheckUtils]: 59: Hoare triple {2440#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2440#false} is VALID [2022-02-20 14:05:36,594 INFO L290 TraceCheckUtils]: 60: Hoare triple {2440#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2440#false} is VALID [2022-02-20 14:05:36,594 INFO L290 TraceCheckUtils]: 61: Hoare triple {2440#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2440#false} is VALID [2022-02-20 14:05:36,594 INFO L290 TraceCheckUtils]: 62: Hoare triple {2440#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2440#false} is VALID [2022-02-20 14:05:36,594 INFO L290 TraceCheckUtils]: 63: Hoare triple {2440#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2440#false} is VALID [2022-02-20 14:05:36,594 INFO L290 TraceCheckUtils]: 64: Hoare triple {2440#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2440#false} is VALID [2022-02-20 14:05:36,594 INFO L290 TraceCheckUtils]: 65: Hoare triple {2440#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2440#false} is VALID [2022-02-20 14:05:36,594 INFO L290 TraceCheckUtils]: 66: Hoare triple {2440#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2440#false} is VALID [2022-02-20 14:05:36,594 INFO L290 TraceCheckUtils]: 67: Hoare triple {2440#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2440#false} is VALID [2022-02-20 14:05:36,594 INFO L290 TraceCheckUtils]: 68: Hoare triple {2440#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2440#false} is VALID [2022-02-20 14:05:36,594 INFO L290 TraceCheckUtils]: 69: Hoare triple {2440#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2440#false} is VALID [2022-02-20 14:05:36,594 INFO L290 TraceCheckUtils]: 70: Hoare triple {2440#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2440#false} is VALID [2022-02-20 14:05:36,594 INFO L290 TraceCheckUtils]: 71: Hoare triple {2440#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2440#false} is VALID [2022-02-20 14:05:36,594 INFO L290 TraceCheckUtils]: 72: Hoare triple {2440#false} assume !(main_~i~0#1 < 100000); {2440#false} is VALID [2022-02-20 14:05:36,594 INFO L290 TraceCheckUtils]: 73: Hoare triple {2440#false} main_~i~0#1 := 0; {2440#false} is VALID [2022-02-20 14:05:36,594 INFO L290 TraceCheckUtils]: 74: Hoare triple {2440#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2440#false} is VALID [2022-02-20 14:05:36,595 INFO L290 TraceCheckUtils]: 75: Hoare triple {2440#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2440#false} is VALID [2022-02-20 14:05:36,595 INFO L290 TraceCheckUtils]: 76: Hoare triple {2440#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2440#false} is VALID [2022-02-20 14:05:36,595 INFO L290 TraceCheckUtils]: 77: Hoare triple {2440#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2440#false} is VALID [2022-02-20 14:05:36,595 INFO L290 TraceCheckUtils]: 78: Hoare triple {2440#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2440#false} is VALID [2022-02-20 14:05:36,595 INFO L290 TraceCheckUtils]: 79: Hoare triple {2440#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2440#false} is VALID [2022-02-20 14:05:36,595 INFO L290 TraceCheckUtils]: 80: Hoare triple {2440#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2440#false} is VALID [2022-02-20 14:05:36,595 INFO L290 TraceCheckUtils]: 81: Hoare triple {2440#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2440#false} is VALID [2022-02-20 14:05:36,595 INFO L290 TraceCheckUtils]: 82: Hoare triple {2440#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2440#false} is VALID [2022-02-20 14:05:36,595 INFO L290 TraceCheckUtils]: 83: Hoare triple {2440#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2440#false} is VALID [2022-02-20 14:05:36,595 INFO L290 TraceCheckUtils]: 84: Hoare triple {2440#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2440#false} is VALID [2022-02-20 14:05:36,595 INFO L290 TraceCheckUtils]: 85: Hoare triple {2440#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2440#false} is VALID [2022-02-20 14:05:36,595 INFO L290 TraceCheckUtils]: 86: Hoare triple {2440#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2440#false} is VALID [2022-02-20 14:05:36,596 INFO L290 TraceCheckUtils]: 87: Hoare triple {2440#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2440#false} is VALID [2022-02-20 14:05:36,596 INFO L290 TraceCheckUtils]: 88: Hoare triple {2440#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2440#false} is VALID [2022-02-20 14:05:36,596 INFO L290 TraceCheckUtils]: 89: Hoare triple {2440#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2440#false} is VALID [2022-02-20 14:05:36,596 INFO L290 TraceCheckUtils]: 90: Hoare triple {2440#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2440#false} is VALID [2022-02-20 14:05:36,596 INFO L290 TraceCheckUtils]: 91: Hoare triple {2440#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2440#false} is VALID [2022-02-20 14:05:36,596 INFO L290 TraceCheckUtils]: 92: Hoare triple {2440#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2440#false} is VALID [2022-02-20 14:05:36,596 INFO L290 TraceCheckUtils]: 93: Hoare triple {2440#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2440#false} is VALID [2022-02-20 14:05:36,596 INFO L290 TraceCheckUtils]: 94: Hoare triple {2440#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2440#false} is VALID [2022-02-20 14:05:36,596 INFO L290 TraceCheckUtils]: 95: Hoare triple {2440#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2440#false} is VALID [2022-02-20 14:05:36,597 INFO L290 TraceCheckUtils]: 96: Hoare triple {2440#false} assume !(main_~i~0#1 < 100000); {2440#false} is VALID [2022-02-20 14:05:36,597 INFO L290 TraceCheckUtils]: 97: Hoare triple {2440#false} main_~i~0#1 := 0; {2440#false} is VALID [2022-02-20 14:05:36,597 INFO L290 TraceCheckUtils]: 98: Hoare triple {2440#false} assume !!(main_~i~0#1 < 100000);call write~int(46, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2440#false} is VALID [2022-02-20 14:05:36,597 INFO L290 TraceCheckUtils]: 99: Hoare triple {2440#false} assume !!(main_~i~0#1 < 100000);call write~int(46, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2440#false} is VALID [2022-02-20 14:05:36,597 INFO L290 TraceCheckUtils]: 100: Hoare triple {2440#false} assume !!(main_~i~0#1 < 100000);call write~int(46, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2440#false} is VALID [2022-02-20 14:05:36,597 INFO L290 TraceCheckUtils]: 101: Hoare triple {2440#false} assume !!(main_~i~0#1 < 100000);call write~int(46, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2440#false} is VALID [2022-02-20 14:05:36,597 INFO L290 TraceCheckUtils]: 102: Hoare triple {2440#false} assume !!(main_~i~0#1 < 100000);call write~int(46, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2440#false} is VALID [2022-02-20 14:05:36,597 INFO L290 TraceCheckUtils]: 103: Hoare triple {2440#false} assume !!(main_~i~0#1 < 100000);call write~int(46, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2440#false} is VALID [2022-02-20 14:05:36,597 INFO L290 TraceCheckUtils]: 104: Hoare triple {2440#false} assume !!(main_~i~0#1 < 100000);call write~int(46, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2440#false} is VALID [2022-02-20 14:05:36,598 INFO L290 TraceCheckUtils]: 105: Hoare triple {2440#false} assume !!(main_~i~0#1 < 100000);call write~int(46, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2440#false} is VALID [2022-02-20 14:05:36,598 INFO L290 TraceCheckUtils]: 106: Hoare triple {2440#false} assume !!(main_~i~0#1 < 100000);call write~int(46, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2440#false} is VALID [2022-02-20 14:05:36,598 INFO L290 TraceCheckUtils]: 107: Hoare triple {2440#false} assume !!(main_~i~0#1 < 100000);call write~int(46, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2440#false} is VALID [2022-02-20 14:05:36,598 INFO L290 TraceCheckUtils]: 108: Hoare triple {2440#false} assume !!(main_~i~0#1 < 100000);call write~int(46, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2440#false} is VALID [2022-02-20 14:05:36,598 INFO L290 TraceCheckUtils]: 109: Hoare triple {2440#false} assume !!(main_~i~0#1 < 100000);call write~int(46, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2440#false} is VALID [2022-02-20 14:05:36,598 INFO L290 TraceCheckUtils]: 110: Hoare triple {2440#false} assume !!(main_~i~0#1 < 100000);call write~int(46, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2440#false} is VALID [2022-02-20 14:05:36,598 INFO L290 TraceCheckUtils]: 111: Hoare triple {2440#false} assume !!(main_~i~0#1 < 100000);call write~int(46, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2440#false} is VALID [2022-02-20 14:05:36,598 INFO L290 TraceCheckUtils]: 112: Hoare triple {2440#false} assume !!(main_~i~0#1 < 100000);call write~int(46, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2440#false} is VALID [2022-02-20 14:05:36,599 INFO L290 TraceCheckUtils]: 113: Hoare triple {2440#false} assume !!(main_~i~0#1 < 100000);call write~int(46, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2440#false} is VALID [2022-02-20 14:05:36,599 INFO L290 TraceCheckUtils]: 114: Hoare triple {2440#false} assume !!(main_~i~0#1 < 100000);call write~int(46, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2440#false} is VALID [2022-02-20 14:05:36,599 INFO L290 TraceCheckUtils]: 115: Hoare triple {2440#false} assume !!(main_~i~0#1 < 100000);call write~int(46, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2440#false} is VALID [2022-02-20 14:05:36,599 INFO L290 TraceCheckUtils]: 116: Hoare triple {2440#false} assume !!(main_~i~0#1 < 100000);call write~int(46, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2440#false} is VALID [2022-02-20 14:05:36,599 INFO L290 TraceCheckUtils]: 117: Hoare triple {2440#false} assume !!(main_~i~0#1 < 100000);call write~int(46, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2440#false} is VALID [2022-02-20 14:05:36,599 INFO L290 TraceCheckUtils]: 118: Hoare triple {2440#false} assume !!(main_~i~0#1 < 100000);call write~int(46, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2440#false} is VALID [2022-02-20 14:05:36,599 INFO L290 TraceCheckUtils]: 119: Hoare triple {2440#false} assume !!(main_~i~0#1 < 100000);call write~int(46, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2440#false} is VALID [2022-02-20 14:05:36,599 INFO L290 TraceCheckUtils]: 120: Hoare triple {2440#false} assume !(main_~i~0#1 < 100000); {2440#false} is VALID [2022-02-20 14:05:36,599 INFO L290 TraceCheckUtils]: 121: Hoare triple {2440#false} havoc main_~x~0#1;main_~x~0#1 := 0; {2440#false} is VALID [2022-02-20 14:05:36,600 INFO L290 TraceCheckUtils]: 122: Hoare triple {2440#false} assume !!(main_~x~0#1 < 100000);call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~x~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 46 == main_#t~mem2#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {2440#false} is VALID [2022-02-20 14:05:36,600 INFO L290 TraceCheckUtils]: 123: Hoare triple {2440#false} assume 0 == __VERIFIER_assert_~cond#1; {2440#false} is VALID [2022-02-20 14:05:36,600 INFO L290 TraceCheckUtils]: 124: Hoare triple {2440#false} assume !false; {2440#false} is VALID [2022-02-20 14:05:36,600 INFO L134 CoverageAnalysis]: Checked inductivity of 1265 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2022-02-20 14:05:36,601 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 14:05:37,637 INFO L290 TraceCheckUtils]: 124: Hoare triple {2440#false} assume !false; {2440#false} is VALID [2022-02-20 14:05:37,637 INFO L290 TraceCheckUtils]: 123: Hoare triple {2440#false} assume 0 == __VERIFIER_assert_~cond#1; {2440#false} is VALID [2022-02-20 14:05:37,637 INFO L290 TraceCheckUtils]: 122: Hoare triple {2440#false} assume !!(main_~x~0#1 < 100000);call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~x~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 46 == main_#t~mem2#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {2440#false} is VALID [2022-02-20 14:05:37,637 INFO L290 TraceCheckUtils]: 121: Hoare triple {2440#false} havoc main_~x~0#1;main_~x~0#1 := 0; {2440#false} is VALID [2022-02-20 14:05:37,637 INFO L290 TraceCheckUtils]: 120: Hoare triple {2440#false} assume !(main_~i~0#1 < 100000); {2440#false} is VALID [2022-02-20 14:05:37,638 INFO L290 TraceCheckUtils]: 119: Hoare triple {2440#false} assume !!(main_~i~0#1 < 100000);call write~int(46, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2440#false} is VALID [2022-02-20 14:05:37,638 INFO L290 TraceCheckUtils]: 118: Hoare triple {2440#false} assume !!(main_~i~0#1 < 100000);call write~int(46, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2440#false} is VALID [2022-02-20 14:05:37,638 INFO L290 TraceCheckUtils]: 117: Hoare triple {2440#false} assume !!(main_~i~0#1 < 100000);call write~int(46, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2440#false} is VALID [2022-02-20 14:05:37,638 INFO L290 TraceCheckUtils]: 116: Hoare triple {2440#false} assume !!(main_~i~0#1 < 100000);call write~int(46, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2440#false} is VALID [2022-02-20 14:05:37,638 INFO L290 TraceCheckUtils]: 115: Hoare triple {2440#false} assume !!(main_~i~0#1 < 100000);call write~int(46, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2440#false} is VALID [2022-02-20 14:05:37,638 INFO L290 TraceCheckUtils]: 114: Hoare triple {2440#false} assume !!(main_~i~0#1 < 100000);call write~int(46, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2440#false} is VALID [2022-02-20 14:05:37,638 INFO L290 TraceCheckUtils]: 113: Hoare triple {2440#false} assume !!(main_~i~0#1 < 100000);call write~int(46, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2440#false} is VALID [2022-02-20 14:05:37,638 INFO L290 TraceCheckUtils]: 112: Hoare triple {2440#false} assume !!(main_~i~0#1 < 100000);call write~int(46, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2440#false} is VALID [2022-02-20 14:05:37,638 INFO L290 TraceCheckUtils]: 111: Hoare triple {2440#false} assume !!(main_~i~0#1 < 100000);call write~int(46, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2440#false} is VALID [2022-02-20 14:05:37,638 INFO L290 TraceCheckUtils]: 110: Hoare triple {2440#false} assume !!(main_~i~0#1 < 100000);call write~int(46, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2440#false} is VALID [2022-02-20 14:05:37,638 INFO L290 TraceCheckUtils]: 109: Hoare triple {2440#false} assume !!(main_~i~0#1 < 100000);call write~int(46, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2440#false} is VALID [2022-02-20 14:05:37,638 INFO L290 TraceCheckUtils]: 108: Hoare triple {2440#false} assume !!(main_~i~0#1 < 100000);call write~int(46, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2440#false} is VALID [2022-02-20 14:05:37,638 INFO L290 TraceCheckUtils]: 107: Hoare triple {2440#false} assume !!(main_~i~0#1 < 100000);call write~int(46, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2440#false} is VALID [2022-02-20 14:05:37,639 INFO L290 TraceCheckUtils]: 106: Hoare triple {2440#false} assume !!(main_~i~0#1 < 100000);call write~int(46, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2440#false} is VALID [2022-02-20 14:05:37,639 INFO L290 TraceCheckUtils]: 105: Hoare triple {2440#false} assume !!(main_~i~0#1 < 100000);call write~int(46, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2440#false} is VALID [2022-02-20 14:05:37,639 INFO L290 TraceCheckUtils]: 104: Hoare triple {2440#false} assume !!(main_~i~0#1 < 100000);call write~int(46, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2440#false} is VALID [2022-02-20 14:05:37,639 INFO L290 TraceCheckUtils]: 103: Hoare triple {2440#false} assume !!(main_~i~0#1 < 100000);call write~int(46, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2440#false} is VALID [2022-02-20 14:05:37,639 INFO L290 TraceCheckUtils]: 102: Hoare triple {2440#false} assume !!(main_~i~0#1 < 100000);call write~int(46, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2440#false} is VALID [2022-02-20 14:05:37,639 INFO L290 TraceCheckUtils]: 101: Hoare triple {2440#false} assume !!(main_~i~0#1 < 100000);call write~int(46, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2440#false} is VALID [2022-02-20 14:05:37,639 INFO L290 TraceCheckUtils]: 100: Hoare triple {2440#false} assume !!(main_~i~0#1 < 100000);call write~int(46, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2440#false} is VALID [2022-02-20 14:05:37,639 INFO L290 TraceCheckUtils]: 99: Hoare triple {2440#false} assume !!(main_~i~0#1 < 100000);call write~int(46, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2440#false} is VALID [2022-02-20 14:05:37,639 INFO L290 TraceCheckUtils]: 98: Hoare triple {2440#false} assume !!(main_~i~0#1 < 100000);call write~int(46, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2440#false} is VALID [2022-02-20 14:05:37,639 INFO L290 TraceCheckUtils]: 97: Hoare triple {2440#false} main_~i~0#1 := 0; {2440#false} is VALID [2022-02-20 14:05:37,639 INFO L290 TraceCheckUtils]: 96: Hoare triple {2440#false} assume !(main_~i~0#1 < 100000); {2440#false} is VALID [2022-02-20 14:05:37,639 INFO L290 TraceCheckUtils]: 95: Hoare triple {2440#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2440#false} is VALID [2022-02-20 14:05:37,639 INFO L290 TraceCheckUtils]: 94: Hoare triple {2440#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2440#false} is VALID [2022-02-20 14:05:37,639 INFO L290 TraceCheckUtils]: 93: Hoare triple {2440#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2440#false} is VALID [2022-02-20 14:05:37,639 INFO L290 TraceCheckUtils]: 92: Hoare triple {2440#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2440#false} is VALID [2022-02-20 14:05:37,639 INFO L290 TraceCheckUtils]: 91: Hoare triple {2440#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2440#false} is VALID [2022-02-20 14:05:37,640 INFO L290 TraceCheckUtils]: 90: Hoare triple {2440#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2440#false} is VALID [2022-02-20 14:05:37,640 INFO L290 TraceCheckUtils]: 89: Hoare triple {2440#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2440#false} is VALID [2022-02-20 14:05:37,640 INFO L290 TraceCheckUtils]: 88: Hoare triple {2440#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2440#false} is VALID [2022-02-20 14:05:37,640 INFO L290 TraceCheckUtils]: 87: Hoare triple {2440#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2440#false} is VALID [2022-02-20 14:05:37,640 INFO L290 TraceCheckUtils]: 86: Hoare triple {2440#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2440#false} is VALID [2022-02-20 14:05:37,640 INFO L290 TraceCheckUtils]: 85: Hoare triple {2440#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2440#false} is VALID [2022-02-20 14:05:37,640 INFO L290 TraceCheckUtils]: 84: Hoare triple {2440#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2440#false} is VALID [2022-02-20 14:05:37,640 INFO L290 TraceCheckUtils]: 83: Hoare triple {2440#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2440#false} is VALID [2022-02-20 14:05:37,640 INFO L290 TraceCheckUtils]: 82: Hoare triple {2440#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2440#false} is VALID [2022-02-20 14:05:37,640 INFO L290 TraceCheckUtils]: 81: Hoare triple {2440#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2440#false} is VALID [2022-02-20 14:05:37,640 INFO L290 TraceCheckUtils]: 80: Hoare triple {2440#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2440#false} is VALID [2022-02-20 14:05:37,640 INFO L290 TraceCheckUtils]: 79: Hoare triple {2440#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2440#false} is VALID [2022-02-20 14:05:37,640 INFO L290 TraceCheckUtils]: 78: Hoare triple {2440#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2440#false} is VALID [2022-02-20 14:05:37,640 INFO L290 TraceCheckUtils]: 77: Hoare triple {2440#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2440#false} is VALID [2022-02-20 14:05:37,640 INFO L290 TraceCheckUtils]: 76: Hoare triple {2440#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2440#false} is VALID [2022-02-20 14:05:37,640 INFO L290 TraceCheckUtils]: 75: Hoare triple {2440#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2440#false} is VALID [2022-02-20 14:05:37,640 INFO L290 TraceCheckUtils]: 74: Hoare triple {2440#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2440#false} is VALID [2022-02-20 14:05:37,641 INFO L290 TraceCheckUtils]: 73: Hoare triple {2440#false} main_~i~0#1 := 0; {2440#false} is VALID [2022-02-20 14:05:37,641 INFO L290 TraceCheckUtils]: 72: Hoare triple {2440#false} assume !(main_~i~0#1 < 100000); {2440#false} is VALID [2022-02-20 14:05:37,641 INFO L290 TraceCheckUtils]: 71: Hoare triple {2440#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2440#false} is VALID [2022-02-20 14:05:37,641 INFO L290 TraceCheckUtils]: 70: Hoare triple {2440#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2440#false} is VALID [2022-02-20 14:05:37,641 INFO L290 TraceCheckUtils]: 69: Hoare triple {2440#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2440#false} is VALID [2022-02-20 14:05:37,641 INFO L290 TraceCheckUtils]: 68: Hoare triple {2440#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2440#false} is VALID [2022-02-20 14:05:37,643 INFO L290 TraceCheckUtils]: 67: Hoare triple {2440#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2440#false} is VALID [2022-02-20 14:05:37,643 INFO L290 TraceCheckUtils]: 66: Hoare triple {2440#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2440#false} is VALID [2022-02-20 14:05:37,643 INFO L290 TraceCheckUtils]: 65: Hoare triple {2440#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2440#false} is VALID [2022-02-20 14:05:37,643 INFO L290 TraceCheckUtils]: 64: Hoare triple {2440#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2440#false} is VALID [2022-02-20 14:05:37,643 INFO L290 TraceCheckUtils]: 63: Hoare triple {2440#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2440#false} is VALID [2022-02-20 14:05:37,643 INFO L290 TraceCheckUtils]: 62: Hoare triple {2440#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2440#false} is VALID [2022-02-20 14:05:37,644 INFO L290 TraceCheckUtils]: 61: Hoare triple {2440#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2440#false} is VALID [2022-02-20 14:05:37,644 INFO L290 TraceCheckUtils]: 60: Hoare triple {2440#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2440#false} is VALID [2022-02-20 14:05:37,644 INFO L290 TraceCheckUtils]: 59: Hoare triple {2440#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2440#false} is VALID [2022-02-20 14:05:37,644 INFO L290 TraceCheckUtils]: 58: Hoare triple {2440#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2440#false} is VALID [2022-02-20 14:05:37,644 INFO L290 TraceCheckUtils]: 57: Hoare triple {2440#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2440#false} is VALID [2022-02-20 14:05:37,644 INFO L290 TraceCheckUtils]: 56: Hoare triple {2440#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2440#false} is VALID [2022-02-20 14:05:37,644 INFO L290 TraceCheckUtils]: 55: Hoare triple {2440#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2440#false} is VALID [2022-02-20 14:05:37,644 INFO L290 TraceCheckUtils]: 54: Hoare triple {2440#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2440#false} is VALID [2022-02-20 14:05:37,644 INFO L290 TraceCheckUtils]: 53: Hoare triple {2440#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2440#false} is VALID [2022-02-20 14:05:37,644 INFO L290 TraceCheckUtils]: 52: Hoare triple {2440#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2440#false} is VALID [2022-02-20 14:05:37,644 INFO L290 TraceCheckUtils]: 51: Hoare triple {2440#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2440#false} is VALID [2022-02-20 14:05:37,644 INFO L290 TraceCheckUtils]: 50: Hoare triple {2440#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2440#false} is VALID [2022-02-20 14:05:37,644 INFO L290 TraceCheckUtils]: 49: Hoare triple {2440#false} main_~i~0#1 := 0; {2440#false} is VALID [2022-02-20 14:05:37,644 INFO L290 TraceCheckUtils]: 48: Hoare triple {2440#false} assume !(main_~i~0#1 < 100000); {2440#false} is VALID [2022-02-20 14:05:37,644 INFO L290 TraceCheckUtils]: 47: Hoare triple {2440#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2440#false} is VALID [2022-02-20 14:05:37,644 INFO L290 TraceCheckUtils]: 46: Hoare triple {2440#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2440#false} is VALID [2022-02-20 14:05:37,645 INFO L290 TraceCheckUtils]: 45: Hoare triple {2440#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2440#false} is VALID [2022-02-20 14:05:37,645 INFO L290 TraceCheckUtils]: 44: Hoare triple {2440#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2440#false} is VALID [2022-02-20 14:05:37,645 INFO L290 TraceCheckUtils]: 43: Hoare triple {2440#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2440#false} is VALID [2022-02-20 14:05:37,645 INFO L290 TraceCheckUtils]: 42: Hoare triple {2440#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2440#false} is VALID [2022-02-20 14:05:37,645 INFO L290 TraceCheckUtils]: 41: Hoare triple {2440#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2440#false} is VALID [2022-02-20 14:05:37,645 INFO L290 TraceCheckUtils]: 40: Hoare triple {2440#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2440#false} is VALID [2022-02-20 14:05:37,645 INFO L290 TraceCheckUtils]: 39: Hoare triple {2440#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2440#false} is VALID [2022-02-20 14:05:37,645 INFO L290 TraceCheckUtils]: 38: Hoare triple {2440#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2440#false} is VALID [2022-02-20 14:05:37,645 INFO L290 TraceCheckUtils]: 37: Hoare triple {2440#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2440#false} is VALID [2022-02-20 14:05:37,645 INFO L290 TraceCheckUtils]: 36: Hoare triple {2440#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2440#false} is VALID [2022-02-20 14:05:37,645 INFO L290 TraceCheckUtils]: 35: Hoare triple {2440#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2440#false} is VALID [2022-02-20 14:05:37,645 INFO L290 TraceCheckUtils]: 34: Hoare triple {2440#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2440#false} is VALID [2022-02-20 14:05:37,645 INFO L290 TraceCheckUtils]: 33: Hoare triple {2440#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2440#false} is VALID [2022-02-20 14:05:37,645 INFO L290 TraceCheckUtils]: 32: Hoare triple {2440#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2440#false} is VALID [2022-02-20 14:05:37,645 INFO L290 TraceCheckUtils]: 31: Hoare triple {2440#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2440#false} is VALID [2022-02-20 14:05:37,645 INFO L290 TraceCheckUtils]: 30: Hoare triple {2440#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2440#false} is VALID [2022-02-20 14:05:37,645 INFO L290 TraceCheckUtils]: 29: Hoare triple {2440#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2440#false} is VALID [2022-02-20 14:05:37,646 INFO L290 TraceCheckUtils]: 28: Hoare triple {2440#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2440#false} is VALID [2022-02-20 14:05:37,646 INFO L290 TraceCheckUtils]: 27: Hoare triple {2440#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2440#false} is VALID [2022-02-20 14:05:37,646 INFO L290 TraceCheckUtils]: 26: Hoare triple {2440#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2440#false} is VALID [2022-02-20 14:05:37,646 INFO L290 TraceCheckUtils]: 25: Hoare triple {2440#false} main_~i~0#1 := 0; {2440#false} is VALID [2022-02-20 14:05:37,656 INFO L290 TraceCheckUtils]: 24: Hoare triple {3140#(< |ULTIMATE.start_main_~i~0#1| 100000)} assume !(main_~i~0#1 < 100000); {2440#false} is VALID [2022-02-20 14:05:37,657 INFO L290 TraceCheckUtils]: 23: Hoare triple {3144#(< |ULTIMATE.start_main_~i~0#1| 99999)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {3140#(< |ULTIMATE.start_main_~i~0#1| 100000)} is VALID [2022-02-20 14:05:37,658 INFO L290 TraceCheckUtils]: 22: Hoare triple {3148#(< |ULTIMATE.start_main_~i~0#1| 99998)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {3144#(< |ULTIMATE.start_main_~i~0#1| 99999)} is VALID [2022-02-20 14:05:37,658 INFO L290 TraceCheckUtils]: 21: Hoare triple {3152#(< |ULTIMATE.start_main_~i~0#1| 99997)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {3148#(< |ULTIMATE.start_main_~i~0#1| 99998)} is VALID [2022-02-20 14:05:37,659 INFO L290 TraceCheckUtils]: 20: Hoare triple {3156#(< |ULTIMATE.start_main_~i~0#1| 99996)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {3152#(< |ULTIMATE.start_main_~i~0#1| 99997)} is VALID [2022-02-20 14:05:37,659 INFO L290 TraceCheckUtils]: 19: Hoare triple {3160#(< |ULTIMATE.start_main_~i~0#1| 99995)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {3156#(< |ULTIMATE.start_main_~i~0#1| 99996)} is VALID [2022-02-20 14:05:37,660 INFO L290 TraceCheckUtils]: 18: Hoare triple {3164#(< |ULTIMATE.start_main_~i~0#1| 99994)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {3160#(< |ULTIMATE.start_main_~i~0#1| 99995)} is VALID [2022-02-20 14:05:37,660 INFO L290 TraceCheckUtils]: 17: Hoare triple {3168#(< |ULTIMATE.start_main_~i~0#1| 99993)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {3164#(< |ULTIMATE.start_main_~i~0#1| 99994)} is VALID [2022-02-20 14:05:37,661 INFO L290 TraceCheckUtils]: 16: Hoare triple {3172#(< |ULTIMATE.start_main_~i~0#1| 99992)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {3168#(< |ULTIMATE.start_main_~i~0#1| 99993)} is VALID [2022-02-20 14:05:37,661 INFO L290 TraceCheckUtils]: 15: Hoare triple {3176#(< |ULTIMATE.start_main_~i~0#1| 99991)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {3172#(< |ULTIMATE.start_main_~i~0#1| 99992)} is VALID [2022-02-20 14:05:37,661 INFO L290 TraceCheckUtils]: 14: Hoare triple {3180#(< |ULTIMATE.start_main_~i~0#1| 99990)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {3176#(< |ULTIMATE.start_main_~i~0#1| 99991)} is VALID [2022-02-20 14:05:37,662 INFO L290 TraceCheckUtils]: 13: Hoare triple {3184#(< |ULTIMATE.start_main_~i~0#1| 99989)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {3180#(< |ULTIMATE.start_main_~i~0#1| 99990)} is VALID [2022-02-20 14:05:37,662 INFO L290 TraceCheckUtils]: 12: Hoare triple {3188#(< |ULTIMATE.start_main_~i~0#1| 99988)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {3184#(< |ULTIMATE.start_main_~i~0#1| 99989)} is VALID [2022-02-20 14:05:37,663 INFO L290 TraceCheckUtils]: 11: Hoare triple {3192#(< |ULTIMATE.start_main_~i~0#1| 99987)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {3188#(< |ULTIMATE.start_main_~i~0#1| 99988)} is VALID [2022-02-20 14:05:37,663 INFO L290 TraceCheckUtils]: 10: Hoare triple {3196#(< |ULTIMATE.start_main_~i~0#1| 99986)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {3192#(< |ULTIMATE.start_main_~i~0#1| 99987)} is VALID [2022-02-20 14:05:37,664 INFO L290 TraceCheckUtils]: 9: Hoare triple {3200#(< |ULTIMATE.start_main_~i~0#1| 99985)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {3196#(< |ULTIMATE.start_main_~i~0#1| 99986)} is VALID [2022-02-20 14:05:37,664 INFO L290 TraceCheckUtils]: 8: Hoare triple {3204#(< |ULTIMATE.start_main_~i~0#1| 99984)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {3200#(< |ULTIMATE.start_main_~i~0#1| 99985)} is VALID [2022-02-20 14:05:37,665 INFO L290 TraceCheckUtils]: 7: Hoare triple {3208#(< |ULTIMATE.start_main_~i~0#1| 99983)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {3204#(< |ULTIMATE.start_main_~i~0#1| 99984)} is VALID [2022-02-20 14:05:37,665 INFO L290 TraceCheckUtils]: 6: Hoare triple {3212#(< |ULTIMATE.start_main_~i~0#1| 99982)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {3208#(< |ULTIMATE.start_main_~i~0#1| 99983)} is VALID [2022-02-20 14:05:37,666 INFO L290 TraceCheckUtils]: 5: Hoare triple {3216#(< |ULTIMATE.start_main_~i~0#1| 99981)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {3212#(< |ULTIMATE.start_main_~i~0#1| 99982)} is VALID [2022-02-20 14:05:37,666 INFO L290 TraceCheckUtils]: 4: Hoare triple {3220#(< |ULTIMATE.start_main_~i~0#1| 99980)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {3216#(< |ULTIMATE.start_main_~i~0#1| 99981)} is VALID [2022-02-20 14:05:37,667 INFO L290 TraceCheckUtils]: 3: Hoare triple {3224#(< |ULTIMATE.start_main_~i~0#1| 99979)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {3220#(< |ULTIMATE.start_main_~i~0#1| 99980)} is VALID [2022-02-20 14:05:37,667 INFO L290 TraceCheckUtils]: 2: Hoare triple {3228#(< |ULTIMATE.start_main_~i~0#1| 99978)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {3224#(< |ULTIMATE.start_main_~i~0#1| 99979)} is VALID [2022-02-20 14:05:37,667 INFO L290 TraceCheckUtils]: 1: Hoare triple {2439#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem2#1, main_#t~post1#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~i~0#1, main_~x~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);main_~i~0#1 := 0; {3228#(< |ULTIMATE.start_main_~i~0#1| 99978)} is VALID [2022-02-20 14:05:37,668 INFO L290 TraceCheckUtils]: 0: Hoare triple {2439#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); {2439#true} is VALID [2022-02-20 14:05:37,668 INFO L134 CoverageAnalysis]: Checked inductivity of 1265 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2022-02-20 14:05:37,668 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1548800138] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 14:05:37,668 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 14:05:37,668 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 49 [2022-02-20 14:05:37,669 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690645710] [2022-02-20 14:05:37,669 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 14:05:37,669 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 49 states have (on average 1.3673469387755102) internal successors, (67), 49 states have internal predecessors, (67), 0 states have call successors, (0), 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 125 [2022-02-20 14:05:37,670 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:05:37,670 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 49 states, 49 states have (on average 1.3673469387755102) internal successors, (67), 49 states have internal predecessors, (67), 0 states have call successors, (0), 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:05:37,703 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:05:37,703 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2022-02-20 14:05:37,703 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:05:37,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2022-02-20 14:05:37,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2022-02-20 14:05:37,705 INFO L87 Difference]: Start difference. First operand 128 states and 133 transitions. Second operand has 49 states, 49 states have (on average 1.3673469387755102) internal successors, (67), 49 states have internal predecessors, (67), 0 states have call successors, (0), 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:05:39,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:05:39,351 INFO L93 Difference]: Finished difference Result 351 states and 480 transitions. [2022-02-20 14:05:39,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2022-02-20 14:05:39,351 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 49 states have (on average 1.3673469387755102) internal successors, (67), 49 states have internal predecessors, (67), 0 states have call successors, (0), 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 125 [2022-02-20 14:05:39,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:05:39,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 49 states have (on average 1.3673469387755102) internal successors, (67), 49 states have internal predecessors, (67), 0 states have call successors, (0), 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:05:39,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 392 transitions. [2022-02-20 14:05:39,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 49 states have (on average 1.3673469387755102) internal successors, (67), 49 states have internal predecessors, (67), 0 states have call successors, (0), 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:05:39,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 392 transitions. [2022-02-20 14:05:39,359 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 48 states and 392 transitions. [2022-02-20 14:05:39,642 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 392 edges. 392 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:05:39,645 INFO L225 Difference]: With dead ends: 351 [2022-02-20 14:05:39,646 INFO L226 Difference]: Without dead ends: 248 [2022-02-20 14:05:39,646 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 226 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2022-02-20 14:05:39,647 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 0 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 275 mSolverCounterSat, 864 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 1139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 864 IncrementalHoareTripleChecker+Valid, 275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-02-20 14:05:39,647 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 74 Invalid, 1139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [864 Valid, 275 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-02-20 14:05:39,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2022-02-20 14:05:39,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 248. [2022-02-20 14:05:39,778 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:05:39,779 INFO L82 GeneralOperation]: Start isEquivalent. First operand 248 states. Second operand has 248 states, 247 states have (on average 1.0242914979757085) internal successors, (253), 247 states have internal predecessors, (253), 0 states have call successors, (0), 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:05:39,779 INFO L74 IsIncluded]: Start isIncluded. First operand 248 states. Second operand has 248 states, 247 states have (on average 1.0242914979757085) internal successors, (253), 247 states have internal predecessors, (253), 0 states have call successors, (0), 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:05:39,780 INFO L87 Difference]: Start difference. First operand 248 states. Second operand has 248 states, 247 states have (on average 1.0242914979757085) internal successors, (253), 247 states have internal predecessors, (253), 0 states have call successors, (0), 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:05:39,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:05:39,784 INFO L93 Difference]: Finished difference Result 248 states and 253 transitions. [2022-02-20 14:05:39,784 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 253 transitions. [2022-02-20 14:05:39,784 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:05:39,785 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:05:39,785 INFO L74 IsIncluded]: Start isIncluded. First operand has 248 states, 247 states have (on average 1.0242914979757085) internal successors, (253), 247 states have internal predecessors, (253), 0 states have call successors, (0), 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 248 states. [2022-02-20 14:05:39,785 INFO L87 Difference]: Start difference. First operand has 248 states, 247 states have (on average 1.0242914979757085) internal successors, (253), 247 states have internal predecessors, (253), 0 states have call successors, (0), 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 248 states. [2022-02-20 14:05:39,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:05:39,790 INFO L93 Difference]: Finished difference Result 248 states and 253 transitions. [2022-02-20 14:05:39,790 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 253 transitions. [2022-02-20 14:05:39,790 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:05:39,790 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:05:39,791 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:05:39,791 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:05:39,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 247 states have (on average 1.0242914979757085) internal successors, (253), 247 states have internal predecessors, (253), 0 states have call successors, (0), 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:05:39,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 253 transitions. [2022-02-20 14:05:39,796 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 253 transitions. Word has length 125 [2022-02-20 14:05:39,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:05:39,796 INFO L470 AbstractCegarLoop]: Abstraction has 248 states and 253 transitions. [2022-02-20 14:05:39,796 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 1.3673469387755102) internal successors, (67), 49 states have internal predecessors, (67), 0 states have call successors, (0), 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:05:39,797 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 253 transitions. [2022-02-20 14:05:39,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2022-02-20 14:05:39,798 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:05:39,799 INFO L514 BasicCegarLoop]: trace histogram [46, 46, 46, 46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:05:39,817 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-02-20 14:05:40,017 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:05:40,017 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:05:40,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:05:40,018 INFO L85 PathProgramCache]: Analyzing trace with hash 428296204, now seen corresponding path program 5 times [2022-02-20 14:05:40,018 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:05:40,018 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385744045] [2022-02-20 14:05:40,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:05:40,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:05:40,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:05:41,146 INFO L290 TraceCheckUtils]: 0: Hoare triple {4894#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); {4894#true} is VALID [2022-02-20 14:05:41,147 INFO L290 TraceCheckUtils]: 1: Hoare triple {4894#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem2#1, main_#t~post1#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~i~0#1, main_~x~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);main_~i~0#1 := 0; {4896#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:05:41,148 INFO L290 TraceCheckUtils]: 2: Hoare triple {4896#(= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4897#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 14:05:41,149 INFO L290 TraceCheckUtils]: 3: Hoare triple {4897#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4898#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-20 14:05:41,149 INFO L290 TraceCheckUtils]: 4: Hoare triple {4898#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4899#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-20 14:05:41,150 INFO L290 TraceCheckUtils]: 5: Hoare triple {4899#(<= |ULTIMATE.start_main_~i~0#1| 3)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4900#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-20 14:05:41,150 INFO L290 TraceCheckUtils]: 6: Hoare triple {4900#(<= |ULTIMATE.start_main_~i~0#1| 4)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4901#(<= |ULTIMATE.start_main_~i~0#1| 5)} is VALID [2022-02-20 14:05:41,151 INFO L290 TraceCheckUtils]: 7: Hoare triple {4901#(<= |ULTIMATE.start_main_~i~0#1| 5)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4902#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-20 14:05:41,151 INFO L290 TraceCheckUtils]: 8: Hoare triple {4902#(<= |ULTIMATE.start_main_~i~0#1| 6)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4903#(<= |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-20 14:05:41,152 INFO L290 TraceCheckUtils]: 9: Hoare triple {4903#(<= |ULTIMATE.start_main_~i~0#1| 7)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4904#(<= |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-20 14:05:41,152 INFO L290 TraceCheckUtils]: 10: Hoare triple {4904#(<= |ULTIMATE.start_main_~i~0#1| 8)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4905#(<= |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-20 14:05:41,153 INFO L290 TraceCheckUtils]: 11: Hoare triple {4905#(<= |ULTIMATE.start_main_~i~0#1| 9)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4906#(<= |ULTIMATE.start_main_~i~0#1| 10)} is VALID [2022-02-20 14:05:41,153 INFO L290 TraceCheckUtils]: 12: Hoare triple {4906#(<= |ULTIMATE.start_main_~i~0#1| 10)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4907#(<= |ULTIMATE.start_main_~i~0#1| 11)} is VALID [2022-02-20 14:05:41,154 INFO L290 TraceCheckUtils]: 13: Hoare triple {4907#(<= |ULTIMATE.start_main_~i~0#1| 11)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4908#(<= |ULTIMATE.start_main_~i~0#1| 12)} is VALID [2022-02-20 14:05:41,154 INFO L290 TraceCheckUtils]: 14: Hoare triple {4908#(<= |ULTIMATE.start_main_~i~0#1| 12)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4909#(<= |ULTIMATE.start_main_~i~0#1| 13)} is VALID [2022-02-20 14:05:41,155 INFO L290 TraceCheckUtils]: 15: Hoare triple {4909#(<= |ULTIMATE.start_main_~i~0#1| 13)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4910#(<= |ULTIMATE.start_main_~i~0#1| 14)} is VALID [2022-02-20 14:05:41,155 INFO L290 TraceCheckUtils]: 16: Hoare triple {4910#(<= |ULTIMATE.start_main_~i~0#1| 14)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4911#(<= |ULTIMATE.start_main_~i~0#1| 15)} is VALID [2022-02-20 14:05:41,156 INFO L290 TraceCheckUtils]: 17: Hoare triple {4911#(<= |ULTIMATE.start_main_~i~0#1| 15)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4912#(<= |ULTIMATE.start_main_~i~0#1| 16)} is VALID [2022-02-20 14:05:41,156 INFO L290 TraceCheckUtils]: 18: Hoare triple {4912#(<= |ULTIMATE.start_main_~i~0#1| 16)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4913#(<= |ULTIMATE.start_main_~i~0#1| 17)} is VALID [2022-02-20 14:05:41,157 INFO L290 TraceCheckUtils]: 19: Hoare triple {4913#(<= |ULTIMATE.start_main_~i~0#1| 17)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4914#(<= |ULTIMATE.start_main_~i~0#1| 18)} is VALID [2022-02-20 14:05:41,157 INFO L290 TraceCheckUtils]: 20: Hoare triple {4914#(<= |ULTIMATE.start_main_~i~0#1| 18)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4915#(<= |ULTIMATE.start_main_~i~0#1| 19)} is VALID [2022-02-20 14:05:41,158 INFO L290 TraceCheckUtils]: 21: Hoare triple {4915#(<= |ULTIMATE.start_main_~i~0#1| 19)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4916#(<= |ULTIMATE.start_main_~i~0#1| 20)} is VALID [2022-02-20 14:05:41,158 INFO L290 TraceCheckUtils]: 22: Hoare triple {4916#(<= |ULTIMATE.start_main_~i~0#1| 20)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4917#(<= |ULTIMATE.start_main_~i~0#1| 21)} is VALID [2022-02-20 14:05:41,159 INFO L290 TraceCheckUtils]: 23: Hoare triple {4917#(<= |ULTIMATE.start_main_~i~0#1| 21)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4918#(<= |ULTIMATE.start_main_~i~0#1| 22)} is VALID [2022-02-20 14:05:41,159 INFO L290 TraceCheckUtils]: 24: Hoare triple {4918#(<= |ULTIMATE.start_main_~i~0#1| 22)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4919#(<= |ULTIMATE.start_main_~i~0#1| 23)} is VALID [2022-02-20 14:05:41,160 INFO L290 TraceCheckUtils]: 25: Hoare triple {4919#(<= |ULTIMATE.start_main_~i~0#1| 23)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4920#(<= |ULTIMATE.start_main_~i~0#1| 24)} is VALID [2022-02-20 14:05:41,160 INFO L290 TraceCheckUtils]: 26: Hoare triple {4920#(<= |ULTIMATE.start_main_~i~0#1| 24)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4921#(<= |ULTIMATE.start_main_~i~0#1| 25)} is VALID [2022-02-20 14:05:41,161 INFO L290 TraceCheckUtils]: 27: Hoare triple {4921#(<= |ULTIMATE.start_main_~i~0#1| 25)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4922#(<= |ULTIMATE.start_main_~i~0#1| 26)} is VALID [2022-02-20 14:05:41,161 INFO L290 TraceCheckUtils]: 28: Hoare triple {4922#(<= |ULTIMATE.start_main_~i~0#1| 26)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4923#(<= |ULTIMATE.start_main_~i~0#1| 27)} is VALID [2022-02-20 14:05:41,162 INFO L290 TraceCheckUtils]: 29: Hoare triple {4923#(<= |ULTIMATE.start_main_~i~0#1| 27)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4924#(<= |ULTIMATE.start_main_~i~0#1| 28)} is VALID [2022-02-20 14:05:41,162 INFO L290 TraceCheckUtils]: 30: Hoare triple {4924#(<= |ULTIMATE.start_main_~i~0#1| 28)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4925#(<= |ULTIMATE.start_main_~i~0#1| 29)} is VALID [2022-02-20 14:05:41,163 INFO L290 TraceCheckUtils]: 31: Hoare triple {4925#(<= |ULTIMATE.start_main_~i~0#1| 29)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4926#(<= |ULTIMATE.start_main_~i~0#1| 30)} is VALID [2022-02-20 14:05:41,163 INFO L290 TraceCheckUtils]: 32: Hoare triple {4926#(<= |ULTIMATE.start_main_~i~0#1| 30)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4927#(<= |ULTIMATE.start_main_~i~0#1| 31)} is VALID [2022-02-20 14:05:41,164 INFO L290 TraceCheckUtils]: 33: Hoare triple {4927#(<= |ULTIMATE.start_main_~i~0#1| 31)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4928#(<= |ULTIMATE.start_main_~i~0#1| 32)} is VALID [2022-02-20 14:05:41,164 INFO L290 TraceCheckUtils]: 34: Hoare triple {4928#(<= |ULTIMATE.start_main_~i~0#1| 32)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4929#(<= |ULTIMATE.start_main_~i~0#1| 33)} is VALID [2022-02-20 14:05:41,165 INFO L290 TraceCheckUtils]: 35: Hoare triple {4929#(<= |ULTIMATE.start_main_~i~0#1| 33)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4930#(<= |ULTIMATE.start_main_~i~0#1| 34)} is VALID [2022-02-20 14:05:41,165 INFO L290 TraceCheckUtils]: 36: Hoare triple {4930#(<= |ULTIMATE.start_main_~i~0#1| 34)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4931#(<= |ULTIMATE.start_main_~i~0#1| 35)} is VALID [2022-02-20 14:05:41,166 INFO L290 TraceCheckUtils]: 37: Hoare triple {4931#(<= |ULTIMATE.start_main_~i~0#1| 35)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4932#(<= |ULTIMATE.start_main_~i~0#1| 36)} is VALID [2022-02-20 14:05:41,166 INFO L290 TraceCheckUtils]: 38: Hoare triple {4932#(<= |ULTIMATE.start_main_~i~0#1| 36)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4933#(<= |ULTIMATE.start_main_~i~0#1| 37)} is VALID [2022-02-20 14:05:41,167 INFO L290 TraceCheckUtils]: 39: Hoare triple {4933#(<= |ULTIMATE.start_main_~i~0#1| 37)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4934#(<= |ULTIMATE.start_main_~i~0#1| 38)} is VALID [2022-02-20 14:05:41,167 INFO L290 TraceCheckUtils]: 40: Hoare triple {4934#(<= |ULTIMATE.start_main_~i~0#1| 38)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4935#(<= |ULTIMATE.start_main_~i~0#1| 39)} is VALID [2022-02-20 14:05:41,168 INFO L290 TraceCheckUtils]: 41: Hoare triple {4935#(<= |ULTIMATE.start_main_~i~0#1| 39)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4936#(<= |ULTIMATE.start_main_~i~0#1| 40)} is VALID [2022-02-20 14:05:41,168 INFO L290 TraceCheckUtils]: 42: Hoare triple {4936#(<= |ULTIMATE.start_main_~i~0#1| 40)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4937#(<= |ULTIMATE.start_main_~i~0#1| 41)} is VALID [2022-02-20 14:05:41,169 INFO L290 TraceCheckUtils]: 43: Hoare triple {4937#(<= |ULTIMATE.start_main_~i~0#1| 41)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4938#(<= |ULTIMATE.start_main_~i~0#1| 42)} is VALID [2022-02-20 14:05:41,169 INFO L290 TraceCheckUtils]: 44: Hoare triple {4938#(<= |ULTIMATE.start_main_~i~0#1| 42)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4939#(<= |ULTIMATE.start_main_~i~0#1| 43)} is VALID [2022-02-20 14:05:41,170 INFO L290 TraceCheckUtils]: 45: Hoare triple {4939#(<= |ULTIMATE.start_main_~i~0#1| 43)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4940#(<= |ULTIMATE.start_main_~i~0#1| 44)} is VALID [2022-02-20 14:05:41,195 INFO L290 TraceCheckUtils]: 46: Hoare triple {4940#(<= |ULTIMATE.start_main_~i~0#1| 44)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4941#(<= |ULTIMATE.start_main_~i~0#1| 45)} is VALID [2022-02-20 14:05:41,196 INFO L290 TraceCheckUtils]: 47: Hoare triple {4941#(<= |ULTIMATE.start_main_~i~0#1| 45)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4942#(<= |ULTIMATE.start_main_~i~0#1| 46)} is VALID [2022-02-20 14:05:41,196 INFO L290 TraceCheckUtils]: 48: Hoare triple {4942#(<= |ULTIMATE.start_main_~i~0#1| 46)} assume !(main_~i~0#1 < 100000); {4895#false} is VALID [2022-02-20 14:05:41,196 INFO L290 TraceCheckUtils]: 49: Hoare triple {4895#false} main_~i~0#1 := 0; {4895#false} is VALID [2022-02-20 14:05:41,196 INFO L290 TraceCheckUtils]: 50: Hoare triple {4895#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4895#false} is VALID [2022-02-20 14:05:41,196 INFO L290 TraceCheckUtils]: 51: Hoare triple {4895#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4895#false} is VALID [2022-02-20 14:05:41,197 INFO L290 TraceCheckUtils]: 52: Hoare triple {4895#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4895#false} is VALID [2022-02-20 14:05:41,197 INFO L290 TraceCheckUtils]: 53: Hoare triple {4895#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4895#false} is VALID [2022-02-20 14:05:41,197 INFO L290 TraceCheckUtils]: 54: Hoare triple {4895#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4895#false} is VALID [2022-02-20 14:05:41,197 INFO L290 TraceCheckUtils]: 55: Hoare triple {4895#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4895#false} is VALID [2022-02-20 14:05:41,197 INFO L290 TraceCheckUtils]: 56: Hoare triple {4895#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4895#false} is VALID [2022-02-20 14:05:41,197 INFO L290 TraceCheckUtils]: 57: Hoare triple {4895#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4895#false} is VALID [2022-02-20 14:05:41,197 INFO L290 TraceCheckUtils]: 58: Hoare triple {4895#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4895#false} is VALID [2022-02-20 14:05:41,197 INFO L290 TraceCheckUtils]: 59: Hoare triple {4895#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4895#false} is VALID [2022-02-20 14:05:41,197 INFO L290 TraceCheckUtils]: 60: Hoare triple {4895#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4895#false} is VALID [2022-02-20 14:05:41,197 INFO L290 TraceCheckUtils]: 61: Hoare triple {4895#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4895#false} is VALID [2022-02-20 14:05:41,197 INFO L290 TraceCheckUtils]: 62: Hoare triple {4895#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4895#false} is VALID [2022-02-20 14:05:41,198 INFO L290 TraceCheckUtils]: 63: Hoare triple {4895#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4895#false} is VALID [2022-02-20 14:05:41,198 INFO L290 TraceCheckUtils]: 64: Hoare triple {4895#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4895#false} is VALID [2022-02-20 14:05:41,198 INFO L290 TraceCheckUtils]: 65: Hoare triple {4895#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4895#false} is VALID [2022-02-20 14:05:41,198 INFO L290 TraceCheckUtils]: 66: Hoare triple {4895#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4895#false} is VALID [2022-02-20 14:05:41,198 INFO L290 TraceCheckUtils]: 67: Hoare triple {4895#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4895#false} is VALID [2022-02-20 14:05:41,198 INFO L290 TraceCheckUtils]: 68: Hoare triple {4895#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4895#false} is VALID [2022-02-20 14:05:41,198 INFO L290 TraceCheckUtils]: 69: Hoare triple {4895#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4895#false} is VALID [2022-02-20 14:05:41,198 INFO L290 TraceCheckUtils]: 70: Hoare triple {4895#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4895#false} is VALID [2022-02-20 14:05:41,198 INFO L290 TraceCheckUtils]: 71: Hoare triple {4895#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4895#false} is VALID [2022-02-20 14:05:41,198 INFO L290 TraceCheckUtils]: 72: Hoare triple {4895#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4895#false} is VALID [2022-02-20 14:05:41,198 INFO L290 TraceCheckUtils]: 73: Hoare triple {4895#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4895#false} is VALID [2022-02-20 14:05:41,198 INFO L290 TraceCheckUtils]: 74: Hoare triple {4895#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4895#false} is VALID [2022-02-20 14:05:41,199 INFO L290 TraceCheckUtils]: 75: Hoare triple {4895#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4895#false} is VALID [2022-02-20 14:05:41,199 INFO L290 TraceCheckUtils]: 76: Hoare triple {4895#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4895#false} is VALID [2022-02-20 14:05:41,199 INFO L290 TraceCheckUtils]: 77: Hoare triple {4895#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4895#false} is VALID [2022-02-20 14:05:41,199 INFO L290 TraceCheckUtils]: 78: Hoare triple {4895#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4895#false} is VALID [2022-02-20 14:05:41,199 INFO L290 TraceCheckUtils]: 79: Hoare triple {4895#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4895#false} is VALID [2022-02-20 14:05:41,199 INFO L290 TraceCheckUtils]: 80: Hoare triple {4895#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4895#false} is VALID [2022-02-20 14:05:41,199 INFO L290 TraceCheckUtils]: 81: Hoare triple {4895#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4895#false} is VALID [2022-02-20 14:05:41,203 INFO L290 TraceCheckUtils]: 82: Hoare triple {4895#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4895#false} is VALID [2022-02-20 14:05:41,203 INFO L290 TraceCheckUtils]: 83: Hoare triple {4895#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4895#false} is VALID [2022-02-20 14:05:41,203 INFO L290 TraceCheckUtils]: 84: Hoare triple {4895#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4895#false} is VALID [2022-02-20 14:05:41,203 INFO L290 TraceCheckUtils]: 85: Hoare triple {4895#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4895#false} is VALID [2022-02-20 14:05:41,203 INFO L290 TraceCheckUtils]: 86: Hoare triple {4895#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4895#false} is VALID [2022-02-20 14:05:41,203 INFO L290 TraceCheckUtils]: 87: Hoare triple {4895#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4895#false} is VALID [2022-02-20 14:05:41,203 INFO L290 TraceCheckUtils]: 88: Hoare triple {4895#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4895#false} is VALID [2022-02-20 14:05:41,203 INFO L290 TraceCheckUtils]: 89: Hoare triple {4895#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4895#false} is VALID [2022-02-20 14:05:41,203 INFO L290 TraceCheckUtils]: 90: Hoare triple {4895#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4895#false} is VALID [2022-02-20 14:05:41,203 INFO L290 TraceCheckUtils]: 91: Hoare triple {4895#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4895#false} is VALID [2022-02-20 14:05:41,204 INFO L290 TraceCheckUtils]: 92: Hoare triple {4895#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4895#false} is VALID [2022-02-20 14:05:41,204 INFO L290 TraceCheckUtils]: 93: Hoare triple {4895#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4895#false} is VALID [2022-02-20 14:05:41,204 INFO L290 TraceCheckUtils]: 94: Hoare triple {4895#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4895#false} is VALID [2022-02-20 14:05:41,204 INFO L290 TraceCheckUtils]: 95: Hoare triple {4895#false} assume !!(main_~i~0#1 < 100000);call write~int(43, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4895#false} is VALID [2022-02-20 14:05:41,204 INFO L290 TraceCheckUtils]: 96: Hoare triple {4895#false} assume !(main_~i~0#1 < 100000); {4895#false} is VALID [2022-02-20 14:05:41,204 INFO L290 TraceCheckUtils]: 97: Hoare triple {4895#false} main_~i~0#1 := 0; {4895#false} is VALID [2022-02-20 14:05:41,204 INFO L290 TraceCheckUtils]: 98: Hoare triple {4895#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4895#false} is VALID [2022-02-20 14:05:41,204 INFO L290 TraceCheckUtils]: 99: Hoare triple {4895#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4895#false} is VALID [2022-02-20 14:05:41,204 INFO L290 TraceCheckUtils]: 100: Hoare triple {4895#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4895#false} is VALID [2022-02-20 14:05:41,204 INFO L290 TraceCheckUtils]: 101: Hoare triple {4895#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4895#false} is VALID [2022-02-20 14:05:41,204 INFO L290 TraceCheckUtils]: 102: Hoare triple {4895#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4895#false} is VALID [2022-02-20 14:05:41,204 INFO L290 TraceCheckUtils]: 103: Hoare triple {4895#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4895#false} is VALID [2022-02-20 14:05:41,205 INFO L290 TraceCheckUtils]: 104: Hoare triple {4895#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4895#false} is VALID [2022-02-20 14:05:41,205 INFO L290 TraceCheckUtils]: 105: Hoare triple {4895#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4895#false} is VALID [2022-02-20 14:05:41,205 INFO L290 TraceCheckUtils]: 106: Hoare triple {4895#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4895#false} is VALID [2022-02-20 14:05:41,205 INFO L290 TraceCheckUtils]: 107: Hoare triple {4895#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4895#false} is VALID [2022-02-20 14:05:41,205 INFO L290 TraceCheckUtils]: 108: Hoare triple {4895#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4895#false} is VALID [2022-02-20 14:05:41,205 INFO L290 TraceCheckUtils]: 109: Hoare triple {4895#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4895#false} is VALID [2022-02-20 14:05:41,205 INFO L290 TraceCheckUtils]: 110: Hoare triple {4895#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4895#false} is VALID [2022-02-20 14:05:41,205 INFO L290 TraceCheckUtils]: 111: Hoare triple {4895#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4895#false} is VALID [2022-02-20 14:05:41,205 INFO L290 TraceCheckUtils]: 112: Hoare triple {4895#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4895#false} is VALID [2022-02-20 14:05:41,205 INFO L290 TraceCheckUtils]: 113: Hoare triple {4895#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4895#false} is VALID [2022-02-20 14:05:41,205 INFO L290 TraceCheckUtils]: 114: Hoare triple {4895#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4895#false} is VALID [2022-02-20 14:05:41,206 INFO L290 TraceCheckUtils]: 115: Hoare triple {4895#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4895#false} is VALID [2022-02-20 14:05:41,206 INFO L290 TraceCheckUtils]: 116: Hoare triple {4895#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4895#false} is VALID [2022-02-20 14:05:41,206 INFO L290 TraceCheckUtils]: 117: Hoare triple {4895#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4895#false} is VALID [2022-02-20 14:05:41,206 INFO L290 TraceCheckUtils]: 118: Hoare triple {4895#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4895#false} is VALID [2022-02-20 14:05:41,206 INFO L290 TraceCheckUtils]: 119: Hoare triple {4895#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4895#false} is VALID [2022-02-20 14:05:41,206 INFO L290 TraceCheckUtils]: 120: Hoare triple {4895#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4895#false} is VALID [2022-02-20 14:05:41,206 INFO L290 TraceCheckUtils]: 121: Hoare triple {4895#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4895#false} is VALID [2022-02-20 14:05:41,206 INFO L290 TraceCheckUtils]: 122: Hoare triple {4895#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4895#false} is VALID [2022-02-20 14:05:41,206 INFO L290 TraceCheckUtils]: 123: Hoare triple {4895#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4895#false} is VALID [2022-02-20 14:05:41,206 INFO L290 TraceCheckUtils]: 124: Hoare triple {4895#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4895#false} is VALID [2022-02-20 14:05:41,206 INFO L290 TraceCheckUtils]: 125: Hoare triple {4895#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4895#false} is VALID [2022-02-20 14:05:41,206 INFO L290 TraceCheckUtils]: 126: Hoare triple {4895#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4895#false} is VALID [2022-02-20 14:05:41,207 INFO L290 TraceCheckUtils]: 127: Hoare triple {4895#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4895#false} is VALID [2022-02-20 14:05:41,207 INFO L290 TraceCheckUtils]: 128: Hoare triple {4895#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4895#false} is VALID [2022-02-20 14:05:41,207 INFO L290 TraceCheckUtils]: 129: Hoare triple {4895#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4895#false} is VALID [2022-02-20 14:05:41,207 INFO L290 TraceCheckUtils]: 130: Hoare triple {4895#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4895#false} is VALID [2022-02-20 14:05:41,207 INFO L290 TraceCheckUtils]: 131: Hoare triple {4895#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4895#false} is VALID [2022-02-20 14:05:41,207 INFO L290 TraceCheckUtils]: 132: Hoare triple {4895#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4895#false} is VALID [2022-02-20 14:05:41,207 INFO L290 TraceCheckUtils]: 133: Hoare triple {4895#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4895#false} is VALID [2022-02-20 14:05:41,207 INFO L290 TraceCheckUtils]: 134: Hoare triple {4895#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4895#false} is VALID [2022-02-20 14:05:41,207 INFO L290 TraceCheckUtils]: 135: Hoare triple {4895#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4895#false} is VALID [2022-02-20 14:05:41,207 INFO L290 TraceCheckUtils]: 136: Hoare triple {4895#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4895#false} is VALID [2022-02-20 14:05:41,208 INFO L290 TraceCheckUtils]: 137: Hoare triple {4895#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4895#false} is VALID [2022-02-20 14:05:41,208 INFO L290 TraceCheckUtils]: 138: Hoare triple {4895#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4895#false} is VALID [2022-02-20 14:05:41,208 INFO L290 TraceCheckUtils]: 139: Hoare triple {4895#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4895#false} is VALID [2022-02-20 14:05:41,208 INFO L290 TraceCheckUtils]: 140: Hoare triple {4895#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4895#false} is VALID [2022-02-20 14:05:41,208 INFO L290 TraceCheckUtils]: 141: Hoare triple {4895#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4895#false} is VALID [2022-02-20 14:05:41,208 INFO L290 TraceCheckUtils]: 142: Hoare triple {4895#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4895#false} is VALID [2022-02-20 14:05:41,208 INFO L290 TraceCheckUtils]: 143: Hoare triple {4895#false} assume !!(main_~i~0#1 < 100000);call write~int(44, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4895#false} is VALID [2022-02-20 14:05:41,208 INFO L290 TraceCheckUtils]: 144: Hoare triple {4895#false} assume !(main_~i~0#1 < 100000); {4895#false} is VALID [2022-02-20 14:05:41,208 INFO L290 TraceCheckUtils]: 145: Hoare triple {4895#false} main_~i~0#1 := 0; {4895#false} is VALID [2022-02-20 14:05:41,208 INFO L290 TraceCheckUtils]: 146: Hoare triple {4895#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4895#false} is VALID [2022-02-20 14:05:41,208 INFO L290 TraceCheckUtils]: 147: Hoare triple {4895#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4895#false} is VALID [2022-02-20 14:05:41,208 INFO L290 TraceCheckUtils]: 148: Hoare triple {4895#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4895#false} is VALID [2022-02-20 14:05:41,208 INFO L290 TraceCheckUtils]: 149: Hoare triple {4895#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4895#false} is VALID [2022-02-20 14:05:41,209 INFO L290 TraceCheckUtils]: 150: Hoare triple {4895#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4895#false} is VALID [2022-02-20 14:05:41,209 INFO L290 TraceCheckUtils]: 151: Hoare triple {4895#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4895#false} is VALID [2022-02-20 14:05:41,209 INFO L290 TraceCheckUtils]: 152: Hoare triple {4895#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4895#false} is VALID [2022-02-20 14:05:41,209 INFO L290 TraceCheckUtils]: 153: Hoare triple {4895#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4895#false} is VALID [2022-02-20 14:05:41,209 INFO L290 TraceCheckUtils]: 154: Hoare triple {4895#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4895#false} is VALID [2022-02-20 14:05:41,209 INFO L290 TraceCheckUtils]: 155: Hoare triple {4895#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4895#false} is VALID [2022-02-20 14:05:41,209 INFO L290 TraceCheckUtils]: 156: Hoare triple {4895#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4895#false} is VALID [2022-02-20 14:05:41,209 INFO L290 TraceCheckUtils]: 157: Hoare triple {4895#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4895#false} is VALID [2022-02-20 14:05:41,209 INFO L290 TraceCheckUtils]: 158: Hoare triple {4895#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4895#false} is VALID [2022-02-20 14:05:41,209 INFO L290 TraceCheckUtils]: 159: Hoare triple {4895#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4895#false} is VALID [2022-02-20 14:05:41,209 INFO L290 TraceCheckUtils]: 160: Hoare triple {4895#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4895#false} is VALID [2022-02-20 14:05:41,209 INFO L290 TraceCheckUtils]: 161: Hoare triple {4895#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4895#false} is VALID [2022-02-20 14:05:41,210 INFO L290 TraceCheckUtils]: 162: Hoare triple {4895#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4895#false} is VALID [2022-02-20 14:05:41,210 INFO L290 TraceCheckUtils]: 163: Hoare triple {4895#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4895#false} is VALID [2022-02-20 14:05:41,210 INFO L290 TraceCheckUtils]: 164: Hoare triple {4895#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4895#false} is VALID [2022-02-20 14:05:41,210 INFO L290 TraceCheckUtils]: 165: Hoare triple {4895#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4895#false} is VALID [2022-02-20 14:05:41,210 INFO L290 TraceCheckUtils]: 166: Hoare triple {4895#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4895#false} is VALID [2022-02-20 14:05:41,210 INFO L290 TraceCheckUtils]: 167: Hoare triple {4895#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4895#false} is VALID [2022-02-20 14:05:41,210 INFO L290 TraceCheckUtils]: 168: Hoare triple {4895#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4895#false} is VALID [2022-02-20 14:05:41,210 INFO L290 TraceCheckUtils]: 169: Hoare triple {4895#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4895#false} is VALID [2022-02-20 14:05:41,210 INFO L290 TraceCheckUtils]: 170: Hoare triple {4895#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4895#false} is VALID [2022-02-20 14:05:41,210 INFO L290 TraceCheckUtils]: 171: Hoare triple {4895#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4895#false} is VALID [2022-02-20 14:05:41,210 INFO L290 TraceCheckUtils]: 172: Hoare triple {4895#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4895#false} is VALID [2022-02-20 14:05:41,210 INFO L290 TraceCheckUtils]: 173: Hoare triple {4895#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4895#false} is VALID [2022-02-20 14:05:41,211 INFO L290 TraceCheckUtils]: 174: Hoare triple {4895#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4895#false} is VALID [2022-02-20 14:05:41,211 INFO L290 TraceCheckUtils]: 175: Hoare triple {4895#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4895#false} is VALID [2022-02-20 14:05:41,211 INFO L290 TraceCheckUtils]: 176: Hoare triple {4895#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4895#false} is VALID [2022-02-20 14:05:41,211 INFO L290 TraceCheckUtils]: 177: Hoare triple {4895#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4895#false} is VALID [2022-02-20 14:05:41,211 INFO L290 TraceCheckUtils]: 178: Hoare triple {4895#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4895#false} is VALID [2022-02-20 14:05:41,211 INFO L290 TraceCheckUtils]: 179: Hoare triple {4895#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4895#false} is VALID [2022-02-20 14:05:41,211 INFO L290 TraceCheckUtils]: 180: Hoare triple {4895#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4895#false} is VALID [2022-02-20 14:05:41,211 INFO L290 TraceCheckUtils]: 181: Hoare triple {4895#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4895#false} is VALID [2022-02-20 14:05:41,211 INFO L290 TraceCheckUtils]: 182: Hoare triple {4895#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4895#false} is VALID [2022-02-20 14:05:41,211 INFO L290 TraceCheckUtils]: 183: Hoare triple {4895#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4895#false} is VALID [2022-02-20 14:05:41,212 INFO L290 TraceCheckUtils]: 184: Hoare triple {4895#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4895#false} is VALID [2022-02-20 14:05:41,212 INFO L290 TraceCheckUtils]: 185: Hoare triple {4895#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4895#false} is VALID [2022-02-20 14:05:41,212 INFO L290 TraceCheckUtils]: 186: Hoare triple {4895#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4895#false} is VALID [2022-02-20 14:05:41,212 INFO L290 TraceCheckUtils]: 187: Hoare triple {4895#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4895#false} is VALID [2022-02-20 14:05:41,212 INFO L290 TraceCheckUtils]: 188: Hoare triple {4895#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4895#false} is VALID [2022-02-20 14:05:41,212 INFO L290 TraceCheckUtils]: 189: Hoare triple {4895#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4895#false} is VALID [2022-02-20 14:05:41,212 INFO L290 TraceCheckUtils]: 190: Hoare triple {4895#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4895#false} is VALID [2022-02-20 14:05:41,212 INFO L290 TraceCheckUtils]: 191: Hoare triple {4895#false} assume !!(main_~i~0#1 < 100000);call write~int(45, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4895#false} is VALID [2022-02-20 14:05:41,212 INFO L290 TraceCheckUtils]: 192: Hoare triple {4895#false} assume !(main_~i~0#1 < 100000); {4895#false} is VALID [2022-02-20 14:05:41,212 INFO L290 TraceCheckUtils]: 193: Hoare triple {4895#false} main_~i~0#1 := 0; {4895#false} is VALID [2022-02-20 14:05:41,212 INFO L290 TraceCheckUtils]: 194: Hoare triple {4895#false} assume !!(main_~i~0#1 < 100000);call write~int(46, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4895#false} is VALID [2022-02-20 14:05:41,213 INFO L290 TraceCheckUtils]: 195: Hoare triple {4895#false} assume !!(main_~i~0#1 < 100000);call write~int(46, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4895#false} is VALID [2022-02-20 14:05:41,213 INFO L290 TraceCheckUtils]: 196: Hoare triple {4895#false} assume !!(main_~i~0#1 < 100000);call write~int(46, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4895#false} is VALID [2022-02-20 14:05:41,213 INFO L290 TraceCheckUtils]: 197: Hoare triple {4895#false} assume !!(main_~i~0#1 < 100000);call write~int(46, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4895#false} is VALID [2022-02-20 14:05:41,213 INFO L290 TraceCheckUtils]: 198: Hoare triple {4895#false} assume !!(main_~i~0#1 < 100000);call write~int(46, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4895#false} is VALID [2022-02-20 14:05:41,213 INFO L290 TraceCheckUtils]: 199: Hoare triple {4895#false} assume !!(main_~i~0#1 < 100000);call write~int(46, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4895#false} is VALID [2022-02-20 14:05:41,213 INFO L290 TraceCheckUtils]: 200: Hoare triple {4895#false} assume !!(main_~i~0#1 < 100000);call write~int(46, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4895#false} is VALID [2022-02-20 14:05:41,213 INFO L290 TraceCheckUtils]: 201: Hoare triple {4895#false} assume !!(main_~i~0#1 < 100000);call write~int(46, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4895#false} is VALID [2022-02-20 14:05:41,213 INFO L290 TraceCheckUtils]: 202: Hoare triple {4895#false} assume !!(main_~i~0#1 < 100000);call write~int(46, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4895#false} is VALID [2022-02-20 14:05:41,213 INFO L290 TraceCheckUtils]: 203: Hoare triple {4895#false} assume !!(main_~i~0#1 < 100000);call write~int(46, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4895#false} is VALID [2022-02-20 14:05:41,213 INFO L290 TraceCheckUtils]: 204: Hoare triple {4895#false} assume !!(main_~i~0#1 < 100000);call write~int(46, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4895#false} is VALID [2022-02-20 14:05:41,213 INFO L290 TraceCheckUtils]: 205: Hoare triple {4895#false} assume !!(main_~i~0#1 < 100000);call write~int(46, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4895#false} is VALID [2022-02-20 14:05:41,214 INFO L290 TraceCheckUtils]: 206: Hoare triple {4895#false} assume !!(main_~i~0#1 < 100000);call write~int(46, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4895#false} is VALID [2022-02-20 14:05:41,214 INFO L290 TraceCheckUtils]: 207: Hoare triple {4895#false} assume !!(main_~i~0#1 < 100000);call write~int(46, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4895#false} is VALID [2022-02-20 14:05:41,214 INFO L290 TraceCheckUtils]: 208: Hoare triple {4895#false} assume !!(main_~i~0#1 < 100000);call write~int(46, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4895#false} is VALID [2022-02-20 14:05:41,214 INFO L290 TraceCheckUtils]: 209: Hoare triple {4895#false} assume !!(main_~i~0#1 < 100000);call write~int(46, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4895#false} is VALID [2022-02-20 14:05:41,214 INFO L290 TraceCheckUtils]: 210: Hoare triple {4895#false} assume !!(main_~i~0#1 < 100000);call write~int(46, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4895#false} is VALID [2022-02-20 14:05:41,214 INFO L290 TraceCheckUtils]: 211: Hoare triple {4895#false} assume !!(main_~i~0#1 < 100000);call write~int(46, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4895#false} is VALID [2022-02-20 14:05:41,214 INFO L290 TraceCheckUtils]: 212: Hoare triple {4895#false} assume !!(main_~i~0#1 < 100000);call write~int(46, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4895#false} is VALID [2022-02-20 14:05:41,214 INFO L290 TraceCheckUtils]: 213: Hoare triple {4895#false} assume !!(main_~i~0#1 < 100000);call write~int(46, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4895#false} is VALID [2022-02-20 14:05:41,214 INFO L290 TraceCheckUtils]: 214: Hoare triple {4895#false} assume !!(main_~i~0#1 < 100000);call write~int(46, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4895#false} is VALID [2022-02-20 14:05:41,214 INFO L290 TraceCheckUtils]: 215: Hoare triple {4895#false} assume !!(main_~i~0#1 < 100000);call write~int(46, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4895#false} is VALID [2022-02-20 14:05:41,214 INFO L290 TraceCheckUtils]: 216: Hoare triple {4895#false} assume !!(main_~i~0#1 < 100000);call write~int(46, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4895#false} is VALID [2022-02-20 14:05:41,215 INFO L290 TraceCheckUtils]: 217: Hoare triple {4895#false} assume !!(main_~i~0#1 < 100000);call write~int(46, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4895#false} is VALID [2022-02-20 14:05:41,215 INFO L290 TraceCheckUtils]: 218: Hoare triple {4895#false} assume !!(main_~i~0#1 < 100000);call write~int(46, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4895#false} is VALID [2022-02-20 14:05:41,215 INFO L290 TraceCheckUtils]: 219: Hoare triple {4895#false} assume !!(main_~i~0#1 < 100000);call write~int(46, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4895#false} is VALID [2022-02-20 14:05:41,215 INFO L290 TraceCheckUtils]: 220: Hoare triple {4895#false} assume !!(main_~i~0#1 < 100000);call write~int(46, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4895#false} is VALID [2022-02-20 14:05:41,215 INFO L290 TraceCheckUtils]: 221: Hoare triple {4895#false} assume !!(main_~i~0#1 < 100000);call write~int(46, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4895#false} is VALID [2022-02-20 14:05:41,215 INFO L290 TraceCheckUtils]: 222: Hoare triple {4895#false} assume !!(main_~i~0#1 < 100000);call write~int(46, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4895#false} is VALID [2022-02-20 14:05:41,215 INFO L290 TraceCheckUtils]: 223: Hoare triple {4895#false} assume !!(main_~i~0#1 < 100000);call write~int(46, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4895#false} is VALID [2022-02-20 14:05:41,215 INFO L290 TraceCheckUtils]: 224: Hoare triple {4895#false} assume !!(main_~i~0#1 < 100000);call write~int(46, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4895#false} is VALID [2022-02-20 14:05:41,215 INFO L290 TraceCheckUtils]: 225: Hoare triple {4895#false} assume !!(main_~i~0#1 < 100000);call write~int(46, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4895#false} is VALID [2022-02-20 14:05:41,215 INFO L290 TraceCheckUtils]: 226: Hoare triple {4895#false} assume !!(main_~i~0#1 < 100000);call write~int(46, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4895#false} is VALID [2022-02-20 14:05:41,215 INFO L290 TraceCheckUtils]: 227: Hoare triple {4895#false} assume !!(main_~i~0#1 < 100000);call write~int(46, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4895#false} is VALID [2022-02-20 14:05:41,216 INFO L290 TraceCheckUtils]: 228: Hoare triple {4895#false} assume !!(main_~i~0#1 < 100000);call write~int(46, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4895#false} is VALID [2022-02-20 14:05:41,216 INFO L290 TraceCheckUtils]: 229: Hoare triple {4895#false} assume !!(main_~i~0#1 < 100000);call write~int(46, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4895#false} is VALID [2022-02-20 14:05:41,216 INFO L290 TraceCheckUtils]: 230: Hoare triple {4895#false} assume !!(main_~i~0#1 < 100000);call write~int(46, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4895#false} is VALID [2022-02-20 14:05:41,216 INFO L290 TraceCheckUtils]: 231: Hoare triple {4895#false} assume !!(main_~i~0#1 < 100000);call write~int(46, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4895#false} is VALID [2022-02-20 14:05:41,216 INFO L290 TraceCheckUtils]: 232: Hoare triple {4895#false} assume !!(main_~i~0#1 < 100000);call write~int(46, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4895#false} is VALID [2022-02-20 14:05:41,216 INFO L290 TraceCheckUtils]: 233: Hoare triple {4895#false} assume !!(main_~i~0#1 < 100000);call write~int(46, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4895#false} is VALID [2022-02-20 14:05:41,216 INFO L290 TraceCheckUtils]: 234: Hoare triple {4895#false} assume !!(main_~i~0#1 < 100000);call write~int(46, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4895#false} is VALID [2022-02-20 14:05:41,216 INFO L290 TraceCheckUtils]: 235: Hoare triple {4895#false} assume !!(main_~i~0#1 < 100000);call write~int(46, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4895#false} is VALID [2022-02-20 14:05:41,216 INFO L290 TraceCheckUtils]: 236: Hoare triple {4895#false} assume !!(main_~i~0#1 < 100000);call write~int(46, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4895#false} is VALID [2022-02-20 14:05:41,216 INFO L290 TraceCheckUtils]: 237: Hoare triple {4895#false} assume !!(main_~i~0#1 < 100000);call write~int(46, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4895#false} is VALID [2022-02-20 14:05:41,217 INFO L290 TraceCheckUtils]: 238: Hoare triple {4895#false} assume !!(main_~i~0#1 < 100000);call write~int(46, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4895#false} is VALID [2022-02-20 14:05:41,217 INFO L290 TraceCheckUtils]: 239: Hoare triple {4895#false} assume !!(main_~i~0#1 < 100000);call write~int(46, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4895#false} is VALID [2022-02-20 14:05:41,217 INFO L290 TraceCheckUtils]: 240: Hoare triple {4895#false} assume !(main_~i~0#1 < 100000); {4895#false} is VALID [2022-02-20 14:05:41,217 INFO L290 TraceCheckUtils]: 241: Hoare triple {4895#false} havoc main_~x~0#1;main_~x~0#1 := 0; {4895#false} is VALID [2022-02-20 14:05:41,217 INFO L290 TraceCheckUtils]: 242: Hoare triple {4895#false} assume !!(main_~x~0#1 < 100000);call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~x~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 46 == main_#t~mem2#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {4895#false} is VALID [2022-02-20 14:05:41,217 INFO L290 TraceCheckUtils]: 243: Hoare triple {4895#false} assume 0 == __VERIFIER_assert_~cond#1; {4895#false} is VALID [2022-02-20 14:05:41,217 INFO L290 TraceCheckUtils]: 244: Hoare triple {4895#false} assume !false; {4895#false} is VALID [2022-02-20 14:05:41,219 INFO L134 CoverageAnalysis]: Checked inductivity of 5405 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 4324 trivial. 0 not checked. [2022-02-20 14:05:41,219 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:05:41,219 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385744045] [2022-02-20 14:05:41,219 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1385744045] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 14:05:41,219 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [966948335] [2022-02-20 14:05:41,219 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-02-20 14:05:41,219 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:05:41,220 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:05:41,221 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:05:41,221 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process