./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-industry-pattern/array_of_struct_ptr_mul_init.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-industry-pattern/array_of_struct_ptr_mul_init.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 08288106b555461ef057d9cc6ff3152dcec81ba7fba064f1bc055561de30be9f --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 14:09:39,218 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 14:09:39,220 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 14:09:39,260 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 14:09:39,261 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 14:09:39,264 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 14:09:39,265 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 14:09:39,267 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 14:09:39,269 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 14:09:39,273 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 14:09:39,274 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 14:09:39,275 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 14:09:39,275 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 14:09:39,277 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 14:09:39,278 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 14:09:39,281 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 14:09:39,282 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 14:09:39,283 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 14:09:39,284 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 14:09:39,286 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 14:09:39,289 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 14:09:39,290 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 14:09:39,291 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 14:09:39,292 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 14:09:39,295 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 14:09:39,295 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 14:09:39,295 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 14:09:39,297 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 14:09:39,297 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 14:09:39,298 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 14:09:39,298 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 14:09:39,299 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 14:09:39,300 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 14:09:39,301 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 14:09:39,301 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 14:09:39,302 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 14:09:39,302 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 14:09:39,302 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 14:09:39,302 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 14:09:39,303 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 14:09:39,303 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 14:09:39,304 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:09:39,332 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 14:09:39,333 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 14:09:39,333 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 14:09:39,333 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 14:09:39,334 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 14:09:39,334 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 14:09:39,334 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 14:09:39,335 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 14:09:39,335 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 14:09:39,335 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 14:09:39,336 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 14:09:39,336 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 14:09:39,336 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 14:09:39,336 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 14:09:39,336 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 14:09:39,336 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 14:09:39,337 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 14:09:39,337 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 14:09:39,337 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 14:09:39,337 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 14:09:39,337 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 14:09:39,337 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 14:09:39,338 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 14:09:39,338 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 14:09:39,338 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 14:09:39,338 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 14:09:39,338 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 14:09:39,339 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 14:09:39,340 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 14:09:39,340 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 14:09:39,340 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 14:09:39,340 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 14:09:39,340 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 14:09:39,340 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 -> 08288106b555461ef057d9cc6ff3152dcec81ba7fba064f1bc055561de30be9f [2022-02-20 14:09:39,508 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 14:09:39,537 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 14:09:39,540 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 14:09:39,541 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 14:09:39,542 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 14:09:39,543 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-industry-pattern/array_of_struct_ptr_mul_init.i [2022-02-20 14:09:39,612 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7ef11b4bc/6552c6fb3bef4f0e894ed8d569b68f3f/FLAGe6c5a6d82 [2022-02-20 14:09:40,001 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 14:09:40,001 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-industry-pattern/array_of_struct_ptr_mul_init.i [2022-02-20 14:09:40,006 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7ef11b4bc/6552c6fb3bef4f0e894ed8d569b68f3f/FLAGe6c5a6d82 [2022-02-20 14:09:40,018 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7ef11b4bc/6552c6fb3bef4f0e894ed8d569b68f3f [2022-02-20 14:09:40,020 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 14:09:40,021 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 14:09:40,024 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 14:09:40,024 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 14:09:40,026 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 14:09:40,027 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 02:09:40" (1/1) ... [2022-02-20 14:09:40,028 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ca06d17 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:09:40, skipping insertion in model container [2022-02-20 14:09:40,029 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 02:09:40" (1/1) ... [2022-02-20 14:09:40,034 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 14:09:40,043 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 14:09:40,223 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-industry-pattern/array_of_struct_ptr_mul_init.i[821,834] [2022-02-20 14:09:40,266 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 14:09:41,957 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 14:09:41,967 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-industry-pattern/array_of_struct_ptr_mul_init.i[821,834] [2022-02-20 14:09:41,976 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 14:09:41,990 INFO L208 MainTranslator]: Completed translation [2022-02-20 14:09:41,990 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:09:41 WrapperNode [2022-02-20 14:09:41,991 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 14:09:41,992 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 14:09:41,992 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 14:09:41,992 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 14:09:41,998 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:09:41" (1/1) ... [2022-02-20 14:09:42,004 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:09:41" (1/1) ... [2022-02-20 14:09:42,027 INFO L137 Inliner]: procedures = 16, calls = 17, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 70 [2022-02-20 14:09:42,028 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 14:09:42,028 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 14:09:42,029 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 14:09:42,029 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 14:09:42,034 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:09:41" (1/1) ... [2022-02-20 14:09:42,035 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:09:41" (1/1) ... [2022-02-20 14:09:42,043 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:09:41" (1/1) ... [2022-02-20 14:09:42,043 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:09:41" (1/1) ... [2022-02-20 14:09:42,052 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:09:41" (1/1) ... [2022-02-20 14:09:42,056 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:09:41" (1/1) ... [2022-02-20 14:09:42,057 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:09:41" (1/1) ... [2022-02-20 14:09:42,073 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 14:09:42,074 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 14:09:42,075 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 14:09:42,075 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 14:09:42,076 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:09:41" (1/1) ... [2022-02-20 14:09:42,081 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 14:09:42,089 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:09:42,102 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:09:42,122 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:09:42,133 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 14:09:42,133 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 14:09:42,134 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-20 14:09:42,134 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 14:09:42,134 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 14:09:42,134 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-20 14:09:42,179 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 14:09:42,180 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 14:09:42,293 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 14:09:42,298 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 14:09:42,298 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-02-20 14:09:42,299 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 02:09:42 BoogieIcfgContainer [2022-02-20 14:09:42,299 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 14:09:42,300 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 14:09:42,301 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 14:09:42,303 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 14:09:42,303 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 02:09:40" (1/3) ... [2022-02-20 14:09:42,304 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@640f329 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 02:09:42, skipping insertion in model container [2022-02-20 14:09:42,304 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:09:41" (2/3) ... [2022-02-20 14:09:42,304 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@640f329 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 02:09:42, skipping insertion in model container [2022-02-20 14:09:42,305 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 02:09:42" (3/3) ... [2022-02-20 14:09:42,306 INFO L111 eAbstractionObserver]: Analyzing ICFG array_of_struct_ptr_mul_init.i [2022-02-20 14:09:42,309 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 14:09:42,310 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 14:09:42,386 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 14:09:42,391 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:09:42,391 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 14:09:42,402 INFO L276 IsEmpty]: Start isEmpty. Operand has 21 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 20 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:09:42,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-02-20 14:09:42,405 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:09:42,406 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:09:42,406 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:09:42,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:09:42,410 INFO L85 PathProgramCache]: Analyzing trace with hash 542545282, now seen corresponding path program 1 times [2022-02-20 14:09:42,417 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:09:42,418 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136309033] [2022-02-20 14:09:42,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:09:42,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:09:42,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:09:42,562 INFO L290 TraceCheckUtils]: 0: Hoare triple {24#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(31, 2);~#a~0.base, ~#a~0.offset := 3, 0;call #Ultimate.allocInit(400000, 3);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#a~0.base); {24#true} is VALID [2022-02-20 14:09:42,563 INFO L290 TraceCheckUtils]: 1: Hoare triple {24#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post1#1, main_#t~nondet3#1, main_#t~nondet4#1, main_#t~post2#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~mem10#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~short11#1, main_#t~post5#1, main_~k~0#1, main_~i~0#1;havoc main_~k~0#1;havoc main_~i~0#1;main_~i~0#1 := 0; {26#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:09:42,565 INFO L290 TraceCheckUtils]: 2: Hoare triple {26#(= |ULTIMATE.start_main_~i~0#1| 0)} assume !(main_~i~0#1 < 100000); {25#false} is VALID [2022-02-20 14:09:42,565 INFO L290 TraceCheckUtils]: 3: Hoare triple {25#false} main_~i~0#1 := 0; {25#false} is VALID [2022-02-20 14:09:42,565 INFO L290 TraceCheckUtils]: 4: Hoare triple {25#false} assume !true; {25#false} is VALID [2022-02-20 14:09:42,566 INFO L290 TraceCheckUtils]: 5: Hoare triple {25#false} main_~i~0#1 := 0; {25#false} is VALID [2022-02-20 14:09:42,566 INFO L290 TraceCheckUtils]: 6: Hoare triple {25#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem6#1 := read~int(~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 2);call main_#t~mem7#1 := read~int(~#a~0.base, 2 + (~#a~0.offset + 4 * main_~i~0#1), 2);main_#t~short11#1 := main_#t~mem6#1 % 65536 == main_#t~mem7#1 % 65536; {25#false} is VALID [2022-02-20 14:09:42,566 INFO L290 TraceCheckUtils]: 7: Hoare triple {25#false} assume !main_#t~short11#1;call main_#t~mem10#1 := read~int(~#a~0.base, 2 + (~#a~0.offset + 4 * main_~i~0#1), 2);call main_#t~mem8#1 := read~int(~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 2);call main_#t~mem9#1 := read~int(~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 2);main_#t~short11#1 := main_#t~mem10#1 % 65536 == main_#t~mem8#1 % 65536 * (main_#t~mem9#1 % 65536); {25#false} is VALID [2022-02-20 14:09:42,567 INFO L290 TraceCheckUtils]: 8: Hoare triple {25#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~short11#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {25#false} is VALID [2022-02-20 14:09:42,567 INFO L290 TraceCheckUtils]: 9: Hoare triple {25#false} assume 0 == __VERIFIER_assert_~cond#1; {25#false} is VALID [2022-02-20 14:09:42,568 INFO L290 TraceCheckUtils]: 10: Hoare triple {25#false} assume !false; {25#false} is VALID [2022-02-20 14:09:42,569 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:09:42,569 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:09:42,570 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136309033] [2022-02-20 14:09:42,570 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1136309033] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:09:42,570 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:09:42,571 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 14:09:42,574 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025698799] [2022-02-20 14:09:42,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:09:42,578 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-02-20 14:09:42,579 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:09:42,581 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:09:42,605 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:09:42,605 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 14:09:42,607 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:09:42,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 14:09:42,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 14:09:42,632 INFO L87 Difference]: Start difference. First operand has 21 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 20 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:09:42,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:09:42,729 INFO L93 Difference]: Finished difference Result 51 states and 74 transitions. [2022-02-20 14:09:42,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 14:09:42,729 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-02-20 14:09:42,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:09:42,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:09:42,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 74 transitions. [2022-02-20 14:09:42,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:09:42,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 74 transitions. [2022-02-20 14:09:42,748 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 74 transitions. [2022-02-20 14:09:42,813 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:09:42,822 INFO L225 Difference]: With dead ends: 51 [2022-02-20 14:09:42,822 INFO L226 Difference]: Without dead ends: 30 [2022-02-20 14:09:42,832 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:09:42,835 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 12 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 14:09:42,837 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 28 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 14:09:42,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-02-20 14:09:42,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 19. [2022-02-20 14:09:42,855 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:09:42,856 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand has 19 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:09:42,856 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand has 19 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:09:42,856 INFO L87 Difference]: Start difference. First operand 30 states. Second operand has 19 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:09:42,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:09:42,858 INFO L93 Difference]: Finished difference Result 30 states and 36 transitions. [2022-02-20 14:09:42,859 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2022-02-20 14:09:42,859 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:09:42,859 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:09:42,859 INFO L74 IsIncluded]: Start isIncluded. First operand has 19 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 30 states. [2022-02-20 14:09:42,860 INFO L87 Difference]: Start difference. First operand has 19 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 30 states. [2022-02-20 14:09:42,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:09:42,861 INFO L93 Difference]: Finished difference Result 30 states and 36 transitions. [2022-02-20 14:09:42,862 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2022-02-20 14:09:42,862 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:09:42,862 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:09:42,862 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:09:42,862 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:09:42,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:09:42,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions. [2022-02-20 14:09:42,864 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 23 transitions. Word has length 11 [2022-02-20 14:09:42,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:09:42,865 INFO L470 AbstractCegarLoop]: Abstraction has 19 states and 23 transitions. [2022-02-20 14:09:42,865 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:09:42,865 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 23 transitions. [2022-02-20 14:09:42,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-02-20 14:09:42,866 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:09:42,866 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:09:42,866 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 14:09:42,866 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:09:42,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:09:42,867 INFO L85 PathProgramCache]: Analyzing trace with hash 2036151027, now seen corresponding path program 1 times [2022-02-20 14:09:42,867 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:09:42,867 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172972044] [2022-02-20 14:09:42,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:09:42,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:09:42,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:09:42,932 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(31, 2);~#a~0.base, ~#a~0.offset := 3, 0;call #Ultimate.allocInit(400000, 3);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#a~0.base); {174#true} is VALID [2022-02-20 14:09:42,932 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~post1#1, main_#t~nondet3#1, main_#t~nondet4#1, main_#t~post2#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~mem10#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~short11#1, main_#t~post5#1, main_~k~0#1, main_~i~0#1;havoc main_~k~0#1;havoc main_~i~0#1;main_~i~0#1 := 0; {176#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:09:42,933 INFO L290 TraceCheckUtils]: 2: Hoare triple {176#(= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < 100000);call write~int(main_~i~0#1, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 2);call write~int(main_~i~0#1, ~#a~0.base, 2 + (~#a~0.offset + 4 * main_~i~0#1), 2); {176#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:09:42,934 INFO L290 TraceCheckUtils]: 3: Hoare triple {176#(= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {177#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 14:09:42,938 INFO L290 TraceCheckUtils]: 4: Hoare triple {177#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !(main_~i~0#1 < 100000); {175#false} is VALID [2022-02-20 14:09:42,939 INFO L290 TraceCheckUtils]: 5: Hoare triple {175#false} main_~i~0#1 := 0; {175#false} is VALID [2022-02-20 14:09:42,939 INFO L290 TraceCheckUtils]: 6: Hoare triple {175#false} assume !!(main_~i~0#1 < 100000);assume -32768 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 32767; {175#false} is VALID [2022-02-20 14:09:42,939 INFO L290 TraceCheckUtils]: 7: Hoare triple {175#false} assume 0 != main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~k~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;call write~int(main_~k~0#1 % 256, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 2);call write~int(main_~k~0#1 % 256 * (main_~k~0#1 % 256), ~#a~0.base, 2 + (~#a~0.offset + 4 * main_~i~0#1), 2); {175#false} is VALID [2022-02-20 14:09:42,940 INFO L290 TraceCheckUtils]: 8: Hoare triple {175#false} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {175#false} is VALID [2022-02-20 14:09:42,940 INFO L290 TraceCheckUtils]: 9: Hoare triple {175#false} assume !(main_~i~0#1 < 100000); {175#false} is VALID [2022-02-20 14:09:42,941 INFO L290 TraceCheckUtils]: 10: Hoare triple {175#false} main_~i~0#1 := 0; {175#false} is VALID [2022-02-20 14:09:42,941 INFO L290 TraceCheckUtils]: 11: Hoare triple {175#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem6#1 := read~int(~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 2);call main_#t~mem7#1 := read~int(~#a~0.base, 2 + (~#a~0.offset + 4 * main_~i~0#1), 2);main_#t~short11#1 := main_#t~mem6#1 % 65536 == main_#t~mem7#1 % 65536; {175#false} is VALID [2022-02-20 14:09:42,941 INFO L290 TraceCheckUtils]: 12: Hoare triple {175#false} assume !main_#t~short11#1;call main_#t~mem10#1 := read~int(~#a~0.base, 2 + (~#a~0.offset + 4 * main_~i~0#1), 2);call main_#t~mem8#1 := read~int(~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 2);call main_#t~mem9#1 := read~int(~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 2);main_#t~short11#1 := main_#t~mem10#1 % 65536 == main_#t~mem8#1 % 65536 * (main_#t~mem9#1 % 65536); {175#false} is VALID [2022-02-20 14:09:42,941 INFO L290 TraceCheckUtils]: 13: Hoare triple {175#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~short11#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:09:42,941 INFO L290 TraceCheckUtils]: 14: Hoare triple {175#false} assume 0 == __VERIFIER_assert_~cond#1; {175#false} is VALID [2022-02-20 14:09:42,942 INFO L290 TraceCheckUtils]: 15: Hoare triple {175#false} assume !false; {175#false} is VALID [2022-02-20 14:09:42,942 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-20 14:09:42,942 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:09:42,942 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172972044] [2022-02-20 14:09:42,943 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1172972044] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 14:09:42,943 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1347631132] [2022-02-20 14:09:42,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:09:42,943 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:09:42,943 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:09:42,960 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:09:42,964 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:09:43,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:09:43,017 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-20 14:09:43,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:09:43,027 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:09:43,129 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(31, 2);~#a~0.base, ~#a~0.offset := 3, 0;call #Ultimate.allocInit(400000, 3);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#a~0.base); {174#true} is VALID [2022-02-20 14:09:43,130 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~post1#1, main_#t~nondet3#1, main_#t~nondet4#1, main_#t~post2#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~mem10#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~short11#1, main_#t~post5#1, main_~k~0#1, main_~i~0#1;havoc main_~k~0#1;havoc main_~i~0#1;main_~i~0#1 := 0; {184#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:09:43,130 INFO L290 TraceCheckUtils]: 2: Hoare triple {184#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < 100000);call write~int(main_~i~0#1, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 2);call write~int(main_~i~0#1, ~#a~0.base, 2 + (~#a~0.offset + 4 * main_~i~0#1), 2); {184#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:09:43,131 INFO L290 TraceCheckUtils]: 3: Hoare triple {184#(<= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {177#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 14:09:43,131 INFO L290 TraceCheckUtils]: 4: Hoare triple {177#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !(main_~i~0#1 < 100000); {175#false} is VALID [2022-02-20 14:09:43,132 INFO L290 TraceCheckUtils]: 5: Hoare triple {175#false} main_~i~0#1 := 0; {175#false} is VALID [2022-02-20 14:09:43,132 INFO L290 TraceCheckUtils]: 6: Hoare triple {175#false} assume !!(main_~i~0#1 < 100000);assume -32768 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 32767; {175#false} is VALID [2022-02-20 14:09:43,132 INFO L290 TraceCheckUtils]: 7: Hoare triple {175#false} assume 0 != main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~k~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;call write~int(main_~k~0#1 % 256, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 2);call write~int(main_~k~0#1 % 256 * (main_~k~0#1 % 256), ~#a~0.base, 2 + (~#a~0.offset + 4 * main_~i~0#1), 2); {175#false} is VALID [2022-02-20 14:09:43,132 INFO L290 TraceCheckUtils]: 8: Hoare triple {175#false} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {175#false} is VALID [2022-02-20 14:09:43,132 INFO L290 TraceCheckUtils]: 9: Hoare triple {175#false} assume !(main_~i~0#1 < 100000); {175#false} is VALID [2022-02-20 14:09:43,132 INFO L290 TraceCheckUtils]: 10: Hoare triple {175#false} main_~i~0#1 := 0; {175#false} is VALID [2022-02-20 14:09:43,133 INFO L290 TraceCheckUtils]: 11: Hoare triple {175#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem6#1 := read~int(~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 2);call main_#t~mem7#1 := read~int(~#a~0.base, 2 + (~#a~0.offset + 4 * main_~i~0#1), 2);main_#t~short11#1 := main_#t~mem6#1 % 65536 == main_#t~mem7#1 % 65536; {175#false} is VALID [2022-02-20 14:09:43,133 INFO L290 TraceCheckUtils]: 12: Hoare triple {175#false} assume !main_#t~short11#1;call main_#t~mem10#1 := read~int(~#a~0.base, 2 + (~#a~0.offset + 4 * main_~i~0#1), 2);call main_#t~mem8#1 := read~int(~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 2);call main_#t~mem9#1 := read~int(~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 2);main_#t~short11#1 := main_#t~mem10#1 % 65536 == main_#t~mem8#1 % 65536 * (main_#t~mem9#1 % 65536); {175#false} is VALID [2022-02-20 14:09:43,133 INFO L290 TraceCheckUtils]: 13: Hoare triple {175#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~short11#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:09:43,133 INFO L290 TraceCheckUtils]: 14: Hoare triple {175#false} assume 0 == __VERIFIER_assert_~cond#1; {175#false} is VALID [2022-02-20 14:09:43,133 INFO L290 TraceCheckUtils]: 15: Hoare triple {175#false} assume !false; {175#false} is VALID [2022-02-20 14:09:43,134 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-20 14:09:43,134 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 14:09:43,197 INFO L290 TraceCheckUtils]: 15: Hoare triple {175#false} assume !false; {175#false} is VALID [2022-02-20 14:09:43,198 INFO L290 TraceCheckUtils]: 14: Hoare triple {175#false} assume 0 == __VERIFIER_assert_~cond#1; {175#false} is VALID [2022-02-20 14:09:43,198 INFO L290 TraceCheckUtils]: 13: Hoare triple {175#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~short11#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:09:43,198 INFO L290 TraceCheckUtils]: 12: Hoare triple {175#false} assume !main_#t~short11#1;call main_#t~mem10#1 := read~int(~#a~0.base, 2 + (~#a~0.offset + 4 * main_~i~0#1), 2);call main_#t~mem8#1 := read~int(~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 2);call main_#t~mem9#1 := read~int(~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 2);main_#t~short11#1 := main_#t~mem10#1 % 65536 == main_#t~mem8#1 % 65536 * (main_#t~mem9#1 % 65536); {175#false} is VALID [2022-02-20 14:09:43,198 INFO L290 TraceCheckUtils]: 11: Hoare triple {175#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem6#1 := read~int(~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 2);call main_#t~mem7#1 := read~int(~#a~0.base, 2 + (~#a~0.offset + 4 * main_~i~0#1), 2);main_#t~short11#1 := main_#t~mem6#1 % 65536 == main_#t~mem7#1 % 65536; {175#false} is VALID [2022-02-20 14:09:43,199 INFO L290 TraceCheckUtils]: 10: Hoare triple {175#false} main_~i~0#1 := 0; {175#false} is VALID [2022-02-20 14:09:43,199 INFO L290 TraceCheckUtils]: 9: Hoare triple {175#false} assume !(main_~i~0#1 < 100000); {175#false} is VALID [2022-02-20 14:09:43,199 INFO L290 TraceCheckUtils]: 8: Hoare triple {175#false} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {175#false} is VALID [2022-02-20 14:09:43,199 INFO L290 TraceCheckUtils]: 7: Hoare triple {175#false} assume 0 != main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~k~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;call write~int(main_~k~0#1 % 256, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 2);call write~int(main_~k~0#1 % 256 * (main_~k~0#1 % 256), ~#a~0.base, 2 + (~#a~0.offset + 4 * main_~i~0#1), 2); {175#false} is VALID [2022-02-20 14:09:43,199 INFO L290 TraceCheckUtils]: 6: Hoare triple {175#false} assume !!(main_~i~0#1 < 100000);assume -32768 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 32767; {175#false} is VALID [2022-02-20 14:09:43,200 INFO L290 TraceCheckUtils]: 5: Hoare triple {175#false} main_~i~0#1 := 0; {175#false} is VALID [2022-02-20 14:09:43,200 INFO L290 TraceCheckUtils]: 4: Hoare triple {260#(< |ULTIMATE.start_main_~i~0#1| 100000)} assume !(main_~i~0#1 < 100000); {175#false} is VALID [2022-02-20 14:09:43,201 INFO L290 TraceCheckUtils]: 3: Hoare triple {264#(< |ULTIMATE.start_main_~i~0#1| 99999)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {260#(< |ULTIMATE.start_main_~i~0#1| 100000)} is VALID [2022-02-20 14:09:43,201 INFO L290 TraceCheckUtils]: 2: Hoare triple {264#(< |ULTIMATE.start_main_~i~0#1| 99999)} assume !!(main_~i~0#1 < 100000);call write~int(main_~i~0#1, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 2);call write~int(main_~i~0#1, ~#a~0.base, 2 + (~#a~0.offset + 4 * main_~i~0#1), 2); {264#(< |ULTIMATE.start_main_~i~0#1| 99999)} is VALID [2022-02-20 14:09:43,202 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~post1#1, main_#t~nondet3#1, main_#t~nondet4#1, main_#t~post2#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~mem10#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~short11#1, main_#t~post5#1, main_~k~0#1, main_~i~0#1;havoc main_~k~0#1;havoc main_~i~0#1;main_~i~0#1 := 0; {264#(< |ULTIMATE.start_main_~i~0#1| 99999)} is VALID [2022-02-20 14:09:43,202 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(31, 2);~#a~0.base, ~#a~0.offset := 3, 0;call #Ultimate.allocInit(400000, 3);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#a~0.base); {174#true} is VALID [2022-02-20 14:09:43,202 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-20 14:09:43,202 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1347631132] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 14:09:43,203 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 14:09:43,203 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2022-02-20 14:09:43,203 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202786577] [2022-02-20 14:09:43,204 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 14:09:43,204 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-02-20 14:09:43,204 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:09:43,205 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:09:43,220 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:09:43,221 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 14:09:43,221 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:09:43,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 14:09:43,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-02-20 14:09:43,222 INFO L87 Difference]: Start difference. First operand 19 states and 23 transitions. Second operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:09:43,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:09:43,369 INFO L93 Difference]: Finished difference Result 73 states and 92 transitions. [2022-02-20 14:09:43,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 14:09:43,370 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-02-20 14:09:43,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:09:43,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:09:43,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 91 transitions. [2022-02-20 14:09:43,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:09:43,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 91 transitions. [2022-02-20 14:09:43,373 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 91 transitions. [2022-02-20 14:09:43,435 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:09:43,437 INFO L225 Difference]: With dead ends: 73 [2022-02-20 14:09:43,437 INFO L226 Difference]: Without dead ends: 59 [2022-02-20 14:09:43,437 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 29 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:09:43,438 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 94 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 14:09:43,439 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [94 Valid, 42 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 14:09:43,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-02-20 14:09:43,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 34. [2022-02-20 14:09:43,445 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:09:43,446 INFO L82 GeneralOperation]: Start isEquivalent. First operand 59 states. Second operand has 34 states, 33 states have (on average 1.2424242424242424) internal successors, (41), 33 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:09:43,446 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand has 34 states, 33 states have (on average 1.2424242424242424) internal successors, (41), 33 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:09:43,446 INFO L87 Difference]: Start difference. First operand 59 states. Second operand has 34 states, 33 states have (on average 1.2424242424242424) internal successors, (41), 33 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:09:43,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:09:43,448 INFO L93 Difference]: Finished difference Result 59 states and 69 transitions. [2022-02-20 14:09:43,448 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 69 transitions. [2022-02-20 14:09:43,449 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:09:43,449 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:09:43,449 INFO L74 IsIncluded]: Start isIncluded. First operand has 34 states, 33 states have (on average 1.2424242424242424) internal successors, (41), 33 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 59 states. [2022-02-20 14:09:43,449 INFO L87 Difference]: Start difference. First operand has 34 states, 33 states have (on average 1.2424242424242424) internal successors, (41), 33 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 59 states. [2022-02-20 14:09:43,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:09:43,451 INFO L93 Difference]: Finished difference Result 59 states and 69 transitions. [2022-02-20 14:09:43,452 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 69 transitions. [2022-02-20 14:09:43,452 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:09:43,452 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:09:43,452 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:09:43,452 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:09:43,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 33 states have (on average 1.2424242424242424) internal successors, (41), 33 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:09:43,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 41 transitions. [2022-02-20 14:09:43,454 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 41 transitions. Word has length 16 [2022-02-20 14:09:43,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:09:43,454 INFO L470 AbstractCegarLoop]: Abstraction has 34 states and 41 transitions. [2022-02-20 14:09:43,454 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:09:43,455 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 41 transitions. [2022-02-20 14:09:43,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-02-20 14:09:43,455 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:09:43,455 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:09:43,475 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:09:43,672 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:09:43,673 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:09:43,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:09:43,673 INFO L85 PathProgramCache]: Analyzing trace with hash -1366955217, now seen corresponding path program 2 times [2022-02-20 14:09:43,673 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:09:43,673 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123259062] [2022-02-20 14:09:43,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:09:43,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:09:43,717 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 14:09:43,718 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [647811818] [2022-02-20 14:09:43,718 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-20 14:09:43,719 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:09:43,720 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:09:43,721 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:09:43,725 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:09:43,867 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-20 14:09:43,868 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 14:09:43,869 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-20 14:09:43,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:09:43,901 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:09:44,019 INFO L290 TraceCheckUtils]: 0: Hoare triple {527#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(31, 2);~#a~0.base, ~#a~0.offset := 3, 0;call #Ultimate.allocInit(400000, 3);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#a~0.base); {527#true} is VALID [2022-02-20 14:09:44,020 INFO L290 TraceCheckUtils]: 1: Hoare triple {527#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post1#1, main_#t~nondet3#1, main_#t~nondet4#1, main_#t~post2#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~mem10#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~short11#1, main_#t~post5#1, main_~k~0#1, main_~i~0#1;havoc main_~k~0#1;havoc main_~i~0#1;main_~i~0#1 := 0; {535#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:09:44,020 INFO L290 TraceCheckUtils]: 2: Hoare triple {535#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < 100000);call write~int(main_~i~0#1, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 2);call write~int(main_~i~0#1, ~#a~0.base, 2 + (~#a~0.offset + 4 * main_~i~0#1), 2); {535#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:09:44,021 INFO L290 TraceCheckUtils]: 3: Hoare triple {535#(<= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {542#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 14:09:44,021 INFO L290 TraceCheckUtils]: 4: Hoare triple {542#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !!(main_~i~0#1 < 100000);call write~int(main_~i~0#1, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 2);call write~int(main_~i~0#1, ~#a~0.base, 2 + (~#a~0.offset + 4 * main_~i~0#1), 2); {542#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 14:09:44,022 INFO L290 TraceCheckUtils]: 5: Hoare triple {542#(<= |ULTIMATE.start_main_~i~0#1| 1)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {549#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-20 14:09:44,022 INFO L290 TraceCheckUtils]: 6: Hoare triple {549#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !!(main_~i~0#1 < 100000);call write~int(main_~i~0#1, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 2);call write~int(main_~i~0#1, ~#a~0.base, 2 + (~#a~0.offset + 4 * main_~i~0#1), 2); {549#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-20 14:09:44,023 INFO L290 TraceCheckUtils]: 7: Hoare triple {549#(<= |ULTIMATE.start_main_~i~0#1| 2)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {556#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-20 14:09:44,023 INFO L290 TraceCheckUtils]: 8: Hoare triple {556#(<= |ULTIMATE.start_main_~i~0#1| 3)} assume !!(main_~i~0#1 < 100000);call write~int(main_~i~0#1, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 2);call write~int(main_~i~0#1, ~#a~0.base, 2 + (~#a~0.offset + 4 * main_~i~0#1), 2); {556#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-20 14:09:44,024 INFO L290 TraceCheckUtils]: 9: Hoare triple {556#(<= |ULTIMATE.start_main_~i~0#1| 3)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {563#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-20 14:09:44,024 INFO L290 TraceCheckUtils]: 10: Hoare triple {563#(<= |ULTIMATE.start_main_~i~0#1| 4)} assume !(main_~i~0#1 < 100000); {528#false} is VALID [2022-02-20 14:09:44,024 INFO L290 TraceCheckUtils]: 11: Hoare triple {528#false} main_~i~0#1 := 0; {528#false} is VALID [2022-02-20 14:09:44,024 INFO L290 TraceCheckUtils]: 12: Hoare triple {528#false} assume !!(main_~i~0#1 < 100000);assume -32768 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 32767; {528#false} is VALID [2022-02-20 14:09:44,025 INFO L290 TraceCheckUtils]: 13: Hoare triple {528#false} assume 0 != main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~k~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;call write~int(main_~k~0#1 % 256, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 2);call write~int(main_~k~0#1 % 256 * (main_~k~0#1 % 256), ~#a~0.base, 2 + (~#a~0.offset + 4 * main_~i~0#1), 2); {528#false} is VALID [2022-02-20 14:09:44,025 INFO L290 TraceCheckUtils]: 14: Hoare triple {528#false} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {528#false} is VALID [2022-02-20 14:09:44,025 INFO L290 TraceCheckUtils]: 15: Hoare triple {528#false} assume !!(main_~i~0#1 < 100000);assume -32768 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 32767; {528#false} is VALID [2022-02-20 14:09:44,025 INFO L290 TraceCheckUtils]: 16: Hoare triple {528#false} assume 0 != main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~k~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;call write~int(main_~k~0#1 % 256, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 2);call write~int(main_~k~0#1 % 256 * (main_~k~0#1 % 256), ~#a~0.base, 2 + (~#a~0.offset + 4 * main_~i~0#1), 2); {528#false} is VALID [2022-02-20 14:09:44,025 INFO L290 TraceCheckUtils]: 17: Hoare triple {528#false} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {528#false} is VALID [2022-02-20 14:09:44,026 INFO L290 TraceCheckUtils]: 18: Hoare triple {528#false} assume !!(main_~i~0#1 < 100000);assume -32768 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 32767; {528#false} is VALID [2022-02-20 14:09:44,026 INFO L290 TraceCheckUtils]: 19: Hoare triple {528#false} assume 0 != main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~k~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;call write~int(main_~k~0#1 % 256, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 2);call write~int(main_~k~0#1 % 256 * (main_~k~0#1 % 256), ~#a~0.base, 2 + (~#a~0.offset + 4 * main_~i~0#1), 2); {528#false} is VALID [2022-02-20 14:09:44,026 INFO L290 TraceCheckUtils]: 20: Hoare triple {528#false} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {528#false} is VALID [2022-02-20 14:09:44,026 INFO L290 TraceCheckUtils]: 21: Hoare triple {528#false} assume !!(main_~i~0#1 < 100000);assume -32768 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 32767; {528#false} is VALID [2022-02-20 14:09:44,026 INFO L290 TraceCheckUtils]: 22: Hoare triple {528#false} assume 0 != main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~k~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;call write~int(main_~k~0#1 % 256, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 2);call write~int(main_~k~0#1 % 256 * (main_~k~0#1 % 256), ~#a~0.base, 2 + (~#a~0.offset + 4 * main_~i~0#1), 2); {528#false} is VALID [2022-02-20 14:09:44,027 INFO L290 TraceCheckUtils]: 23: Hoare triple {528#false} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {528#false} is VALID [2022-02-20 14:09:44,027 INFO L290 TraceCheckUtils]: 24: Hoare triple {528#false} assume !(main_~i~0#1 < 100000); {528#false} is VALID [2022-02-20 14:09:44,027 INFO L290 TraceCheckUtils]: 25: Hoare triple {528#false} main_~i~0#1 := 0; {528#false} is VALID [2022-02-20 14:09:44,027 INFO L290 TraceCheckUtils]: 26: Hoare triple {528#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem6#1 := read~int(~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 2);call main_#t~mem7#1 := read~int(~#a~0.base, 2 + (~#a~0.offset + 4 * main_~i~0#1), 2);main_#t~short11#1 := main_#t~mem6#1 % 65536 == main_#t~mem7#1 % 65536; {528#false} is VALID [2022-02-20 14:09:44,027 INFO L290 TraceCheckUtils]: 27: Hoare triple {528#false} assume !main_#t~short11#1;call main_#t~mem10#1 := read~int(~#a~0.base, 2 + (~#a~0.offset + 4 * main_~i~0#1), 2);call main_#t~mem8#1 := read~int(~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 2);call main_#t~mem9#1 := read~int(~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 2);main_#t~short11#1 := main_#t~mem10#1 % 65536 == main_#t~mem8#1 % 65536 * (main_#t~mem9#1 % 65536); {528#false} is VALID [2022-02-20 14:09:44,027 INFO L290 TraceCheckUtils]: 28: Hoare triple {528#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~short11#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {528#false} is VALID [2022-02-20 14:09:44,028 INFO L290 TraceCheckUtils]: 29: Hoare triple {528#false} assume 0 == __VERIFIER_assert_~cond#1; {528#false} is VALID [2022-02-20 14:09:44,028 INFO L290 TraceCheckUtils]: 30: Hoare triple {528#false} assume !false; {528#false} is VALID [2022-02-20 14:09:44,028 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-02-20 14:09:44,028 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 14:09:44,164 INFO L290 TraceCheckUtils]: 30: Hoare triple {528#false} assume !false; {528#false} is VALID [2022-02-20 14:09:44,164 INFO L290 TraceCheckUtils]: 29: Hoare triple {528#false} assume 0 == __VERIFIER_assert_~cond#1; {528#false} is VALID [2022-02-20 14:09:44,164 INFO L290 TraceCheckUtils]: 28: Hoare triple {528#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~short11#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {528#false} is VALID [2022-02-20 14:09:44,164 INFO L290 TraceCheckUtils]: 27: Hoare triple {528#false} assume !main_#t~short11#1;call main_#t~mem10#1 := read~int(~#a~0.base, 2 + (~#a~0.offset + 4 * main_~i~0#1), 2);call main_#t~mem8#1 := read~int(~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 2);call main_#t~mem9#1 := read~int(~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 2);main_#t~short11#1 := main_#t~mem10#1 % 65536 == main_#t~mem8#1 % 65536 * (main_#t~mem9#1 % 65536); {528#false} is VALID [2022-02-20 14:09:44,165 INFO L290 TraceCheckUtils]: 26: Hoare triple {528#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem6#1 := read~int(~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 2);call main_#t~mem7#1 := read~int(~#a~0.base, 2 + (~#a~0.offset + 4 * main_~i~0#1), 2);main_#t~short11#1 := main_#t~mem6#1 % 65536 == main_#t~mem7#1 % 65536; {528#false} is VALID [2022-02-20 14:09:44,165 INFO L290 TraceCheckUtils]: 25: Hoare triple {528#false} main_~i~0#1 := 0; {528#false} is VALID [2022-02-20 14:09:44,165 INFO L290 TraceCheckUtils]: 24: Hoare triple {528#false} assume !(main_~i~0#1 < 100000); {528#false} is VALID [2022-02-20 14:09:44,165 INFO L290 TraceCheckUtils]: 23: Hoare triple {528#false} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {528#false} is VALID [2022-02-20 14:09:44,165 INFO L290 TraceCheckUtils]: 22: Hoare triple {528#false} assume 0 != main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~k~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;call write~int(main_~k~0#1 % 256, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 2);call write~int(main_~k~0#1 % 256 * (main_~k~0#1 % 256), ~#a~0.base, 2 + (~#a~0.offset + 4 * main_~i~0#1), 2); {528#false} is VALID [2022-02-20 14:09:44,165 INFO L290 TraceCheckUtils]: 21: Hoare triple {528#false} assume !!(main_~i~0#1 < 100000);assume -32768 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 32767; {528#false} is VALID [2022-02-20 14:09:44,166 INFO L290 TraceCheckUtils]: 20: Hoare triple {528#false} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {528#false} is VALID [2022-02-20 14:09:44,166 INFO L290 TraceCheckUtils]: 19: Hoare triple {528#false} assume 0 != main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~k~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;call write~int(main_~k~0#1 % 256, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 2);call write~int(main_~k~0#1 % 256 * (main_~k~0#1 % 256), ~#a~0.base, 2 + (~#a~0.offset + 4 * main_~i~0#1), 2); {528#false} is VALID [2022-02-20 14:09:44,166 INFO L290 TraceCheckUtils]: 18: Hoare triple {528#false} assume !!(main_~i~0#1 < 100000);assume -32768 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 32767; {528#false} is VALID [2022-02-20 14:09:44,166 INFO L290 TraceCheckUtils]: 17: Hoare triple {528#false} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {528#false} is VALID [2022-02-20 14:09:44,166 INFO L290 TraceCheckUtils]: 16: Hoare triple {528#false} assume 0 != main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~k~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;call write~int(main_~k~0#1 % 256, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 2);call write~int(main_~k~0#1 % 256 * (main_~k~0#1 % 256), ~#a~0.base, 2 + (~#a~0.offset + 4 * main_~i~0#1), 2); {528#false} is VALID [2022-02-20 14:09:44,167 INFO L290 TraceCheckUtils]: 15: Hoare triple {528#false} assume !!(main_~i~0#1 < 100000);assume -32768 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 32767; {528#false} is VALID [2022-02-20 14:09:44,167 INFO L290 TraceCheckUtils]: 14: Hoare triple {528#false} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {528#false} is VALID [2022-02-20 14:09:44,167 INFO L290 TraceCheckUtils]: 13: Hoare triple {528#false} assume 0 != main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~k~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;call write~int(main_~k~0#1 % 256, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 2);call write~int(main_~k~0#1 % 256 * (main_~k~0#1 % 256), ~#a~0.base, 2 + (~#a~0.offset + 4 * main_~i~0#1), 2); {528#false} is VALID [2022-02-20 14:09:44,167 INFO L290 TraceCheckUtils]: 12: Hoare triple {528#false} assume !!(main_~i~0#1 < 100000);assume -32768 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 32767; {528#false} is VALID [2022-02-20 14:09:44,167 INFO L290 TraceCheckUtils]: 11: Hoare triple {528#false} main_~i~0#1 := 0; {528#false} is VALID [2022-02-20 14:09:44,168 INFO L290 TraceCheckUtils]: 10: Hoare triple {687#(< |ULTIMATE.start_main_~i~0#1| 100000)} assume !(main_~i~0#1 < 100000); {528#false} is VALID [2022-02-20 14:09:44,168 INFO L290 TraceCheckUtils]: 9: Hoare triple {691#(< |ULTIMATE.start_main_~i~0#1| 99999)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {687#(< |ULTIMATE.start_main_~i~0#1| 100000)} is VALID [2022-02-20 14:09:44,169 INFO L290 TraceCheckUtils]: 8: Hoare triple {691#(< |ULTIMATE.start_main_~i~0#1| 99999)} assume !!(main_~i~0#1 < 100000);call write~int(main_~i~0#1, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 2);call write~int(main_~i~0#1, ~#a~0.base, 2 + (~#a~0.offset + 4 * main_~i~0#1), 2); {691#(< |ULTIMATE.start_main_~i~0#1| 99999)} is VALID [2022-02-20 14:09:44,169 INFO L290 TraceCheckUtils]: 7: Hoare triple {698#(< |ULTIMATE.start_main_~i~0#1| 99998)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {691#(< |ULTIMATE.start_main_~i~0#1| 99999)} is VALID [2022-02-20 14:09:44,170 INFO L290 TraceCheckUtils]: 6: Hoare triple {698#(< |ULTIMATE.start_main_~i~0#1| 99998)} assume !!(main_~i~0#1 < 100000);call write~int(main_~i~0#1, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 2);call write~int(main_~i~0#1, ~#a~0.base, 2 + (~#a~0.offset + 4 * main_~i~0#1), 2); {698#(< |ULTIMATE.start_main_~i~0#1| 99998)} is VALID [2022-02-20 14:09:44,170 INFO L290 TraceCheckUtils]: 5: Hoare triple {705#(< |ULTIMATE.start_main_~i~0#1| 99997)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {698#(< |ULTIMATE.start_main_~i~0#1| 99998)} is VALID [2022-02-20 14:09:44,171 INFO L290 TraceCheckUtils]: 4: Hoare triple {705#(< |ULTIMATE.start_main_~i~0#1| 99997)} assume !!(main_~i~0#1 < 100000);call write~int(main_~i~0#1, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 2);call write~int(main_~i~0#1, ~#a~0.base, 2 + (~#a~0.offset + 4 * main_~i~0#1), 2); {705#(< |ULTIMATE.start_main_~i~0#1| 99997)} is VALID [2022-02-20 14:09:44,171 INFO L290 TraceCheckUtils]: 3: Hoare triple {712#(< |ULTIMATE.start_main_~i~0#1| 99996)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {705#(< |ULTIMATE.start_main_~i~0#1| 99997)} is VALID [2022-02-20 14:09:44,172 INFO L290 TraceCheckUtils]: 2: Hoare triple {712#(< |ULTIMATE.start_main_~i~0#1| 99996)} assume !!(main_~i~0#1 < 100000);call write~int(main_~i~0#1, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 2);call write~int(main_~i~0#1, ~#a~0.base, 2 + (~#a~0.offset + 4 * main_~i~0#1), 2); {712#(< |ULTIMATE.start_main_~i~0#1| 99996)} is VALID [2022-02-20 14:09:44,172 INFO L290 TraceCheckUtils]: 1: Hoare triple {527#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post1#1, main_#t~nondet3#1, main_#t~nondet4#1, main_#t~post2#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~mem10#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~short11#1, main_#t~post5#1, main_~k~0#1, main_~i~0#1;havoc main_~k~0#1;havoc main_~i~0#1;main_~i~0#1 := 0; {712#(< |ULTIMATE.start_main_~i~0#1| 99996)} is VALID [2022-02-20 14:09:44,172 INFO L290 TraceCheckUtils]: 0: Hoare triple {527#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(31, 2);~#a~0.base, ~#a~0.offset := 3, 0;call #Ultimate.allocInit(400000, 3);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#a~0.base); {527#true} is VALID [2022-02-20 14:09:44,172 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-02-20 14:09:44,173 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:09:44,173 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123259062] [2022-02-20 14:09:44,173 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 14:09:44,173 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [647811818] [2022-02-20 14:09:44,173 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [647811818] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 14:09:44,174 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 14:09:44,174 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2022-02-20 14:09:44,174 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480725332] [2022-02-20 14:09:44,174 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 14:09:44,174 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-02-20 14:09:44,175 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:09:44,175 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:09:44,196 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:09:44,197 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-02-20 14:09:44,197 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:09:44,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-02-20 14:09:44,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2022-02-20 14:09:44,198 INFO L87 Difference]: Start difference. First operand 34 states and 41 transitions. Second operand has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:09:44,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:09:44,528 INFO L93 Difference]: Finished difference Result 160 states and 200 transitions. [2022-02-20 14:09:44,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-20 14:09:44,528 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-02-20 14:09:44,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:09:44,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:09:44,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 187 transitions. [2022-02-20 14:09:44,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:09:44,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 187 transitions. [2022-02-20 14:09:44,533 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 187 transitions. [2022-02-20 14:09:44,662 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 187 edges. 187 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:09:44,665 INFO L225 Difference]: With dead ends: 160 [2022-02-20 14:09:44,665 INFO L226 Difference]: Without dead ends: 137 [2022-02-20 14:09:44,666 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2022-02-20 14:09:44,667 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 257 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 257 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 14:09:44,667 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [257 Valid, 78 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 14:09:44,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2022-02-20 14:09:44,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 64. [2022-02-20 14:09:44,683 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:09:44,684 INFO L82 GeneralOperation]: Start isEquivalent. First operand 137 states. Second operand has 64 states, 63 states have (on average 1.2222222222222223) internal successors, (77), 63 states have internal predecessors, (77), 0 states have call successors, (0), 0 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:09:44,684 INFO L74 IsIncluded]: Start isIncluded. First operand 137 states. Second operand has 64 states, 63 states have (on average 1.2222222222222223) internal successors, (77), 63 states have internal predecessors, (77), 0 states have call successors, (0), 0 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:09:44,685 INFO L87 Difference]: Start difference. First operand 137 states. Second operand has 64 states, 63 states have (on average 1.2222222222222223) internal successors, (77), 63 states have internal predecessors, (77), 0 states have call successors, (0), 0 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:09:44,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:09:44,688 INFO L93 Difference]: Finished difference Result 137 states and 159 transitions. [2022-02-20 14:09:44,688 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 159 transitions. [2022-02-20 14:09:44,689 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:09:44,689 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:09:44,689 INFO L74 IsIncluded]: Start isIncluded. First operand has 64 states, 63 states have (on average 1.2222222222222223) internal successors, (77), 63 states have internal predecessors, (77), 0 states have call successors, (0), 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 137 states. [2022-02-20 14:09:44,690 INFO L87 Difference]: Start difference. First operand has 64 states, 63 states have (on average 1.2222222222222223) internal successors, (77), 63 states have internal predecessors, (77), 0 states have call successors, (0), 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 137 states. [2022-02-20 14:09:44,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:09:44,693 INFO L93 Difference]: Finished difference Result 137 states and 159 transitions. [2022-02-20 14:09:44,693 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 159 transitions. [2022-02-20 14:09:44,694 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:09:44,694 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:09:44,694 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:09:44,694 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:09:44,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 63 states have (on average 1.2222222222222223) internal successors, (77), 63 states have internal predecessors, (77), 0 states have call successors, (0), 0 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:09:44,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 77 transitions. [2022-02-20 14:09:44,696 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 77 transitions. Word has length 31 [2022-02-20 14:09:44,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:09:44,696 INFO L470 AbstractCegarLoop]: Abstraction has 64 states and 77 transitions. [2022-02-20 14:09:44,697 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:09:44,697 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 77 transitions. [2022-02-20 14:09:44,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-02-20 14:09:44,698 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:09:44,698 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:09:44,731 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:09:44,932 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:09:44,932 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:09:44,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:09:44,933 INFO L85 PathProgramCache]: Analyzing trace with hash 67273059, now seen corresponding path program 3 times [2022-02-20 14:09:44,933 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:09:44,933 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877990532] [2022-02-20 14:09:44,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:09:44,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:09:44,981 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 14:09:44,982 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1634525463] [2022-02-20 14:09:44,982 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-20 14:09:44,982 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:09:44,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:09:44,987 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:09:45,009 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:09:49,174 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2022-02-20 14:09:49,174 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 14:09:49,191 INFO L263 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 12 conjunts are in the unsatisfiable core [2022-02-20 14:09:49,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:09:49,213 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:09:49,516 INFO L290 TraceCheckUtils]: 0: Hoare triple {1281#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(31, 2);~#a~0.base, ~#a~0.offset := 3, 0;call #Ultimate.allocInit(400000, 3);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#a~0.base); {1281#true} is VALID [2022-02-20 14:09:49,516 INFO L290 TraceCheckUtils]: 1: Hoare triple {1281#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post1#1, main_#t~nondet3#1, main_#t~nondet4#1, main_#t~post2#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~mem10#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~short11#1, main_#t~post5#1, main_~k~0#1, main_~i~0#1;havoc main_~k~0#1;havoc main_~i~0#1;main_~i~0#1 := 0; {1281#true} is VALID [2022-02-20 14:09:49,517 INFO L290 TraceCheckUtils]: 2: Hoare triple {1281#true} assume !!(main_~i~0#1 < 100000);call write~int(main_~i~0#1, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 2);call write~int(main_~i~0#1, ~#a~0.base, 2 + (~#a~0.offset + 4 * main_~i~0#1), 2); {1281#true} is VALID [2022-02-20 14:09:49,517 INFO L290 TraceCheckUtils]: 3: Hoare triple {1281#true} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1281#true} is VALID [2022-02-20 14:09:49,517 INFO L290 TraceCheckUtils]: 4: Hoare triple {1281#true} assume !!(main_~i~0#1 < 100000);call write~int(main_~i~0#1, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 2);call write~int(main_~i~0#1, ~#a~0.base, 2 + (~#a~0.offset + 4 * main_~i~0#1), 2); {1281#true} is VALID [2022-02-20 14:09:49,517 INFO L290 TraceCheckUtils]: 5: Hoare triple {1281#true} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1281#true} is VALID [2022-02-20 14:09:49,517 INFO L290 TraceCheckUtils]: 6: Hoare triple {1281#true} assume !!(main_~i~0#1 < 100000);call write~int(main_~i~0#1, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 2);call write~int(main_~i~0#1, ~#a~0.base, 2 + (~#a~0.offset + 4 * main_~i~0#1), 2); {1281#true} is VALID [2022-02-20 14:09:49,518 INFO L290 TraceCheckUtils]: 7: Hoare triple {1281#true} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1281#true} is VALID [2022-02-20 14:09:49,518 INFO L290 TraceCheckUtils]: 8: Hoare triple {1281#true} assume !!(main_~i~0#1 < 100000);call write~int(main_~i~0#1, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 2);call write~int(main_~i~0#1, ~#a~0.base, 2 + (~#a~0.offset + 4 * main_~i~0#1), 2); {1281#true} is VALID [2022-02-20 14:09:49,518 INFO L290 TraceCheckUtils]: 9: Hoare triple {1281#true} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1281#true} is VALID [2022-02-20 14:09:49,518 INFO L290 TraceCheckUtils]: 10: Hoare triple {1281#true} assume !!(main_~i~0#1 < 100000);call write~int(main_~i~0#1, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 2);call write~int(main_~i~0#1, ~#a~0.base, 2 + (~#a~0.offset + 4 * main_~i~0#1), 2); {1281#true} is VALID [2022-02-20 14:09:49,518 INFO L290 TraceCheckUtils]: 11: Hoare triple {1281#true} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1281#true} is VALID [2022-02-20 14:09:49,518 INFO L290 TraceCheckUtils]: 12: Hoare triple {1281#true} assume !!(main_~i~0#1 < 100000);call write~int(main_~i~0#1, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 2);call write~int(main_~i~0#1, ~#a~0.base, 2 + (~#a~0.offset + 4 * main_~i~0#1), 2); {1281#true} is VALID [2022-02-20 14:09:49,519 INFO L290 TraceCheckUtils]: 13: Hoare triple {1281#true} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1281#true} is VALID [2022-02-20 14:09:49,519 INFO L290 TraceCheckUtils]: 14: Hoare triple {1281#true} assume !!(main_~i~0#1 < 100000);call write~int(main_~i~0#1, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 2);call write~int(main_~i~0#1, ~#a~0.base, 2 + (~#a~0.offset + 4 * main_~i~0#1), 2); {1281#true} is VALID [2022-02-20 14:09:49,519 INFO L290 TraceCheckUtils]: 15: Hoare triple {1281#true} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1281#true} is VALID [2022-02-20 14:09:49,519 INFO L290 TraceCheckUtils]: 16: Hoare triple {1281#true} assume !!(main_~i~0#1 < 100000);call write~int(main_~i~0#1, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 2);call write~int(main_~i~0#1, ~#a~0.base, 2 + (~#a~0.offset + 4 * main_~i~0#1), 2); {1281#true} is VALID [2022-02-20 14:09:49,519 INFO L290 TraceCheckUtils]: 17: Hoare triple {1281#true} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1281#true} is VALID [2022-02-20 14:09:49,520 INFO L290 TraceCheckUtils]: 18: Hoare triple {1281#true} assume !!(main_~i~0#1 < 100000);call write~int(main_~i~0#1, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 2);call write~int(main_~i~0#1, ~#a~0.base, 2 + (~#a~0.offset + 4 * main_~i~0#1), 2); {1281#true} is VALID [2022-02-20 14:09:49,520 INFO L290 TraceCheckUtils]: 19: Hoare triple {1281#true} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1281#true} is VALID [2022-02-20 14:09:49,520 INFO L290 TraceCheckUtils]: 20: Hoare triple {1281#true} assume !!(main_~i~0#1 < 100000);call write~int(main_~i~0#1, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 2);call write~int(main_~i~0#1, ~#a~0.base, 2 + (~#a~0.offset + 4 * main_~i~0#1), 2); {1281#true} is VALID [2022-02-20 14:09:49,520 INFO L290 TraceCheckUtils]: 21: Hoare triple {1281#true} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1281#true} is VALID [2022-02-20 14:09:49,520 INFO L290 TraceCheckUtils]: 22: Hoare triple {1281#true} assume !(main_~i~0#1 < 100000); {1281#true} is VALID [2022-02-20 14:09:49,521 INFO L290 TraceCheckUtils]: 23: Hoare triple {1281#true} main_~i~0#1 := 0; {1355#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:09:49,521 INFO L290 TraceCheckUtils]: 24: Hoare triple {1355#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < 100000);assume -32768 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 32767; {1355#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:09:49,522 INFO L290 TraceCheckUtils]: 25: Hoare triple {1355#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume 0 != main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~k~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;call write~int(main_~k~0#1 % 256, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 2);call write~int(main_~k~0#1 % 256 * (main_~k~0#1 % 256), ~#a~0.base, 2 + (~#a~0.offset + 4 * main_~i~0#1), 2); {1355#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:09:49,522 INFO L290 TraceCheckUtils]: 26: Hoare triple {1355#(<= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {1365#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 14:09:49,523 INFO L290 TraceCheckUtils]: 27: Hoare triple {1365#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !!(main_~i~0#1 < 100000);assume -32768 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 32767; {1365#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 14:09:49,523 INFO L290 TraceCheckUtils]: 28: Hoare triple {1365#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume 0 != main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~k~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;call write~int(main_~k~0#1 % 256, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 2);call write~int(main_~k~0#1 % 256 * (main_~k~0#1 % 256), ~#a~0.base, 2 + (~#a~0.offset + 4 * main_~i~0#1), 2); {1365#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 14:09:49,523 INFO L290 TraceCheckUtils]: 29: Hoare triple {1365#(<= |ULTIMATE.start_main_~i~0#1| 1)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {1375#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-20 14:09:49,524 INFO L290 TraceCheckUtils]: 30: Hoare triple {1375#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !!(main_~i~0#1 < 100000);assume -32768 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 32767; {1375#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-20 14:09:49,524 INFO L290 TraceCheckUtils]: 31: Hoare triple {1375#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume 0 != main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~k~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;call write~int(main_~k~0#1 % 256, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 2);call write~int(main_~k~0#1 % 256 * (main_~k~0#1 % 256), ~#a~0.base, 2 + (~#a~0.offset + 4 * main_~i~0#1), 2); {1375#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-20 14:09:49,525 INFO L290 TraceCheckUtils]: 32: Hoare triple {1375#(<= |ULTIMATE.start_main_~i~0#1| 2)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {1385#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-20 14:09:49,525 INFO L290 TraceCheckUtils]: 33: Hoare triple {1385#(<= |ULTIMATE.start_main_~i~0#1| 3)} assume !!(main_~i~0#1 < 100000);assume -32768 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 32767; {1385#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-20 14:09:49,525 INFO L290 TraceCheckUtils]: 34: Hoare triple {1385#(<= |ULTIMATE.start_main_~i~0#1| 3)} assume 0 != main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~k~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;call write~int(main_~k~0#1 % 256, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 2);call write~int(main_~k~0#1 % 256 * (main_~k~0#1 % 256), ~#a~0.base, 2 + (~#a~0.offset + 4 * main_~i~0#1), 2); {1385#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-20 14:09:49,526 INFO L290 TraceCheckUtils]: 35: Hoare triple {1385#(<= |ULTIMATE.start_main_~i~0#1| 3)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {1395#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-20 14:09:49,526 INFO L290 TraceCheckUtils]: 36: Hoare triple {1395#(<= |ULTIMATE.start_main_~i~0#1| 4)} assume !!(main_~i~0#1 < 100000);assume -32768 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 32767; {1395#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-20 14:09:49,527 INFO L290 TraceCheckUtils]: 37: Hoare triple {1395#(<= |ULTIMATE.start_main_~i~0#1| 4)} assume 0 != main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~k~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;call write~int(main_~k~0#1 % 256, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 2);call write~int(main_~k~0#1 % 256 * (main_~k~0#1 % 256), ~#a~0.base, 2 + (~#a~0.offset + 4 * main_~i~0#1), 2); {1395#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-20 14:09:49,527 INFO L290 TraceCheckUtils]: 38: Hoare triple {1395#(<= |ULTIMATE.start_main_~i~0#1| 4)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {1405#(<= |ULTIMATE.start_main_~i~0#1| 5)} is VALID [2022-02-20 14:09:49,528 INFO L290 TraceCheckUtils]: 39: Hoare triple {1405#(<= |ULTIMATE.start_main_~i~0#1| 5)} assume !!(main_~i~0#1 < 100000);assume -32768 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 32767; {1405#(<= |ULTIMATE.start_main_~i~0#1| 5)} is VALID [2022-02-20 14:09:49,528 INFO L290 TraceCheckUtils]: 40: Hoare triple {1405#(<= |ULTIMATE.start_main_~i~0#1| 5)} assume 0 != main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~k~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;call write~int(main_~k~0#1 % 256, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 2);call write~int(main_~k~0#1 % 256 * (main_~k~0#1 % 256), ~#a~0.base, 2 + (~#a~0.offset + 4 * main_~i~0#1), 2); {1405#(<= |ULTIMATE.start_main_~i~0#1| 5)} is VALID [2022-02-20 14:09:49,528 INFO L290 TraceCheckUtils]: 41: Hoare triple {1405#(<= |ULTIMATE.start_main_~i~0#1| 5)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {1415#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-20 14:09:49,529 INFO L290 TraceCheckUtils]: 42: Hoare triple {1415#(<= |ULTIMATE.start_main_~i~0#1| 6)} assume !!(main_~i~0#1 < 100000);assume -32768 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 32767; {1415#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-20 14:09:49,529 INFO L290 TraceCheckUtils]: 43: Hoare triple {1415#(<= |ULTIMATE.start_main_~i~0#1| 6)} assume 0 != main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~k~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;call write~int(main_~k~0#1 % 256, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 2);call write~int(main_~k~0#1 % 256 * (main_~k~0#1 % 256), ~#a~0.base, 2 + (~#a~0.offset + 4 * main_~i~0#1), 2); {1415#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-20 14:09:49,530 INFO L290 TraceCheckUtils]: 44: Hoare triple {1415#(<= |ULTIMATE.start_main_~i~0#1| 6)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {1425#(<= |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-20 14:09:49,530 INFO L290 TraceCheckUtils]: 45: Hoare triple {1425#(<= |ULTIMATE.start_main_~i~0#1| 7)} assume !!(main_~i~0#1 < 100000);assume -32768 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 32767; {1425#(<= |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-20 14:09:49,530 INFO L290 TraceCheckUtils]: 46: Hoare triple {1425#(<= |ULTIMATE.start_main_~i~0#1| 7)} assume 0 != main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~k~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;call write~int(main_~k~0#1 % 256, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 2);call write~int(main_~k~0#1 % 256 * (main_~k~0#1 % 256), ~#a~0.base, 2 + (~#a~0.offset + 4 * main_~i~0#1), 2); {1425#(<= |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-20 14:09:49,531 INFO L290 TraceCheckUtils]: 47: Hoare triple {1425#(<= |ULTIMATE.start_main_~i~0#1| 7)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {1435#(<= |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-20 14:09:49,531 INFO L290 TraceCheckUtils]: 48: Hoare triple {1435#(<= |ULTIMATE.start_main_~i~0#1| 8)} assume !!(main_~i~0#1 < 100000);assume -32768 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 32767; {1435#(<= |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-20 14:09:49,532 INFO L290 TraceCheckUtils]: 49: Hoare triple {1435#(<= |ULTIMATE.start_main_~i~0#1| 8)} assume 0 != main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~k~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;call write~int(main_~k~0#1 % 256, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 2);call write~int(main_~k~0#1 % 256 * (main_~k~0#1 % 256), ~#a~0.base, 2 + (~#a~0.offset + 4 * main_~i~0#1), 2); {1435#(<= |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-20 14:09:49,532 INFO L290 TraceCheckUtils]: 50: Hoare triple {1435#(<= |ULTIMATE.start_main_~i~0#1| 8)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {1445#(<= |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-20 14:09:49,532 INFO L290 TraceCheckUtils]: 51: Hoare triple {1445#(<= |ULTIMATE.start_main_~i~0#1| 9)} assume !!(main_~i~0#1 < 100000);assume -32768 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 32767; {1445#(<= |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-20 14:09:49,533 INFO L290 TraceCheckUtils]: 52: Hoare triple {1445#(<= |ULTIMATE.start_main_~i~0#1| 9)} assume 0 != main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~k~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;call write~int(main_~k~0#1 % 256, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 2);call write~int(main_~k~0#1 % 256 * (main_~k~0#1 % 256), ~#a~0.base, 2 + (~#a~0.offset + 4 * main_~i~0#1), 2); {1445#(<= |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-20 14:09:49,533 INFO L290 TraceCheckUtils]: 53: Hoare triple {1445#(<= |ULTIMATE.start_main_~i~0#1| 9)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {1455#(<= |ULTIMATE.start_main_~i~0#1| 10)} is VALID [2022-02-20 14:09:49,534 INFO L290 TraceCheckUtils]: 54: Hoare triple {1455#(<= |ULTIMATE.start_main_~i~0#1| 10)} assume !(main_~i~0#1 < 100000); {1282#false} is VALID [2022-02-20 14:09:49,534 INFO L290 TraceCheckUtils]: 55: Hoare triple {1282#false} main_~i~0#1 := 0; {1282#false} is VALID [2022-02-20 14:09:49,534 INFO L290 TraceCheckUtils]: 56: Hoare triple {1282#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem6#1 := read~int(~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 2);call main_#t~mem7#1 := read~int(~#a~0.base, 2 + (~#a~0.offset + 4 * main_~i~0#1), 2);main_#t~short11#1 := main_#t~mem6#1 % 65536 == main_#t~mem7#1 % 65536; {1282#false} is VALID [2022-02-20 14:09:49,534 INFO L290 TraceCheckUtils]: 57: Hoare triple {1282#false} assume !main_#t~short11#1;call main_#t~mem10#1 := read~int(~#a~0.base, 2 + (~#a~0.offset + 4 * main_~i~0#1), 2);call main_#t~mem8#1 := read~int(~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 2);call main_#t~mem9#1 := read~int(~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 2);main_#t~short11#1 := main_#t~mem10#1 % 65536 == main_#t~mem8#1 % 65536 * (main_#t~mem9#1 % 65536); {1282#false} is VALID [2022-02-20 14:09:49,535 INFO L290 TraceCheckUtils]: 58: Hoare triple {1282#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~short11#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {1282#false} is VALID [2022-02-20 14:09:49,535 INFO L290 TraceCheckUtils]: 59: Hoare triple {1282#false} assume 0 == __VERIFIER_assert_~cond#1; {1282#false} is VALID [2022-02-20 14:09:49,535 INFO L290 TraceCheckUtils]: 60: Hoare triple {1282#false} assume !false; {1282#false} is VALID [2022-02-20 14:09:49,535 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 0 proven. 145 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2022-02-20 14:09:49,536 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 14:09:49,872 INFO L290 TraceCheckUtils]: 60: Hoare triple {1282#false} assume !false; {1282#false} is VALID [2022-02-20 14:09:49,872 INFO L290 TraceCheckUtils]: 59: Hoare triple {1282#false} assume 0 == __VERIFIER_assert_~cond#1; {1282#false} is VALID [2022-02-20 14:09:49,872 INFO L290 TraceCheckUtils]: 58: Hoare triple {1282#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~short11#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {1282#false} is VALID [2022-02-20 14:09:49,872 INFO L290 TraceCheckUtils]: 57: Hoare triple {1282#false} assume !main_#t~short11#1;call main_#t~mem10#1 := read~int(~#a~0.base, 2 + (~#a~0.offset + 4 * main_~i~0#1), 2);call main_#t~mem8#1 := read~int(~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 2);call main_#t~mem9#1 := read~int(~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 2);main_#t~short11#1 := main_#t~mem10#1 % 65536 == main_#t~mem8#1 % 65536 * (main_#t~mem9#1 % 65536); {1282#false} is VALID [2022-02-20 14:09:49,872 INFO L290 TraceCheckUtils]: 56: Hoare triple {1282#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem6#1 := read~int(~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 2);call main_#t~mem7#1 := read~int(~#a~0.base, 2 + (~#a~0.offset + 4 * main_~i~0#1), 2);main_#t~short11#1 := main_#t~mem6#1 % 65536 == main_#t~mem7#1 % 65536; {1282#false} is VALID [2022-02-20 14:09:49,873 INFO L290 TraceCheckUtils]: 55: Hoare triple {1282#false} main_~i~0#1 := 0; {1282#false} is VALID [2022-02-20 14:09:49,873 INFO L290 TraceCheckUtils]: 54: Hoare triple {1495#(< |ULTIMATE.start_main_~i~0#1| 100000)} assume !(main_~i~0#1 < 100000); {1282#false} is VALID [2022-02-20 14:09:49,874 INFO L290 TraceCheckUtils]: 53: Hoare triple {1499#(< |ULTIMATE.start_main_~i~0#1| 99999)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {1495#(< |ULTIMATE.start_main_~i~0#1| 100000)} is VALID [2022-02-20 14:09:49,874 INFO L290 TraceCheckUtils]: 52: Hoare triple {1499#(< |ULTIMATE.start_main_~i~0#1| 99999)} assume 0 != main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~k~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;call write~int(main_~k~0#1 % 256, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 2);call write~int(main_~k~0#1 % 256 * (main_~k~0#1 % 256), ~#a~0.base, 2 + (~#a~0.offset + 4 * main_~i~0#1), 2); {1499#(< |ULTIMATE.start_main_~i~0#1| 99999)} is VALID [2022-02-20 14:09:49,875 INFO L290 TraceCheckUtils]: 51: Hoare triple {1499#(< |ULTIMATE.start_main_~i~0#1| 99999)} assume !!(main_~i~0#1 < 100000);assume -32768 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 32767; {1499#(< |ULTIMATE.start_main_~i~0#1| 99999)} is VALID [2022-02-20 14:09:49,875 INFO L290 TraceCheckUtils]: 50: Hoare triple {1509#(< |ULTIMATE.start_main_~i~0#1| 99998)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {1499#(< |ULTIMATE.start_main_~i~0#1| 99999)} is VALID [2022-02-20 14:09:49,875 INFO L290 TraceCheckUtils]: 49: Hoare triple {1509#(< |ULTIMATE.start_main_~i~0#1| 99998)} assume 0 != main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~k~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;call write~int(main_~k~0#1 % 256, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 2);call write~int(main_~k~0#1 % 256 * (main_~k~0#1 % 256), ~#a~0.base, 2 + (~#a~0.offset + 4 * main_~i~0#1), 2); {1509#(< |ULTIMATE.start_main_~i~0#1| 99998)} is VALID [2022-02-20 14:09:49,876 INFO L290 TraceCheckUtils]: 48: Hoare triple {1509#(< |ULTIMATE.start_main_~i~0#1| 99998)} assume !!(main_~i~0#1 < 100000);assume -32768 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 32767; {1509#(< |ULTIMATE.start_main_~i~0#1| 99998)} is VALID [2022-02-20 14:09:49,876 INFO L290 TraceCheckUtils]: 47: Hoare triple {1519#(< |ULTIMATE.start_main_~i~0#1| 99997)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {1509#(< |ULTIMATE.start_main_~i~0#1| 99998)} is VALID [2022-02-20 14:09:49,877 INFO L290 TraceCheckUtils]: 46: Hoare triple {1519#(< |ULTIMATE.start_main_~i~0#1| 99997)} assume 0 != main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~k~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;call write~int(main_~k~0#1 % 256, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 2);call write~int(main_~k~0#1 % 256 * (main_~k~0#1 % 256), ~#a~0.base, 2 + (~#a~0.offset + 4 * main_~i~0#1), 2); {1519#(< |ULTIMATE.start_main_~i~0#1| 99997)} is VALID [2022-02-20 14:09:49,877 INFO L290 TraceCheckUtils]: 45: Hoare triple {1519#(< |ULTIMATE.start_main_~i~0#1| 99997)} assume !!(main_~i~0#1 < 100000);assume -32768 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 32767; {1519#(< |ULTIMATE.start_main_~i~0#1| 99997)} is VALID [2022-02-20 14:09:49,878 INFO L290 TraceCheckUtils]: 44: Hoare triple {1529#(< |ULTIMATE.start_main_~i~0#1| 99996)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {1519#(< |ULTIMATE.start_main_~i~0#1| 99997)} is VALID [2022-02-20 14:09:49,878 INFO L290 TraceCheckUtils]: 43: Hoare triple {1529#(< |ULTIMATE.start_main_~i~0#1| 99996)} assume 0 != main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~k~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;call write~int(main_~k~0#1 % 256, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 2);call write~int(main_~k~0#1 % 256 * (main_~k~0#1 % 256), ~#a~0.base, 2 + (~#a~0.offset + 4 * main_~i~0#1), 2); {1529#(< |ULTIMATE.start_main_~i~0#1| 99996)} is VALID [2022-02-20 14:09:49,878 INFO L290 TraceCheckUtils]: 42: Hoare triple {1529#(< |ULTIMATE.start_main_~i~0#1| 99996)} assume !!(main_~i~0#1 < 100000);assume -32768 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 32767; {1529#(< |ULTIMATE.start_main_~i~0#1| 99996)} is VALID [2022-02-20 14:09:49,879 INFO L290 TraceCheckUtils]: 41: Hoare triple {1539#(< |ULTIMATE.start_main_~i~0#1| 99995)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {1529#(< |ULTIMATE.start_main_~i~0#1| 99996)} is VALID [2022-02-20 14:09:49,879 INFO L290 TraceCheckUtils]: 40: Hoare triple {1539#(< |ULTIMATE.start_main_~i~0#1| 99995)} assume 0 != main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~k~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;call write~int(main_~k~0#1 % 256, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 2);call write~int(main_~k~0#1 % 256 * (main_~k~0#1 % 256), ~#a~0.base, 2 + (~#a~0.offset + 4 * main_~i~0#1), 2); {1539#(< |ULTIMATE.start_main_~i~0#1| 99995)} is VALID [2022-02-20 14:09:49,879 INFO L290 TraceCheckUtils]: 39: Hoare triple {1539#(< |ULTIMATE.start_main_~i~0#1| 99995)} assume !!(main_~i~0#1 < 100000);assume -32768 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 32767; {1539#(< |ULTIMATE.start_main_~i~0#1| 99995)} is VALID [2022-02-20 14:09:49,880 INFO L290 TraceCheckUtils]: 38: Hoare triple {1549#(< |ULTIMATE.start_main_~i~0#1| 99994)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {1539#(< |ULTIMATE.start_main_~i~0#1| 99995)} is VALID [2022-02-20 14:09:49,880 INFO L290 TraceCheckUtils]: 37: Hoare triple {1549#(< |ULTIMATE.start_main_~i~0#1| 99994)} assume 0 != main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~k~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;call write~int(main_~k~0#1 % 256, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 2);call write~int(main_~k~0#1 % 256 * (main_~k~0#1 % 256), ~#a~0.base, 2 + (~#a~0.offset + 4 * main_~i~0#1), 2); {1549#(< |ULTIMATE.start_main_~i~0#1| 99994)} is VALID [2022-02-20 14:09:49,881 INFO L290 TraceCheckUtils]: 36: Hoare triple {1549#(< |ULTIMATE.start_main_~i~0#1| 99994)} assume !!(main_~i~0#1 < 100000);assume -32768 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 32767; {1549#(< |ULTIMATE.start_main_~i~0#1| 99994)} is VALID [2022-02-20 14:09:49,881 INFO L290 TraceCheckUtils]: 35: Hoare triple {1559#(< |ULTIMATE.start_main_~i~0#1| 99993)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {1549#(< |ULTIMATE.start_main_~i~0#1| 99994)} is VALID [2022-02-20 14:09:49,881 INFO L290 TraceCheckUtils]: 34: Hoare triple {1559#(< |ULTIMATE.start_main_~i~0#1| 99993)} assume 0 != main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~k~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;call write~int(main_~k~0#1 % 256, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 2);call write~int(main_~k~0#1 % 256 * (main_~k~0#1 % 256), ~#a~0.base, 2 + (~#a~0.offset + 4 * main_~i~0#1), 2); {1559#(< |ULTIMATE.start_main_~i~0#1| 99993)} is VALID [2022-02-20 14:09:49,882 INFO L290 TraceCheckUtils]: 33: Hoare triple {1559#(< |ULTIMATE.start_main_~i~0#1| 99993)} assume !!(main_~i~0#1 < 100000);assume -32768 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 32767; {1559#(< |ULTIMATE.start_main_~i~0#1| 99993)} is VALID [2022-02-20 14:09:49,882 INFO L290 TraceCheckUtils]: 32: Hoare triple {1569#(< |ULTIMATE.start_main_~i~0#1| 99992)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {1559#(< |ULTIMATE.start_main_~i~0#1| 99993)} is VALID [2022-02-20 14:09:49,883 INFO L290 TraceCheckUtils]: 31: Hoare triple {1569#(< |ULTIMATE.start_main_~i~0#1| 99992)} assume 0 != main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~k~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;call write~int(main_~k~0#1 % 256, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 2);call write~int(main_~k~0#1 % 256 * (main_~k~0#1 % 256), ~#a~0.base, 2 + (~#a~0.offset + 4 * main_~i~0#1), 2); {1569#(< |ULTIMATE.start_main_~i~0#1| 99992)} is VALID [2022-02-20 14:09:49,883 INFO L290 TraceCheckUtils]: 30: Hoare triple {1569#(< |ULTIMATE.start_main_~i~0#1| 99992)} assume !!(main_~i~0#1 < 100000);assume -32768 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 32767; {1569#(< |ULTIMATE.start_main_~i~0#1| 99992)} is VALID [2022-02-20 14:09:49,883 INFO L290 TraceCheckUtils]: 29: Hoare triple {1579#(< |ULTIMATE.start_main_~i~0#1| 99991)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {1569#(< |ULTIMATE.start_main_~i~0#1| 99992)} is VALID [2022-02-20 14:09:49,884 INFO L290 TraceCheckUtils]: 28: Hoare triple {1579#(< |ULTIMATE.start_main_~i~0#1| 99991)} assume 0 != main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~k~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;call write~int(main_~k~0#1 % 256, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 2);call write~int(main_~k~0#1 % 256 * (main_~k~0#1 % 256), ~#a~0.base, 2 + (~#a~0.offset + 4 * main_~i~0#1), 2); {1579#(< |ULTIMATE.start_main_~i~0#1| 99991)} is VALID [2022-02-20 14:09:49,884 INFO L290 TraceCheckUtils]: 27: Hoare triple {1579#(< |ULTIMATE.start_main_~i~0#1| 99991)} assume !!(main_~i~0#1 < 100000);assume -32768 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 32767; {1579#(< |ULTIMATE.start_main_~i~0#1| 99991)} is VALID [2022-02-20 14:09:49,885 INFO L290 TraceCheckUtils]: 26: Hoare triple {1589#(< |ULTIMATE.start_main_~i~0#1| 99990)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {1579#(< |ULTIMATE.start_main_~i~0#1| 99991)} is VALID [2022-02-20 14:09:49,885 INFO L290 TraceCheckUtils]: 25: Hoare triple {1589#(< |ULTIMATE.start_main_~i~0#1| 99990)} assume 0 != main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~k~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;call write~int(main_~k~0#1 % 256, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 2);call write~int(main_~k~0#1 % 256 * (main_~k~0#1 % 256), ~#a~0.base, 2 + (~#a~0.offset + 4 * main_~i~0#1), 2); {1589#(< |ULTIMATE.start_main_~i~0#1| 99990)} is VALID [2022-02-20 14:09:49,885 INFO L290 TraceCheckUtils]: 24: Hoare triple {1589#(< |ULTIMATE.start_main_~i~0#1| 99990)} assume !!(main_~i~0#1 < 100000);assume -32768 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 32767; {1589#(< |ULTIMATE.start_main_~i~0#1| 99990)} is VALID [2022-02-20 14:09:49,886 INFO L290 TraceCheckUtils]: 23: Hoare triple {1281#true} main_~i~0#1 := 0; {1589#(< |ULTIMATE.start_main_~i~0#1| 99990)} is VALID [2022-02-20 14:09:49,886 INFO L290 TraceCheckUtils]: 22: Hoare triple {1281#true} assume !(main_~i~0#1 < 100000); {1281#true} is VALID [2022-02-20 14:09:49,886 INFO L290 TraceCheckUtils]: 21: Hoare triple {1281#true} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1281#true} is VALID [2022-02-20 14:09:49,886 INFO L290 TraceCheckUtils]: 20: Hoare triple {1281#true} assume !!(main_~i~0#1 < 100000);call write~int(main_~i~0#1, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 2);call write~int(main_~i~0#1, ~#a~0.base, 2 + (~#a~0.offset + 4 * main_~i~0#1), 2); {1281#true} is VALID [2022-02-20 14:09:49,886 INFO L290 TraceCheckUtils]: 19: Hoare triple {1281#true} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1281#true} is VALID [2022-02-20 14:09:49,886 INFO L290 TraceCheckUtils]: 18: Hoare triple {1281#true} assume !!(main_~i~0#1 < 100000);call write~int(main_~i~0#1, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 2);call write~int(main_~i~0#1, ~#a~0.base, 2 + (~#a~0.offset + 4 * main_~i~0#1), 2); {1281#true} is VALID [2022-02-20 14:09:49,887 INFO L290 TraceCheckUtils]: 17: Hoare triple {1281#true} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1281#true} is VALID [2022-02-20 14:09:49,887 INFO L290 TraceCheckUtils]: 16: Hoare triple {1281#true} assume !!(main_~i~0#1 < 100000);call write~int(main_~i~0#1, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 2);call write~int(main_~i~0#1, ~#a~0.base, 2 + (~#a~0.offset + 4 * main_~i~0#1), 2); {1281#true} is VALID [2022-02-20 14:09:49,887 INFO L290 TraceCheckUtils]: 15: Hoare triple {1281#true} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1281#true} is VALID [2022-02-20 14:09:49,887 INFO L290 TraceCheckUtils]: 14: Hoare triple {1281#true} assume !!(main_~i~0#1 < 100000);call write~int(main_~i~0#1, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 2);call write~int(main_~i~0#1, ~#a~0.base, 2 + (~#a~0.offset + 4 * main_~i~0#1), 2); {1281#true} is VALID [2022-02-20 14:09:49,887 INFO L290 TraceCheckUtils]: 13: Hoare triple {1281#true} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1281#true} is VALID [2022-02-20 14:09:49,887 INFO L290 TraceCheckUtils]: 12: Hoare triple {1281#true} assume !!(main_~i~0#1 < 100000);call write~int(main_~i~0#1, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 2);call write~int(main_~i~0#1, ~#a~0.base, 2 + (~#a~0.offset + 4 * main_~i~0#1), 2); {1281#true} is VALID [2022-02-20 14:09:49,887 INFO L290 TraceCheckUtils]: 11: Hoare triple {1281#true} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1281#true} is VALID [2022-02-20 14:09:49,888 INFO L290 TraceCheckUtils]: 10: Hoare triple {1281#true} assume !!(main_~i~0#1 < 100000);call write~int(main_~i~0#1, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 2);call write~int(main_~i~0#1, ~#a~0.base, 2 + (~#a~0.offset + 4 * main_~i~0#1), 2); {1281#true} is VALID [2022-02-20 14:09:49,888 INFO L290 TraceCheckUtils]: 9: Hoare triple {1281#true} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1281#true} is VALID [2022-02-20 14:09:49,888 INFO L290 TraceCheckUtils]: 8: Hoare triple {1281#true} assume !!(main_~i~0#1 < 100000);call write~int(main_~i~0#1, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 2);call write~int(main_~i~0#1, ~#a~0.base, 2 + (~#a~0.offset + 4 * main_~i~0#1), 2); {1281#true} is VALID [2022-02-20 14:09:49,888 INFO L290 TraceCheckUtils]: 7: Hoare triple {1281#true} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1281#true} is VALID [2022-02-20 14:09:49,888 INFO L290 TraceCheckUtils]: 6: Hoare triple {1281#true} assume !!(main_~i~0#1 < 100000);call write~int(main_~i~0#1, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 2);call write~int(main_~i~0#1, ~#a~0.base, 2 + (~#a~0.offset + 4 * main_~i~0#1), 2); {1281#true} is VALID [2022-02-20 14:09:49,888 INFO L290 TraceCheckUtils]: 5: Hoare triple {1281#true} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1281#true} is VALID [2022-02-20 14:09:49,889 INFO L290 TraceCheckUtils]: 4: Hoare triple {1281#true} assume !!(main_~i~0#1 < 100000);call write~int(main_~i~0#1, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 2);call write~int(main_~i~0#1, ~#a~0.base, 2 + (~#a~0.offset + 4 * main_~i~0#1), 2); {1281#true} is VALID [2022-02-20 14:09:49,889 INFO L290 TraceCheckUtils]: 3: Hoare triple {1281#true} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1281#true} is VALID [2022-02-20 14:09:49,889 INFO L290 TraceCheckUtils]: 2: Hoare triple {1281#true} assume !!(main_~i~0#1 < 100000);call write~int(main_~i~0#1, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 2);call write~int(main_~i~0#1, ~#a~0.base, 2 + (~#a~0.offset + 4 * main_~i~0#1), 2); {1281#true} is VALID [2022-02-20 14:09:49,889 INFO L290 TraceCheckUtils]: 1: Hoare triple {1281#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post1#1, main_#t~nondet3#1, main_#t~nondet4#1, main_#t~post2#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~mem10#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~short11#1, main_#t~post5#1, main_~k~0#1, main_~i~0#1;havoc main_~k~0#1;havoc main_~i~0#1;main_~i~0#1 := 0; {1281#true} is VALID [2022-02-20 14:09:49,889 INFO L290 TraceCheckUtils]: 0: Hoare triple {1281#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(31, 2);~#a~0.base, ~#a~0.offset := 3, 0;call #Ultimate.allocInit(400000, 3);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#a~0.base); {1281#true} is VALID [2022-02-20 14:09:49,890 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 0 proven. 145 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2022-02-20 14:09:49,890 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:09:49,890 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877990532] [2022-02-20 14:09:49,890 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 14:09:49,890 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1634525463] [2022-02-20 14:09:49,890 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1634525463] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 14:09:49,891 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 14:09:49,891 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2022-02-20 14:09:49,891 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956269589] [2022-02-20 14:09:49,891 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 14:09:49,892 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 3.125) internal successors, (75), 24 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2022-02-20 14:09:49,892 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:09:49,892 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 24 states, 24 states have (on average 3.125) internal successors, (75), 24 states have internal predecessors, (75), 0 states have call successors, (0), 0 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:09:49,947 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:09:49,947 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-02-20 14:09:49,947 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:09:49,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-02-20 14:09:49,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2022-02-20 14:09:49,948 INFO L87 Difference]: Start difference. First operand 64 states and 77 transitions. Second operand has 24 states, 24 states have (on average 3.125) internal successors, (75), 24 states have internal predecessors, (75), 0 states have call successors, (0), 0 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:09:50,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:09:50,705 INFO L93 Difference]: Finished difference Result 334 states and 416 transitions. [2022-02-20 14:09:50,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-02-20 14:09:50,705 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 3.125) internal successors, (75), 24 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2022-02-20 14:09:50,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:09:50,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 3.125) internal successors, (75), 24 states have internal predecessors, (75), 0 states have call successors, (0), 0 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:09:50,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 379 transitions. [2022-02-20 14:09:50,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 3.125) internal successors, (75), 24 states have internal predecessors, (75), 0 states have call successors, (0), 0 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:09:50,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 379 transitions. [2022-02-20 14:09:50,714 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states and 379 transitions. [2022-02-20 14:09:50,971 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 379 edges. 379 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:09:50,976 INFO L225 Difference]: With dead ends: 334 [2022-02-20 14:09:50,976 INFO L226 Difference]: Without dead ends: 293 [2022-02-20 14:09:50,977 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2022-02-20 14:09:50,977 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 564 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 132 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 564 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 323 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 132 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 14:09:50,978 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [564 Valid, 166 Invalid, 323 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [132 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 14:09:50,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2022-02-20 14:09:51,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 124. [2022-02-20 14:09:51,029 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:09:51,030 INFO L82 GeneralOperation]: Start isEquivalent. First operand 293 states. Second operand has 124 states, 123 states have (on average 1.2113821138211383) internal successors, (149), 123 states have internal predecessors, (149), 0 states have call successors, (0), 0 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:09:51,030 INFO L74 IsIncluded]: Start isIncluded. First operand 293 states. Second operand has 124 states, 123 states have (on average 1.2113821138211383) internal successors, (149), 123 states have internal predecessors, (149), 0 states have call successors, (0), 0 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:09:51,030 INFO L87 Difference]: Start difference. First operand 293 states. Second operand has 124 states, 123 states have (on average 1.2113821138211383) internal successors, (149), 123 states have internal predecessors, (149), 0 states have call successors, (0), 0 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:09:51,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:09:51,036 INFO L93 Difference]: Finished difference Result 293 states and 339 transitions. [2022-02-20 14:09:51,036 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 339 transitions. [2022-02-20 14:09:51,037 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:09:51,037 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:09:51,037 INFO L74 IsIncluded]: Start isIncluded. First operand has 124 states, 123 states have (on average 1.2113821138211383) internal successors, (149), 123 states have internal predecessors, (149), 0 states have call successors, (0), 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 293 states. [2022-02-20 14:09:51,037 INFO L87 Difference]: Start difference. First operand has 124 states, 123 states have (on average 1.2113821138211383) internal successors, (149), 123 states have internal predecessors, (149), 0 states have call successors, (0), 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 293 states. [2022-02-20 14:09:51,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:09:51,043 INFO L93 Difference]: Finished difference Result 293 states and 339 transitions. [2022-02-20 14:09:51,043 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 339 transitions. [2022-02-20 14:09:51,043 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:09:51,044 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:09:51,044 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:09:51,044 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:09:51,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 123 states have (on average 1.2113821138211383) internal successors, (149), 123 states have internal predecessors, (149), 0 states have call successors, (0), 0 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:09:51,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 149 transitions. [2022-02-20 14:09:51,046 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 149 transitions. Word has length 61 [2022-02-20 14:09:51,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:09:51,046 INFO L470 AbstractCegarLoop]: Abstraction has 124 states and 149 transitions. [2022-02-20 14:09:51,047 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 3.125) internal successors, (75), 24 states have internal predecessors, (75), 0 states have call successors, (0), 0 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:09:51,047 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 149 transitions. [2022-02-20 14:09:51,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-02-20 14:09:51,049 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:09:51,049 INFO L514 BasicCegarLoop]: trace histogram [22, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:09:51,063 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-02-20 14:09:51,263 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:09:51,264 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:09:51,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:09:51,264 INFO L85 PathProgramCache]: Analyzing trace with hash 1367348683, now seen corresponding path program 4 times [2022-02-20 14:09:51,264 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:09:51,264 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661854700] [2022-02-20 14:09:51,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:09:51,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:09:51,355 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 14:09:51,355 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1813320661] [2022-02-20 14:09:51,355 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-02-20 14:09:51,355 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:09:51,355 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:09:51,356 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:09:51,357 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:09:51,502 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-02-20 14:09:51,502 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 14:09:51,505 INFO L263 TraceCheckSpWp]: Trace formula consists of 566 conjuncts, 24 conjunts are in the unsatisfiable core [2022-02-20 14:09:51,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:09:51,538 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:09:52,208 INFO L290 TraceCheckUtils]: 0: Hoare triple {2839#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(31, 2);~#a~0.base, ~#a~0.offset := 3, 0;call #Ultimate.allocInit(400000, 3);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#a~0.base); {2839#true} is VALID [2022-02-20 14:09:52,209 INFO L290 TraceCheckUtils]: 1: Hoare triple {2839#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post1#1, main_#t~nondet3#1, main_#t~nondet4#1, main_#t~post2#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~mem10#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~short11#1, main_#t~post5#1, main_~k~0#1, main_~i~0#1;havoc main_~k~0#1;havoc main_~i~0#1;main_~i~0#1 := 0; {2847#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:09:52,209 INFO L290 TraceCheckUtils]: 2: Hoare triple {2847#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < 100000);call write~int(main_~i~0#1, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 2);call write~int(main_~i~0#1, ~#a~0.base, 2 + (~#a~0.offset + 4 * main_~i~0#1), 2); {2847#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:09:52,210 INFO L290 TraceCheckUtils]: 3: Hoare triple {2847#(<= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {2854#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 14:09:52,210 INFO L290 TraceCheckUtils]: 4: Hoare triple {2854#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !!(main_~i~0#1 < 100000);call write~int(main_~i~0#1, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 2);call write~int(main_~i~0#1, ~#a~0.base, 2 + (~#a~0.offset + 4 * main_~i~0#1), 2); {2854#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 14:09:52,211 INFO L290 TraceCheckUtils]: 5: Hoare triple {2854#(<= |ULTIMATE.start_main_~i~0#1| 1)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {2861#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-20 14:09:52,211 INFO L290 TraceCheckUtils]: 6: Hoare triple {2861#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !!(main_~i~0#1 < 100000);call write~int(main_~i~0#1, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 2);call write~int(main_~i~0#1, ~#a~0.base, 2 + (~#a~0.offset + 4 * main_~i~0#1), 2); {2861#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-20 14:09:52,212 INFO L290 TraceCheckUtils]: 7: Hoare triple {2861#(<= |ULTIMATE.start_main_~i~0#1| 2)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {2868#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-20 14:09:52,212 INFO L290 TraceCheckUtils]: 8: Hoare triple {2868#(<= |ULTIMATE.start_main_~i~0#1| 3)} assume !!(main_~i~0#1 < 100000);call write~int(main_~i~0#1, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 2);call write~int(main_~i~0#1, ~#a~0.base, 2 + (~#a~0.offset + 4 * main_~i~0#1), 2); {2868#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-20 14:09:52,213 INFO L290 TraceCheckUtils]: 9: Hoare triple {2868#(<= |ULTIMATE.start_main_~i~0#1| 3)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {2875#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-20 14:09:52,213 INFO L290 TraceCheckUtils]: 10: Hoare triple {2875#(<= |ULTIMATE.start_main_~i~0#1| 4)} assume !!(main_~i~0#1 < 100000);call write~int(main_~i~0#1, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 2);call write~int(main_~i~0#1, ~#a~0.base, 2 + (~#a~0.offset + 4 * main_~i~0#1), 2); {2875#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-20 14:09:52,213 INFO L290 TraceCheckUtils]: 11: Hoare triple {2875#(<= |ULTIMATE.start_main_~i~0#1| 4)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {2882#(<= |ULTIMATE.start_main_~i~0#1| 5)} is VALID [2022-02-20 14:09:52,214 INFO L290 TraceCheckUtils]: 12: Hoare triple {2882#(<= |ULTIMATE.start_main_~i~0#1| 5)} assume !!(main_~i~0#1 < 100000);call write~int(main_~i~0#1, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 2);call write~int(main_~i~0#1, ~#a~0.base, 2 + (~#a~0.offset + 4 * main_~i~0#1), 2); {2882#(<= |ULTIMATE.start_main_~i~0#1| 5)} is VALID [2022-02-20 14:09:52,214 INFO L290 TraceCheckUtils]: 13: Hoare triple {2882#(<= |ULTIMATE.start_main_~i~0#1| 5)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {2889#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-20 14:09:52,215 INFO L290 TraceCheckUtils]: 14: Hoare triple {2889#(<= |ULTIMATE.start_main_~i~0#1| 6)} assume !!(main_~i~0#1 < 100000);call write~int(main_~i~0#1, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 2);call write~int(main_~i~0#1, ~#a~0.base, 2 + (~#a~0.offset + 4 * main_~i~0#1), 2); {2889#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-20 14:09:52,215 INFO L290 TraceCheckUtils]: 15: Hoare triple {2889#(<= |ULTIMATE.start_main_~i~0#1| 6)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {2896#(<= |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-20 14:09:52,215 INFO L290 TraceCheckUtils]: 16: Hoare triple {2896#(<= |ULTIMATE.start_main_~i~0#1| 7)} assume !!(main_~i~0#1 < 100000);call write~int(main_~i~0#1, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 2);call write~int(main_~i~0#1, ~#a~0.base, 2 + (~#a~0.offset + 4 * main_~i~0#1), 2); {2896#(<= |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-20 14:09:52,216 INFO L290 TraceCheckUtils]: 17: Hoare triple {2896#(<= |ULTIMATE.start_main_~i~0#1| 7)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {2903#(<= |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-20 14:09:52,216 INFO L290 TraceCheckUtils]: 18: Hoare triple {2903#(<= |ULTIMATE.start_main_~i~0#1| 8)} assume !!(main_~i~0#1 < 100000);call write~int(main_~i~0#1, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 2);call write~int(main_~i~0#1, ~#a~0.base, 2 + (~#a~0.offset + 4 * main_~i~0#1), 2); {2903#(<= |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-20 14:09:52,217 INFO L290 TraceCheckUtils]: 19: Hoare triple {2903#(<= |ULTIMATE.start_main_~i~0#1| 8)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {2910#(<= |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-20 14:09:52,217 INFO L290 TraceCheckUtils]: 20: Hoare triple {2910#(<= |ULTIMATE.start_main_~i~0#1| 9)} assume !!(main_~i~0#1 < 100000);call write~int(main_~i~0#1, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 2);call write~int(main_~i~0#1, ~#a~0.base, 2 + (~#a~0.offset + 4 * main_~i~0#1), 2); {2910#(<= |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-20 14:09:52,218 INFO L290 TraceCheckUtils]: 21: Hoare triple {2910#(<= |ULTIMATE.start_main_~i~0#1| 9)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {2917#(<= |ULTIMATE.start_main_~i~0#1| 10)} is VALID [2022-02-20 14:09:52,218 INFO L290 TraceCheckUtils]: 22: Hoare triple {2917#(<= |ULTIMATE.start_main_~i~0#1| 10)} assume !!(main_~i~0#1 < 100000);call write~int(main_~i~0#1, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 2);call write~int(main_~i~0#1, ~#a~0.base, 2 + (~#a~0.offset + 4 * main_~i~0#1), 2); {2917#(<= |ULTIMATE.start_main_~i~0#1| 10)} is VALID [2022-02-20 14:09:52,218 INFO L290 TraceCheckUtils]: 23: Hoare triple {2917#(<= |ULTIMATE.start_main_~i~0#1| 10)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {2924#(<= |ULTIMATE.start_main_~i~0#1| 11)} is VALID [2022-02-20 14:09:52,219 INFO L290 TraceCheckUtils]: 24: Hoare triple {2924#(<= |ULTIMATE.start_main_~i~0#1| 11)} assume !!(main_~i~0#1 < 100000);call write~int(main_~i~0#1, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 2);call write~int(main_~i~0#1, ~#a~0.base, 2 + (~#a~0.offset + 4 * main_~i~0#1), 2); {2924#(<= |ULTIMATE.start_main_~i~0#1| 11)} is VALID [2022-02-20 14:09:52,219 INFO L290 TraceCheckUtils]: 25: Hoare triple {2924#(<= |ULTIMATE.start_main_~i~0#1| 11)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {2931#(<= |ULTIMATE.start_main_~i~0#1| 12)} is VALID [2022-02-20 14:09:52,220 INFO L290 TraceCheckUtils]: 26: Hoare triple {2931#(<= |ULTIMATE.start_main_~i~0#1| 12)} assume !!(main_~i~0#1 < 100000);call write~int(main_~i~0#1, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 2);call write~int(main_~i~0#1, ~#a~0.base, 2 + (~#a~0.offset + 4 * main_~i~0#1), 2); {2931#(<= |ULTIMATE.start_main_~i~0#1| 12)} is VALID [2022-02-20 14:09:52,220 INFO L290 TraceCheckUtils]: 27: Hoare triple {2931#(<= |ULTIMATE.start_main_~i~0#1| 12)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {2938#(<= |ULTIMATE.start_main_~i~0#1| 13)} is VALID [2022-02-20 14:09:52,220 INFO L290 TraceCheckUtils]: 28: Hoare triple {2938#(<= |ULTIMATE.start_main_~i~0#1| 13)} assume !!(main_~i~0#1 < 100000);call write~int(main_~i~0#1, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 2);call write~int(main_~i~0#1, ~#a~0.base, 2 + (~#a~0.offset + 4 * main_~i~0#1), 2); {2938#(<= |ULTIMATE.start_main_~i~0#1| 13)} is VALID [2022-02-20 14:09:52,221 INFO L290 TraceCheckUtils]: 29: Hoare triple {2938#(<= |ULTIMATE.start_main_~i~0#1| 13)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {2945#(<= |ULTIMATE.start_main_~i~0#1| 14)} is VALID [2022-02-20 14:09:52,221 INFO L290 TraceCheckUtils]: 30: Hoare triple {2945#(<= |ULTIMATE.start_main_~i~0#1| 14)} assume !!(main_~i~0#1 < 100000);call write~int(main_~i~0#1, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 2);call write~int(main_~i~0#1, ~#a~0.base, 2 + (~#a~0.offset + 4 * main_~i~0#1), 2); {2945#(<= |ULTIMATE.start_main_~i~0#1| 14)} is VALID [2022-02-20 14:09:52,222 INFO L290 TraceCheckUtils]: 31: Hoare triple {2945#(<= |ULTIMATE.start_main_~i~0#1| 14)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {2952#(<= |ULTIMATE.start_main_~i~0#1| 15)} is VALID [2022-02-20 14:09:52,222 INFO L290 TraceCheckUtils]: 32: Hoare triple {2952#(<= |ULTIMATE.start_main_~i~0#1| 15)} assume !!(main_~i~0#1 < 100000);call write~int(main_~i~0#1, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 2);call write~int(main_~i~0#1, ~#a~0.base, 2 + (~#a~0.offset + 4 * main_~i~0#1), 2); {2952#(<= |ULTIMATE.start_main_~i~0#1| 15)} is VALID [2022-02-20 14:09:52,222 INFO L290 TraceCheckUtils]: 33: Hoare triple {2952#(<= |ULTIMATE.start_main_~i~0#1| 15)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {2959#(<= |ULTIMATE.start_main_~i~0#1| 16)} is VALID [2022-02-20 14:09:52,223 INFO L290 TraceCheckUtils]: 34: Hoare triple {2959#(<= |ULTIMATE.start_main_~i~0#1| 16)} assume !!(main_~i~0#1 < 100000);call write~int(main_~i~0#1, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 2);call write~int(main_~i~0#1, ~#a~0.base, 2 + (~#a~0.offset + 4 * main_~i~0#1), 2); {2959#(<= |ULTIMATE.start_main_~i~0#1| 16)} is VALID [2022-02-20 14:09:52,228 INFO L290 TraceCheckUtils]: 35: Hoare triple {2959#(<= |ULTIMATE.start_main_~i~0#1| 16)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {2966#(<= |ULTIMATE.start_main_~i~0#1| 17)} is VALID [2022-02-20 14:09:52,228 INFO L290 TraceCheckUtils]: 36: Hoare triple {2966#(<= |ULTIMATE.start_main_~i~0#1| 17)} assume !!(main_~i~0#1 < 100000);call write~int(main_~i~0#1, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 2);call write~int(main_~i~0#1, ~#a~0.base, 2 + (~#a~0.offset + 4 * main_~i~0#1), 2); {2966#(<= |ULTIMATE.start_main_~i~0#1| 17)} is VALID [2022-02-20 14:09:52,229 INFO L290 TraceCheckUtils]: 37: Hoare triple {2966#(<= |ULTIMATE.start_main_~i~0#1| 17)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {2973#(<= |ULTIMATE.start_main_~i~0#1| 18)} is VALID [2022-02-20 14:09:52,229 INFO L290 TraceCheckUtils]: 38: Hoare triple {2973#(<= |ULTIMATE.start_main_~i~0#1| 18)} assume !!(main_~i~0#1 < 100000);call write~int(main_~i~0#1, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 2);call write~int(main_~i~0#1, ~#a~0.base, 2 + (~#a~0.offset + 4 * main_~i~0#1), 2); {2973#(<= |ULTIMATE.start_main_~i~0#1| 18)} is VALID [2022-02-20 14:09:52,229 INFO L290 TraceCheckUtils]: 39: Hoare triple {2973#(<= |ULTIMATE.start_main_~i~0#1| 18)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {2980#(<= |ULTIMATE.start_main_~i~0#1| 19)} is VALID [2022-02-20 14:09:52,230 INFO L290 TraceCheckUtils]: 40: Hoare triple {2980#(<= |ULTIMATE.start_main_~i~0#1| 19)} assume !!(main_~i~0#1 < 100000);call write~int(main_~i~0#1, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 2);call write~int(main_~i~0#1, ~#a~0.base, 2 + (~#a~0.offset + 4 * main_~i~0#1), 2); {2980#(<= |ULTIMATE.start_main_~i~0#1| 19)} is VALID [2022-02-20 14:09:52,230 INFO L290 TraceCheckUtils]: 41: Hoare triple {2980#(<= |ULTIMATE.start_main_~i~0#1| 19)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {2987#(<= |ULTIMATE.start_main_~i~0#1| 20)} is VALID [2022-02-20 14:09:52,230 INFO L290 TraceCheckUtils]: 42: Hoare triple {2987#(<= |ULTIMATE.start_main_~i~0#1| 20)} assume !!(main_~i~0#1 < 100000);call write~int(main_~i~0#1, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 2);call write~int(main_~i~0#1, ~#a~0.base, 2 + (~#a~0.offset + 4 * main_~i~0#1), 2); {2987#(<= |ULTIMATE.start_main_~i~0#1| 20)} is VALID [2022-02-20 14:09:52,231 INFO L290 TraceCheckUtils]: 43: Hoare triple {2987#(<= |ULTIMATE.start_main_~i~0#1| 20)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {2994#(<= |ULTIMATE.start_main_~i~0#1| 21)} is VALID [2022-02-20 14:09:52,231 INFO L290 TraceCheckUtils]: 44: Hoare triple {2994#(<= |ULTIMATE.start_main_~i~0#1| 21)} assume !!(main_~i~0#1 < 100000);call write~int(main_~i~0#1, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 2);call write~int(main_~i~0#1, ~#a~0.base, 2 + (~#a~0.offset + 4 * main_~i~0#1), 2); {2994#(<= |ULTIMATE.start_main_~i~0#1| 21)} is VALID [2022-02-20 14:09:52,232 INFO L290 TraceCheckUtils]: 45: Hoare triple {2994#(<= |ULTIMATE.start_main_~i~0#1| 21)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {3001#(<= |ULTIMATE.start_main_~i~0#1| 22)} is VALID [2022-02-20 14:09:52,232 INFO L290 TraceCheckUtils]: 46: Hoare triple {3001#(<= |ULTIMATE.start_main_~i~0#1| 22)} assume !(main_~i~0#1 < 100000); {2840#false} is VALID [2022-02-20 14:09:52,232 INFO L290 TraceCheckUtils]: 47: Hoare triple {2840#false} main_~i~0#1 := 0; {2840#false} is VALID [2022-02-20 14:09:52,232 INFO L290 TraceCheckUtils]: 48: Hoare triple {2840#false} assume !!(main_~i~0#1 < 100000);assume -32768 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 32767; {2840#false} is VALID [2022-02-20 14:09:52,233 INFO L290 TraceCheckUtils]: 49: Hoare triple {2840#false} assume 0 != main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~k~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;call write~int(main_~k~0#1 % 256, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 2);call write~int(main_~k~0#1 % 256 * (main_~k~0#1 % 256), ~#a~0.base, 2 + (~#a~0.offset + 4 * main_~i~0#1), 2); {2840#false} is VALID [2022-02-20 14:09:52,233 INFO L290 TraceCheckUtils]: 50: Hoare triple {2840#false} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {2840#false} is VALID [2022-02-20 14:09:52,233 INFO L290 TraceCheckUtils]: 51: Hoare triple {2840#false} assume !!(main_~i~0#1 < 100000);assume -32768 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 32767; {2840#false} is VALID [2022-02-20 14:09:52,233 INFO L290 TraceCheckUtils]: 52: Hoare triple {2840#false} assume 0 != main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~k~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;call write~int(main_~k~0#1 % 256, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 2);call write~int(main_~k~0#1 % 256 * (main_~k~0#1 % 256), ~#a~0.base, 2 + (~#a~0.offset + 4 * main_~i~0#1), 2); {2840#false} is VALID [2022-02-20 14:09:52,233 INFO L290 TraceCheckUtils]: 53: Hoare triple {2840#false} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {2840#false} is VALID [2022-02-20 14:09:52,233 INFO L290 TraceCheckUtils]: 54: Hoare triple {2840#false} assume !!(main_~i~0#1 < 100000);assume -32768 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 32767; {2840#false} is VALID [2022-02-20 14:09:52,233 INFO L290 TraceCheckUtils]: 55: Hoare triple {2840#false} assume 0 != main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~k~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;call write~int(main_~k~0#1 % 256, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 2);call write~int(main_~k~0#1 % 256 * (main_~k~0#1 % 256), ~#a~0.base, 2 + (~#a~0.offset + 4 * main_~i~0#1), 2); {2840#false} is VALID [2022-02-20 14:09:52,233 INFO L290 TraceCheckUtils]: 56: Hoare triple {2840#false} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {2840#false} is VALID [2022-02-20 14:09:52,234 INFO L290 TraceCheckUtils]: 57: Hoare triple {2840#false} assume !!(main_~i~0#1 < 100000);assume -32768 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 32767; {2840#false} is VALID [2022-02-20 14:09:52,234 INFO L290 TraceCheckUtils]: 58: Hoare triple {2840#false} assume 0 != main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~k~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;call write~int(main_~k~0#1 % 256, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 2);call write~int(main_~k~0#1 % 256 * (main_~k~0#1 % 256), ~#a~0.base, 2 + (~#a~0.offset + 4 * main_~i~0#1), 2); {2840#false} is VALID [2022-02-20 14:09:52,234 INFO L290 TraceCheckUtils]: 59: Hoare triple {2840#false} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {2840#false} is VALID [2022-02-20 14:09:52,234 INFO L290 TraceCheckUtils]: 60: Hoare triple {2840#false} assume !!(main_~i~0#1 < 100000);assume -32768 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 32767; {2840#false} is VALID [2022-02-20 14:09:52,234 INFO L290 TraceCheckUtils]: 61: Hoare triple {2840#false} assume 0 != main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~k~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;call write~int(main_~k~0#1 % 256, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 2);call write~int(main_~k~0#1 % 256 * (main_~k~0#1 % 256), ~#a~0.base, 2 + (~#a~0.offset + 4 * main_~i~0#1), 2); {2840#false} is VALID [2022-02-20 14:09:52,234 INFO L290 TraceCheckUtils]: 62: Hoare triple {2840#false} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {2840#false} is VALID [2022-02-20 14:09:52,234 INFO L290 TraceCheckUtils]: 63: Hoare triple {2840#false} assume !!(main_~i~0#1 < 100000);assume -32768 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 32767; {2840#false} is VALID [2022-02-20 14:09:52,234 INFO L290 TraceCheckUtils]: 64: Hoare triple {2840#false} assume 0 != main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~k~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;call write~int(main_~k~0#1 % 256, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 2);call write~int(main_~k~0#1 % 256 * (main_~k~0#1 % 256), ~#a~0.base, 2 + (~#a~0.offset + 4 * main_~i~0#1), 2); {2840#false} is VALID [2022-02-20 14:09:52,235 INFO L290 TraceCheckUtils]: 65: Hoare triple {2840#false} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {2840#false} is VALID [2022-02-20 14:09:52,235 INFO L290 TraceCheckUtils]: 66: Hoare triple {2840#false} assume !!(main_~i~0#1 < 100000);assume -32768 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 32767; {2840#false} is VALID [2022-02-20 14:09:52,235 INFO L290 TraceCheckUtils]: 67: Hoare triple {2840#false} assume 0 != main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~k~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;call write~int(main_~k~0#1 % 256, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 2);call write~int(main_~k~0#1 % 256 * (main_~k~0#1 % 256), ~#a~0.base, 2 + (~#a~0.offset + 4 * main_~i~0#1), 2); {2840#false} is VALID [2022-02-20 14:09:52,235 INFO L290 TraceCheckUtils]: 68: Hoare triple {2840#false} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {2840#false} is VALID [2022-02-20 14:09:52,235 INFO L290 TraceCheckUtils]: 69: Hoare triple {2840#false} assume !!(main_~i~0#1 < 100000);assume -32768 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 32767; {2840#false} is VALID [2022-02-20 14:09:52,235 INFO L290 TraceCheckUtils]: 70: Hoare triple {2840#false} assume 0 != main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~k~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;call write~int(main_~k~0#1 % 256, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 2);call write~int(main_~k~0#1 % 256 * (main_~k~0#1 % 256), ~#a~0.base, 2 + (~#a~0.offset + 4 * main_~i~0#1), 2); {2840#false} is VALID [2022-02-20 14:09:52,235 INFO L290 TraceCheckUtils]: 71: Hoare triple {2840#false} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {2840#false} is VALID [2022-02-20 14:09:52,236 INFO L290 TraceCheckUtils]: 72: Hoare triple {2840#false} assume !!(main_~i~0#1 < 100000);assume -32768 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 32767; {2840#false} is VALID [2022-02-20 14:09:52,236 INFO L290 TraceCheckUtils]: 73: Hoare triple {2840#false} assume 0 != main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~k~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;call write~int(main_~k~0#1 % 256, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 2);call write~int(main_~k~0#1 % 256 * (main_~k~0#1 % 256), ~#a~0.base, 2 + (~#a~0.offset + 4 * main_~i~0#1), 2); {2840#false} is VALID [2022-02-20 14:09:52,236 INFO L290 TraceCheckUtils]: 74: Hoare triple {2840#false} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {2840#false} is VALID [2022-02-20 14:09:52,236 INFO L290 TraceCheckUtils]: 75: Hoare triple {2840#false} assume !!(main_~i~0#1 < 100000);assume -32768 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 32767; {2840#false} is VALID [2022-02-20 14:09:52,236 INFO L290 TraceCheckUtils]: 76: Hoare triple {2840#false} assume 0 != main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~k~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;call write~int(main_~k~0#1 % 256, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 2);call write~int(main_~k~0#1 % 256 * (main_~k~0#1 % 256), ~#a~0.base, 2 + (~#a~0.offset + 4 * main_~i~0#1), 2); {2840#false} is VALID [2022-02-20 14:09:52,236 INFO L290 TraceCheckUtils]: 77: Hoare triple {2840#false} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {2840#false} is VALID [2022-02-20 14:09:52,236 INFO L290 TraceCheckUtils]: 78: Hoare triple {2840#false} assume !!(main_~i~0#1 < 100000);assume -32768 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 32767; {2840#false} is VALID [2022-02-20 14:09:52,236 INFO L290 TraceCheckUtils]: 79: Hoare triple {2840#false} assume 0 != main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~k~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;call write~int(main_~k~0#1 % 256, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 2);call write~int(main_~k~0#1 % 256 * (main_~k~0#1 % 256), ~#a~0.base, 2 + (~#a~0.offset + 4 * main_~i~0#1), 2); {2840#false} is VALID [2022-02-20 14:09:52,237 INFO L290 TraceCheckUtils]: 80: Hoare triple {2840#false} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {2840#false} is VALID [2022-02-20 14:09:52,237 INFO L290 TraceCheckUtils]: 81: Hoare triple {2840#false} assume !!(main_~i~0#1 < 100000);assume -32768 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 32767; {2840#false} is VALID [2022-02-20 14:09:52,237 INFO L290 TraceCheckUtils]: 82: Hoare triple {2840#false} assume 0 != main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~k~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;call write~int(main_~k~0#1 % 256, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 2);call write~int(main_~k~0#1 % 256 * (main_~k~0#1 % 256), ~#a~0.base, 2 + (~#a~0.offset + 4 * main_~i~0#1), 2); {2840#false} is VALID [2022-02-20 14:09:52,237 INFO L290 TraceCheckUtils]: 83: Hoare triple {2840#false} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {2840#false} is VALID [2022-02-20 14:09:52,237 INFO L290 TraceCheckUtils]: 84: Hoare triple {2840#false} assume !!(main_~i~0#1 < 100000);assume -32768 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 32767; {2840#false} is VALID [2022-02-20 14:09:52,237 INFO L290 TraceCheckUtils]: 85: Hoare triple {2840#false} assume 0 != main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~k~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;call write~int(main_~k~0#1 % 256, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 2);call write~int(main_~k~0#1 % 256 * (main_~k~0#1 % 256), ~#a~0.base, 2 + (~#a~0.offset + 4 * main_~i~0#1), 2); {2840#false} is VALID [2022-02-20 14:09:52,237 INFO L290 TraceCheckUtils]: 86: Hoare triple {2840#false} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {2840#false} is VALID [2022-02-20 14:09:52,237 INFO L290 TraceCheckUtils]: 87: Hoare triple {2840#false} assume !!(main_~i~0#1 < 100000);assume -32768 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 32767; {2840#false} is VALID [2022-02-20 14:09:52,238 INFO L290 TraceCheckUtils]: 88: Hoare triple {2840#false} assume 0 != main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~k~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;call write~int(main_~k~0#1 % 256, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 2);call write~int(main_~k~0#1 % 256 * (main_~k~0#1 % 256), ~#a~0.base, 2 + (~#a~0.offset + 4 * main_~i~0#1), 2); {2840#false} is VALID [2022-02-20 14:09:52,238 INFO L290 TraceCheckUtils]: 89: Hoare triple {2840#false} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {2840#false} is VALID [2022-02-20 14:09:52,238 INFO L290 TraceCheckUtils]: 90: Hoare triple {2840#false} assume !!(main_~i~0#1 < 100000);assume -32768 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 32767; {2840#false} is VALID [2022-02-20 14:09:52,238 INFO L290 TraceCheckUtils]: 91: Hoare triple {2840#false} assume 0 != main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~k~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;call write~int(main_~k~0#1 % 256, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 2);call write~int(main_~k~0#1 % 256 * (main_~k~0#1 % 256), ~#a~0.base, 2 + (~#a~0.offset + 4 * main_~i~0#1), 2); {2840#false} is VALID [2022-02-20 14:09:52,238 INFO L290 TraceCheckUtils]: 92: Hoare triple {2840#false} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {2840#false} is VALID [2022-02-20 14:09:52,238 INFO L290 TraceCheckUtils]: 93: Hoare triple {2840#false} assume !!(main_~i~0#1 < 100000);assume -32768 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 32767; {2840#false} is VALID [2022-02-20 14:09:52,238 INFO L290 TraceCheckUtils]: 94: Hoare triple {2840#false} assume 0 != main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~k~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;call write~int(main_~k~0#1 % 256, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 2);call write~int(main_~k~0#1 % 256 * (main_~k~0#1 % 256), ~#a~0.base, 2 + (~#a~0.offset + 4 * main_~i~0#1), 2); {2840#false} is VALID [2022-02-20 14:09:52,238 INFO L290 TraceCheckUtils]: 95: Hoare triple {2840#false} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {2840#false} is VALID [2022-02-20 14:09:52,239 INFO L290 TraceCheckUtils]: 96: Hoare triple {2840#false} assume !!(main_~i~0#1 < 100000);assume -32768 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 32767; {2840#false} is VALID [2022-02-20 14:09:52,239 INFO L290 TraceCheckUtils]: 97: Hoare triple {2840#false} assume 0 != main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~k~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;call write~int(main_~k~0#1 % 256, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 2);call write~int(main_~k~0#1 % 256 * (main_~k~0#1 % 256), ~#a~0.base, 2 + (~#a~0.offset + 4 * main_~i~0#1), 2); {2840#false} is VALID [2022-02-20 14:09:52,239 INFO L290 TraceCheckUtils]: 98: Hoare triple {2840#false} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {2840#false} is VALID [2022-02-20 14:09:52,239 INFO L290 TraceCheckUtils]: 99: Hoare triple {2840#false} assume !!(main_~i~0#1 < 100000);assume -32768 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 32767; {2840#false} is VALID [2022-02-20 14:09:52,239 INFO L290 TraceCheckUtils]: 100: Hoare triple {2840#false} assume 0 != main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~k~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;call write~int(main_~k~0#1 % 256, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 2);call write~int(main_~k~0#1 % 256 * (main_~k~0#1 % 256), ~#a~0.base, 2 + (~#a~0.offset + 4 * main_~i~0#1), 2); {2840#false} is VALID [2022-02-20 14:09:52,239 INFO L290 TraceCheckUtils]: 101: Hoare triple {2840#false} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {2840#false} is VALID [2022-02-20 14:09:52,239 INFO L290 TraceCheckUtils]: 102: Hoare triple {2840#false} assume !!(main_~i~0#1 < 100000);assume -32768 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 32767; {2840#false} is VALID [2022-02-20 14:09:52,239 INFO L290 TraceCheckUtils]: 103: Hoare triple {2840#false} assume 0 != main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~k~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;call write~int(main_~k~0#1 % 256, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 2);call write~int(main_~k~0#1 % 256 * (main_~k~0#1 % 256), ~#a~0.base, 2 + (~#a~0.offset + 4 * main_~i~0#1), 2); {2840#false} is VALID [2022-02-20 14:09:52,240 INFO L290 TraceCheckUtils]: 104: Hoare triple {2840#false} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {2840#false} is VALID [2022-02-20 14:09:52,240 INFO L290 TraceCheckUtils]: 105: Hoare triple {2840#false} assume !!(main_~i~0#1 < 100000);assume -32768 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 32767; {2840#false} is VALID [2022-02-20 14:09:52,240 INFO L290 TraceCheckUtils]: 106: Hoare triple {2840#false} assume 0 != main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~k~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;call write~int(main_~k~0#1 % 256, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 2);call write~int(main_~k~0#1 % 256 * (main_~k~0#1 % 256), ~#a~0.base, 2 + (~#a~0.offset + 4 * main_~i~0#1), 2); {2840#false} is VALID [2022-02-20 14:09:52,240 INFO L290 TraceCheckUtils]: 107: Hoare triple {2840#false} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {2840#false} is VALID [2022-02-20 14:09:52,240 INFO L290 TraceCheckUtils]: 108: Hoare triple {2840#false} assume !!(main_~i~0#1 < 100000);assume -32768 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 32767; {2840#false} is VALID [2022-02-20 14:09:52,240 INFO L290 TraceCheckUtils]: 109: Hoare triple {2840#false} assume 0 != main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~k~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;call write~int(main_~k~0#1 % 256, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 2);call write~int(main_~k~0#1 % 256 * (main_~k~0#1 % 256), ~#a~0.base, 2 + (~#a~0.offset + 4 * main_~i~0#1), 2); {2840#false} is VALID [2022-02-20 14:09:52,240 INFO L290 TraceCheckUtils]: 110: Hoare triple {2840#false} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {2840#false} is VALID [2022-02-20 14:09:52,241 INFO L290 TraceCheckUtils]: 111: Hoare triple {2840#false} assume !!(main_~i~0#1 < 100000);assume -32768 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 32767; {2840#false} is VALID [2022-02-20 14:09:52,241 INFO L290 TraceCheckUtils]: 112: Hoare triple {2840#false} assume 0 != main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~k~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;call write~int(main_~k~0#1 % 256, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 2);call write~int(main_~k~0#1 % 256 * (main_~k~0#1 % 256), ~#a~0.base, 2 + (~#a~0.offset + 4 * main_~i~0#1), 2); {2840#false} is VALID [2022-02-20 14:09:52,241 INFO L290 TraceCheckUtils]: 113: Hoare triple {2840#false} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {2840#false} is VALID [2022-02-20 14:09:52,241 INFO L290 TraceCheckUtils]: 114: Hoare triple {2840#false} assume !(main_~i~0#1 < 100000); {2840#false} is VALID [2022-02-20 14:09:52,241 INFO L290 TraceCheckUtils]: 115: Hoare triple {2840#false} main_~i~0#1 := 0; {2840#false} is VALID [2022-02-20 14:09:52,241 INFO L290 TraceCheckUtils]: 116: Hoare triple {2840#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem6#1 := read~int(~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 2);call main_#t~mem7#1 := read~int(~#a~0.base, 2 + (~#a~0.offset + 4 * main_~i~0#1), 2);main_#t~short11#1 := main_#t~mem6#1 % 65536 == main_#t~mem7#1 % 65536; {2840#false} is VALID [2022-02-20 14:09:52,241 INFO L290 TraceCheckUtils]: 117: Hoare triple {2840#false} assume !main_#t~short11#1;call main_#t~mem10#1 := read~int(~#a~0.base, 2 + (~#a~0.offset + 4 * main_~i~0#1), 2);call main_#t~mem8#1 := read~int(~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 2);call main_#t~mem9#1 := read~int(~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 2);main_#t~short11#1 := main_#t~mem10#1 % 65536 == main_#t~mem8#1 % 65536 * (main_#t~mem9#1 % 65536); {2840#false} is VALID [2022-02-20 14:09:52,241 INFO L290 TraceCheckUtils]: 118: Hoare triple {2840#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~short11#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {2840#false} is VALID [2022-02-20 14:09:52,242 INFO L290 TraceCheckUtils]: 119: Hoare triple {2840#false} assume 0 == __VERIFIER_assert_~cond#1; {2840#false} is VALID [2022-02-20 14:09:52,250 INFO L290 TraceCheckUtils]: 120: Hoare triple {2840#false} assume !false; {2840#false} is VALID [2022-02-20 14:09:52,251 INFO L134 CoverageAnalysis]: Checked inductivity of 1199 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 715 trivial. 0 not checked. [2022-02-20 14:09:52,251 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 14:09:53,233 INFO L290 TraceCheckUtils]: 120: Hoare triple {2840#false} assume !false; {2840#false} is VALID [2022-02-20 14:09:53,233 INFO L290 TraceCheckUtils]: 119: Hoare triple {2840#false} assume 0 == __VERIFIER_assert_~cond#1; {2840#false} is VALID [2022-02-20 14:09:53,233 INFO L290 TraceCheckUtils]: 118: Hoare triple {2840#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~short11#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {2840#false} is VALID [2022-02-20 14:09:53,233 INFO L290 TraceCheckUtils]: 117: Hoare triple {2840#false} assume !main_#t~short11#1;call main_#t~mem10#1 := read~int(~#a~0.base, 2 + (~#a~0.offset + 4 * main_~i~0#1), 2);call main_#t~mem8#1 := read~int(~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 2);call main_#t~mem9#1 := read~int(~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 2);main_#t~short11#1 := main_#t~mem10#1 % 65536 == main_#t~mem8#1 % 65536 * (main_#t~mem9#1 % 65536); {2840#false} is VALID [2022-02-20 14:09:53,233 INFO L290 TraceCheckUtils]: 116: Hoare triple {2840#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem6#1 := read~int(~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 2);call main_#t~mem7#1 := read~int(~#a~0.base, 2 + (~#a~0.offset + 4 * main_~i~0#1), 2);main_#t~short11#1 := main_#t~mem6#1 % 65536 == main_#t~mem7#1 % 65536; {2840#false} is VALID [2022-02-20 14:09:53,234 INFO L290 TraceCheckUtils]: 115: Hoare triple {2840#false} main_~i~0#1 := 0; {2840#false} is VALID [2022-02-20 14:09:53,234 INFO L290 TraceCheckUtils]: 114: Hoare triple {2840#false} assume !(main_~i~0#1 < 100000); {2840#false} is VALID [2022-02-20 14:09:53,234 INFO L290 TraceCheckUtils]: 113: Hoare triple {2840#false} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {2840#false} is VALID [2022-02-20 14:09:53,234 INFO L290 TraceCheckUtils]: 112: Hoare triple {2840#false} assume 0 != main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~k~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;call write~int(main_~k~0#1 % 256, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 2);call write~int(main_~k~0#1 % 256 * (main_~k~0#1 % 256), ~#a~0.base, 2 + (~#a~0.offset + 4 * main_~i~0#1), 2); {2840#false} is VALID [2022-02-20 14:09:53,234 INFO L290 TraceCheckUtils]: 111: Hoare triple {2840#false} assume !!(main_~i~0#1 < 100000);assume -32768 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 32767; {2840#false} is VALID [2022-02-20 14:09:53,234 INFO L290 TraceCheckUtils]: 110: Hoare triple {2840#false} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {2840#false} is VALID [2022-02-20 14:09:53,234 INFO L290 TraceCheckUtils]: 109: Hoare triple {2840#false} assume 0 != main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~k~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;call write~int(main_~k~0#1 % 256, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 2);call write~int(main_~k~0#1 % 256 * (main_~k~0#1 % 256), ~#a~0.base, 2 + (~#a~0.offset + 4 * main_~i~0#1), 2); {2840#false} is VALID [2022-02-20 14:09:53,234 INFO L290 TraceCheckUtils]: 108: Hoare triple {2840#false} assume !!(main_~i~0#1 < 100000);assume -32768 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 32767; {2840#false} is VALID [2022-02-20 14:09:53,234 INFO L290 TraceCheckUtils]: 107: Hoare triple {2840#false} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {2840#false} is VALID [2022-02-20 14:09:53,234 INFO L290 TraceCheckUtils]: 106: Hoare triple {2840#false} assume 0 != main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~k~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;call write~int(main_~k~0#1 % 256, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 2);call write~int(main_~k~0#1 % 256 * (main_~k~0#1 % 256), ~#a~0.base, 2 + (~#a~0.offset + 4 * main_~i~0#1), 2); {2840#false} is VALID [2022-02-20 14:09:53,234 INFO L290 TraceCheckUtils]: 105: Hoare triple {2840#false} assume !!(main_~i~0#1 < 100000);assume -32768 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 32767; {2840#false} is VALID [2022-02-20 14:09:53,235 INFO L290 TraceCheckUtils]: 104: Hoare triple {2840#false} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {2840#false} is VALID [2022-02-20 14:09:53,235 INFO L290 TraceCheckUtils]: 103: Hoare triple {2840#false} assume 0 != main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~k~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;call write~int(main_~k~0#1 % 256, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 2);call write~int(main_~k~0#1 % 256 * (main_~k~0#1 % 256), ~#a~0.base, 2 + (~#a~0.offset + 4 * main_~i~0#1), 2); {2840#false} is VALID [2022-02-20 14:09:53,235 INFO L290 TraceCheckUtils]: 102: Hoare triple {2840#false} assume !!(main_~i~0#1 < 100000);assume -32768 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 32767; {2840#false} is VALID [2022-02-20 14:09:53,235 INFO L290 TraceCheckUtils]: 101: Hoare triple {2840#false} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {2840#false} is VALID [2022-02-20 14:09:53,235 INFO L290 TraceCheckUtils]: 100: Hoare triple {2840#false} assume 0 != main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~k~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;call write~int(main_~k~0#1 % 256, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 2);call write~int(main_~k~0#1 % 256 * (main_~k~0#1 % 256), ~#a~0.base, 2 + (~#a~0.offset + 4 * main_~i~0#1), 2); {2840#false} is VALID [2022-02-20 14:09:53,235 INFO L290 TraceCheckUtils]: 99: Hoare triple {2840#false} assume !!(main_~i~0#1 < 100000);assume -32768 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 32767; {2840#false} is VALID [2022-02-20 14:09:53,235 INFO L290 TraceCheckUtils]: 98: Hoare triple {2840#false} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {2840#false} is VALID [2022-02-20 14:09:53,235 INFO L290 TraceCheckUtils]: 97: Hoare triple {2840#false} assume 0 != main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~k~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;call write~int(main_~k~0#1 % 256, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 2);call write~int(main_~k~0#1 % 256 * (main_~k~0#1 % 256), ~#a~0.base, 2 + (~#a~0.offset + 4 * main_~i~0#1), 2); {2840#false} is VALID [2022-02-20 14:09:53,235 INFO L290 TraceCheckUtils]: 96: Hoare triple {2840#false} assume !!(main_~i~0#1 < 100000);assume -32768 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 32767; {2840#false} is VALID [2022-02-20 14:09:53,235 INFO L290 TraceCheckUtils]: 95: Hoare triple {2840#false} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {2840#false} is VALID [2022-02-20 14:09:53,235 INFO L290 TraceCheckUtils]: 94: Hoare triple {2840#false} assume 0 != main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~k~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;call write~int(main_~k~0#1 % 256, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 2);call write~int(main_~k~0#1 % 256 * (main_~k~0#1 % 256), ~#a~0.base, 2 + (~#a~0.offset + 4 * main_~i~0#1), 2); {2840#false} is VALID [2022-02-20 14:09:53,235 INFO L290 TraceCheckUtils]: 93: Hoare triple {2840#false} assume !!(main_~i~0#1 < 100000);assume -32768 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 32767; {2840#false} is VALID [2022-02-20 14:09:53,235 INFO L290 TraceCheckUtils]: 92: Hoare triple {2840#false} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {2840#false} is VALID [2022-02-20 14:09:53,235 INFO L290 TraceCheckUtils]: 91: Hoare triple {2840#false} assume 0 != main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~k~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;call write~int(main_~k~0#1 % 256, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 2);call write~int(main_~k~0#1 % 256 * (main_~k~0#1 % 256), ~#a~0.base, 2 + (~#a~0.offset + 4 * main_~i~0#1), 2); {2840#false} is VALID [2022-02-20 14:09:53,236 INFO L290 TraceCheckUtils]: 90: Hoare triple {2840#false} assume !!(main_~i~0#1 < 100000);assume -32768 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 32767; {2840#false} is VALID [2022-02-20 14:09:53,236 INFO L290 TraceCheckUtils]: 89: Hoare triple {2840#false} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {2840#false} is VALID [2022-02-20 14:09:53,236 INFO L290 TraceCheckUtils]: 88: Hoare triple {2840#false} assume 0 != main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~k~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;call write~int(main_~k~0#1 % 256, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 2);call write~int(main_~k~0#1 % 256 * (main_~k~0#1 % 256), ~#a~0.base, 2 + (~#a~0.offset + 4 * main_~i~0#1), 2); {2840#false} is VALID [2022-02-20 14:09:53,236 INFO L290 TraceCheckUtils]: 87: Hoare triple {2840#false} assume !!(main_~i~0#1 < 100000);assume -32768 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 32767; {2840#false} is VALID [2022-02-20 14:09:53,236 INFO L290 TraceCheckUtils]: 86: Hoare triple {2840#false} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {2840#false} is VALID [2022-02-20 14:09:53,236 INFO L290 TraceCheckUtils]: 85: Hoare triple {2840#false} assume 0 != main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~k~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;call write~int(main_~k~0#1 % 256, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 2);call write~int(main_~k~0#1 % 256 * (main_~k~0#1 % 256), ~#a~0.base, 2 + (~#a~0.offset + 4 * main_~i~0#1), 2); {2840#false} is VALID [2022-02-20 14:09:53,236 INFO L290 TraceCheckUtils]: 84: Hoare triple {2840#false} assume !!(main_~i~0#1 < 100000);assume -32768 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 32767; {2840#false} is VALID [2022-02-20 14:09:53,236 INFO L290 TraceCheckUtils]: 83: Hoare triple {2840#false} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {2840#false} is VALID [2022-02-20 14:09:53,236 INFO L290 TraceCheckUtils]: 82: Hoare triple {2840#false} assume 0 != main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~k~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;call write~int(main_~k~0#1 % 256, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 2);call write~int(main_~k~0#1 % 256 * (main_~k~0#1 % 256), ~#a~0.base, 2 + (~#a~0.offset + 4 * main_~i~0#1), 2); {2840#false} is VALID [2022-02-20 14:09:53,236 INFO L290 TraceCheckUtils]: 81: Hoare triple {2840#false} assume !!(main_~i~0#1 < 100000);assume -32768 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 32767; {2840#false} is VALID [2022-02-20 14:09:53,236 INFO L290 TraceCheckUtils]: 80: Hoare triple {2840#false} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {2840#false} is VALID [2022-02-20 14:09:53,236 INFO L290 TraceCheckUtils]: 79: Hoare triple {2840#false} assume 0 != main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~k~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;call write~int(main_~k~0#1 % 256, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 2);call write~int(main_~k~0#1 % 256 * (main_~k~0#1 % 256), ~#a~0.base, 2 + (~#a~0.offset + 4 * main_~i~0#1), 2); {2840#false} is VALID [2022-02-20 14:09:53,236 INFO L290 TraceCheckUtils]: 78: Hoare triple {2840#false} assume !!(main_~i~0#1 < 100000);assume -32768 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 32767; {2840#false} is VALID [2022-02-20 14:09:53,237 INFO L290 TraceCheckUtils]: 77: Hoare triple {2840#false} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {2840#false} is VALID [2022-02-20 14:09:53,237 INFO L290 TraceCheckUtils]: 76: Hoare triple {2840#false} assume 0 != main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~k~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;call write~int(main_~k~0#1 % 256, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 2);call write~int(main_~k~0#1 % 256 * (main_~k~0#1 % 256), ~#a~0.base, 2 + (~#a~0.offset + 4 * main_~i~0#1), 2); {2840#false} is VALID [2022-02-20 14:09:53,237 INFO L290 TraceCheckUtils]: 75: Hoare triple {2840#false} assume !!(main_~i~0#1 < 100000);assume -32768 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 32767; {2840#false} is VALID [2022-02-20 14:09:53,237 INFO L290 TraceCheckUtils]: 74: Hoare triple {2840#false} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {2840#false} is VALID [2022-02-20 14:09:53,237 INFO L290 TraceCheckUtils]: 73: Hoare triple {2840#false} assume 0 != main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~k~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;call write~int(main_~k~0#1 % 256, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 2);call write~int(main_~k~0#1 % 256 * (main_~k~0#1 % 256), ~#a~0.base, 2 + (~#a~0.offset + 4 * main_~i~0#1), 2); {2840#false} is VALID [2022-02-20 14:09:53,237 INFO L290 TraceCheckUtils]: 72: Hoare triple {2840#false} assume !!(main_~i~0#1 < 100000);assume -32768 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 32767; {2840#false} is VALID [2022-02-20 14:09:53,237 INFO L290 TraceCheckUtils]: 71: Hoare triple {2840#false} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {2840#false} is VALID [2022-02-20 14:09:53,237 INFO L290 TraceCheckUtils]: 70: Hoare triple {2840#false} assume 0 != main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~k~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;call write~int(main_~k~0#1 % 256, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 2);call write~int(main_~k~0#1 % 256 * (main_~k~0#1 % 256), ~#a~0.base, 2 + (~#a~0.offset + 4 * main_~i~0#1), 2); {2840#false} is VALID [2022-02-20 14:09:53,237 INFO L290 TraceCheckUtils]: 69: Hoare triple {2840#false} assume !!(main_~i~0#1 < 100000);assume -32768 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 32767; {2840#false} is VALID [2022-02-20 14:09:53,237 INFO L290 TraceCheckUtils]: 68: Hoare triple {2840#false} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {2840#false} is VALID [2022-02-20 14:09:53,238 INFO L290 TraceCheckUtils]: 67: Hoare triple {2840#false} assume 0 != main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~k~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;call write~int(main_~k~0#1 % 256, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 2);call write~int(main_~k~0#1 % 256 * (main_~k~0#1 % 256), ~#a~0.base, 2 + (~#a~0.offset + 4 * main_~i~0#1), 2); {2840#false} is VALID [2022-02-20 14:09:53,238 INFO L290 TraceCheckUtils]: 66: Hoare triple {2840#false} assume !!(main_~i~0#1 < 100000);assume -32768 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 32767; {2840#false} is VALID [2022-02-20 14:09:53,238 INFO L290 TraceCheckUtils]: 65: Hoare triple {2840#false} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {2840#false} is VALID [2022-02-20 14:09:53,238 INFO L290 TraceCheckUtils]: 64: Hoare triple {2840#false} assume 0 != main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~k~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;call write~int(main_~k~0#1 % 256, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 2);call write~int(main_~k~0#1 % 256 * (main_~k~0#1 % 256), ~#a~0.base, 2 + (~#a~0.offset + 4 * main_~i~0#1), 2); {2840#false} is VALID [2022-02-20 14:09:53,238 INFO L290 TraceCheckUtils]: 63: Hoare triple {2840#false} assume !!(main_~i~0#1 < 100000);assume -32768 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 32767; {2840#false} is VALID [2022-02-20 14:09:53,238 INFO L290 TraceCheckUtils]: 62: Hoare triple {2840#false} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {2840#false} is VALID [2022-02-20 14:09:53,238 INFO L290 TraceCheckUtils]: 61: Hoare triple {2840#false} assume 0 != main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~k~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;call write~int(main_~k~0#1 % 256, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 2);call write~int(main_~k~0#1 % 256 * (main_~k~0#1 % 256), ~#a~0.base, 2 + (~#a~0.offset + 4 * main_~i~0#1), 2); {2840#false} is VALID [2022-02-20 14:09:53,238 INFO L290 TraceCheckUtils]: 60: Hoare triple {2840#false} assume !!(main_~i~0#1 < 100000);assume -32768 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 32767; {2840#false} is VALID [2022-02-20 14:09:53,239 INFO L290 TraceCheckUtils]: 59: Hoare triple {2840#false} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {2840#false} is VALID [2022-02-20 14:09:53,239 INFO L290 TraceCheckUtils]: 58: Hoare triple {2840#false} assume 0 != main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~k~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;call write~int(main_~k~0#1 % 256, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 2);call write~int(main_~k~0#1 % 256 * (main_~k~0#1 % 256), ~#a~0.base, 2 + (~#a~0.offset + 4 * main_~i~0#1), 2); {2840#false} is VALID [2022-02-20 14:09:53,239 INFO L290 TraceCheckUtils]: 57: Hoare triple {2840#false} assume !!(main_~i~0#1 < 100000);assume -32768 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 32767; {2840#false} is VALID [2022-02-20 14:09:53,239 INFO L290 TraceCheckUtils]: 56: Hoare triple {2840#false} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {2840#false} is VALID [2022-02-20 14:09:53,239 INFO L290 TraceCheckUtils]: 55: Hoare triple {2840#false} assume 0 != main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~k~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;call write~int(main_~k~0#1 % 256, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 2);call write~int(main_~k~0#1 % 256 * (main_~k~0#1 % 256), ~#a~0.base, 2 + (~#a~0.offset + 4 * main_~i~0#1), 2); {2840#false} is VALID [2022-02-20 14:09:53,239 INFO L290 TraceCheckUtils]: 54: Hoare triple {2840#false} assume !!(main_~i~0#1 < 100000);assume -32768 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 32767; {2840#false} is VALID [2022-02-20 14:09:53,239 INFO L290 TraceCheckUtils]: 53: Hoare triple {2840#false} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {2840#false} is VALID [2022-02-20 14:09:53,239 INFO L290 TraceCheckUtils]: 52: Hoare triple {2840#false} assume 0 != main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~k~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;call write~int(main_~k~0#1 % 256, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 2);call write~int(main_~k~0#1 % 256 * (main_~k~0#1 % 256), ~#a~0.base, 2 + (~#a~0.offset + 4 * main_~i~0#1), 2); {2840#false} is VALID [2022-02-20 14:09:53,240 INFO L290 TraceCheckUtils]: 51: Hoare triple {2840#false} assume !!(main_~i~0#1 < 100000);assume -32768 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 32767; {2840#false} is VALID [2022-02-20 14:09:53,240 INFO L290 TraceCheckUtils]: 50: Hoare triple {2840#false} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {2840#false} is VALID [2022-02-20 14:09:53,240 INFO L290 TraceCheckUtils]: 49: Hoare triple {2840#false} assume 0 != main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~k~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;call write~int(main_~k~0#1 % 256, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 2);call write~int(main_~k~0#1 % 256 * (main_~k~0#1 % 256), ~#a~0.base, 2 + (~#a~0.offset + 4 * main_~i~0#1), 2); {2840#false} is VALID [2022-02-20 14:09:53,240 INFO L290 TraceCheckUtils]: 48: Hoare triple {2840#false} assume !!(main_~i~0#1 < 100000);assume -32768 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 32767; {2840#false} is VALID [2022-02-20 14:09:53,240 INFO L290 TraceCheckUtils]: 47: Hoare triple {2840#false} main_~i~0#1 := 0; {2840#false} is VALID [2022-02-20 14:09:53,241 INFO L290 TraceCheckUtils]: 46: Hoare triple {3449#(< |ULTIMATE.start_main_~i~0#1| 100000)} assume !(main_~i~0#1 < 100000); {2840#false} is VALID [2022-02-20 14:09:53,241 INFO L290 TraceCheckUtils]: 45: Hoare triple {3453#(< |ULTIMATE.start_main_~i~0#1| 99999)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {3449#(< |ULTIMATE.start_main_~i~0#1| 100000)} is VALID [2022-02-20 14:09:53,241 INFO L290 TraceCheckUtils]: 44: Hoare triple {3453#(< |ULTIMATE.start_main_~i~0#1| 99999)} assume !!(main_~i~0#1 < 100000);call write~int(main_~i~0#1, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 2);call write~int(main_~i~0#1, ~#a~0.base, 2 + (~#a~0.offset + 4 * main_~i~0#1), 2); {3453#(< |ULTIMATE.start_main_~i~0#1| 99999)} is VALID [2022-02-20 14:09:53,242 INFO L290 TraceCheckUtils]: 43: Hoare triple {3460#(< |ULTIMATE.start_main_~i~0#1| 99998)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {3453#(< |ULTIMATE.start_main_~i~0#1| 99999)} is VALID [2022-02-20 14:09:53,242 INFO L290 TraceCheckUtils]: 42: Hoare triple {3460#(< |ULTIMATE.start_main_~i~0#1| 99998)} assume !!(main_~i~0#1 < 100000);call write~int(main_~i~0#1, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 2);call write~int(main_~i~0#1, ~#a~0.base, 2 + (~#a~0.offset + 4 * main_~i~0#1), 2); {3460#(< |ULTIMATE.start_main_~i~0#1| 99998)} is VALID [2022-02-20 14:09:53,243 INFO L290 TraceCheckUtils]: 41: Hoare triple {3467#(< |ULTIMATE.start_main_~i~0#1| 99997)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {3460#(< |ULTIMATE.start_main_~i~0#1| 99998)} is VALID [2022-02-20 14:09:53,243 INFO L290 TraceCheckUtils]: 40: Hoare triple {3467#(< |ULTIMATE.start_main_~i~0#1| 99997)} assume !!(main_~i~0#1 < 100000);call write~int(main_~i~0#1, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 2);call write~int(main_~i~0#1, ~#a~0.base, 2 + (~#a~0.offset + 4 * main_~i~0#1), 2); {3467#(< |ULTIMATE.start_main_~i~0#1| 99997)} is VALID [2022-02-20 14:09:53,244 INFO L290 TraceCheckUtils]: 39: Hoare triple {3474#(< |ULTIMATE.start_main_~i~0#1| 99996)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {3467#(< |ULTIMATE.start_main_~i~0#1| 99997)} is VALID [2022-02-20 14:09:53,244 INFO L290 TraceCheckUtils]: 38: Hoare triple {3474#(< |ULTIMATE.start_main_~i~0#1| 99996)} assume !!(main_~i~0#1 < 100000);call write~int(main_~i~0#1, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 2);call write~int(main_~i~0#1, ~#a~0.base, 2 + (~#a~0.offset + 4 * main_~i~0#1), 2); {3474#(< |ULTIMATE.start_main_~i~0#1| 99996)} is VALID [2022-02-20 14:09:53,244 INFO L290 TraceCheckUtils]: 37: Hoare triple {3481#(< |ULTIMATE.start_main_~i~0#1| 99995)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {3474#(< |ULTIMATE.start_main_~i~0#1| 99996)} is VALID [2022-02-20 14:09:53,245 INFO L290 TraceCheckUtils]: 36: Hoare triple {3481#(< |ULTIMATE.start_main_~i~0#1| 99995)} assume !!(main_~i~0#1 < 100000);call write~int(main_~i~0#1, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 2);call write~int(main_~i~0#1, ~#a~0.base, 2 + (~#a~0.offset + 4 * main_~i~0#1), 2); {3481#(< |ULTIMATE.start_main_~i~0#1| 99995)} is VALID [2022-02-20 14:09:53,245 INFO L290 TraceCheckUtils]: 35: Hoare triple {3488#(< |ULTIMATE.start_main_~i~0#1| 99994)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {3481#(< |ULTIMATE.start_main_~i~0#1| 99995)} is VALID [2022-02-20 14:09:53,245 INFO L290 TraceCheckUtils]: 34: Hoare triple {3488#(< |ULTIMATE.start_main_~i~0#1| 99994)} assume !!(main_~i~0#1 < 100000);call write~int(main_~i~0#1, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 2);call write~int(main_~i~0#1, ~#a~0.base, 2 + (~#a~0.offset + 4 * main_~i~0#1), 2); {3488#(< |ULTIMATE.start_main_~i~0#1| 99994)} is VALID [2022-02-20 14:09:53,246 INFO L290 TraceCheckUtils]: 33: Hoare triple {3495#(< |ULTIMATE.start_main_~i~0#1| 99993)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {3488#(< |ULTIMATE.start_main_~i~0#1| 99994)} is VALID [2022-02-20 14:09:53,246 INFO L290 TraceCheckUtils]: 32: Hoare triple {3495#(< |ULTIMATE.start_main_~i~0#1| 99993)} assume !!(main_~i~0#1 < 100000);call write~int(main_~i~0#1, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 2);call write~int(main_~i~0#1, ~#a~0.base, 2 + (~#a~0.offset + 4 * main_~i~0#1), 2); {3495#(< |ULTIMATE.start_main_~i~0#1| 99993)} is VALID [2022-02-20 14:09:53,247 INFO L290 TraceCheckUtils]: 31: Hoare triple {3502#(< |ULTIMATE.start_main_~i~0#1| 99992)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {3495#(< |ULTIMATE.start_main_~i~0#1| 99993)} is VALID [2022-02-20 14:09:53,247 INFO L290 TraceCheckUtils]: 30: Hoare triple {3502#(< |ULTIMATE.start_main_~i~0#1| 99992)} assume !!(main_~i~0#1 < 100000);call write~int(main_~i~0#1, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 2);call write~int(main_~i~0#1, ~#a~0.base, 2 + (~#a~0.offset + 4 * main_~i~0#1), 2); {3502#(< |ULTIMATE.start_main_~i~0#1| 99992)} is VALID [2022-02-20 14:09:53,247 INFO L290 TraceCheckUtils]: 29: Hoare triple {3509#(< |ULTIMATE.start_main_~i~0#1| 99991)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {3502#(< |ULTIMATE.start_main_~i~0#1| 99992)} is VALID [2022-02-20 14:09:53,248 INFO L290 TraceCheckUtils]: 28: Hoare triple {3509#(< |ULTIMATE.start_main_~i~0#1| 99991)} assume !!(main_~i~0#1 < 100000);call write~int(main_~i~0#1, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 2);call write~int(main_~i~0#1, ~#a~0.base, 2 + (~#a~0.offset + 4 * main_~i~0#1), 2); {3509#(< |ULTIMATE.start_main_~i~0#1| 99991)} is VALID [2022-02-20 14:09:53,248 INFO L290 TraceCheckUtils]: 27: Hoare triple {3516#(< |ULTIMATE.start_main_~i~0#1| 99990)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {3509#(< |ULTIMATE.start_main_~i~0#1| 99991)} is VALID [2022-02-20 14:09:53,249 INFO L290 TraceCheckUtils]: 26: Hoare triple {3516#(< |ULTIMATE.start_main_~i~0#1| 99990)} assume !!(main_~i~0#1 < 100000);call write~int(main_~i~0#1, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 2);call write~int(main_~i~0#1, ~#a~0.base, 2 + (~#a~0.offset + 4 * main_~i~0#1), 2); {3516#(< |ULTIMATE.start_main_~i~0#1| 99990)} is VALID [2022-02-20 14:09:53,249 INFO L290 TraceCheckUtils]: 25: Hoare triple {3523#(< |ULTIMATE.start_main_~i~0#1| 99989)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {3516#(< |ULTIMATE.start_main_~i~0#1| 99990)} is VALID [2022-02-20 14:09:53,249 INFO L290 TraceCheckUtils]: 24: Hoare triple {3523#(< |ULTIMATE.start_main_~i~0#1| 99989)} assume !!(main_~i~0#1 < 100000);call write~int(main_~i~0#1, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 2);call write~int(main_~i~0#1, ~#a~0.base, 2 + (~#a~0.offset + 4 * main_~i~0#1), 2); {3523#(< |ULTIMATE.start_main_~i~0#1| 99989)} is VALID [2022-02-20 14:09:53,250 INFO L290 TraceCheckUtils]: 23: Hoare triple {3530#(< |ULTIMATE.start_main_~i~0#1| 99988)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {3523#(< |ULTIMATE.start_main_~i~0#1| 99989)} is VALID [2022-02-20 14:09:53,250 INFO L290 TraceCheckUtils]: 22: Hoare triple {3530#(< |ULTIMATE.start_main_~i~0#1| 99988)} assume !!(main_~i~0#1 < 100000);call write~int(main_~i~0#1, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 2);call write~int(main_~i~0#1, ~#a~0.base, 2 + (~#a~0.offset + 4 * main_~i~0#1), 2); {3530#(< |ULTIMATE.start_main_~i~0#1| 99988)} is VALID [2022-02-20 14:09:53,250 INFO L290 TraceCheckUtils]: 21: Hoare triple {3537#(< |ULTIMATE.start_main_~i~0#1| 99987)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {3530#(< |ULTIMATE.start_main_~i~0#1| 99988)} is VALID [2022-02-20 14:09:53,251 INFO L290 TraceCheckUtils]: 20: Hoare triple {3537#(< |ULTIMATE.start_main_~i~0#1| 99987)} assume !!(main_~i~0#1 < 100000);call write~int(main_~i~0#1, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 2);call write~int(main_~i~0#1, ~#a~0.base, 2 + (~#a~0.offset + 4 * main_~i~0#1), 2); {3537#(< |ULTIMATE.start_main_~i~0#1| 99987)} is VALID [2022-02-20 14:09:53,251 INFO L290 TraceCheckUtils]: 19: Hoare triple {3544#(< |ULTIMATE.start_main_~i~0#1| 99986)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {3537#(< |ULTIMATE.start_main_~i~0#1| 99987)} is VALID [2022-02-20 14:09:53,252 INFO L290 TraceCheckUtils]: 18: Hoare triple {3544#(< |ULTIMATE.start_main_~i~0#1| 99986)} assume !!(main_~i~0#1 < 100000);call write~int(main_~i~0#1, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 2);call write~int(main_~i~0#1, ~#a~0.base, 2 + (~#a~0.offset + 4 * main_~i~0#1), 2); {3544#(< |ULTIMATE.start_main_~i~0#1| 99986)} is VALID [2022-02-20 14:09:53,252 INFO L290 TraceCheckUtils]: 17: Hoare triple {3551#(< |ULTIMATE.start_main_~i~0#1| 99985)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {3544#(< |ULTIMATE.start_main_~i~0#1| 99986)} is VALID [2022-02-20 14:09:53,252 INFO L290 TraceCheckUtils]: 16: Hoare triple {3551#(< |ULTIMATE.start_main_~i~0#1| 99985)} assume !!(main_~i~0#1 < 100000);call write~int(main_~i~0#1, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 2);call write~int(main_~i~0#1, ~#a~0.base, 2 + (~#a~0.offset + 4 * main_~i~0#1), 2); {3551#(< |ULTIMATE.start_main_~i~0#1| 99985)} is VALID [2022-02-20 14:09:53,253 INFO L290 TraceCheckUtils]: 15: Hoare triple {3558#(< |ULTIMATE.start_main_~i~0#1| 99984)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {3551#(< |ULTIMATE.start_main_~i~0#1| 99985)} is VALID [2022-02-20 14:09:53,253 INFO L290 TraceCheckUtils]: 14: Hoare triple {3558#(< |ULTIMATE.start_main_~i~0#1| 99984)} assume !!(main_~i~0#1 < 100000);call write~int(main_~i~0#1, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 2);call write~int(main_~i~0#1, ~#a~0.base, 2 + (~#a~0.offset + 4 * main_~i~0#1), 2); {3558#(< |ULTIMATE.start_main_~i~0#1| 99984)} is VALID [2022-02-20 14:09:53,254 INFO L290 TraceCheckUtils]: 13: Hoare triple {3565#(< |ULTIMATE.start_main_~i~0#1| 99983)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {3558#(< |ULTIMATE.start_main_~i~0#1| 99984)} is VALID [2022-02-20 14:09:53,254 INFO L290 TraceCheckUtils]: 12: Hoare triple {3565#(< |ULTIMATE.start_main_~i~0#1| 99983)} assume !!(main_~i~0#1 < 100000);call write~int(main_~i~0#1, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 2);call write~int(main_~i~0#1, ~#a~0.base, 2 + (~#a~0.offset + 4 * main_~i~0#1), 2); {3565#(< |ULTIMATE.start_main_~i~0#1| 99983)} is VALID [2022-02-20 14:09:53,254 INFO L290 TraceCheckUtils]: 11: Hoare triple {3572#(< |ULTIMATE.start_main_~i~0#1| 99982)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {3565#(< |ULTIMATE.start_main_~i~0#1| 99983)} is VALID [2022-02-20 14:09:53,255 INFO L290 TraceCheckUtils]: 10: Hoare triple {3572#(< |ULTIMATE.start_main_~i~0#1| 99982)} assume !!(main_~i~0#1 < 100000);call write~int(main_~i~0#1, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 2);call write~int(main_~i~0#1, ~#a~0.base, 2 + (~#a~0.offset + 4 * main_~i~0#1), 2); {3572#(< |ULTIMATE.start_main_~i~0#1| 99982)} is VALID [2022-02-20 14:09:53,255 INFO L290 TraceCheckUtils]: 9: Hoare triple {3579#(< |ULTIMATE.start_main_~i~0#1| 99981)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {3572#(< |ULTIMATE.start_main_~i~0#1| 99982)} is VALID [2022-02-20 14:09:53,255 INFO L290 TraceCheckUtils]: 8: Hoare triple {3579#(< |ULTIMATE.start_main_~i~0#1| 99981)} assume !!(main_~i~0#1 < 100000);call write~int(main_~i~0#1, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 2);call write~int(main_~i~0#1, ~#a~0.base, 2 + (~#a~0.offset + 4 * main_~i~0#1), 2); {3579#(< |ULTIMATE.start_main_~i~0#1| 99981)} is VALID [2022-02-20 14:09:53,256 INFO L290 TraceCheckUtils]: 7: Hoare triple {3586#(< |ULTIMATE.start_main_~i~0#1| 99980)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {3579#(< |ULTIMATE.start_main_~i~0#1| 99981)} is VALID [2022-02-20 14:09:53,256 INFO L290 TraceCheckUtils]: 6: Hoare triple {3586#(< |ULTIMATE.start_main_~i~0#1| 99980)} assume !!(main_~i~0#1 < 100000);call write~int(main_~i~0#1, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 2);call write~int(main_~i~0#1, ~#a~0.base, 2 + (~#a~0.offset + 4 * main_~i~0#1), 2); {3586#(< |ULTIMATE.start_main_~i~0#1| 99980)} is VALID [2022-02-20 14:09:53,257 INFO L290 TraceCheckUtils]: 5: Hoare triple {3593#(< |ULTIMATE.start_main_~i~0#1| 99979)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {3586#(< |ULTIMATE.start_main_~i~0#1| 99980)} is VALID [2022-02-20 14:09:53,257 INFO L290 TraceCheckUtils]: 4: Hoare triple {3593#(< |ULTIMATE.start_main_~i~0#1| 99979)} assume !!(main_~i~0#1 < 100000);call write~int(main_~i~0#1, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 2);call write~int(main_~i~0#1, ~#a~0.base, 2 + (~#a~0.offset + 4 * main_~i~0#1), 2); {3593#(< |ULTIMATE.start_main_~i~0#1| 99979)} is VALID [2022-02-20 14:09:53,257 INFO L290 TraceCheckUtils]: 3: Hoare triple {3600#(< |ULTIMATE.start_main_~i~0#1| 99978)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {3593#(< |ULTIMATE.start_main_~i~0#1| 99979)} is VALID [2022-02-20 14:09:53,258 INFO L290 TraceCheckUtils]: 2: Hoare triple {3600#(< |ULTIMATE.start_main_~i~0#1| 99978)} assume !!(main_~i~0#1 < 100000);call write~int(main_~i~0#1, ~#a~0.base, ~#a~0.offset + 4 * main_~i~0#1, 2);call write~int(main_~i~0#1, ~#a~0.base, 2 + (~#a~0.offset + 4 * main_~i~0#1), 2); {3600#(< |ULTIMATE.start_main_~i~0#1| 99978)} is VALID [2022-02-20 14:09:53,258 INFO L290 TraceCheckUtils]: 1: Hoare triple {2839#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post1#1, main_#t~nondet3#1, main_#t~nondet4#1, main_#t~post2#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~mem10#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~short11#1, main_#t~post5#1, main_~k~0#1, main_~i~0#1;havoc main_~k~0#1;havoc main_~i~0#1;main_~i~0#1 := 0; {3600#(< |ULTIMATE.start_main_~i~0#1| 99978)} is VALID [2022-02-20 14:09:53,258 INFO L290 TraceCheckUtils]: 0: Hoare triple {2839#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(31, 2);~#a~0.base, ~#a~0.offset := 3, 0;call #Ultimate.allocInit(400000, 3);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#a~0.base); {2839#true} is VALID [2022-02-20 14:09:53,259 INFO L134 CoverageAnalysis]: Checked inductivity of 1199 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 715 trivial. 0 not checked. [2022-02-20 14:09:53,259 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:09:53,259 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661854700] [2022-02-20 14:09:53,259 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 14:09:53,259 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1813320661] [2022-02-20 14:09:53,260 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1813320661] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 14:09:53,260 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 14:09:53,260 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 48 [2022-02-20 14:09:53,260 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125113242] [2022-02-20 14:09:53,260 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 14:09:53,261 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 48 states have (on average 2.1666666666666665) internal successors, (104), 48 states have internal predecessors, (104), 0 states have call successors, (0), 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 121 [2022-02-20 14:09:53,261 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:09:53,261 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 48 states, 48 states have (on average 2.1666666666666665) internal successors, (104), 48 states have internal predecessors, (104), 0 states have call successors, (0), 0 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:09:53,332 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 104 edges. 104 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:09:53,332 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2022-02-20 14:09:53,332 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:09:53,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2022-02-20 14:09:53,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2022-02-20 14:09:53,334 INFO L87 Difference]: Start difference. First operand 124 states and 149 transitions. Second operand has 48 states, 48 states have (on average 2.1666666666666665) internal successors, (104), 48 states have internal predecessors, (104), 0 states have call successors, (0), 0 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:09:55,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:09:55,333 INFO L93 Difference]: Finished difference Result 682 states and 848 transitions. [2022-02-20 14:09:55,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2022-02-20 14:09:55,333 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 48 states have (on average 2.1666666666666665) internal successors, (104), 48 states have internal predecessors, (104), 0 states have call successors, (0), 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 121 [2022-02-20 14:09:55,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:09:55,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 48 states have (on average 2.1666666666666665) internal successors, (104), 48 states have internal predecessors, (104), 0 states have call successors, (0), 0 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:09:55,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 763 transitions. [2022-02-20 14:09:55,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 48 states have (on average 2.1666666666666665) internal successors, (104), 48 states have internal predecessors, (104), 0 states have call successors, (0), 0 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:09:55,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 763 transitions. [2022-02-20 14:09:55,354 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 48 states and 763 transitions. [2022-02-20 14:09:55,882 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 763 edges. 763 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:09:55,899 INFO L225 Difference]: With dead ends: 682 [2022-02-20 14:09:55,900 INFO L226 Difference]: Without dead ends: 605 [2022-02-20 14:09:55,901 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 194 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2022-02-20 14:09:55,902 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 1664 mSDsluCounter, 319 mSDsCounter, 0 mSdLazyCounter, 379 mSolverCounterSat, 342 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1664 SdHoareTripleChecker+Valid, 332 SdHoareTripleChecker+Invalid, 721 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 342 IncrementalHoareTripleChecker+Valid, 379 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-02-20 14:09:55,902 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1664 Valid, 332 Invalid, 721 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [342 Valid, 379 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-02-20 14:09:55,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2022-02-20 14:09:55,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 244. [2022-02-20 14:09:55,966 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:09:55,966 INFO L82 GeneralOperation]: Start isEquivalent. First operand 605 states. Second operand has 244 states, 243 states have (on average 1.205761316872428) internal successors, (293), 243 states have internal predecessors, (293), 0 states have call successors, (0), 0 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:09:55,967 INFO L74 IsIncluded]: Start isIncluded. First operand 605 states. Second operand has 244 states, 243 states have (on average 1.205761316872428) internal successors, (293), 243 states have internal predecessors, (293), 0 states have call successors, (0), 0 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:09:55,967 INFO L87 Difference]: Start difference. First operand 605 states. Second operand has 244 states, 243 states have (on average 1.205761316872428) internal successors, (293), 243 states have internal predecessors, (293), 0 states have call successors, (0), 0 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:09:55,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:09:55,984 INFO L93 Difference]: Finished difference Result 605 states and 699 transitions. [2022-02-20 14:09:55,984 INFO L276 IsEmpty]: Start isEmpty. Operand 605 states and 699 transitions. [2022-02-20 14:09:55,985 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:09:55,985 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:09:55,986 INFO L74 IsIncluded]: Start isIncluded. First operand has 244 states, 243 states have (on average 1.205761316872428) internal successors, (293), 243 states have internal predecessors, (293), 0 states have call successors, (0), 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 605 states. [2022-02-20 14:09:55,986 INFO L87 Difference]: Start difference. First operand has 244 states, 243 states have (on average 1.205761316872428) internal successors, (293), 243 states have internal predecessors, (293), 0 states have call successors, (0), 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 605 states. [2022-02-20 14:09:56,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:09:56,001 INFO L93 Difference]: Finished difference Result 605 states and 699 transitions. [2022-02-20 14:09:56,002 INFO L276 IsEmpty]: Start isEmpty. Operand 605 states and 699 transitions. [2022-02-20 14:09:56,002 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:09:56,003 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:09:56,003 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:09:56,003 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:09:56,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 243 states have (on average 1.205761316872428) internal successors, (293), 243 states have internal predecessors, (293), 0 states have call successors, (0), 0 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:09:56,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 293 transitions. [2022-02-20 14:09:56,008 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 293 transitions. Word has length 121 [2022-02-20 14:09:56,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:09:56,009 INFO L470 AbstractCegarLoop]: Abstraction has 244 states and 293 transitions. [2022-02-20 14:09:56,009 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 48 states have (on average 2.1666666666666665) internal successors, (104), 48 states have internal predecessors, (104), 0 states have call successors, (0), 0 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:09:56,009 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 293 transitions. [2022-02-20 14:09:56,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2022-02-20 14:09:56,011 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:09:56,011 INFO L514 BasicCegarLoop]: trace histogram [46, 46, 46, 46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:09:56,031 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-02-20 14:09:56,225 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:09:56,225 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:09:56,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:09:56,225 INFO L85 PathProgramCache]: Analyzing trace with hash 1689247387, now seen corresponding path program 5 times [2022-02-20 14:09:56,225 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:09:56,225 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248143264] [2022-02-20 14:09:56,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:09:56,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:09:56,391 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 14:09:56,392 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2147385777] [2022-02-20 14:09:56,392 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-02-20 14:09:56,392 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:09:56,392 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:09:56,395 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:09:56,396 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process