./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../sv-benchmarks/c/memsafety-bftpd/bftpd_2.i --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) 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/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/memsafety-bftpd/bftpd_2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-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 valid-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 7c883b81b24ce5a721aa9a1ff13aef8a0d532ba87d9e130e470a0b88a1f8e93e --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 23:37:41,292 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 23:37:41,294 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 23:37:41,330 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 23:37:41,331 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 23:37:41,333 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 23:37:41,336 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 23:37:41,338 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 23:37:41,339 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 23:37:41,342 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 23:37:41,343 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 23:37:41,344 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 23:37:41,344 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 23:37:41,345 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 23:37:41,346 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 23:37:41,349 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 23:37:41,349 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 23:37:41,350 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 23:37:41,351 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 23:37:41,355 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 23:37:41,356 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 23:37:41,357 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 23:37:41,358 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 23:37:41,358 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 23:37:41,362 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 23:37:41,363 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 23:37:41,363 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 23:37:41,364 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 23:37:41,364 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 23:37:41,365 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 23:37:41,365 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 23:37:41,366 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 23:37:41,367 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 23:37:41,368 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 23:37:41,368 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 23:37:41,369 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 23:37:41,370 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 23:37:41,370 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 23:37:41,370 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 23:37:41,370 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 23:37:41,371 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 23:37:41,372 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2022-02-20 23:37:41,393 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 23:37:41,394 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 23:37:41,394 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 23:37:41,394 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 23:37:41,395 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 23:37:41,395 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 23:37:41,396 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 23:37:41,396 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 23:37:41,396 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 23:37:41,396 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 23:37:41,397 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 23:37:41,397 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-20 23:37:41,397 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 23:37:41,397 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 23:37:41,397 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 23:37:41,397 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-02-20 23:37:41,398 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-02-20 23:37:41,398 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 23:37:41,398 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 23:37:41,398 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 23:37:41,398 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 23:37:41,398 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 23:37:41,398 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 23:37:41,398 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 23:37:41,399 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 23:37:41,399 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 23:37:41,399 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 23:37:41,399 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 23:37:41,399 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 23:37:41,399 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 valid-memcleanup) ) 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 -> 7c883b81b24ce5a721aa9a1ff13aef8a0d532ba87d9e130e470a0b88a1f8e93e [2022-02-20 23:37:41,572 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 23:37:41,588 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 23:37:41,591 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 23:37:41,591 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 23:37:41,592 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 23:37:41,593 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety-bftpd/bftpd_2.i [2022-02-20 23:37:41,651 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1653c534b/981e4f008c53438f91357183e0b45178/FLAG277c1d08f [2022-02-20 23:37:42,036 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 23:37:42,036 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-bftpd/bftpd_2.i [2022-02-20 23:37:42,047 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1653c534b/981e4f008c53438f91357183e0b45178/FLAG277c1d08f [2022-02-20 23:37:42,059 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1653c534b/981e4f008c53438f91357183e0b45178 [2022-02-20 23:37:42,061 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 23:37:42,062 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 23:37:42,063 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 23:37:42,063 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 23:37:42,065 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 23:37:42,066 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:37:42" (1/1) ... [2022-02-20 23:37:42,067 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5daee0d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:37:42, skipping insertion in model container [2022-02-20 23:37:42,067 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:37:42" (1/1) ... [2022-02-20 23:37:42,072 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 23:37:42,104 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 23:37:42,354 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:37:42,362 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 23:37:42,394 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:37:42,434 INFO L208 MainTranslator]: Completed translation [2022-02-20 23:37:42,438 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:37:42 WrapperNode [2022-02-20 23:37:42,438 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 23:37:42,439 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 23:37:42,439 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 23:37:42,439 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 23:37:42,444 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:37:42" (1/1) ... [2022-02-20 23:37:42,457 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:37:42" (1/1) ... [2022-02-20 23:37:42,478 INFO L137 Inliner]: procedures = 168, calls = 42, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 95 [2022-02-20 23:37:42,479 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 23:37:42,479 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 23:37:42,479 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 23:37:42,479 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 23:37:42,485 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:37:42" (1/1) ... [2022-02-20 23:37:42,485 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:37:42" (1/1) ... [2022-02-20 23:37:42,487 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:37:42" (1/1) ... [2022-02-20 23:37:42,487 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:37:42" (1/1) ... [2022-02-20 23:37:42,493 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:37:42" (1/1) ... [2022-02-20 23:37:42,501 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:37:42" (1/1) ... [2022-02-20 23:37:42,502 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:37:42" (1/1) ... [2022-02-20 23:37:42,503 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 23:37:42,504 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 23:37:42,504 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 23:37:42,504 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 23:37:42,508 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:37:42" (1/1) ... [2022-02-20 23:37:42,513 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 23:37:42,528 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:37:42,537 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 23:37:42,538 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 23:37:42,564 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-20 23:37:42,564 INFO L130 BoogieDeclarations]: Found specification of procedure parse_input [2022-02-20 23:37:42,565 INFO L138 BoogieDeclarations]: Found implementation of procedure parse_input [2022-02-20 23:37:42,565 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-02-20 23:37:42,565 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 23:37:42,565 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-02-20 23:37:42,565 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 23:37:42,565 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-02-20 23:37:42,565 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 23:37:42,565 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 23:37:42,565 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 23:37:42,629 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 23:37:42,630 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 23:37:42,863 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 23:37:42,868 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 23:37:42,868 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-20 23:37:42,870 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:37:42 BoogieIcfgContainer [2022-02-20 23:37:42,870 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 23:37:42,877 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 23:37:42,878 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 23:37:42,880 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 23:37:42,880 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 11:37:42" (1/3) ... [2022-02-20 23:37:42,880 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9963c1e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 11:37:42, skipping insertion in model container [2022-02-20 23:37:42,881 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:37:42" (2/3) ... [2022-02-20 23:37:42,881 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9963c1e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 11:37:42, skipping insertion in model container [2022-02-20 23:37:42,881 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:37:42" (3/3) ... [2022-02-20 23:37:42,882 INFO L111 eAbstractionObserver]: Analyzing ICFG bftpd_2.i [2022-02-20 23:37:42,885 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 23:37:42,885 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 20 error locations. [2022-02-20 23:37:42,920 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 23:37:42,927 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=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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 23:37:42,927 INFO L340 AbstractCegarLoop]: Starting to check reachability of 20 error locations. [2022-02-20 23:37:42,952 INFO L276 IsEmpty]: Start isEmpty. Operand has 61 states, 36 states have (on average 1.7777777777777777) internal successors, (64), 56 states have internal predecessors, (64), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 23:37:42,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-02-20 23:37:42,959 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:37:42,960 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-02-20 23:37:42,960 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting parse_inputErr0REQUIRES_VIOLATION === [parse_inputErr0REQUIRES_VIOLATION, parse_inputErr1REQUIRES_VIOLATION, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2022-02-20 23:37:42,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:37:42,965 INFO L85 PathProgramCache]: Analyzing trace with hash -772449407, now seen corresponding path program 1 times [2022-02-20 23:37:42,975 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:37:42,976 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744106435] [2022-02-20 23:37:42,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:37:42,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:37:43,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:37:43,220 INFO L290 TraceCheckUtils]: 0: Hoare triple {64#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(3, 1);call write~init~int(99, 1, 0, 1);call write~init~int(49, 1, 1, 1);call write~init~int(0, 1, 2, 1);call #Ultimate.allocInit(3, 2);call write~init~int(99, 2, 0, 1);call write~init~int(50, 2, 1, 1);call write~init~int(0, 2, 2, 1);call #Ultimate.allocInit(3, 3);call write~init~int(99, 3, 0, 1);call write~init~int(49, 3, 1, 1);call write~init~int(0, 3, 2, 1);call #Ultimate.allocInit(3, 4);call write~init~int(99, 4, 0, 1);call write~init~int(49, 4, 1, 1);call write~init~int(0, 4, 2, 1);call #Ultimate.allocInit(3, 5);call write~init~int(99, 5, 0, 1);call write~init~int(50, 5, 1, 1);call write~init~int(0, 5, 2, 1);~state~0 := ~unnamed3~0~STATE_1;~global~0.base, ~global~0.offset := 0, 0;~#commands~0.base, ~#commands~0.offset := 6, 0;call #Ultimate.allocInit(18, 6);call write~init~$Pointer$(1, 0, ~#commands~0.base, ~#commands~0.offset, 4);call write~init~$Pointer$(#funAddr~c1.base, #funAddr~c1.offset, ~#commands~0.base, 4 + ~#commands~0.offset, 4);call write~init~int((if ~unnamed3~0~STATE_1 % 256 <= 127 then ~unnamed3~0~STATE_1 % 256 else ~unnamed3~0~STATE_1 % 256 - 256), ~#commands~0.base, 8 + ~#commands~0.offset, 1);call write~init~$Pointer$(2, 0, ~#commands~0.base, 9 + ~#commands~0.offset, 4);call write~init~$Pointer$(#funAddr~c2.base, #funAddr~c2.offset, ~#commands~0.base, 13 + ~#commands~0.offset, 4);call write~init~int((if ~unnamed3~0~STATE_2 % 256 <= 127 then ~unnamed3~0~STATE_2 % 256 else ~unnamed3~0~STATE_2 % 256 - 256), ~#commands~0.base, 17 + ~#commands~0.offset, 1); {66#(and (= 6 |~#commands~0.base|) (= (select |#valid| 6) 1))} is VALID [2022-02-20 23:37:43,221 INFO L290 TraceCheckUtils]: 1: Hoare triple {66#(and (= 6 |~#commands~0.base|) (= (select |#valid| 6) 1))} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1; {66#(and (= 6 |~#commands~0.base|) (= (select |#valid| 6) 1))} is VALID [2022-02-20 23:37:43,227 INFO L272 TraceCheckUtils]: 2: Hoare triple {66#(and (= 6 |~#commands~0.base|) (= (select |#valid| 6) 1))} call parse_input(3, 0); {67#(= (select |#valid| |~#commands~0.base|) 1)} is VALID [2022-02-20 23:37:43,228 INFO L290 TraceCheckUtils]: 3: Hoare triple {67#(= (select |#valid| |~#commands~0.base|) 1)} ~input#1.base, ~input#1.offset := #in~input#1.base, #in~input#1.offset;~i~0#1 := 0; {67#(= (select |#valid| |~#commands~0.base|) 1)} is VALID [2022-02-20 23:37:43,229 INFO L290 TraceCheckUtils]: 4: Hoare triple {67#(= (select |#valid| |~#commands~0.base|) 1)} assume !!(~i~0#1 < 2); {67#(= (select |#valid| |~#commands~0.base|) 1)} is VALID [2022-02-20 23:37:43,229 INFO L290 TraceCheckUtils]: 5: Hoare triple {67#(= (select |#valid| |~#commands~0.base|) 1)} assume !(1 == #valid[~#commands~0.base]); {65#false} is VALID [2022-02-20 23:37:43,230 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 23:37:43,230 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:37:43,231 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744106435] [2022-02-20 23:37:43,231 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1744106435] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:37:43,231 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:37:43,231 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:37:43,234 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720833707] [2022-02-20 23:37:43,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:37:43,237 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-02-20 23:37:43,238 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:37:43,240 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:37:43,257 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:37:43,257 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 23:37:43,257 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:37:43,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 23:37:43,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-02-20 23:37:43,279 INFO L87 Difference]: Start difference. First operand has 61 states, 36 states have (on average 1.7777777777777777) internal successors, (64), 56 states have internal predecessors, (64), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:37:43,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:37:43,560 INFO L93 Difference]: Finished difference Result 124 states and 145 transitions. [2022-02-20 23:37:43,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 23:37:43,560 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-02-20 23:37:43,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:37:43,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:37:43,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 154 transitions. [2022-02-20 23:37:43,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:37:43,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 154 transitions. [2022-02-20 23:37:43,573 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 154 transitions. [2022-02-20 23:37:43,678 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 154 edges. 154 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:37:43,686 INFO L225 Difference]: With dead ends: 124 [2022-02-20 23:37:43,686 INFO L226 Difference]: Without dead ends: 118 [2022-02-20 23:37:43,687 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-02-20 23:37:43,689 INFO L933 BasicCegarLoop]: 56 mSDtfsCounter, 149 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:37:43,689 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [149 Valid, 109 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:37:43,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2022-02-20 23:37:43,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 92. [2022-02-20 23:37:43,722 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:37:43,723 INFO L82 GeneralOperation]: Start isEquivalent. First operand 118 states. Second operand has 92 states, 65 states have (on average 1.6153846153846154) internal successors, (105), 82 states have internal predecessors, (105), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (12), 6 states have call predecessors, (12), 6 states have call successors, (12) [2022-02-20 23:37:43,723 INFO L74 IsIncluded]: Start isIncluded. First operand 118 states. Second operand has 92 states, 65 states have (on average 1.6153846153846154) internal successors, (105), 82 states have internal predecessors, (105), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (12), 6 states have call predecessors, (12), 6 states have call successors, (12) [2022-02-20 23:37:43,724 INFO L87 Difference]: Start difference. First operand 118 states. Second operand has 92 states, 65 states have (on average 1.6153846153846154) internal successors, (105), 82 states have internal predecessors, (105), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (12), 6 states have call predecessors, (12), 6 states have call successors, (12) [2022-02-20 23:37:43,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:37:43,742 INFO L93 Difference]: Finished difference Result 118 states and 139 transitions. [2022-02-20 23:37:43,742 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 139 transitions. [2022-02-20 23:37:43,749 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:37:43,749 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:37:43,750 INFO L74 IsIncluded]: Start isIncluded. First operand has 92 states, 65 states have (on average 1.6153846153846154) internal successors, (105), 82 states have internal predecessors, (105), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (12), 6 states have call predecessors, (12), 6 states have call successors, (12) Second operand 118 states. [2022-02-20 23:37:43,750 INFO L87 Difference]: Start difference. First operand has 92 states, 65 states have (on average 1.6153846153846154) internal successors, (105), 82 states have internal predecessors, (105), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (12), 6 states have call predecessors, (12), 6 states have call successors, (12) Second operand 118 states. [2022-02-20 23:37:43,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:37:43,757 INFO L93 Difference]: Finished difference Result 118 states and 139 transitions. [2022-02-20 23:37:43,757 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 139 transitions. [2022-02-20 23:37:43,758 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:37:43,761 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:37:43,761 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:37:43,761 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:37:43,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 65 states have (on average 1.6153846153846154) internal successors, (105), 82 states have internal predecessors, (105), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (12), 6 states have call predecessors, (12), 6 states have call successors, (12) [2022-02-20 23:37:43,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 123 transitions. [2022-02-20 23:37:43,772 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 123 transitions. Word has length 6 [2022-02-20 23:37:43,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:37:43,772 INFO L470 AbstractCegarLoop]: Abstraction has 92 states and 123 transitions. [2022-02-20 23:37:43,772 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:37:43,772 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 123 transitions. [2022-02-20 23:37:43,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-02-20 23:37:43,773 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:37:43,773 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-02-20 23:37:43,773 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 23:37:43,773 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting parse_inputErr1REQUIRES_VIOLATION === [parse_inputErr0REQUIRES_VIOLATION, parse_inputErr1REQUIRES_VIOLATION, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2022-02-20 23:37:43,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:37:43,774 INFO L85 PathProgramCache]: Analyzing trace with hash -772449406, now seen corresponding path program 1 times [2022-02-20 23:37:43,774 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:37:43,774 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905158352] [2022-02-20 23:37:43,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:37:43,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:37:43,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:37:43,872 INFO L290 TraceCheckUtils]: 0: Hoare triple {522#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(3, 1);call write~init~int(99, 1, 0, 1);call write~init~int(49, 1, 1, 1);call write~init~int(0, 1, 2, 1);call #Ultimate.allocInit(3, 2);call write~init~int(99, 2, 0, 1);call write~init~int(50, 2, 1, 1);call write~init~int(0, 2, 2, 1);call #Ultimate.allocInit(3, 3);call write~init~int(99, 3, 0, 1);call write~init~int(49, 3, 1, 1);call write~init~int(0, 3, 2, 1);call #Ultimate.allocInit(3, 4);call write~init~int(99, 4, 0, 1);call write~init~int(49, 4, 1, 1);call write~init~int(0, 4, 2, 1);call #Ultimate.allocInit(3, 5);call write~init~int(99, 5, 0, 1);call write~init~int(50, 5, 1, 1);call write~init~int(0, 5, 2, 1);~state~0 := ~unnamed3~0~STATE_1;~global~0.base, ~global~0.offset := 0, 0;~#commands~0.base, ~#commands~0.offset := 6, 0;call #Ultimate.allocInit(18, 6);call write~init~$Pointer$(1, 0, ~#commands~0.base, ~#commands~0.offset, 4);call write~init~$Pointer$(#funAddr~c1.base, #funAddr~c1.offset, ~#commands~0.base, 4 + ~#commands~0.offset, 4);call write~init~int((if ~unnamed3~0~STATE_1 % 256 <= 127 then ~unnamed3~0~STATE_1 % 256 else ~unnamed3~0~STATE_1 % 256 - 256), ~#commands~0.base, 8 + ~#commands~0.offset, 1);call write~init~$Pointer$(2, 0, ~#commands~0.base, 9 + ~#commands~0.offset, 4);call write~init~$Pointer$(#funAddr~c2.base, #funAddr~c2.offset, ~#commands~0.base, 13 + ~#commands~0.offset, 4);call write~init~int((if ~unnamed3~0~STATE_2 % 256 <= 127 then ~unnamed3~0~STATE_2 % 256 else ~unnamed3~0~STATE_2 % 256 - 256), ~#commands~0.base, 17 + ~#commands~0.offset, 1); {524#(and (= 6 |~#commands~0.base|) (= (select |#length| 6) 18) (<= 0 |~#commands~0.offset|) (<= |~#commands~0.offset| 0))} is VALID [2022-02-20 23:37:43,875 INFO L290 TraceCheckUtils]: 1: Hoare triple {524#(and (= 6 |~#commands~0.base|) (= (select |#length| 6) 18) (<= 0 |~#commands~0.offset|) (<= |~#commands~0.offset| 0))} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1; {524#(and (= 6 |~#commands~0.base|) (= (select |#length| 6) 18) (<= 0 |~#commands~0.offset|) (<= |~#commands~0.offset| 0))} is VALID [2022-02-20 23:37:43,876 INFO L272 TraceCheckUtils]: 2: Hoare triple {524#(and (= 6 |~#commands~0.base|) (= (select |#length| 6) 18) (<= 0 |~#commands~0.offset|) (<= |~#commands~0.offset| 0))} call parse_input(3, 0); {525#(and (= (+ (select |#length| |~#commands~0.base|) (- 18)) 0) (<= 0 |~#commands~0.offset|) (<= |~#commands~0.offset| 0))} is VALID [2022-02-20 23:37:43,876 INFO L290 TraceCheckUtils]: 3: Hoare triple {525#(and (= (+ (select |#length| |~#commands~0.base|) (- 18)) 0) (<= 0 |~#commands~0.offset|) (<= |~#commands~0.offset| 0))} ~input#1.base, ~input#1.offset := #in~input#1.base, #in~input#1.offset;~i~0#1 := 0; {526#(and (= (+ (select |#length| |~#commands~0.base|) (- 18)) 0) (<= 0 |~#commands~0.offset|) (= |parse_input_~i~0#1| 0) (<= |~#commands~0.offset| 0))} is VALID [2022-02-20 23:37:43,877 INFO L290 TraceCheckUtils]: 4: Hoare triple {526#(and (= (+ (select |#length| |~#commands~0.base|) (- 18)) 0) (<= 0 |~#commands~0.offset|) (= |parse_input_~i~0#1| 0) (<= |~#commands~0.offset| 0))} assume !!(~i~0#1 < 2); {526#(and (= (+ (select |#length| |~#commands~0.base|) (- 18)) 0) (<= 0 |~#commands~0.offset|) (= |parse_input_~i~0#1| 0) (<= |~#commands~0.offset| 0))} is VALID [2022-02-20 23:37:43,878 INFO L290 TraceCheckUtils]: 5: Hoare triple {526#(and (= (+ (select |#length| |~#commands~0.base|) (- 18)) 0) (<= 0 |~#commands~0.offset|) (= |parse_input_~i~0#1| 0) (<= |~#commands~0.offset| 0))} assume !(4 + (~#commands~0.offset + 9 * ~i~0#1) <= #length[~#commands~0.base] && 0 <= ~#commands~0.offset + 9 * ~i~0#1); {523#false} is VALID [2022-02-20 23:37:43,879 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 23:37:43,879 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:37:43,879 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905158352] [2022-02-20 23:37:43,880 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1905158352] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:37:43,881 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:37:43,881 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 23:37:43,881 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553956350] [2022-02-20 23:37:43,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:37:43,882 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.25) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-02-20 23:37:43,883 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:37:43,883 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 1.25) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:37:43,888 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:37:43,888 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 23:37:43,889 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:37:43,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 23:37:43,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:37:43,889 INFO L87 Difference]: Start difference. First operand 92 states and 123 transitions. Second operand has 5 states, 4 states have (on average 1.25) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:37:44,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:37:44,188 INFO L93 Difference]: Finished difference Result 221 states and 308 transitions. [2022-02-20 23:37:44,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 23:37:44,189 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.25) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-02-20 23:37:44,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:37:44,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 1.25) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:37:44,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 161 transitions. [2022-02-20 23:37:44,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 1.25) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:37:44,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 161 transitions. [2022-02-20 23:37:44,196 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 161 transitions. [2022-02-20 23:37:44,320 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 161 edges. 161 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:37:44,325 INFO L225 Difference]: With dead ends: 221 [2022-02-20 23:37:44,325 INFO L226 Difference]: Without dead ends: 221 [2022-02-20 23:37:44,325 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-02-20 23:37:44,326 INFO L933 BasicCegarLoop]: 61 mSDtfsCounter, 164 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:37:44,326 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [164 Valid, 158 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:37:44,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2022-02-20 23:37:44,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 168. [2022-02-20 23:37:44,335 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:37:44,336 INFO L82 GeneralOperation]: Start isEquivalent. First operand 221 states. Second operand has 168 states, 133 states have (on average 1.6240601503759398) internal successors, (216), 150 states have internal predecessors, (216), 11 states have call successors, (11), 6 states have call predecessors, (11), 6 states have return successors, (34), 11 states have call predecessors, (34), 11 states have call successors, (34) [2022-02-20 23:37:44,336 INFO L74 IsIncluded]: Start isIncluded. First operand 221 states. Second operand has 168 states, 133 states have (on average 1.6240601503759398) internal successors, (216), 150 states have internal predecessors, (216), 11 states have call successors, (11), 6 states have call predecessors, (11), 6 states have return successors, (34), 11 states have call predecessors, (34), 11 states have call successors, (34) [2022-02-20 23:37:44,337 INFO L87 Difference]: Start difference. First operand 221 states. Second operand has 168 states, 133 states have (on average 1.6240601503759398) internal successors, (216), 150 states have internal predecessors, (216), 11 states have call successors, (11), 6 states have call predecessors, (11), 6 states have return successors, (34), 11 states have call predecessors, (34), 11 states have call successors, (34) [2022-02-20 23:37:44,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:37:44,357 INFO L93 Difference]: Finished difference Result 221 states and 308 transitions. [2022-02-20 23:37:44,357 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 308 transitions. [2022-02-20 23:37:44,358 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:37:44,358 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:37:44,359 INFO L74 IsIncluded]: Start isIncluded. First operand has 168 states, 133 states have (on average 1.6240601503759398) internal successors, (216), 150 states have internal predecessors, (216), 11 states have call successors, (11), 6 states have call predecessors, (11), 6 states have return successors, (34), 11 states have call predecessors, (34), 11 states have call successors, (34) Second operand 221 states. [2022-02-20 23:37:44,360 INFO L87 Difference]: Start difference. First operand has 168 states, 133 states have (on average 1.6240601503759398) internal successors, (216), 150 states have internal predecessors, (216), 11 states have call successors, (11), 6 states have call predecessors, (11), 6 states have return successors, (34), 11 states have call predecessors, (34), 11 states have call successors, (34) Second operand 221 states. [2022-02-20 23:37:44,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:37:44,371 INFO L93 Difference]: Finished difference Result 221 states and 308 transitions. [2022-02-20 23:37:44,371 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 308 transitions. [2022-02-20 23:37:44,372 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:37:44,372 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:37:44,373 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:37:44,373 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:37:44,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 133 states have (on average 1.6240601503759398) internal successors, (216), 150 states have internal predecessors, (216), 11 states have call successors, (11), 6 states have call predecessors, (11), 6 states have return successors, (34), 11 states have call predecessors, (34), 11 states have call successors, (34) [2022-02-20 23:37:44,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 261 transitions. [2022-02-20 23:37:44,381 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 261 transitions. Word has length 6 [2022-02-20 23:37:44,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:37:44,381 INFO L470 AbstractCegarLoop]: Abstraction has 168 states and 261 transitions. [2022-02-20 23:37:44,381 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.25) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:37:44,382 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 261 transitions. [2022-02-20 23:37:44,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-02-20 23:37:44,382 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:37:44,383 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:37:44,383 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 23:37:44,383 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATION, parse_inputErr1REQUIRES_VIOLATION, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2022-02-20 23:37:44,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:37:44,384 INFO L85 PathProgramCache]: Analyzing trace with hash 1823872140, now seen corresponding path program 1 times [2022-02-20 23:37:44,384 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:37:44,384 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667476984] [2022-02-20 23:37:44,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:37:44,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:37:44,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:37:44,544 INFO L290 TraceCheckUtils]: 0: Hoare triple {1362#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(3, 1);call write~init~int(99, 1, 0, 1);call write~init~int(49, 1, 1, 1);call write~init~int(0, 1, 2, 1);call #Ultimate.allocInit(3, 2);call write~init~int(99, 2, 0, 1);call write~init~int(50, 2, 1, 1);call write~init~int(0, 2, 2, 1);call #Ultimate.allocInit(3, 3);call write~init~int(99, 3, 0, 1);call write~init~int(49, 3, 1, 1);call write~init~int(0, 3, 2, 1);call #Ultimate.allocInit(3, 4);call write~init~int(99, 4, 0, 1);call write~init~int(49, 4, 1, 1);call write~init~int(0, 4, 2, 1);call #Ultimate.allocInit(3, 5);call write~init~int(99, 5, 0, 1);call write~init~int(50, 5, 1, 1);call write~init~int(0, 5, 2, 1);~state~0 := ~unnamed3~0~STATE_1;~global~0.base, ~global~0.offset := 0, 0;~#commands~0.base, ~#commands~0.offset := 6, 0;call #Ultimate.allocInit(18, 6);call write~init~$Pointer$(1, 0, ~#commands~0.base, ~#commands~0.offset, 4);call write~init~$Pointer$(#funAddr~c1.base, #funAddr~c1.offset, ~#commands~0.base, 4 + ~#commands~0.offset, 4);call write~init~int((if ~unnamed3~0~STATE_1 % 256 <= 127 then ~unnamed3~0~STATE_1 % 256 else ~unnamed3~0~STATE_1 % 256 - 256), ~#commands~0.base, 8 + ~#commands~0.offset, 1);call write~init~$Pointer$(2, 0, ~#commands~0.base, 9 + ~#commands~0.offset, 4);call write~init~$Pointer$(#funAddr~c2.base, #funAddr~c2.offset, ~#commands~0.base, 13 + ~#commands~0.offset, 4);call write~init~int((if ~unnamed3~0~STATE_2 % 256 <= 127 then ~unnamed3~0~STATE_2 % 256 else ~unnamed3~0~STATE_2 % 256 - 256), ~#commands~0.base, 17 + ~#commands~0.offset, 1); {1364#(and (= (select |#valid| 1) 1) (= |~#commands~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1))} is VALID [2022-02-20 23:37:44,545 INFO L290 TraceCheckUtils]: 1: Hoare triple {1364#(and (= (select |#valid| 1) 1) (= |~#commands~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1))} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1; {1364#(and (= (select |#valid| 1) 1) (= |~#commands~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1))} is VALID [2022-02-20 23:37:44,546 INFO L272 TraceCheckUtils]: 2: Hoare triple {1364#(and (= (select |#valid| 1) 1) (= |~#commands~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1))} call parse_input(3, 0); {1364#(and (= (select |#valid| 1) 1) (= |~#commands~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1))} is VALID [2022-02-20 23:37:44,547 INFO L290 TraceCheckUtils]: 3: Hoare triple {1364#(and (= (select |#valid| 1) 1) (= |~#commands~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1))} ~input#1.base, ~input#1.offset := #in~input#1.base, #in~input#1.offset;~i~0#1 := 0; {1365#(and (= (select |#valid| 1) 1) (= (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset|) 0) (= |parse_input_~i~0#1| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1))} is VALID [2022-02-20 23:37:44,547 INFO L290 TraceCheckUtils]: 4: Hoare triple {1365#(and (= (select |#valid| 1) 1) (= (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset|) 0) (= |parse_input_~i~0#1| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1))} assume !!(~i~0#1 < 2); {1365#(and (= (select |#valid| 1) 1) (= (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset|) 0) (= |parse_input_~i~0#1| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1))} is VALID [2022-02-20 23:37:44,548 INFO L290 TraceCheckUtils]: 5: Hoare triple {1365#(and (= (select |#valid| 1) 1) (= (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset|) 0) (= |parse_input_~i~0#1| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1))} SUMMARY for call #t~mem3#1.base, #t~mem3#1.offset := read~$Pointer$(~#commands~0.base, ~#commands~0.offset + 9 * ~i~0#1, 4); srcloc: L693 {1366#(and (= (select |#valid| |parse_input_#t~mem3#1.base|) 1) (= |parse_input_#t~mem3#1.base| 1))} is VALID [2022-02-20 23:37:44,548 INFO L290 TraceCheckUtils]: 6: Hoare triple {1366#(and (= (select |#valid| |parse_input_#t~mem3#1.base|) 1) (= |parse_input_#t~mem3#1.base| 1))} assume !(1 == #valid[#t~mem3#1.base]); {1363#false} is VALID [2022-02-20 23:37:44,549 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 23:37:44,549 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:37:44,549 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667476984] [2022-02-20 23:37:44,549 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1667476984] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:37:44,549 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:37:44,550 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 23:37:44,550 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515800492] [2022-02-20 23:37:44,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:37:44,551 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-02-20 23:37:44,551 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:37:44,551 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:37:44,558 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:37:44,558 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 23:37:44,558 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:37:44,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 23:37:44,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:37:44,559 INFO L87 Difference]: Start difference. First operand 168 states and 261 transitions. Second operand has 5 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:37:44,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:37:44,873 INFO L93 Difference]: Finished difference Result 244 states and 348 transitions. [2022-02-20 23:37:44,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 23:37:44,874 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-02-20 23:37:44,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:37:44,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:37:44,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 172 transitions. [2022-02-20 23:37:44,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:37:44,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 172 transitions. [2022-02-20 23:37:44,878 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 172 transitions. [2022-02-20 23:37:45,016 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 172 edges. 172 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:37:45,020 INFO L225 Difference]: With dead ends: 244 [2022-02-20 23:37:45,020 INFO L226 Difference]: Without dead ends: 244 [2022-02-20 23:37:45,020 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-02-20 23:37:45,025 INFO L933 BasicCegarLoop]: 53 mSDtfsCounter, 100 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:37:45,026 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [100 Valid, 174 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:37:45,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2022-02-20 23:37:45,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 171. [2022-02-20 23:37:45,046 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:37:45,049 INFO L82 GeneralOperation]: Start isEquivalent. First operand 244 states. Second operand has 171 states, 136 states have (on average 1.6102941176470589) internal successors, (219), 153 states have internal predecessors, (219), 11 states have call successors, (11), 6 states have call predecessors, (11), 6 states have return successors, (34), 11 states have call predecessors, (34), 11 states have call successors, (34) [2022-02-20 23:37:45,049 INFO L74 IsIncluded]: Start isIncluded. First operand 244 states. Second operand has 171 states, 136 states have (on average 1.6102941176470589) internal successors, (219), 153 states have internal predecessors, (219), 11 states have call successors, (11), 6 states have call predecessors, (11), 6 states have return successors, (34), 11 states have call predecessors, (34), 11 states have call successors, (34) [2022-02-20 23:37:45,051 INFO L87 Difference]: Start difference. First operand 244 states. Second operand has 171 states, 136 states have (on average 1.6102941176470589) internal successors, (219), 153 states have internal predecessors, (219), 11 states have call successors, (11), 6 states have call predecessors, (11), 6 states have return successors, (34), 11 states have call predecessors, (34), 11 states have call successors, (34) [2022-02-20 23:37:45,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:37:45,059 INFO L93 Difference]: Finished difference Result 244 states and 348 transitions. [2022-02-20 23:37:45,060 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 348 transitions. [2022-02-20 23:37:45,061 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:37:45,064 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:37:45,064 INFO L74 IsIncluded]: Start isIncluded. First operand has 171 states, 136 states have (on average 1.6102941176470589) internal successors, (219), 153 states have internal predecessors, (219), 11 states have call successors, (11), 6 states have call predecessors, (11), 6 states have return successors, (34), 11 states have call predecessors, (34), 11 states have call successors, (34) Second operand 244 states. [2022-02-20 23:37:45,065 INFO L87 Difference]: Start difference. First operand has 171 states, 136 states have (on average 1.6102941176470589) internal successors, (219), 153 states have internal predecessors, (219), 11 states have call successors, (11), 6 states have call predecessors, (11), 6 states have return successors, (34), 11 states have call predecessors, (34), 11 states have call successors, (34) Second operand 244 states. [2022-02-20 23:37:45,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:37:45,073 INFO L93 Difference]: Finished difference Result 244 states and 348 transitions. [2022-02-20 23:37:45,073 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 348 transitions. [2022-02-20 23:37:45,074 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:37:45,074 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:37:45,074 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:37:45,074 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:37:45,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 136 states have (on average 1.6102941176470589) internal successors, (219), 153 states have internal predecessors, (219), 11 states have call successors, (11), 6 states have call predecessors, (11), 6 states have return successors, (34), 11 states have call predecessors, (34), 11 states have call successors, (34) [2022-02-20 23:37:45,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 264 transitions. [2022-02-20 23:37:45,080 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 264 transitions. Word has length 7 [2022-02-20 23:37:45,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:37:45,080 INFO L470 AbstractCegarLoop]: Abstraction has 171 states and 264 transitions. [2022-02-20 23:37:45,080 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:37:45,080 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 264 transitions. [2022-02-20 23:37:45,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-02-20 23:37:45,081 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:37:45,081 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:37:45,081 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 23:37:45,081 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATION, parse_inputErr1REQUIRES_VIOLATION, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2022-02-20 23:37:45,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:37:45,082 INFO L85 PathProgramCache]: Analyzing trace with hash 705461537, now seen corresponding path program 1 times [2022-02-20 23:37:45,082 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:37:45,082 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334895254] [2022-02-20 23:37:45,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:37:45,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:37:45,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:37:45,204 INFO L290 TraceCheckUtils]: 0: Hoare triple {2274#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(3, 1);call write~init~int(99, 1, 0, 1);call write~init~int(49, 1, 1, 1);call write~init~int(0, 1, 2, 1);call #Ultimate.allocInit(3, 2);call write~init~int(99, 2, 0, 1);call write~init~int(50, 2, 1, 1);call write~init~int(0, 2, 2, 1);call #Ultimate.allocInit(3, 3);call write~init~int(99, 3, 0, 1);call write~init~int(49, 3, 1, 1);call write~init~int(0, 3, 2, 1);call #Ultimate.allocInit(3, 4);call write~init~int(99, 4, 0, 1);call write~init~int(49, 4, 1, 1);call write~init~int(0, 4, 2, 1);call #Ultimate.allocInit(3, 5);call write~init~int(99, 5, 0, 1);call write~init~int(50, 5, 1, 1);call write~init~int(0, 5, 2, 1);~state~0 := ~unnamed3~0~STATE_1;~global~0.base, ~global~0.offset := 0, 0;~#commands~0.base, ~#commands~0.offset := 6, 0;call #Ultimate.allocInit(18, 6);call write~init~$Pointer$(1, 0, ~#commands~0.base, ~#commands~0.offset, 4);call write~init~$Pointer$(#funAddr~c1.base, #funAddr~c1.offset, ~#commands~0.base, 4 + ~#commands~0.offset, 4);call write~init~int((if ~unnamed3~0~STATE_1 % 256 <= 127 then ~unnamed3~0~STATE_1 % 256 else ~unnamed3~0~STATE_1 % 256 - 256), ~#commands~0.base, 8 + ~#commands~0.offset, 1);call write~init~$Pointer$(2, 0, ~#commands~0.base, 9 + ~#commands~0.offset, 4);call write~init~$Pointer$(#funAddr~c2.base, #funAddr~c2.offset, ~#commands~0.base, 13 + ~#commands~0.offset, 4);call write~init~int((if ~unnamed3~0~STATE_2 % 256 <= 127 then ~unnamed3~0~STATE_2 % 256 else ~unnamed3~0~STATE_2 % 256 - 256), ~#commands~0.base, 17 + ~#commands~0.offset, 1); {2276#(and (= 3 (select |#length| 1)) (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0) (= |~#commands~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1))} is VALID [2022-02-20 23:37:45,205 INFO L290 TraceCheckUtils]: 1: Hoare triple {2276#(and (= 3 (select |#length| 1)) (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0) (= |~#commands~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1))} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1; {2276#(and (= 3 (select |#length| 1)) (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0) (= |~#commands~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1))} is VALID [2022-02-20 23:37:45,205 INFO L272 TraceCheckUtils]: 2: Hoare triple {2276#(and (= 3 (select |#length| 1)) (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0) (= |~#commands~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1))} call parse_input(3, 0); {2276#(and (= 3 (select |#length| 1)) (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0) (= |~#commands~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1))} is VALID [2022-02-20 23:37:45,206 INFO L290 TraceCheckUtils]: 3: Hoare triple {2276#(and (= 3 (select |#length| 1)) (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0) (= |~#commands~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1))} ~input#1.base, ~input#1.offset := #in~input#1.base, #in~input#1.offset;~i~0#1 := 0; {2277#(and (= 3 (select |#length| 1)) (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0) (= (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset|) 0) (= |parse_input_~i~0#1| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1))} is VALID [2022-02-20 23:37:45,206 INFO L290 TraceCheckUtils]: 4: Hoare triple {2277#(and (= 3 (select |#length| 1)) (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0) (= (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset|) 0) (= |parse_input_~i~0#1| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1))} assume !!(~i~0#1 < 2); {2277#(and (= 3 (select |#length| 1)) (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0) (= (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset|) 0) (= |parse_input_~i~0#1| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1))} is VALID [2022-02-20 23:37:45,208 INFO L290 TraceCheckUtils]: 5: Hoare triple {2277#(and (= 3 (select |#length| 1)) (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0) (= (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset|) 0) (= |parse_input_~i~0#1| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1))} SUMMARY for call #t~mem3#1.base, #t~mem3#1.offset := read~$Pointer$(~#commands~0.base, ~#commands~0.offset + 9 * ~i~0#1, 4); srcloc: L693 {2278#(and (= (select |#length| |parse_input_#t~mem3#1.base|) 3) (= |parse_input_#t~mem3#1.offset| 0))} is VALID [2022-02-20 23:37:45,208 INFO L290 TraceCheckUtils]: 6: Hoare triple {2278#(and (= (select |#length| |parse_input_#t~mem3#1.base|) 3) (= |parse_input_#t~mem3#1.offset| 0))} assume 1 == #valid[#t~mem3#1.base]; {2278#(and (= (select |#length| |parse_input_#t~mem3#1.base|) 3) (= |parse_input_#t~mem3#1.offset| 0))} is VALID [2022-02-20 23:37:45,208 INFO L290 TraceCheckUtils]: 7: Hoare triple {2278#(and (= (select |#length| |parse_input_#t~mem3#1.base|) 3) (= |parse_input_#t~mem3#1.offset| 0))} assume !(#t~mem3#1.offset < #length[#t~mem3#1.base] && #t~mem3#1.offset >= 0); {2275#false} is VALID [2022-02-20 23:37:45,209 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 23:37:45,209 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:37:45,209 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334895254] [2022-02-20 23:37:45,210 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1334895254] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:37:45,210 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:37:45,210 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 23:37:45,210 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745103766] [2022-02-20 23:37:45,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:37:45,211 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-02-20 23:37:45,211 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:37:45,212 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:37:45,218 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:37:45,218 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 23:37:45,218 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:37:45,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 23:37:45,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:37:45,220 INFO L87 Difference]: Start difference. First operand 171 states and 264 transitions. Second operand has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:37:45,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:37:45,516 INFO L93 Difference]: Finished difference Result 223 states and 309 transitions. [2022-02-20 23:37:45,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 23:37:45,516 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-02-20 23:37:45,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:37:45,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:37:45,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 157 transitions. [2022-02-20 23:37:45,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:37:45,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 157 transitions. [2022-02-20 23:37:45,519 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 157 transitions. [2022-02-20 23:37:45,634 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 157 edges. 157 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:37:45,637 INFO L225 Difference]: With dead ends: 223 [2022-02-20 23:37:45,638 INFO L226 Difference]: Without dead ends: 223 [2022-02-20 23:37:45,638 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-02-20 23:37:45,638 INFO L933 BasicCegarLoop]: 60 mSDtfsCounter, 89 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:37:45,639 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [89 Valid, 204 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:37:45,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2022-02-20 23:37:45,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 171. [2022-02-20 23:37:45,643 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:37:45,644 INFO L82 GeneralOperation]: Start isEquivalent. First operand 223 states. Second operand has 171 states, 136 states have (on average 1.5955882352941178) internal successors, (217), 153 states have internal predecessors, (217), 11 states have call successors, (11), 6 states have call predecessors, (11), 6 states have return successors, (34), 11 states have call predecessors, (34), 11 states have call successors, (34) [2022-02-20 23:37:45,644 INFO L74 IsIncluded]: Start isIncluded. First operand 223 states. Second operand has 171 states, 136 states have (on average 1.5955882352941178) internal successors, (217), 153 states have internal predecessors, (217), 11 states have call successors, (11), 6 states have call predecessors, (11), 6 states have return successors, (34), 11 states have call predecessors, (34), 11 states have call successors, (34) [2022-02-20 23:37:45,645 INFO L87 Difference]: Start difference. First operand 223 states. Second operand has 171 states, 136 states have (on average 1.5955882352941178) internal successors, (217), 153 states have internal predecessors, (217), 11 states have call successors, (11), 6 states have call predecessors, (11), 6 states have return successors, (34), 11 states have call predecessors, (34), 11 states have call successors, (34) [2022-02-20 23:37:45,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:37:45,651 INFO L93 Difference]: Finished difference Result 223 states and 309 transitions. [2022-02-20 23:37:45,651 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 309 transitions. [2022-02-20 23:37:45,652 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:37:45,652 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:37:45,653 INFO L74 IsIncluded]: Start isIncluded. First operand has 171 states, 136 states have (on average 1.5955882352941178) internal successors, (217), 153 states have internal predecessors, (217), 11 states have call successors, (11), 6 states have call predecessors, (11), 6 states have return successors, (34), 11 states have call predecessors, (34), 11 states have call successors, (34) Second operand 223 states. [2022-02-20 23:37:45,653 INFO L87 Difference]: Start difference. First operand has 171 states, 136 states have (on average 1.5955882352941178) internal successors, (217), 153 states have internal predecessors, (217), 11 states have call successors, (11), 6 states have call predecessors, (11), 6 states have return successors, (34), 11 states have call predecessors, (34), 11 states have call successors, (34) Second operand 223 states. [2022-02-20 23:37:45,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:37:45,659 INFO L93 Difference]: Finished difference Result 223 states and 309 transitions. [2022-02-20 23:37:45,660 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 309 transitions. [2022-02-20 23:37:45,661 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:37:45,661 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:37:45,661 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:37:45,661 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:37:45,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 136 states have (on average 1.5955882352941178) internal successors, (217), 153 states have internal predecessors, (217), 11 states have call successors, (11), 6 states have call predecessors, (11), 6 states have return successors, (34), 11 states have call predecessors, (34), 11 states have call successors, (34) [2022-02-20 23:37:45,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 262 transitions. [2022-02-20 23:37:45,666 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 262 transitions. Word has length 8 [2022-02-20 23:37:45,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:37:45,666 INFO L470 AbstractCegarLoop]: Abstraction has 171 states and 262 transitions. [2022-02-20 23:37:45,666 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:37:45,666 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 262 transitions. [2022-02-20 23:37:45,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-02-20 23:37:45,667 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:37:45,667 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:37:45,667 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 23:37:45,667 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATION, parse_inputErr1REQUIRES_VIOLATION, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2022-02-20 23:37:45,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:37:45,667 INFO L85 PathProgramCache]: Analyzing trace with hash 394471214, now seen corresponding path program 1 times [2022-02-20 23:37:45,667 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:37:45,668 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580293693] [2022-02-20 23:37:45,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:37:45,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:37:45,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:37:45,702 INFO L290 TraceCheckUtils]: 0: Hoare triple {3123#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(3, 1);call write~init~int(99, 1, 0, 1);call write~init~int(49, 1, 1, 1);call write~init~int(0, 1, 2, 1);call #Ultimate.allocInit(3, 2);call write~init~int(99, 2, 0, 1);call write~init~int(50, 2, 1, 1);call write~init~int(0, 2, 2, 1);call #Ultimate.allocInit(3, 3);call write~init~int(99, 3, 0, 1);call write~init~int(49, 3, 1, 1);call write~init~int(0, 3, 2, 1);call #Ultimate.allocInit(3, 4);call write~init~int(99, 4, 0, 1);call write~init~int(49, 4, 1, 1);call write~init~int(0, 4, 2, 1);call #Ultimate.allocInit(3, 5);call write~init~int(99, 5, 0, 1);call write~init~int(50, 5, 1, 1);call write~init~int(0, 5, 2, 1);~state~0 := ~unnamed3~0~STATE_1;~global~0.base, ~global~0.offset := 0, 0;~#commands~0.base, ~#commands~0.offset := 6, 0;call #Ultimate.allocInit(18, 6);call write~init~$Pointer$(1, 0, ~#commands~0.base, ~#commands~0.offset, 4);call write~init~$Pointer$(#funAddr~c1.base, #funAddr~c1.offset, ~#commands~0.base, 4 + ~#commands~0.offset, 4);call write~init~int((if ~unnamed3~0~STATE_1 % 256 <= 127 then ~unnamed3~0~STATE_1 % 256 else ~unnamed3~0~STATE_1 % 256 - 256), ~#commands~0.base, 8 + ~#commands~0.offset, 1);call write~init~$Pointer$(2, 0, ~#commands~0.base, 9 + ~#commands~0.offset, 4);call write~init~$Pointer$(#funAddr~c2.base, #funAddr~c2.offset, ~#commands~0.base, 13 + ~#commands~0.offset, 4);call write~init~int((if ~unnamed3~0~STATE_2 % 256 <= 127 then ~unnamed3~0~STATE_2 % 256 else ~unnamed3~0~STATE_2 % 256 - 256), ~#commands~0.base, 17 + ~#commands~0.offset, 1); {3125#(= (select |#valid| 3) 1)} is VALID [2022-02-20 23:37:45,702 INFO L290 TraceCheckUtils]: 1: Hoare triple {3125#(= (select |#valid| 3) 1)} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1; {3125#(= (select |#valid| 3) 1)} is VALID [2022-02-20 23:37:45,703 INFO L272 TraceCheckUtils]: 2: Hoare triple {3125#(= (select |#valid| 3) 1)} call parse_input(3, 0); {3126#(and (= (select |#valid| 3) 1) (= |parse_input_#in~input#1.base| 3))} is VALID [2022-02-20 23:37:45,703 INFO L290 TraceCheckUtils]: 3: Hoare triple {3126#(and (= (select |#valid| 3) 1) (= |parse_input_#in~input#1.base| 3))} ~input#1.base, ~input#1.offset := #in~input#1.base, #in~input#1.offset;~i~0#1 := 0; {3127#(and (= 3 |parse_input_~input#1.base|) (= (select |#valid| |parse_input_~input#1.base|) 1))} is VALID [2022-02-20 23:37:45,704 INFO L290 TraceCheckUtils]: 4: Hoare triple {3127#(and (= 3 |parse_input_~input#1.base|) (= (select |#valid| |parse_input_~input#1.base|) 1))} assume !!(~i~0#1 < 2); {3127#(and (= 3 |parse_input_~input#1.base|) (= (select |#valid| |parse_input_~input#1.base|) 1))} is VALID [2022-02-20 23:37:45,704 INFO L290 TraceCheckUtils]: 5: Hoare triple {3127#(and (= 3 |parse_input_~input#1.base|) (= (select |#valid| |parse_input_~input#1.base|) 1))} SUMMARY for call #t~mem3#1.base, #t~mem3#1.offset := read~$Pointer$(~#commands~0.base, ~#commands~0.offset + 9 * ~i~0#1, 4); srcloc: L693 {3127#(and (= 3 |parse_input_~input#1.base|) (= (select |#valid| |parse_input_~input#1.base|) 1))} is VALID [2022-02-20 23:37:45,705 INFO L290 TraceCheckUtils]: 6: Hoare triple {3127#(and (= 3 |parse_input_~input#1.base|) (= (select |#valid| |parse_input_~input#1.base|) 1))} assume 1 == #valid[#t~mem3#1.base]; {3127#(and (= 3 |parse_input_~input#1.base|) (= (select |#valid| |parse_input_~input#1.base|) 1))} is VALID [2022-02-20 23:37:45,705 INFO L290 TraceCheckUtils]: 7: Hoare triple {3127#(and (= 3 |parse_input_~input#1.base|) (= (select |#valid| |parse_input_~input#1.base|) 1))} assume #t~mem3#1.offset < #length[#t~mem3#1.base] && #t~mem3#1.offset >= 0; {3127#(and (= 3 |parse_input_~input#1.base|) (= (select |#valid| |parse_input_~input#1.base|) 1))} is VALID [2022-02-20 23:37:45,705 INFO L290 TraceCheckUtils]: 8: Hoare triple {3127#(and (= 3 |parse_input_~input#1.base|) (= (select |#valid| |parse_input_~input#1.base|) 1))} assume !(1 == #valid[~input#1.base]); {3124#false} is VALID [2022-02-20 23:37:45,706 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 23:37:45,706 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:37:45,706 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580293693] [2022-02-20 23:37:45,706 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1580293693] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:37:45,706 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:37:45,706 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 23:37:45,706 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672176520] [2022-02-20 23:37:45,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:37:45,706 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-02-20 23:37:45,707 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:37:45,707 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:37:45,713 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:37:45,713 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 23:37:45,713 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:37:45,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 23:37:45,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:37:45,714 INFO L87 Difference]: Start difference. First operand 171 states and 262 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:37:45,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:37:45,947 INFO L93 Difference]: Finished difference Result 250 states and 344 transitions. [2022-02-20 23:37:45,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 23:37:45,948 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-02-20 23:37:45,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:37:45,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:37:45,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 170 transitions. [2022-02-20 23:37:45,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:37:45,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 170 transitions. [2022-02-20 23:37:45,952 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 170 transitions. [2022-02-20 23:37:46,077 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 170 edges. 170 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:37:46,080 INFO L225 Difference]: With dead ends: 250 [2022-02-20 23:37:46,080 INFO L226 Difference]: Without dead ends: 250 [2022-02-20 23:37:46,081 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-02-20 23:37:46,081 INFO L933 BasicCegarLoop]: 51 mSDtfsCounter, 135 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:37:46,081 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [135 Valid, 193 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:37:46,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2022-02-20 23:37:46,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 207. [2022-02-20 23:37:46,090 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:37:46,090 INFO L82 GeneralOperation]: Start isEquivalent. First operand 250 states. Second operand has 207 states, 170 states have (on average 1.5705882352941176) internal successors, (267), 188 states have internal predecessors, (267), 11 states have call successors, (11), 7 states have call predecessors, (11), 8 states have return successors, (34), 11 states have call predecessors, (34), 11 states have call successors, (34) [2022-02-20 23:37:46,092 INFO L74 IsIncluded]: Start isIncluded. First operand 250 states. Second operand has 207 states, 170 states have (on average 1.5705882352941176) internal successors, (267), 188 states have internal predecessors, (267), 11 states have call successors, (11), 7 states have call predecessors, (11), 8 states have return successors, (34), 11 states have call predecessors, (34), 11 states have call successors, (34) [2022-02-20 23:37:46,093 INFO L87 Difference]: Start difference. First operand 250 states. Second operand has 207 states, 170 states have (on average 1.5705882352941176) internal successors, (267), 188 states have internal predecessors, (267), 11 states have call successors, (11), 7 states have call predecessors, (11), 8 states have return successors, (34), 11 states have call predecessors, (34), 11 states have call successors, (34) [2022-02-20 23:37:46,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:37:46,100 INFO L93 Difference]: Finished difference Result 250 states and 344 transitions. [2022-02-20 23:37:46,100 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 344 transitions. [2022-02-20 23:37:46,102 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:37:46,102 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:37:46,102 INFO L74 IsIncluded]: Start isIncluded. First operand has 207 states, 170 states have (on average 1.5705882352941176) internal successors, (267), 188 states have internal predecessors, (267), 11 states have call successors, (11), 7 states have call predecessors, (11), 8 states have return successors, (34), 11 states have call predecessors, (34), 11 states have call successors, (34) Second operand 250 states. [2022-02-20 23:37:46,103 INFO L87 Difference]: Start difference. First operand has 207 states, 170 states have (on average 1.5705882352941176) internal successors, (267), 188 states have internal predecessors, (267), 11 states have call successors, (11), 7 states have call predecessors, (11), 8 states have return successors, (34), 11 states have call predecessors, (34), 11 states have call successors, (34) Second operand 250 states. [2022-02-20 23:37:46,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:37:46,128 INFO L93 Difference]: Finished difference Result 250 states and 344 transitions. [2022-02-20 23:37:46,137 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 344 transitions. [2022-02-20 23:37:46,138 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:37:46,139 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:37:46,139 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:37:46,139 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:37:46,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 170 states have (on average 1.5705882352941176) internal successors, (267), 188 states have internal predecessors, (267), 11 states have call successors, (11), 7 states have call predecessors, (11), 8 states have return successors, (34), 11 states have call predecessors, (34), 11 states have call successors, (34) [2022-02-20 23:37:46,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 312 transitions. [2022-02-20 23:37:46,145 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 312 transitions. Word has length 9 [2022-02-20 23:37:46,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:37:46,145 INFO L470 AbstractCegarLoop]: Abstraction has 207 states and 312 transitions. [2022-02-20 23:37:46,146 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:37:46,146 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 312 transitions. [2022-02-20 23:37:46,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-02-20 23:37:46,146 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:37:46,146 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:37:46,146 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 23:37:46,147 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting parse_inputErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATION, parse_inputErr1REQUIRES_VIOLATION, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2022-02-20 23:37:46,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:37:46,147 INFO L85 PathProgramCache]: Analyzing trace with hash -656294205, now seen corresponding path program 1 times [2022-02-20 23:37:46,147 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:37:46,147 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735677130] [2022-02-20 23:37:46,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:37:46,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:37:46,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:37:46,187 INFO L290 TraceCheckUtils]: 0: Hoare triple {4089#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(3, 1);call write~init~int(99, 1, 0, 1);call write~init~int(49, 1, 1, 1);call write~init~int(0, 1, 2, 1);call #Ultimate.allocInit(3, 2);call write~init~int(99, 2, 0, 1);call write~init~int(50, 2, 1, 1);call write~init~int(0, 2, 2, 1);call #Ultimate.allocInit(3, 3);call write~init~int(99, 3, 0, 1);call write~init~int(49, 3, 1, 1);call write~init~int(0, 3, 2, 1);call #Ultimate.allocInit(3, 4);call write~init~int(99, 4, 0, 1);call write~init~int(49, 4, 1, 1);call write~init~int(0, 4, 2, 1);call #Ultimate.allocInit(3, 5);call write~init~int(99, 5, 0, 1);call write~init~int(50, 5, 1, 1);call write~init~int(0, 5, 2, 1);~state~0 := ~unnamed3~0~STATE_1;~global~0.base, ~global~0.offset := 0, 0;~#commands~0.base, ~#commands~0.offset := 6, 0;call #Ultimate.allocInit(18, 6);call write~init~$Pointer$(1, 0, ~#commands~0.base, ~#commands~0.offset, 4);call write~init~$Pointer$(#funAddr~c1.base, #funAddr~c1.offset, ~#commands~0.base, 4 + ~#commands~0.offset, 4);call write~init~int((if ~unnamed3~0~STATE_1 % 256 <= 127 then ~unnamed3~0~STATE_1 % 256 else ~unnamed3~0~STATE_1 % 256 - 256), ~#commands~0.base, 8 + ~#commands~0.offset, 1);call write~init~$Pointer$(2, 0, ~#commands~0.base, 9 + ~#commands~0.offset, 4);call write~init~$Pointer$(#funAddr~c2.base, #funAddr~c2.offset, ~#commands~0.base, 13 + ~#commands~0.offset, 4);call write~init~int((if ~unnamed3~0~STATE_2 % 256 <= 127 then ~unnamed3~0~STATE_2 % 256 else ~unnamed3~0~STATE_2 % 256 - 256), ~#commands~0.base, 17 + ~#commands~0.offset, 1); {4091#(= 3 (select |#length| 3))} is VALID [2022-02-20 23:37:46,187 INFO L290 TraceCheckUtils]: 1: Hoare triple {4091#(= 3 (select |#length| 3))} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1; {4091#(= 3 (select |#length| 3))} is VALID [2022-02-20 23:37:46,188 INFO L272 TraceCheckUtils]: 2: Hoare triple {4091#(= 3 (select |#length| 3))} call parse_input(3, 0); {4092#(and (= 3 (select |#length| 3)) (= |parse_input_#in~input#1.base| 3) (= |parse_input_#in~input#1.offset| 0))} is VALID [2022-02-20 23:37:46,188 INFO L290 TraceCheckUtils]: 3: Hoare triple {4092#(and (= 3 (select |#length| 3)) (= |parse_input_#in~input#1.base| 3) (= |parse_input_#in~input#1.offset| 0))} ~input#1.base, ~input#1.offset := #in~input#1.base, #in~input#1.offset;~i~0#1 := 0; {4093#(and (= (+ (select |#length| |parse_input_~input#1.base|) (- 3)) 0) (= |parse_input_~input#1.offset| 0))} is VALID [2022-02-20 23:37:46,189 INFO L290 TraceCheckUtils]: 4: Hoare triple {4093#(and (= (+ (select |#length| |parse_input_~input#1.base|) (- 3)) 0) (= |parse_input_~input#1.offset| 0))} assume !!(~i~0#1 < 2); {4093#(and (= (+ (select |#length| |parse_input_~input#1.base|) (- 3)) 0) (= |parse_input_~input#1.offset| 0))} is VALID [2022-02-20 23:37:46,189 INFO L290 TraceCheckUtils]: 5: Hoare triple {4093#(and (= (+ (select |#length| |parse_input_~input#1.base|) (- 3)) 0) (= |parse_input_~input#1.offset| 0))} SUMMARY for call #t~mem3#1.base, #t~mem3#1.offset := read~$Pointer$(~#commands~0.base, ~#commands~0.offset + 9 * ~i~0#1, 4); srcloc: L693 {4093#(and (= (+ (select |#length| |parse_input_~input#1.base|) (- 3)) 0) (= |parse_input_~input#1.offset| 0))} is VALID [2022-02-20 23:37:46,190 INFO L290 TraceCheckUtils]: 6: Hoare triple {4093#(and (= (+ (select |#length| |parse_input_~input#1.base|) (- 3)) 0) (= |parse_input_~input#1.offset| 0))} assume 1 == #valid[#t~mem3#1.base]; {4093#(and (= (+ (select |#length| |parse_input_~input#1.base|) (- 3)) 0) (= |parse_input_~input#1.offset| 0))} is VALID [2022-02-20 23:37:46,190 INFO L290 TraceCheckUtils]: 7: Hoare triple {4093#(and (= (+ (select |#length| |parse_input_~input#1.base|) (- 3)) 0) (= |parse_input_~input#1.offset| 0))} assume #t~mem3#1.offset < #length[#t~mem3#1.base] && #t~mem3#1.offset >= 0; {4093#(and (= (+ (select |#length| |parse_input_~input#1.base|) (- 3)) 0) (= |parse_input_~input#1.offset| 0))} is VALID [2022-02-20 23:37:46,191 INFO L290 TraceCheckUtils]: 8: Hoare triple {4093#(and (= (+ (select |#length| |parse_input_~input#1.base|) (- 3)) 0) (= |parse_input_~input#1.offset| 0))} assume 1 == #valid[~input#1.base]; {4093#(and (= (+ (select |#length| |parse_input_~input#1.base|) (- 3)) 0) (= |parse_input_~input#1.offset| 0))} is VALID [2022-02-20 23:37:46,191 INFO L290 TraceCheckUtils]: 9: Hoare triple {4093#(and (= (+ (select |#length| |parse_input_~input#1.base|) (- 3)) 0) (= |parse_input_~input#1.offset| 0))} assume !(~input#1.offset < #length[~input#1.base] && ~input#1.offset >= 0); {4090#false} is VALID [2022-02-20 23:37:46,192 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 23:37:46,192 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:37:46,192 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735677130] [2022-02-20 23:37:46,192 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [735677130] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:37:46,192 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:37:46,193 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 23:37:46,193 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552762292] [2022-02-20 23:37:46,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:37:46,193 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-02-20 23:37:46,193 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:37:46,194 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:37:46,201 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:37:46,201 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 23:37:46,202 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:37:46,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 23:37:46,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:37:46,202 INFO L87 Difference]: Start difference. First operand 207 states and 312 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:37:46,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:37:46,429 INFO L93 Difference]: Finished difference Result 245 states and 327 transitions. [2022-02-20 23:37:46,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 23:37:46,430 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-02-20 23:37:46,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:37:46,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:37:46,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 158 transitions. [2022-02-20 23:37:46,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:37:46,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 158 transitions. [2022-02-20 23:37:46,432 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 158 transitions. [2022-02-20 23:37:46,535 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 158 edges. 158 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:37:46,539 INFO L225 Difference]: With dead ends: 245 [2022-02-20 23:37:46,539 INFO L226 Difference]: Without dead ends: 245 [2022-02-20 23:37:46,539 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-02-20 23:37:46,540 INFO L933 BasicCegarLoop]: 56 mSDtfsCounter, 121 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:37:46,540 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [121 Valid, 213 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:37:46,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2022-02-20 23:37:46,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 217. [2022-02-20 23:37:46,544 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:37:46,544 INFO L82 GeneralOperation]: Start isEquivalent. First operand 245 states. Second operand has 217 states, 179 states have (on average 1.5642458100558658) internal successors, (280), 198 states have internal predecessors, (280), 11 states have call successors, (11), 7 states have call predecessors, (11), 9 states have return successors, (34), 11 states have call predecessors, (34), 11 states have call successors, (34) [2022-02-20 23:37:46,545 INFO L74 IsIncluded]: Start isIncluded. First operand 245 states. Second operand has 217 states, 179 states have (on average 1.5642458100558658) internal successors, (280), 198 states have internal predecessors, (280), 11 states have call successors, (11), 7 states have call predecessors, (11), 9 states have return successors, (34), 11 states have call predecessors, (34), 11 states have call successors, (34) [2022-02-20 23:37:46,545 INFO L87 Difference]: Start difference. First operand 245 states. Second operand has 217 states, 179 states have (on average 1.5642458100558658) internal successors, (280), 198 states have internal predecessors, (280), 11 states have call successors, (11), 7 states have call predecessors, (11), 9 states have return successors, (34), 11 states have call predecessors, (34), 11 states have call successors, (34) [2022-02-20 23:37:46,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:37:46,550 INFO L93 Difference]: Finished difference Result 245 states and 327 transitions. [2022-02-20 23:37:46,550 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 327 transitions. [2022-02-20 23:37:46,551 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:37:46,551 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:37:46,552 INFO L74 IsIncluded]: Start isIncluded. First operand has 217 states, 179 states have (on average 1.5642458100558658) internal successors, (280), 198 states have internal predecessors, (280), 11 states have call successors, (11), 7 states have call predecessors, (11), 9 states have return successors, (34), 11 states have call predecessors, (34), 11 states have call successors, (34) Second operand 245 states. [2022-02-20 23:37:46,552 INFO L87 Difference]: Start difference. First operand has 217 states, 179 states have (on average 1.5642458100558658) internal successors, (280), 198 states have internal predecessors, (280), 11 states have call successors, (11), 7 states have call predecessors, (11), 9 states have return successors, (34), 11 states have call predecessors, (34), 11 states have call successors, (34) Second operand 245 states. [2022-02-20 23:37:46,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:37:46,557 INFO L93 Difference]: Finished difference Result 245 states and 327 transitions. [2022-02-20 23:37:46,557 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 327 transitions. [2022-02-20 23:37:46,558 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:37:46,558 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:37:46,558 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:37:46,558 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:37:46,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 179 states have (on average 1.5642458100558658) internal successors, (280), 198 states have internal predecessors, (280), 11 states have call successors, (11), 7 states have call predecessors, (11), 9 states have return successors, (34), 11 states have call predecessors, (34), 11 states have call successors, (34) [2022-02-20 23:37:46,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 325 transitions. [2022-02-20 23:37:46,563 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 325 transitions. Word has length 10 [2022-02-20 23:37:46,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:37:46,563 INFO L470 AbstractCegarLoop]: Abstraction has 217 states and 325 transitions. [2022-02-20 23:37:46,563 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:37:46,563 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 325 transitions. [2022-02-20 23:37:46,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-02-20 23:37:46,564 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:37:46,564 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:37:46,564 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 23:37:46,564 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting parse_inputErr1REQUIRES_VIOLATION === [parse_inputErr0REQUIRES_VIOLATION, parse_inputErr1REQUIRES_VIOLATION, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2022-02-20 23:37:46,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:37:46,565 INFO L85 PathProgramCache]: Analyzing trace with hash 12795785, now seen corresponding path program 1 times [2022-02-20 23:37:46,565 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:37:46,565 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421968792] [2022-02-20 23:37:46,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:37:46,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:37:46,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:37:46,670 INFO L290 TraceCheckUtils]: 0: Hoare triple {5050#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(3, 1);call write~init~int(99, 1, 0, 1);call write~init~int(49, 1, 1, 1);call write~init~int(0, 1, 2, 1);call #Ultimate.allocInit(3, 2);call write~init~int(99, 2, 0, 1);call write~init~int(50, 2, 1, 1);call write~init~int(0, 2, 2, 1);call #Ultimate.allocInit(3, 3);call write~init~int(99, 3, 0, 1);call write~init~int(49, 3, 1, 1);call write~init~int(0, 3, 2, 1);call #Ultimate.allocInit(3, 4);call write~init~int(99, 4, 0, 1);call write~init~int(49, 4, 1, 1);call write~init~int(0, 4, 2, 1);call #Ultimate.allocInit(3, 5);call write~init~int(99, 5, 0, 1);call write~init~int(50, 5, 1, 1);call write~init~int(0, 5, 2, 1);~state~0 := ~unnamed3~0~STATE_1;~global~0.base, ~global~0.offset := 0, 0;~#commands~0.base, ~#commands~0.offset := 6, 0;call #Ultimate.allocInit(18, 6);call write~init~$Pointer$(1, 0, ~#commands~0.base, ~#commands~0.offset, 4);call write~init~$Pointer$(#funAddr~c1.base, #funAddr~c1.offset, ~#commands~0.base, 4 + ~#commands~0.offset, 4);call write~init~int((if ~unnamed3~0~STATE_1 % 256 <= 127 then ~unnamed3~0~STATE_1 % 256 else ~unnamed3~0~STATE_1 % 256 - 256), ~#commands~0.base, 8 + ~#commands~0.offset, 1);call write~init~$Pointer$(2, 0, ~#commands~0.base, 9 + ~#commands~0.offset, 4);call write~init~$Pointer$(#funAddr~c2.base, #funAddr~c2.offset, ~#commands~0.base, 13 + ~#commands~0.offset, 4);call write~init~int((if ~unnamed3~0~STATE_2 % 256 <= 127 then ~unnamed3~0~STATE_2 % 256 else ~unnamed3~0~STATE_2 % 256 - 256), ~#commands~0.base, 17 + ~#commands~0.offset, 1); {5052#(and (= 6 |~#commands~0.base|) (= (select |#length| 6) 18) (<= 0 |~#commands~0.offset|) (<= |~#commands~0.offset| 0))} is VALID [2022-02-20 23:37:46,671 INFO L290 TraceCheckUtils]: 1: Hoare triple {5052#(and (= 6 |~#commands~0.base|) (= (select |#length| 6) 18) (<= 0 |~#commands~0.offset|) (<= |~#commands~0.offset| 0))} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1; {5052#(and (= 6 |~#commands~0.base|) (= (select |#length| 6) 18) (<= 0 |~#commands~0.offset|) (<= |~#commands~0.offset| 0))} is VALID [2022-02-20 23:37:46,672 INFO L272 TraceCheckUtils]: 2: Hoare triple {5052#(and (= 6 |~#commands~0.base|) (= (select |#length| 6) 18) (<= 0 |~#commands~0.offset|) (<= |~#commands~0.offset| 0))} call parse_input(3, 0); {5053#(and (= (+ (select |#length| |~#commands~0.base|) (- 18)) 0) (<= 0 |~#commands~0.offset|) (<= |~#commands~0.offset| 0))} is VALID [2022-02-20 23:37:46,672 INFO L290 TraceCheckUtils]: 3: Hoare triple {5053#(and (= (+ (select |#length| |~#commands~0.base|) (- 18)) 0) (<= 0 |~#commands~0.offset|) (<= |~#commands~0.offset| 0))} ~input#1.base, ~input#1.offset := #in~input#1.base, #in~input#1.offset;~i~0#1 := 0; {5054#(and (= (+ (select |#length| |~#commands~0.base|) (- 18)) 0) (<= 0 |~#commands~0.offset|) (= |parse_input_~i~0#1| 0) (<= |~#commands~0.offset| 0))} is VALID [2022-02-20 23:37:46,676 INFO L290 TraceCheckUtils]: 4: Hoare triple {5054#(and (= (+ (select |#length| |~#commands~0.base|) (- 18)) 0) (<= 0 |~#commands~0.offset|) (= |parse_input_~i~0#1| 0) (<= |~#commands~0.offset| 0))} assume !!(~i~0#1 < 2); {5054#(and (= (+ (select |#length| |~#commands~0.base|) (- 18)) 0) (<= 0 |~#commands~0.offset|) (= |parse_input_~i~0#1| 0) (<= |~#commands~0.offset| 0))} is VALID [2022-02-20 23:37:46,676 INFO L290 TraceCheckUtils]: 5: Hoare triple {5054#(and (= (+ (select |#length| |~#commands~0.base|) (- 18)) 0) (<= 0 |~#commands~0.offset|) (= |parse_input_~i~0#1| 0) (<= |~#commands~0.offset| 0))} SUMMARY for call #t~mem3#1.base, #t~mem3#1.offset := read~$Pointer$(~#commands~0.base, ~#commands~0.offset + 9 * ~i~0#1, 4); srcloc: L693 {5054#(and (= (+ (select |#length| |~#commands~0.base|) (- 18)) 0) (<= 0 |~#commands~0.offset|) (= |parse_input_~i~0#1| 0) (<= |~#commands~0.offset| 0))} is VALID [2022-02-20 23:37:46,677 INFO L290 TraceCheckUtils]: 6: Hoare triple {5054#(and (= (+ (select |#length| |~#commands~0.base|) (- 18)) 0) (<= 0 |~#commands~0.offset|) (= |parse_input_~i~0#1| 0) (<= |~#commands~0.offset| 0))} assume 1 == #valid[#t~mem3#1.base]; {5054#(and (= (+ (select |#length| |~#commands~0.base|) (- 18)) 0) (<= 0 |~#commands~0.offset|) (= |parse_input_~i~0#1| 0) (<= |~#commands~0.offset| 0))} is VALID [2022-02-20 23:37:46,678 INFO L290 TraceCheckUtils]: 7: Hoare triple {5054#(and (= (+ (select |#length| |~#commands~0.base|) (- 18)) 0) (<= 0 |~#commands~0.offset|) (= |parse_input_~i~0#1| 0) (<= |~#commands~0.offset| 0))} assume #t~mem3#1.offset < #length[#t~mem3#1.base] && #t~mem3#1.offset >= 0; {5054#(and (= (+ (select |#length| |~#commands~0.base|) (- 18)) 0) (<= 0 |~#commands~0.offset|) (= |parse_input_~i~0#1| 0) (<= |~#commands~0.offset| 0))} is VALID [2022-02-20 23:37:46,678 INFO L290 TraceCheckUtils]: 8: Hoare triple {5054#(and (= (+ (select |#length| |~#commands~0.base|) (- 18)) 0) (<= 0 |~#commands~0.offset|) (= |parse_input_~i~0#1| 0) (<= |~#commands~0.offset| 0))} assume 1 == #valid[~input#1.base]; {5054#(and (= (+ (select |#length| |~#commands~0.base|) (- 18)) 0) (<= 0 |~#commands~0.offset|) (= |parse_input_~i~0#1| 0) (<= |~#commands~0.offset| 0))} is VALID [2022-02-20 23:37:46,685 INFO L290 TraceCheckUtils]: 9: Hoare triple {5054#(and (= (+ (select |#length| |~#commands~0.base|) (- 18)) 0) (<= 0 |~#commands~0.offset|) (= |parse_input_~i~0#1| 0) (<= |~#commands~0.offset| 0))} assume ~input#1.offset < #length[~input#1.base] && ~input#1.offset >= 0; {5054#(and (= (+ (select |#length| |~#commands~0.base|) (- 18)) 0) (<= 0 |~#commands~0.offset|) (= |parse_input_~i~0#1| 0) (<= |~#commands~0.offset| 0))} is VALID [2022-02-20 23:37:46,686 INFO L290 TraceCheckUtils]: 10: Hoare triple {5054#(and (= (+ (select |#length| |~#commands~0.base|) (- 18)) 0) (<= 0 |~#commands~0.offset|) (= |parse_input_~i~0#1| 0) (<= |~#commands~0.offset| 0))} assume !(0 == #t~nondet4#1);havoc #t~mem3#1.base, #t~mem3#1.offset;havoc #t~nondet4#1; {5054#(and (= (+ (select |#length| |~#commands~0.base|) (- 18)) 0) (<= 0 |~#commands~0.offset|) (= |parse_input_~i~0#1| 0) (<= |~#commands~0.offset| 0))} is VALID [2022-02-20 23:37:46,686 INFO L290 TraceCheckUtils]: 11: Hoare triple {5054#(and (= (+ (select |#length| |~#commands~0.base|) (- 18)) 0) (<= 0 |~#commands~0.offset|) (= |parse_input_~i~0#1| 0) (<= |~#commands~0.offset| 0))} #t~post2#1 := ~i~0#1;~i~0#1 := 1 + #t~post2#1;havoc #t~post2#1; {5055#(and (<= 9 (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset|)) (= (+ (select |#length| |~#commands~0.base|) (- 18)) 0) (<= |~#commands~0.offset| 0))} is VALID [2022-02-20 23:37:46,687 INFO L290 TraceCheckUtils]: 12: Hoare triple {5055#(and (<= 9 (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset|)) (= (+ (select |#length| |~#commands~0.base|) (- 18)) 0) (<= |~#commands~0.offset| 0))} assume !!(~i~0#1 < 2); {5056#(and (<= 9 (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset|)) (= (+ (select |#length| |~#commands~0.base|) (- 18)) 0) (<= (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset|) 9))} is VALID [2022-02-20 23:37:46,688 INFO L290 TraceCheckUtils]: 13: Hoare triple {5056#(and (<= 9 (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset|)) (= (+ (select |#length| |~#commands~0.base|) (- 18)) 0) (<= (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset|) 9))} assume !(4 + (~#commands~0.offset + 9 * ~i~0#1) <= #length[~#commands~0.base] && 0 <= ~#commands~0.offset + 9 * ~i~0#1); {5051#false} is VALID [2022-02-20 23:37:46,688 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:37:46,688 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:37:46,689 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1421968792] [2022-02-20 23:37:46,689 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1421968792] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 23:37:46,689 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [116721714] [2022-02-20 23:37:46,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:37:46,689 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:37:46,689 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:37:46,691 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 23:37:46,711 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 23:37:46,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:37:46,791 INFO L263 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 12 conjunts are in the unsatisfiable core [2022-02-20 23:37:46,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:37:46,814 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:37:47,052 INFO L290 TraceCheckUtils]: 0: Hoare triple {5050#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(3, 1);call write~init~int(99, 1, 0, 1);call write~init~int(49, 1, 1, 1);call write~init~int(0, 1, 2, 1);call #Ultimate.allocInit(3, 2);call write~init~int(99, 2, 0, 1);call write~init~int(50, 2, 1, 1);call write~init~int(0, 2, 2, 1);call #Ultimate.allocInit(3, 3);call write~init~int(99, 3, 0, 1);call write~init~int(49, 3, 1, 1);call write~init~int(0, 3, 2, 1);call #Ultimate.allocInit(3, 4);call write~init~int(99, 4, 0, 1);call write~init~int(49, 4, 1, 1);call write~init~int(0, 4, 2, 1);call #Ultimate.allocInit(3, 5);call write~init~int(99, 5, 0, 1);call write~init~int(50, 5, 1, 1);call write~init~int(0, 5, 2, 1);~state~0 := ~unnamed3~0~STATE_1;~global~0.base, ~global~0.offset := 0, 0;~#commands~0.base, ~#commands~0.offset := 6, 0;call #Ultimate.allocInit(18, 6);call write~init~$Pointer$(1, 0, ~#commands~0.base, ~#commands~0.offset, 4);call write~init~$Pointer$(#funAddr~c1.base, #funAddr~c1.offset, ~#commands~0.base, 4 + ~#commands~0.offset, 4);call write~init~int((if ~unnamed3~0~STATE_1 % 256 <= 127 then ~unnamed3~0~STATE_1 % 256 else ~unnamed3~0~STATE_1 % 256 - 256), ~#commands~0.base, 8 + ~#commands~0.offset, 1);call write~init~$Pointer$(2, 0, ~#commands~0.base, 9 + ~#commands~0.offset, 4);call write~init~$Pointer$(#funAddr~c2.base, #funAddr~c2.offset, ~#commands~0.base, 13 + ~#commands~0.offset, 4);call write~init~int((if ~unnamed3~0~STATE_2 % 256 <= 127 then ~unnamed3~0~STATE_2 % 256 else ~unnamed3~0~STATE_2 % 256 - 256), ~#commands~0.base, 17 + ~#commands~0.offset, 1); {5060#(and (= 6 |~#commands~0.base|) (<= 18 (select |#length| 6)) (= |~#commands~0.offset| 0))} is VALID [2022-02-20 23:37:47,053 INFO L290 TraceCheckUtils]: 1: Hoare triple {5060#(and (= 6 |~#commands~0.base|) (<= 18 (select |#length| 6)) (= |~#commands~0.offset| 0))} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1; {5060#(and (= 6 |~#commands~0.base|) (<= 18 (select |#length| 6)) (= |~#commands~0.offset| 0))} is VALID [2022-02-20 23:37:47,054 INFO L272 TraceCheckUtils]: 2: Hoare triple {5060#(and (= 6 |~#commands~0.base|) (<= 18 (select |#length| 6)) (= |~#commands~0.offset| 0))} call parse_input(3, 0); {5060#(and (= 6 |~#commands~0.base|) (<= 18 (select |#length| 6)) (= |~#commands~0.offset| 0))} is VALID [2022-02-20 23:37:47,054 INFO L290 TraceCheckUtils]: 3: Hoare triple {5060#(and (= 6 |~#commands~0.base|) (<= 18 (select |#length| 6)) (= |~#commands~0.offset| 0))} ~input#1.base, ~input#1.offset := #in~input#1.base, #in~input#1.offset;~i~0#1 := 0; {5070#(and (= 6 |~#commands~0.base|) (<= 18 (select |#length| 6)) (= |~#commands~0.offset| 0) (= |parse_input_~i~0#1| 0))} is VALID [2022-02-20 23:37:47,054 INFO L290 TraceCheckUtils]: 4: Hoare triple {5070#(and (= 6 |~#commands~0.base|) (<= 18 (select |#length| 6)) (= |~#commands~0.offset| 0) (= |parse_input_~i~0#1| 0))} assume !!(~i~0#1 < 2); {5070#(and (= 6 |~#commands~0.base|) (<= 18 (select |#length| 6)) (= |~#commands~0.offset| 0) (= |parse_input_~i~0#1| 0))} is VALID [2022-02-20 23:37:47,055 INFO L290 TraceCheckUtils]: 5: Hoare triple {5070#(and (= 6 |~#commands~0.base|) (<= 18 (select |#length| 6)) (= |~#commands~0.offset| 0) (= |parse_input_~i~0#1| 0))} SUMMARY for call #t~mem3#1.base, #t~mem3#1.offset := read~$Pointer$(~#commands~0.base, ~#commands~0.offset + 9 * ~i~0#1, 4); srcloc: L693 {5070#(and (= 6 |~#commands~0.base|) (<= 18 (select |#length| 6)) (= |~#commands~0.offset| 0) (= |parse_input_~i~0#1| 0))} is VALID [2022-02-20 23:37:47,055 INFO L290 TraceCheckUtils]: 6: Hoare triple {5070#(and (= 6 |~#commands~0.base|) (<= 18 (select |#length| 6)) (= |~#commands~0.offset| 0) (= |parse_input_~i~0#1| 0))} assume 1 == #valid[#t~mem3#1.base]; {5070#(and (= 6 |~#commands~0.base|) (<= 18 (select |#length| 6)) (= |~#commands~0.offset| 0) (= |parse_input_~i~0#1| 0))} is VALID [2022-02-20 23:37:47,056 INFO L290 TraceCheckUtils]: 7: Hoare triple {5070#(and (= 6 |~#commands~0.base|) (<= 18 (select |#length| 6)) (= |~#commands~0.offset| 0) (= |parse_input_~i~0#1| 0))} assume #t~mem3#1.offset < #length[#t~mem3#1.base] && #t~mem3#1.offset >= 0; {5070#(and (= 6 |~#commands~0.base|) (<= 18 (select |#length| 6)) (= |~#commands~0.offset| 0) (= |parse_input_~i~0#1| 0))} is VALID [2022-02-20 23:37:47,056 INFO L290 TraceCheckUtils]: 8: Hoare triple {5070#(and (= 6 |~#commands~0.base|) (<= 18 (select |#length| 6)) (= |~#commands~0.offset| 0) (= |parse_input_~i~0#1| 0))} assume 1 == #valid[~input#1.base]; {5070#(and (= 6 |~#commands~0.base|) (<= 18 (select |#length| 6)) (= |~#commands~0.offset| 0) (= |parse_input_~i~0#1| 0))} is VALID [2022-02-20 23:37:47,057 INFO L290 TraceCheckUtils]: 9: Hoare triple {5070#(and (= 6 |~#commands~0.base|) (<= 18 (select |#length| 6)) (= |~#commands~0.offset| 0) (= |parse_input_~i~0#1| 0))} assume ~input#1.offset < #length[~input#1.base] && ~input#1.offset >= 0; {5070#(and (= 6 |~#commands~0.base|) (<= 18 (select |#length| 6)) (= |~#commands~0.offset| 0) (= |parse_input_~i~0#1| 0))} is VALID [2022-02-20 23:37:47,057 INFO L290 TraceCheckUtils]: 10: Hoare triple {5070#(and (= 6 |~#commands~0.base|) (<= 18 (select |#length| 6)) (= |~#commands~0.offset| 0) (= |parse_input_~i~0#1| 0))} assume !(0 == #t~nondet4#1);havoc #t~mem3#1.base, #t~mem3#1.offset;havoc #t~nondet4#1; {5070#(and (= 6 |~#commands~0.base|) (<= 18 (select |#length| 6)) (= |~#commands~0.offset| 0) (= |parse_input_~i~0#1| 0))} is VALID [2022-02-20 23:37:47,058 INFO L290 TraceCheckUtils]: 11: Hoare triple {5070#(and (= 6 |~#commands~0.base|) (<= 18 (select |#length| 6)) (= |~#commands~0.offset| 0) (= |parse_input_~i~0#1| 0))} #t~post2#1 := ~i~0#1;~i~0#1 := 1 + #t~post2#1;havoc #t~post2#1; {5095#(and (= 6 |~#commands~0.base|) (<= 18 (select |#length| 6)) (= |parse_input_~i~0#1| 1) (= |~#commands~0.offset| 0))} is VALID [2022-02-20 23:37:47,058 INFO L290 TraceCheckUtils]: 12: Hoare triple {5095#(and (= 6 |~#commands~0.base|) (<= 18 (select |#length| 6)) (= |parse_input_~i~0#1| 1) (= |~#commands~0.offset| 0))} assume !!(~i~0#1 < 2); {5095#(and (= 6 |~#commands~0.base|) (<= 18 (select |#length| 6)) (= |parse_input_~i~0#1| 1) (= |~#commands~0.offset| 0))} is VALID [2022-02-20 23:37:47,059 INFO L290 TraceCheckUtils]: 13: Hoare triple {5095#(and (= 6 |~#commands~0.base|) (<= 18 (select |#length| 6)) (= |parse_input_~i~0#1| 1) (= |~#commands~0.offset| 0))} assume !(4 + (~#commands~0.offset + 9 * ~i~0#1) <= #length[~#commands~0.base] && 0 <= ~#commands~0.offset + 9 * ~i~0#1); {5051#false} is VALID [2022-02-20 23:37:47,059 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:37:47,059 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:37:47,196 INFO L290 TraceCheckUtils]: 13: Hoare triple {5102#(and (<= (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset| 4) (select |#length| |~#commands~0.base|)) (<= 0 (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset|)))} assume !(4 + (~#commands~0.offset + 9 * ~i~0#1) <= #length[~#commands~0.base] && 0 <= ~#commands~0.offset + 9 * ~i~0#1); {5051#false} is VALID [2022-02-20 23:37:47,197 INFO L290 TraceCheckUtils]: 12: Hoare triple {5102#(and (<= (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset| 4) (select |#length| |~#commands~0.base|)) (<= 0 (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset|)))} assume !!(~i~0#1 < 2); {5102#(and (<= (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset| 4) (select |#length| |~#commands~0.base|)) (<= 0 (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset|)))} is VALID [2022-02-20 23:37:47,197 INFO L290 TraceCheckUtils]: 11: Hoare triple {5109#(and (<= (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset| 13) (select |#length| |~#commands~0.base|)) (<= 0 (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset| 9)))} #t~post2#1 := ~i~0#1;~i~0#1 := 1 + #t~post2#1;havoc #t~post2#1; {5102#(and (<= (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset| 4) (select |#length| |~#commands~0.base|)) (<= 0 (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset|)))} is VALID [2022-02-20 23:37:47,198 INFO L290 TraceCheckUtils]: 10: Hoare triple {5109#(and (<= (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset| 13) (select |#length| |~#commands~0.base|)) (<= 0 (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset| 9)))} assume !(0 == #t~nondet4#1);havoc #t~mem3#1.base, #t~mem3#1.offset;havoc #t~nondet4#1; {5109#(and (<= (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset| 13) (select |#length| |~#commands~0.base|)) (<= 0 (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset| 9)))} is VALID [2022-02-20 23:37:47,198 INFO L290 TraceCheckUtils]: 9: Hoare triple {5109#(and (<= (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset| 13) (select |#length| |~#commands~0.base|)) (<= 0 (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset| 9)))} assume ~input#1.offset < #length[~input#1.base] && ~input#1.offset >= 0; {5109#(and (<= (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset| 13) (select |#length| |~#commands~0.base|)) (<= 0 (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset| 9)))} is VALID [2022-02-20 23:37:47,199 INFO L290 TraceCheckUtils]: 8: Hoare triple {5109#(and (<= (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset| 13) (select |#length| |~#commands~0.base|)) (<= 0 (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset| 9)))} assume 1 == #valid[~input#1.base]; {5109#(and (<= (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset| 13) (select |#length| |~#commands~0.base|)) (<= 0 (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset| 9)))} is VALID [2022-02-20 23:37:47,199 INFO L290 TraceCheckUtils]: 7: Hoare triple {5109#(and (<= (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset| 13) (select |#length| |~#commands~0.base|)) (<= 0 (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset| 9)))} assume #t~mem3#1.offset < #length[#t~mem3#1.base] && #t~mem3#1.offset >= 0; {5109#(and (<= (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset| 13) (select |#length| |~#commands~0.base|)) (<= 0 (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset| 9)))} is VALID [2022-02-20 23:37:47,199 INFO L290 TraceCheckUtils]: 6: Hoare triple {5109#(and (<= (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset| 13) (select |#length| |~#commands~0.base|)) (<= 0 (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset| 9)))} assume 1 == #valid[#t~mem3#1.base]; {5109#(and (<= (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset| 13) (select |#length| |~#commands~0.base|)) (<= 0 (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset| 9)))} is VALID [2022-02-20 23:37:47,200 INFO L290 TraceCheckUtils]: 5: Hoare triple {5109#(and (<= (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset| 13) (select |#length| |~#commands~0.base|)) (<= 0 (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset| 9)))} SUMMARY for call #t~mem3#1.base, #t~mem3#1.offset := read~$Pointer$(~#commands~0.base, ~#commands~0.offset + 9 * ~i~0#1, 4); srcloc: L693 {5109#(and (<= (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset| 13) (select |#length| |~#commands~0.base|)) (<= 0 (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset| 9)))} is VALID [2022-02-20 23:37:47,200 INFO L290 TraceCheckUtils]: 4: Hoare triple {5109#(and (<= (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset| 13) (select |#length| |~#commands~0.base|)) (<= 0 (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset| 9)))} assume !!(~i~0#1 < 2); {5109#(and (<= (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset| 13) (select |#length| |~#commands~0.base|)) (<= 0 (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset| 9)))} is VALID [2022-02-20 23:37:47,201 INFO L290 TraceCheckUtils]: 3: Hoare triple {5134#(and (<= 0 (+ |~#commands~0.offset| 9)) (<= (+ |~#commands~0.offset| 13) (select |#length| |~#commands~0.base|)))} ~input#1.base, ~input#1.offset := #in~input#1.base, #in~input#1.offset;~i~0#1 := 0; {5109#(and (<= (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset| 13) (select |#length| |~#commands~0.base|)) (<= 0 (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset| 9)))} is VALID [2022-02-20 23:37:47,202 INFO L272 TraceCheckUtils]: 2: Hoare triple {5134#(and (<= 0 (+ |~#commands~0.offset| 9)) (<= (+ |~#commands~0.offset| 13) (select |#length| |~#commands~0.base|)))} call parse_input(3, 0); {5134#(and (<= 0 (+ |~#commands~0.offset| 9)) (<= (+ |~#commands~0.offset| 13) (select |#length| |~#commands~0.base|)))} is VALID [2022-02-20 23:37:47,203 INFO L290 TraceCheckUtils]: 1: Hoare triple {5134#(and (<= 0 (+ |~#commands~0.offset| 9)) (<= (+ |~#commands~0.offset| 13) (select |#length| |~#commands~0.base|)))} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1; {5134#(and (<= 0 (+ |~#commands~0.offset| 9)) (<= (+ |~#commands~0.offset| 13) (select |#length| |~#commands~0.base|)))} is VALID [2022-02-20 23:37:47,204 INFO L290 TraceCheckUtils]: 0: Hoare triple {5050#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(3, 1);call write~init~int(99, 1, 0, 1);call write~init~int(49, 1, 1, 1);call write~init~int(0, 1, 2, 1);call #Ultimate.allocInit(3, 2);call write~init~int(99, 2, 0, 1);call write~init~int(50, 2, 1, 1);call write~init~int(0, 2, 2, 1);call #Ultimate.allocInit(3, 3);call write~init~int(99, 3, 0, 1);call write~init~int(49, 3, 1, 1);call write~init~int(0, 3, 2, 1);call #Ultimate.allocInit(3, 4);call write~init~int(99, 4, 0, 1);call write~init~int(49, 4, 1, 1);call write~init~int(0, 4, 2, 1);call #Ultimate.allocInit(3, 5);call write~init~int(99, 5, 0, 1);call write~init~int(50, 5, 1, 1);call write~init~int(0, 5, 2, 1);~state~0 := ~unnamed3~0~STATE_1;~global~0.base, ~global~0.offset := 0, 0;~#commands~0.base, ~#commands~0.offset := 6, 0;call #Ultimate.allocInit(18, 6);call write~init~$Pointer$(1, 0, ~#commands~0.base, ~#commands~0.offset, 4);call write~init~$Pointer$(#funAddr~c1.base, #funAddr~c1.offset, ~#commands~0.base, 4 + ~#commands~0.offset, 4);call write~init~int((if ~unnamed3~0~STATE_1 % 256 <= 127 then ~unnamed3~0~STATE_1 % 256 else ~unnamed3~0~STATE_1 % 256 - 256), ~#commands~0.base, 8 + ~#commands~0.offset, 1);call write~init~$Pointer$(2, 0, ~#commands~0.base, 9 + ~#commands~0.offset, 4);call write~init~$Pointer$(#funAddr~c2.base, #funAddr~c2.offset, ~#commands~0.base, 13 + ~#commands~0.offset, 4);call write~init~int((if ~unnamed3~0~STATE_2 % 256 <= 127 then ~unnamed3~0~STATE_2 % 256 else ~unnamed3~0~STATE_2 % 256 - 256), ~#commands~0.base, 17 + ~#commands~0.offset, 1); {5134#(and (<= 0 (+ |~#commands~0.offset| 9)) (<= (+ |~#commands~0.offset| 13) (select |#length| |~#commands~0.base|)))} is VALID [2022-02-20 23:37:47,204 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:37:47,204 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [116721714] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 23:37:47,204 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 23:37:47,204 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 3] total 11 [2022-02-20 23:37:47,204 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390643537] [2022-02-20 23:37:47,204 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 23:37:47,205 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.25) internal successors, (39), 11 states have internal predecessors, (39), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-02-20 23:37:47,205 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:37:47,205 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 13 states, 12 states have (on average 3.25) internal successors, (39), 11 states have internal predecessors, (39), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:37:47,231 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:37:47,231 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-02-20 23:37:47,231 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:37:47,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-02-20 23:37:47,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2022-02-20 23:37:47,232 INFO L87 Difference]: Start difference. First operand 217 states and 325 transitions. Second operand has 13 states, 12 states have (on average 3.25) internal successors, (39), 11 states have internal predecessors, (39), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:37:48,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:37:48,130 INFO L93 Difference]: Finished difference Result 302 states and 415 transitions. [2022-02-20 23:37:48,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 23:37:48,130 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.25) internal successors, (39), 11 states have internal predecessors, (39), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-02-20 23:37:48,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:37:48,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 3.25) internal successors, (39), 11 states have internal predecessors, (39), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:37:48,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 166 transitions. [2022-02-20 23:37:48,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 3.25) internal successors, (39), 11 states have internal predecessors, (39), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:37:48,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 166 transitions. [2022-02-20 23:37:48,133 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 166 transitions. [2022-02-20 23:37:48,254 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 166 edges. 166 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:37:48,259 INFO L225 Difference]: With dead ends: 302 [2022-02-20 23:37:48,259 INFO L226 Difference]: Without dead ends: 302 [2022-02-20 23:37:48,259 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2022-02-20 23:37:48,260 INFO L933 BasicCegarLoop]: 93 mSDtfsCounter, 281 mSDsluCounter, 404 mSDsCounter, 0 mSdLazyCounter, 276 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 281 SdHoareTripleChecker+Valid, 497 SdHoareTripleChecker+Invalid, 293 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 276 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 23:37:48,260 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [281 Valid, 497 Invalid, 293 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 276 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-20 23:37:48,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2022-02-20 23:37:48,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 229. [2022-02-20 23:37:48,264 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:37:48,265 INFO L82 GeneralOperation]: Start isEquivalent. First operand 302 states. Second operand has 229 states, 188 states have (on average 1.4893617021276595) internal successors, (280), 210 states have internal predecessors, (280), 11 states have call successors, (11), 7 states have call predecessors, (11), 12 states have return successors, (44), 11 states have call predecessors, (44), 11 states have call successors, (44) [2022-02-20 23:37:48,265 INFO L74 IsIncluded]: Start isIncluded. First operand 302 states. Second operand has 229 states, 188 states have (on average 1.4893617021276595) internal successors, (280), 210 states have internal predecessors, (280), 11 states have call successors, (11), 7 states have call predecessors, (11), 12 states have return successors, (44), 11 states have call predecessors, (44), 11 states have call successors, (44) [2022-02-20 23:37:48,266 INFO L87 Difference]: Start difference. First operand 302 states. Second operand has 229 states, 188 states have (on average 1.4893617021276595) internal successors, (280), 210 states have internal predecessors, (280), 11 states have call successors, (11), 7 states have call predecessors, (11), 12 states have return successors, (44), 11 states have call predecessors, (44), 11 states have call successors, (44) [2022-02-20 23:37:48,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:37:48,272 INFO L93 Difference]: Finished difference Result 302 states and 415 transitions. [2022-02-20 23:37:48,272 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 415 transitions. [2022-02-20 23:37:48,273 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:37:48,274 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:37:48,274 INFO L74 IsIncluded]: Start isIncluded. First operand has 229 states, 188 states have (on average 1.4893617021276595) internal successors, (280), 210 states have internal predecessors, (280), 11 states have call successors, (11), 7 states have call predecessors, (11), 12 states have return successors, (44), 11 states have call predecessors, (44), 11 states have call successors, (44) Second operand 302 states. [2022-02-20 23:37:48,275 INFO L87 Difference]: Start difference. First operand has 229 states, 188 states have (on average 1.4893617021276595) internal successors, (280), 210 states have internal predecessors, (280), 11 states have call successors, (11), 7 states have call predecessors, (11), 12 states have return successors, (44), 11 states have call predecessors, (44), 11 states have call successors, (44) Second operand 302 states. [2022-02-20 23:37:48,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:37:48,281 INFO L93 Difference]: Finished difference Result 302 states and 415 transitions. [2022-02-20 23:37:48,281 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 415 transitions. [2022-02-20 23:37:48,282 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:37:48,282 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:37:48,282 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:37:48,282 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:37:48,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 188 states have (on average 1.4893617021276595) internal successors, (280), 210 states have internal predecessors, (280), 11 states have call successors, (11), 7 states have call predecessors, (11), 12 states have return successors, (44), 11 states have call predecessors, (44), 11 states have call successors, (44) [2022-02-20 23:37:48,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 335 transitions. [2022-02-20 23:37:48,299 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 335 transitions. Word has length 14 [2022-02-20 23:37:48,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:37:48,299 INFO L470 AbstractCegarLoop]: Abstraction has 229 states and 335 transitions. [2022-02-20 23:37:48,300 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.25) internal successors, (39), 11 states have internal predecessors, (39), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:37:48,300 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 335 transitions. [2022-02-20 23:37:48,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-02-20 23:37:48,300 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:37:48,300 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:37:48,331 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-02-20 23:37:48,517 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:37:48,518 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATION, parse_inputErr1REQUIRES_VIOLATION, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2022-02-20 23:37:48,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:37:48,519 INFO L85 PathProgramCache]: Analyzing trace with hash 396669285, now seen corresponding path program 1 times [2022-02-20 23:37:48,519 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:37:48,519 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36436949] [2022-02-20 23:37:48,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:37:48,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:37:48,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:37:48,611 INFO L290 TraceCheckUtils]: 0: Hoare triple {6284#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(3, 1);call write~init~int(99, 1, 0, 1);call write~init~int(49, 1, 1, 1);call write~init~int(0, 1, 2, 1);call #Ultimate.allocInit(3, 2);call write~init~int(99, 2, 0, 1);call write~init~int(50, 2, 1, 1);call write~init~int(0, 2, 2, 1);call #Ultimate.allocInit(3, 3);call write~init~int(99, 3, 0, 1);call write~init~int(49, 3, 1, 1);call write~init~int(0, 3, 2, 1);call #Ultimate.allocInit(3, 4);call write~init~int(99, 4, 0, 1);call write~init~int(49, 4, 1, 1);call write~init~int(0, 4, 2, 1);call #Ultimate.allocInit(3, 5);call write~init~int(99, 5, 0, 1);call write~init~int(50, 5, 1, 1);call write~init~int(0, 5, 2, 1);~state~0 := ~unnamed3~0~STATE_1;~global~0.base, ~global~0.offset := 0, 0;~#commands~0.base, ~#commands~0.offset := 6, 0;call #Ultimate.allocInit(18, 6);call write~init~$Pointer$(1, 0, ~#commands~0.base, ~#commands~0.offset, 4);call write~init~$Pointer$(#funAddr~c1.base, #funAddr~c1.offset, ~#commands~0.base, 4 + ~#commands~0.offset, 4);call write~init~int((if ~unnamed3~0~STATE_1 % 256 <= 127 then ~unnamed3~0~STATE_1 % 256 else ~unnamed3~0~STATE_1 % 256 - 256), ~#commands~0.base, 8 + ~#commands~0.offset, 1);call write~init~$Pointer$(2, 0, ~#commands~0.base, 9 + ~#commands~0.offset, 4);call write~init~$Pointer$(#funAddr~c2.base, #funAddr~c2.offset, ~#commands~0.base, 13 + ~#commands~0.offset, 4);call write~init~int((if ~unnamed3~0~STATE_2 % 256 <= 127 then ~unnamed3~0~STATE_2 % 256 else ~unnamed3~0~STATE_2 % 256 - 256), ~#commands~0.base, 17 + ~#commands~0.offset, 1); {6286#(and (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) (+ |~#commands~0.offset| 9)) 2) (= (select |#valid| 2) 1))} is VALID [2022-02-20 23:37:48,612 INFO L290 TraceCheckUtils]: 1: Hoare triple {6286#(and (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) (+ |~#commands~0.offset| 9)) 2) (= (select |#valid| 2) 1))} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1; {6286#(and (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) (+ |~#commands~0.offset| 9)) 2) (= (select |#valid| 2) 1))} is VALID [2022-02-20 23:37:48,612 INFO L272 TraceCheckUtils]: 2: Hoare triple {6286#(and (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) (+ |~#commands~0.offset| 9)) 2) (= (select |#valid| 2) 1))} call parse_input(3, 0); {6286#(and (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) (+ |~#commands~0.offset| 9)) 2) (= (select |#valid| 2) 1))} is VALID [2022-02-20 23:37:48,613 INFO L290 TraceCheckUtils]: 3: Hoare triple {6286#(and (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) (+ |~#commands~0.offset| 9)) 2) (= (select |#valid| 2) 1))} ~input#1.base, ~input#1.offset := #in~input#1.base, #in~input#1.offset;~i~0#1 := 0; {6287#(and (= |parse_input_~i~0#1| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) (+ |~#commands~0.offset| 9)) 2) (= (select |#valid| 2) 1))} is VALID [2022-02-20 23:37:48,613 INFO L290 TraceCheckUtils]: 4: Hoare triple {6287#(and (= |parse_input_~i~0#1| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) (+ |~#commands~0.offset| 9)) 2) (= (select |#valid| 2) 1))} assume !!(~i~0#1 < 2); {6287#(and (= |parse_input_~i~0#1| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) (+ |~#commands~0.offset| 9)) 2) (= (select |#valid| 2) 1))} is VALID [2022-02-20 23:37:48,614 INFO L290 TraceCheckUtils]: 5: Hoare triple {6287#(and (= |parse_input_~i~0#1| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) (+ |~#commands~0.offset| 9)) 2) (= (select |#valid| 2) 1))} SUMMARY for call #t~mem3#1.base, #t~mem3#1.offset := read~$Pointer$(~#commands~0.base, ~#commands~0.offset + 9 * ~i~0#1, 4); srcloc: L693 {6287#(and (= |parse_input_~i~0#1| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) (+ |~#commands~0.offset| 9)) 2) (= (select |#valid| 2) 1))} is VALID [2022-02-20 23:37:48,614 INFO L290 TraceCheckUtils]: 6: Hoare triple {6287#(and (= |parse_input_~i~0#1| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) (+ |~#commands~0.offset| 9)) 2) (= (select |#valid| 2) 1))} assume 1 == #valid[#t~mem3#1.base]; {6287#(and (= |parse_input_~i~0#1| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) (+ |~#commands~0.offset| 9)) 2) (= (select |#valid| 2) 1))} is VALID [2022-02-20 23:37:48,615 INFO L290 TraceCheckUtils]: 7: Hoare triple {6287#(and (= |parse_input_~i~0#1| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) (+ |~#commands~0.offset| 9)) 2) (= (select |#valid| 2) 1))} assume #t~mem3#1.offset < #length[#t~mem3#1.base] && #t~mem3#1.offset >= 0; {6287#(and (= |parse_input_~i~0#1| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) (+ |~#commands~0.offset| 9)) 2) (= (select |#valid| 2) 1))} is VALID [2022-02-20 23:37:48,615 INFO L290 TraceCheckUtils]: 8: Hoare triple {6287#(and (= |parse_input_~i~0#1| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) (+ |~#commands~0.offset| 9)) 2) (= (select |#valid| 2) 1))} assume 1 == #valid[~input#1.base]; {6287#(and (= |parse_input_~i~0#1| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) (+ |~#commands~0.offset| 9)) 2) (= (select |#valid| 2) 1))} is VALID [2022-02-20 23:37:48,615 INFO L290 TraceCheckUtils]: 9: Hoare triple {6287#(and (= |parse_input_~i~0#1| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) (+ |~#commands~0.offset| 9)) 2) (= (select |#valid| 2) 1))} assume ~input#1.offset < #length[~input#1.base] && ~input#1.offset >= 0; {6287#(and (= |parse_input_~i~0#1| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) (+ |~#commands~0.offset| 9)) 2) (= (select |#valid| 2) 1))} is VALID [2022-02-20 23:37:48,616 INFO L290 TraceCheckUtils]: 10: Hoare triple {6287#(and (= |parse_input_~i~0#1| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) (+ |~#commands~0.offset| 9)) 2) (= (select |#valid| 2) 1))} assume !(0 == #t~nondet4#1);havoc #t~mem3#1.base, #t~mem3#1.offset;havoc #t~nondet4#1; {6287#(and (= |parse_input_~i~0#1| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) (+ |~#commands~0.offset| 9)) 2) (= (select |#valid| 2) 1))} is VALID [2022-02-20 23:37:48,616 INFO L290 TraceCheckUtils]: 11: Hoare triple {6287#(and (= |parse_input_~i~0#1| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) (+ |~#commands~0.offset| 9)) 2) (= (select |#valid| 2) 1))} #t~post2#1 := ~i~0#1;~i~0#1 := 1 + #t~post2#1;havoc #t~post2#1; {6288#(and (or (not (= (+ (- 1) |parse_input_~i~0#1|) 0)) (and (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) (+ |~#commands~0.offset| 9)) 2) (= (select |#valid| 2) 1))) (< 0 |parse_input_~i~0#1|))} is VALID [2022-02-20 23:37:48,617 INFO L290 TraceCheckUtils]: 12: Hoare triple {6288#(and (or (not (= (+ (- 1) |parse_input_~i~0#1|) 0)) (and (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) (+ |~#commands~0.offset| 9)) 2) (= (select |#valid| 2) 1))) (< 0 |parse_input_~i~0#1|))} assume !!(~i~0#1 < 2); {6289#(and (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) (+ |~#commands~0.offset| 9)) 2) (= (select |#valid| 2) 1) (= (* 9 |parse_input_~i~0#1|) 9))} is VALID [2022-02-20 23:37:48,618 INFO L290 TraceCheckUtils]: 13: Hoare triple {6289#(and (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) (+ |~#commands~0.offset| 9)) 2) (= (select |#valid| 2) 1) (= (* 9 |parse_input_~i~0#1|) 9))} SUMMARY for call #t~mem3#1.base, #t~mem3#1.offset := read~$Pointer$(~#commands~0.base, ~#commands~0.offset + 9 * ~i~0#1, 4); srcloc: L693 {6290#(and (= (select |#valid| |parse_input_#t~mem3#1.base|) 1) (= |parse_input_#t~mem3#1.base| 2))} is VALID [2022-02-20 23:37:48,618 INFO L290 TraceCheckUtils]: 14: Hoare triple {6290#(and (= (select |#valid| |parse_input_#t~mem3#1.base|) 1) (= |parse_input_#t~mem3#1.base| 2))} assume !(1 == #valid[#t~mem3#1.base]); {6285#false} is VALID [2022-02-20 23:37:48,618 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:37:48,618 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:37:48,618 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36436949] [2022-02-20 23:37:48,619 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [36436949] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 23:37:48,619 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [346741290] [2022-02-20 23:37:48,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:37:48,619 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:37:48,619 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:37:48,620 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 23:37:48,621 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 23:37:48,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:37:48,665 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 13 conjunts are in the unsatisfiable core [2022-02-20 23:37:48,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:37:48,671 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:37:48,816 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-02-20 23:37:48,823 INFO L290 TraceCheckUtils]: 0: Hoare triple {6284#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(3, 1);call write~init~int(99, 1, 0, 1);call write~init~int(49, 1, 1, 1);call write~init~int(0, 1, 2, 1);call #Ultimate.allocInit(3, 2);call write~init~int(99, 2, 0, 1);call write~init~int(50, 2, 1, 1);call write~init~int(0, 2, 2, 1);call #Ultimate.allocInit(3, 3);call write~init~int(99, 3, 0, 1);call write~init~int(49, 3, 1, 1);call write~init~int(0, 3, 2, 1);call #Ultimate.allocInit(3, 4);call write~init~int(99, 4, 0, 1);call write~init~int(49, 4, 1, 1);call write~init~int(0, 4, 2, 1);call #Ultimate.allocInit(3, 5);call write~init~int(99, 5, 0, 1);call write~init~int(50, 5, 1, 1);call write~init~int(0, 5, 2, 1);~state~0 := ~unnamed3~0~STATE_1;~global~0.base, ~global~0.offset := 0, 0;~#commands~0.base, ~#commands~0.offset := 6, 0;call #Ultimate.allocInit(18, 6);call write~init~$Pointer$(1, 0, ~#commands~0.base, ~#commands~0.offset, 4);call write~init~$Pointer$(#funAddr~c1.base, #funAddr~c1.offset, ~#commands~0.base, 4 + ~#commands~0.offset, 4);call write~init~int((if ~unnamed3~0~STATE_1 % 256 <= 127 then ~unnamed3~0~STATE_1 % 256 else ~unnamed3~0~STATE_1 % 256 - 256), ~#commands~0.base, 8 + ~#commands~0.offset, 1);call write~init~$Pointer$(2, 0, ~#commands~0.base, 9 + ~#commands~0.offset, 4);call write~init~$Pointer$(#funAddr~c2.base, #funAddr~c2.offset, ~#commands~0.base, 13 + ~#commands~0.offset, 4);call write~init~int((if ~unnamed3~0~STATE_2 % 256 <= 127 then ~unnamed3~0~STATE_2 % 256 else ~unnamed3~0~STATE_2 % 256 - 256), ~#commands~0.base, 17 + ~#commands~0.offset, 1); {6286#(and (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) (+ |~#commands~0.offset| 9)) 2) (= (select |#valid| 2) 1))} is VALID [2022-02-20 23:37:48,824 INFO L290 TraceCheckUtils]: 1: Hoare triple {6286#(and (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) (+ |~#commands~0.offset| 9)) 2) (= (select |#valid| 2) 1))} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1; {6286#(and (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) (+ |~#commands~0.offset| 9)) 2) (= (select |#valid| 2) 1))} is VALID [2022-02-20 23:37:48,824 INFO L272 TraceCheckUtils]: 2: Hoare triple {6286#(and (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) (+ |~#commands~0.offset| 9)) 2) (= (select |#valid| 2) 1))} call parse_input(3, 0); {6286#(and (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) (+ |~#commands~0.offset| 9)) 2) (= (select |#valid| 2) 1))} is VALID [2022-02-20 23:37:48,825 INFO L290 TraceCheckUtils]: 3: Hoare triple {6286#(and (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) (+ |~#commands~0.offset| 9)) 2) (= (select |#valid| 2) 1))} ~input#1.base, ~input#1.offset := #in~input#1.base, #in~input#1.offset;~i~0#1 := 0; {6287#(and (= |parse_input_~i~0#1| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) (+ |~#commands~0.offset| 9)) 2) (= (select |#valid| 2) 1))} is VALID [2022-02-20 23:37:48,830 INFO L290 TraceCheckUtils]: 4: Hoare triple {6287#(and (= |parse_input_~i~0#1| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) (+ |~#commands~0.offset| 9)) 2) (= (select |#valid| 2) 1))} assume !!(~i~0#1 < 2); {6287#(and (= |parse_input_~i~0#1| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) (+ |~#commands~0.offset| 9)) 2) (= (select |#valid| 2) 1))} is VALID [2022-02-20 23:37:48,830 INFO L290 TraceCheckUtils]: 5: Hoare triple {6287#(and (= |parse_input_~i~0#1| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) (+ |~#commands~0.offset| 9)) 2) (= (select |#valid| 2) 1))} SUMMARY for call #t~mem3#1.base, #t~mem3#1.offset := read~$Pointer$(~#commands~0.base, ~#commands~0.offset + 9 * ~i~0#1, 4); srcloc: L693 {6287#(and (= |parse_input_~i~0#1| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) (+ |~#commands~0.offset| 9)) 2) (= (select |#valid| 2) 1))} is VALID [2022-02-20 23:37:48,831 INFO L290 TraceCheckUtils]: 6: Hoare triple {6287#(and (= |parse_input_~i~0#1| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) (+ |~#commands~0.offset| 9)) 2) (= (select |#valid| 2) 1))} assume 1 == #valid[#t~mem3#1.base]; {6287#(and (= |parse_input_~i~0#1| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) (+ |~#commands~0.offset| 9)) 2) (= (select |#valid| 2) 1))} is VALID [2022-02-20 23:37:48,831 INFO L290 TraceCheckUtils]: 7: Hoare triple {6287#(and (= |parse_input_~i~0#1| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) (+ |~#commands~0.offset| 9)) 2) (= (select |#valid| 2) 1))} assume #t~mem3#1.offset < #length[#t~mem3#1.base] && #t~mem3#1.offset >= 0; {6287#(and (= |parse_input_~i~0#1| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) (+ |~#commands~0.offset| 9)) 2) (= (select |#valid| 2) 1))} is VALID [2022-02-20 23:37:48,832 INFO L290 TraceCheckUtils]: 8: Hoare triple {6287#(and (= |parse_input_~i~0#1| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) (+ |~#commands~0.offset| 9)) 2) (= (select |#valid| 2) 1))} assume 1 == #valid[~input#1.base]; {6287#(and (= |parse_input_~i~0#1| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) (+ |~#commands~0.offset| 9)) 2) (= (select |#valid| 2) 1))} is VALID [2022-02-20 23:37:48,832 INFO L290 TraceCheckUtils]: 9: Hoare triple {6287#(and (= |parse_input_~i~0#1| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) (+ |~#commands~0.offset| 9)) 2) (= (select |#valid| 2) 1))} assume ~input#1.offset < #length[~input#1.base] && ~input#1.offset >= 0; {6287#(and (= |parse_input_~i~0#1| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) (+ |~#commands~0.offset| 9)) 2) (= (select |#valid| 2) 1))} is VALID [2022-02-20 23:37:48,833 INFO L290 TraceCheckUtils]: 10: Hoare triple {6287#(and (= |parse_input_~i~0#1| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) (+ |~#commands~0.offset| 9)) 2) (= (select |#valid| 2) 1))} assume !(0 == #t~nondet4#1);havoc #t~mem3#1.base, #t~mem3#1.offset;havoc #t~nondet4#1; {6287#(and (= |parse_input_~i~0#1| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) (+ |~#commands~0.offset| 9)) 2) (= (select |#valid| 2) 1))} is VALID [2022-02-20 23:37:48,833 INFO L290 TraceCheckUtils]: 11: Hoare triple {6287#(and (= |parse_input_~i~0#1| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) (+ |~#commands~0.offset| 9)) 2) (= (select |#valid| 2) 1))} #t~post2#1 := ~i~0#1;~i~0#1 := 1 + #t~post2#1;havoc #t~post2#1; {6289#(and (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) (+ |~#commands~0.offset| 9)) 2) (= (select |#valid| 2) 1) (= (* 9 |parse_input_~i~0#1|) 9))} is VALID [2022-02-20 23:37:48,834 INFO L290 TraceCheckUtils]: 12: Hoare triple {6289#(and (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) (+ |~#commands~0.offset| 9)) 2) (= (select |#valid| 2) 1) (= (* 9 |parse_input_~i~0#1|) 9))} assume !!(~i~0#1 < 2); {6289#(and (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) (+ |~#commands~0.offset| 9)) 2) (= (select |#valid| 2) 1) (= (* 9 |parse_input_~i~0#1|) 9))} is VALID [2022-02-20 23:37:48,835 INFO L290 TraceCheckUtils]: 13: Hoare triple {6289#(and (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) (+ |~#commands~0.offset| 9)) 2) (= (select |#valid| 2) 1) (= (* 9 |parse_input_~i~0#1|) 9))} SUMMARY for call #t~mem3#1.base, #t~mem3#1.offset := read~$Pointer$(~#commands~0.base, ~#commands~0.offset + 9 * ~i~0#1, 4); srcloc: L693 {6290#(and (= (select |#valid| |parse_input_#t~mem3#1.base|) 1) (= |parse_input_#t~mem3#1.base| 2))} is VALID [2022-02-20 23:37:48,836 INFO L290 TraceCheckUtils]: 14: Hoare triple {6290#(and (= (select |#valid| |parse_input_#t~mem3#1.base|) 1) (= |parse_input_#t~mem3#1.base| 2))} assume !(1 == #valid[#t~mem3#1.base]); {6285#false} is VALID [2022-02-20 23:37:48,836 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:37:48,836 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:37:48,910 INFO L290 TraceCheckUtils]: 14: Hoare triple {6336#(= (select |#valid| |parse_input_#t~mem3#1.base|) 1)} assume !(1 == #valid[#t~mem3#1.base]); {6285#false} is VALID [2022-02-20 23:37:48,911 INFO L290 TraceCheckUtils]: 13: Hoare triple {6340#(= (select |#valid| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset|))) 1)} SUMMARY for call #t~mem3#1.base, #t~mem3#1.offset := read~$Pointer$(~#commands~0.base, ~#commands~0.offset + 9 * ~i~0#1, 4); srcloc: L693 {6336#(= (select |#valid| |parse_input_#t~mem3#1.base|) 1)} is VALID [2022-02-20 23:37:48,923 INFO L290 TraceCheckUtils]: 12: Hoare triple {6340#(= (select |#valid| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset|))) 1)} assume !!(~i~0#1 < 2); {6340#(= (select |#valid| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset|))) 1)} is VALID [2022-02-20 23:37:48,924 INFO L290 TraceCheckUtils]: 11: Hoare triple {6347#(= (select |#valid| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset| 9))) 1)} #t~post2#1 := ~i~0#1;~i~0#1 := 1 + #t~post2#1;havoc #t~post2#1; {6340#(= (select |#valid| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset|))) 1)} is VALID [2022-02-20 23:37:48,925 INFO L290 TraceCheckUtils]: 10: Hoare triple {6347#(= (select |#valid| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset| 9))) 1)} assume !(0 == #t~nondet4#1);havoc #t~mem3#1.base, #t~mem3#1.offset;havoc #t~nondet4#1; {6347#(= (select |#valid| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset| 9))) 1)} is VALID [2022-02-20 23:37:48,925 INFO L290 TraceCheckUtils]: 9: Hoare triple {6347#(= (select |#valid| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset| 9))) 1)} assume ~input#1.offset < #length[~input#1.base] && ~input#1.offset >= 0; {6347#(= (select |#valid| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset| 9))) 1)} is VALID [2022-02-20 23:37:48,926 INFO L290 TraceCheckUtils]: 8: Hoare triple {6347#(= (select |#valid| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset| 9))) 1)} assume 1 == #valid[~input#1.base]; {6347#(= (select |#valid| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset| 9))) 1)} is VALID [2022-02-20 23:37:48,926 INFO L290 TraceCheckUtils]: 7: Hoare triple {6347#(= (select |#valid| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset| 9))) 1)} assume #t~mem3#1.offset < #length[#t~mem3#1.base] && #t~mem3#1.offset >= 0; {6347#(= (select |#valid| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset| 9))) 1)} is VALID [2022-02-20 23:37:48,926 INFO L290 TraceCheckUtils]: 6: Hoare triple {6347#(= (select |#valid| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset| 9))) 1)} assume 1 == #valid[#t~mem3#1.base]; {6347#(= (select |#valid| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset| 9))) 1)} is VALID [2022-02-20 23:37:48,927 INFO L290 TraceCheckUtils]: 5: Hoare triple {6347#(= (select |#valid| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset| 9))) 1)} SUMMARY for call #t~mem3#1.base, #t~mem3#1.offset := read~$Pointer$(~#commands~0.base, ~#commands~0.offset + 9 * ~i~0#1, 4); srcloc: L693 {6347#(= (select |#valid| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset| 9))) 1)} is VALID [2022-02-20 23:37:48,927 INFO L290 TraceCheckUtils]: 4: Hoare triple {6347#(= (select |#valid| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset| 9))) 1)} assume !!(~i~0#1 < 2); {6347#(= (select |#valid| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset| 9))) 1)} is VALID [2022-02-20 23:37:48,928 INFO L290 TraceCheckUtils]: 3: Hoare triple {6372#(= (select |#valid| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) (+ |~#commands~0.offset| 9))) 1)} ~input#1.base, ~input#1.offset := #in~input#1.base, #in~input#1.offset;~i~0#1 := 0; {6347#(= (select |#valid| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset| 9))) 1)} is VALID [2022-02-20 23:37:48,930 INFO L272 TraceCheckUtils]: 2: Hoare triple {6372#(= (select |#valid| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) (+ |~#commands~0.offset| 9))) 1)} call parse_input(3, 0); {6372#(= (select |#valid| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) (+ |~#commands~0.offset| 9))) 1)} is VALID [2022-02-20 23:37:48,931 INFO L290 TraceCheckUtils]: 1: Hoare triple {6372#(= (select |#valid| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) (+ |~#commands~0.offset| 9))) 1)} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1; {6372#(= (select |#valid| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) (+ |~#commands~0.offset| 9))) 1)} is VALID [2022-02-20 23:37:48,932 INFO L290 TraceCheckUtils]: 0: Hoare triple {6284#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(3, 1);call write~init~int(99, 1, 0, 1);call write~init~int(49, 1, 1, 1);call write~init~int(0, 1, 2, 1);call #Ultimate.allocInit(3, 2);call write~init~int(99, 2, 0, 1);call write~init~int(50, 2, 1, 1);call write~init~int(0, 2, 2, 1);call #Ultimate.allocInit(3, 3);call write~init~int(99, 3, 0, 1);call write~init~int(49, 3, 1, 1);call write~init~int(0, 3, 2, 1);call #Ultimate.allocInit(3, 4);call write~init~int(99, 4, 0, 1);call write~init~int(49, 4, 1, 1);call write~init~int(0, 4, 2, 1);call #Ultimate.allocInit(3, 5);call write~init~int(99, 5, 0, 1);call write~init~int(50, 5, 1, 1);call write~init~int(0, 5, 2, 1);~state~0 := ~unnamed3~0~STATE_1;~global~0.base, ~global~0.offset := 0, 0;~#commands~0.base, ~#commands~0.offset := 6, 0;call #Ultimate.allocInit(18, 6);call write~init~$Pointer$(1, 0, ~#commands~0.base, ~#commands~0.offset, 4);call write~init~$Pointer$(#funAddr~c1.base, #funAddr~c1.offset, ~#commands~0.base, 4 + ~#commands~0.offset, 4);call write~init~int((if ~unnamed3~0~STATE_1 % 256 <= 127 then ~unnamed3~0~STATE_1 % 256 else ~unnamed3~0~STATE_1 % 256 - 256), ~#commands~0.base, 8 + ~#commands~0.offset, 1);call write~init~$Pointer$(2, 0, ~#commands~0.base, 9 + ~#commands~0.offset, 4);call write~init~$Pointer$(#funAddr~c2.base, #funAddr~c2.offset, ~#commands~0.base, 13 + ~#commands~0.offset, 4);call write~init~int((if ~unnamed3~0~STATE_2 % 256 <= 127 then ~unnamed3~0~STATE_2 % 256 else ~unnamed3~0~STATE_2 % 256 - 256), ~#commands~0.base, 17 + ~#commands~0.offset, 1); {6372#(= (select |#valid| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) (+ |~#commands~0.offset| 9))) 1)} is VALID [2022-02-20 23:37:48,932 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:37:48,932 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [346741290] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 23:37:48,933 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 23:37:48,933 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 9 [2022-02-20 23:37:48,933 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876898977] [2022-02-20 23:37:48,933 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 23:37:48,933 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-02-20 23:37:48,933 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:37:48,934 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 11 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:37:48,953 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 23:37:48,954 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-02-20 23:37:48,954 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:37:48,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-02-20 23:37:48,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2022-02-20 23:37:48,955 INFO L87 Difference]: Start difference. First operand 229 states and 335 transitions. Second operand has 11 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:37:49,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:37:49,850 INFO L93 Difference]: Finished difference Result 335 states and 463 transitions. [2022-02-20 23:37:49,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-20 23:37:49,850 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-02-20 23:37:49,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:37:49,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:37:49,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 179 transitions. [2022-02-20 23:37:49,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:37:49,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 179 transitions. [2022-02-20 23:37:49,853 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 179 transitions. [2022-02-20 23:37:49,974 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 179 edges. 179 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:37:49,981 INFO L225 Difference]: With dead ends: 335 [2022-02-20 23:37:49,982 INFO L226 Difference]: Without dead ends: 335 [2022-02-20 23:37:49,982 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 23 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2022-02-20 23:37:49,982 INFO L933 BasicCegarLoop]: 83 mSDtfsCounter, 119 mSDsluCounter, 319 mSDsCounter, 0 mSdLazyCounter, 381 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 402 SdHoareTripleChecker+Invalid, 397 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 381 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 23:37:49,983 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [119 Valid, 402 Invalid, 397 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 381 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-20 23:37:49,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2022-02-20 23:37:49,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 239. [2022-02-20 23:37:49,987 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:37:49,988 INFO L82 GeneralOperation]: Start isEquivalent. First operand 335 states. Second operand has 239 states, 197 states have (on average 1.482233502538071) internal successors, (292), 220 states have internal predecessors, (292), 11 states have call successors, (11), 7 states have call predecessors, (11), 13 states have return successors, (46), 11 states have call predecessors, (46), 11 states have call successors, (46) [2022-02-20 23:37:49,988 INFO L74 IsIncluded]: Start isIncluded. First operand 335 states. Second operand has 239 states, 197 states have (on average 1.482233502538071) internal successors, (292), 220 states have internal predecessors, (292), 11 states have call successors, (11), 7 states have call predecessors, (11), 13 states have return successors, (46), 11 states have call predecessors, (46), 11 states have call successors, (46) [2022-02-20 23:37:49,989 INFO L87 Difference]: Start difference. First operand 335 states. Second operand has 239 states, 197 states have (on average 1.482233502538071) internal successors, (292), 220 states have internal predecessors, (292), 11 states have call successors, (11), 7 states have call predecessors, (11), 13 states have return successors, (46), 11 states have call predecessors, (46), 11 states have call successors, (46) [2022-02-20 23:37:50,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:37:50,002 INFO L93 Difference]: Finished difference Result 335 states and 463 transitions. [2022-02-20 23:37:50,002 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 463 transitions. [2022-02-20 23:37:50,003 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:37:50,004 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:37:50,005 INFO L74 IsIncluded]: Start isIncluded. First operand has 239 states, 197 states have (on average 1.482233502538071) internal successors, (292), 220 states have internal predecessors, (292), 11 states have call successors, (11), 7 states have call predecessors, (11), 13 states have return successors, (46), 11 states have call predecessors, (46), 11 states have call successors, (46) Second operand 335 states. [2022-02-20 23:37:50,005 INFO L87 Difference]: Start difference. First operand has 239 states, 197 states have (on average 1.482233502538071) internal successors, (292), 220 states have internal predecessors, (292), 11 states have call successors, (11), 7 states have call predecessors, (11), 13 states have return successors, (46), 11 states have call predecessors, (46), 11 states have call successors, (46) Second operand 335 states. [2022-02-20 23:37:50,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:37:50,012 INFO L93 Difference]: Finished difference Result 335 states and 463 transitions. [2022-02-20 23:37:50,012 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 463 transitions. [2022-02-20 23:37:50,013 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:37:50,013 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:37:50,013 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:37:50,013 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:37:50,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 197 states have (on average 1.482233502538071) internal successors, (292), 220 states have internal predecessors, (292), 11 states have call successors, (11), 7 states have call predecessors, (11), 13 states have return successors, (46), 11 states have call predecessors, (46), 11 states have call successors, (46) [2022-02-20 23:37:50,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 349 transitions. [2022-02-20 23:37:50,019 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 349 transitions. Word has length 15 [2022-02-20 23:37:50,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:37:50,019 INFO L470 AbstractCegarLoop]: Abstraction has 239 states and 349 transitions. [2022-02-20 23:37:50,019 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:37:50,019 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 349 transitions. [2022-02-20 23:37:50,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-02-20 23:37:50,020 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:37:50,020 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:37:50,039 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 23:37:50,225 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,SelfDestructingSolverStorable7 [2022-02-20 23:37:50,225 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATION, parse_inputErr1REQUIRES_VIOLATION, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2022-02-20 23:37:50,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:37:50,226 INFO L85 PathProgramCache]: Analyzing trace with hash -588154008, now seen corresponding path program 1 times [2022-02-20 23:37:50,226 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:37:50,226 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096254257] [2022-02-20 23:37:50,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:37:50,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:37:50,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:37:50,364 INFO L290 TraceCheckUtils]: 0: Hoare triple {7631#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(3, 1);call write~init~int(99, 1, 0, 1);call write~init~int(49, 1, 1, 1);call write~init~int(0, 1, 2, 1);call #Ultimate.allocInit(3, 2);call write~init~int(99, 2, 0, 1);call write~init~int(50, 2, 1, 1);call write~init~int(0, 2, 2, 1);call #Ultimate.allocInit(3, 3);call write~init~int(99, 3, 0, 1);call write~init~int(49, 3, 1, 1);call write~init~int(0, 3, 2, 1);call #Ultimate.allocInit(3, 4);call write~init~int(99, 4, 0, 1);call write~init~int(49, 4, 1, 1);call write~init~int(0, 4, 2, 1);call #Ultimate.allocInit(3, 5);call write~init~int(99, 5, 0, 1);call write~init~int(50, 5, 1, 1);call write~init~int(0, 5, 2, 1);~state~0 := ~unnamed3~0~STATE_1;~global~0.base, ~global~0.offset := 0, 0;~#commands~0.base, ~#commands~0.offset := 6, 0;call #Ultimate.allocInit(18, 6);call write~init~$Pointer$(1, 0, ~#commands~0.base, ~#commands~0.offset, 4);call write~init~$Pointer$(#funAddr~c1.base, #funAddr~c1.offset, ~#commands~0.base, 4 + ~#commands~0.offset, 4);call write~init~int((if ~unnamed3~0~STATE_1 % 256 <= 127 then ~unnamed3~0~STATE_1 % 256 else ~unnamed3~0~STATE_1 % 256 - 256), ~#commands~0.base, 8 + ~#commands~0.offset, 1);call write~init~$Pointer$(2, 0, ~#commands~0.base, 9 + ~#commands~0.offset, 4);call write~init~$Pointer$(#funAddr~c2.base, #funAddr~c2.offset, ~#commands~0.base, 13 + ~#commands~0.offset, 4);call write~init~int((if ~unnamed3~0~STATE_2 % 256 <= 127 then ~unnamed3~0~STATE_2 % 256 else ~unnamed3~0~STATE_2 % 256 - 256), ~#commands~0.base, 17 + ~#commands~0.offset, 1); {7633#(and (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) (+ |~#commands~0.offset| 9)) 0) (= 3 (select |#length| 2)) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) (+ |~#commands~0.offset| 9)) 2))} is VALID [2022-02-20 23:37:50,365 INFO L290 TraceCheckUtils]: 1: Hoare triple {7633#(and (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) (+ |~#commands~0.offset| 9)) 0) (= 3 (select |#length| 2)) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) (+ |~#commands~0.offset| 9)) 2))} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1; {7633#(and (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) (+ |~#commands~0.offset| 9)) 0) (= 3 (select |#length| 2)) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) (+ |~#commands~0.offset| 9)) 2))} is VALID [2022-02-20 23:37:50,365 INFO L272 TraceCheckUtils]: 2: Hoare triple {7633#(and (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) (+ |~#commands~0.offset| 9)) 0) (= 3 (select |#length| 2)) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) (+ |~#commands~0.offset| 9)) 2))} call parse_input(3, 0); {7633#(and (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) (+ |~#commands~0.offset| 9)) 0) (= 3 (select |#length| 2)) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) (+ |~#commands~0.offset| 9)) 2))} is VALID [2022-02-20 23:37:50,366 INFO L290 TraceCheckUtils]: 3: Hoare triple {7633#(and (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) (+ |~#commands~0.offset| 9)) 0) (= 3 (select |#length| 2)) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) (+ |~#commands~0.offset| 9)) 2))} ~input#1.base, ~input#1.offset := #in~input#1.base, #in~input#1.offset;~i~0#1 := 0; {7634#(and (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) (+ |~#commands~0.offset| 9)) 0) (= 3 (select |#length| 2)) (= |parse_input_~i~0#1| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) (+ |~#commands~0.offset| 9)) 2))} is VALID [2022-02-20 23:37:50,366 INFO L290 TraceCheckUtils]: 4: Hoare triple {7634#(and (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) (+ |~#commands~0.offset| 9)) 0) (= 3 (select |#length| 2)) (= |parse_input_~i~0#1| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) (+ |~#commands~0.offset| 9)) 2))} assume !!(~i~0#1 < 2); {7634#(and (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) (+ |~#commands~0.offset| 9)) 0) (= 3 (select |#length| 2)) (= |parse_input_~i~0#1| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) (+ |~#commands~0.offset| 9)) 2))} is VALID [2022-02-20 23:37:50,367 INFO L290 TraceCheckUtils]: 5: Hoare triple {7634#(and (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) (+ |~#commands~0.offset| 9)) 0) (= 3 (select |#length| 2)) (= |parse_input_~i~0#1| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) (+ |~#commands~0.offset| 9)) 2))} SUMMARY for call #t~mem3#1.base, #t~mem3#1.offset := read~$Pointer$(~#commands~0.base, ~#commands~0.offset + 9 * ~i~0#1, 4); srcloc: L693 {7634#(and (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) (+ |~#commands~0.offset| 9)) 0) (= 3 (select |#length| 2)) (= |parse_input_~i~0#1| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) (+ |~#commands~0.offset| 9)) 2))} is VALID [2022-02-20 23:37:50,367 INFO L290 TraceCheckUtils]: 6: Hoare triple {7634#(and (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) (+ |~#commands~0.offset| 9)) 0) (= 3 (select |#length| 2)) (= |parse_input_~i~0#1| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) (+ |~#commands~0.offset| 9)) 2))} assume 1 == #valid[#t~mem3#1.base]; {7634#(and (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) (+ |~#commands~0.offset| 9)) 0) (= 3 (select |#length| 2)) (= |parse_input_~i~0#1| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) (+ |~#commands~0.offset| 9)) 2))} is VALID [2022-02-20 23:37:50,368 INFO L290 TraceCheckUtils]: 7: Hoare triple {7634#(and (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) (+ |~#commands~0.offset| 9)) 0) (= 3 (select |#length| 2)) (= |parse_input_~i~0#1| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) (+ |~#commands~0.offset| 9)) 2))} assume #t~mem3#1.offset < #length[#t~mem3#1.base] && #t~mem3#1.offset >= 0; {7634#(and (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) (+ |~#commands~0.offset| 9)) 0) (= 3 (select |#length| 2)) (= |parse_input_~i~0#1| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) (+ |~#commands~0.offset| 9)) 2))} is VALID [2022-02-20 23:37:50,368 INFO L290 TraceCheckUtils]: 8: Hoare triple {7634#(and (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) (+ |~#commands~0.offset| 9)) 0) (= 3 (select |#length| 2)) (= |parse_input_~i~0#1| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) (+ |~#commands~0.offset| 9)) 2))} assume 1 == #valid[~input#1.base]; {7634#(and (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) (+ |~#commands~0.offset| 9)) 0) (= 3 (select |#length| 2)) (= |parse_input_~i~0#1| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) (+ |~#commands~0.offset| 9)) 2))} is VALID [2022-02-20 23:37:50,369 INFO L290 TraceCheckUtils]: 9: Hoare triple {7634#(and (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) (+ |~#commands~0.offset| 9)) 0) (= 3 (select |#length| 2)) (= |parse_input_~i~0#1| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) (+ |~#commands~0.offset| 9)) 2))} assume ~input#1.offset < #length[~input#1.base] && ~input#1.offset >= 0; {7634#(and (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) (+ |~#commands~0.offset| 9)) 0) (= 3 (select |#length| 2)) (= |parse_input_~i~0#1| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) (+ |~#commands~0.offset| 9)) 2))} is VALID [2022-02-20 23:37:50,369 INFO L290 TraceCheckUtils]: 10: Hoare triple {7634#(and (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) (+ |~#commands~0.offset| 9)) 0) (= 3 (select |#length| 2)) (= |parse_input_~i~0#1| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) (+ |~#commands~0.offset| 9)) 2))} assume !(0 == #t~nondet4#1);havoc #t~mem3#1.base, #t~mem3#1.offset;havoc #t~nondet4#1; {7634#(and (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) (+ |~#commands~0.offset| 9)) 0) (= 3 (select |#length| 2)) (= |parse_input_~i~0#1| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) (+ |~#commands~0.offset| 9)) 2))} is VALID [2022-02-20 23:37:50,370 INFO L290 TraceCheckUtils]: 11: Hoare triple {7634#(and (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) (+ |~#commands~0.offset| 9)) 0) (= 3 (select |#length| 2)) (= |parse_input_~i~0#1| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) (+ |~#commands~0.offset| 9)) 2))} #t~post2#1 := ~i~0#1;~i~0#1 := 1 + #t~post2#1;havoc #t~post2#1; {7635#(and (< 0 |parse_input_~i~0#1|) (or (not (= (+ |~#commands~0.offset| 9) (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset|))) (and (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) (+ |~#commands~0.offset| 9)) 0) (= 3 (select |#length| 2)) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) (+ |~#commands~0.offset| 9)) 2))))} is VALID [2022-02-20 23:37:50,370 INFO L290 TraceCheckUtils]: 12: Hoare triple {7635#(and (< 0 |parse_input_~i~0#1|) (or (not (= (+ |~#commands~0.offset| 9) (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset|))) (and (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) (+ |~#commands~0.offset| 9)) 0) (= 3 (select |#length| 2)) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) (+ |~#commands~0.offset| 9)) 2))))} assume !!(~i~0#1 < 2); {7636#(and (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) (+ |~#commands~0.offset| 9)) 0) (= 3 (select |#length| 2)) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) (+ |~#commands~0.offset| 9)) 2) (= (+ |~#commands~0.offset| 9) (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset|)))} is VALID [2022-02-20 23:37:50,371 INFO L290 TraceCheckUtils]: 13: Hoare triple {7636#(and (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) (+ |~#commands~0.offset| 9)) 0) (= 3 (select |#length| 2)) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) (+ |~#commands~0.offset| 9)) 2) (= (+ |~#commands~0.offset| 9) (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset|)))} SUMMARY for call #t~mem3#1.base, #t~mem3#1.offset := read~$Pointer$(~#commands~0.base, ~#commands~0.offset + 9 * ~i~0#1, 4); srcloc: L693 {7637#(and (= |parse_input_#t~mem3#1.offset| 0) (= (+ (select |#length| |parse_input_#t~mem3#1.base|) (- 3)) 0))} is VALID [2022-02-20 23:37:50,371 INFO L290 TraceCheckUtils]: 14: Hoare triple {7637#(and (= |parse_input_#t~mem3#1.offset| 0) (= (+ (select |#length| |parse_input_#t~mem3#1.base|) (- 3)) 0))} assume 1 == #valid[#t~mem3#1.base]; {7637#(and (= |parse_input_#t~mem3#1.offset| 0) (= (+ (select |#length| |parse_input_#t~mem3#1.base|) (- 3)) 0))} is VALID [2022-02-20 23:37:50,371 INFO L290 TraceCheckUtils]: 15: Hoare triple {7637#(and (= |parse_input_#t~mem3#1.offset| 0) (= (+ (select |#length| |parse_input_#t~mem3#1.base|) (- 3)) 0))} assume !(#t~mem3#1.offset < #length[#t~mem3#1.base] && #t~mem3#1.offset >= 0); {7632#false} is VALID [2022-02-20 23:37:50,372 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:37:50,372 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:37:50,372 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096254257] [2022-02-20 23:37:50,372 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1096254257] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 23:37:50,372 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [586358039] [2022-02-20 23:37:50,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:37:50,373 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:37:50,373 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:37:50,380 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 23:37:50,381 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 23:37:50,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:37:50,428 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 16 conjunts are in the unsatisfiable core [2022-02-20 23:37:50,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:37:50,440 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:37:50,695 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-02-20 23:37:50,709 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-02-20 23:37:50,730 INFO L290 TraceCheckUtils]: 0: Hoare triple {7631#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(3, 1);call write~init~int(99, 1, 0, 1);call write~init~int(49, 1, 1, 1);call write~init~int(0, 1, 2, 1);call #Ultimate.allocInit(3, 2);call write~init~int(99, 2, 0, 1);call write~init~int(50, 2, 1, 1);call write~init~int(0, 2, 2, 1);call #Ultimate.allocInit(3, 3);call write~init~int(99, 3, 0, 1);call write~init~int(49, 3, 1, 1);call write~init~int(0, 3, 2, 1);call #Ultimate.allocInit(3, 4);call write~init~int(99, 4, 0, 1);call write~init~int(49, 4, 1, 1);call write~init~int(0, 4, 2, 1);call #Ultimate.allocInit(3, 5);call write~init~int(99, 5, 0, 1);call write~init~int(50, 5, 1, 1);call write~init~int(0, 5, 2, 1);~state~0 := ~unnamed3~0~STATE_1;~global~0.base, ~global~0.offset := 0, 0;~#commands~0.base, ~#commands~0.offset := 6, 0;call #Ultimate.allocInit(18, 6);call write~init~$Pointer$(1, 0, ~#commands~0.base, ~#commands~0.offset, 4);call write~init~$Pointer$(#funAddr~c1.base, #funAddr~c1.offset, ~#commands~0.base, 4 + ~#commands~0.offset, 4);call write~init~int((if ~unnamed3~0~STATE_1 % 256 <= 127 then ~unnamed3~0~STATE_1 % 256 else ~unnamed3~0~STATE_1 % 256 - 256), ~#commands~0.base, 8 + ~#commands~0.offset, 1);call write~init~$Pointer$(2, 0, ~#commands~0.base, 9 + ~#commands~0.offset, 4);call write~init~$Pointer$(#funAddr~c2.base, #funAddr~c2.offset, ~#commands~0.base, 13 + ~#commands~0.offset, 4);call write~init~int((if ~unnamed3~0~STATE_2 % 256 <= 127 then ~unnamed3~0~STATE_2 % 256 else ~unnamed3~0~STATE_2 % 256 - 256), ~#commands~0.base, 17 + ~#commands~0.offset, 1); {7641#(and (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) (+ |~#commands~0.offset| 9)) 0) (<= 3 (select |#length| 2)) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) (+ |~#commands~0.offset| 9)) 2))} is VALID [2022-02-20 23:37:50,731 INFO L290 TraceCheckUtils]: 1: Hoare triple {7641#(and (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) (+ |~#commands~0.offset| 9)) 0) (<= 3 (select |#length| 2)) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) (+ |~#commands~0.offset| 9)) 2))} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1; {7641#(and (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) (+ |~#commands~0.offset| 9)) 0) (<= 3 (select |#length| 2)) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) (+ |~#commands~0.offset| 9)) 2))} is VALID [2022-02-20 23:37:50,731 INFO L272 TraceCheckUtils]: 2: Hoare triple {7641#(and (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) (+ |~#commands~0.offset| 9)) 0) (<= 3 (select |#length| 2)) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) (+ |~#commands~0.offset| 9)) 2))} call parse_input(3, 0); {7641#(and (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) (+ |~#commands~0.offset| 9)) 0) (<= 3 (select |#length| 2)) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) (+ |~#commands~0.offset| 9)) 2))} is VALID [2022-02-20 23:37:50,732 INFO L290 TraceCheckUtils]: 3: Hoare triple {7641#(and (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) (+ |~#commands~0.offset| 9)) 0) (<= 3 (select |#length| 2)) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) (+ |~#commands~0.offset| 9)) 2))} ~input#1.base, ~input#1.offset := #in~input#1.base, #in~input#1.offset;~i~0#1 := 0; {7651#(and (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) (+ |~#commands~0.offset| 9)) 0) (<= 3 (select |#length| 2)) (= |parse_input_~i~0#1| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) (+ |~#commands~0.offset| 9)) 2))} is VALID [2022-02-20 23:37:50,732 INFO L290 TraceCheckUtils]: 4: Hoare triple {7651#(and (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) (+ |~#commands~0.offset| 9)) 0) (<= 3 (select |#length| 2)) (= |parse_input_~i~0#1| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) (+ |~#commands~0.offset| 9)) 2))} assume !!(~i~0#1 < 2); {7651#(and (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) (+ |~#commands~0.offset| 9)) 0) (<= 3 (select |#length| 2)) (= |parse_input_~i~0#1| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) (+ |~#commands~0.offset| 9)) 2))} is VALID [2022-02-20 23:37:50,733 INFO L290 TraceCheckUtils]: 5: Hoare triple {7651#(and (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) (+ |~#commands~0.offset| 9)) 0) (<= 3 (select |#length| 2)) (= |parse_input_~i~0#1| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) (+ |~#commands~0.offset| 9)) 2))} SUMMARY for call #t~mem3#1.base, #t~mem3#1.offset := read~$Pointer$(~#commands~0.base, ~#commands~0.offset + 9 * ~i~0#1, 4); srcloc: L693 {7651#(and (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) (+ |~#commands~0.offset| 9)) 0) (<= 3 (select |#length| 2)) (= |parse_input_~i~0#1| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) (+ |~#commands~0.offset| 9)) 2))} is VALID [2022-02-20 23:37:50,733 INFO L290 TraceCheckUtils]: 6: Hoare triple {7651#(and (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) (+ |~#commands~0.offset| 9)) 0) (<= 3 (select |#length| 2)) (= |parse_input_~i~0#1| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) (+ |~#commands~0.offset| 9)) 2))} assume 1 == #valid[#t~mem3#1.base]; {7651#(and (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) (+ |~#commands~0.offset| 9)) 0) (<= 3 (select |#length| 2)) (= |parse_input_~i~0#1| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) (+ |~#commands~0.offset| 9)) 2))} is VALID [2022-02-20 23:37:50,733 INFO L290 TraceCheckUtils]: 7: Hoare triple {7651#(and (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) (+ |~#commands~0.offset| 9)) 0) (<= 3 (select |#length| 2)) (= |parse_input_~i~0#1| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) (+ |~#commands~0.offset| 9)) 2))} assume #t~mem3#1.offset < #length[#t~mem3#1.base] && #t~mem3#1.offset >= 0; {7651#(and (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) (+ |~#commands~0.offset| 9)) 0) (<= 3 (select |#length| 2)) (= |parse_input_~i~0#1| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) (+ |~#commands~0.offset| 9)) 2))} is VALID [2022-02-20 23:37:50,734 INFO L290 TraceCheckUtils]: 8: Hoare triple {7651#(and (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) (+ |~#commands~0.offset| 9)) 0) (<= 3 (select |#length| 2)) (= |parse_input_~i~0#1| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) (+ |~#commands~0.offset| 9)) 2))} assume 1 == #valid[~input#1.base]; {7651#(and (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) (+ |~#commands~0.offset| 9)) 0) (<= 3 (select |#length| 2)) (= |parse_input_~i~0#1| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) (+ |~#commands~0.offset| 9)) 2))} is VALID [2022-02-20 23:37:50,734 INFO L290 TraceCheckUtils]: 9: Hoare triple {7651#(and (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) (+ |~#commands~0.offset| 9)) 0) (<= 3 (select |#length| 2)) (= |parse_input_~i~0#1| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) (+ |~#commands~0.offset| 9)) 2))} assume ~input#1.offset < #length[~input#1.base] && ~input#1.offset >= 0; {7651#(and (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) (+ |~#commands~0.offset| 9)) 0) (<= 3 (select |#length| 2)) (= |parse_input_~i~0#1| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) (+ |~#commands~0.offset| 9)) 2))} is VALID [2022-02-20 23:37:50,735 INFO L290 TraceCheckUtils]: 10: Hoare triple {7651#(and (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) (+ |~#commands~0.offset| 9)) 0) (<= 3 (select |#length| 2)) (= |parse_input_~i~0#1| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) (+ |~#commands~0.offset| 9)) 2))} assume !(0 == #t~nondet4#1);havoc #t~mem3#1.base, #t~mem3#1.offset;havoc #t~nondet4#1; {7651#(and (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) (+ |~#commands~0.offset| 9)) 0) (<= 3 (select |#length| 2)) (= |parse_input_~i~0#1| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) (+ |~#commands~0.offset| 9)) 2))} is VALID [2022-02-20 23:37:50,735 INFO L290 TraceCheckUtils]: 11: Hoare triple {7651#(and (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) (+ |~#commands~0.offset| 9)) 0) (<= 3 (select |#length| 2)) (= |parse_input_~i~0#1| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) (+ |~#commands~0.offset| 9)) 2))} #t~post2#1 := ~i~0#1;~i~0#1 := 1 + #t~post2#1;havoc #t~post2#1; {7676#(and (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) (+ |~#commands~0.offset| 9)) 0) (= (+ (- 1) |parse_input_~i~0#1|) 0) (<= 3 (select |#length| 2)) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) (+ |~#commands~0.offset| 9)) 2))} is VALID [2022-02-20 23:37:50,736 INFO L290 TraceCheckUtils]: 12: Hoare triple {7676#(and (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) (+ |~#commands~0.offset| 9)) 0) (= (+ (- 1) |parse_input_~i~0#1|) 0) (<= 3 (select |#length| 2)) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) (+ |~#commands~0.offset| 9)) 2))} assume !!(~i~0#1 < 2); {7676#(and (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) (+ |~#commands~0.offset| 9)) 0) (= (+ (- 1) |parse_input_~i~0#1|) 0) (<= 3 (select |#length| 2)) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) (+ |~#commands~0.offset| 9)) 2))} is VALID [2022-02-20 23:37:50,736 INFO L290 TraceCheckUtils]: 13: Hoare triple {7676#(and (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) (+ |~#commands~0.offset| 9)) 0) (= (+ (- 1) |parse_input_~i~0#1|) 0) (<= 3 (select |#length| 2)) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) (+ |~#commands~0.offset| 9)) 2))} SUMMARY for call #t~mem3#1.base, #t~mem3#1.offset := read~$Pointer$(~#commands~0.base, ~#commands~0.offset + 9 * ~i~0#1, 4); srcloc: L693 {7683#(and (<= 3 (select |#length| 2)) (= |parse_input_#t~mem3#1.base| 2) (= |parse_input_#t~mem3#1.offset| 0))} is VALID [2022-02-20 23:37:50,737 INFO L290 TraceCheckUtils]: 14: Hoare triple {7683#(and (<= 3 (select |#length| 2)) (= |parse_input_#t~mem3#1.base| 2) (= |parse_input_#t~mem3#1.offset| 0))} assume 1 == #valid[#t~mem3#1.base]; {7683#(and (<= 3 (select |#length| 2)) (= |parse_input_#t~mem3#1.base| 2) (= |parse_input_#t~mem3#1.offset| 0))} is VALID [2022-02-20 23:37:50,737 INFO L290 TraceCheckUtils]: 15: Hoare triple {7683#(and (<= 3 (select |#length| 2)) (= |parse_input_#t~mem3#1.base| 2) (= |parse_input_#t~mem3#1.offset| 0))} assume !(#t~mem3#1.offset < #length[#t~mem3#1.base] && #t~mem3#1.offset >= 0); {7632#false} is VALID [2022-02-20 23:37:50,737 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:37:50,737 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:37:50,950 INFO L290 TraceCheckUtils]: 15: Hoare triple {7690#(and (< |parse_input_#t~mem3#1.offset| (select |#length| |parse_input_#t~mem3#1.base|)) (<= 0 |parse_input_#t~mem3#1.offset|))} assume !(#t~mem3#1.offset < #length[#t~mem3#1.base] && #t~mem3#1.offset >= 0); {7632#false} is VALID [2022-02-20 23:37:50,950 INFO L290 TraceCheckUtils]: 14: Hoare triple {7690#(and (< |parse_input_#t~mem3#1.offset| (select |#length| |parse_input_#t~mem3#1.base|)) (<= 0 |parse_input_#t~mem3#1.offset|))} assume 1 == #valid[#t~mem3#1.base]; {7690#(and (< |parse_input_#t~mem3#1.offset| (select |#length| |parse_input_#t~mem3#1.base|)) (<= 0 |parse_input_#t~mem3#1.offset|))} is VALID [2022-02-20 23:37:50,951 INFO L290 TraceCheckUtils]: 13: Hoare triple {7697#(and (<= 0 (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset|))) (< (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset|)) (select |#length| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset|)))))} SUMMARY for call #t~mem3#1.base, #t~mem3#1.offset := read~$Pointer$(~#commands~0.base, ~#commands~0.offset + 9 * ~i~0#1, 4); srcloc: L693 {7690#(and (< |parse_input_#t~mem3#1.offset| (select |#length| |parse_input_#t~mem3#1.base|)) (<= 0 |parse_input_#t~mem3#1.offset|))} is VALID [2022-02-20 23:37:50,951 INFO L290 TraceCheckUtils]: 12: Hoare triple {7697#(and (<= 0 (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset|))) (< (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset|)) (select |#length| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset|)))))} assume !!(~i~0#1 < 2); {7697#(and (<= 0 (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset|))) (< (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset|)) (select |#length| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset|)))))} is VALID [2022-02-20 23:37:50,952 INFO L290 TraceCheckUtils]: 11: Hoare triple {7704#(and (<= 0 (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset| 9))) (< (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset| 9)) (select |#length| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset| 9)))))} #t~post2#1 := ~i~0#1;~i~0#1 := 1 + #t~post2#1;havoc #t~post2#1; {7697#(and (<= 0 (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset|))) (< (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset|)) (select |#length| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset|)))))} is VALID [2022-02-20 23:37:50,953 INFO L290 TraceCheckUtils]: 10: Hoare triple {7704#(and (<= 0 (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset| 9))) (< (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset| 9)) (select |#length| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset| 9)))))} assume !(0 == #t~nondet4#1);havoc #t~mem3#1.base, #t~mem3#1.offset;havoc #t~nondet4#1; {7704#(and (<= 0 (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset| 9))) (< (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset| 9)) (select |#length| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset| 9)))))} is VALID [2022-02-20 23:37:50,955 INFO L290 TraceCheckUtils]: 9: Hoare triple {7704#(and (<= 0 (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset| 9))) (< (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset| 9)) (select |#length| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset| 9)))))} assume ~input#1.offset < #length[~input#1.base] && ~input#1.offset >= 0; {7704#(and (<= 0 (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset| 9))) (< (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset| 9)) (select |#length| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset| 9)))))} is VALID [2022-02-20 23:37:50,956 INFO L290 TraceCheckUtils]: 8: Hoare triple {7704#(and (<= 0 (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset| 9))) (< (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset| 9)) (select |#length| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset| 9)))))} assume 1 == #valid[~input#1.base]; {7704#(and (<= 0 (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset| 9))) (< (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset| 9)) (select |#length| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset| 9)))))} is VALID [2022-02-20 23:37:50,956 INFO L290 TraceCheckUtils]: 7: Hoare triple {7704#(and (<= 0 (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset| 9))) (< (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset| 9)) (select |#length| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset| 9)))))} assume #t~mem3#1.offset < #length[#t~mem3#1.base] && #t~mem3#1.offset >= 0; {7704#(and (<= 0 (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset| 9))) (< (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset| 9)) (select |#length| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset| 9)))))} is VALID [2022-02-20 23:37:50,957 INFO L290 TraceCheckUtils]: 6: Hoare triple {7704#(and (<= 0 (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset| 9))) (< (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset| 9)) (select |#length| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset| 9)))))} assume 1 == #valid[#t~mem3#1.base]; {7704#(and (<= 0 (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset| 9))) (< (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset| 9)) (select |#length| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset| 9)))))} is VALID [2022-02-20 23:37:50,957 INFO L290 TraceCheckUtils]: 5: Hoare triple {7704#(and (<= 0 (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset| 9))) (< (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset| 9)) (select |#length| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset| 9)))))} SUMMARY for call #t~mem3#1.base, #t~mem3#1.offset := read~$Pointer$(~#commands~0.base, ~#commands~0.offset + 9 * ~i~0#1, 4); srcloc: L693 {7704#(and (<= 0 (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset| 9))) (< (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset| 9)) (select |#length| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset| 9)))))} is VALID [2022-02-20 23:37:50,958 INFO L290 TraceCheckUtils]: 4: Hoare triple {7704#(and (<= 0 (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset| 9))) (< (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset| 9)) (select |#length| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset| 9)))))} assume !!(~i~0#1 < 2); {7704#(and (<= 0 (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset| 9))) (< (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset| 9)) (select |#length| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset| 9)))))} is VALID [2022-02-20 23:37:50,958 INFO L290 TraceCheckUtils]: 3: Hoare triple {7729#(and (< (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) (+ |~#commands~0.offset| 9)) (select |#length| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) (+ |~#commands~0.offset| 9)))) (<= 0 (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) (+ |~#commands~0.offset| 9))))} ~input#1.base, ~input#1.offset := #in~input#1.base, #in~input#1.offset;~i~0#1 := 0; {7704#(and (<= 0 (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset| 9))) (< (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset| 9)) (select |#length| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset| 9)))))} is VALID [2022-02-20 23:37:50,959 INFO L272 TraceCheckUtils]: 2: Hoare triple {7729#(and (< (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) (+ |~#commands~0.offset| 9)) (select |#length| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) (+ |~#commands~0.offset| 9)))) (<= 0 (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) (+ |~#commands~0.offset| 9))))} call parse_input(3, 0); {7729#(and (< (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) (+ |~#commands~0.offset| 9)) (select |#length| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) (+ |~#commands~0.offset| 9)))) (<= 0 (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) (+ |~#commands~0.offset| 9))))} is VALID [2022-02-20 23:37:50,959 INFO L290 TraceCheckUtils]: 1: Hoare triple {7729#(and (< (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) (+ |~#commands~0.offset| 9)) (select |#length| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) (+ |~#commands~0.offset| 9)))) (<= 0 (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) (+ |~#commands~0.offset| 9))))} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1; {7729#(and (< (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) (+ |~#commands~0.offset| 9)) (select |#length| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) (+ |~#commands~0.offset| 9)))) (<= 0 (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) (+ |~#commands~0.offset| 9))))} is VALID [2022-02-20 23:37:50,961 INFO L290 TraceCheckUtils]: 0: Hoare triple {7631#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(3, 1);call write~init~int(99, 1, 0, 1);call write~init~int(49, 1, 1, 1);call write~init~int(0, 1, 2, 1);call #Ultimate.allocInit(3, 2);call write~init~int(99, 2, 0, 1);call write~init~int(50, 2, 1, 1);call write~init~int(0, 2, 2, 1);call #Ultimate.allocInit(3, 3);call write~init~int(99, 3, 0, 1);call write~init~int(49, 3, 1, 1);call write~init~int(0, 3, 2, 1);call #Ultimate.allocInit(3, 4);call write~init~int(99, 4, 0, 1);call write~init~int(49, 4, 1, 1);call write~init~int(0, 4, 2, 1);call #Ultimate.allocInit(3, 5);call write~init~int(99, 5, 0, 1);call write~init~int(50, 5, 1, 1);call write~init~int(0, 5, 2, 1);~state~0 := ~unnamed3~0~STATE_1;~global~0.base, ~global~0.offset := 0, 0;~#commands~0.base, ~#commands~0.offset := 6, 0;call #Ultimate.allocInit(18, 6);call write~init~$Pointer$(1, 0, ~#commands~0.base, ~#commands~0.offset, 4);call write~init~$Pointer$(#funAddr~c1.base, #funAddr~c1.offset, ~#commands~0.base, 4 + ~#commands~0.offset, 4);call write~init~int((if ~unnamed3~0~STATE_1 % 256 <= 127 then ~unnamed3~0~STATE_1 % 256 else ~unnamed3~0~STATE_1 % 256 - 256), ~#commands~0.base, 8 + ~#commands~0.offset, 1);call write~init~$Pointer$(2, 0, ~#commands~0.base, 9 + ~#commands~0.offset, 4);call write~init~$Pointer$(#funAddr~c2.base, #funAddr~c2.offset, ~#commands~0.base, 13 + ~#commands~0.offset, 4);call write~init~int((if ~unnamed3~0~STATE_2 % 256 <= 127 then ~unnamed3~0~STATE_2 % 256 else ~unnamed3~0~STATE_2 % 256 - 256), ~#commands~0.base, 17 + ~#commands~0.offset, 1); {7729#(and (< (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) (+ |~#commands~0.offset| 9)) (select |#length| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) (+ |~#commands~0.offset| 9)))) (<= 0 (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) (+ |~#commands~0.offset| 9))))} is VALID [2022-02-20 23:37:50,961 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:37:50,961 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [586358039] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 23:37:50,961 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 23:37:50,961 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 13 [2022-02-20 23:37:50,962 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769206551] [2022-02-20 23:37:50,962 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 23:37:50,962 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 14 states have internal predecessors, (45), 3 states have call successors, (3), 3 states have call predecessors, (3), 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 23:37:50,962 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:37:50,962 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 15 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 14 states have internal predecessors, (45), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:37:51,004 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:37:51,004 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-02-20 23:37:51,004 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:37:51,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-02-20 23:37:51,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2022-02-20 23:37:51,005 INFO L87 Difference]: Start difference. First operand 239 states and 349 transitions. Second operand has 15 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 14 states have internal predecessors, (45), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:37:52,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:37:52,907 INFO L93 Difference]: Finished difference Result 570 states and 775 transitions. [2022-02-20 23:37:52,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-02-20 23:37:52,908 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 14 states have internal predecessors, (45), 3 states have call successors, (3), 3 states have call predecessors, (3), 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 23:37:52,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:37:52,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 14 states have internal predecessors, (45), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:37:52,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 331 transitions. [2022-02-20 23:37:52,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 14 states have internal predecessors, (45), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:37:52,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 331 transitions. [2022-02-20 23:37:52,917 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states and 331 transitions. [2022-02-20 23:37:53,192 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 331 edges. 331 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:37:53,204 INFO L225 Difference]: With dead ends: 570 [2022-02-20 23:37:53,204 INFO L226 Difference]: Without dead ends: 570 [2022-02-20 23:37:53,205 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=137, Invalid=513, Unknown=0, NotChecked=0, Total=650 [2022-02-20 23:37:53,206 INFO L933 BasicCegarLoop]: 104 mSDtfsCounter, 529 mSDsluCounter, 698 mSDsCounter, 0 mSdLazyCounter, 489 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 529 SdHoareTripleChecker+Valid, 802 SdHoareTripleChecker+Invalid, 540 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 489 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-02-20 23:37:53,207 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [529 Valid, 802 Invalid, 540 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 489 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-02-20 23:37:53,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2022-02-20 23:37:53,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 347. [2022-02-20 23:37:53,215 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:37:53,217 INFO L82 GeneralOperation]: Start isEquivalent. First operand 570 states. Second operand has 347 states, 294 states have (on average 1.5136054421768708) internal successors, (445), 322 states have internal predecessors, (445), 14 states have call successors, (14), 10 states have call predecessors, (14), 21 states have return successors, (60), 14 states have call predecessors, (60), 14 states have call successors, (60) [2022-02-20 23:37:53,217 INFO L74 IsIncluded]: Start isIncluded. First operand 570 states. Second operand has 347 states, 294 states have (on average 1.5136054421768708) internal successors, (445), 322 states have internal predecessors, (445), 14 states have call successors, (14), 10 states have call predecessors, (14), 21 states have return successors, (60), 14 states have call predecessors, (60), 14 states have call successors, (60) [2022-02-20 23:37:53,218 INFO L87 Difference]: Start difference. First operand 570 states. Second operand has 347 states, 294 states have (on average 1.5136054421768708) internal successors, (445), 322 states have internal predecessors, (445), 14 states have call successors, (14), 10 states have call predecessors, (14), 21 states have return successors, (60), 14 states have call predecessors, (60), 14 states have call successors, (60) [2022-02-20 23:37:53,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:37:53,233 INFO L93 Difference]: Finished difference Result 570 states and 775 transitions. [2022-02-20 23:37:53,233 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 775 transitions. [2022-02-20 23:37:53,235 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:37:53,235 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:37:53,236 INFO L74 IsIncluded]: Start isIncluded. First operand has 347 states, 294 states have (on average 1.5136054421768708) internal successors, (445), 322 states have internal predecessors, (445), 14 states have call successors, (14), 10 states have call predecessors, (14), 21 states have return successors, (60), 14 states have call predecessors, (60), 14 states have call successors, (60) Second operand 570 states. [2022-02-20 23:37:53,236 INFO L87 Difference]: Start difference. First operand has 347 states, 294 states have (on average 1.5136054421768708) internal successors, (445), 322 states have internal predecessors, (445), 14 states have call successors, (14), 10 states have call predecessors, (14), 21 states have return successors, (60), 14 states have call predecessors, (60), 14 states have call successors, (60) Second operand 570 states. [2022-02-20 23:37:53,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:37:53,251 INFO L93 Difference]: Finished difference Result 570 states and 775 transitions. [2022-02-20 23:37:53,252 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 775 transitions. [2022-02-20 23:37:53,253 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:37:53,253 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:37:53,254 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:37:53,254 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:37:53,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 347 states, 294 states have (on average 1.5136054421768708) internal successors, (445), 322 states have internal predecessors, (445), 14 states have call successors, (14), 10 states have call predecessors, (14), 21 states have return successors, (60), 14 states have call predecessors, (60), 14 states have call successors, (60) [2022-02-20 23:37:53,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 519 transitions. [2022-02-20 23:37:53,261 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 519 transitions. Word has length 16 [2022-02-20 23:37:53,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:37:53,261 INFO L470 AbstractCegarLoop]: Abstraction has 347 states and 519 transitions. [2022-02-20 23:37:53,262 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 14 states have internal predecessors, (45), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:37:53,262 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 519 transitions. [2022-02-20 23:37:53,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-02-20 23:37:53,262 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:37:53,262 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:37:53,281 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 23:37:53,481 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:37:53,482 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting parse_inputErr10ASSERT_VIOLATIONMEMORY_FREE === [parse_inputErr0REQUIRES_VIOLATION, parse_inputErr1REQUIRES_VIOLATION, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2022-02-20 23:37:53,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:37:53,482 INFO L85 PathProgramCache]: Analyzing trace with hash -1776199670, now seen corresponding path program 1 times [2022-02-20 23:37:53,482 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:37:53,482 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859142553] [2022-02-20 23:37:53,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:37:53,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:37:53,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:37:53,525 INFO L290 TraceCheckUtils]: 0: Hoare triple {9817#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(3, 1);call write~init~int(99, 1, 0, 1);call write~init~int(49, 1, 1, 1);call write~init~int(0, 1, 2, 1);call #Ultimate.allocInit(3, 2);call write~init~int(99, 2, 0, 1);call write~init~int(50, 2, 1, 1);call write~init~int(0, 2, 2, 1);call #Ultimate.allocInit(3, 3);call write~init~int(99, 3, 0, 1);call write~init~int(49, 3, 1, 1);call write~init~int(0, 3, 2, 1);call #Ultimate.allocInit(3, 4);call write~init~int(99, 4, 0, 1);call write~init~int(49, 4, 1, 1);call write~init~int(0, 4, 2, 1);call #Ultimate.allocInit(3, 5);call write~init~int(99, 5, 0, 1);call write~init~int(50, 5, 1, 1);call write~init~int(0, 5, 2, 1);~state~0 := ~unnamed3~0~STATE_1;~global~0.base, ~global~0.offset := 0, 0;~#commands~0.base, ~#commands~0.offset := 6, 0;call #Ultimate.allocInit(18, 6);call write~init~$Pointer$(1, 0, ~#commands~0.base, ~#commands~0.offset, 4);call write~init~$Pointer$(#funAddr~c1.base, #funAddr~c1.offset, ~#commands~0.base, 4 + ~#commands~0.offset, 4);call write~init~int((if ~unnamed3~0~STATE_1 % 256 <= 127 then ~unnamed3~0~STATE_1 % 256 else ~unnamed3~0~STATE_1 % 256 - 256), ~#commands~0.base, 8 + ~#commands~0.offset, 1);call write~init~$Pointer$(2, 0, ~#commands~0.base, 9 + ~#commands~0.offset, 4);call write~init~$Pointer$(#funAddr~c2.base, #funAddr~c2.offset, ~#commands~0.base, 13 + ~#commands~0.offset, 4);call write~init~int((if ~unnamed3~0~STATE_2 % 256 <= 127 then ~unnamed3~0~STATE_2 % 256 else ~unnamed3~0~STATE_2 % 256 - 256), ~#commands~0.base, 17 + ~#commands~0.offset, 1); {9819#(and (= ~global~0.base 0) (= ~global~0.offset 0))} is VALID [2022-02-20 23:37:53,526 INFO L290 TraceCheckUtils]: 1: Hoare triple {9819#(and (= ~global~0.base 0) (= ~global~0.offset 0))} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1; {9819#(and (= ~global~0.base 0) (= ~global~0.offset 0))} is VALID [2022-02-20 23:37:53,526 INFO L272 TraceCheckUtils]: 2: Hoare triple {9819#(and (= ~global~0.base 0) (= ~global~0.offset 0))} call parse_input(3, 0); {9819#(and (= ~global~0.base 0) (= ~global~0.offset 0))} is VALID [2022-02-20 23:37:53,527 INFO L290 TraceCheckUtils]: 3: Hoare triple {9819#(and (= ~global~0.base 0) (= ~global~0.offset 0))} ~input#1.base, ~input#1.offset := #in~input#1.base, #in~input#1.offset;~i~0#1 := 0; {9819#(and (= ~global~0.base 0) (= ~global~0.offset 0))} is VALID [2022-02-20 23:37:53,527 INFO L290 TraceCheckUtils]: 4: Hoare triple {9819#(and (= ~global~0.base 0) (= ~global~0.offset 0))} assume !!(~i~0#1 < 2); {9819#(and (= ~global~0.base 0) (= ~global~0.offset 0))} is VALID [2022-02-20 23:37:53,527 INFO L290 TraceCheckUtils]: 5: Hoare triple {9819#(and (= ~global~0.base 0) (= ~global~0.offset 0))} SUMMARY for call #t~mem3#1.base, #t~mem3#1.offset := read~$Pointer$(~#commands~0.base, ~#commands~0.offset + 9 * ~i~0#1, 4); srcloc: L693 {9819#(and (= ~global~0.base 0) (= ~global~0.offset 0))} is VALID [2022-02-20 23:37:53,528 INFO L290 TraceCheckUtils]: 6: Hoare triple {9819#(and (= ~global~0.base 0) (= ~global~0.offset 0))} assume 1 == #valid[#t~mem3#1.base]; {9819#(and (= ~global~0.base 0) (= ~global~0.offset 0))} is VALID [2022-02-20 23:37:53,528 INFO L290 TraceCheckUtils]: 7: Hoare triple {9819#(and (= ~global~0.base 0) (= ~global~0.offset 0))} assume #t~mem3#1.offset < #length[#t~mem3#1.base] && #t~mem3#1.offset >= 0; {9819#(and (= ~global~0.base 0) (= ~global~0.offset 0))} is VALID [2022-02-20 23:37:53,528 INFO L290 TraceCheckUtils]: 8: Hoare triple {9819#(and (= ~global~0.base 0) (= ~global~0.offset 0))} assume 1 == #valid[~input#1.base]; {9819#(and (= ~global~0.base 0) (= ~global~0.offset 0))} is VALID [2022-02-20 23:37:53,529 INFO L290 TraceCheckUtils]: 9: Hoare triple {9819#(and (= ~global~0.base 0) (= ~global~0.offset 0))} assume ~input#1.offset < #length[~input#1.base] && ~input#1.offset >= 0; {9819#(and (= ~global~0.base 0) (= ~global~0.offset 0))} is VALID [2022-02-20 23:37:53,529 INFO L290 TraceCheckUtils]: 10: Hoare triple {9819#(and (= ~global~0.base 0) (= ~global~0.offset 0))} assume 0 == #t~nondet4#1;havoc #t~mem3#1.base, #t~mem3#1.offset;havoc #t~nondet4#1; {9819#(and (= ~global~0.base 0) (= ~global~0.offset 0))} is VALID [2022-02-20 23:37:53,530 INFO L290 TraceCheckUtils]: 11: Hoare triple {9819#(and (= ~global~0.base 0) (= ~global~0.offset 0))} SUMMARY for call #t~mem5#1 := read~int(~#commands~0.base, 8 + (~#commands~0.offset + 9 * ~i~0#1), 1); srcloc: L694 {9819#(and (= ~global~0.base 0) (= ~global~0.offset 0))} is VALID [2022-02-20 23:37:53,530 INFO L290 TraceCheckUtils]: 12: Hoare triple {9819#(and (= ~global~0.base 0) (= ~global~0.offset 0))} assume ~state~0 >= #t~mem5#1;havoc #t~mem5#1; {9819#(and (= ~global~0.base 0) (= ~global~0.offset 0))} is VALID [2022-02-20 23:37:53,530 INFO L290 TraceCheckUtils]: 13: Hoare triple {9819#(and (= ~global~0.base 0) (= ~global~0.offset 0))} SUMMARY for call #t~mem6#1.base, #t~mem6#1.offset := read~$Pointer$(~#commands~0.base, 4 + (~#commands~0.offset + 9 * ~i~0#1), 4); srcloc: L695 {9819#(and (= ~global~0.base 0) (= ~global~0.offset 0))} is VALID [2022-02-20 23:37:53,531 INFO L290 TraceCheckUtils]: 14: Hoare triple {9819#(and (= ~global~0.base 0) (= ~global~0.offset 0))} assume { :begin_inline_##fun~~TO~VOID } true;##fun~~TO~VOID_#in~#fp#1.base, ##fun~~TO~VOID_#in~#fp#1.offset := #t~mem6#1.base, #t~mem6#1.offset; {9819#(and (= ~global~0.base 0) (= ~global~0.offset 0))} is VALID [2022-02-20 23:37:53,531 INFO L290 TraceCheckUtils]: 15: Hoare triple {9819#(and (= ~global~0.base 0) (= ~global~0.offset 0))} assume ##fun~~TO~VOID_#in~#fp#1.base == #funAddr~c2.base && ##fun~~TO~VOID_#in~#fp#1.offset == #funAddr~c2.offset;assume { :begin_inline_c2 } true;havoc c2_~y~0#1.base, c2_~y~0#1.offset;c2_~y~0#1.base, c2_~y~0#1.offset := 0, 0; {9819#(and (= ~global~0.base 0) (= ~global~0.offset 0))} is VALID [2022-02-20 23:37:53,531 INFO L290 TraceCheckUtils]: 16: Hoare triple {9819#(and (= ~global~0.base 0) (= ~global~0.offset 0))} assume !((c2_~y~0#1.base == 0 && c2_~y~0#1.offset == 0) || (~global~0.base == 0 && ~global~0.offset == 0)); {9818#false} is VALID [2022-02-20 23:37:53,532 INFO L290 TraceCheckUtils]: 17: Hoare triple {9818#false} assume !(0 == c2_~y~0#1.offset); {9818#false} is VALID [2022-02-20 23:37:53,532 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 23:37:53,533 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:37:53,533 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859142553] [2022-02-20 23:37:53,533 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [859142553] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:37:53,533 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:37:53,533 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:37:53,533 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702909629] [2022-02-20 23:37:53,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:37:53,533 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-02-20 23:37:53,533 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:37:53,533 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:37:53,545 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:37:53,545 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:37:53,545 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:37:53,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:37:53,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:37:53,545 INFO L87 Difference]: Start difference. First operand 347 states and 519 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:37:53,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:37:53,616 INFO L93 Difference]: Finished difference Result 356 states and 501 transitions. [2022-02-20 23:37:53,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:37:53,617 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-02-20 23:37:53,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:37:53,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:37:53,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 109 transitions. [2022-02-20 23:37:53,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:37:53,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 109 transitions. [2022-02-20 23:37:53,619 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 109 transitions. [2022-02-20 23:37:53,683 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 109 edges. 109 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:37:53,689 INFO L225 Difference]: With dead ends: 356 [2022-02-20 23:37:53,689 INFO L226 Difference]: Without dead ends: 356 [2022-02-20 23:37:53,689 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 23:37:53,690 INFO L933 BasicCegarLoop]: 67 mSDtfsCounter, 26 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:37:53,691 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [26 Valid, 114 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:37:53,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2022-02-20 23:37:53,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 343. [2022-02-20 23:37:53,697 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:37:53,697 INFO L82 GeneralOperation]: Start isEquivalent. First operand 356 states. Second operand has 343 states, 296 states have (on average 1.5067567567567568) internal successors, (446), 323 states have internal predecessors, (446), 11 states have call successors, (11), 8 states have call predecessors, (11), 18 states have return successors, (38), 11 states have call predecessors, (38), 11 states have call successors, (38) [2022-02-20 23:37:53,699 INFO L74 IsIncluded]: Start isIncluded. First operand 356 states. Second operand has 343 states, 296 states have (on average 1.5067567567567568) internal successors, (446), 323 states have internal predecessors, (446), 11 states have call successors, (11), 8 states have call predecessors, (11), 18 states have return successors, (38), 11 states have call predecessors, (38), 11 states have call successors, (38) [2022-02-20 23:37:53,699 INFO L87 Difference]: Start difference. First operand 356 states. Second operand has 343 states, 296 states have (on average 1.5067567567567568) internal successors, (446), 323 states have internal predecessors, (446), 11 states have call successors, (11), 8 states have call predecessors, (11), 18 states have return successors, (38), 11 states have call predecessors, (38), 11 states have call successors, (38) [2022-02-20 23:37:53,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:37:53,709 INFO L93 Difference]: Finished difference Result 356 states and 501 transitions. [2022-02-20 23:37:53,709 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 501 transitions. [2022-02-20 23:37:53,710 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:37:53,710 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:37:53,711 INFO L74 IsIncluded]: Start isIncluded. First operand has 343 states, 296 states have (on average 1.5067567567567568) internal successors, (446), 323 states have internal predecessors, (446), 11 states have call successors, (11), 8 states have call predecessors, (11), 18 states have return successors, (38), 11 states have call predecessors, (38), 11 states have call successors, (38) Second operand 356 states. [2022-02-20 23:37:53,711 INFO L87 Difference]: Start difference. First operand has 343 states, 296 states have (on average 1.5067567567567568) internal successors, (446), 323 states have internal predecessors, (446), 11 states have call successors, (11), 8 states have call predecessors, (11), 18 states have return successors, (38), 11 states have call predecessors, (38), 11 states have call successors, (38) Second operand 356 states. [2022-02-20 23:37:53,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:37:53,720 INFO L93 Difference]: Finished difference Result 356 states and 501 transitions. [2022-02-20 23:37:53,720 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 501 transitions. [2022-02-20 23:37:53,721 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:37:53,721 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:37:53,721 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:37:53,721 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:37:53,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 343 states, 296 states have (on average 1.5067567567567568) internal successors, (446), 323 states have internal predecessors, (446), 11 states have call successors, (11), 8 states have call predecessors, (11), 18 states have return successors, (38), 11 states have call predecessors, (38), 11 states have call successors, (38) [2022-02-20 23:37:53,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 495 transitions. [2022-02-20 23:37:53,730 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 495 transitions. Word has length 18 [2022-02-20 23:37:53,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:37:53,731 INFO L470 AbstractCegarLoop]: Abstraction has 343 states and 495 transitions. [2022-02-20 23:37:53,731 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:37:53,731 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 495 transitions. [2022-02-20 23:37:53,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-02-20 23:37:53,731 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:37:53,731 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:37:53,732 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-02-20 23:37:53,732 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting parse_inputErr1REQUIRES_VIOLATION === [parse_inputErr0REQUIRES_VIOLATION, parse_inputErr1REQUIRES_VIOLATION, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2022-02-20 23:37:53,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:37:53,732 INFO L85 PathProgramCache]: Analyzing trace with hash 382694474, now seen corresponding path program 1 times [2022-02-20 23:37:53,732 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:37:53,732 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371024732] [2022-02-20 23:37:53,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:37:53,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:37:53,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:37:53,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 23:37:53,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:37:53,792 INFO L290 TraceCheckUtils]: 0: Hoare triple {11253#(and (= ~global~0.base |old(~global~0.base)|) (= |old(#length)| |#length|) (= |old(~global~0.offset)| ~global~0.offset) (= ~state~0 |old(~state~0)|) (= |old(#valid)| |#valid|))} ~input#1.base, ~input#1.offset := #in~input#1.base, #in~input#1.offset;~i~0#1 := 0; {11233#true} is VALID [2022-02-20 23:37:53,792 INFO L290 TraceCheckUtils]: 1: Hoare triple {11233#true} assume !!(~i~0#1 < 2); {11233#true} is VALID [2022-02-20 23:37:53,792 INFO L290 TraceCheckUtils]: 2: Hoare triple {11233#true} SUMMARY for call #t~mem3#1.base, #t~mem3#1.offset := read~$Pointer$(~#commands~0.base, ~#commands~0.offset + 9 * ~i~0#1, 4); srcloc: L693 {11233#true} is VALID [2022-02-20 23:37:53,793 INFO L290 TraceCheckUtils]: 3: Hoare triple {11233#true} assume 1 == #valid[#t~mem3#1.base]; {11233#true} is VALID [2022-02-20 23:37:53,793 INFO L290 TraceCheckUtils]: 4: Hoare triple {11233#true} assume #t~mem3#1.offset < #length[#t~mem3#1.base] && #t~mem3#1.offset >= 0; {11233#true} is VALID [2022-02-20 23:37:53,795 INFO L290 TraceCheckUtils]: 5: Hoare triple {11233#true} assume 1 == #valid[~input#1.base]; {11233#true} is VALID [2022-02-20 23:37:53,796 INFO L290 TraceCheckUtils]: 6: Hoare triple {11233#true} assume ~input#1.offset < #length[~input#1.base] && ~input#1.offset >= 0; {11233#true} is VALID [2022-02-20 23:37:53,796 INFO L290 TraceCheckUtils]: 7: Hoare triple {11233#true} assume 0 == #t~nondet4#1;havoc #t~mem3#1.base, #t~mem3#1.offset;havoc #t~nondet4#1; {11233#true} is VALID [2022-02-20 23:37:53,796 INFO L290 TraceCheckUtils]: 8: Hoare triple {11233#true} SUMMARY for call #t~mem5#1 := read~int(~#commands~0.base, 8 + (~#commands~0.offset + 9 * ~i~0#1), 1); srcloc: L694 {11233#true} is VALID [2022-02-20 23:37:53,796 INFO L290 TraceCheckUtils]: 9: Hoare triple {11233#true} assume ~state~0 >= #t~mem5#1;havoc #t~mem5#1; {11233#true} is VALID [2022-02-20 23:37:53,796 INFO L290 TraceCheckUtils]: 10: Hoare triple {11233#true} SUMMARY for call #t~mem6#1.base, #t~mem6#1.offset := read~$Pointer$(~#commands~0.base, 4 + (~#commands~0.offset + 9 * ~i~0#1), 4); srcloc: L695 {11233#true} is VALID [2022-02-20 23:37:53,796 INFO L290 TraceCheckUtils]: 11: Hoare triple {11233#true} assume { :begin_inline_##fun~~TO~VOID } true;##fun~~TO~VOID_#in~#fp#1.base, ##fun~~TO~VOID_#in~#fp#1.offset := #t~mem6#1.base, #t~mem6#1.offset; {11233#true} is VALID [2022-02-20 23:37:53,797 INFO L290 TraceCheckUtils]: 12: Hoare triple {11233#true} assume !(##fun~~TO~VOID_#in~#fp#1.base == #funAddr~c2.base && ##fun~~TO~VOID_#in~#fp#1.offset == #funAddr~c2.offset);assume { :begin_inline_c1 } true;havoc c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset, c1_~x~0#1.base, c1_~x~0#1.offset;call c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset := #Ultimate.allocOnHeap(1);c1_~x~0#1.base, c1_~x~0#1.offset := c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset;havoc c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset; {11254#(not (= |parse_input_c1_~x~0#1.base| 0))} is VALID [2022-02-20 23:37:53,797 INFO L290 TraceCheckUtils]: 13: Hoare triple {11254#(not (= |parse_input_c1_~x~0#1.base| 0))} assume c1_~x~0#1.base == 0 && c1_~x~0#1.offset == 0; {11234#false} is VALID [2022-02-20 23:37:53,797 INFO L290 TraceCheckUtils]: 14: Hoare triple {11234#false} assume { :end_inline_c1 } true; {11234#false} is VALID [2022-02-20 23:37:53,797 INFO L290 TraceCheckUtils]: 15: Hoare triple {11234#false} assume { :end_inline_##fun~~TO~VOID } true;havoc #t~mem6#1.base, #t~mem6#1.offset; {11234#false} is VALID [2022-02-20 23:37:53,797 INFO L290 TraceCheckUtils]: 16: Hoare triple {11234#false} assume true; {11234#false} is VALID [2022-02-20 23:37:53,798 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {11234#false} {11233#true} #101#return; {11234#false} is VALID [2022-02-20 23:37:53,798 INFO L290 TraceCheckUtils]: 0: Hoare triple {11233#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(3, 1);call write~init~int(99, 1, 0, 1);call write~init~int(49, 1, 1, 1);call write~init~int(0, 1, 2, 1);call #Ultimate.allocInit(3, 2);call write~init~int(99, 2, 0, 1);call write~init~int(50, 2, 1, 1);call write~init~int(0, 2, 2, 1);call #Ultimate.allocInit(3, 3);call write~init~int(99, 3, 0, 1);call write~init~int(49, 3, 1, 1);call write~init~int(0, 3, 2, 1);call #Ultimate.allocInit(3, 4);call write~init~int(99, 4, 0, 1);call write~init~int(49, 4, 1, 1);call write~init~int(0, 4, 2, 1);call #Ultimate.allocInit(3, 5);call write~init~int(99, 5, 0, 1);call write~init~int(50, 5, 1, 1);call write~init~int(0, 5, 2, 1);~state~0 := ~unnamed3~0~STATE_1;~global~0.base, ~global~0.offset := 0, 0;~#commands~0.base, ~#commands~0.offset := 6, 0;call #Ultimate.allocInit(18, 6);call write~init~$Pointer$(1, 0, ~#commands~0.base, ~#commands~0.offset, 4);call write~init~$Pointer$(#funAddr~c1.base, #funAddr~c1.offset, ~#commands~0.base, 4 + ~#commands~0.offset, 4);call write~init~int((if ~unnamed3~0~STATE_1 % 256 <= 127 then ~unnamed3~0~STATE_1 % 256 else ~unnamed3~0~STATE_1 % 256 - 256), ~#commands~0.base, 8 + ~#commands~0.offset, 1);call write~init~$Pointer$(2, 0, ~#commands~0.base, 9 + ~#commands~0.offset, 4);call write~init~$Pointer$(#funAddr~c2.base, #funAddr~c2.offset, ~#commands~0.base, 13 + ~#commands~0.offset, 4);call write~init~int((if ~unnamed3~0~STATE_2 % 256 <= 127 then ~unnamed3~0~STATE_2 % 256 else ~unnamed3~0~STATE_2 % 256 - 256), ~#commands~0.base, 17 + ~#commands~0.offset, 1); {11233#true} is VALID [2022-02-20 23:37:53,798 INFO L290 TraceCheckUtils]: 1: Hoare triple {11233#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1; {11233#true} is VALID [2022-02-20 23:37:53,799 INFO L272 TraceCheckUtils]: 2: Hoare triple {11233#true} call parse_input(3, 0); {11253#(and (= ~global~0.base |old(~global~0.base)|) (= |old(#length)| |#length|) (= |old(~global~0.offset)| ~global~0.offset) (= ~state~0 |old(~state~0)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 23:37:53,799 INFO L290 TraceCheckUtils]: 3: Hoare triple {11253#(and (= ~global~0.base |old(~global~0.base)|) (= |old(#length)| |#length|) (= |old(~global~0.offset)| ~global~0.offset) (= ~state~0 |old(~state~0)|) (= |old(#valid)| |#valid|))} ~input#1.base, ~input#1.offset := #in~input#1.base, #in~input#1.offset;~i~0#1 := 0; {11233#true} is VALID [2022-02-20 23:37:53,799 INFO L290 TraceCheckUtils]: 4: Hoare triple {11233#true} assume !!(~i~0#1 < 2); {11233#true} is VALID [2022-02-20 23:37:53,799 INFO L290 TraceCheckUtils]: 5: Hoare triple {11233#true} SUMMARY for call #t~mem3#1.base, #t~mem3#1.offset := read~$Pointer$(~#commands~0.base, ~#commands~0.offset + 9 * ~i~0#1, 4); srcloc: L693 {11233#true} is VALID [2022-02-20 23:37:53,799 INFO L290 TraceCheckUtils]: 6: Hoare triple {11233#true} assume 1 == #valid[#t~mem3#1.base]; {11233#true} is VALID [2022-02-20 23:37:53,799 INFO L290 TraceCheckUtils]: 7: Hoare triple {11233#true} assume #t~mem3#1.offset < #length[#t~mem3#1.base] && #t~mem3#1.offset >= 0; {11233#true} is VALID [2022-02-20 23:37:53,799 INFO L290 TraceCheckUtils]: 8: Hoare triple {11233#true} assume 1 == #valid[~input#1.base]; {11233#true} is VALID [2022-02-20 23:37:53,799 INFO L290 TraceCheckUtils]: 9: Hoare triple {11233#true} assume ~input#1.offset < #length[~input#1.base] && ~input#1.offset >= 0; {11233#true} is VALID [2022-02-20 23:37:53,799 INFO L290 TraceCheckUtils]: 10: Hoare triple {11233#true} assume 0 == #t~nondet4#1;havoc #t~mem3#1.base, #t~mem3#1.offset;havoc #t~nondet4#1; {11233#true} is VALID [2022-02-20 23:37:53,799 INFO L290 TraceCheckUtils]: 11: Hoare triple {11233#true} SUMMARY for call #t~mem5#1 := read~int(~#commands~0.base, 8 + (~#commands~0.offset + 9 * ~i~0#1), 1); srcloc: L694 {11233#true} is VALID [2022-02-20 23:37:53,799 INFO L290 TraceCheckUtils]: 12: Hoare triple {11233#true} assume ~state~0 >= #t~mem5#1;havoc #t~mem5#1; {11233#true} is VALID [2022-02-20 23:37:53,800 INFO L290 TraceCheckUtils]: 13: Hoare triple {11233#true} SUMMARY for call #t~mem6#1.base, #t~mem6#1.offset := read~$Pointer$(~#commands~0.base, 4 + (~#commands~0.offset + 9 * ~i~0#1), 4); srcloc: L695 {11233#true} is VALID [2022-02-20 23:37:53,800 INFO L290 TraceCheckUtils]: 14: Hoare triple {11233#true} assume { :begin_inline_##fun~~TO~VOID } true;##fun~~TO~VOID_#in~#fp#1.base, ##fun~~TO~VOID_#in~#fp#1.offset := #t~mem6#1.base, #t~mem6#1.offset; {11233#true} is VALID [2022-02-20 23:37:53,800 INFO L290 TraceCheckUtils]: 15: Hoare triple {11233#true} assume !(##fun~~TO~VOID_#in~#fp#1.base == #funAddr~c2.base && ##fun~~TO~VOID_#in~#fp#1.offset == #funAddr~c2.offset);assume { :begin_inline_c1 } true;havoc c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset, c1_~x~0#1.base, c1_~x~0#1.offset;call c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset := #Ultimate.allocOnHeap(1);c1_~x~0#1.base, c1_~x~0#1.offset := c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset;havoc c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset; {11254#(not (= |parse_input_c1_~x~0#1.base| 0))} is VALID [2022-02-20 23:37:53,801 INFO L290 TraceCheckUtils]: 16: Hoare triple {11254#(not (= |parse_input_c1_~x~0#1.base| 0))} assume c1_~x~0#1.base == 0 && c1_~x~0#1.offset == 0; {11234#false} is VALID [2022-02-20 23:37:53,801 INFO L290 TraceCheckUtils]: 17: Hoare triple {11234#false} assume { :end_inline_c1 } true; {11234#false} is VALID [2022-02-20 23:37:53,801 INFO L290 TraceCheckUtils]: 18: Hoare triple {11234#false} assume { :end_inline_##fun~~TO~VOID } true;havoc #t~mem6#1.base, #t~mem6#1.offset; {11234#false} is VALID [2022-02-20 23:37:53,801 INFO L290 TraceCheckUtils]: 19: Hoare triple {11234#false} assume true; {11234#false} is VALID [2022-02-20 23:37:53,801 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {11234#false} {11233#true} #101#return; {11234#false} is VALID [2022-02-20 23:37:53,801 INFO L272 TraceCheckUtils]: 21: Hoare triple {11234#false} call parse_input(4, 0); {11234#false} is VALID [2022-02-20 23:37:53,801 INFO L290 TraceCheckUtils]: 22: Hoare triple {11234#false} ~input#1.base, ~input#1.offset := #in~input#1.base, #in~input#1.offset;~i~0#1 := 0; {11234#false} is VALID [2022-02-20 23:37:53,801 INFO L290 TraceCheckUtils]: 23: Hoare triple {11234#false} assume !!(~i~0#1 < 2); {11234#false} is VALID [2022-02-20 23:37:53,801 INFO L290 TraceCheckUtils]: 24: Hoare triple {11234#false} assume !(4 + (~#commands~0.offset + 9 * ~i~0#1) <= #length[~#commands~0.base] && 0 <= ~#commands~0.offset + 9 * ~i~0#1); {11234#false} is VALID [2022-02-20 23:37:53,801 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:37:53,802 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:37:53,802 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371024732] [2022-02-20 23:37:53,802 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1371024732] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:37:53,802 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:37:53,802 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 23:37:53,802 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880555571] [2022-02-20 23:37:53,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:37:53,802 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-02-20 23:37:53,803 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:37:53,803 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:37:53,816 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:37:53,816 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 23:37:53,816 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:37:53,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 23:37:53,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 23:37:53,816 INFO L87 Difference]: Start difference. First operand 343 states and 495 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:37:53,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:37:53,955 INFO L93 Difference]: Finished difference Result 263 states and 368 transitions. [2022-02-20 23:37:53,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 23:37:53,955 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-02-20 23:37:53,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:37:53,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:37:53,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 75 transitions. [2022-02-20 23:37:53,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:37:53,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 75 transitions. [2022-02-20 23:37:53,956 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 75 transitions. [2022-02-20 23:37:54,006 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 23:37:54,010 INFO L225 Difference]: With dead ends: 263 [2022-02-20 23:37:54,010 INFO L226 Difference]: Without dead ends: 263 [2022-02-20 23:37:54,010 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 23:37:54,011 INFO L933 BasicCegarLoop]: 45 mSDtfsCounter, 48 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:37:54,011 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [48 Valid, 87 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:37:54,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2022-02-20 23:37:54,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 263. [2022-02-20 23:37:54,014 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:37:54,015 INFO L82 GeneralOperation]: Start isEquivalent. First operand 263 states. Second operand has 263 states, 224 states have (on average 1.4910714285714286) internal successors, (334), 248 states have internal predecessors, (334), 8 states have call successors, (8), 6 states have call predecessors, (8), 13 states have return successors, (26), 8 states have call predecessors, (26), 8 states have call successors, (26) [2022-02-20 23:37:54,015 INFO L74 IsIncluded]: Start isIncluded. First operand 263 states. Second operand has 263 states, 224 states have (on average 1.4910714285714286) internal successors, (334), 248 states have internal predecessors, (334), 8 states have call successors, (8), 6 states have call predecessors, (8), 13 states have return successors, (26), 8 states have call predecessors, (26), 8 states have call successors, (26) [2022-02-20 23:37:54,015 INFO L87 Difference]: Start difference. First operand 263 states. Second operand has 263 states, 224 states have (on average 1.4910714285714286) internal successors, (334), 248 states have internal predecessors, (334), 8 states have call successors, (8), 6 states have call predecessors, (8), 13 states have return successors, (26), 8 states have call predecessors, (26), 8 states have call successors, (26) [2022-02-20 23:37:54,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:37:54,021 INFO L93 Difference]: Finished difference Result 263 states and 368 transitions. [2022-02-20 23:37:54,021 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 368 transitions. [2022-02-20 23:37:54,021 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:37:54,021 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:37:54,022 INFO L74 IsIncluded]: Start isIncluded. First operand has 263 states, 224 states have (on average 1.4910714285714286) internal successors, (334), 248 states have internal predecessors, (334), 8 states have call successors, (8), 6 states have call predecessors, (8), 13 states have return successors, (26), 8 states have call predecessors, (26), 8 states have call successors, (26) Second operand 263 states. [2022-02-20 23:37:54,022 INFO L87 Difference]: Start difference. First operand has 263 states, 224 states have (on average 1.4910714285714286) internal successors, (334), 248 states have internal predecessors, (334), 8 states have call successors, (8), 6 states have call predecessors, (8), 13 states have return successors, (26), 8 states have call predecessors, (26), 8 states have call successors, (26) Second operand 263 states. [2022-02-20 23:37:54,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:37:54,026 INFO L93 Difference]: Finished difference Result 263 states and 368 transitions. [2022-02-20 23:37:54,026 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 368 transitions. [2022-02-20 23:37:54,027 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:37:54,027 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:37:54,027 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:37:54,027 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:37:54,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 224 states have (on average 1.4910714285714286) internal successors, (334), 248 states have internal predecessors, (334), 8 states have call successors, (8), 6 states have call predecessors, (8), 13 states have return successors, (26), 8 states have call predecessors, (26), 8 states have call successors, (26) [2022-02-20 23:37:54,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 368 transitions. [2022-02-20 23:37:54,031 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 368 transitions. Word has length 25 [2022-02-20 23:37:54,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:37:54,032 INFO L470 AbstractCegarLoop]: Abstraction has 263 states and 368 transitions. [2022-02-20 23:37:54,032 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:37:54,032 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 368 transitions. [2022-02-20 23:37:54,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-02-20 23:37:54,032 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:37:54,032 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:37:54,032 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-02-20 23:37:54,032 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting parse_inputErr1REQUIRES_VIOLATION === [parse_inputErr0REQUIRES_VIOLATION, parse_inputErr1REQUIRES_VIOLATION, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2022-02-20 23:37:54,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:37:54,033 INFO L85 PathProgramCache]: Analyzing trace with hash -1752183410, now seen corresponding path program 1 times [2022-02-20 23:37:54,033 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:37:54,033 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46737631] [2022-02-20 23:37:54,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:37:54,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:37:54,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:37:54,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 23:37:54,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:37:54,203 INFO L290 TraceCheckUtils]: 0: Hoare triple {12334#(and (= ~global~0.base |old(~global~0.base)|) (= |old(#length)| |#length|) (= |old(~global~0.offset)| ~global~0.offset) (= ~state~0 |old(~state~0)|) (= |old(#valid)| |#valid|))} ~input#1.base, ~input#1.offset := #in~input#1.base, #in~input#1.offset;~i~0#1 := 0; {12335#(= (select |#length| 6) (select |old(#length)| 6))} is VALID [2022-02-20 23:37:54,203 INFO L290 TraceCheckUtils]: 1: Hoare triple {12335#(= (select |#length| 6) (select |old(#length)| 6))} assume !!(~i~0#1 < 2); {12335#(= (select |#length| 6) (select |old(#length)| 6))} is VALID [2022-02-20 23:37:54,208 INFO L290 TraceCheckUtils]: 2: Hoare triple {12335#(= (select |#length| 6) (select |old(#length)| 6))} SUMMARY for call #t~mem3#1.base, #t~mem3#1.offset := read~$Pointer$(~#commands~0.base, ~#commands~0.offset + 9 * ~i~0#1, 4); srcloc: L693 {12336#(or (and (= (select |#length| 6) (select |old(#length)| 6)) (= (select |#valid| |~#commands~0.base|) 1)) (not (= 6 |~#commands~0.base|)))} is VALID [2022-02-20 23:37:54,209 INFO L290 TraceCheckUtils]: 3: Hoare triple {12336#(or (and (= (select |#length| 6) (select |old(#length)| 6)) (= (select |#valid| |~#commands~0.base|) 1)) (not (= 6 |~#commands~0.base|)))} assume 1 == #valid[#t~mem3#1.base]; {12336#(or (and (= (select |#length| 6) (select |old(#length)| 6)) (= (select |#valid| |~#commands~0.base|) 1)) (not (= 6 |~#commands~0.base|)))} is VALID [2022-02-20 23:37:54,209 INFO L290 TraceCheckUtils]: 4: Hoare triple {12336#(or (and (= (select |#length| 6) (select |old(#length)| 6)) (= (select |#valid| |~#commands~0.base|) 1)) (not (= 6 |~#commands~0.base|)))} assume #t~mem3#1.offset < #length[#t~mem3#1.base] && #t~mem3#1.offset >= 0; {12336#(or (and (= (select |#length| 6) (select |old(#length)| 6)) (= (select |#valid| |~#commands~0.base|) 1)) (not (= 6 |~#commands~0.base|)))} is VALID [2022-02-20 23:37:54,210 INFO L290 TraceCheckUtils]: 5: Hoare triple {12336#(or (and (= (select |#length| 6) (select |old(#length)| 6)) (= (select |#valid| |~#commands~0.base|) 1)) (not (= 6 |~#commands~0.base|)))} assume 1 == #valid[~input#1.base]; {12336#(or (and (= (select |#length| 6) (select |old(#length)| 6)) (= (select |#valid| |~#commands~0.base|) 1)) (not (= 6 |~#commands~0.base|)))} is VALID [2022-02-20 23:37:54,210 INFO L290 TraceCheckUtils]: 6: Hoare triple {12336#(or (and (= (select |#length| 6) (select |old(#length)| 6)) (= (select |#valid| |~#commands~0.base|) 1)) (not (= 6 |~#commands~0.base|)))} assume ~input#1.offset < #length[~input#1.base] && ~input#1.offset >= 0; {12336#(or (and (= (select |#length| 6) (select |old(#length)| 6)) (= (select |#valid| |~#commands~0.base|) 1)) (not (= 6 |~#commands~0.base|)))} is VALID [2022-02-20 23:37:54,211 INFO L290 TraceCheckUtils]: 7: Hoare triple {12336#(or (and (= (select |#length| 6) (select |old(#length)| 6)) (= (select |#valid| |~#commands~0.base|) 1)) (not (= 6 |~#commands~0.base|)))} assume 0 == #t~nondet4#1;havoc #t~mem3#1.base, #t~mem3#1.offset;havoc #t~nondet4#1; {12336#(or (and (= (select |#length| 6) (select |old(#length)| 6)) (= (select |#valid| |~#commands~0.base|) 1)) (not (= 6 |~#commands~0.base|)))} is VALID [2022-02-20 23:37:54,211 INFO L290 TraceCheckUtils]: 8: Hoare triple {12336#(or (and (= (select |#length| 6) (select |old(#length)| 6)) (= (select |#valid| |~#commands~0.base|) 1)) (not (= 6 |~#commands~0.base|)))} SUMMARY for call #t~mem5#1 := read~int(~#commands~0.base, 8 + (~#commands~0.offset + 9 * ~i~0#1), 1); srcloc: L694 {12336#(or (and (= (select |#length| 6) (select |old(#length)| 6)) (= (select |#valid| |~#commands~0.base|) 1)) (not (= 6 |~#commands~0.base|)))} is VALID [2022-02-20 23:37:54,212 INFO L290 TraceCheckUtils]: 9: Hoare triple {12336#(or (and (= (select |#length| 6) (select |old(#length)| 6)) (= (select |#valid| |~#commands~0.base|) 1)) (not (= 6 |~#commands~0.base|)))} assume ~state~0 >= #t~mem5#1;havoc #t~mem5#1; {12336#(or (and (= (select |#length| 6) (select |old(#length)| 6)) (= (select |#valid| |~#commands~0.base|) 1)) (not (= 6 |~#commands~0.base|)))} is VALID [2022-02-20 23:37:54,212 INFO L290 TraceCheckUtils]: 10: Hoare triple {12336#(or (and (= (select |#length| 6) (select |old(#length)| 6)) (= (select |#valid| |~#commands~0.base|) 1)) (not (= 6 |~#commands~0.base|)))} SUMMARY for call #t~mem6#1.base, #t~mem6#1.offset := read~$Pointer$(~#commands~0.base, 4 + (~#commands~0.offset + 9 * ~i~0#1), 4); srcloc: L695 {12336#(or (and (= (select |#length| 6) (select |old(#length)| 6)) (= (select |#valid| |~#commands~0.base|) 1)) (not (= 6 |~#commands~0.base|)))} is VALID [2022-02-20 23:37:54,213 INFO L290 TraceCheckUtils]: 11: Hoare triple {12336#(or (and (= (select |#length| 6) (select |old(#length)| 6)) (= (select |#valid| |~#commands~0.base|) 1)) (not (= 6 |~#commands~0.base|)))} assume { :begin_inline_##fun~~TO~VOID } true;##fun~~TO~VOID_#in~#fp#1.base, ##fun~~TO~VOID_#in~#fp#1.offset := #t~mem6#1.base, #t~mem6#1.offset; {12336#(or (and (= (select |#length| 6) (select |old(#length)| 6)) (= (select |#valid| |~#commands~0.base|) 1)) (not (= 6 |~#commands~0.base|)))} is VALID [2022-02-20 23:37:54,213 INFO L290 TraceCheckUtils]: 12: Hoare triple {12336#(or (and (= (select |#length| 6) (select |old(#length)| 6)) (= (select |#valid| |~#commands~0.base|) 1)) (not (= 6 |~#commands~0.base|)))} assume !(##fun~~TO~VOID_#in~#fp#1.base == #funAddr~c2.base && ##fun~~TO~VOID_#in~#fp#1.offset == #funAddr~c2.offset);assume { :begin_inline_c1 } true;havoc c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset, c1_~x~0#1.base, c1_~x~0#1.offset;call c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset := #Ultimate.allocOnHeap(1);c1_~x~0#1.base, c1_~x~0#1.offset := c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset;havoc c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset; {12337#(or (and (not (= |parse_input_c1_~x~0#1.base| 6)) (= (select |#length| 6) (select |old(#length)| 6))) (not (= 6 |~#commands~0.base|)))} is VALID [2022-02-20 23:37:54,214 INFO L290 TraceCheckUtils]: 13: Hoare triple {12337#(or (and (not (= |parse_input_c1_~x~0#1.base| 6)) (= (select |#length| 6) (select |old(#length)| 6))) (not (= 6 |~#commands~0.base|)))} assume !(c1_~x~0#1.base == 0 && c1_~x~0#1.offset == 0); {12337#(or (and (not (= |parse_input_c1_~x~0#1.base| 6)) (= (select |#length| 6) (select |old(#length)| 6))) (not (= 6 |~#commands~0.base|)))} is VALID [2022-02-20 23:37:54,214 INFO L290 TraceCheckUtils]: 14: Hoare triple {12337#(or (and (not (= |parse_input_c1_~x~0#1.base| 6)) (= (select |#length| 6) (select |old(#length)| 6))) (not (= 6 |~#commands~0.base|)))} assume !(~global~0.base != 0 || ~global~0.offset != 0); {12337#(or (and (not (= |parse_input_c1_~x~0#1.base| 6)) (= (select |#length| 6) (select |old(#length)| 6))) (not (= 6 |~#commands~0.base|)))} is VALID [2022-02-20 23:37:54,215 INFO L290 TraceCheckUtils]: 15: Hoare triple {12337#(or (and (not (= |parse_input_c1_~x~0#1.base| 6)) (= (select |#length| 6) (select |old(#length)| 6))) (not (= 6 |~#commands~0.base|)))} ~global~0.base, ~global~0.offset := c1_~x~0#1.base, c1_~x~0#1.offset;~state~0 := ~unnamed3~0~STATE_2; {12338#(or (= (select |#length| 6) (select |old(#length)| 6)) (not (= 6 |~#commands~0.base|)))} is VALID [2022-02-20 23:37:54,215 INFO L290 TraceCheckUtils]: 16: Hoare triple {12338#(or (= (select |#length| 6) (select |old(#length)| 6)) (not (= 6 |~#commands~0.base|)))} assume { :end_inline_c1 } true; {12338#(or (= (select |#length| 6) (select |old(#length)| 6)) (not (= 6 |~#commands~0.base|)))} is VALID [2022-02-20 23:37:54,216 INFO L290 TraceCheckUtils]: 17: Hoare triple {12338#(or (= (select |#length| 6) (select |old(#length)| 6)) (not (= 6 |~#commands~0.base|)))} assume { :end_inline_##fun~~TO~VOID } true;havoc #t~mem6#1.base, #t~mem6#1.offset; {12338#(or (= (select |#length| 6) (select |old(#length)| 6)) (not (= 6 |~#commands~0.base|)))} is VALID [2022-02-20 23:37:54,216 INFO L290 TraceCheckUtils]: 18: Hoare triple {12338#(or (= (select |#length| 6) (select |old(#length)| 6)) (not (= 6 |~#commands~0.base|)))} assume true; {12338#(or (= (select |#length| 6) (select |old(#length)| 6)) (not (= 6 |~#commands~0.base|)))} is VALID [2022-02-20 23:37:54,217 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {12338#(or (= (select |#length| 6) (select |old(#length)| 6)) (not (= 6 |~#commands~0.base|)))} {12311#(and (= 6 |~#commands~0.base|) (= (select |#length| 6) 18) (<= 0 |~#commands~0.offset|) (<= |~#commands~0.offset| 0))} #101#return; {12311#(and (= 6 |~#commands~0.base|) (= (select |#length| 6) 18) (<= 0 |~#commands~0.offset|) (<= |~#commands~0.offset| 0))} is VALID [2022-02-20 23:37:54,218 INFO L290 TraceCheckUtils]: 0: Hoare triple {12309#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(3, 1);call write~init~int(99, 1, 0, 1);call write~init~int(49, 1, 1, 1);call write~init~int(0, 1, 2, 1);call #Ultimate.allocInit(3, 2);call write~init~int(99, 2, 0, 1);call write~init~int(50, 2, 1, 1);call write~init~int(0, 2, 2, 1);call #Ultimate.allocInit(3, 3);call write~init~int(99, 3, 0, 1);call write~init~int(49, 3, 1, 1);call write~init~int(0, 3, 2, 1);call #Ultimate.allocInit(3, 4);call write~init~int(99, 4, 0, 1);call write~init~int(49, 4, 1, 1);call write~init~int(0, 4, 2, 1);call #Ultimate.allocInit(3, 5);call write~init~int(99, 5, 0, 1);call write~init~int(50, 5, 1, 1);call write~init~int(0, 5, 2, 1);~state~0 := ~unnamed3~0~STATE_1;~global~0.base, ~global~0.offset := 0, 0;~#commands~0.base, ~#commands~0.offset := 6, 0;call #Ultimate.allocInit(18, 6);call write~init~$Pointer$(1, 0, ~#commands~0.base, ~#commands~0.offset, 4);call write~init~$Pointer$(#funAddr~c1.base, #funAddr~c1.offset, ~#commands~0.base, 4 + ~#commands~0.offset, 4);call write~init~int((if ~unnamed3~0~STATE_1 % 256 <= 127 then ~unnamed3~0~STATE_1 % 256 else ~unnamed3~0~STATE_1 % 256 - 256), ~#commands~0.base, 8 + ~#commands~0.offset, 1);call write~init~$Pointer$(2, 0, ~#commands~0.base, 9 + ~#commands~0.offset, 4);call write~init~$Pointer$(#funAddr~c2.base, #funAddr~c2.offset, ~#commands~0.base, 13 + ~#commands~0.offset, 4);call write~init~int((if ~unnamed3~0~STATE_2 % 256 <= 127 then ~unnamed3~0~STATE_2 % 256 else ~unnamed3~0~STATE_2 % 256 - 256), ~#commands~0.base, 17 + ~#commands~0.offset, 1); {12311#(and (= 6 |~#commands~0.base|) (= (select |#length| 6) 18) (<= 0 |~#commands~0.offset|) (<= |~#commands~0.offset| 0))} is VALID [2022-02-20 23:37:54,218 INFO L290 TraceCheckUtils]: 1: Hoare triple {12311#(and (= 6 |~#commands~0.base|) (= (select |#length| 6) 18) (<= 0 |~#commands~0.offset|) (<= |~#commands~0.offset| 0))} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1; {12311#(and (= 6 |~#commands~0.base|) (= (select |#length| 6) 18) (<= 0 |~#commands~0.offset|) (<= |~#commands~0.offset| 0))} is VALID [2022-02-20 23:37:54,219 INFO L272 TraceCheckUtils]: 2: Hoare triple {12311#(and (= 6 |~#commands~0.base|) (= (select |#length| 6) 18) (<= 0 |~#commands~0.offset|) (<= |~#commands~0.offset| 0))} call parse_input(3, 0); {12334#(and (= ~global~0.base |old(~global~0.base)|) (= |old(#length)| |#length|) (= |old(~global~0.offset)| ~global~0.offset) (= ~state~0 |old(~state~0)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 23:37:54,219 INFO L290 TraceCheckUtils]: 3: Hoare triple {12334#(and (= ~global~0.base |old(~global~0.base)|) (= |old(#length)| |#length|) (= |old(~global~0.offset)| ~global~0.offset) (= ~state~0 |old(~state~0)|) (= |old(#valid)| |#valid|))} ~input#1.base, ~input#1.offset := #in~input#1.base, #in~input#1.offset;~i~0#1 := 0; {12335#(= (select |#length| 6) (select |old(#length)| 6))} is VALID [2022-02-20 23:37:54,220 INFO L290 TraceCheckUtils]: 4: Hoare triple {12335#(= (select |#length| 6) (select |old(#length)| 6))} assume !!(~i~0#1 < 2); {12335#(= (select |#length| 6) (select |old(#length)| 6))} is VALID [2022-02-20 23:37:54,220 INFO L290 TraceCheckUtils]: 5: Hoare triple {12335#(= (select |#length| 6) (select |old(#length)| 6))} SUMMARY for call #t~mem3#1.base, #t~mem3#1.offset := read~$Pointer$(~#commands~0.base, ~#commands~0.offset + 9 * ~i~0#1, 4); srcloc: L693 {12336#(or (and (= (select |#length| 6) (select |old(#length)| 6)) (= (select |#valid| |~#commands~0.base|) 1)) (not (= 6 |~#commands~0.base|)))} is VALID [2022-02-20 23:37:54,221 INFO L290 TraceCheckUtils]: 6: Hoare triple {12336#(or (and (= (select |#length| 6) (select |old(#length)| 6)) (= (select |#valid| |~#commands~0.base|) 1)) (not (= 6 |~#commands~0.base|)))} assume 1 == #valid[#t~mem3#1.base]; {12336#(or (and (= (select |#length| 6) (select |old(#length)| 6)) (= (select |#valid| |~#commands~0.base|) 1)) (not (= 6 |~#commands~0.base|)))} is VALID [2022-02-20 23:37:54,221 INFO L290 TraceCheckUtils]: 7: Hoare triple {12336#(or (and (= (select |#length| 6) (select |old(#length)| 6)) (= (select |#valid| |~#commands~0.base|) 1)) (not (= 6 |~#commands~0.base|)))} assume #t~mem3#1.offset < #length[#t~mem3#1.base] && #t~mem3#1.offset >= 0; {12336#(or (and (= (select |#length| 6) (select |old(#length)| 6)) (= (select |#valid| |~#commands~0.base|) 1)) (not (= 6 |~#commands~0.base|)))} is VALID [2022-02-20 23:37:54,221 INFO L290 TraceCheckUtils]: 8: Hoare triple {12336#(or (and (= (select |#length| 6) (select |old(#length)| 6)) (= (select |#valid| |~#commands~0.base|) 1)) (not (= 6 |~#commands~0.base|)))} assume 1 == #valid[~input#1.base]; {12336#(or (and (= (select |#length| 6) (select |old(#length)| 6)) (= (select |#valid| |~#commands~0.base|) 1)) (not (= 6 |~#commands~0.base|)))} is VALID [2022-02-20 23:37:54,222 INFO L290 TraceCheckUtils]: 9: Hoare triple {12336#(or (and (= (select |#length| 6) (select |old(#length)| 6)) (= (select |#valid| |~#commands~0.base|) 1)) (not (= 6 |~#commands~0.base|)))} assume ~input#1.offset < #length[~input#1.base] && ~input#1.offset >= 0; {12336#(or (and (= (select |#length| 6) (select |old(#length)| 6)) (= (select |#valid| |~#commands~0.base|) 1)) (not (= 6 |~#commands~0.base|)))} is VALID [2022-02-20 23:37:54,222 INFO L290 TraceCheckUtils]: 10: Hoare triple {12336#(or (and (= (select |#length| 6) (select |old(#length)| 6)) (= (select |#valid| |~#commands~0.base|) 1)) (not (= 6 |~#commands~0.base|)))} assume 0 == #t~nondet4#1;havoc #t~mem3#1.base, #t~mem3#1.offset;havoc #t~nondet4#1; {12336#(or (and (= (select |#length| 6) (select |old(#length)| 6)) (= (select |#valid| |~#commands~0.base|) 1)) (not (= 6 |~#commands~0.base|)))} is VALID [2022-02-20 23:37:54,223 INFO L290 TraceCheckUtils]: 11: Hoare triple {12336#(or (and (= (select |#length| 6) (select |old(#length)| 6)) (= (select |#valid| |~#commands~0.base|) 1)) (not (= 6 |~#commands~0.base|)))} SUMMARY for call #t~mem5#1 := read~int(~#commands~0.base, 8 + (~#commands~0.offset + 9 * ~i~0#1), 1); srcloc: L694 {12336#(or (and (= (select |#length| 6) (select |old(#length)| 6)) (= (select |#valid| |~#commands~0.base|) 1)) (not (= 6 |~#commands~0.base|)))} is VALID [2022-02-20 23:37:54,224 INFO L290 TraceCheckUtils]: 12: Hoare triple {12336#(or (and (= (select |#length| 6) (select |old(#length)| 6)) (= (select |#valid| |~#commands~0.base|) 1)) (not (= 6 |~#commands~0.base|)))} assume ~state~0 >= #t~mem5#1;havoc #t~mem5#1; {12336#(or (and (= (select |#length| 6) (select |old(#length)| 6)) (= (select |#valid| |~#commands~0.base|) 1)) (not (= 6 |~#commands~0.base|)))} is VALID [2022-02-20 23:37:54,224 INFO L290 TraceCheckUtils]: 13: Hoare triple {12336#(or (and (= (select |#length| 6) (select |old(#length)| 6)) (= (select |#valid| |~#commands~0.base|) 1)) (not (= 6 |~#commands~0.base|)))} SUMMARY for call #t~mem6#1.base, #t~mem6#1.offset := read~$Pointer$(~#commands~0.base, 4 + (~#commands~0.offset + 9 * ~i~0#1), 4); srcloc: L695 {12336#(or (and (= (select |#length| 6) (select |old(#length)| 6)) (= (select |#valid| |~#commands~0.base|) 1)) (not (= 6 |~#commands~0.base|)))} is VALID [2022-02-20 23:37:54,225 INFO L290 TraceCheckUtils]: 14: Hoare triple {12336#(or (and (= (select |#length| 6) (select |old(#length)| 6)) (= (select |#valid| |~#commands~0.base|) 1)) (not (= 6 |~#commands~0.base|)))} assume { :begin_inline_##fun~~TO~VOID } true;##fun~~TO~VOID_#in~#fp#1.base, ##fun~~TO~VOID_#in~#fp#1.offset := #t~mem6#1.base, #t~mem6#1.offset; {12336#(or (and (= (select |#length| 6) (select |old(#length)| 6)) (= (select |#valid| |~#commands~0.base|) 1)) (not (= 6 |~#commands~0.base|)))} is VALID [2022-02-20 23:37:54,225 INFO L290 TraceCheckUtils]: 15: Hoare triple {12336#(or (and (= (select |#length| 6) (select |old(#length)| 6)) (= (select |#valid| |~#commands~0.base|) 1)) (not (= 6 |~#commands~0.base|)))} assume !(##fun~~TO~VOID_#in~#fp#1.base == #funAddr~c2.base && ##fun~~TO~VOID_#in~#fp#1.offset == #funAddr~c2.offset);assume { :begin_inline_c1 } true;havoc c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset, c1_~x~0#1.base, c1_~x~0#1.offset;call c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset := #Ultimate.allocOnHeap(1);c1_~x~0#1.base, c1_~x~0#1.offset := c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset;havoc c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset; {12337#(or (and (not (= |parse_input_c1_~x~0#1.base| 6)) (= (select |#length| 6) (select |old(#length)| 6))) (not (= 6 |~#commands~0.base|)))} is VALID [2022-02-20 23:37:54,226 INFO L290 TraceCheckUtils]: 16: Hoare triple {12337#(or (and (not (= |parse_input_c1_~x~0#1.base| 6)) (= (select |#length| 6) (select |old(#length)| 6))) (not (= 6 |~#commands~0.base|)))} assume !(c1_~x~0#1.base == 0 && c1_~x~0#1.offset == 0); {12337#(or (and (not (= |parse_input_c1_~x~0#1.base| 6)) (= (select |#length| 6) (select |old(#length)| 6))) (not (= 6 |~#commands~0.base|)))} is VALID [2022-02-20 23:37:54,226 INFO L290 TraceCheckUtils]: 17: Hoare triple {12337#(or (and (not (= |parse_input_c1_~x~0#1.base| 6)) (= (select |#length| 6) (select |old(#length)| 6))) (not (= 6 |~#commands~0.base|)))} assume !(~global~0.base != 0 || ~global~0.offset != 0); {12337#(or (and (not (= |parse_input_c1_~x~0#1.base| 6)) (= (select |#length| 6) (select |old(#length)| 6))) (not (= 6 |~#commands~0.base|)))} is VALID [2022-02-20 23:37:54,227 INFO L290 TraceCheckUtils]: 18: Hoare triple {12337#(or (and (not (= |parse_input_c1_~x~0#1.base| 6)) (= (select |#length| 6) (select |old(#length)| 6))) (not (= 6 |~#commands~0.base|)))} ~global~0.base, ~global~0.offset := c1_~x~0#1.base, c1_~x~0#1.offset;~state~0 := ~unnamed3~0~STATE_2; {12338#(or (= (select |#length| 6) (select |old(#length)| 6)) (not (= 6 |~#commands~0.base|)))} is VALID [2022-02-20 23:37:54,227 INFO L290 TraceCheckUtils]: 19: Hoare triple {12338#(or (= (select |#length| 6) (select |old(#length)| 6)) (not (= 6 |~#commands~0.base|)))} assume { :end_inline_c1 } true; {12338#(or (= (select |#length| 6) (select |old(#length)| 6)) (not (= 6 |~#commands~0.base|)))} is VALID [2022-02-20 23:37:54,228 INFO L290 TraceCheckUtils]: 20: Hoare triple {12338#(or (= (select |#length| 6) (select |old(#length)| 6)) (not (= 6 |~#commands~0.base|)))} assume { :end_inline_##fun~~TO~VOID } true;havoc #t~mem6#1.base, #t~mem6#1.offset; {12338#(or (= (select |#length| 6) (select |old(#length)| 6)) (not (= 6 |~#commands~0.base|)))} is VALID [2022-02-20 23:37:54,228 INFO L290 TraceCheckUtils]: 21: Hoare triple {12338#(or (= (select |#length| 6) (select |old(#length)| 6)) (not (= 6 |~#commands~0.base|)))} assume true; {12338#(or (= (select |#length| 6) (select |old(#length)| 6)) (not (= 6 |~#commands~0.base|)))} is VALID [2022-02-20 23:37:54,229 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {12338#(or (= (select |#length| 6) (select |old(#length)| 6)) (not (= 6 |~#commands~0.base|)))} {12311#(and (= 6 |~#commands~0.base|) (= (select |#length| 6) 18) (<= 0 |~#commands~0.offset|) (<= |~#commands~0.offset| 0))} #101#return; {12311#(and (= 6 |~#commands~0.base|) (= (select |#length| 6) 18) (<= 0 |~#commands~0.offset|) (<= |~#commands~0.offset| 0))} is VALID [2022-02-20 23:37:54,229 INFO L272 TraceCheckUtils]: 23: Hoare triple {12311#(and (= 6 |~#commands~0.base|) (= (select |#length| 6) 18) (<= 0 |~#commands~0.offset|) (<= |~#commands~0.offset| 0))} call parse_input(4, 0); {12332#(and (<= 0 |~#commands~0.offset|) (= 18 (select |#length| |~#commands~0.base|)) (<= |~#commands~0.offset| 0))} is VALID [2022-02-20 23:37:54,230 INFO L290 TraceCheckUtils]: 24: Hoare triple {12332#(and (<= 0 |~#commands~0.offset|) (= 18 (select |#length| |~#commands~0.base|)) (<= |~#commands~0.offset| 0))} ~input#1.base, ~input#1.offset := #in~input#1.base, #in~input#1.offset;~i~0#1 := 0; {12333#(and (<= 0 |~#commands~0.offset|) (= |parse_input_~i~0#1| 0) (= 18 (select |#length| |~#commands~0.base|)) (<= |~#commands~0.offset| 0))} is VALID [2022-02-20 23:37:54,230 INFO L290 TraceCheckUtils]: 25: Hoare triple {12333#(and (<= 0 |~#commands~0.offset|) (= |parse_input_~i~0#1| 0) (= 18 (select |#length| |~#commands~0.base|)) (<= |~#commands~0.offset| 0))} assume !!(~i~0#1 < 2); {12333#(and (<= 0 |~#commands~0.offset|) (= |parse_input_~i~0#1| 0) (= 18 (select |#length| |~#commands~0.base|)) (<= |~#commands~0.offset| 0))} is VALID [2022-02-20 23:37:54,231 INFO L290 TraceCheckUtils]: 26: Hoare triple {12333#(and (<= 0 |~#commands~0.offset|) (= |parse_input_~i~0#1| 0) (= 18 (select |#length| |~#commands~0.base|)) (<= |~#commands~0.offset| 0))} assume !(4 + (~#commands~0.offset + 9 * ~i~0#1) <= #length[~#commands~0.base] && 0 <= ~#commands~0.offset + 9 * ~i~0#1); {12310#false} is VALID [2022-02-20 23:37:54,231 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:37:54,231 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:37:54,231 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46737631] [2022-02-20 23:37:54,231 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [46737631] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 23:37:54,232 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1088684154] [2022-02-20 23:37:54,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:37:54,232 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:37:54,232 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:37:54,233 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 23:37:54,234 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 23:37:54,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:37:54,284 INFO L263 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 19 conjunts are in the unsatisfiable core [2022-02-20 23:37:54,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:37:54,293 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:37:54,781 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:37:54,784 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-02-20 23:37:54,847 INFO L290 TraceCheckUtils]: 0: Hoare triple {12309#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(3, 1);call write~init~int(99, 1, 0, 1);call write~init~int(49, 1, 1, 1);call write~init~int(0, 1, 2, 1);call #Ultimate.allocInit(3, 2);call write~init~int(99, 2, 0, 1);call write~init~int(50, 2, 1, 1);call write~init~int(0, 2, 2, 1);call #Ultimate.allocInit(3, 3);call write~init~int(99, 3, 0, 1);call write~init~int(49, 3, 1, 1);call write~init~int(0, 3, 2, 1);call #Ultimate.allocInit(3, 4);call write~init~int(99, 4, 0, 1);call write~init~int(49, 4, 1, 1);call write~init~int(0, 4, 2, 1);call #Ultimate.allocInit(3, 5);call write~init~int(99, 5, 0, 1);call write~init~int(50, 5, 1, 1);call write~init~int(0, 5, 2, 1);~state~0 := ~unnamed3~0~STATE_1;~global~0.base, ~global~0.offset := 0, 0;~#commands~0.base, ~#commands~0.offset := 6, 0;call #Ultimate.allocInit(18, 6);call write~init~$Pointer$(1, 0, ~#commands~0.base, ~#commands~0.offset, 4);call write~init~$Pointer$(#funAddr~c1.base, #funAddr~c1.offset, ~#commands~0.base, 4 + ~#commands~0.offset, 4);call write~init~int((if ~unnamed3~0~STATE_1 % 256 <= 127 then ~unnamed3~0~STATE_1 % 256 else ~unnamed3~0~STATE_1 % 256 - 256), ~#commands~0.base, 8 + ~#commands~0.offset, 1);call write~init~$Pointer$(2, 0, ~#commands~0.base, 9 + ~#commands~0.offset, 4);call write~init~$Pointer$(#funAddr~c2.base, #funAddr~c2.offset, ~#commands~0.base, 13 + ~#commands~0.offset, 4);call write~init~int((if ~unnamed3~0~STATE_2 % 256 <= 127 then ~unnamed3~0~STATE_2 % 256 else ~unnamed3~0~STATE_2 % 256 - 256), ~#commands~0.base, 17 + ~#commands~0.offset, 1); {12342#(and (= 6 |~#commands~0.base|) (<= 18 (select |#length| 6)) (= |~#commands~0.offset| 0) (= (select |#valid| 6) 1))} is VALID [2022-02-20 23:37:54,847 INFO L290 TraceCheckUtils]: 1: Hoare triple {12342#(and (= 6 |~#commands~0.base|) (<= 18 (select |#length| 6)) (= |~#commands~0.offset| 0) (= (select |#valid| 6) 1))} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1; {12342#(and (= 6 |~#commands~0.base|) (<= 18 (select |#length| 6)) (= |~#commands~0.offset| 0) (= (select |#valid| 6) 1))} is VALID [2022-02-20 23:37:54,848 INFO L272 TraceCheckUtils]: 2: Hoare triple {12342#(and (= 6 |~#commands~0.base|) (<= 18 (select |#length| 6)) (= |~#commands~0.offset| 0) (= (select |#valid| 6) 1))} call parse_input(3, 0); {12349#(and (= |old(#length)| |#length|) (= 6 |~#commands~0.base|) (= |~#commands~0.offset| 0) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 23:37:54,848 INFO L290 TraceCheckUtils]: 3: Hoare triple {12349#(and (= |old(#length)| |#length|) (= 6 |~#commands~0.base|) (= |~#commands~0.offset| 0) (= |old(#valid)| |#valid|))} ~input#1.base, ~input#1.offset := #in~input#1.base, #in~input#1.offset;~i~0#1 := 0; {12349#(and (= |old(#length)| |#length|) (= 6 |~#commands~0.base|) (= |~#commands~0.offset| 0) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 23:37:54,849 INFO L290 TraceCheckUtils]: 4: Hoare triple {12349#(and (= |old(#length)| |#length|) (= 6 |~#commands~0.base|) (= |~#commands~0.offset| 0) (= |old(#valid)| |#valid|))} assume !!(~i~0#1 < 2); {12349#(and (= |old(#length)| |#length|) (= 6 |~#commands~0.base|) (= |~#commands~0.offset| 0) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 23:37:54,849 INFO L290 TraceCheckUtils]: 5: Hoare triple {12349#(and (= |old(#length)| |#length|) (= 6 |~#commands~0.base|) (= |~#commands~0.offset| 0) (= |old(#valid)| |#valid|))} SUMMARY for call #t~mem3#1.base, #t~mem3#1.offset := read~$Pointer$(~#commands~0.base, ~#commands~0.offset + 9 * ~i~0#1, 4); srcloc: L693 {12349#(and (= |old(#length)| |#length|) (= 6 |~#commands~0.base|) (= |~#commands~0.offset| 0) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 23:37:54,850 INFO L290 TraceCheckUtils]: 6: Hoare triple {12349#(and (= |old(#length)| |#length|) (= 6 |~#commands~0.base|) (= |~#commands~0.offset| 0) (= |old(#valid)| |#valid|))} assume 1 == #valid[#t~mem3#1.base]; {12349#(and (= |old(#length)| |#length|) (= 6 |~#commands~0.base|) (= |~#commands~0.offset| 0) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 23:37:54,850 INFO L290 TraceCheckUtils]: 7: Hoare triple {12349#(and (= |old(#length)| |#length|) (= 6 |~#commands~0.base|) (= |~#commands~0.offset| 0) (= |old(#valid)| |#valid|))} assume #t~mem3#1.offset < #length[#t~mem3#1.base] && #t~mem3#1.offset >= 0; {12349#(and (= |old(#length)| |#length|) (= 6 |~#commands~0.base|) (= |~#commands~0.offset| 0) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 23:37:54,851 INFO L290 TraceCheckUtils]: 8: Hoare triple {12349#(and (= |old(#length)| |#length|) (= 6 |~#commands~0.base|) (= |~#commands~0.offset| 0) (= |old(#valid)| |#valid|))} assume 1 == #valid[~input#1.base]; {12349#(and (= |old(#length)| |#length|) (= 6 |~#commands~0.base|) (= |~#commands~0.offset| 0) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 23:37:54,851 INFO L290 TraceCheckUtils]: 9: Hoare triple {12349#(and (= |old(#length)| |#length|) (= 6 |~#commands~0.base|) (= |~#commands~0.offset| 0) (= |old(#valid)| |#valid|))} assume ~input#1.offset < #length[~input#1.base] && ~input#1.offset >= 0; {12349#(and (= |old(#length)| |#length|) (= 6 |~#commands~0.base|) (= |~#commands~0.offset| 0) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 23:37:54,851 INFO L290 TraceCheckUtils]: 10: Hoare triple {12349#(and (= |old(#length)| |#length|) (= 6 |~#commands~0.base|) (= |~#commands~0.offset| 0) (= |old(#valid)| |#valid|))} assume 0 == #t~nondet4#1;havoc #t~mem3#1.base, #t~mem3#1.offset;havoc #t~nondet4#1; {12349#(and (= |old(#length)| |#length|) (= 6 |~#commands~0.base|) (= |~#commands~0.offset| 0) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 23:37:54,852 INFO L290 TraceCheckUtils]: 11: Hoare triple {12349#(and (= |old(#length)| |#length|) (= 6 |~#commands~0.base|) (= |~#commands~0.offset| 0) (= |old(#valid)| |#valid|))} SUMMARY for call #t~mem5#1 := read~int(~#commands~0.base, 8 + (~#commands~0.offset + 9 * ~i~0#1), 1); srcloc: L694 {12349#(and (= |old(#length)| |#length|) (= 6 |~#commands~0.base|) (= |~#commands~0.offset| 0) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 23:37:54,852 INFO L290 TraceCheckUtils]: 12: Hoare triple {12349#(and (= |old(#length)| |#length|) (= 6 |~#commands~0.base|) (= |~#commands~0.offset| 0) (= |old(#valid)| |#valid|))} assume ~state~0 >= #t~mem5#1;havoc #t~mem5#1; {12349#(and (= |old(#length)| |#length|) (= 6 |~#commands~0.base|) (= |~#commands~0.offset| 0) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 23:37:54,853 INFO L290 TraceCheckUtils]: 13: Hoare triple {12349#(and (= |old(#length)| |#length|) (= 6 |~#commands~0.base|) (= |~#commands~0.offset| 0) (= |old(#valid)| |#valid|))} SUMMARY for call #t~mem6#1.base, #t~mem6#1.offset := read~$Pointer$(~#commands~0.base, 4 + (~#commands~0.offset + 9 * ~i~0#1), 4); srcloc: L695 {12349#(and (= |old(#length)| |#length|) (= 6 |~#commands~0.base|) (= |~#commands~0.offset| 0) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 23:37:54,853 INFO L290 TraceCheckUtils]: 14: Hoare triple {12349#(and (= |old(#length)| |#length|) (= 6 |~#commands~0.base|) (= |~#commands~0.offset| 0) (= |old(#valid)| |#valid|))} assume { :begin_inline_##fun~~TO~VOID } true;##fun~~TO~VOID_#in~#fp#1.base, ##fun~~TO~VOID_#in~#fp#1.offset := #t~mem6#1.base, #t~mem6#1.offset; {12349#(and (= |old(#length)| |#length|) (= 6 |~#commands~0.base|) (= |~#commands~0.offset| 0) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 23:37:54,854 INFO L290 TraceCheckUtils]: 15: Hoare triple {12349#(and (= |old(#length)| |#length|) (= 6 |~#commands~0.base|) (= |~#commands~0.offset| 0) (= |old(#valid)| |#valid|))} assume !(##fun~~TO~VOID_#in~#fp#1.base == #funAddr~c2.base && ##fun~~TO~VOID_#in~#fp#1.offset == #funAddr~c2.offset);assume { :begin_inline_c1 } true;havoc c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset, c1_~x~0#1.base, c1_~x~0#1.offset;call c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset := #Ultimate.allocOnHeap(1);c1_~x~0#1.base, c1_~x~0#1.offset := c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset;havoc c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset; {12389#(and (= 6 |~#commands~0.base|) (exists ((|parse_input_c1_~x~0#1.base| Int) (v_ArrVal_11 Int)) (and (= (select |old(#valid)| |parse_input_c1_~x~0#1.base|) 0) (= (store |old(#length)| |parse_input_c1_~x~0#1.base| v_ArrVal_11) |#length|))) (= |~#commands~0.offset| 0))} is VALID [2022-02-20 23:37:54,855 INFO L290 TraceCheckUtils]: 16: Hoare triple {12389#(and (= 6 |~#commands~0.base|) (exists ((|parse_input_c1_~x~0#1.base| Int) (v_ArrVal_11 Int)) (and (= (select |old(#valid)| |parse_input_c1_~x~0#1.base|) 0) (= (store |old(#length)| |parse_input_c1_~x~0#1.base| v_ArrVal_11) |#length|))) (= |~#commands~0.offset| 0))} assume !(c1_~x~0#1.base == 0 && c1_~x~0#1.offset == 0); {12389#(and (= 6 |~#commands~0.base|) (exists ((|parse_input_c1_~x~0#1.base| Int) (v_ArrVal_11 Int)) (and (= (select |old(#valid)| |parse_input_c1_~x~0#1.base|) 0) (= (store |old(#length)| |parse_input_c1_~x~0#1.base| v_ArrVal_11) |#length|))) (= |~#commands~0.offset| 0))} is VALID [2022-02-20 23:37:54,856 INFO L290 TraceCheckUtils]: 17: Hoare triple {12389#(and (= 6 |~#commands~0.base|) (exists ((|parse_input_c1_~x~0#1.base| Int) (v_ArrVal_11 Int)) (and (= (select |old(#valid)| |parse_input_c1_~x~0#1.base|) 0) (= (store |old(#length)| |parse_input_c1_~x~0#1.base| v_ArrVal_11) |#length|))) (= |~#commands~0.offset| 0))} assume !(~global~0.base != 0 || ~global~0.offset != 0); {12389#(and (= 6 |~#commands~0.base|) (exists ((|parse_input_c1_~x~0#1.base| Int) (v_ArrVal_11 Int)) (and (= (select |old(#valid)| |parse_input_c1_~x~0#1.base|) 0) (= (store |old(#length)| |parse_input_c1_~x~0#1.base| v_ArrVal_11) |#length|))) (= |~#commands~0.offset| 0))} is VALID [2022-02-20 23:37:54,857 INFO L290 TraceCheckUtils]: 18: Hoare triple {12389#(and (= 6 |~#commands~0.base|) (exists ((|parse_input_c1_~x~0#1.base| Int) (v_ArrVal_11 Int)) (and (= (select |old(#valid)| |parse_input_c1_~x~0#1.base|) 0) (= (store |old(#length)| |parse_input_c1_~x~0#1.base| v_ArrVal_11) |#length|))) (= |~#commands~0.offset| 0))} ~global~0.base, ~global~0.offset := c1_~x~0#1.base, c1_~x~0#1.offset;~state~0 := ~unnamed3~0~STATE_2; {12389#(and (= 6 |~#commands~0.base|) (exists ((|parse_input_c1_~x~0#1.base| Int) (v_ArrVal_11 Int)) (and (= (select |old(#valid)| |parse_input_c1_~x~0#1.base|) 0) (= (store |old(#length)| |parse_input_c1_~x~0#1.base| v_ArrVal_11) |#length|))) (= |~#commands~0.offset| 0))} is VALID [2022-02-20 23:37:54,858 INFO L290 TraceCheckUtils]: 19: Hoare triple {12389#(and (= 6 |~#commands~0.base|) (exists ((|parse_input_c1_~x~0#1.base| Int) (v_ArrVal_11 Int)) (and (= (select |old(#valid)| |parse_input_c1_~x~0#1.base|) 0) (= (store |old(#length)| |parse_input_c1_~x~0#1.base| v_ArrVal_11) |#length|))) (= |~#commands~0.offset| 0))} assume { :end_inline_c1 } true; {12389#(and (= 6 |~#commands~0.base|) (exists ((|parse_input_c1_~x~0#1.base| Int) (v_ArrVal_11 Int)) (and (= (select |old(#valid)| |parse_input_c1_~x~0#1.base|) 0) (= (store |old(#length)| |parse_input_c1_~x~0#1.base| v_ArrVal_11) |#length|))) (= |~#commands~0.offset| 0))} is VALID [2022-02-20 23:37:54,858 INFO L290 TraceCheckUtils]: 20: Hoare triple {12389#(and (= 6 |~#commands~0.base|) (exists ((|parse_input_c1_~x~0#1.base| Int) (v_ArrVal_11 Int)) (and (= (select |old(#valid)| |parse_input_c1_~x~0#1.base|) 0) (= (store |old(#length)| |parse_input_c1_~x~0#1.base| v_ArrVal_11) |#length|))) (= |~#commands~0.offset| 0))} assume { :end_inline_##fun~~TO~VOID } true;havoc #t~mem6#1.base, #t~mem6#1.offset; {12389#(and (= 6 |~#commands~0.base|) (exists ((|parse_input_c1_~x~0#1.base| Int) (v_ArrVal_11 Int)) (and (= (select |old(#valid)| |parse_input_c1_~x~0#1.base|) 0) (= (store |old(#length)| |parse_input_c1_~x~0#1.base| v_ArrVal_11) |#length|))) (= |~#commands~0.offset| 0))} is VALID [2022-02-20 23:37:54,859 INFO L290 TraceCheckUtils]: 21: Hoare triple {12389#(and (= 6 |~#commands~0.base|) (exists ((|parse_input_c1_~x~0#1.base| Int) (v_ArrVal_11 Int)) (and (= (select |old(#valid)| |parse_input_c1_~x~0#1.base|) 0) (= (store |old(#length)| |parse_input_c1_~x~0#1.base| v_ArrVal_11) |#length|))) (= |~#commands~0.offset| 0))} assume true; {12389#(and (= 6 |~#commands~0.base|) (exists ((|parse_input_c1_~x~0#1.base| Int) (v_ArrVal_11 Int)) (and (= (select |old(#valid)| |parse_input_c1_~x~0#1.base|) 0) (= (store |old(#length)| |parse_input_c1_~x~0#1.base| v_ArrVal_11) |#length|))) (= |~#commands~0.offset| 0))} is VALID [2022-02-20 23:37:54,860 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {12389#(and (= 6 |~#commands~0.base|) (exists ((|parse_input_c1_~x~0#1.base| Int) (v_ArrVal_11 Int)) (and (= (select |old(#valid)| |parse_input_c1_~x~0#1.base|) 0) (= (store |old(#length)| |parse_input_c1_~x~0#1.base| v_ArrVal_11) |#length|))) (= |~#commands~0.offset| 0))} {12342#(and (= 6 |~#commands~0.base|) (<= 18 (select |#length| 6)) (= |~#commands~0.offset| 0) (= (select |#valid| 6) 1))} #101#return; {12411#(and (= 6 |~#commands~0.base|) (<= 18 (select |#length| 6)) (= |~#commands~0.offset| 0))} is VALID [2022-02-20 23:37:54,861 INFO L272 TraceCheckUtils]: 23: Hoare triple {12411#(and (= 6 |~#commands~0.base|) (<= 18 (select |#length| 6)) (= |~#commands~0.offset| 0))} call parse_input(4, 0); {12411#(and (= 6 |~#commands~0.base|) (<= 18 (select |#length| 6)) (= |~#commands~0.offset| 0))} is VALID [2022-02-20 23:37:54,861 INFO L290 TraceCheckUtils]: 24: Hoare triple {12411#(and (= 6 |~#commands~0.base|) (<= 18 (select |#length| 6)) (= |~#commands~0.offset| 0))} ~input#1.base, ~input#1.offset := #in~input#1.base, #in~input#1.offset;~i~0#1 := 0; {12418#(and (= 6 |~#commands~0.base|) (<= 18 (select |#length| 6)) (= |~#commands~0.offset| 0) (= |parse_input_~i~0#1| 0))} is VALID [2022-02-20 23:37:54,861 INFO L290 TraceCheckUtils]: 25: Hoare triple {12418#(and (= 6 |~#commands~0.base|) (<= 18 (select |#length| 6)) (= |~#commands~0.offset| 0) (= |parse_input_~i~0#1| 0))} assume !!(~i~0#1 < 2); {12418#(and (= 6 |~#commands~0.base|) (<= 18 (select |#length| 6)) (= |~#commands~0.offset| 0) (= |parse_input_~i~0#1| 0))} is VALID [2022-02-20 23:37:54,862 INFO L290 TraceCheckUtils]: 26: Hoare triple {12418#(and (= 6 |~#commands~0.base|) (<= 18 (select |#length| 6)) (= |~#commands~0.offset| 0) (= |parse_input_~i~0#1| 0))} assume !(4 + (~#commands~0.offset + 9 * ~i~0#1) <= #length[~#commands~0.base] && 0 <= ~#commands~0.offset + 9 * ~i~0#1); {12310#false} is VALID [2022-02-20 23:37:54,863 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:37:54,863 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:37:55,071 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1088684154] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 23:37:55,071 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 23:37:55,071 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 13 [2022-02-20 23:37:55,073 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153195319] [2022-02-20 23:37:55,073 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 23:37:55,074 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 3.4285714285714284) internal successors, (48), 11 states have internal predecessors, (48), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 27 [2022-02-20 23:37:55,074 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:37:55,075 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 15 states, 14 states have (on average 3.4285714285714284) internal successors, (48), 11 states have internal predecessors, (48), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:37:55,132 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:37:55,132 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-02-20 23:37:55,132 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:37:55,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-02-20 23:37:55,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2022-02-20 23:37:55,134 INFO L87 Difference]: Start difference. First operand 263 states and 368 transitions. Second operand has 15 states, 14 states have (on average 3.4285714285714284) internal successors, (48), 11 states have internal predecessors, (48), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:37:56,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:37:56,607 INFO L93 Difference]: Finished difference Result 414 states and 529 transitions. [2022-02-20 23:37:56,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-02-20 23:37:56,607 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 3.4285714285714284) internal successors, (48), 11 states have internal predecessors, (48), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 27 [2022-02-20 23:37:56,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:37:56,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 3.4285714285714284) internal successors, (48), 11 states have internal predecessors, (48), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:37:56,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 218 transitions. [2022-02-20 23:37:56,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 3.4285714285714284) internal successors, (48), 11 states have internal predecessors, (48), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:37:56,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 218 transitions. [2022-02-20 23:37:56,611 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states and 218 transitions. [2022-02-20 23:37:56,787 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 218 edges. 218 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:37:56,793 INFO L225 Difference]: With dead ends: 414 [2022-02-20 23:37:56,793 INFO L226 Difference]: Without dead ends: 414 [2022-02-20 23:37:56,794 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=213, Invalid=717, Unknown=0, NotChecked=0, Total=930 [2022-02-20 23:37:56,794 INFO L933 BasicCegarLoop]: 39 mSDtfsCounter, 774 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 275 mSolverCounterSat, 122 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 774 SdHoareTripleChecker+Valid, 307 SdHoareTripleChecker+Invalid, 478 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 122 IncrementalHoareTripleChecker+Valid, 275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 81 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-20 23:37:56,794 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [774 Valid, 307 Invalid, 478 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [122 Valid, 275 Invalid, 0 Unknown, 81 Unchecked, 0.4s Time] [2022-02-20 23:37:56,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states. [2022-02-20 23:37:56,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 321. [2022-02-20 23:37:56,798 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:37:56,799 INFO L82 GeneralOperation]: Start isEquivalent. First operand 414 states. Second operand has 321 states, 279 states have (on average 1.4838709677419355) internal successors, (414), 304 states have internal predecessors, (414), 9 states have call successors, (9), 7 states have call predecessors, (9), 15 states have return successors, (27), 9 states have call predecessors, (27), 9 states have call successors, (27) [2022-02-20 23:37:56,799 INFO L74 IsIncluded]: Start isIncluded. First operand 414 states. Second operand has 321 states, 279 states have (on average 1.4838709677419355) internal successors, (414), 304 states have internal predecessors, (414), 9 states have call successors, (9), 7 states have call predecessors, (9), 15 states have return successors, (27), 9 states have call predecessors, (27), 9 states have call successors, (27) [2022-02-20 23:37:56,800 INFO L87 Difference]: Start difference. First operand 414 states. Second operand has 321 states, 279 states have (on average 1.4838709677419355) internal successors, (414), 304 states have internal predecessors, (414), 9 states have call successors, (9), 7 states have call predecessors, (9), 15 states have return successors, (27), 9 states have call predecessors, (27), 9 states have call successors, (27) [2022-02-20 23:37:56,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:37:56,807 INFO L93 Difference]: Finished difference Result 414 states and 529 transitions. [2022-02-20 23:37:56,807 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 529 transitions. [2022-02-20 23:37:56,809 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:37:56,809 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:37:56,810 INFO L74 IsIncluded]: Start isIncluded. First operand has 321 states, 279 states have (on average 1.4838709677419355) internal successors, (414), 304 states have internal predecessors, (414), 9 states have call successors, (9), 7 states have call predecessors, (9), 15 states have return successors, (27), 9 states have call predecessors, (27), 9 states have call successors, (27) Second operand 414 states. [2022-02-20 23:37:56,810 INFO L87 Difference]: Start difference. First operand has 321 states, 279 states have (on average 1.4838709677419355) internal successors, (414), 304 states have internal predecessors, (414), 9 states have call successors, (9), 7 states have call predecessors, (9), 15 states have return successors, (27), 9 states have call predecessors, (27), 9 states have call successors, (27) Second operand 414 states. [2022-02-20 23:37:56,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:37:56,818 INFO L93 Difference]: Finished difference Result 414 states and 529 transitions. [2022-02-20 23:37:56,818 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 529 transitions. [2022-02-20 23:37:56,819 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:37:56,819 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:37:56,819 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:37:56,819 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:37:56,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 321 states, 279 states have (on average 1.4838709677419355) internal successors, (414), 304 states have internal predecessors, (414), 9 states have call successors, (9), 7 states have call predecessors, (9), 15 states have return successors, (27), 9 states have call predecessors, (27), 9 states have call successors, (27) [2022-02-20 23:37:56,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 450 transitions. [2022-02-20 23:37:56,824 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 450 transitions. Word has length 27 [2022-02-20 23:37:56,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:37:56,825 INFO L470 AbstractCegarLoop]: Abstraction has 321 states and 450 transitions. [2022-02-20 23:37:56,825 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 3.4285714285714284) internal successors, (48), 11 states have internal predecessors, (48), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:37:56,825 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 450 transitions. [2022-02-20 23:37:56,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-02-20 23:37:56,826 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:37:56,826 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:37:56,845 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 23:37:57,038 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:37:57,038 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATION, parse_inputErr1REQUIRES_VIOLATION, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2022-02-20 23:37:57,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:37:57,039 INFO L85 PathProgramCache]: Analyzing trace with hash 2041807728, now seen corresponding path program 1 times [2022-02-20 23:37:57,039 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:37:57,039 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643576025] [2022-02-20 23:37:57,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:37:57,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:37:57,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:37:57,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 23:37:57,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:37:57,113 INFO L290 TraceCheckUtils]: 0: Hoare triple {14056#(and (= ~global~0.base |old(~global~0.base)|) (= |old(#length)| |#length|) (= |old(~global~0.offset)| ~global~0.offset) (= ~state~0 |old(~state~0)|) (= |old(#valid)| |#valid|))} ~input#1.base, ~input#1.offset := #in~input#1.base, #in~input#1.offset;~i~0#1 := 0; {14057#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:37:57,114 INFO L290 TraceCheckUtils]: 1: Hoare triple {14057#(= |old(#valid)| |#valid|)} assume !!(~i~0#1 < 2); {14057#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:37:57,114 INFO L290 TraceCheckUtils]: 2: Hoare triple {14057#(= |old(#valid)| |#valid|)} SUMMARY for call #t~mem3#1.base, #t~mem3#1.offset := read~$Pointer$(~#commands~0.base, ~#commands~0.offset + 9 * ~i~0#1, 4); srcloc: L693 {14057#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:37:57,115 INFO L290 TraceCheckUtils]: 3: Hoare triple {14057#(= |old(#valid)| |#valid|)} assume 1 == #valid[#t~mem3#1.base]; {14057#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:37:57,115 INFO L290 TraceCheckUtils]: 4: Hoare triple {14057#(= |old(#valid)| |#valid|)} assume #t~mem3#1.offset < #length[#t~mem3#1.base] && #t~mem3#1.offset >= 0; {14057#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:37:57,115 INFO L290 TraceCheckUtils]: 5: Hoare triple {14057#(= |old(#valid)| |#valid|)} assume 1 == #valid[~input#1.base]; {14057#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:37:57,116 INFO L290 TraceCheckUtils]: 6: Hoare triple {14057#(= |old(#valid)| |#valid|)} assume ~input#1.offset < #length[~input#1.base] && ~input#1.offset >= 0; {14057#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:37:57,116 INFO L290 TraceCheckUtils]: 7: Hoare triple {14057#(= |old(#valid)| |#valid|)} assume 0 == #t~nondet4#1;havoc #t~mem3#1.base, #t~mem3#1.offset;havoc #t~nondet4#1; {14057#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:37:57,116 INFO L290 TraceCheckUtils]: 8: Hoare triple {14057#(= |old(#valid)| |#valid|)} SUMMARY for call #t~mem5#1 := read~int(~#commands~0.base, 8 + (~#commands~0.offset + 9 * ~i~0#1), 1); srcloc: L694 {14057#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:37:57,117 INFO L290 TraceCheckUtils]: 9: Hoare triple {14057#(= |old(#valid)| |#valid|)} assume ~state~0 >= #t~mem5#1;havoc #t~mem5#1; {14057#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:37:57,117 INFO L290 TraceCheckUtils]: 10: Hoare triple {14057#(= |old(#valid)| |#valid|)} SUMMARY for call #t~mem6#1.base, #t~mem6#1.offset := read~$Pointer$(~#commands~0.base, 4 + (~#commands~0.offset + 9 * ~i~0#1), 4); srcloc: L695 {14057#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:37:57,117 INFO L290 TraceCheckUtils]: 11: Hoare triple {14057#(= |old(#valid)| |#valid|)} assume { :begin_inline_##fun~~TO~VOID } true;##fun~~TO~VOID_#in~#fp#1.base, ##fun~~TO~VOID_#in~#fp#1.offset := #t~mem6#1.base, #t~mem6#1.offset; {14057#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:37:57,118 INFO L290 TraceCheckUtils]: 12: Hoare triple {14057#(= |old(#valid)| |#valid|)} assume ##fun~~TO~VOID_#in~#fp#1.base == #funAddr~c2.base && ##fun~~TO~VOID_#in~#fp#1.offset == #funAddr~c2.offset;assume { :begin_inline_c2 } true;havoc c2_~y~0#1.base, c2_~y~0#1.offset;c2_~y~0#1.base, c2_~y~0#1.offset := 0, 0; {14057#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:37:57,118 INFO L290 TraceCheckUtils]: 13: Hoare triple {14057#(= |old(#valid)| |#valid|)} assume (c2_~y~0#1.base == 0 && c2_~y~0#1.offset == 0) || (~global~0.base == 0 && ~global~0.offset == 0); {14057#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:37:57,118 INFO L290 TraceCheckUtils]: 14: Hoare triple {14057#(= |old(#valid)| |#valid|)} assume { :end_inline_c2 } true; {14057#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:37:57,119 INFO L290 TraceCheckUtils]: 15: Hoare triple {14057#(= |old(#valid)| |#valid|)} assume { :end_inline_##fun~~TO~VOID } true;havoc #t~mem6#1.base, #t~mem6#1.offset; {14057#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:37:57,119 INFO L290 TraceCheckUtils]: 16: Hoare triple {14057#(= |old(#valid)| |#valid|)} assume true; {14057#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:37:57,119 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {14057#(= |old(#valid)| |#valid|)} {14035#(= (select |#valid| 4) 1)} #101#return; {14035#(= (select |#valid| 4) 1)} is VALID [2022-02-20 23:37:57,120 INFO L290 TraceCheckUtils]: 0: Hoare triple {14033#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(3, 1);call write~init~int(99, 1, 0, 1);call write~init~int(49, 1, 1, 1);call write~init~int(0, 1, 2, 1);call #Ultimate.allocInit(3, 2);call write~init~int(99, 2, 0, 1);call write~init~int(50, 2, 1, 1);call write~init~int(0, 2, 2, 1);call #Ultimate.allocInit(3, 3);call write~init~int(99, 3, 0, 1);call write~init~int(49, 3, 1, 1);call write~init~int(0, 3, 2, 1);call #Ultimate.allocInit(3, 4);call write~init~int(99, 4, 0, 1);call write~init~int(49, 4, 1, 1);call write~init~int(0, 4, 2, 1);call #Ultimate.allocInit(3, 5);call write~init~int(99, 5, 0, 1);call write~init~int(50, 5, 1, 1);call write~init~int(0, 5, 2, 1);~state~0 := ~unnamed3~0~STATE_1;~global~0.base, ~global~0.offset := 0, 0;~#commands~0.base, ~#commands~0.offset := 6, 0;call #Ultimate.allocInit(18, 6);call write~init~$Pointer$(1, 0, ~#commands~0.base, ~#commands~0.offset, 4);call write~init~$Pointer$(#funAddr~c1.base, #funAddr~c1.offset, ~#commands~0.base, 4 + ~#commands~0.offset, 4);call write~init~int((if ~unnamed3~0~STATE_1 % 256 <= 127 then ~unnamed3~0~STATE_1 % 256 else ~unnamed3~0~STATE_1 % 256 - 256), ~#commands~0.base, 8 + ~#commands~0.offset, 1);call write~init~$Pointer$(2, 0, ~#commands~0.base, 9 + ~#commands~0.offset, 4);call write~init~$Pointer$(#funAddr~c2.base, #funAddr~c2.offset, ~#commands~0.base, 13 + ~#commands~0.offset, 4);call write~init~int((if ~unnamed3~0~STATE_2 % 256 <= 127 then ~unnamed3~0~STATE_2 % 256 else ~unnamed3~0~STATE_2 % 256 - 256), ~#commands~0.base, 17 + ~#commands~0.offset, 1); {14035#(= (select |#valid| 4) 1)} is VALID [2022-02-20 23:37:57,120 INFO L290 TraceCheckUtils]: 1: Hoare triple {14035#(= (select |#valid| 4) 1)} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1; {14035#(= (select |#valid| 4) 1)} is VALID [2022-02-20 23:37:57,121 INFO L272 TraceCheckUtils]: 2: Hoare triple {14035#(= (select |#valid| 4) 1)} call parse_input(3, 0); {14056#(and (= ~global~0.base |old(~global~0.base)|) (= |old(#length)| |#length|) (= |old(~global~0.offset)| ~global~0.offset) (= ~state~0 |old(~state~0)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 23:37:57,121 INFO L290 TraceCheckUtils]: 3: Hoare triple {14056#(and (= ~global~0.base |old(~global~0.base)|) (= |old(#length)| |#length|) (= |old(~global~0.offset)| ~global~0.offset) (= ~state~0 |old(~state~0)|) (= |old(#valid)| |#valid|))} ~input#1.base, ~input#1.offset := #in~input#1.base, #in~input#1.offset;~i~0#1 := 0; {14057#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:37:57,121 INFO L290 TraceCheckUtils]: 4: Hoare triple {14057#(= |old(#valid)| |#valid|)} assume !!(~i~0#1 < 2); {14057#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:37:57,122 INFO L290 TraceCheckUtils]: 5: Hoare triple {14057#(= |old(#valid)| |#valid|)} SUMMARY for call #t~mem3#1.base, #t~mem3#1.offset := read~$Pointer$(~#commands~0.base, ~#commands~0.offset + 9 * ~i~0#1, 4); srcloc: L693 {14057#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:37:57,122 INFO L290 TraceCheckUtils]: 6: Hoare triple {14057#(= |old(#valid)| |#valid|)} assume 1 == #valid[#t~mem3#1.base]; {14057#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:37:57,122 INFO L290 TraceCheckUtils]: 7: Hoare triple {14057#(= |old(#valid)| |#valid|)} assume #t~mem3#1.offset < #length[#t~mem3#1.base] && #t~mem3#1.offset >= 0; {14057#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:37:57,122 INFO L290 TraceCheckUtils]: 8: Hoare triple {14057#(= |old(#valid)| |#valid|)} assume 1 == #valid[~input#1.base]; {14057#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:37:57,123 INFO L290 TraceCheckUtils]: 9: Hoare triple {14057#(= |old(#valid)| |#valid|)} assume ~input#1.offset < #length[~input#1.base] && ~input#1.offset >= 0; {14057#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:37:57,123 INFO L290 TraceCheckUtils]: 10: Hoare triple {14057#(= |old(#valid)| |#valid|)} assume 0 == #t~nondet4#1;havoc #t~mem3#1.base, #t~mem3#1.offset;havoc #t~nondet4#1; {14057#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:37:57,124 INFO L290 TraceCheckUtils]: 11: Hoare triple {14057#(= |old(#valid)| |#valid|)} SUMMARY for call #t~mem5#1 := read~int(~#commands~0.base, 8 + (~#commands~0.offset + 9 * ~i~0#1), 1); srcloc: L694 {14057#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:37:57,124 INFO L290 TraceCheckUtils]: 12: Hoare triple {14057#(= |old(#valid)| |#valid|)} assume ~state~0 >= #t~mem5#1;havoc #t~mem5#1; {14057#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:37:57,124 INFO L290 TraceCheckUtils]: 13: Hoare triple {14057#(= |old(#valid)| |#valid|)} SUMMARY for call #t~mem6#1.base, #t~mem6#1.offset := read~$Pointer$(~#commands~0.base, 4 + (~#commands~0.offset + 9 * ~i~0#1), 4); srcloc: L695 {14057#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:37:57,125 INFO L290 TraceCheckUtils]: 14: Hoare triple {14057#(= |old(#valid)| |#valid|)} assume { :begin_inline_##fun~~TO~VOID } true;##fun~~TO~VOID_#in~#fp#1.base, ##fun~~TO~VOID_#in~#fp#1.offset := #t~mem6#1.base, #t~mem6#1.offset; {14057#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:37:57,125 INFO L290 TraceCheckUtils]: 15: Hoare triple {14057#(= |old(#valid)| |#valid|)} assume ##fun~~TO~VOID_#in~#fp#1.base == #funAddr~c2.base && ##fun~~TO~VOID_#in~#fp#1.offset == #funAddr~c2.offset;assume { :begin_inline_c2 } true;havoc c2_~y~0#1.base, c2_~y~0#1.offset;c2_~y~0#1.base, c2_~y~0#1.offset := 0, 0; {14057#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:37:57,125 INFO L290 TraceCheckUtils]: 16: Hoare triple {14057#(= |old(#valid)| |#valid|)} assume (c2_~y~0#1.base == 0 && c2_~y~0#1.offset == 0) || (~global~0.base == 0 && ~global~0.offset == 0); {14057#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:37:57,126 INFO L290 TraceCheckUtils]: 17: Hoare triple {14057#(= |old(#valid)| |#valid|)} assume { :end_inline_c2 } true; {14057#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:37:57,126 INFO L290 TraceCheckUtils]: 18: Hoare triple {14057#(= |old(#valid)| |#valid|)} assume { :end_inline_##fun~~TO~VOID } true;havoc #t~mem6#1.base, #t~mem6#1.offset; {14057#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:37:57,126 INFO L290 TraceCheckUtils]: 19: Hoare triple {14057#(= |old(#valid)| |#valid|)} assume true; {14057#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:37:57,127 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {14057#(= |old(#valid)| |#valid|)} {14035#(= (select |#valid| 4) 1)} #101#return; {14035#(= (select |#valid| 4) 1)} is VALID [2022-02-20 23:37:57,127 INFO L272 TraceCheckUtils]: 21: Hoare triple {14035#(= (select |#valid| 4) 1)} call parse_input(4, 0); {14054#(and (= (select |#valid| 4) 1) (= |parse_input_#in~input#1.base| 4))} is VALID [2022-02-20 23:37:57,127 INFO L290 TraceCheckUtils]: 22: Hoare triple {14054#(and (= (select |#valid| 4) 1) (= |parse_input_#in~input#1.base| 4))} ~input#1.base, ~input#1.offset := #in~input#1.base, #in~input#1.offset;~i~0#1 := 0; {14055#(and (= (select |#valid| |parse_input_~input#1.base|) 1) (= |parse_input_~input#1.base| 4))} is VALID [2022-02-20 23:37:57,128 INFO L290 TraceCheckUtils]: 23: Hoare triple {14055#(and (= (select |#valid| |parse_input_~input#1.base|) 1) (= |parse_input_~input#1.base| 4))} assume !!(~i~0#1 < 2); {14055#(and (= (select |#valid| |parse_input_~input#1.base|) 1) (= |parse_input_~input#1.base| 4))} is VALID [2022-02-20 23:37:57,128 INFO L290 TraceCheckUtils]: 24: Hoare triple {14055#(and (= (select |#valid| |parse_input_~input#1.base|) 1) (= |parse_input_~input#1.base| 4))} SUMMARY for call #t~mem3#1.base, #t~mem3#1.offset := read~$Pointer$(~#commands~0.base, ~#commands~0.offset + 9 * ~i~0#1, 4); srcloc: L693 {14055#(and (= (select |#valid| |parse_input_~input#1.base|) 1) (= |parse_input_~input#1.base| 4))} is VALID [2022-02-20 23:37:57,129 INFO L290 TraceCheckUtils]: 25: Hoare triple {14055#(and (= (select |#valid| |parse_input_~input#1.base|) 1) (= |parse_input_~input#1.base| 4))} assume 1 == #valid[#t~mem3#1.base]; {14055#(and (= (select |#valid| |parse_input_~input#1.base|) 1) (= |parse_input_~input#1.base| 4))} is VALID [2022-02-20 23:37:57,129 INFO L290 TraceCheckUtils]: 26: Hoare triple {14055#(and (= (select |#valid| |parse_input_~input#1.base|) 1) (= |parse_input_~input#1.base| 4))} assume #t~mem3#1.offset < #length[#t~mem3#1.base] && #t~mem3#1.offset >= 0; {14055#(and (= (select |#valid| |parse_input_~input#1.base|) 1) (= |parse_input_~input#1.base| 4))} is VALID [2022-02-20 23:37:57,129 INFO L290 TraceCheckUtils]: 27: Hoare triple {14055#(and (= (select |#valid| |parse_input_~input#1.base|) 1) (= |parse_input_~input#1.base| 4))} assume !(1 == #valid[~input#1.base]); {14034#false} is VALID [2022-02-20 23:37:57,129 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:37:57,130 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:37:57,130 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643576025] [2022-02-20 23:37:57,130 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [643576025] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 23:37:57,130 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1212736057] [2022-02-20 23:37:57,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:37:57,130 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:37:57,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:37:57,131 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 23:37:57,132 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-02-20 23:37:57,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:37:57,181 INFO L263 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 12 conjunts are in the unsatisfiable core [2022-02-20 23:37:57,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:37:57,187 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:37:57,369 INFO L290 TraceCheckUtils]: 0: Hoare triple {14033#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(3, 1);call write~init~int(99, 1, 0, 1);call write~init~int(49, 1, 1, 1);call write~init~int(0, 1, 2, 1);call #Ultimate.allocInit(3, 2);call write~init~int(99, 2, 0, 1);call write~init~int(50, 2, 1, 1);call write~init~int(0, 2, 2, 1);call #Ultimate.allocInit(3, 3);call write~init~int(99, 3, 0, 1);call write~init~int(49, 3, 1, 1);call write~init~int(0, 3, 2, 1);call #Ultimate.allocInit(3, 4);call write~init~int(99, 4, 0, 1);call write~init~int(49, 4, 1, 1);call write~init~int(0, 4, 2, 1);call #Ultimate.allocInit(3, 5);call write~init~int(99, 5, 0, 1);call write~init~int(50, 5, 1, 1);call write~init~int(0, 5, 2, 1);~state~0 := ~unnamed3~0~STATE_1;~global~0.base, ~global~0.offset := 0, 0;~#commands~0.base, ~#commands~0.offset := 6, 0;call #Ultimate.allocInit(18, 6);call write~init~$Pointer$(1, 0, ~#commands~0.base, ~#commands~0.offset, 4);call write~init~$Pointer$(#funAddr~c1.base, #funAddr~c1.offset, ~#commands~0.base, 4 + ~#commands~0.offset, 4);call write~init~int((if ~unnamed3~0~STATE_1 % 256 <= 127 then ~unnamed3~0~STATE_1 % 256 else ~unnamed3~0~STATE_1 % 256 - 256), ~#commands~0.base, 8 + ~#commands~0.offset, 1);call write~init~$Pointer$(2, 0, ~#commands~0.base, 9 + ~#commands~0.offset, 4);call write~init~$Pointer$(#funAddr~c2.base, #funAddr~c2.offset, ~#commands~0.base, 13 + ~#commands~0.offset, 4);call write~init~int((if ~unnamed3~0~STATE_2 % 256 <= 127 then ~unnamed3~0~STATE_2 % 256 else ~unnamed3~0~STATE_2 % 256 - 256), ~#commands~0.base, 17 + ~#commands~0.offset, 1); {14061#(and (= |~#commands~0.offset| 0) (= |#funAddr~c1.offset| (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) (+ |~#commands~0.offset| 4))))} is VALID [2022-02-20 23:37:57,370 INFO L290 TraceCheckUtils]: 1: Hoare triple {14061#(and (= |~#commands~0.offset| 0) (= |#funAddr~c1.offset| (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) (+ |~#commands~0.offset| 4))))} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1; {14061#(and (= |~#commands~0.offset| 0) (= |#funAddr~c1.offset| (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) (+ |~#commands~0.offset| 4))))} is VALID [2022-02-20 23:37:57,371 INFO L272 TraceCheckUtils]: 2: Hoare triple {14061#(and (= |~#commands~0.offset| 0) (= |#funAddr~c1.offset| (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) (+ |~#commands~0.offset| 4))))} call parse_input(3, 0); {14061#(and (= |~#commands~0.offset| 0) (= |#funAddr~c1.offset| (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) (+ |~#commands~0.offset| 4))))} is VALID [2022-02-20 23:37:57,371 INFO L290 TraceCheckUtils]: 3: Hoare triple {14061#(and (= |~#commands~0.offset| 0) (= |#funAddr~c1.offset| (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) (+ |~#commands~0.offset| 4))))} ~input#1.base, ~input#1.offset := #in~input#1.base, #in~input#1.offset;~i~0#1 := 0; {14071#(and (= |~#commands~0.offset| 0) (= |parse_input_~i~0#1| 0) (= |#funAddr~c1.offset| (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) (+ |~#commands~0.offset| 4))))} is VALID [2022-02-20 23:37:57,372 INFO L290 TraceCheckUtils]: 4: Hoare triple {14071#(and (= |~#commands~0.offset| 0) (= |parse_input_~i~0#1| 0) (= |#funAddr~c1.offset| (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) (+ |~#commands~0.offset| 4))))} assume !!(~i~0#1 < 2); {14071#(and (= |~#commands~0.offset| 0) (= |parse_input_~i~0#1| 0) (= |#funAddr~c1.offset| (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) (+ |~#commands~0.offset| 4))))} is VALID [2022-02-20 23:37:57,372 INFO L290 TraceCheckUtils]: 5: Hoare triple {14071#(and (= |~#commands~0.offset| 0) (= |parse_input_~i~0#1| 0) (= |#funAddr~c1.offset| (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) (+ |~#commands~0.offset| 4))))} SUMMARY for call #t~mem3#1.base, #t~mem3#1.offset := read~$Pointer$(~#commands~0.base, ~#commands~0.offset + 9 * ~i~0#1, 4); srcloc: L693 {14071#(and (= |~#commands~0.offset| 0) (= |parse_input_~i~0#1| 0) (= |#funAddr~c1.offset| (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) (+ |~#commands~0.offset| 4))))} is VALID [2022-02-20 23:37:57,373 INFO L290 TraceCheckUtils]: 6: Hoare triple {14071#(and (= |~#commands~0.offset| 0) (= |parse_input_~i~0#1| 0) (= |#funAddr~c1.offset| (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) (+ |~#commands~0.offset| 4))))} assume 1 == #valid[#t~mem3#1.base]; {14071#(and (= |~#commands~0.offset| 0) (= |parse_input_~i~0#1| 0) (= |#funAddr~c1.offset| (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) (+ |~#commands~0.offset| 4))))} is VALID [2022-02-20 23:37:57,373 INFO L290 TraceCheckUtils]: 7: Hoare triple {14071#(and (= |~#commands~0.offset| 0) (= |parse_input_~i~0#1| 0) (= |#funAddr~c1.offset| (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) (+ |~#commands~0.offset| 4))))} assume #t~mem3#1.offset < #length[#t~mem3#1.base] && #t~mem3#1.offset >= 0; {14071#(and (= |~#commands~0.offset| 0) (= |parse_input_~i~0#1| 0) (= |#funAddr~c1.offset| (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) (+ |~#commands~0.offset| 4))))} is VALID [2022-02-20 23:37:57,373 INFO L290 TraceCheckUtils]: 8: Hoare triple {14071#(and (= |~#commands~0.offset| 0) (= |parse_input_~i~0#1| 0) (= |#funAddr~c1.offset| (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) (+ |~#commands~0.offset| 4))))} assume 1 == #valid[~input#1.base]; {14071#(and (= |~#commands~0.offset| 0) (= |parse_input_~i~0#1| 0) (= |#funAddr~c1.offset| (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) (+ |~#commands~0.offset| 4))))} is VALID [2022-02-20 23:37:57,374 INFO L290 TraceCheckUtils]: 9: Hoare triple {14071#(and (= |~#commands~0.offset| 0) (= |parse_input_~i~0#1| 0) (= |#funAddr~c1.offset| (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) (+ |~#commands~0.offset| 4))))} assume ~input#1.offset < #length[~input#1.base] && ~input#1.offset >= 0; {14071#(and (= |~#commands~0.offset| 0) (= |parse_input_~i~0#1| 0) (= |#funAddr~c1.offset| (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) (+ |~#commands~0.offset| 4))))} is VALID [2022-02-20 23:37:57,375 INFO L290 TraceCheckUtils]: 10: Hoare triple {14071#(and (= |~#commands~0.offset| 0) (= |parse_input_~i~0#1| 0) (= |#funAddr~c1.offset| (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) (+ |~#commands~0.offset| 4))))} assume 0 == #t~nondet4#1;havoc #t~mem3#1.base, #t~mem3#1.offset;havoc #t~nondet4#1; {14071#(and (= |~#commands~0.offset| 0) (= |parse_input_~i~0#1| 0) (= |#funAddr~c1.offset| (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) (+ |~#commands~0.offset| 4))))} is VALID [2022-02-20 23:37:57,375 INFO L290 TraceCheckUtils]: 11: Hoare triple {14071#(and (= |~#commands~0.offset| 0) (= |parse_input_~i~0#1| 0) (= |#funAddr~c1.offset| (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) (+ |~#commands~0.offset| 4))))} SUMMARY for call #t~mem5#1 := read~int(~#commands~0.base, 8 + (~#commands~0.offset + 9 * ~i~0#1), 1); srcloc: L694 {14071#(and (= |~#commands~0.offset| 0) (= |parse_input_~i~0#1| 0) (= |#funAddr~c1.offset| (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) (+ |~#commands~0.offset| 4))))} is VALID [2022-02-20 23:37:57,376 INFO L290 TraceCheckUtils]: 12: Hoare triple {14071#(and (= |~#commands~0.offset| 0) (= |parse_input_~i~0#1| 0) (= |#funAddr~c1.offset| (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) (+ |~#commands~0.offset| 4))))} assume ~state~0 >= #t~mem5#1;havoc #t~mem5#1; {14071#(and (= |~#commands~0.offset| 0) (= |parse_input_~i~0#1| 0) (= |#funAddr~c1.offset| (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) (+ |~#commands~0.offset| 4))))} is VALID [2022-02-20 23:37:57,378 INFO L290 TraceCheckUtils]: 13: Hoare triple {14071#(and (= |~#commands~0.offset| 0) (= |parse_input_~i~0#1| 0) (= |#funAddr~c1.offset| (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) (+ |~#commands~0.offset| 4))))} SUMMARY for call #t~mem6#1.base, #t~mem6#1.offset := read~$Pointer$(~#commands~0.base, 4 + (~#commands~0.offset + 9 * ~i~0#1), 4); srcloc: L695 {14102#(and (= |parse_input_#t~mem6#1.offset| (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) (+ |~#commands~0.offset| 4))) (= |~#commands~0.offset| 0) (= |#funAddr~c1.offset| (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) (+ |~#commands~0.offset| 4))))} is VALID [2022-02-20 23:37:57,382 INFO L290 TraceCheckUtils]: 14: Hoare triple {14102#(and (= |parse_input_#t~mem6#1.offset| (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) (+ |~#commands~0.offset| 4))) (= |~#commands~0.offset| 0) (= |#funAddr~c1.offset| (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) (+ |~#commands~0.offset| 4))))} assume { :begin_inline_##fun~~TO~VOID } true;##fun~~TO~VOID_#in~#fp#1.base, ##fun~~TO~VOID_#in~#fp#1.offset := #t~mem6#1.base, #t~mem6#1.offset; {14106#(and (= |parse_input_##fun~~TO~VOID_#in~#fp#1.offset| (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) (+ |~#commands~0.offset| 4))) (= |~#commands~0.offset| 0) (= |#funAddr~c1.offset| (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) (+ |~#commands~0.offset| 4))))} is VALID [2022-02-20 23:37:57,382 INFO L290 TraceCheckUtils]: 15: Hoare triple {14106#(and (= |parse_input_##fun~~TO~VOID_#in~#fp#1.offset| (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) (+ |~#commands~0.offset| 4))) (= |~#commands~0.offset| 0) (= |#funAddr~c1.offset| (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) (+ |~#commands~0.offset| 4))))} assume ##fun~~TO~VOID_#in~#fp#1.base == #funAddr~c2.base && ##fun~~TO~VOID_#in~#fp#1.offset == #funAddr~c2.offset;assume { :begin_inline_c2 } true;havoc c2_~y~0#1.base, c2_~y~0#1.offset;c2_~y~0#1.base, c2_~y~0#1.offset := 0, 0; {14034#false} is VALID [2022-02-20 23:37:57,382 INFO L290 TraceCheckUtils]: 16: Hoare triple {14034#false} assume (c2_~y~0#1.base == 0 && c2_~y~0#1.offset == 0) || (~global~0.base == 0 && ~global~0.offset == 0); {14034#false} is VALID [2022-02-20 23:37:57,382 INFO L290 TraceCheckUtils]: 17: Hoare triple {14034#false} assume { :end_inline_c2 } true; {14034#false} is VALID [2022-02-20 23:37:57,382 INFO L290 TraceCheckUtils]: 18: Hoare triple {14034#false} assume { :end_inline_##fun~~TO~VOID } true;havoc #t~mem6#1.base, #t~mem6#1.offset; {14034#false} is VALID [2022-02-20 23:37:57,383 INFO L290 TraceCheckUtils]: 19: Hoare triple {14034#false} assume true; {14034#false} is VALID [2022-02-20 23:37:57,383 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {14034#false} {14061#(and (= |~#commands~0.offset| 0) (= |#funAddr~c1.offset| (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) (+ |~#commands~0.offset| 4))))} #101#return; {14034#false} is VALID [2022-02-20 23:37:57,383 INFO L272 TraceCheckUtils]: 21: Hoare triple {14034#false} call parse_input(4, 0); {14034#false} is VALID [2022-02-20 23:37:57,383 INFO L290 TraceCheckUtils]: 22: Hoare triple {14034#false} ~input#1.base, ~input#1.offset := #in~input#1.base, #in~input#1.offset;~i~0#1 := 0; {14034#false} is VALID [2022-02-20 23:37:57,383 INFO L290 TraceCheckUtils]: 23: Hoare triple {14034#false} assume !!(~i~0#1 < 2); {14034#false} is VALID [2022-02-20 23:37:57,383 INFO L290 TraceCheckUtils]: 24: Hoare triple {14034#false} SUMMARY for call #t~mem3#1.base, #t~mem3#1.offset := read~$Pointer$(~#commands~0.base, ~#commands~0.offset + 9 * ~i~0#1, 4); srcloc: L693 {14034#false} is VALID [2022-02-20 23:37:57,383 INFO L290 TraceCheckUtils]: 25: Hoare triple {14034#false} assume 1 == #valid[#t~mem3#1.base]; {14034#false} is VALID [2022-02-20 23:37:57,384 INFO L290 TraceCheckUtils]: 26: Hoare triple {14034#false} assume #t~mem3#1.offset < #length[#t~mem3#1.base] && #t~mem3#1.offset >= 0; {14034#false} is VALID [2022-02-20 23:37:57,384 INFO L290 TraceCheckUtils]: 27: Hoare triple {14034#false} assume !(1 == #valid[~input#1.base]); {14034#false} is VALID [2022-02-20 23:37:57,384 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:37:57,384 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:37:57,384 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1212736057] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:37:57,384 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-20 23:37:57,384 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 10 [2022-02-20 23:37:57,385 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612513672] [2022-02-20 23:37:57,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:37:57,385 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2022-02-20 23:37:57,385 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:37:57,385 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:37:57,404 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:37:57,404 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 23:37:57,405 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:37:57,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 23:37:57,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-02-20 23:37:57,405 INFO L87 Difference]: Start difference. First operand 321 states and 450 transitions. Second operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:37:57,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:37:57,677 INFO L93 Difference]: Finished difference Result 416 states and 561 transitions. [2022-02-20 23:37:57,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 23:37:57,678 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2022-02-20 23:37:57,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:37:57,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:37:57,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 104 transitions. [2022-02-20 23:37:57,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:37:57,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 104 transitions. [2022-02-20 23:37:57,680 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 104 transitions. [2022-02-20 23:37:57,754 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 23:37:57,761 INFO L225 Difference]: With dead ends: 416 [2022-02-20 23:37:57,761 INFO L226 Difference]: Without dead ends: 416 [2022-02-20 23:37:57,761 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2022-02-20 23:37:57,762 INFO L933 BasicCegarLoop]: 57 mSDtfsCounter, 131 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:37:57,762 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [131 Valid, 195 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:37:57,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 416 states. [2022-02-20 23:37:57,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 416 to 344. [2022-02-20 23:37:57,767 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:37:57,767 INFO L82 GeneralOperation]: Start isEquivalent. First operand 416 states. Second operand has 344 states, 302 states have (on average 1.4735099337748345) internal successors, (445), 327 states have internal predecessors, (445), 9 states have call successors, (9), 7 states have call predecessors, (9), 15 states have return successors, (27), 9 states have call predecessors, (27), 9 states have call successors, (27) [2022-02-20 23:37:57,768 INFO L74 IsIncluded]: Start isIncluded. First operand 416 states. Second operand has 344 states, 302 states have (on average 1.4735099337748345) internal successors, (445), 327 states have internal predecessors, (445), 9 states have call successors, (9), 7 states have call predecessors, (9), 15 states have return successors, (27), 9 states have call predecessors, (27), 9 states have call successors, (27) [2022-02-20 23:37:57,769 INFO L87 Difference]: Start difference. First operand 416 states. Second operand has 344 states, 302 states have (on average 1.4735099337748345) internal successors, (445), 327 states have internal predecessors, (445), 9 states have call successors, (9), 7 states have call predecessors, (9), 15 states have return successors, (27), 9 states have call predecessors, (27), 9 states have call successors, (27) [2022-02-20 23:37:57,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:37:57,782 INFO L93 Difference]: Finished difference Result 416 states and 561 transitions. [2022-02-20 23:37:57,782 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 561 transitions. [2022-02-20 23:37:57,783 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:37:57,783 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:37:57,784 INFO L74 IsIncluded]: Start isIncluded. First operand has 344 states, 302 states have (on average 1.4735099337748345) internal successors, (445), 327 states have internal predecessors, (445), 9 states have call successors, (9), 7 states have call predecessors, (9), 15 states have return successors, (27), 9 states have call predecessors, (27), 9 states have call successors, (27) Second operand 416 states. [2022-02-20 23:37:57,784 INFO L87 Difference]: Start difference. First operand has 344 states, 302 states have (on average 1.4735099337748345) internal successors, (445), 327 states have internal predecessors, (445), 9 states have call successors, (9), 7 states have call predecessors, (9), 15 states have return successors, (27), 9 states have call predecessors, (27), 9 states have call successors, (27) Second operand 416 states. [2022-02-20 23:37:57,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:37:57,792 INFO L93 Difference]: Finished difference Result 416 states and 561 transitions. [2022-02-20 23:37:57,792 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 561 transitions. [2022-02-20 23:37:57,793 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:37:57,793 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:37:57,793 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:37:57,794 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:37:57,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 344 states, 302 states have (on average 1.4735099337748345) internal successors, (445), 327 states have internal predecessors, (445), 9 states have call successors, (9), 7 states have call predecessors, (9), 15 states have return successors, (27), 9 states have call predecessors, (27), 9 states have call successors, (27) [2022-02-20 23:37:57,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 481 transitions. [2022-02-20 23:37:57,799 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 481 transitions. Word has length 28 [2022-02-20 23:37:57,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:37:57,799 INFO L470 AbstractCegarLoop]: Abstraction has 344 states and 481 transitions. [2022-02-20 23:37:57,799 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:37:57,799 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 481 transitions. [2022-02-20 23:37:57,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-02-20 23:37:57,801 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:37:57,802 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:37:57,820 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-02-20 23:37:58,020 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-02-20 23:37:58,022 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATION, parse_inputErr1REQUIRES_VIOLATION, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2022-02-20 23:37:58,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:37:58,023 INFO L85 PathProgramCache]: Analyzing trace with hash -221078483, now seen corresponding path program 1 times [2022-02-20 23:37:58,023 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:37:58,023 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086655791] [2022-02-20 23:37:58,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:37:58,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:37:58,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:37:58,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 23:37:58,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:37:58,350 INFO L290 TraceCheckUtils]: 0: Hoare triple {15769#(and (= ~global~0.base |old(~global~0.base)|) (= |old(#length)| |#length|) (= |old(~global~0.offset)| ~global~0.offset) (= ~state~0 |old(~state~0)|) (= |old(#valid)| |#valid|))} ~input#1.base, ~input#1.offset := #in~input#1.base, #in~input#1.offset;~i~0#1 := 0; {15770#(= |parse_input_~i~0#1| 0)} is VALID [2022-02-20 23:37:58,351 INFO L290 TraceCheckUtils]: 1: Hoare triple {15770#(= |parse_input_~i~0#1| 0)} assume !!(~i~0#1 < 2); {15770#(= |parse_input_~i~0#1| 0)} is VALID [2022-02-20 23:37:58,351 INFO L290 TraceCheckUtils]: 2: Hoare triple {15770#(= |parse_input_~i~0#1| 0)} SUMMARY for call #t~mem3#1.base, #t~mem3#1.offset := read~$Pointer$(~#commands~0.base, ~#commands~0.offset + 9 * ~i~0#1, 4); srcloc: L693 {15771#(and (or (not (= (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset|) 0)) (and (= (+ (* (- 1) |parse_input_#t~mem3#1.offset|) (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0)) 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) |parse_input_#t~mem3#1.base|))) (or (< 0 (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset|)) (= (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset|) 0)) (= |parse_input_~i~0#1| 0))} is VALID [2022-02-20 23:37:58,352 INFO L290 TraceCheckUtils]: 3: Hoare triple {15771#(and (or (not (= (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset|) 0)) (and (= (+ (* (- 1) |parse_input_#t~mem3#1.offset|) (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0)) 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) |parse_input_#t~mem3#1.base|))) (or (< 0 (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset|)) (= (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset|) 0)) (= |parse_input_~i~0#1| 0))} assume 1 == #valid[#t~mem3#1.base]; {15772#(and (or (not (= (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset|) 0)) (and (not (= (select |#valid| |parse_input_#t~mem3#1.base|) 0)) (= (+ (* (- 1) |parse_input_#t~mem3#1.offset|) (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0)) 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) |parse_input_#t~mem3#1.base|))) (or (< 0 (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset|)) (= (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset|) 0)) (= |parse_input_~i~0#1| 0))} is VALID [2022-02-20 23:37:58,353 INFO L290 TraceCheckUtils]: 4: Hoare triple {15772#(and (or (not (= (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset|) 0)) (and (not (= (select |#valid| |parse_input_#t~mem3#1.base|) 0)) (= (+ (* (- 1) |parse_input_#t~mem3#1.offset|) (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0)) 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) |parse_input_#t~mem3#1.base|))) (or (< 0 (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset|)) (= (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset|) 0)) (= |parse_input_~i~0#1| 0))} assume #t~mem3#1.offset < #length[#t~mem3#1.base] && #t~mem3#1.offset >= 0; {15773#(and (or (and (<= 0 (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0)) (not (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0)) 0)) (<= (+ (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) 1) (select |#length| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0)))) (not (= (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset|) 0))) (or (< 0 (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset|)) (= (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset|) 0)) (= |parse_input_~i~0#1| 0))} is VALID [2022-02-20 23:37:58,353 INFO L290 TraceCheckUtils]: 5: Hoare triple {15773#(and (or (and (<= 0 (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0)) (not (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0)) 0)) (<= (+ (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) 1) (select |#length| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0)))) (not (= (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset|) 0))) (or (< 0 (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset|)) (= (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset|) 0)) (= |parse_input_~i~0#1| 0))} assume 1 == #valid[~input#1.base]; {15773#(and (or (and (<= 0 (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0)) (not (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0)) 0)) (<= (+ (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) 1) (select |#length| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0)))) (not (= (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset|) 0))) (or (< 0 (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset|)) (= (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset|) 0)) (= |parse_input_~i~0#1| 0))} is VALID [2022-02-20 23:37:58,354 INFO L290 TraceCheckUtils]: 6: Hoare triple {15773#(and (or (and (<= 0 (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0)) (not (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0)) 0)) (<= (+ (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) 1) (select |#length| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0)))) (not (= (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset|) 0))) (or (< 0 (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset|)) (= (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset|) 0)) (= |parse_input_~i~0#1| 0))} assume ~input#1.offset < #length[~input#1.base] && ~input#1.offset >= 0; {15773#(and (or (and (<= 0 (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0)) (not (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0)) 0)) (<= (+ (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) 1) (select |#length| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0)))) (not (= (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset|) 0))) (or (< 0 (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset|)) (= (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset|) 0)) (= |parse_input_~i~0#1| 0))} is VALID [2022-02-20 23:37:58,355 INFO L290 TraceCheckUtils]: 7: Hoare triple {15773#(and (or (and (<= 0 (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0)) (not (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0)) 0)) (<= (+ (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) 1) (select |#length| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0)))) (not (= (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset|) 0))) (or (< 0 (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset|)) (= (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset|) 0)) (= |parse_input_~i~0#1| 0))} assume 0 == #t~nondet4#1;havoc #t~mem3#1.base, #t~mem3#1.offset;havoc #t~nondet4#1; {15773#(and (or (and (<= 0 (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0)) (not (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0)) 0)) (<= (+ (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) 1) (select |#length| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0)))) (not (= (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset|) 0))) (or (< 0 (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset|)) (= (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset|) 0)) (= |parse_input_~i~0#1| 0))} is VALID [2022-02-20 23:37:58,355 INFO L290 TraceCheckUtils]: 8: Hoare triple {15773#(and (or (and (<= 0 (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0)) (not (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0)) 0)) (<= (+ (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) 1) (select |#length| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0)))) (not (= (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset|) 0))) (or (< 0 (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset|)) (= (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset|) 0)) (= |parse_input_~i~0#1| 0))} SUMMARY for call #t~mem5#1 := read~int(~#commands~0.base, 8 + (~#commands~0.offset + 9 * ~i~0#1), 1); srcloc: L694 {15773#(and (or (and (<= 0 (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0)) (not (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0)) 0)) (<= (+ (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) 1) (select |#length| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0)))) (not (= (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset|) 0))) (or (< 0 (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset|)) (= (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset|) 0)) (= |parse_input_~i~0#1| 0))} is VALID [2022-02-20 23:37:58,356 INFO L290 TraceCheckUtils]: 9: Hoare triple {15773#(and (or (and (<= 0 (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0)) (not (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0)) 0)) (<= (+ (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) 1) (select |#length| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0)))) (not (= (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset|) 0))) (or (< 0 (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset|)) (= (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset|) 0)) (= |parse_input_~i~0#1| 0))} assume ~state~0 >= #t~mem5#1;havoc #t~mem5#1; {15773#(and (or (and (<= 0 (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0)) (not (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0)) 0)) (<= (+ (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) 1) (select |#length| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0)))) (not (= (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset|) 0))) (or (< 0 (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset|)) (= (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset|) 0)) (= |parse_input_~i~0#1| 0))} is VALID [2022-02-20 23:37:58,357 INFO L290 TraceCheckUtils]: 10: Hoare triple {15773#(and (or (and (<= 0 (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0)) (not (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0)) 0)) (<= (+ (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) 1) (select |#length| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0)))) (not (= (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset|) 0))) (or (< 0 (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset|)) (= (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset|) 0)) (= |parse_input_~i~0#1| 0))} SUMMARY for call #t~mem6#1.base, #t~mem6#1.offset := read~$Pointer$(~#commands~0.base, 4 + (~#commands~0.offset + 9 * ~i~0#1), 4); srcloc: L695 {15774#(or (and (<= 0 (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0)) (not (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0)) 0)) (<= (+ (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) 1) (select |#length| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0)))) (<= 1 |~#commands~0.offset|))} is VALID [2022-02-20 23:37:58,357 INFO L290 TraceCheckUtils]: 11: Hoare triple {15774#(or (and (<= 0 (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0)) (not (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0)) 0)) (<= (+ (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) 1) (select |#length| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0)))) (<= 1 |~#commands~0.offset|))} assume { :begin_inline_##fun~~TO~VOID } true;##fun~~TO~VOID_#in~#fp#1.base, ##fun~~TO~VOID_#in~#fp#1.offset := #t~mem6#1.base, #t~mem6#1.offset; {15774#(or (and (<= 0 (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0)) (not (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0)) 0)) (<= (+ (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) 1) (select |#length| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0)))) (<= 1 |~#commands~0.offset|))} is VALID [2022-02-20 23:37:58,358 INFO L290 TraceCheckUtils]: 12: Hoare triple {15774#(or (and (<= 0 (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0)) (not (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0)) 0)) (<= (+ (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) 1) (select |#length| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0)))) (<= 1 |~#commands~0.offset|))} assume !(##fun~~TO~VOID_#in~#fp#1.base == #funAddr~c2.base && ##fun~~TO~VOID_#in~#fp#1.offset == #funAddr~c2.offset);assume { :begin_inline_c1 } true;havoc c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset, c1_~x~0#1.base, c1_~x~0#1.offset;call c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset := #Ultimate.allocOnHeap(1);c1_~x~0#1.base, c1_~x~0#1.offset := c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset;havoc c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset; {15775#(or (and (<= 0 (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0)) (<= (+ (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) 1) (select |#length| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0)))) (<= 1 |~#commands~0.offset|))} is VALID [2022-02-20 23:37:58,358 INFO L290 TraceCheckUtils]: 13: Hoare triple {15775#(or (and (<= 0 (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0)) (<= (+ (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) 1) (select |#length| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0)))) (<= 1 |~#commands~0.offset|))} assume !(c1_~x~0#1.base == 0 && c1_~x~0#1.offset == 0); {15775#(or (and (<= 0 (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0)) (<= (+ (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) 1) (select |#length| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0)))) (<= 1 |~#commands~0.offset|))} is VALID [2022-02-20 23:37:58,359 INFO L290 TraceCheckUtils]: 14: Hoare triple {15775#(or (and (<= 0 (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0)) (<= (+ (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) 1) (select |#length| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0)))) (<= 1 |~#commands~0.offset|))} assume !(~global~0.base != 0 || ~global~0.offset != 0); {15775#(or (and (<= 0 (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0)) (<= (+ (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) 1) (select |#length| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0)))) (<= 1 |~#commands~0.offset|))} is VALID [2022-02-20 23:37:58,359 INFO L290 TraceCheckUtils]: 15: Hoare triple {15775#(or (and (<= 0 (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0)) (<= (+ (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) 1) (select |#length| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0)))) (<= 1 |~#commands~0.offset|))} ~global~0.base, ~global~0.offset := c1_~x~0#1.base, c1_~x~0#1.offset;~state~0 := ~unnamed3~0~STATE_2; {15775#(or (and (<= 0 (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0)) (<= (+ (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) 1) (select |#length| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0)))) (<= 1 |~#commands~0.offset|))} is VALID [2022-02-20 23:37:58,360 INFO L290 TraceCheckUtils]: 16: Hoare triple {15775#(or (and (<= 0 (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0)) (<= (+ (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) 1) (select |#length| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0)))) (<= 1 |~#commands~0.offset|))} assume { :end_inline_c1 } true; {15775#(or (and (<= 0 (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0)) (<= (+ (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) 1) (select |#length| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0)))) (<= 1 |~#commands~0.offset|))} is VALID [2022-02-20 23:37:58,360 INFO L290 TraceCheckUtils]: 17: Hoare triple {15775#(or (and (<= 0 (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0)) (<= (+ (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) 1) (select |#length| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0)))) (<= 1 |~#commands~0.offset|))} assume { :end_inline_##fun~~TO~VOID } true;havoc #t~mem6#1.base, #t~mem6#1.offset; {15775#(or (and (<= 0 (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0)) (<= (+ (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) 1) (select |#length| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0)))) (<= 1 |~#commands~0.offset|))} is VALID [2022-02-20 23:37:58,361 INFO L290 TraceCheckUtils]: 18: Hoare triple {15775#(or (and (<= 0 (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0)) (<= (+ (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) 1) (select |#length| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0)))) (<= 1 |~#commands~0.offset|))} assume true; {15775#(or (and (<= 0 (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0)) (<= (+ (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) 1) (select |#length| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0)))) (<= 1 |~#commands~0.offset|))} is VALID [2022-02-20 23:37:58,362 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {15775#(or (and (<= 0 (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0)) (<= (+ (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) 1) (select |#length| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0)))) (<= 1 |~#commands~0.offset|))} {15745#(and (<= 0 |~#commands~0.offset|) (<= |~#commands~0.offset| 0))} #101#return; {15766#(and (<= 0 (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0)) (<= (+ (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) 1) (select |#length| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0))) (<= 0 |~#commands~0.offset|) (<= |~#commands~0.offset| 0))} is VALID [2022-02-20 23:37:58,363 INFO L290 TraceCheckUtils]: 0: Hoare triple {15743#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(3, 1);call write~init~int(99, 1, 0, 1);call write~init~int(49, 1, 1, 1);call write~init~int(0, 1, 2, 1);call #Ultimate.allocInit(3, 2);call write~init~int(99, 2, 0, 1);call write~init~int(50, 2, 1, 1);call write~init~int(0, 2, 2, 1);call #Ultimate.allocInit(3, 3);call write~init~int(99, 3, 0, 1);call write~init~int(49, 3, 1, 1);call write~init~int(0, 3, 2, 1);call #Ultimate.allocInit(3, 4);call write~init~int(99, 4, 0, 1);call write~init~int(49, 4, 1, 1);call write~init~int(0, 4, 2, 1);call #Ultimate.allocInit(3, 5);call write~init~int(99, 5, 0, 1);call write~init~int(50, 5, 1, 1);call write~init~int(0, 5, 2, 1);~state~0 := ~unnamed3~0~STATE_1;~global~0.base, ~global~0.offset := 0, 0;~#commands~0.base, ~#commands~0.offset := 6, 0;call #Ultimate.allocInit(18, 6);call write~init~$Pointer$(1, 0, ~#commands~0.base, ~#commands~0.offset, 4);call write~init~$Pointer$(#funAddr~c1.base, #funAddr~c1.offset, ~#commands~0.base, 4 + ~#commands~0.offset, 4);call write~init~int((if ~unnamed3~0~STATE_1 % 256 <= 127 then ~unnamed3~0~STATE_1 % 256 else ~unnamed3~0~STATE_1 % 256 - 256), ~#commands~0.base, 8 + ~#commands~0.offset, 1);call write~init~$Pointer$(2, 0, ~#commands~0.base, 9 + ~#commands~0.offset, 4);call write~init~$Pointer$(#funAddr~c2.base, #funAddr~c2.offset, ~#commands~0.base, 13 + ~#commands~0.offset, 4);call write~init~int((if ~unnamed3~0~STATE_2 % 256 <= 127 then ~unnamed3~0~STATE_2 % 256 else ~unnamed3~0~STATE_2 % 256 - 256), ~#commands~0.base, 17 + ~#commands~0.offset, 1); {15745#(and (<= 0 |~#commands~0.offset|) (<= |~#commands~0.offset| 0))} is VALID [2022-02-20 23:37:58,363 INFO L290 TraceCheckUtils]: 1: Hoare triple {15745#(and (<= 0 |~#commands~0.offset|) (<= |~#commands~0.offset| 0))} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1; {15745#(and (<= 0 |~#commands~0.offset|) (<= |~#commands~0.offset| 0))} is VALID [2022-02-20 23:37:58,364 INFO L272 TraceCheckUtils]: 2: Hoare triple {15745#(and (<= 0 |~#commands~0.offset|) (<= |~#commands~0.offset| 0))} call parse_input(3, 0); {15769#(and (= ~global~0.base |old(~global~0.base)|) (= |old(#length)| |#length|) (= |old(~global~0.offset)| ~global~0.offset) (= ~state~0 |old(~state~0)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 23:37:58,364 INFO L290 TraceCheckUtils]: 3: Hoare triple {15769#(and (= ~global~0.base |old(~global~0.base)|) (= |old(#length)| |#length|) (= |old(~global~0.offset)| ~global~0.offset) (= ~state~0 |old(~state~0)|) (= |old(#valid)| |#valid|))} ~input#1.base, ~input#1.offset := #in~input#1.base, #in~input#1.offset;~i~0#1 := 0; {15770#(= |parse_input_~i~0#1| 0)} is VALID [2022-02-20 23:37:58,364 INFO L290 TraceCheckUtils]: 4: Hoare triple {15770#(= |parse_input_~i~0#1| 0)} assume !!(~i~0#1 < 2); {15770#(= |parse_input_~i~0#1| 0)} is VALID [2022-02-20 23:37:58,365 INFO L290 TraceCheckUtils]: 5: Hoare triple {15770#(= |parse_input_~i~0#1| 0)} SUMMARY for call #t~mem3#1.base, #t~mem3#1.offset := read~$Pointer$(~#commands~0.base, ~#commands~0.offset + 9 * ~i~0#1, 4); srcloc: L693 {15771#(and (or (not (= (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset|) 0)) (and (= (+ (* (- 1) |parse_input_#t~mem3#1.offset|) (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0)) 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) |parse_input_#t~mem3#1.base|))) (or (< 0 (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset|)) (= (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset|) 0)) (= |parse_input_~i~0#1| 0))} is VALID [2022-02-20 23:37:58,365 INFO L290 TraceCheckUtils]: 6: Hoare triple {15771#(and (or (not (= (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset|) 0)) (and (= (+ (* (- 1) |parse_input_#t~mem3#1.offset|) (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0)) 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) |parse_input_#t~mem3#1.base|))) (or (< 0 (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset|)) (= (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset|) 0)) (= |parse_input_~i~0#1| 0))} assume 1 == #valid[#t~mem3#1.base]; {15772#(and (or (not (= (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset|) 0)) (and (not (= (select |#valid| |parse_input_#t~mem3#1.base|) 0)) (= (+ (* (- 1) |parse_input_#t~mem3#1.offset|) (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0)) 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) |parse_input_#t~mem3#1.base|))) (or (< 0 (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset|)) (= (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset|) 0)) (= |parse_input_~i~0#1| 0))} is VALID [2022-02-20 23:37:58,366 INFO L290 TraceCheckUtils]: 7: Hoare triple {15772#(and (or (not (= (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset|) 0)) (and (not (= (select |#valid| |parse_input_#t~mem3#1.base|) 0)) (= (+ (* (- 1) |parse_input_#t~mem3#1.offset|) (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0)) 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) |parse_input_#t~mem3#1.base|))) (or (< 0 (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset|)) (= (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset|) 0)) (= |parse_input_~i~0#1| 0))} assume #t~mem3#1.offset < #length[#t~mem3#1.base] && #t~mem3#1.offset >= 0; {15773#(and (or (and (<= 0 (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0)) (not (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0)) 0)) (<= (+ (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) 1) (select |#length| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0)))) (not (= (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset|) 0))) (or (< 0 (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset|)) (= (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset|) 0)) (= |parse_input_~i~0#1| 0))} is VALID [2022-02-20 23:37:58,367 INFO L290 TraceCheckUtils]: 8: Hoare triple {15773#(and (or (and (<= 0 (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0)) (not (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0)) 0)) (<= (+ (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) 1) (select |#length| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0)))) (not (= (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset|) 0))) (or (< 0 (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset|)) (= (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset|) 0)) (= |parse_input_~i~0#1| 0))} assume 1 == #valid[~input#1.base]; {15773#(and (or (and (<= 0 (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0)) (not (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0)) 0)) (<= (+ (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) 1) (select |#length| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0)))) (not (= (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset|) 0))) (or (< 0 (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset|)) (= (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset|) 0)) (= |parse_input_~i~0#1| 0))} is VALID [2022-02-20 23:37:58,367 INFO L290 TraceCheckUtils]: 9: Hoare triple {15773#(and (or (and (<= 0 (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0)) (not (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0)) 0)) (<= (+ (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) 1) (select |#length| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0)))) (not (= (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset|) 0))) (or (< 0 (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset|)) (= (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset|) 0)) (= |parse_input_~i~0#1| 0))} assume ~input#1.offset < #length[~input#1.base] && ~input#1.offset >= 0; {15773#(and (or (and (<= 0 (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0)) (not (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0)) 0)) (<= (+ (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) 1) (select |#length| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0)))) (not (= (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset|) 0))) (or (< 0 (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset|)) (= (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset|) 0)) (= |parse_input_~i~0#1| 0))} is VALID [2022-02-20 23:37:58,368 INFO L290 TraceCheckUtils]: 10: Hoare triple {15773#(and (or (and (<= 0 (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0)) (not (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0)) 0)) (<= (+ (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) 1) (select |#length| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0)))) (not (= (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset|) 0))) (or (< 0 (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset|)) (= (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset|) 0)) (= |parse_input_~i~0#1| 0))} assume 0 == #t~nondet4#1;havoc #t~mem3#1.base, #t~mem3#1.offset;havoc #t~nondet4#1; {15773#(and (or (and (<= 0 (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0)) (not (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0)) 0)) (<= (+ (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) 1) (select |#length| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0)))) (not (= (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset|) 0))) (or (< 0 (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset|)) (= (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset|) 0)) (= |parse_input_~i~0#1| 0))} is VALID [2022-02-20 23:37:58,369 INFO L290 TraceCheckUtils]: 11: Hoare triple {15773#(and (or (and (<= 0 (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0)) (not (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0)) 0)) (<= (+ (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) 1) (select |#length| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0)))) (not (= (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset|) 0))) (or (< 0 (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset|)) (= (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset|) 0)) (= |parse_input_~i~0#1| 0))} SUMMARY for call #t~mem5#1 := read~int(~#commands~0.base, 8 + (~#commands~0.offset + 9 * ~i~0#1), 1); srcloc: L694 {15773#(and (or (and (<= 0 (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0)) (not (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0)) 0)) (<= (+ (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) 1) (select |#length| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0)))) (not (= (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset|) 0))) (or (< 0 (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset|)) (= (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset|) 0)) (= |parse_input_~i~0#1| 0))} is VALID [2022-02-20 23:37:58,369 INFO L290 TraceCheckUtils]: 12: Hoare triple {15773#(and (or (and (<= 0 (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0)) (not (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0)) 0)) (<= (+ (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) 1) (select |#length| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0)))) (not (= (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset|) 0))) (or (< 0 (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset|)) (= (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset|) 0)) (= |parse_input_~i~0#1| 0))} assume ~state~0 >= #t~mem5#1;havoc #t~mem5#1; {15773#(and (or (and (<= 0 (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0)) (not (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0)) 0)) (<= (+ (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) 1) (select |#length| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0)))) (not (= (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset|) 0))) (or (< 0 (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset|)) (= (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset|) 0)) (= |parse_input_~i~0#1| 0))} is VALID [2022-02-20 23:37:58,370 INFO L290 TraceCheckUtils]: 13: Hoare triple {15773#(and (or (and (<= 0 (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0)) (not (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0)) 0)) (<= (+ (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) 1) (select |#length| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0)))) (not (= (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset|) 0))) (or (< 0 (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset|)) (= (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset|) 0)) (= |parse_input_~i~0#1| 0))} SUMMARY for call #t~mem6#1.base, #t~mem6#1.offset := read~$Pointer$(~#commands~0.base, 4 + (~#commands~0.offset + 9 * ~i~0#1), 4); srcloc: L695 {15774#(or (and (<= 0 (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0)) (not (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0)) 0)) (<= (+ (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) 1) (select |#length| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0)))) (<= 1 |~#commands~0.offset|))} is VALID [2022-02-20 23:37:58,370 INFO L290 TraceCheckUtils]: 14: Hoare triple {15774#(or (and (<= 0 (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0)) (not (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0)) 0)) (<= (+ (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) 1) (select |#length| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0)))) (<= 1 |~#commands~0.offset|))} assume { :begin_inline_##fun~~TO~VOID } true;##fun~~TO~VOID_#in~#fp#1.base, ##fun~~TO~VOID_#in~#fp#1.offset := #t~mem6#1.base, #t~mem6#1.offset; {15774#(or (and (<= 0 (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0)) (not (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0)) 0)) (<= (+ (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) 1) (select |#length| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0)))) (<= 1 |~#commands~0.offset|))} is VALID [2022-02-20 23:37:58,371 INFO L290 TraceCheckUtils]: 15: Hoare triple {15774#(or (and (<= 0 (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0)) (not (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0)) 0)) (<= (+ (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) 1) (select |#length| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0)))) (<= 1 |~#commands~0.offset|))} assume !(##fun~~TO~VOID_#in~#fp#1.base == #funAddr~c2.base && ##fun~~TO~VOID_#in~#fp#1.offset == #funAddr~c2.offset);assume { :begin_inline_c1 } true;havoc c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset, c1_~x~0#1.base, c1_~x~0#1.offset;call c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset := #Ultimate.allocOnHeap(1);c1_~x~0#1.base, c1_~x~0#1.offset := c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset;havoc c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset; {15775#(or (and (<= 0 (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0)) (<= (+ (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) 1) (select |#length| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0)))) (<= 1 |~#commands~0.offset|))} is VALID [2022-02-20 23:37:58,372 INFO L290 TraceCheckUtils]: 16: Hoare triple {15775#(or (and (<= 0 (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0)) (<= (+ (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) 1) (select |#length| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0)))) (<= 1 |~#commands~0.offset|))} assume !(c1_~x~0#1.base == 0 && c1_~x~0#1.offset == 0); {15775#(or (and (<= 0 (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0)) (<= (+ (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) 1) (select |#length| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0)))) (<= 1 |~#commands~0.offset|))} is VALID [2022-02-20 23:37:58,372 INFO L290 TraceCheckUtils]: 17: Hoare triple {15775#(or (and (<= 0 (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0)) (<= (+ (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) 1) (select |#length| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0)))) (<= 1 |~#commands~0.offset|))} assume !(~global~0.base != 0 || ~global~0.offset != 0); {15775#(or (and (<= 0 (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0)) (<= (+ (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) 1) (select |#length| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0)))) (<= 1 |~#commands~0.offset|))} is VALID [2022-02-20 23:37:58,373 INFO L290 TraceCheckUtils]: 18: Hoare triple {15775#(or (and (<= 0 (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0)) (<= (+ (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) 1) (select |#length| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0)))) (<= 1 |~#commands~0.offset|))} ~global~0.base, ~global~0.offset := c1_~x~0#1.base, c1_~x~0#1.offset;~state~0 := ~unnamed3~0~STATE_2; {15775#(or (and (<= 0 (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0)) (<= (+ (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) 1) (select |#length| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0)))) (<= 1 |~#commands~0.offset|))} is VALID [2022-02-20 23:37:58,373 INFO L290 TraceCheckUtils]: 19: Hoare triple {15775#(or (and (<= 0 (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0)) (<= (+ (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) 1) (select |#length| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0)))) (<= 1 |~#commands~0.offset|))} assume { :end_inline_c1 } true; {15775#(or (and (<= 0 (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0)) (<= (+ (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) 1) (select |#length| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0)))) (<= 1 |~#commands~0.offset|))} is VALID [2022-02-20 23:37:58,373 INFO L290 TraceCheckUtils]: 20: Hoare triple {15775#(or (and (<= 0 (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0)) (<= (+ (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) 1) (select |#length| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0)))) (<= 1 |~#commands~0.offset|))} assume { :end_inline_##fun~~TO~VOID } true;havoc #t~mem6#1.base, #t~mem6#1.offset; {15775#(or (and (<= 0 (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0)) (<= (+ (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) 1) (select |#length| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0)))) (<= 1 |~#commands~0.offset|))} is VALID [2022-02-20 23:37:58,374 INFO L290 TraceCheckUtils]: 21: Hoare triple {15775#(or (and (<= 0 (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0)) (<= (+ (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) 1) (select |#length| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0)))) (<= 1 |~#commands~0.offset|))} assume true; {15775#(or (and (<= 0 (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0)) (<= (+ (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) 1) (select |#length| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0)))) (<= 1 |~#commands~0.offset|))} is VALID [2022-02-20 23:37:58,375 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {15775#(or (and (<= 0 (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0)) (<= (+ (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) 1) (select |#length| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0)))) (<= 1 |~#commands~0.offset|))} {15745#(and (<= 0 |~#commands~0.offset|) (<= |~#commands~0.offset| 0))} #101#return; {15766#(and (<= 0 (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0)) (<= (+ (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) 1) (select |#length| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0))) (<= 0 |~#commands~0.offset|) (<= |~#commands~0.offset| 0))} is VALID [2022-02-20 23:37:58,375 INFO L272 TraceCheckUtils]: 23: Hoare triple {15766#(and (<= 0 (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0)) (<= (+ (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) 1) (select |#length| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0))) (<= 0 |~#commands~0.offset|) (<= |~#commands~0.offset| 0))} call parse_input(4, 0); {15766#(and (<= 0 (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0)) (<= (+ (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) 1) (select |#length| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0))) (<= 0 |~#commands~0.offset|) (<= |~#commands~0.offset| 0))} is VALID [2022-02-20 23:37:58,376 INFO L290 TraceCheckUtils]: 24: Hoare triple {15766#(and (<= 0 (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0)) (<= (+ (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) 1) (select |#length| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0))) (<= 0 |~#commands~0.offset|) (<= |~#commands~0.offset| 0))} ~input#1.base, ~input#1.offset := #in~input#1.base, #in~input#1.offset;~i~0#1 := 0; {15767#(and (<= 0 (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset|))) (= (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset|) 0) (= |parse_input_~i~0#1| 0) (<= (+ (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset|)) 1) (select |#length| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset|)))))} is VALID [2022-02-20 23:37:58,376 INFO L290 TraceCheckUtils]: 25: Hoare triple {15767#(and (<= 0 (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset|))) (= (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset|) 0) (= |parse_input_~i~0#1| 0) (<= (+ (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset|)) 1) (select |#length| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset|)))))} assume !!(~i~0#1 < 2); {15767#(and (<= 0 (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset|))) (= (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset|) 0) (= |parse_input_~i~0#1| 0) (<= (+ (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset|)) 1) (select |#length| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset|)))))} is VALID [2022-02-20 23:37:58,377 INFO L290 TraceCheckUtils]: 26: Hoare triple {15767#(and (<= 0 (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset|))) (= (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset|) 0) (= |parse_input_~i~0#1| 0) (<= (+ (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset|)) 1) (select |#length| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset|)))))} SUMMARY for call #t~mem3#1.base, #t~mem3#1.offset := read~$Pointer$(~#commands~0.base, ~#commands~0.offset + 9 * ~i~0#1, 4); srcloc: L693 {15768#(and (<= (+ |parse_input_#t~mem3#1.offset| 1) (select |#length| |parse_input_#t~mem3#1.base|)) (<= 0 |parse_input_#t~mem3#1.offset|))} is VALID [2022-02-20 23:37:58,377 INFO L290 TraceCheckUtils]: 27: Hoare triple {15768#(and (<= (+ |parse_input_#t~mem3#1.offset| 1) (select |#length| |parse_input_#t~mem3#1.base|)) (<= 0 |parse_input_#t~mem3#1.offset|))} assume 1 == #valid[#t~mem3#1.base]; {15768#(and (<= (+ |parse_input_#t~mem3#1.offset| 1) (select |#length| |parse_input_#t~mem3#1.base|)) (<= 0 |parse_input_#t~mem3#1.offset|))} is VALID [2022-02-20 23:37:58,378 INFO L290 TraceCheckUtils]: 28: Hoare triple {15768#(and (<= (+ |parse_input_#t~mem3#1.offset| 1) (select |#length| |parse_input_#t~mem3#1.base|)) (<= 0 |parse_input_#t~mem3#1.offset|))} assume !(#t~mem3#1.offset < #length[#t~mem3#1.base] && #t~mem3#1.offset >= 0); {15744#false} is VALID [2022-02-20 23:37:58,378 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:37:58,378 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:37:58,378 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086655791] [2022-02-20 23:37:58,378 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2086655791] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 23:37:58,378 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1446896856] [2022-02-20 23:37:58,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:37:58,378 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:37:58,379 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:37:58,379 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 23:37:58,380 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-02-20 23:37:58,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:37:58,463 INFO L263 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 25 conjunts are in the unsatisfiable core [2022-02-20 23:37:58,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:37:58,475 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:37:59,027 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:37:59,029 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-02-20 23:37:59,132 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-02-20 23:37:59,139 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-02-20 23:37:59,167 INFO L290 TraceCheckUtils]: 0: Hoare triple {15743#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(3, 1);call write~init~int(99, 1, 0, 1);call write~init~int(49, 1, 1, 1);call write~init~int(0, 1, 2, 1);call #Ultimate.allocInit(3, 2);call write~init~int(99, 2, 0, 1);call write~init~int(50, 2, 1, 1);call write~init~int(0, 2, 2, 1);call #Ultimate.allocInit(3, 3);call write~init~int(99, 3, 0, 1);call write~init~int(49, 3, 1, 1);call write~init~int(0, 3, 2, 1);call #Ultimate.allocInit(3, 4);call write~init~int(99, 4, 0, 1);call write~init~int(49, 4, 1, 1);call write~init~int(0, 4, 2, 1);call #Ultimate.allocInit(3, 5);call write~init~int(99, 5, 0, 1);call write~init~int(50, 5, 1, 1);call write~init~int(0, 5, 2, 1);~state~0 := ~unnamed3~0~STATE_1;~global~0.base, ~global~0.offset := 0, 0;~#commands~0.base, ~#commands~0.offset := 6, 0;call #Ultimate.allocInit(18, 6);call write~init~$Pointer$(1, 0, ~#commands~0.base, ~#commands~0.offset, 4);call write~init~$Pointer$(#funAddr~c1.base, #funAddr~c1.offset, ~#commands~0.base, 4 + ~#commands~0.offset, 4);call write~init~int((if ~unnamed3~0~STATE_1 % 256 <= 127 then ~unnamed3~0~STATE_1 % 256 else ~unnamed3~0~STATE_1 % 256 - 256), ~#commands~0.base, 8 + ~#commands~0.offset, 1);call write~init~$Pointer$(2, 0, ~#commands~0.base, 9 + ~#commands~0.offset, 4);call write~init~$Pointer$(#funAddr~c2.base, #funAddr~c2.offset, ~#commands~0.base, 13 + ~#commands~0.offset, 4);call write~init~int((if ~unnamed3~0~STATE_2 % 256 <= 127 then ~unnamed3~0~STATE_2 % 256 else ~unnamed3~0~STATE_2 % 256 - 256), ~#commands~0.base, 17 + ~#commands~0.offset, 1); {15779#(and (<= 3 (select |#length| 1)) (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0) (= (select |#valid| 1) 1) (= |~#commands~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1))} is VALID [2022-02-20 23:37:59,168 INFO L290 TraceCheckUtils]: 1: Hoare triple {15779#(and (<= 3 (select |#length| 1)) (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0) (= (select |#valid| 1) 1) (= |~#commands~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1))} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1; {15779#(and (<= 3 (select |#length| 1)) (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0) (= (select |#valid| 1) 1) (= |~#commands~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1))} is VALID [2022-02-20 23:37:59,169 INFO L272 TraceCheckUtils]: 2: Hoare triple {15779#(and (<= 3 (select |#length| 1)) (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0) (= (select |#valid| 1) 1) (= |~#commands~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1))} call parse_input(3, 0); {15786#(and (= |old(#length)| |#length|) (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0) (= |~#commands~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 23:37:59,169 INFO L290 TraceCheckUtils]: 3: Hoare triple {15786#(and (= |old(#length)| |#length|) (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0) (= |~#commands~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1) (= |old(#valid)| |#valid|))} ~input#1.base, ~input#1.offset := #in~input#1.base, #in~input#1.offset;~i~0#1 := 0; {15786#(and (= |old(#length)| |#length|) (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0) (= |~#commands~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 23:37:59,170 INFO L290 TraceCheckUtils]: 4: Hoare triple {15786#(and (= |old(#length)| |#length|) (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0) (= |~#commands~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1) (= |old(#valid)| |#valid|))} assume !!(~i~0#1 < 2); {15786#(and (= |old(#length)| |#length|) (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0) (= |~#commands~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 23:37:59,170 INFO L290 TraceCheckUtils]: 5: Hoare triple {15786#(and (= |old(#length)| |#length|) (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0) (= |~#commands~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1) (= |old(#valid)| |#valid|))} SUMMARY for call #t~mem3#1.base, #t~mem3#1.offset := read~$Pointer$(~#commands~0.base, ~#commands~0.offset + 9 * ~i~0#1, 4); srcloc: L693 {15786#(and (= |old(#length)| |#length|) (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0) (= |~#commands~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 23:37:59,171 INFO L290 TraceCheckUtils]: 6: Hoare triple {15786#(and (= |old(#length)| |#length|) (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0) (= |~#commands~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1) (= |old(#valid)| |#valid|))} assume 1 == #valid[#t~mem3#1.base]; {15786#(and (= |old(#length)| |#length|) (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0) (= |~#commands~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 23:37:59,171 INFO L290 TraceCheckUtils]: 7: Hoare triple {15786#(and (= |old(#length)| |#length|) (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0) (= |~#commands~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1) (= |old(#valid)| |#valid|))} assume #t~mem3#1.offset < #length[#t~mem3#1.base] && #t~mem3#1.offset >= 0; {15786#(and (= |old(#length)| |#length|) (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0) (= |~#commands~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 23:37:59,171 INFO L290 TraceCheckUtils]: 8: Hoare triple {15786#(and (= |old(#length)| |#length|) (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0) (= |~#commands~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1) (= |old(#valid)| |#valid|))} assume 1 == #valid[~input#1.base]; {15786#(and (= |old(#length)| |#length|) (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0) (= |~#commands~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 23:37:59,172 INFO L290 TraceCheckUtils]: 9: Hoare triple {15786#(and (= |old(#length)| |#length|) (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0) (= |~#commands~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1) (= |old(#valid)| |#valid|))} assume ~input#1.offset < #length[~input#1.base] && ~input#1.offset >= 0; {15786#(and (= |old(#length)| |#length|) (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0) (= |~#commands~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 23:37:59,172 INFO L290 TraceCheckUtils]: 10: Hoare triple {15786#(and (= |old(#length)| |#length|) (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0) (= |~#commands~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1) (= |old(#valid)| |#valid|))} assume 0 == #t~nondet4#1;havoc #t~mem3#1.base, #t~mem3#1.offset;havoc #t~nondet4#1; {15786#(and (= |old(#length)| |#length|) (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0) (= |~#commands~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 23:37:59,173 INFO L290 TraceCheckUtils]: 11: Hoare triple {15786#(and (= |old(#length)| |#length|) (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0) (= |~#commands~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1) (= |old(#valid)| |#valid|))} SUMMARY for call #t~mem5#1 := read~int(~#commands~0.base, 8 + (~#commands~0.offset + 9 * ~i~0#1), 1); srcloc: L694 {15786#(and (= |old(#length)| |#length|) (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0) (= |~#commands~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 23:37:59,173 INFO L290 TraceCheckUtils]: 12: Hoare triple {15786#(and (= |old(#length)| |#length|) (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0) (= |~#commands~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1) (= |old(#valid)| |#valid|))} assume ~state~0 >= #t~mem5#1;havoc #t~mem5#1; {15786#(and (= |old(#length)| |#length|) (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0) (= |~#commands~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 23:37:59,174 INFO L290 TraceCheckUtils]: 13: Hoare triple {15786#(and (= |old(#length)| |#length|) (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0) (= |~#commands~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1) (= |old(#valid)| |#valid|))} SUMMARY for call #t~mem6#1.base, #t~mem6#1.offset := read~$Pointer$(~#commands~0.base, 4 + (~#commands~0.offset + 9 * ~i~0#1), 4); srcloc: L695 {15786#(and (= |old(#length)| |#length|) (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0) (= |~#commands~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 23:37:59,174 INFO L290 TraceCheckUtils]: 14: Hoare triple {15786#(and (= |old(#length)| |#length|) (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0) (= |~#commands~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1) (= |old(#valid)| |#valid|))} assume { :begin_inline_##fun~~TO~VOID } true;##fun~~TO~VOID_#in~#fp#1.base, ##fun~~TO~VOID_#in~#fp#1.offset := #t~mem6#1.base, #t~mem6#1.offset; {15786#(and (= |old(#length)| |#length|) (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0) (= |~#commands~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 23:37:59,175 INFO L290 TraceCheckUtils]: 15: Hoare triple {15786#(and (= |old(#length)| |#length|) (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0) (= |~#commands~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1) (= |old(#valid)| |#valid|))} assume !(##fun~~TO~VOID_#in~#fp#1.base == #funAddr~c2.base && ##fun~~TO~VOID_#in~#fp#1.offset == #funAddr~c2.offset);assume { :begin_inline_c1 } true;havoc c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset, c1_~x~0#1.base, c1_~x~0#1.offset;call c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset := #Ultimate.allocOnHeap(1);c1_~x~0#1.base, c1_~x~0#1.offset := c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset;havoc c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset; {15826#(and (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0) (= |~#commands~0.offset| 0) (exists ((|parse_input_c1_~x~0#1.base| Int) (v_ArrVal_21 Int)) (and (= (store |old(#length)| |parse_input_c1_~x~0#1.base| v_ArrVal_21) |#length|) (= (select |old(#valid)| |parse_input_c1_~x~0#1.base|) 0))) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1))} is VALID [2022-02-20 23:37:59,175 INFO L290 TraceCheckUtils]: 16: Hoare triple {15826#(and (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0) (= |~#commands~0.offset| 0) (exists ((|parse_input_c1_~x~0#1.base| Int) (v_ArrVal_21 Int)) (and (= (store |old(#length)| |parse_input_c1_~x~0#1.base| v_ArrVal_21) |#length|) (= (select |old(#valid)| |parse_input_c1_~x~0#1.base|) 0))) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1))} assume !(c1_~x~0#1.base == 0 && c1_~x~0#1.offset == 0); {15826#(and (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0) (= |~#commands~0.offset| 0) (exists ((|parse_input_c1_~x~0#1.base| Int) (v_ArrVal_21 Int)) (and (= (store |old(#length)| |parse_input_c1_~x~0#1.base| v_ArrVal_21) |#length|) (= (select |old(#valid)| |parse_input_c1_~x~0#1.base|) 0))) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1))} is VALID [2022-02-20 23:37:59,176 INFO L290 TraceCheckUtils]: 17: Hoare triple {15826#(and (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0) (= |~#commands~0.offset| 0) (exists ((|parse_input_c1_~x~0#1.base| Int) (v_ArrVal_21 Int)) (and (= (store |old(#length)| |parse_input_c1_~x~0#1.base| v_ArrVal_21) |#length|) (= (select |old(#valid)| |parse_input_c1_~x~0#1.base|) 0))) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1))} assume !(~global~0.base != 0 || ~global~0.offset != 0); {15826#(and (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0) (= |~#commands~0.offset| 0) (exists ((|parse_input_c1_~x~0#1.base| Int) (v_ArrVal_21 Int)) (and (= (store |old(#length)| |parse_input_c1_~x~0#1.base| v_ArrVal_21) |#length|) (= (select |old(#valid)| |parse_input_c1_~x~0#1.base|) 0))) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1))} is VALID [2022-02-20 23:37:59,177 INFO L290 TraceCheckUtils]: 18: Hoare triple {15826#(and (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0) (= |~#commands~0.offset| 0) (exists ((|parse_input_c1_~x~0#1.base| Int) (v_ArrVal_21 Int)) (and (= (store |old(#length)| |parse_input_c1_~x~0#1.base| v_ArrVal_21) |#length|) (= (select |old(#valid)| |parse_input_c1_~x~0#1.base|) 0))) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1))} ~global~0.base, ~global~0.offset := c1_~x~0#1.base, c1_~x~0#1.offset;~state~0 := ~unnamed3~0~STATE_2; {15826#(and (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0) (= |~#commands~0.offset| 0) (exists ((|parse_input_c1_~x~0#1.base| Int) (v_ArrVal_21 Int)) (and (= (store |old(#length)| |parse_input_c1_~x~0#1.base| v_ArrVal_21) |#length|) (= (select |old(#valid)| |parse_input_c1_~x~0#1.base|) 0))) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1))} is VALID [2022-02-20 23:37:59,177 INFO L290 TraceCheckUtils]: 19: Hoare triple {15826#(and (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0) (= |~#commands~0.offset| 0) (exists ((|parse_input_c1_~x~0#1.base| Int) (v_ArrVal_21 Int)) (and (= (store |old(#length)| |parse_input_c1_~x~0#1.base| v_ArrVal_21) |#length|) (= (select |old(#valid)| |parse_input_c1_~x~0#1.base|) 0))) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1))} assume { :end_inline_c1 } true; {15826#(and (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0) (= |~#commands~0.offset| 0) (exists ((|parse_input_c1_~x~0#1.base| Int) (v_ArrVal_21 Int)) (and (= (store |old(#length)| |parse_input_c1_~x~0#1.base| v_ArrVal_21) |#length|) (= (select |old(#valid)| |parse_input_c1_~x~0#1.base|) 0))) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1))} is VALID [2022-02-20 23:37:59,178 INFO L290 TraceCheckUtils]: 20: Hoare triple {15826#(and (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0) (= |~#commands~0.offset| 0) (exists ((|parse_input_c1_~x~0#1.base| Int) (v_ArrVal_21 Int)) (and (= (store |old(#length)| |parse_input_c1_~x~0#1.base| v_ArrVal_21) |#length|) (= (select |old(#valid)| |parse_input_c1_~x~0#1.base|) 0))) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1))} assume { :end_inline_##fun~~TO~VOID } true;havoc #t~mem6#1.base, #t~mem6#1.offset; {15826#(and (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0) (= |~#commands~0.offset| 0) (exists ((|parse_input_c1_~x~0#1.base| Int) (v_ArrVal_21 Int)) (and (= (store |old(#length)| |parse_input_c1_~x~0#1.base| v_ArrVal_21) |#length|) (= (select |old(#valid)| |parse_input_c1_~x~0#1.base|) 0))) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1))} is VALID [2022-02-20 23:37:59,178 INFO L290 TraceCheckUtils]: 21: Hoare triple {15826#(and (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0) (= |~#commands~0.offset| 0) (exists ((|parse_input_c1_~x~0#1.base| Int) (v_ArrVal_21 Int)) (and (= (store |old(#length)| |parse_input_c1_~x~0#1.base| v_ArrVal_21) |#length|) (= (select |old(#valid)| |parse_input_c1_~x~0#1.base|) 0))) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1))} assume true; {15826#(and (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0) (= |~#commands~0.offset| 0) (exists ((|parse_input_c1_~x~0#1.base| Int) (v_ArrVal_21 Int)) (and (= (store |old(#length)| |parse_input_c1_~x~0#1.base| v_ArrVal_21) |#length|) (= (select |old(#valid)| |parse_input_c1_~x~0#1.base|) 0))) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1))} is VALID [2022-02-20 23:37:59,179 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {15826#(and (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0) (= |~#commands~0.offset| 0) (exists ((|parse_input_c1_~x~0#1.base| Int) (v_ArrVal_21 Int)) (and (= (store |old(#length)| |parse_input_c1_~x~0#1.base| v_ArrVal_21) |#length|) (= (select |old(#valid)| |parse_input_c1_~x~0#1.base|) 0))) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1))} {15779#(and (<= 3 (select |#length| 1)) (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0) (= (select |#valid| 1) 1) (= |~#commands~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1))} #101#return; {15848#(and (<= 3 (select |#length| 1)) (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0) (= |~#commands~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1))} is VALID [2022-02-20 23:37:59,180 INFO L272 TraceCheckUtils]: 23: Hoare triple {15848#(and (<= 3 (select |#length| 1)) (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0) (= |~#commands~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1))} call parse_input(4, 0); {15848#(and (<= 3 (select |#length| 1)) (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0) (= |~#commands~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1))} is VALID [2022-02-20 23:37:59,180 INFO L290 TraceCheckUtils]: 24: Hoare triple {15848#(and (<= 3 (select |#length| 1)) (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0) (= |~#commands~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1))} ~input#1.base, ~input#1.offset := #in~input#1.base, #in~input#1.offset;~i~0#1 := 0; {15855#(and (<= 3 (select |#length| 1)) (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0) (= |~#commands~0.offset| 0) (= |parse_input_~i~0#1| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1))} is VALID [2022-02-20 23:37:59,181 INFO L290 TraceCheckUtils]: 25: Hoare triple {15855#(and (<= 3 (select |#length| 1)) (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0) (= |~#commands~0.offset| 0) (= |parse_input_~i~0#1| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1))} assume !!(~i~0#1 < 2); {15855#(and (<= 3 (select |#length| 1)) (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0) (= |~#commands~0.offset| 0) (= |parse_input_~i~0#1| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1))} is VALID [2022-02-20 23:37:59,181 INFO L290 TraceCheckUtils]: 26: Hoare triple {15855#(and (<= 3 (select |#length| 1)) (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0) (= |~#commands~0.offset| 0) (= |parse_input_~i~0#1| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1))} SUMMARY for call #t~mem3#1.base, #t~mem3#1.offset := read~$Pointer$(~#commands~0.base, ~#commands~0.offset + 9 * ~i~0#1, 4); srcloc: L693 {15862#(and (<= 3 (select |#length| 1)) (= |parse_input_#t~mem3#1.offset| 0) (= |parse_input_#t~mem3#1.base| 1))} is VALID [2022-02-20 23:37:59,182 INFO L290 TraceCheckUtils]: 27: Hoare triple {15862#(and (<= 3 (select |#length| 1)) (= |parse_input_#t~mem3#1.offset| 0) (= |parse_input_#t~mem3#1.base| 1))} assume 1 == #valid[#t~mem3#1.base]; {15862#(and (<= 3 (select |#length| 1)) (= |parse_input_#t~mem3#1.offset| 0) (= |parse_input_#t~mem3#1.base| 1))} is VALID [2022-02-20 23:37:59,190 INFO L290 TraceCheckUtils]: 28: Hoare triple {15862#(and (<= 3 (select |#length| 1)) (= |parse_input_#t~mem3#1.offset| 0) (= |parse_input_#t~mem3#1.base| 1))} assume !(#t~mem3#1.offset < #length[#t~mem3#1.base] && #t~mem3#1.offset >= 0); {15744#false} is VALID [2022-02-20 23:37:59,190 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:37:59,191 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:37:59,391 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1446896856] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 23:37:59,391 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 23:37:59,391 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 6] total 17 [2022-02-20 23:37:59,391 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404451607] [2022-02-20 23:37:59,391 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 23:37:59,392 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.888888888888889) internal successors, (52), 15 states have internal predecessors, (52), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 29 [2022-02-20 23:37:59,392 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:37:59,392 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 19 states, 18 states have (on average 2.888888888888889) internal successors, (52), 15 states have internal predecessors, (52), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:37:59,446 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:37:59,446 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-02-20 23:37:59,446 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:37:59,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-02-20 23:37:59,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=383, Unknown=0, NotChecked=0, Total=462 [2022-02-20 23:37:59,447 INFO L87 Difference]: Start difference. First operand 344 states and 481 transitions. Second operand has 19 states, 18 states have (on average 2.888888888888889) internal successors, (52), 15 states have internal predecessors, (52), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:38:01,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:38:01,016 INFO L93 Difference]: Finished difference Result 459 states and 589 transitions. [2022-02-20 23:38:01,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-02-20 23:38:01,016 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.888888888888889) internal successors, (52), 15 states have internal predecessors, (52), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 29 [2022-02-20 23:38:01,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:38:01,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 2.888888888888889) internal successors, (52), 15 states have internal predecessors, (52), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:38:01,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 226 transitions. [2022-02-20 23:38:01,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 2.888888888888889) internal successors, (52), 15 states have internal predecessors, (52), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:38:01,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 226 transitions. [2022-02-20 23:38:01,022 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states and 226 transitions. [2022-02-20 23:38:01,250 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 226 edges. 226 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:38:01,257 INFO L225 Difference]: With dead ends: 459 [2022-02-20 23:38:01,257 INFO L226 Difference]: Without dead ends: 459 [2022-02-20 23:38:01,258 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 344 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=294, Invalid=1112, Unknown=0, NotChecked=0, Total=1406 [2022-02-20 23:38:01,258 INFO L933 BasicCegarLoop]: 38 mSDtfsCounter, 606 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 332 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 606 SdHoareTripleChecker+Valid, 318 SdHoareTripleChecker+Invalid, 462 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 332 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 70 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-20 23:38:01,258 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [606 Valid, 318 Invalid, 462 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 332 Invalid, 0 Unknown, 70 Unchecked, 0.4s Time] [2022-02-20 23:38:01,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2022-02-20 23:38:01,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 350. [2022-02-20 23:38:01,263 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:38:01,263 INFO L82 GeneralOperation]: Start isEquivalent. First operand 459 states. Second operand has 350 states, 308 states have (on average 1.4805194805194806) internal successors, (456), 333 states have internal predecessors, (456), 9 states have call successors, (9), 7 states have call predecessors, (9), 15 states have return successors, (26), 9 states have call predecessors, (26), 9 states have call successors, (26) [2022-02-20 23:38:01,263 INFO L74 IsIncluded]: Start isIncluded. First operand 459 states. Second operand has 350 states, 308 states have (on average 1.4805194805194806) internal successors, (456), 333 states have internal predecessors, (456), 9 states have call successors, (9), 7 states have call predecessors, (9), 15 states have return successors, (26), 9 states have call predecessors, (26), 9 states have call successors, (26) [2022-02-20 23:38:01,264 INFO L87 Difference]: Start difference. First operand 459 states. Second operand has 350 states, 308 states have (on average 1.4805194805194806) internal successors, (456), 333 states have internal predecessors, (456), 9 states have call successors, (9), 7 states have call predecessors, (9), 15 states have return successors, (26), 9 states have call predecessors, (26), 9 states have call successors, (26) [2022-02-20 23:38:01,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:38:01,273 INFO L93 Difference]: Finished difference Result 459 states and 589 transitions. [2022-02-20 23:38:01,273 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 589 transitions. [2022-02-20 23:38:01,274 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:38:01,274 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:38:01,274 INFO L74 IsIncluded]: Start isIncluded. First operand has 350 states, 308 states have (on average 1.4805194805194806) internal successors, (456), 333 states have internal predecessors, (456), 9 states have call successors, (9), 7 states have call predecessors, (9), 15 states have return successors, (26), 9 states have call predecessors, (26), 9 states have call successors, (26) Second operand 459 states. [2022-02-20 23:38:01,275 INFO L87 Difference]: Start difference. First operand has 350 states, 308 states have (on average 1.4805194805194806) internal successors, (456), 333 states have internal predecessors, (456), 9 states have call successors, (9), 7 states have call predecessors, (9), 15 states have return successors, (26), 9 states have call predecessors, (26), 9 states have call successors, (26) Second operand 459 states. [2022-02-20 23:38:01,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:38:01,283 INFO L93 Difference]: Finished difference Result 459 states and 589 transitions. [2022-02-20 23:38:01,283 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 589 transitions. [2022-02-20 23:38:01,284 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:38:01,284 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:38:01,284 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:38:01,284 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:38:01,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 350 states, 308 states have (on average 1.4805194805194806) internal successors, (456), 333 states have internal predecessors, (456), 9 states have call successors, (9), 7 states have call predecessors, (9), 15 states have return successors, (26), 9 states have call predecessors, (26), 9 states have call successors, (26) [2022-02-20 23:38:01,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 491 transitions. [2022-02-20 23:38:01,290 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 491 transitions. Word has length 29 [2022-02-20 23:38:01,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:38:01,290 INFO L470 AbstractCegarLoop]: Abstraction has 350 states and 491 transitions. [2022-02-20 23:38:01,290 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.888888888888889) internal successors, (52), 15 states have internal predecessors, (52), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:38:01,290 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 491 transitions. [2022-02-20 23:38:01,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-02-20 23:38:01,290 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:38:01,290 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:38:01,317 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-02-20 23:38:01,507 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:38:01,507 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATION, parse_inputErr1REQUIRES_VIOLATION, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2022-02-20 23:38:01,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:38:01,507 INFO L85 PathProgramCache]: Analyzing trace with hash -253201523, now seen corresponding path program 1 times [2022-02-20 23:38:01,508 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:38:01,508 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568119037] [2022-02-20 23:38:01,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:38:01,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:38:01,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:38:01,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 23:38:01,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:38:01,577 INFO L290 TraceCheckUtils]: 0: Hoare triple {17676#(and (= ~global~0.base |old(~global~0.base)|) (= |old(#length)| |#length|) (= |old(~global~0.offset)| ~global~0.offset) (= ~state~0 |old(~state~0)|) (= |old(#valid)| |#valid|))} ~input#1.base, ~input#1.offset := #in~input#1.base, #in~input#1.offset;~i~0#1 := 0; {17677#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:38:01,577 INFO L290 TraceCheckUtils]: 1: Hoare triple {17677#(= |old(#valid)| |#valid|)} assume !!(~i~0#1 < 2); {17677#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:38:01,578 INFO L290 TraceCheckUtils]: 2: Hoare triple {17677#(= |old(#valid)| |#valid|)} SUMMARY for call #t~mem3#1.base, #t~mem3#1.offset := read~$Pointer$(~#commands~0.base, ~#commands~0.offset + 9 * ~i~0#1, 4); srcloc: L693 {17677#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:38:01,578 INFO L290 TraceCheckUtils]: 3: Hoare triple {17677#(= |old(#valid)| |#valid|)} assume 1 == #valid[#t~mem3#1.base]; {17677#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:38:01,578 INFO L290 TraceCheckUtils]: 4: Hoare triple {17677#(= |old(#valid)| |#valid|)} assume #t~mem3#1.offset < #length[#t~mem3#1.base] && #t~mem3#1.offset >= 0; {17677#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:38:01,579 INFO L290 TraceCheckUtils]: 5: Hoare triple {17677#(= |old(#valid)| |#valid|)} assume 1 == #valid[~input#1.base]; {17677#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:38:01,579 INFO L290 TraceCheckUtils]: 6: Hoare triple {17677#(= |old(#valid)| |#valid|)} assume ~input#1.offset < #length[~input#1.base] && ~input#1.offset >= 0; {17677#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:38:01,579 INFO L290 TraceCheckUtils]: 7: Hoare triple {17677#(= |old(#valid)| |#valid|)} assume !(0 == #t~nondet4#1);havoc #t~mem3#1.base, #t~mem3#1.offset;havoc #t~nondet4#1; {17677#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:38:01,579 INFO L290 TraceCheckUtils]: 8: Hoare triple {17677#(= |old(#valid)| |#valid|)} #t~post2#1 := ~i~0#1;~i~0#1 := 1 + #t~post2#1;havoc #t~post2#1; {17677#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:38:01,580 INFO L290 TraceCheckUtils]: 9: Hoare triple {17677#(= |old(#valid)| |#valid|)} assume !!(~i~0#1 < 2); {17677#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:38:01,580 INFO L290 TraceCheckUtils]: 10: Hoare triple {17677#(= |old(#valid)| |#valid|)} SUMMARY for call #t~mem3#1.base, #t~mem3#1.offset := read~$Pointer$(~#commands~0.base, ~#commands~0.offset + 9 * ~i~0#1, 4); srcloc: L693 {17677#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:38:01,580 INFO L290 TraceCheckUtils]: 11: Hoare triple {17677#(= |old(#valid)| |#valid|)} assume 1 == #valid[#t~mem3#1.base]; {17677#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:38:01,581 INFO L290 TraceCheckUtils]: 12: Hoare triple {17677#(= |old(#valid)| |#valid|)} assume #t~mem3#1.offset < #length[#t~mem3#1.base] && #t~mem3#1.offset >= 0; {17677#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:38:01,581 INFO L290 TraceCheckUtils]: 13: Hoare triple {17677#(= |old(#valid)| |#valid|)} assume 1 == #valid[~input#1.base]; {17677#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:38:01,581 INFO L290 TraceCheckUtils]: 14: Hoare triple {17677#(= |old(#valid)| |#valid|)} assume ~input#1.offset < #length[~input#1.base] && ~input#1.offset >= 0; {17677#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:38:01,581 INFO L290 TraceCheckUtils]: 15: Hoare triple {17677#(= |old(#valid)| |#valid|)} assume !(0 == #t~nondet4#1);havoc #t~mem3#1.base, #t~mem3#1.offset;havoc #t~nondet4#1; {17677#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:38:01,582 INFO L290 TraceCheckUtils]: 16: Hoare triple {17677#(= |old(#valid)| |#valid|)} #t~post2#1 := ~i~0#1;~i~0#1 := 1 + #t~post2#1;havoc #t~post2#1; {17677#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:38:01,583 INFO L290 TraceCheckUtils]: 17: Hoare triple {17677#(= |old(#valid)| |#valid|)} assume !(~i~0#1 < 2); {17677#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:38:01,583 INFO L290 TraceCheckUtils]: 18: Hoare triple {17677#(= |old(#valid)| |#valid|)} assume true; {17677#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:38:01,583 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {17677#(= |old(#valid)| |#valid|)} {17653#(= (select |#valid| 4) 1)} #101#return; {17653#(= (select |#valid| 4) 1)} is VALID [2022-02-20 23:38:01,584 INFO L290 TraceCheckUtils]: 0: Hoare triple {17651#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(3, 1);call write~init~int(99, 1, 0, 1);call write~init~int(49, 1, 1, 1);call write~init~int(0, 1, 2, 1);call #Ultimate.allocInit(3, 2);call write~init~int(99, 2, 0, 1);call write~init~int(50, 2, 1, 1);call write~init~int(0, 2, 2, 1);call #Ultimate.allocInit(3, 3);call write~init~int(99, 3, 0, 1);call write~init~int(49, 3, 1, 1);call write~init~int(0, 3, 2, 1);call #Ultimate.allocInit(3, 4);call write~init~int(99, 4, 0, 1);call write~init~int(49, 4, 1, 1);call write~init~int(0, 4, 2, 1);call #Ultimate.allocInit(3, 5);call write~init~int(99, 5, 0, 1);call write~init~int(50, 5, 1, 1);call write~init~int(0, 5, 2, 1);~state~0 := ~unnamed3~0~STATE_1;~global~0.base, ~global~0.offset := 0, 0;~#commands~0.base, ~#commands~0.offset := 6, 0;call #Ultimate.allocInit(18, 6);call write~init~$Pointer$(1, 0, ~#commands~0.base, ~#commands~0.offset, 4);call write~init~$Pointer$(#funAddr~c1.base, #funAddr~c1.offset, ~#commands~0.base, 4 + ~#commands~0.offset, 4);call write~init~int((if ~unnamed3~0~STATE_1 % 256 <= 127 then ~unnamed3~0~STATE_1 % 256 else ~unnamed3~0~STATE_1 % 256 - 256), ~#commands~0.base, 8 + ~#commands~0.offset, 1);call write~init~$Pointer$(2, 0, ~#commands~0.base, 9 + ~#commands~0.offset, 4);call write~init~$Pointer$(#funAddr~c2.base, #funAddr~c2.offset, ~#commands~0.base, 13 + ~#commands~0.offset, 4);call write~init~int((if ~unnamed3~0~STATE_2 % 256 <= 127 then ~unnamed3~0~STATE_2 % 256 else ~unnamed3~0~STATE_2 % 256 - 256), ~#commands~0.base, 17 + ~#commands~0.offset, 1); {17653#(= (select |#valid| 4) 1)} is VALID [2022-02-20 23:38:01,584 INFO L290 TraceCheckUtils]: 1: Hoare triple {17653#(= (select |#valid| 4) 1)} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1; {17653#(= (select |#valid| 4) 1)} is VALID [2022-02-20 23:38:01,585 INFO L272 TraceCheckUtils]: 2: Hoare triple {17653#(= (select |#valid| 4) 1)} call parse_input(3, 0); {17676#(and (= ~global~0.base |old(~global~0.base)|) (= |old(#length)| |#length|) (= |old(~global~0.offset)| ~global~0.offset) (= ~state~0 |old(~state~0)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 23:38:01,585 INFO L290 TraceCheckUtils]: 3: Hoare triple {17676#(and (= ~global~0.base |old(~global~0.base)|) (= |old(#length)| |#length|) (= |old(~global~0.offset)| ~global~0.offset) (= ~state~0 |old(~state~0)|) (= |old(#valid)| |#valid|))} ~input#1.base, ~input#1.offset := #in~input#1.base, #in~input#1.offset;~i~0#1 := 0; {17677#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:38:01,585 INFO L290 TraceCheckUtils]: 4: Hoare triple {17677#(= |old(#valid)| |#valid|)} assume !!(~i~0#1 < 2); {17677#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:38:01,586 INFO L290 TraceCheckUtils]: 5: Hoare triple {17677#(= |old(#valid)| |#valid|)} SUMMARY for call #t~mem3#1.base, #t~mem3#1.offset := read~$Pointer$(~#commands~0.base, ~#commands~0.offset + 9 * ~i~0#1, 4); srcloc: L693 {17677#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:38:01,586 INFO L290 TraceCheckUtils]: 6: Hoare triple {17677#(= |old(#valid)| |#valid|)} assume 1 == #valid[#t~mem3#1.base]; {17677#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:38:01,586 INFO L290 TraceCheckUtils]: 7: Hoare triple {17677#(= |old(#valid)| |#valid|)} assume #t~mem3#1.offset < #length[#t~mem3#1.base] && #t~mem3#1.offset >= 0; {17677#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:38:01,586 INFO L290 TraceCheckUtils]: 8: Hoare triple {17677#(= |old(#valid)| |#valid|)} assume 1 == #valid[~input#1.base]; {17677#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:38:01,587 INFO L290 TraceCheckUtils]: 9: Hoare triple {17677#(= |old(#valid)| |#valid|)} assume ~input#1.offset < #length[~input#1.base] && ~input#1.offset >= 0; {17677#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:38:01,587 INFO L290 TraceCheckUtils]: 10: Hoare triple {17677#(= |old(#valid)| |#valid|)} assume !(0 == #t~nondet4#1);havoc #t~mem3#1.base, #t~mem3#1.offset;havoc #t~nondet4#1; {17677#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:38:01,587 INFO L290 TraceCheckUtils]: 11: Hoare triple {17677#(= |old(#valid)| |#valid|)} #t~post2#1 := ~i~0#1;~i~0#1 := 1 + #t~post2#1;havoc #t~post2#1; {17677#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:38:01,587 INFO L290 TraceCheckUtils]: 12: Hoare triple {17677#(= |old(#valid)| |#valid|)} assume !!(~i~0#1 < 2); {17677#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:38:01,588 INFO L290 TraceCheckUtils]: 13: Hoare triple {17677#(= |old(#valid)| |#valid|)} SUMMARY for call #t~mem3#1.base, #t~mem3#1.offset := read~$Pointer$(~#commands~0.base, ~#commands~0.offset + 9 * ~i~0#1, 4); srcloc: L693 {17677#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:38:01,588 INFO L290 TraceCheckUtils]: 14: Hoare triple {17677#(= |old(#valid)| |#valid|)} assume 1 == #valid[#t~mem3#1.base]; {17677#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:38:01,588 INFO L290 TraceCheckUtils]: 15: Hoare triple {17677#(= |old(#valid)| |#valid|)} assume #t~mem3#1.offset < #length[#t~mem3#1.base] && #t~mem3#1.offset >= 0; {17677#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:38:01,589 INFO L290 TraceCheckUtils]: 16: Hoare triple {17677#(= |old(#valid)| |#valid|)} assume 1 == #valid[~input#1.base]; {17677#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:38:01,590 INFO L290 TraceCheckUtils]: 17: Hoare triple {17677#(= |old(#valid)| |#valid|)} assume ~input#1.offset < #length[~input#1.base] && ~input#1.offset >= 0; {17677#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:38:01,590 INFO L290 TraceCheckUtils]: 18: Hoare triple {17677#(= |old(#valid)| |#valid|)} assume !(0 == #t~nondet4#1);havoc #t~mem3#1.base, #t~mem3#1.offset;havoc #t~nondet4#1; {17677#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:38:01,590 INFO L290 TraceCheckUtils]: 19: Hoare triple {17677#(= |old(#valid)| |#valid|)} #t~post2#1 := ~i~0#1;~i~0#1 := 1 + #t~post2#1;havoc #t~post2#1; {17677#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:38:01,590 INFO L290 TraceCheckUtils]: 20: Hoare triple {17677#(= |old(#valid)| |#valid|)} assume !(~i~0#1 < 2); {17677#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:38:01,591 INFO L290 TraceCheckUtils]: 21: Hoare triple {17677#(= |old(#valid)| |#valid|)} assume true; {17677#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:38:01,591 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {17677#(= |old(#valid)| |#valid|)} {17653#(= (select |#valid| 4) 1)} #101#return; {17653#(= (select |#valid| 4) 1)} is VALID [2022-02-20 23:38:01,592 INFO L272 TraceCheckUtils]: 23: Hoare triple {17653#(= (select |#valid| 4) 1)} call parse_input(4, 0); {17674#(and (= (select |#valid| 4) 1) (= |parse_input_#in~input#1.base| 4))} is VALID [2022-02-20 23:38:01,592 INFO L290 TraceCheckUtils]: 24: Hoare triple {17674#(and (= (select |#valid| 4) 1) (= |parse_input_#in~input#1.base| 4))} ~input#1.base, ~input#1.offset := #in~input#1.base, #in~input#1.offset;~i~0#1 := 0; {17675#(and (= (select |#valid| |parse_input_~input#1.base|) 1) (= |parse_input_~input#1.base| 4))} is VALID [2022-02-20 23:38:01,592 INFO L290 TraceCheckUtils]: 25: Hoare triple {17675#(and (= (select |#valid| |parse_input_~input#1.base|) 1) (= |parse_input_~input#1.base| 4))} assume !!(~i~0#1 < 2); {17675#(and (= (select |#valid| |parse_input_~input#1.base|) 1) (= |parse_input_~input#1.base| 4))} is VALID [2022-02-20 23:38:01,593 INFO L290 TraceCheckUtils]: 26: Hoare triple {17675#(and (= (select |#valid| |parse_input_~input#1.base|) 1) (= |parse_input_~input#1.base| 4))} SUMMARY for call #t~mem3#1.base, #t~mem3#1.offset := read~$Pointer$(~#commands~0.base, ~#commands~0.offset + 9 * ~i~0#1, 4); srcloc: L693 {17675#(and (= (select |#valid| |parse_input_~input#1.base|) 1) (= |parse_input_~input#1.base| 4))} is VALID [2022-02-20 23:38:01,593 INFO L290 TraceCheckUtils]: 27: Hoare triple {17675#(and (= (select |#valid| |parse_input_~input#1.base|) 1) (= |parse_input_~input#1.base| 4))} assume 1 == #valid[#t~mem3#1.base]; {17675#(and (= (select |#valid| |parse_input_~input#1.base|) 1) (= |parse_input_~input#1.base| 4))} is VALID [2022-02-20 23:38:01,593 INFO L290 TraceCheckUtils]: 28: Hoare triple {17675#(and (= (select |#valid| |parse_input_~input#1.base|) 1) (= |parse_input_~input#1.base| 4))} assume #t~mem3#1.offset < #length[#t~mem3#1.base] && #t~mem3#1.offset >= 0; {17675#(and (= (select |#valid| |parse_input_~input#1.base|) 1) (= |parse_input_~input#1.base| 4))} is VALID [2022-02-20 23:38:01,594 INFO L290 TraceCheckUtils]: 29: Hoare triple {17675#(and (= (select |#valid| |parse_input_~input#1.base|) 1) (= |parse_input_~input#1.base| 4))} assume !(1 == #valid[~input#1.base]); {17652#false} is VALID [2022-02-20 23:38:01,594 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-02-20 23:38:01,594 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:38:01,594 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568119037] [2022-02-20 23:38:01,594 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1568119037] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 23:38:01,594 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [102270247] [2022-02-20 23:38:01,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:38:01,594 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:38:01,594 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:38:01,595 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 23:38:01,596 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-02-20 23:38:01,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:38:01,650 INFO L263 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 11 conjunts are in the unsatisfiable core [2022-02-20 23:38:01,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:38:01,665 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:38:01,773 INFO L290 TraceCheckUtils]: 0: Hoare triple {17651#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(3, 1);call write~init~int(99, 1, 0, 1);call write~init~int(49, 1, 1, 1);call write~init~int(0, 1, 2, 1);call #Ultimate.allocInit(3, 2);call write~init~int(99, 2, 0, 1);call write~init~int(50, 2, 1, 1);call write~init~int(0, 2, 2, 1);call #Ultimate.allocInit(3, 3);call write~init~int(99, 3, 0, 1);call write~init~int(49, 3, 1, 1);call write~init~int(0, 3, 2, 1);call #Ultimate.allocInit(3, 4);call write~init~int(99, 4, 0, 1);call write~init~int(49, 4, 1, 1);call write~init~int(0, 4, 2, 1);call #Ultimate.allocInit(3, 5);call write~init~int(99, 5, 0, 1);call write~init~int(50, 5, 1, 1);call write~init~int(0, 5, 2, 1);~state~0 := ~unnamed3~0~STATE_1;~global~0.base, ~global~0.offset := 0, 0;~#commands~0.base, ~#commands~0.offset := 6, 0;call #Ultimate.allocInit(18, 6);call write~init~$Pointer$(1, 0, ~#commands~0.base, ~#commands~0.offset, 4);call write~init~$Pointer$(#funAddr~c1.base, #funAddr~c1.offset, ~#commands~0.base, 4 + ~#commands~0.offset, 4);call write~init~int((if ~unnamed3~0~STATE_1 % 256 <= 127 then ~unnamed3~0~STATE_1 % 256 else ~unnamed3~0~STATE_1 % 256 - 256), ~#commands~0.base, 8 + ~#commands~0.offset, 1);call write~init~$Pointer$(2, 0, ~#commands~0.base, 9 + ~#commands~0.offset, 4);call write~init~$Pointer$(#funAddr~c2.base, #funAddr~c2.offset, ~#commands~0.base, 13 + ~#commands~0.offset, 4);call write~init~int((if ~unnamed3~0~STATE_2 % 256 <= 127 then ~unnamed3~0~STATE_2 % 256 else ~unnamed3~0~STATE_2 % 256 - 256), ~#commands~0.base, 17 + ~#commands~0.offset, 1); {17653#(= (select |#valid| 4) 1)} is VALID [2022-02-20 23:38:01,773 INFO L290 TraceCheckUtils]: 1: Hoare triple {17653#(= (select |#valid| 4) 1)} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1; {17653#(= (select |#valid| 4) 1)} is VALID [2022-02-20 23:38:01,774 INFO L272 TraceCheckUtils]: 2: Hoare triple {17653#(= (select |#valid| 4) 1)} call parse_input(3, 0); {17677#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:38:01,774 INFO L290 TraceCheckUtils]: 3: Hoare triple {17677#(= |old(#valid)| |#valid|)} ~input#1.base, ~input#1.offset := #in~input#1.base, #in~input#1.offset;~i~0#1 := 0; {17677#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:38:01,774 INFO L290 TraceCheckUtils]: 4: Hoare triple {17677#(= |old(#valid)| |#valid|)} assume !!(~i~0#1 < 2); {17677#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:38:01,775 INFO L290 TraceCheckUtils]: 5: Hoare triple {17677#(= |old(#valid)| |#valid|)} SUMMARY for call #t~mem3#1.base, #t~mem3#1.offset := read~$Pointer$(~#commands~0.base, ~#commands~0.offset + 9 * ~i~0#1, 4); srcloc: L693 {17677#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:38:01,775 INFO L290 TraceCheckUtils]: 6: Hoare triple {17677#(= |old(#valid)| |#valid|)} assume 1 == #valid[#t~mem3#1.base]; {17677#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:38:01,776 INFO L290 TraceCheckUtils]: 7: Hoare triple {17677#(= |old(#valid)| |#valid|)} assume #t~mem3#1.offset < #length[#t~mem3#1.base] && #t~mem3#1.offset >= 0; {17677#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:38:01,776 INFO L290 TraceCheckUtils]: 8: Hoare triple {17677#(= |old(#valid)| |#valid|)} assume 1 == #valid[~input#1.base]; {17677#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:38:01,776 INFO L290 TraceCheckUtils]: 9: Hoare triple {17677#(= |old(#valid)| |#valid|)} assume ~input#1.offset < #length[~input#1.base] && ~input#1.offset >= 0; {17677#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:38:01,777 INFO L290 TraceCheckUtils]: 10: Hoare triple {17677#(= |old(#valid)| |#valid|)} assume !(0 == #t~nondet4#1);havoc #t~mem3#1.base, #t~mem3#1.offset;havoc #t~nondet4#1; {17677#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:38:01,777 INFO L290 TraceCheckUtils]: 11: Hoare triple {17677#(= |old(#valid)| |#valid|)} #t~post2#1 := ~i~0#1;~i~0#1 := 1 + #t~post2#1;havoc #t~post2#1; {17677#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:38:01,777 INFO L290 TraceCheckUtils]: 12: Hoare triple {17677#(= |old(#valid)| |#valid|)} assume !!(~i~0#1 < 2); {17677#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:38:01,778 INFO L290 TraceCheckUtils]: 13: Hoare triple {17677#(= |old(#valid)| |#valid|)} SUMMARY for call #t~mem3#1.base, #t~mem3#1.offset := read~$Pointer$(~#commands~0.base, ~#commands~0.offset + 9 * ~i~0#1, 4); srcloc: L693 {17677#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:38:01,778 INFO L290 TraceCheckUtils]: 14: Hoare triple {17677#(= |old(#valid)| |#valid|)} assume 1 == #valid[#t~mem3#1.base]; {17677#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:38:01,779 INFO L290 TraceCheckUtils]: 15: Hoare triple {17677#(= |old(#valid)| |#valid|)} assume #t~mem3#1.offset < #length[#t~mem3#1.base] && #t~mem3#1.offset >= 0; {17677#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:38:01,779 INFO L290 TraceCheckUtils]: 16: Hoare triple {17677#(= |old(#valid)| |#valid|)} assume 1 == #valid[~input#1.base]; {17677#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:38:01,779 INFO L290 TraceCheckUtils]: 17: Hoare triple {17677#(= |old(#valid)| |#valid|)} assume ~input#1.offset < #length[~input#1.base] && ~input#1.offset >= 0; {17677#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:38:01,780 INFO L290 TraceCheckUtils]: 18: Hoare triple {17677#(= |old(#valid)| |#valid|)} assume !(0 == #t~nondet4#1);havoc #t~mem3#1.base, #t~mem3#1.offset;havoc #t~nondet4#1; {17677#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:38:01,780 INFO L290 TraceCheckUtils]: 19: Hoare triple {17677#(= |old(#valid)| |#valid|)} #t~post2#1 := ~i~0#1;~i~0#1 := 1 + #t~post2#1;havoc #t~post2#1; {17677#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:38:01,780 INFO L290 TraceCheckUtils]: 20: Hoare triple {17677#(= |old(#valid)| |#valid|)} assume !(~i~0#1 < 2); {17677#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:38:01,781 INFO L290 TraceCheckUtils]: 21: Hoare triple {17677#(= |old(#valid)| |#valid|)} assume true; {17677#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:38:01,781 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {17677#(= |old(#valid)| |#valid|)} {17653#(= (select |#valid| 4) 1)} #101#return; {17653#(= (select |#valid| 4) 1)} is VALID [2022-02-20 23:38:01,782 INFO L272 TraceCheckUtils]: 23: Hoare triple {17653#(= (select |#valid| 4) 1)} call parse_input(4, 0); {17674#(and (= (select |#valid| 4) 1) (= |parse_input_#in~input#1.base| 4))} is VALID [2022-02-20 23:38:01,782 INFO L290 TraceCheckUtils]: 24: Hoare triple {17674#(and (= (select |#valid| 4) 1) (= |parse_input_#in~input#1.base| 4))} ~input#1.base, ~input#1.offset := #in~input#1.base, #in~input#1.offset;~i~0#1 := 0; {17675#(and (= (select |#valid| |parse_input_~input#1.base|) 1) (= |parse_input_~input#1.base| 4))} is VALID [2022-02-20 23:38:01,782 INFO L290 TraceCheckUtils]: 25: Hoare triple {17675#(and (= (select |#valid| |parse_input_~input#1.base|) 1) (= |parse_input_~input#1.base| 4))} assume !!(~i~0#1 < 2); {17675#(and (= (select |#valid| |parse_input_~input#1.base|) 1) (= |parse_input_~input#1.base| 4))} is VALID [2022-02-20 23:38:01,783 INFO L290 TraceCheckUtils]: 26: Hoare triple {17675#(and (= (select |#valid| |parse_input_~input#1.base|) 1) (= |parse_input_~input#1.base| 4))} SUMMARY for call #t~mem3#1.base, #t~mem3#1.offset := read~$Pointer$(~#commands~0.base, ~#commands~0.offset + 9 * ~i~0#1, 4); srcloc: L693 {17675#(and (= (select |#valid| |parse_input_~input#1.base|) 1) (= |parse_input_~input#1.base| 4))} is VALID [2022-02-20 23:38:01,783 INFO L290 TraceCheckUtils]: 27: Hoare triple {17675#(and (= (select |#valid| |parse_input_~input#1.base|) 1) (= |parse_input_~input#1.base| 4))} assume 1 == #valid[#t~mem3#1.base]; {17675#(and (= (select |#valid| |parse_input_~input#1.base|) 1) (= |parse_input_~input#1.base| 4))} is VALID [2022-02-20 23:38:01,791 INFO L290 TraceCheckUtils]: 28: Hoare triple {17675#(and (= (select |#valid| |parse_input_~input#1.base|) 1) (= |parse_input_~input#1.base| 4))} assume #t~mem3#1.offset < #length[#t~mem3#1.base] && #t~mem3#1.offset >= 0; {17675#(and (= (select |#valid| |parse_input_~input#1.base|) 1) (= |parse_input_~input#1.base| 4))} is VALID [2022-02-20 23:38:01,792 INFO L290 TraceCheckUtils]: 29: Hoare triple {17675#(and (= (select |#valid| |parse_input_~input#1.base|) 1) (= |parse_input_~input#1.base| 4))} assume !(1 == #valid[~input#1.base]); {17652#false} is VALID [2022-02-20 23:38:01,792 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-02-20 23:38:01,792 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:38:01,954 INFO L290 TraceCheckUtils]: 29: Hoare triple {17768#(= (select |#valid| |parse_input_~input#1.base|) 1)} assume !(1 == #valid[~input#1.base]); {17652#false} is VALID [2022-02-20 23:38:01,955 INFO L290 TraceCheckUtils]: 28: Hoare triple {17768#(= (select |#valid| |parse_input_~input#1.base|) 1)} assume #t~mem3#1.offset < #length[#t~mem3#1.base] && #t~mem3#1.offset >= 0; {17768#(= (select |#valid| |parse_input_~input#1.base|) 1)} is VALID [2022-02-20 23:38:01,955 INFO L290 TraceCheckUtils]: 27: Hoare triple {17768#(= (select |#valid| |parse_input_~input#1.base|) 1)} assume 1 == #valid[#t~mem3#1.base]; {17768#(= (select |#valid| |parse_input_~input#1.base|) 1)} is VALID [2022-02-20 23:38:01,955 INFO L290 TraceCheckUtils]: 26: Hoare triple {17768#(= (select |#valid| |parse_input_~input#1.base|) 1)} SUMMARY for call #t~mem3#1.base, #t~mem3#1.offset := read~$Pointer$(~#commands~0.base, ~#commands~0.offset + 9 * ~i~0#1, 4); srcloc: L693 {17768#(= (select |#valid| |parse_input_~input#1.base|) 1)} is VALID [2022-02-20 23:38:01,956 INFO L290 TraceCheckUtils]: 25: Hoare triple {17768#(= (select |#valid| |parse_input_~input#1.base|) 1)} assume !!(~i~0#1 < 2); {17768#(= (select |#valid| |parse_input_~input#1.base|) 1)} is VALID [2022-02-20 23:38:01,956 INFO L290 TraceCheckUtils]: 24: Hoare triple {17784#(= (select |#valid| |parse_input_#in~input#1.base|) 1)} ~input#1.base, ~input#1.offset := #in~input#1.base, #in~input#1.offset;~i~0#1 := 0; {17768#(= (select |#valid| |parse_input_~input#1.base|) 1)} is VALID [2022-02-20 23:38:01,956 INFO L272 TraceCheckUtils]: 23: Hoare triple {17653#(= (select |#valid| 4) 1)} call parse_input(4, 0); {17784#(= (select |#valid| |parse_input_#in~input#1.base|) 1)} is VALID [2022-02-20 23:38:01,957 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {17794#(or (= (select |#valid| 4) 1) (not (= (select |old(#valid)| 4) 1)))} {17653#(= (select |#valid| 4) 1)} #101#return; {17653#(= (select |#valid| 4) 1)} is VALID [2022-02-20 23:38:01,957 INFO L290 TraceCheckUtils]: 21: Hoare triple {17794#(or (= (select |#valid| 4) 1) (not (= (select |old(#valid)| 4) 1)))} assume true; {17794#(or (= (select |#valid| 4) 1) (not (= (select |old(#valid)| 4) 1)))} is VALID [2022-02-20 23:38:01,958 INFO L290 TraceCheckUtils]: 20: Hoare triple {17794#(or (= (select |#valid| 4) 1) (not (= (select |old(#valid)| 4) 1)))} assume !(~i~0#1 < 2); {17794#(or (= (select |#valid| 4) 1) (not (= (select |old(#valid)| 4) 1)))} is VALID [2022-02-20 23:38:01,958 INFO L290 TraceCheckUtils]: 19: Hoare triple {17794#(or (= (select |#valid| 4) 1) (not (= (select |old(#valid)| 4) 1)))} #t~post2#1 := ~i~0#1;~i~0#1 := 1 + #t~post2#1;havoc #t~post2#1; {17794#(or (= (select |#valid| 4) 1) (not (= (select |old(#valid)| 4) 1)))} is VALID [2022-02-20 23:38:01,958 INFO L290 TraceCheckUtils]: 18: Hoare triple {17794#(or (= (select |#valid| 4) 1) (not (= (select |old(#valid)| 4) 1)))} assume !(0 == #t~nondet4#1);havoc #t~mem3#1.base, #t~mem3#1.offset;havoc #t~nondet4#1; {17794#(or (= (select |#valid| 4) 1) (not (= (select |old(#valid)| 4) 1)))} is VALID [2022-02-20 23:38:01,958 INFO L290 TraceCheckUtils]: 17: Hoare triple {17794#(or (= (select |#valid| 4) 1) (not (= (select |old(#valid)| 4) 1)))} assume ~input#1.offset < #length[~input#1.base] && ~input#1.offset >= 0; {17794#(or (= (select |#valid| 4) 1) (not (= (select |old(#valid)| 4) 1)))} is VALID [2022-02-20 23:38:01,959 INFO L290 TraceCheckUtils]: 16: Hoare triple {17794#(or (= (select |#valid| 4) 1) (not (= (select |old(#valid)| 4) 1)))} assume 1 == #valid[~input#1.base]; {17794#(or (= (select |#valid| 4) 1) (not (= (select |old(#valid)| 4) 1)))} is VALID [2022-02-20 23:38:01,959 INFO L290 TraceCheckUtils]: 15: Hoare triple {17794#(or (= (select |#valid| 4) 1) (not (= (select |old(#valid)| 4) 1)))} assume #t~mem3#1.offset < #length[#t~mem3#1.base] && #t~mem3#1.offset >= 0; {17794#(or (= (select |#valid| 4) 1) (not (= (select |old(#valid)| 4) 1)))} is VALID [2022-02-20 23:38:01,959 INFO L290 TraceCheckUtils]: 14: Hoare triple {17794#(or (= (select |#valid| 4) 1) (not (= (select |old(#valid)| 4) 1)))} assume 1 == #valid[#t~mem3#1.base]; {17794#(or (= (select |#valid| 4) 1) (not (= (select |old(#valid)| 4) 1)))} is VALID [2022-02-20 23:38:01,959 INFO L290 TraceCheckUtils]: 13: Hoare triple {17794#(or (= (select |#valid| 4) 1) (not (= (select |old(#valid)| 4) 1)))} SUMMARY for call #t~mem3#1.base, #t~mem3#1.offset := read~$Pointer$(~#commands~0.base, ~#commands~0.offset + 9 * ~i~0#1, 4); srcloc: L693 {17794#(or (= (select |#valid| 4) 1) (not (= (select |old(#valid)| 4) 1)))} is VALID [2022-02-20 23:38:01,960 INFO L290 TraceCheckUtils]: 12: Hoare triple {17794#(or (= (select |#valid| 4) 1) (not (= (select |old(#valid)| 4) 1)))} assume !!(~i~0#1 < 2); {17794#(or (= (select |#valid| 4) 1) (not (= (select |old(#valid)| 4) 1)))} is VALID [2022-02-20 23:38:01,960 INFO L290 TraceCheckUtils]: 11: Hoare triple {17794#(or (= (select |#valid| 4) 1) (not (= (select |old(#valid)| 4) 1)))} #t~post2#1 := ~i~0#1;~i~0#1 := 1 + #t~post2#1;havoc #t~post2#1; {17794#(or (= (select |#valid| 4) 1) (not (= (select |old(#valid)| 4) 1)))} is VALID [2022-02-20 23:38:01,960 INFO L290 TraceCheckUtils]: 10: Hoare triple {17794#(or (= (select |#valid| 4) 1) (not (= (select |old(#valid)| 4) 1)))} assume !(0 == #t~nondet4#1);havoc #t~mem3#1.base, #t~mem3#1.offset;havoc #t~nondet4#1; {17794#(or (= (select |#valid| 4) 1) (not (= (select |old(#valid)| 4) 1)))} is VALID [2022-02-20 23:38:01,960 INFO L290 TraceCheckUtils]: 9: Hoare triple {17794#(or (= (select |#valid| 4) 1) (not (= (select |old(#valid)| 4) 1)))} assume ~input#1.offset < #length[~input#1.base] && ~input#1.offset >= 0; {17794#(or (= (select |#valid| 4) 1) (not (= (select |old(#valid)| 4) 1)))} is VALID [2022-02-20 23:38:01,965 INFO L290 TraceCheckUtils]: 8: Hoare triple {17794#(or (= (select |#valid| 4) 1) (not (= (select |old(#valid)| 4) 1)))} assume 1 == #valid[~input#1.base]; {17794#(or (= (select |#valid| 4) 1) (not (= (select |old(#valid)| 4) 1)))} is VALID [2022-02-20 23:38:01,965 INFO L290 TraceCheckUtils]: 7: Hoare triple {17794#(or (= (select |#valid| 4) 1) (not (= (select |old(#valid)| 4) 1)))} assume #t~mem3#1.offset < #length[#t~mem3#1.base] && #t~mem3#1.offset >= 0; {17794#(or (= (select |#valid| 4) 1) (not (= (select |old(#valid)| 4) 1)))} is VALID [2022-02-20 23:38:01,965 INFO L290 TraceCheckUtils]: 6: Hoare triple {17794#(or (= (select |#valid| 4) 1) (not (= (select |old(#valid)| 4) 1)))} assume 1 == #valid[#t~mem3#1.base]; {17794#(or (= (select |#valid| 4) 1) (not (= (select |old(#valid)| 4) 1)))} is VALID [2022-02-20 23:38:01,966 INFO L290 TraceCheckUtils]: 5: Hoare triple {17794#(or (= (select |#valid| 4) 1) (not (= (select |old(#valid)| 4) 1)))} SUMMARY for call #t~mem3#1.base, #t~mem3#1.offset := read~$Pointer$(~#commands~0.base, ~#commands~0.offset + 9 * ~i~0#1, 4); srcloc: L693 {17794#(or (= (select |#valid| 4) 1) (not (= (select |old(#valid)| 4) 1)))} is VALID [2022-02-20 23:38:01,966 INFO L290 TraceCheckUtils]: 4: Hoare triple {17794#(or (= (select |#valid| 4) 1) (not (= (select |old(#valid)| 4) 1)))} assume !!(~i~0#1 < 2); {17794#(or (= (select |#valid| 4) 1) (not (= (select |old(#valid)| 4) 1)))} is VALID [2022-02-20 23:38:01,966 INFO L290 TraceCheckUtils]: 3: Hoare triple {17794#(or (= (select |#valid| 4) 1) (not (= (select |old(#valid)| 4) 1)))} ~input#1.base, ~input#1.offset := #in~input#1.base, #in~input#1.offset;~i~0#1 := 0; {17794#(or (= (select |#valid| 4) 1) (not (= (select |old(#valid)| 4) 1)))} is VALID [2022-02-20 23:38:01,967 INFO L272 TraceCheckUtils]: 2: Hoare triple {17653#(= (select |#valid| 4) 1)} call parse_input(3, 0); {17794#(or (= (select |#valid| 4) 1) (not (= (select |old(#valid)| 4) 1)))} is VALID [2022-02-20 23:38:01,967 INFO L290 TraceCheckUtils]: 1: Hoare triple {17653#(= (select |#valid| 4) 1)} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1; {17653#(= (select |#valid| 4) 1)} is VALID [2022-02-20 23:38:01,967 INFO L290 TraceCheckUtils]: 0: Hoare triple {17651#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(3, 1);call write~init~int(99, 1, 0, 1);call write~init~int(49, 1, 1, 1);call write~init~int(0, 1, 2, 1);call #Ultimate.allocInit(3, 2);call write~init~int(99, 2, 0, 1);call write~init~int(50, 2, 1, 1);call write~init~int(0, 2, 2, 1);call #Ultimate.allocInit(3, 3);call write~init~int(99, 3, 0, 1);call write~init~int(49, 3, 1, 1);call write~init~int(0, 3, 2, 1);call #Ultimate.allocInit(3, 4);call write~init~int(99, 4, 0, 1);call write~init~int(49, 4, 1, 1);call write~init~int(0, 4, 2, 1);call #Ultimate.allocInit(3, 5);call write~init~int(99, 5, 0, 1);call write~init~int(50, 5, 1, 1);call write~init~int(0, 5, 2, 1);~state~0 := ~unnamed3~0~STATE_1;~global~0.base, ~global~0.offset := 0, 0;~#commands~0.base, ~#commands~0.offset := 6, 0;call #Ultimate.allocInit(18, 6);call write~init~$Pointer$(1, 0, ~#commands~0.base, ~#commands~0.offset, 4);call write~init~$Pointer$(#funAddr~c1.base, #funAddr~c1.offset, ~#commands~0.base, 4 + ~#commands~0.offset, 4);call write~init~int((if ~unnamed3~0~STATE_1 % 256 <= 127 then ~unnamed3~0~STATE_1 % 256 else ~unnamed3~0~STATE_1 % 256 - 256), ~#commands~0.base, 8 + ~#commands~0.offset, 1);call write~init~$Pointer$(2, 0, ~#commands~0.base, 9 + ~#commands~0.offset, 4);call write~init~$Pointer$(#funAddr~c2.base, #funAddr~c2.offset, ~#commands~0.base, 13 + ~#commands~0.offset, 4);call write~init~int((if ~unnamed3~0~STATE_2 % 256 <= 127 then ~unnamed3~0~STATE_2 % 256 else ~unnamed3~0~STATE_2 % 256 - 256), ~#commands~0.base, 17 + ~#commands~0.offset, 1); {17653#(= (select |#valid| 4) 1)} is VALID [2022-02-20 23:38:01,967 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-02-20 23:38:01,968 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [102270247] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 23:38:01,968 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 23:38:01,968 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 8 [2022-02-20 23:38:01,968 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209285262] [2022-02-20 23:38:01,968 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 23:38:01,968 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.111111111111111) internal successors, (37), 6 states have internal predecessors, (37), 1 states have call successors, (5), 5 states have call predecessors, (5), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 30 [2022-02-20 23:38:01,968 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:38:01,968 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 10 states, 9 states have (on average 4.111111111111111) internal successors, (37), 6 states have internal predecessors, (37), 1 states have call successors, (5), 5 states have call predecessors, (5), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 23:38:01,996 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:38:01,996 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-20 23:38:01,996 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:38:01,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-20 23:38:01,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2022-02-20 23:38:01,997 INFO L87 Difference]: Start difference. First operand 350 states and 491 transitions. Second operand has 10 states, 9 states have (on average 4.111111111111111) internal successors, (37), 6 states have internal predecessors, (37), 1 states have call successors, (5), 5 states have call predecessors, (5), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 23:38:02,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:38:02,564 INFO L93 Difference]: Finished difference Result 493 states and 633 transitions. [2022-02-20 23:38:02,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-20 23:38:02,564 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.111111111111111) internal successors, (37), 6 states have internal predecessors, (37), 1 states have call successors, (5), 5 states have call predecessors, (5), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 30 [2022-02-20 23:38:02,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:38:02,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 4.111111111111111) internal successors, (37), 6 states have internal predecessors, (37), 1 states have call successors, (5), 5 states have call predecessors, (5), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 23:38:02,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 195 transitions. [2022-02-20 23:38:02,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 4.111111111111111) internal successors, (37), 6 states have internal predecessors, (37), 1 states have call successors, (5), 5 states have call predecessors, (5), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 23:38:02,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 195 transitions. [2022-02-20 23:38:02,569 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 195 transitions. [2022-02-20 23:38:02,703 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 195 edges. 195 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:38:02,711 INFO L225 Difference]: With dead ends: 493 [2022-02-20 23:38:02,711 INFO L226 Difference]: Without dead ends: 493 [2022-02-20 23:38:02,712 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=99, Invalid=207, Unknown=0, NotChecked=0, Total=306 [2022-02-20 23:38:02,713 INFO L933 BasicCegarLoop]: 55 mSDtfsCounter, 427 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 427 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 23:38:02,713 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [427 Valid, 210 Invalid, 251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 23:38:02,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 493 states. [2022-02-20 23:38:02,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 493 to 427. [2022-02-20 23:38:02,719 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:38:02,720 INFO L82 GeneralOperation]: Start isEquivalent. First operand 493 states. Second operand has 427 states, 383 states have (on average 1.4308093994778068) internal successors, (548), 408 states have internal predecessors, (548), 9 states have call successors, (9), 9 states have call predecessors, (9), 17 states have return successors, (24), 9 states have call predecessors, (24), 9 states have call successors, (24) [2022-02-20 23:38:02,720 INFO L74 IsIncluded]: Start isIncluded. First operand 493 states. Second operand has 427 states, 383 states have (on average 1.4308093994778068) internal successors, (548), 408 states have internal predecessors, (548), 9 states have call successors, (9), 9 states have call predecessors, (9), 17 states have return successors, (24), 9 states have call predecessors, (24), 9 states have call successors, (24) [2022-02-20 23:38:02,721 INFO L87 Difference]: Start difference. First operand 493 states. Second operand has 427 states, 383 states have (on average 1.4308093994778068) internal successors, (548), 408 states have internal predecessors, (548), 9 states have call successors, (9), 9 states have call predecessors, (9), 17 states have return successors, (24), 9 states have call predecessors, (24), 9 states have call successors, (24) [2022-02-20 23:38:02,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:38:02,732 INFO L93 Difference]: Finished difference Result 493 states and 633 transitions. [2022-02-20 23:38:02,732 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 633 transitions. [2022-02-20 23:38:02,732 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:38:02,733 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:38:02,733 INFO L74 IsIncluded]: Start isIncluded. First operand has 427 states, 383 states have (on average 1.4308093994778068) internal successors, (548), 408 states have internal predecessors, (548), 9 states have call successors, (9), 9 states have call predecessors, (9), 17 states have return successors, (24), 9 states have call predecessors, (24), 9 states have call successors, (24) Second operand 493 states. [2022-02-20 23:38:02,734 INFO L87 Difference]: Start difference. First operand has 427 states, 383 states have (on average 1.4308093994778068) internal successors, (548), 408 states have internal predecessors, (548), 9 states have call successors, (9), 9 states have call predecessors, (9), 17 states have return successors, (24), 9 states have call predecessors, (24), 9 states have call successors, (24) Second operand 493 states. [2022-02-20 23:38:02,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:38:02,748 INFO L93 Difference]: Finished difference Result 493 states and 633 transitions. [2022-02-20 23:38:02,748 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 633 transitions. [2022-02-20 23:38:02,748 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:38:02,748 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:38:02,748 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:38:02,749 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:38:02,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 427 states, 383 states have (on average 1.4308093994778068) internal successors, (548), 408 states have internal predecessors, (548), 9 states have call successors, (9), 9 states have call predecessors, (9), 17 states have return successors, (24), 9 states have call predecessors, (24), 9 states have call successors, (24) [2022-02-20 23:38:02,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 581 transitions. [2022-02-20 23:38:02,756 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 581 transitions. Word has length 30 [2022-02-20 23:38:02,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:38:02,756 INFO L470 AbstractCegarLoop]: Abstraction has 427 states and 581 transitions. [2022-02-20 23:38:02,756 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.111111111111111) internal successors, (37), 6 states have internal predecessors, (37), 1 states have call successors, (5), 5 states have call predecessors, (5), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 23:38:02,756 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 581 transitions. [2022-02-20 23:38:02,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-02-20 23:38:02,757 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:38:02,757 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:38:02,777 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-02-20 23:38:02,971 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:38:02,971 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting parse_inputErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATION, parse_inputErr1REQUIRES_VIOLATION, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2022-02-20 23:38:02,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:38:02,972 INFO L85 PathProgramCache]: Analyzing trace with hash 740687428, now seen corresponding path program 1 times [2022-02-20 23:38:02,972 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:38:02,972 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775352975] [2022-02-20 23:38:02,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:38:02,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:38:02,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:38:03,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 23:38:03,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:38:03,038 INFO L290 TraceCheckUtils]: 0: Hoare triple {19804#(and (= ~global~0.base |old(~global~0.base)|) (= |old(#length)| |#length|) (= |old(~global~0.offset)| ~global~0.offset) (= ~state~0 |old(~state~0)|) (= |old(#valid)| |#valid|))} ~input#1.base, ~input#1.offset := #in~input#1.base, #in~input#1.offset;~i~0#1 := 0; {19805#(= |old(#length)| |#length|)} is VALID [2022-02-20 23:38:03,038 INFO L290 TraceCheckUtils]: 1: Hoare triple {19805#(= |old(#length)| |#length|)} assume !!(~i~0#1 < 2); {19805#(= |old(#length)| |#length|)} is VALID [2022-02-20 23:38:03,039 INFO L290 TraceCheckUtils]: 2: Hoare triple {19805#(= |old(#length)| |#length|)} SUMMARY for call #t~mem3#1.base, #t~mem3#1.offset := read~$Pointer$(~#commands~0.base, ~#commands~0.offset + 9 * ~i~0#1, 4); srcloc: L693 {19805#(= |old(#length)| |#length|)} is VALID [2022-02-20 23:38:03,039 INFO L290 TraceCheckUtils]: 3: Hoare triple {19805#(= |old(#length)| |#length|)} assume 1 == #valid[#t~mem3#1.base]; {19805#(= |old(#length)| |#length|)} is VALID [2022-02-20 23:38:03,039 INFO L290 TraceCheckUtils]: 4: Hoare triple {19805#(= |old(#length)| |#length|)} assume #t~mem3#1.offset < #length[#t~mem3#1.base] && #t~mem3#1.offset >= 0; {19805#(= |old(#length)| |#length|)} is VALID [2022-02-20 23:38:03,039 INFO L290 TraceCheckUtils]: 5: Hoare triple {19805#(= |old(#length)| |#length|)} assume 1 == #valid[~input#1.base]; {19805#(= |old(#length)| |#length|)} is VALID [2022-02-20 23:38:03,040 INFO L290 TraceCheckUtils]: 6: Hoare triple {19805#(= |old(#length)| |#length|)} assume ~input#1.offset < #length[~input#1.base] && ~input#1.offset >= 0; {19805#(= |old(#length)| |#length|)} is VALID [2022-02-20 23:38:03,040 INFO L290 TraceCheckUtils]: 7: Hoare triple {19805#(= |old(#length)| |#length|)} assume !(0 == #t~nondet4#1);havoc #t~mem3#1.base, #t~mem3#1.offset;havoc #t~nondet4#1; {19805#(= |old(#length)| |#length|)} is VALID [2022-02-20 23:38:03,040 INFO L290 TraceCheckUtils]: 8: Hoare triple {19805#(= |old(#length)| |#length|)} #t~post2#1 := ~i~0#1;~i~0#1 := 1 + #t~post2#1;havoc #t~post2#1; {19805#(= |old(#length)| |#length|)} is VALID [2022-02-20 23:38:03,040 INFO L290 TraceCheckUtils]: 9: Hoare triple {19805#(= |old(#length)| |#length|)} assume !!(~i~0#1 < 2); {19805#(= |old(#length)| |#length|)} is VALID [2022-02-20 23:38:03,041 INFO L290 TraceCheckUtils]: 10: Hoare triple {19805#(= |old(#length)| |#length|)} SUMMARY for call #t~mem3#1.base, #t~mem3#1.offset := read~$Pointer$(~#commands~0.base, ~#commands~0.offset + 9 * ~i~0#1, 4); srcloc: L693 {19805#(= |old(#length)| |#length|)} is VALID [2022-02-20 23:38:03,041 INFO L290 TraceCheckUtils]: 11: Hoare triple {19805#(= |old(#length)| |#length|)} assume 1 == #valid[#t~mem3#1.base]; {19805#(= |old(#length)| |#length|)} is VALID [2022-02-20 23:38:03,041 INFO L290 TraceCheckUtils]: 12: Hoare triple {19805#(= |old(#length)| |#length|)} assume #t~mem3#1.offset < #length[#t~mem3#1.base] && #t~mem3#1.offset >= 0; {19805#(= |old(#length)| |#length|)} is VALID [2022-02-20 23:38:03,041 INFO L290 TraceCheckUtils]: 13: Hoare triple {19805#(= |old(#length)| |#length|)} assume 1 == #valid[~input#1.base]; {19805#(= |old(#length)| |#length|)} is VALID [2022-02-20 23:38:03,042 INFO L290 TraceCheckUtils]: 14: Hoare triple {19805#(= |old(#length)| |#length|)} assume ~input#1.offset < #length[~input#1.base] && ~input#1.offset >= 0; {19805#(= |old(#length)| |#length|)} is VALID [2022-02-20 23:38:03,042 INFO L290 TraceCheckUtils]: 15: Hoare triple {19805#(= |old(#length)| |#length|)} assume !(0 == #t~nondet4#1);havoc #t~mem3#1.base, #t~mem3#1.offset;havoc #t~nondet4#1; {19805#(= |old(#length)| |#length|)} is VALID [2022-02-20 23:38:03,042 INFO L290 TraceCheckUtils]: 16: Hoare triple {19805#(= |old(#length)| |#length|)} #t~post2#1 := ~i~0#1;~i~0#1 := 1 + #t~post2#1;havoc #t~post2#1; {19805#(= |old(#length)| |#length|)} is VALID [2022-02-20 23:38:03,042 INFO L290 TraceCheckUtils]: 17: Hoare triple {19805#(= |old(#length)| |#length|)} assume !(~i~0#1 < 2); {19805#(= |old(#length)| |#length|)} is VALID [2022-02-20 23:38:03,042 INFO L290 TraceCheckUtils]: 18: Hoare triple {19805#(= |old(#length)| |#length|)} assume true; {19805#(= |old(#length)| |#length|)} is VALID [2022-02-20 23:38:03,043 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {19805#(= |old(#length)| |#length|)} {19781#(= 3 (select |#length| 4))} #101#return; {19781#(= 3 (select |#length| 4))} is VALID [2022-02-20 23:38:03,044 INFO L290 TraceCheckUtils]: 0: Hoare triple {19779#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(3, 1);call write~init~int(99, 1, 0, 1);call write~init~int(49, 1, 1, 1);call write~init~int(0, 1, 2, 1);call #Ultimate.allocInit(3, 2);call write~init~int(99, 2, 0, 1);call write~init~int(50, 2, 1, 1);call write~init~int(0, 2, 2, 1);call #Ultimate.allocInit(3, 3);call write~init~int(99, 3, 0, 1);call write~init~int(49, 3, 1, 1);call write~init~int(0, 3, 2, 1);call #Ultimate.allocInit(3, 4);call write~init~int(99, 4, 0, 1);call write~init~int(49, 4, 1, 1);call write~init~int(0, 4, 2, 1);call #Ultimate.allocInit(3, 5);call write~init~int(99, 5, 0, 1);call write~init~int(50, 5, 1, 1);call write~init~int(0, 5, 2, 1);~state~0 := ~unnamed3~0~STATE_1;~global~0.base, ~global~0.offset := 0, 0;~#commands~0.base, ~#commands~0.offset := 6, 0;call #Ultimate.allocInit(18, 6);call write~init~$Pointer$(1, 0, ~#commands~0.base, ~#commands~0.offset, 4);call write~init~$Pointer$(#funAddr~c1.base, #funAddr~c1.offset, ~#commands~0.base, 4 + ~#commands~0.offset, 4);call write~init~int((if ~unnamed3~0~STATE_1 % 256 <= 127 then ~unnamed3~0~STATE_1 % 256 else ~unnamed3~0~STATE_1 % 256 - 256), ~#commands~0.base, 8 + ~#commands~0.offset, 1);call write~init~$Pointer$(2, 0, ~#commands~0.base, 9 + ~#commands~0.offset, 4);call write~init~$Pointer$(#funAddr~c2.base, #funAddr~c2.offset, ~#commands~0.base, 13 + ~#commands~0.offset, 4);call write~init~int((if ~unnamed3~0~STATE_2 % 256 <= 127 then ~unnamed3~0~STATE_2 % 256 else ~unnamed3~0~STATE_2 % 256 - 256), ~#commands~0.base, 17 + ~#commands~0.offset, 1); {19781#(= 3 (select |#length| 4))} is VALID [2022-02-20 23:38:03,044 INFO L290 TraceCheckUtils]: 1: Hoare triple {19781#(= 3 (select |#length| 4))} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1; {19781#(= 3 (select |#length| 4))} is VALID [2022-02-20 23:38:03,045 INFO L272 TraceCheckUtils]: 2: Hoare triple {19781#(= 3 (select |#length| 4))} call parse_input(3, 0); {19804#(and (= ~global~0.base |old(~global~0.base)|) (= |old(#length)| |#length|) (= |old(~global~0.offset)| ~global~0.offset) (= ~state~0 |old(~state~0)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 23:38:03,045 INFO L290 TraceCheckUtils]: 3: Hoare triple {19804#(and (= ~global~0.base |old(~global~0.base)|) (= |old(#length)| |#length|) (= |old(~global~0.offset)| ~global~0.offset) (= ~state~0 |old(~state~0)|) (= |old(#valid)| |#valid|))} ~input#1.base, ~input#1.offset := #in~input#1.base, #in~input#1.offset;~i~0#1 := 0; {19805#(= |old(#length)| |#length|)} is VALID [2022-02-20 23:38:03,045 INFO L290 TraceCheckUtils]: 4: Hoare triple {19805#(= |old(#length)| |#length|)} assume !!(~i~0#1 < 2); {19805#(= |old(#length)| |#length|)} is VALID [2022-02-20 23:38:03,045 INFO L290 TraceCheckUtils]: 5: Hoare triple {19805#(= |old(#length)| |#length|)} SUMMARY for call #t~mem3#1.base, #t~mem3#1.offset := read~$Pointer$(~#commands~0.base, ~#commands~0.offset + 9 * ~i~0#1, 4); srcloc: L693 {19805#(= |old(#length)| |#length|)} is VALID [2022-02-20 23:38:03,046 INFO L290 TraceCheckUtils]: 6: Hoare triple {19805#(= |old(#length)| |#length|)} assume 1 == #valid[#t~mem3#1.base]; {19805#(= |old(#length)| |#length|)} is VALID [2022-02-20 23:38:03,046 INFO L290 TraceCheckUtils]: 7: Hoare triple {19805#(= |old(#length)| |#length|)} assume #t~mem3#1.offset < #length[#t~mem3#1.base] && #t~mem3#1.offset >= 0; {19805#(= |old(#length)| |#length|)} is VALID [2022-02-20 23:38:03,046 INFO L290 TraceCheckUtils]: 8: Hoare triple {19805#(= |old(#length)| |#length|)} assume 1 == #valid[~input#1.base]; {19805#(= |old(#length)| |#length|)} is VALID [2022-02-20 23:38:03,046 INFO L290 TraceCheckUtils]: 9: Hoare triple {19805#(= |old(#length)| |#length|)} assume ~input#1.offset < #length[~input#1.base] && ~input#1.offset >= 0; {19805#(= |old(#length)| |#length|)} is VALID [2022-02-20 23:38:03,046 INFO L290 TraceCheckUtils]: 10: Hoare triple {19805#(= |old(#length)| |#length|)} assume !(0 == #t~nondet4#1);havoc #t~mem3#1.base, #t~mem3#1.offset;havoc #t~nondet4#1; {19805#(= |old(#length)| |#length|)} is VALID [2022-02-20 23:38:03,047 INFO L290 TraceCheckUtils]: 11: Hoare triple {19805#(= |old(#length)| |#length|)} #t~post2#1 := ~i~0#1;~i~0#1 := 1 + #t~post2#1;havoc #t~post2#1; {19805#(= |old(#length)| |#length|)} is VALID [2022-02-20 23:38:03,047 INFO L290 TraceCheckUtils]: 12: Hoare triple {19805#(= |old(#length)| |#length|)} assume !!(~i~0#1 < 2); {19805#(= |old(#length)| |#length|)} is VALID [2022-02-20 23:38:03,047 INFO L290 TraceCheckUtils]: 13: Hoare triple {19805#(= |old(#length)| |#length|)} SUMMARY for call #t~mem3#1.base, #t~mem3#1.offset := read~$Pointer$(~#commands~0.base, ~#commands~0.offset + 9 * ~i~0#1, 4); srcloc: L693 {19805#(= |old(#length)| |#length|)} is VALID [2022-02-20 23:38:03,047 INFO L290 TraceCheckUtils]: 14: Hoare triple {19805#(= |old(#length)| |#length|)} assume 1 == #valid[#t~mem3#1.base]; {19805#(= |old(#length)| |#length|)} is VALID [2022-02-20 23:38:03,048 INFO L290 TraceCheckUtils]: 15: Hoare triple {19805#(= |old(#length)| |#length|)} assume #t~mem3#1.offset < #length[#t~mem3#1.base] && #t~mem3#1.offset >= 0; {19805#(= |old(#length)| |#length|)} is VALID [2022-02-20 23:38:03,048 INFO L290 TraceCheckUtils]: 16: Hoare triple {19805#(= |old(#length)| |#length|)} assume 1 == #valid[~input#1.base]; {19805#(= |old(#length)| |#length|)} is VALID [2022-02-20 23:38:03,048 INFO L290 TraceCheckUtils]: 17: Hoare triple {19805#(= |old(#length)| |#length|)} assume ~input#1.offset < #length[~input#1.base] && ~input#1.offset >= 0; {19805#(= |old(#length)| |#length|)} is VALID [2022-02-20 23:38:03,048 INFO L290 TraceCheckUtils]: 18: Hoare triple {19805#(= |old(#length)| |#length|)} assume !(0 == #t~nondet4#1);havoc #t~mem3#1.base, #t~mem3#1.offset;havoc #t~nondet4#1; {19805#(= |old(#length)| |#length|)} is VALID [2022-02-20 23:38:03,049 INFO L290 TraceCheckUtils]: 19: Hoare triple {19805#(= |old(#length)| |#length|)} #t~post2#1 := ~i~0#1;~i~0#1 := 1 + #t~post2#1;havoc #t~post2#1; {19805#(= |old(#length)| |#length|)} is VALID [2022-02-20 23:38:03,049 INFO L290 TraceCheckUtils]: 20: Hoare triple {19805#(= |old(#length)| |#length|)} assume !(~i~0#1 < 2); {19805#(= |old(#length)| |#length|)} is VALID [2022-02-20 23:38:03,049 INFO L290 TraceCheckUtils]: 21: Hoare triple {19805#(= |old(#length)| |#length|)} assume true; {19805#(= |old(#length)| |#length|)} is VALID [2022-02-20 23:38:03,049 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {19805#(= |old(#length)| |#length|)} {19781#(= 3 (select |#length| 4))} #101#return; {19781#(= 3 (select |#length| 4))} is VALID [2022-02-20 23:38:03,050 INFO L272 TraceCheckUtils]: 23: Hoare triple {19781#(= 3 (select |#length| 4))} call parse_input(4, 0); {19802#(and (= 3 (select |#length| 4)) (= |parse_input_#in~input#1.base| 4) (= |parse_input_#in~input#1.offset| 0))} is VALID [2022-02-20 23:38:03,050 INFO L290 TraceCheckUtils]: 24: Hoare triple {19802#(and (= 3 (select |#length| 4)) (= |parse_input_#in~input#1.base| 4) (= |parse_input_#in~input#1.offset| 0))} ~input#1.base, ~input#1.offset := #in~input#1.base, #in~input#1.offset;~i~0#1 := 0; {19803#(and (= (+ (select |#length| |parse_input_~input#1.base|) (- 3)) 0) (= |parse_input_~input#1.offset| 0))} is VALID [2022-02-20 23:38:03,050 INFO L290 TraceCheckUtils]: 25: Hoare triple {19803#(and (= (+ (select |#length| |parse_input_~input#1.base|) (- 3)) 0) (= |parse_input_~input#1.offset| 0))} assume !!(~i~0#1 < 2); {19803#(and (= (+ (select |#length| |parse_input_~input#1.base|) (- 3)) 0) (= |parse_input_~input#1.offset| 0))} is VALID [2022-02-20 23:38:03,051 INFO L290 TraceCheckUtils]: 26: Hoare triple {19803#(and (= (+ (select |#length| |parse_input_~input#1.base|) (- 3)) 0) (= |parse_input_~input#1.offset| 0))} SUMMARY for call #t~mem3#1.base, #t~mem3#1.offset := read~$Pointer$(~#commands~0.base, ~#commands~0.offset + 9 * ~i~0#1, 4); srcloc: L693 {19803#(and (= (+ (select |#length| |parse_input_~input#1.base|) (- 3)) 0) (= |parse_input_~input#1.offset| 0))} is VALID [2022-02-20 23:38:03,051 INFO L290 TraceCheckUtils]: 27: Hoare triple {19803#(and (= (+ (select |#length| |parse_input_~input#1.base|) (- 3)) 0) (= |parse_input_~input#1.offset| 0))} assume 1 == #valid[#t~mem3#1.base]; {19803#(and (= (+ (select |#length| |parse_input_~input#1.base|) (- 3)) 0) (= |parse_input_~input#1.offset| 0))} is VALID [2022-02-20 23:38:03,052 INFO L290 TraceCheckUtils]: 28: Hoare triple {19803#(and (= (+ (select |#length| |parse_input_~input#1.base|) (- 3)) 0) (= |parse_input_~input#1.offset| 0))} assume #t~mem3#1.offset < #length[#t~mem3#1.base] && #t~mem3#1.offset >= 0; {19803#(and (= (+ (select |#length| |parse_input_~input#1.base|) (- 3)) 0) (= |parse_input_~input#1.offset| 0))} is VALID [2022-02-20 23:38:03,052 INFO L290 TraceCheckUtils]: 29: Hoare triple {19803#(and (= (+ (select |#length| |parse_input_~input#1.base|) (- 3)) 0) (= |parse_input_~input#1.offset| 0))} assume 1 == #valid[~input#1.base]; {19803#(and (= (+ (select |#length| |parse_input_~input#1.base|) (- 3)) 0) (= |parse_input_~input#1.offset| 0))} is VALID [2022-02-20 23:38:03,052 INFO L290 TraceCheckUtils]: 30: Hoare triple {19803#(and (= (+ (select |#length| |parse_input_~input#1.base|) (- 3)) 0) (= |parse_input_~input#1.offset| 0))} assume !(~input#1.offset < #length[~input#1.base] && ~input#1.offset >= 0); {19780#false} is VALID [2022-02-20 23:38:03,052 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-02-20 23:38:03,052 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:38:03,052 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775352975] [2022-02-20 23:38:03,053 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1775352975] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 23:38:03,053 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [23393869] [2022-02-20 23:38:03,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:38:03,053 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:38:03,053 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:38:03,054 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 23:38:03,055 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-02-20 23:38:03,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:38:03,104 INFO L263 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 14 conjunts are in the unsatisfiable core [2022-02-20 23:38:03,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:38:03,111 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:38:03,264 INFO L290 TraceCheckUtils]: 0: Hoare triple {19779#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(3, 1);call write~init~int(99, 1, 0, 1);call write~init~int(49, 1, 1, 1);call write~init~int(0, 1, 2, 1);call #Ultimate.allocInit(3, 2);call write~init~int(99, 2, 0, 1);call write~init~int(50, 2, 1, 1);call write~init~int(0, 2, 2, 1);call #Ultimate.allocInit(3, 3);call write~init~int(99, 3, 0, 1);call write~init~int(49, 3, 1, 1);call write~init~int(0, 3, 2, 1);call #Ultimate.allocInit(3, 4);call write~init~int(99, 4, 0, 1);call write~init~int(49, 4, 1, 1);call write~init~int(0, 4, 2, 1);call #Ultimate.allocInit(3, 5);call write~init~int(99, 5, 0, 1);call write~init~int(50, 5, 1, 1);call write~init~int(0, 5, 2, 1);~state~0 := ~unnamed3~0~STATE_1;~global~0.base, ~global~0.offset := 0, 0;~#commands~0.base, ~#commands~0.offset := 6, 0;call #Ultimate.allocInit(18, 6);call write~init~$Pointer$(1, 0, ~#commands~0.base, ~#commands~0.offset, 4);call write~init~$Pointer$(#funAddr~c1.base, #funAddr~c1.offset, ~#commands~0.base, 4 + ~#commands~0.offset, 4);call write~init~int((if ~unnamed3~0~STATE_1 % 256 <= 127 then ~unnamed3~0~STATE_1 % 256 else ~unnamed3~0~STATE_1 % 256 - 256), ~#commands~0.base, 8 + ~#commands~0.offset, 1);call write~init~$Pointer$(2, 0, ~#commands~0.base, 9 + ~#commands~0.offset, 4);call write~init~$Pointer$(#funAddr~c2.base, #funAddr~c2.offset, ~#commands~0.base, 13 + ~#commands~0.offset, 4);call write~init~int((if ~unnamed3~0~STATE_2 % 256 <= 127 then ~unnamed3~0~STATE_2 % 256 else ~unnamed3~0~STATE_2 % 256 - 256), ~#commands~0.base, 17 + ~#commands~0.offset, 1); {19809#(<= 3 (select |#length| 4))} is VALID [2022-02-20 23:38:03,265 INFO L290 TraceCheckUtils]: 1: Hoare triple {19809#(<= 3 (select |#length| 4))} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1; {19809#(<= 3 (select |#length| 4))} is VALID [2022-02-20 23:38:03,265 INFO L272 TraceCheckUtils]: 2: Hoare triple {19809#(<= 3 (select |#length| 4))} call parse_input(3, 0); {19805#(= |old(#length)| |#length|)} is VALID [2022-02-20 23:38:03,266 INFO L290 TraceCheckUtils]: 3: Hoare triple {19805#(= |old(#length)| |#length|)} ~input#1.base, ~input#1.offset := #in~input#1.base, #in~input#1.offset;~i~0#1 := 0; {19805#(= |old(#length)| |#length|)} is VALID [2022-02-20 23:38:03,266 INFO L290 TraceCheckUtils]: 4: Hoare triple {19805#(= |old(#length)| |#length|)} assume !!(~i~0#1 < 2); {19805#(= |old(#length)| |#length|)} is VALID [2022-02-20 23:38:03,266 INFO L290 TraceCheckUtils]: 5: Hoare triple {19805#(= |old(#length)| |#length|)} SUMMARY for call #t~mem3#1.base, #t~mem3#1.offset := read~$Pointer$(~#commands~0.base, ~#commands~0.offset + 9 * ~i~0#1, 4); srcloc: L693 {19805#(= |old(#length)| |#length|)} is VALID [2022-02-20 23:38:03,266 INFO L290 TraceCheckUtils]: 6: Hoare triple {19805#(= |old(#length)| |#length|)} assume 1 == #valid[#t~mem3#1.base]; {19805#(= |old(#length)| |#length|)} is VALID [2022-02-20 23:38:03,267 INFO L290 TraceCheckUtils]: 7: Hoare triple {19805#(= |old(#length)| |#length|)} assume #t~mem3#1.offset < #length[#t~mem3#1.base] && #t~mem3#1.offset >= 0; {19805#(= |old(#length)| |#length|)} is VALID [2022-02-20 23:38:03,267 INFO L290 TraceCheckUtils]: 8: Hoare triple {19805#(= |old(#length)| |#length|)} assume 1 == #valid[~input#1.base]; {19805#(= |old(#length)| |#length|)} is VALID [2022-02-20 23:38:03,267 INFO L290 TraceCheckUtils]: 9: Hoare triple {19805#(= |old(#length)| |#length|)} assume ~input#1.offset < #length[~input#1.base] && ~input#1.offset >= 0; {19805#(= |old(#length)| |#length|)} is VALID [2022-02-20 23:38:03,267 INFO L290 TraceCheckUtils]: 10: Hoare triple {19805#(= |old(#length)| |#length|)} assume !(0 == #t~nondet4#1);havoc #t~mem3#1.base, #t~mem3#1.offset;havoc #t~nondet4#1; {19805#(= |old(#length)| |#length|)} is VALID [2022-02-20 23:38:03,268 INFO L290 TraceCheckUtils]: 11: Hoare triple {19805#(= |old(#length)| |#length|)} #t~post2#1 := ~i~0#1;~i~0#1 := 1 + #t~post2#1;havoc #t~post2#1; {19805#(= |old(#length)| |#length|)} is VALID [2022-02-20 23:38:03,268 INFO L290 TraceCheckUtils]: 12: Hoare triple {19805#(= |old(#length)| |#length|)} assume !!(~i~0#1 < 2); {19805#(= |old(#length)| |#length|)} is VALID [2022-02-20 23:38:03,268 INFO L290 TraceCheckUtils]: 13: Hoare triple {19805#(= |old(#length)| |#length|)} SUMMARY for call #t~mem3#1.base, #t~mem3#1.offset := read~$Pointer$(~#commands~0.base, ~#commands~0.offset + 9 * ~i~0#1, 4); srcloc: L693 {19805#(= |old(#length)| |#length|)} is VALID [2022-02-20 23:38:03,268 INFO L290 TraceCheckUtils]: 14: Hoare triple {19805#(= |old(#length)| |#length|)} assume 1 == #valid[#t~mem3#1.base]; {19805#(= |old(#length)| |#length|)} is VALID [2022-02-20 23:38:03,269 INFO L290 TraceCheckUtils]: 15: Hoare triple {19805#(= |old(#length)| |#length|)} assume #t~mem3#1.offset < #length[#t~mem3#1.base] && #t~mem3#1.offset >= 0; {19805#(= |old(#length)| |#length|)} is VALID [2022-02-20 23:38:03,269 INFO L290 TraceCheckUtils]: 16: Hoare triple {19805#(= |old(#length)| |#length|)} assume 1 == #valid[~input#1.base]; {19805#(= |old(#length)| |#length|)} is VALID [2022-02-20 23:38:03,269 INFO L290 TraceCheckUtils]: 17: Hoare triple {19805#(= |old(#length)| |#length|)} assume ~input#1.offset < #length[~input#1.base] && ~input#1.offset >= 0; {19805#(= |old(#length)| |#length|)} is VALID [2022-02-20 23:38:03,269 INFO L290 TraceCheckUtils]: 18: Hoare triple {19805#(= |old(#length)| |#length|)} assume !(0 == #t~nondet4#1);havoc #t~mem3#1.base, #t~mem3#1.offset;havoc #t~nondet4#1; {19805#(= |old(#length)| |#length|)} is VALID [2022-02-20 23:38:03,270 INFO L290 TraceCheckUtils]: 19: Hoare triple {19805#(= |old(#length)| |#length|)} #t~post2#1 := ~i~0#1;~i~0#1 := 1 + #t~post2#1;havoc #t~post2#1; {19805#(= |old(#length)| |#length|)} is VALID [2022-02-20 23:38:03,270 INFO L290 TraceCheckUtils]: 20: Hoare triple {19805#(= |old(#length)| |#length|)} assume !(~i~0#1 < 2); {19805#(= |old(#length)| |#length|)} is VALID [2022-02-20 23:38:03,270 INFO L290 TraceCheckUtils]: 21: Hoare triple {19805#(= |old(#length)| |#length|)} assume true; {19805#(= |old(#length)| |#length|)} is VALID [2022-02-20 23:38:03,271 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {19805#(= |old(#length)| |#length|)} {19809#(<= 3 (select |#length| 4))} #101#return; {19809#(<= 3 (select |#length| 4))} is VALID [2022-02-20 23:38:03,271 INFO L272 TraceCheckUtils]: 23: Hoare triple {19809#(<= 3 (select |#length| 4))} call parse_input(4, 0); {19879#(and (<= 3 (select |#length| 4)) (= |parse_input_#in~input#1.base| 4) (= |parse_input_#in~input#1.offset| 0))} is VALID [2022-02-20 23:38:03,271 INFO L290 TraceCheckUtils]: 24: Hoare triple {19879#(and (<= 3 (select |#length| 4)) (= |parse_input_#in~input#1.base| 4) (= |parse_input_#in~input#1.offset| 0))} ~input#1.base, ~input#1.offset := #in~input#1.base, #in~input#1.offset;~i~0#1 := 0; {19883#(and (<= 3 (select |#length| 4)) (= |parse_input_~input#1.base| 4) (= |parse_input_~input#1.offset| 0))} is VALID [2022-02-20 23:38:03,272 INFO L290 TraceCheckUtils]: 25: Hoare triple {19883#(and (<= 3 (select |#length| 4)) (= |parse_input_~input#1.base| 4) (= |parse_input_~input#1.offset| 0))} assume !!(~i~0#1 < 2); {19883#(and (<= 3 (select |#length| 4)) (= |parse_input_~input#1.base| 4) (= |parse_input_~input#1.offset| 0))} is VALID [2022-02-20 23:38:03,272 INFO L290 TraceCheckUtils]: 26: Hoare triple {19883#(and (<= 3 (select |#length| 4)) (= |parse_input_~input#1.base| 4) (= |parse_input_~input#1.offset| 0))} SUMMARY for call #t~mem3#1.base, #t~mem3#1.offset := read~$Pointer$(~#commands~0.base, ~#commands~0.offset + 9 * ~i~0#1, 4); srcloc: L693 {19883#(and (<= 3 (select |#length| 4)) (= |parse_input_~input#1.base| 4) (= |parse_input_~input#1.offset| 0))} is VALID [2022-02-20 23:38:03,273 INFO L290 TraceCheckUtils]: 27: Hoare triple {19883#(and (<= 3 (select |#length| 4)) (= |parse_input_~input#1.base| 4) (= |parse_input_~input#1.offset| 0))} assume 1 == #valid[#t~mem3#1.base]; {19883#(and (<= 3 (select |#length| 4)) (= |parse_input_~input#1.base| 4) (= |parse_input_~input#1.offset| 0))} is VALID [2022-02-20 23:38:03,273 INFO L290 TraceCheckUtils]: 28: Hoare triple {19883#(and (<= 3 (select |#length| 4)) (= |parse_input_~input#1.base| 4) (= |parse_input_~input#1.offset| 0))} assume #t~mem3#1.offset < #length[#t~mem3#1.base] && #t~mem3#1.offset >= 0; {19883#(and (<= 3 (select |#length| 4)) (= |parse_input_~input#1.base| 4) (= |parse_input_~input#1.offset| 0))} is VALID [2022-02-20 23:38:03,273 INFO L290 TraceCheckUtils]: 29: Hoare triple {19883#(and (<= 3 (select |#length| 4)) (= |parse_input_~input#1.base| 4) (= |parse_input_~input#1.offset| 0))} assume 1 == #valid[~input#1.base]; {19883#(and (<= 3 (select |#length| 4)) (= |parse_input_~input#1.base| 4) (= |parse_input_~input#1.offset| 0))} is VALID [2022-02-20 23:38:03,274 INFO L290 TraceCheckUtils]: 30: Hoare triple {19883#(and (<= 3 (select |#length| 4)) (= |parse_input_~input#1.base| 4) (= |parse_input_~input#1.offset| 0))} assume !(~input#1.offset < #length[~input#1.base] && ~input#1.offset >= 0); {19780#false} is VALID [2022-02-20 23:38:03,274 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-02-20 23:38:03,274 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:38:03,519 INFO L290 TraceCheckUtils]: 30: Hoare triple {19902#(and (< |parse_input_~input#1.offset| (select |#length| |parse_input_~input#1.base|)) (<= 0 |parse_input_~input#1.offset|))} assume !(~input#1.offset < #length[~input#1.base] && ~input#1.offset >= 0); {19780#false} is VALID [2022-02-20 23:38:03,519 INFO L290 TraceCheckUtils]: 29: Hoare triple {19902#(and (< |parse_input_~input#1.offset| (select |#length| |parse_input_~input#1.base|)) (<= 0 |parse_input_~input#1.offset|))} assume 1 == #valid[~input#1.base]; {19902#(and (< |parse_input_~input#1.offset| (select |#length| |parse_input_~input#1.base|)) (<= 0 |parse_input_~input#1.offset|))} is VALID [2022-02-20 23:38:03,529 INFO L290 TraceCheckUtils]: 28: Hoare triple {19902#(and (< |parse_input_~input#1.offset| (select |#length| |parse_input_~input#1.base|)) (<= 0 |parse_input_~input#1.offset|))} assume #t~mem3#1.offset < #length[#t~mem3#1.base] && #t~mem3#1.offset >= 0; {19902#(and (< |parse_input_~input#1.offset| (select |#length| |parse_input_~input#1.base|)) (<= 0 |parse_input_~input#1.offset|))} is VALID [2022-02-20 23:38:03,530 INFO L290 TraceCheckUtils]: 27: Hoare triple {19902#(and (< |parse_input_~input#1.offset| (select |#length| |parse_input_~input#1.base|)) (<= 0 |parse_input_~input#1.offset|))} assume 1 == #valid[#t~mem3#1.base]; {19902#(and (< |parse_input_~input#1.offset| (select |#length| |parse_input_~input#1.base|)) (<= 0 |parse_input_~input#1.offset|))} is VALID [2022-02-20 23:38:03,530 INFO L290 TraceCheckUtils]: 26: Hoare triple {19902#(and (< |parse_input_~input#1.offset| (select |#length| |parse_input_~input#1.base|)) (<= 0 |parse_input_~input#1.offset|))} SUMMARY for call #t~mem3#1.base, #t~mem3#1.offset := read~$Pointer$(~#commands~0.base, ~#commands~0.offset + 9 * ~i~0#1, 4); srcloc: L693 {19902#(and (< |parse_input_~input#1.offset| (select |#length| |parse_input_~input#1.base|)) (<= 0 |parse_input_~input#1.offset|))} is VALID [2022-02-20 23:38:03,531 INFO L290 TraceCheckUtils]: 25: Hoare triple {19902#(and (< |parse_input_~input#1.offset| (select |#length| |parse_input_~input#1.base|)) (<= 0 |parse_input_~input#1.offset|))} assume !!(~i~0#1 < 2); {19902#(and (< |parse_input_~input#1.offset| (select |#length| |parse_input_~input#1.base|)) (<= 0 |parse_input_~input#1.offset|))} is VALID [2022-02-20 23:38:03,532 INFO L290 TraceCheckUtils]: 24: Hoare triple {19921#(and (< |parse_input_#in~input#1.offset| (select |#length| |parse_input_#in~input#1.base|)) (<= 0 |parse_input_#in~input#1.offset|))} ~input#1.base, ~input#1.offset := #in~input#1.base, #in~input#1.offset;~i~0#1 := 0; {19902#(and (< |parse_input_~input#1.offset| (select |#length| |parse_input_~input#1.base|)) (<= 0 |parse_input_~input#1.offset|))} is VALID [2022-02-20 23:38:03,533 INFO L272 TraceCheckUtils]: 23: Hoare triple {19925#(< 0 (select |#length| 4))} call parse_input(4, 0); {19921#(and (< |parse_input_#in~input#1.offset| (select |#length| |parse_input_#in~input#1.base|)) (<= 0 |parse_input_#in~input#1.offset|))} is VALID [2022-02-20 23:38:03,533 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {19932#(or (< 0 (select |#length| 4)) (not (< 0 (select |old(#length)| 4))))} {19925#(< 0 (select |#length| 4))} #101#return; {19925#(< 0 (select |#length| 4))} is VALID [2022-02-20 23:38:03,534 INFO L290 TraceCheckUtils]: 21: Hoare triple {19932#(or (< 0 (select |#length| 4)) (not (< 0 (select |old(#length)| 4))))} assume true; {19932#(or (< 0 (select |#length| 4)) (not (< 0 (select |old(#length)| 4))))} is VALID [2022-02-20 23:38:03,534 INFO L290 TraceCheckUtils]: 20: Hoare triple {19932#(or (< 0 (select |#length| 4)) (not (< 0 (select |old(#length)| 4))))} assume !(~i~0#1 < 2); {19932#(or (< 0 (select |#length| 4)) (not (< 0 (select |old(#length)| 4))))} is VALID [2022-02-20 23:38:03,535 INFO L290 TraceCheckUtils]: 19: Hoare triple {19932#(or (< 0 (select |#length| 4)) (not (< 0 (select |old(#length)| 4))))} #t~post2#1 := ~i~0#1;~i~0#1 := 1 + #t~post2#1;havoc #t~post2#1; {19932#(or (< 0 (select |#length| 4)) (not (< 0 (select |old(#length)| 4))))} is VALID [2022-02-20 23:38:03,535 INFO L290 TraceCheckUtils]: 18: Hoare triple {19932#(or (< 0 (select |#length| 4)) (not (< 0 (select |old(#length)| 4))))} assume !(0 == #t~nondet4#1);havoc #t~mem3#1.base, #t~mem3#1.offset;havoc #t~nondet4#1; {19932#(or (< 0 (select |#length| 4)) (not (< 0 (select |old(#length)| 4))))} is VALID [2022-02-20 23:38:03,535 INFO L290 TraceCheckUtils]: 17: Hoare triple {19932#(or (< 0 (select |#length| 4)) (not (< 0 (select |old(#length)| 4))))} assume ~input#1.offset < #length[~input#1.base] && ~input#1.offset >= 0; {19932#(or (< 0 (select |#length| 4)) (not (< 0 (select |old(#length)| 4))))} is VALID [2022-02-20 23:38:03,536 INFO L290 TraceCheckUtils]: 16: Hoare triple {19932#(or (< 0 (select |#length| 4)) (not (< 0 (select |old(#length)| 4))))} assume 1 == #valid[~input#1.base]; {19932#(or (< 0 (select |#length| 4)) (not (< 0 (select |old(#length)| 4))))} is VALID [2022-02-20 23:38:03,536 INFO L290 TraceCheckUtils]: 15: Hoare triple {19932#(or (< 0 (select |#length| 4)) (not (< 0 (select |old(#length)| 4))))} assume #t~mem3#1.offset < #length[#t~mem3#1.base] && #t~mem3#1.offset >= 0; {19932#(or (< 0 (select |#length| 4)) (not (< 0 (select |old(#length)| 4))))} is VALID [2022-02-20 23:38:03,537 INFO L290 TraceCheckUtils]: 14: Hoare triple {19932#(or (< 0 (select |#length| 4)) (not (< 0 (select |old(#length)| 4))))} assume 1 == #valid[#t~mem3#1.base]; {19932#(or (< 0 (select |#length| 4)) (not (< 0 (select |old(#length)| 4))))} is VALID [2022-02-20 23:38:03,537 INFO L290 TraceCheckUtils]: 13: Hoare triple {19932#(or (< 0 (select |#length| 4)) (not (< 0 (select |old(#length)| 4))))} SUMMARY for call #t~mem3#1.base, #t~mem3#1.offset := read~$Pointer$(~#commands~0.base, ~#commands~0.offset + 9 * ~i~0#1, 4); srcloc: L693 {19932#(or (< 0 (select |#length| 4)) (not (< 0 (select |old(#length)| 4))))} is VALID [2022-02-20 23:38:03,538 INFO L290 TraceCheckUtils]: 12: Hoare triple {19932#(or (< 0 (select |#length| 4)) (not (< 0 (select |old(#length)| 4))))} assume !!(~i~0#1 < 2); {19932#(or (< 0 (select |#length| 4)) (not (< 0 (select |old(#length)| 4))))} is VALID [2022-02-20 23:38:03,538 INFO L290 TraceCheckUtils]: 11: Hoare triple {19932#(or (< 0 (select |#length| 4)) (not (< 0 (select |old(#length)| 4))))} #t~post2#1 := ~i~0#1;~i~0#1 := 1 + #t~post2#1;havoc #t~post2#1; {19932#(or (< 0 (select |#length| 4)) (not (< 0 (select |old(#length)| 4))))} is VALID [2022-02-20 23:38:03,538 INFO L290 TraceCheckUtils]: 10: Hoare triple {19932#(or (< 0 (select |#length| 4)) (not (< 0 (select |old(#length)| 4))))} assume !(0 == #t~nondet4#1);havoc #t~mem3#1.base, #t~mem3#1.offset;havoc #t~nondet4#1; {19932#(or (< 0 (select |#length| 4)) (not (< 0 (select |old(#length)| 4))))} is VALID [2022-02-20 23:38:03,539 INFO L290 TraceCheckUtils]: 9: Hoare triple {19932#(or (< 0 (select |#length| 4)) (not (< 0 (select |old(#length)| 4))))} assume ~input#1.offset < #length[~input#1.base] && ~input#1.offset >= 0; {19932#(or (< 0 (select |#length| 4)) (not (< 0 (select |old(#length)| 4))))} is VALID [2022-02-20 23:38:03,539 INFO L290 TraceCheckUtils]: 8: Hoare triple {19932#(or (< 0 (select |#length| 4)) (not (< 0 (select |old(#length)| 4))))} assume 1 == #valid[~input#1.base]; {19932#(or (< 0 (select |#length| 4)) (not (< 0 (select |old(#length)| 4))))} is VALID [2022-02-20 23:38:03,540 INFO L290 TraceCheckUtils]: 7: Hoare triple {19932#(or (< 0 (select |#length| 4)) (not (< 0 (select |old(#length)| 4))))} assume #t~mem3#1.offset < #length[#t~mem3#1.base] && #t~mem3#1.offset >= 0; {19932#(or (< 0 (select |#length| 4)) (not (< 0 (select |old(#length)| 4))))} is VALID [2022-02-20 23:38:03,540 INFO L290 TraceCheckUtils]: 6: Hoare triple {19932#(or (< 0 (select |#length| 4)) (not (< 0 (select |old(#length)| 4))))} assume 1 == #valid[#t~mem3#1.base]; {19932#(or (< 0 (select |#length| 4)) (not (< 0 (select |old(#length)| 4))))} is VALID [2022-02-20 23:38:03,541 INFO L290 TraceCheckUtils]: 5: Hoare triple {19932#(or (< 0 (select |#length| 4)) (not (< 0 (select |old(#length)| 4))))} SUMMARY for call #t~mem3#1.base, #t~mem3#1.offset := read~$Pointer$(~#commands~0.base, ~#commands~0.offset + 9 * ~i~0#1, 4); srcloc: L693 {19932#(or (< 0 (select |#length| 4)) (not (< 0 (select |old(#length)| 4))))} is VALID [2022-02-20 23:38:03,541 INFO L290 TraceCheckUtils]: 4: Hoare triple {19932#(or (< 0 (select |#length| 4)) (not (< 0 (select |old(#length)| 4))))} assume !!(~i~0#1 < 2); {19932#(or (< 0 (select |#length| 4)) (not (< 0 (select |old(#length)| 4))))} is VALID [2022-02-20 23:38:03,541 INFO L290 TraceCheckUtils]: 3: Hoare triple {19932#(or (< 0 (select |#length| 4)) (not (< 0 (select |old(#length)| 4))))} ~input#1.base, ~input#1.offset := #in~input#1.base, #in~input#1.offset;~i~0#1 := 0; {19932#(or (< 0 (select |#length| 4)) (not (< 0 (select |old(#length)| 4))))} is VALID [2022-02-20 23:38:03,542 INFO L272 TraceCheckUtils]: 2: Hoare triple {19925#(< 0 (select |#length| 4))} call parse_input(3, 0); {19932#(or (< 0 (select |#length| 4)) (not (< 0 (select |old(#length)| 4))))} is VALID [2022-02-20 23:38:03,542 INFO L290 TraceCheckUtils]: 1: Hoare triple {19925#(< 0 (select |#length| 4))} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1; {19925#(< 0 (select |#length| 4))} is VALID [2022-02-20 23:38:03,543 INFO L290 TraceCheckUtils]: 0: Hoare triple {19779#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(3, 1);call write~init~int(99, 1, 0, 1);call write~init~int(49, 1, 1, 1);call write~init~int(0, 1, 2, 1);call #Ultimate.allocInit(3, 2);call write~init~int(99, 2, 0, 1);call write~init~int(50, 2, 1, 1);call write~init~int(0, 2, 2, 1);call #Ultimate.allocInit(3, 3);call write~init~int(99, 3, 0, 1);call write~init~int(49, 3, 1, 1);call write~init~int(0, 3, 2, 1);call #Ultimate.allocInit(3, 4);call write~init~int(99, 4, 0, 1);call write~init~int(49, 4, 1, 1);call write~init~int(0, 4, 2, 1);call #Ultimate.allocInit(3, 5);call write~init~int(99, 5, 0, 1);call write~init~int(50, 5, 1, 1);call write~init~int(0, 5, 2, 1);~state~0 := ~unnamed3~0~STATE_1;~global~0.base, ~global~0.offset := 0, 0;~#commands~0.base, ~#commands~0.offset := 6, 0;call #Ultimate.allocInit(18, 6);call write~init~$Pointer$(1, 0, ~#commands~0.base, ~#commands~0.offset, 4);call write~init~$Pointer$(#funAddr~c1.base, #funAddr~c1.offset, ~#commands~0.base, 4 + ~#commands~0.offset, 4);call write~init~int((if ~unnamed3~0~STATE_1 % 256 <= 127 then ~unnamed3~0~STATE_1 % 256 else ~unnamed3~0~STATE_1 % 256 - 256), ~#commands~0.base, 8 + ~#commands~0.offset, 1);call write~init~$Pointer$(2, 0, ~#commands~0.base, 9 + ~#commands~0.offset, 4);call write~init~$Pointer$(#funAddr~c2.base, #funAddr~c2.offset, ~#commands~0.base, 13 + ~#commands~0.offset, 4);call write~init~int((if ~unnamed3~0~STATE_2 % 256 <= 127 then ~unnamed3~0~STATE_2 % 256 else ~unnamed3~0~STATE_2 % 256 - 256), ~#commands~0.base, 17 + ~#commands~0.offset, 1); {19925#(< 0 (select |#length| 4))} is VALID [2022-02-20 23:38:03,543 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-02-20 23:38:03,543 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [23393869] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 23:38:03,543 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 23:38:03,543 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 12 [2022-02-20 23:38:03,543 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517082822] [2022-02-20 23:38:03,543 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 23:38:03,544 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.8461538461538463) internal successors, (50), 9 states have internal predecessors, (50), 3 states have call successors, (6), 6 states have call predecessors, (6), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 31 [2022-02-20 23:38:03,544 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:38:03,544 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 14 states, 13 states have (on average 3.8461538461538463) internal successors, (50), 9 states have internal predecessors, (50), 3 states have call successors, (6), 6 states have call predecessors, (6), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 23:38:03,579 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:38:03,580 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-02-20 23:38:03,580 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:38:03,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-02-20 23:38:03,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2022-02-20 23:38:03,580 INFO L87 Difference]: Start difference. First operand 427 states and 581 transitions. Second operand has 14 states, 13 states have (on average 3.8461538461538463) internal successors, (50), 9 states have internal predecessors, (50), 3 states have call successors, (6), 6 states have call predecessors, (6), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 23:38:04,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:38:04,504 INFO L93 Difference]: Finished difference Result 475 states and 608 transitions. [2022-02-20 23:38:04,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-20 23:38:04,504 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.8461538461538463) internal successors, (50), 9 states have internal predecessors, (50), 3 states have call successors, (6), 6 states have call predecessors, (6), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 31 [2022-02-20 23:38:04,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:38:04,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 3.8461538461538463) internal successors, (50), 9 states have internal predecessors, (50), 3 states have call successors, (6), 6 states have call predecessors, (6), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 23:38:04,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 195 transitions. [2022-02-20 23:38:04,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 3.8461538461538463) internal successors, (50), 9 states have internal predecessors, (50), 3 states have call successors, (6), 6 states have call predecessors, (6), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 23:38:04,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 195 transitions. [2022-02-20 23:38:04,507 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 195 transitions. [2022-02-20 23:38:04,657 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 195 edges. 195 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:38:04,664 INFO L225 Difference]: With dead ends: 475 [2022-02-20 23:38:04,665 INFO L226 Difference]: Without dead ends: 475 [2022-02-20 23:38:04,665 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=167, Invalid=433, Unknown=0, NotChecked=0, Total=600 [2022-02-20 23:38:04,665 INFO L933 BasicCegarLoop]: 58 mSDtfsCounter, 475 mSDsluCounter, 257 mSDsCounter, 0 mSdLazyCounter, 301 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 475 SdHoareTripleChecker+Valid, 315 SdHoareTripleChecker+Invalid, 337 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 301 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 23:38:04,665 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [475 Valid, 315 Invalid, 337 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 301 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-20 23:38:04,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 475 states. [2022-02-20 23:38:04,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 475 to 433. [2022-02-20 23:38:04,670 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:38:04,670 INFO L82 GeneralOperation]: Start isEquivalent. First operand 475 states. Second operand has 433 states, 389 states have (on average 1.4138817480719794) internal successors, (550), 414 states have internal predecessors, (550), 9 states have call successors, (9), 9 states have call predecessors, (9), 17 states have return successors, (23), 9 states have call predecessors, (23), 9 states have call successors, (23) [2022-02-20 23:38:04,671 INFO L74 IsIncluded]: Start isIncluded. First operand 475 states. Second operand has 433 states, 389 states have (on average 1.4138817480719794) internal successors, (550), 414 states have internal predecessors, (550), 9 states have call successors, (9), 9 states have call predecessors, (9), 17 states have return successors, (23), 9 states have call predecessors, (23), 9 states have call successors, (23) [2022-02-20 23:38:04,671 INFO L87 Difference]: Start difference. First operand 475 states. Second operand has 433 states, 389 states have (on average 1.4138817480719794) internal successors, (550), 414 states have internal predecessors, (550), 9 states have call successors, (9), 9 states have call predecessors, (9), 17 states have return successors, (23), 9 states have call predecessors, (23), 9 states have call successors, (23) [2022-02-20 23:38:04,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:38:04,680 INFO L93 Difference]: Finished difference Result 475 states and 608 transitions. [2022-02-20 23:38:04,680 INFO L276 IsEmpty]: Start isEmpty. Operand 475 states and 608 transitions. [2022-02-20 23:38:04,680 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:38:04,680 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:38:04,681 INFO L74 IsIncluded]: Start isIncluded. First operand has 433 states, 389 states have (on average 1.4138817480719794) internal successors, (550), 414 states have internal predecessors, (550), 9 states have call successors, (9), 9 states have call predecessors, (9), 17 states have return successors, (23), 9 states have call predecessors, (23), 9 states have call successors, (23) Second operand 475 states. [2022-02-20 23:38:04,681 INFO L87 Difference]: Start difference. First operand has 433 states, 389 states have (on average 1.4138817480719794) internal successors, (550), 414 states have internal predecessors, (550), 9 states have call successors, (9), 9 states have call predecessors, (9), 17 states have return successors, (23), 9 states have call predecessors, (23), 9 states have call successors, (23) Second operand 475 states. [2022-02-20 23:38:04,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:38:04,690 INFO L93 Difference]: Finished difference Result 475 states and 608 transitions. [2022-02-20 23:38:04,690 INFO L276 IsEmpty]: Start isEmpty. Operand 475 states and 608 transitions. [2022-02-20 23:38:04,690 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:38:04,690 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:38:04,690 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:38:04,690 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:38:04,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 433 states, 389 states have (on average 1.4138817480719794) internal successors, (550), 414 states have internal predecessors, (550), 9 states have call successors, (9), 9 states have call predecessors, (9), 17 states have return successors, (23), 9 states have call predecessors, (23), 9 states have call successors, (23) [2022-02-20 23:38:04,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 433 states to 433 states and 582 transitions. [2022-02-20 23:38:04,697 INFO L78 Accepts]: Start accepts. Automaton has 433 states and 582 transitions. Word has length 31 [2022-02-20 23:38:04,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:38:04,698 INFO L470 AbstractCegarLoop]: Abstraction has 433 states and 582 transitions. [2022-02-20 23:38:04,698 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.8461538461538463) internal successors, (50), 9 states have internal predecessors, (50), 3 states have call successors, (6), 6 states have call predecessors, (6), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 23:38:04,698 INFO L276 IsEmpty]: Start isEmpty. Operand 433 states and 582 transitions. [2022-02-20 23:38:04,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-02-20 23:38:04,698 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:38:04,698 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:38:04,731 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-02-20 23:38:04,914 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-02-20 23:38:04,915 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting parse_inputErr1REQUIRES_VIOLATION === [parse_inputErr0REQUIRES_VIOLATION, parse_inputErr1REQUIRES_VIOLATION, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2022-02-20 23:38:04,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:38:04,915 INFO L85 PathProgramCache]: Analyzing trace with hash -117381739, now seen corresponding path program 1 times [2022-02-20 23:38:04,915 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:38:04,915 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277356863] [2022-02-20 23:38:04,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:38:04,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:38:04,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:38:05,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 23:38:05,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:38:05,085 INFO L290 TraceCheckUtils]: 0: Hoare triple {21902#(and (= ~global~0.base |old(~global~0.base)|) (= |old(#length)| |#length|) (= |old(~global~0.offset)| ~global~0.offset) (= ~state~0 |old(~state~0)|) (= |old(#valid)| |#valid|))} ~input#1.base, ~input#1.offset := #in~input#1.base, #in~input#1.offset;~i~0#1 := 0; {21903#(= (select |#length| 6) (select |old(#length)| 6))} is VALID [2022-02-20 23:38:05,085 INFO L290 TraceCheckUtils]: 1: Hoare triple {21903#(= (select |#length| 6) (select |old(#length)| 6))} assume !!(~i~0#1 < 2); {21903#(= (select |#length| 6) (select |old(#length)| 6))} is VALID [2022-02-20 23:38:05,086 INFO L290 TraceCheckUtils]: 2: Hoare triple {21903#(= (select |#length| 6) (select |old(#length)| 6))} SUMMARY for call #t~mem3#1.base, #t~mem3#1.offset := read~$Pointer$(~#commands~0.base, ~#commands~0.offset + 9 * ~i~0#1, 4); srcloc: L693 {21904#(or (and (= (select |#length| 6) (select |old(#length)| 6)) (= (select |#valid| |~#commands~0.base|) 1)) (not (= 6 |~#commands~0.base|)))} is VALID [2022-02-20 23:38:05,086 INFO L290 TraceCheckUtils]: 3: Hoare triple {21904#(or (and (= (select |#length| 6) (select |old(#length)| 6)) (= (select |#valid| |~#commands~0.base|) 1)) (not (= 6 |~#commands~0.base|)))} assume 1 == #valid[#t~mem3#1.base]; {21904#(or (and (= (select |#length| 6) (select |old(#length)| 6)) (= (select |#valid| |~#commands~0.base|) 1)) (not (= 6 |~#commands~0.base|)))} is VALID [2022-02-20 23:38:05,087 INFO L290 TraceCheckUtils]: 4: Hoare triple {21904#(or (and (= (select |#length| 6) (select |old(#length)| 6)) (= (select |#valid| |~#commands~0.base|) 1)) (not (= 6 |~#commands~0.base|)))} assume #t~mem3#1.offset < #length[#t~mem3#1.base] && #t~mem3#1.offset >= 0; {21904#(or (and (= (select |#length| 6) (select |old(#length)| 6)) (= (select |#valid| |~#commands~0.base|) 1)) (not (= 6 |~#commands~0.base|)))} is VALID [2022-02-20 23:38:05,087 INFO L290 TraceCheckUtils]: 5: Hoare triple {21904#(or (and (= (select |#length| 6) (select |old(#length)| 6)) (= (select |#valid| |~#commands~0.base|) 1)) (not (= 6 |~#commands~0.base|)))} assume 1 == #valid[~input#1.base]; {21904#(or (and (= (select |#length| 6) (select |old(#length)| 6)) (= (select |#valid| |~#commands~0.base|) 1)) (not (= 6 |~#commands~0.base|)))} is VALID [2022-02-20 23:38:05,088 INFO L290 TraceCheckUtils]: 6: Hoare triple {21904#(or (and (= (select |#length| 6) (select |old(#length)| 6)) (= (select |#valid| |~#commands~0.base|) 1)) (not (= 6 |~#commands~0.base|)))} assume ~input#1.offset < #length[~input#1.base] && ~input#1.offset >= 0; {21904#(or (and (= (select |#length| 6) (select |old(#length)| 6)) (= (select |#valid| |~#commands~0.base|) 1)) (not (= 6 |~#commands~0.base|)))} is VALID [2022-02-20 23:38:05,088 INFO L290 TraceCheckUtils]: 7: Hoare triple {21904#(or (and (= (select |#length| 6) (select |old(#length)| 6)) (= (select |#valid| |~#commands~0.base|) 1)) (not (= 6 |~#commands~0.base|)))} assume 0 == #t~nondet4#1;havoc #t~mem3#1.base, #t~mem3#1.offset;havoc #t~nondet4#1; {21904#(or (and (= (select |#length| 6) (select |old(#length)| 6)) (= (select |#valid| |~#commands~0.base|) 1)) (not (= 6 |~#commands~0.base|)))} is VALID [2022-02-20 23:38:05,088 INFO L290 TraceCheckUtils]: 8: Hoare triple {21904#(or (and (= (select |#length| 6) (select |old(#length)| 6)) (= (select |#valid| |~#commands~0.base|) 1)) (not (= 6 |~#commands~0.base|)))} SUMMARY for call #t~mem5#1 := read~int(~#commands~0.base, 8 + (~#commands~0.offset + 9 * ~i~0#1), 1); srcloc: L694 {21904#(or (and (= (select |#length| 6) (select |old(#length)| 6)) (= (select |#valid| |~#commands~0.base|) 1)) (not (= 6 |~#commands~0.base|)))} is VALID [2022-02-20 23:38:05,089 INFO L290 TraceCheckUtils]: 9: Hoare triple {21904#(or (and (= (select |#length| 6) (select |old(#length)| 6)) (= (select |#valid| |~#commands~0.base|) 1)) (not (= 6 |~#commands~0.base|)))} assume ~state~0 >= #t~mem5#1;havoc #t~mem5#1; {21904#(or (and (= (select |#length| 6) (select |old(#length)| 6)) (= (select |#valid| |~#commands~0.base|) 1)) (not (= 6 |~#commands~0.base|)))} is VALID [2022-02-20 23:38:05,089 INFO L290 TraceCheckUtils]: 10: Hoare triple {21904#(or (and (= (select |#length| 6) (select |old(#length)| 6)) (= (select |#valid| |~#commands~0.base|) 1)) (not (= 6 |~#commands~0.base|)))} SUMMARY for call #t~mem6#1.base, #t~mem6#1.offset := read~$Pointer$(~#commands~0.base, 4 + (~#commands~0.offset + 9 * ~i~0#1), 4); srcloc: L695 {21904#(or (and (= (select |#length| 6) (select |old(#length)| 6)) (= (select |#valid| |~#commands~0.base|) 1)) (not (= 6 |~#commands~0.base|)))} is VALID [2022-02-20 23:38:05,090 INFO L290 TraceCheckUtils]: 11: Hoare triple {21904#(or (and (= (select |#length| 6) (select |old(#length)| 6)) (= (select |#valid| |~#commands~0.base|) 1)) (not (= 6 |~#commands~0.base|)))} assume { :begin_inline_##fun~~TO~VOID } true;##fun~~TO~VOID_#in~#fp#1.base, ##fun~~TO~VOID_#in~#fp#1.offset := #t~mem6#1.base, #t~mem6#1.offset; {21904#(or (and (= (select |#length| 6) (select |old(#length)| 6)) (= (select |#valid| |~#commands~0.base|) 1)) (not (= 6 |~#commands~0.base|)))} is VALID [2022-02-20 23:38:05,090 INFO L290 TraceCheckUtils]: 12: Hoare triple {21904#(or (and (= (select |#length| 6) (select |old(#length)| 6)) (= (select |#valid| |~#commands~0.base|) 1)) (not (= 6 |~#commands~0.base|)))} assume !(##fun~~TO~VOID_#in~#fp#1.base == #funAddr~c2.base && ##fun~~TO~VOID_#in~#fp#1.offset == #funAddr~c2.offset);assume { :begin_inline_c1 } true;havoc c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset, c1_~x~0#1.base, c1_~x~0#1.offset;call c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset := #Ultimate.allocOnHeap(1);c1_~x~0#1.base, c1_~x~0#1.offset := c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset;havoc c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset; {21905#(or (and (not (= |parse_input_c1_~x~0#1.base| 6)) (= (select |#length| 6) (select |old(#length)| 6))) (not (= 6 |~#commands~0.base|)))} is VALID [2022-02-20 23:38:05,091 INFO L290 TraceCheckUtils]: 13: Hoare triple {21905#(or (and (not (= |parse_input_c1_~x~0#1.base| 6)) (= (select |#length| 6) (select |old(#length)| 6))) (not (= 6 |~#commands~0.base|)))} assume !(c1_~x~0#1.base == 0 && c1_~x~0#1.offset == 0); {21905#(or (and (not (= |parse_input_c1_~x~0#1.base| 6)) (= (select |#length| 6) (select |old(#length)| 6))) (not (= 6 |~#commands~0.base|)))} is VALID [2022-02-20 23:38:05,091 INFO L290 TraceCheckUtils]: 14: Hoare triple {21905#(or (and (not (= |parse_input_c1_~x~0#1.base| 6)) (= (select |#length| 6) (select |old(#length)| 6))) (not (= 6 |~#commands~0.base|)))} assume !(~global~0.base != 0 || ~global~0.offset != 0); {21905#(or (and (not (= |parse_input_c1_~x~0#1.base| 6)) (= (select |#length| 6) (select |old(#length)| 6))) (not (= 6 |~#commands~0.base|)))} is VALID [2022-02-20 23:38:05,092 INFO L290 TraceCheckUtils]: 15: Hoare triple {21905#(or (and (not (= |parse_input_c1_~x~0#1.base| 6)) (= (select |#length| 6) (select |old(#length)| 6))) (not (= 6 |~#commands~0.base|)))} ~global~0.base, ~global~0.offset := c1_~x~0#1.base, c1_~x~0#1.offset;~state~0 := ~unnamed3~0~STATE_2; {21906#(or (= (select |#length| 6) (select |old(#length)| 6)) (not (= 6 |~#commands~0.base|)))} is VALID [2022-02-20 23:38:05,092 INFO L290 TraceCheckUtils]: 16: Hoare triple {21906#(or (= (select |#length| 6) (select |old(#length)| 6)) (not (= 6 |~#commands~0.base|)))} assume { :end_inline_c1 } true; {21906#(or (= (select |#length| 6) (select |old(#length)| 6)) (not (= 6 |~#commands~0.base|)))} is VALID [2022-02-20 23:38:05,092 INFO L290 TraceCheckUtils]: 17: Hoare triple {21906#(or (= (select |#length| 6) (select |old(#length)| 6)) (not (= 6 |~#commands~0.base|)))} assume { :end_inline_##fun~~TO~VOID } true;havoc #t~mem6#1.base, #t~mem6#1.offset; {21906#(or (= (select |#length| 6) (select |old(#length)| 6)) (not (= 6 |~#commands~0.base|)))} is VALID [2022-02-20 23:38:05,093 INFO L290 TraceCheckUtils]: 18: Hoare triple {21906#(or (= (select |#length| 6) (select |old(#length)| 6)) (not (= 6 |~#commands~0.base|)))} assume true; {21906#(or (= (select |#length| 6) (select |old(#length)| 6)) (not (= 6 |~#commands~0.base|)))} is VALID [2022-02-20 23:38:05,093 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {21906#(or (= (select |#length| 6) (select |old(#length)| 6)) (not (= 6 |~#commands~0.base|)))} {21877#(and (= 6 |~#commands~0.base|) (= (select |#length| 6) 18) (<= 0 |~#commands~0.offset|) (<= |~#commands~0.offset| 0))} #101#return; {21877#(and (= 6 |~#commands~0.base|) (= (select |#length| 6) 18) (<= 0 |~#commands~0.offset|) (<= |~#commands~0.offset| 0))} is VALID [2022-02-20 23:38:05,095 INFO L290 TraceCheckUtils]: 0: Hoare triple {21875#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(3, 1);call write~init~int(99, 1, 0, 1);call write~init~int(49, 1, 1, 1);call write~init~int(0, 1, 2, 1);call #Ultimate.allocInit(3, 2);call write~init~int(99, 2, 0, 1);call write~init~int(50, 2, 1, 1);call write~init~int(0, 2, 2, 1);call #Ultimate.allocInit(3, 3);call write~init~int(99, 3, 0, 1);call write~init~int(49, 3, 1, 1);call write~init~int(0, 3, 2, 1);call #Ultimate.allocInit(3, 4);call write~init~int(99, 4, 0, 1);call write~init~int(49, 4, 1, 1);call write~init~int(0, 4, 2, 1);call #Ultimate.allocInit(3, 5);call write~init~int(99, 5, 0, 1);call write~init~int(50, 5, 1, 1);call write~init~int(0, 5, 2, 1);~state~0 := ~unnamed3~0~STATE_1;~global~0.base, ~global~0.offset := 0, 0;~#commands~0.base, ~#commands~0.offset := 6, 0;call #Ultimate.allocInit(18, 6);call write~init~$Pointer$(1, 0, ~#commands~0.base, ~#commands~0.offset, 4);call write~init~$Pointer$(#funAddr~c1.base, #funAddr~c1.offset, ~#commands~0.base, 4 + ~#commands~0.offset, 4);call write~init~int((if ~unnamed3~0~STATE_1 % 256 <= 127 then ~unnamed3~0~STATE_1 % 256 else ~unnamed3~0~STATE_1 % 256 - 256), ~#commands~0.base, 8 + ~#commands~0.offset, 1);call write~init~$Pointer$(2, 0, ~#commands~0.base, 9 + ~#commands~0.offset, 4);call write~init~$Pointer$(#funAddr~c2.base, #funAddr~c2.offset, ~#commands~0.base, 13 + ~#commands~0.offset, 4);call write~init~int((if ~unnamed3~0~STATE_2 % 256 <= 127 then ~unnamed3~0~STATE_2 % 256 else ~unnamed3~0~STATE_2 % 256 - 256), ~#commands~0.base, 17 + ~#commands~0.offset, 1); {21877#(and (= 6 |~#commands~0.base|) (= (select |#length| 6) 18) (<= 0 |~#commands~0.offset|) (<= |~#commands~0.offset| 0))} is VALID [2022-02-20 23:38:05,095 INFO L290 TraceCheckUtils]: 1: Hoare triple {21877#(and (= 6 |~#commands~0.base|) (= (select |#length| 6) 18) (<= 0 |~#commands~0.offset|) (<= |~#commands~0.offset| 0))} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1; {21877#(and (= 6 |~#commands~0.base|) (= (select |#length| 6) 18) (<= 0 |~#commands~0.offset|) (<= |~#commands~0.offset| 0))} is VALID [2022-02-20 23:38:05,096 INFO L272 TraceCheckUtils]: 2: Hoare triple {21877#(and (= 6 |~#commands~0.base|) (= (select |#length| 6) 18) (<= 0 |~#commands~0.offset|) (<= |~#commands~0.offset| 0))} call parse_input(3, 0); {21902#(and (= ~global~0.base |old(~global~0.base)|) (= |old(#length)| |#length|) (= |old(~global~0.offset)| ~global~0.offset) (= ~state~0 |old(~state~0)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 23:38:05,096 INFO L290 TraceCheckUtils]: 3: Hoare triple {21902#(and (= ~global~0.base |old(~global~0.base)|) (= |old(#length)| |#length|) (= |old(~global~0.offset)| ~global~0.offset) (= ~state~0 |old(~state~0)|) (= |old(#valid)| |#valid|))} ~input#1.base, ~input#1.offset := #in~input#1.base, #in~input#1.offset;~i~0#1 := 0; {21903#(= (select |#length| 6) (select |old(#length)| 6))} is VALID [2022-02-20 23:38:05,096 INFO L290 TraceCheckUtils]: 4: Hoare triple {21903#(= (select |#length| 6) (select |old(#length)| 6))} assume !!(~i~0#1 < 2); {21903#(= (select |#length| 6) (select |old(#length)| 6))} is VALID [2022-02-20 23:38:05,097 INFO L290 TraceCheckUtils]: 5: Hoare triple {21903#(= (select |#length| 6) (select |old(#length)| 6))} SUMMARY for call #t~mem3#1.base, #t~mem3#1.offset := read~$Pointer$(~#commands~0.base, ~#commands~0.offset + 9 * ~i~0#1, 4); srcloc: L693 {21904#(or (and (= (select |#length| 6) (select |old(#length)| 6)) (= (select |#valid| |~#commands~0.base|) 1)) (not (= 6 |~#commands~0.base|)))} is VALID [2022-02-20 23:38:05,098 INFO L290 TraceCheckUtils]: 6: Hoare triple {21904#(or (and (= (select |#length| 6) (select |old(#length)| 6)) (= (select |#valid| |~#commands~0.base|) 1)) (not (= 6 |~#commands~0.base|)))} assume 1 == #valid[#t~mem3#1.base]; {21904#(or (and (= (select |#length| 6) (select |old(#length)| 6)) (= (select |#valid| |~#commands~0.base|) 1)) (not (= 6 |~#commands~0.base|)))} is VALID [2022-02-20 23:38:05,099 INFO L290 TraceCheckUtils]: 7: Hoare triple {21904#(or (and (= (select |#length| 6) (select |old(#length)| 6)) (= (select |#valid| |~#commands~0.base|) 1)) (not (= 6 |~#commands~0.base|)))} assume #t~mem3#1.offset < #length[#t~mem3#1.base] && #t~mem3#1.offset >= 0; {21904#(or (and (= (select |#length| 6) (select |old(#length)| 6)) (= (select |#valid| |~#commands~0.base|) 1)) (not (= 6 |~#commands~0.base|)))} is VALID [2022-02-20 23:38:05,099 INFO L290 TraceCheckUtils]: 8: Hoare triple {21904#(or (and (= (select |#length| 6) (select |old(#length)| 6)) (= (select |#valid| |~#commands~0.base|) 1)) (not (= 6 |~#commands~0.base|)))} assume 1 == #valid[~input#1.base]; {21904#(or (and (= (select |#length| 6) (select |old(#length)| 6)) (= (select |#valid| |~#commands~0.base|) 1)) (not (= 6 |~#commands~0.base|)))} is VALID [2022-02-20 23:38:05,100 INFO L290 TraceCheckUtils]: 9: Hoare triple {21904#(or (and (= (select |#length| 6) (select |old(#length)| 6)) (= (select |#valid| |~#commands~0.base|) 1)) (not (= 6 |~#commands~0.base|)))} assume ~input#1.offset < #length[~input#1.base] && ~input#1.offset >= 0; {21904#(or (and (= (select |#length| 6) (select |old(#length)| 6)) (= (select |#valid| |~#commands~0.base|) 1)) (not (= 6 |~#commands~0.base|)))} is VALID [2022-02-20 23:38:05,100 INFO L290 TraceCheckUtils]: 10: Hoare triple {21904#(or (and (= (select |#length| 6) (select |old(#length)| 6)) (= (select |#valid| |~#commands~0.base|) 1)) (not (= 6 |~#commands~0.base|)))} assume 0 == #t~nondet4#1;havoc #t~mem3#1.base, #t~mem3#1.offset;havoc #t~nondet4#1; {21904#(or (and (= (select |#length| 6) (select |old(#length)| 6)) (= (select |#valid| |~#commands~0.base|) 1)) (not (= 6 |~#commands~0.base|)))} is VALID [2022-02-20 23:38:05,100 INFO L290 TraceCheckUtils]: 11: Hoare triple {21904#(or (and (= (select |#length| 6) (select |old(#length)| 6)) (= (select |#valid| |~#commands~0.base|) 1)) (not (= 6 |~#commands~0.base|)))} SUMMARY for call #t~mem5#1 := read~int(~#commands~0.base, 8 + (~#commands~0.offset + 9 * ~i~0#1), 1); srcloc: L694 {21904#(or (and (= (select |#length| 6) (select |old(#length)| 6)) (= (select |#valid| |~#commands~0.base|) 1)) (not (= 6 |~#commands~0.base|)))} is VALID [2022-02-20 23:38:05,101 INFO L290 TraceCheckUtils]: 12: Hoare triple {21904#(or (and (= (select |#length| 6) (select |old(#length)| 6)) (= (select |#valid| |~#commands~0.base|) 1)) (not (= 6 |~#commands~0.base|)))} assume ~state~0 >= #t~mem5#1;havoc #t~mem5#1; {21904#(or (and (= (select |#length| 6) (select |old(#length)| 6)) (= (select |#valid| |~#commands~0.base|) 1)) (not (= 6 |~#commands~0.base|)))} is VALID [2022-02-20 23:38:05,101 INFO L290 TraceCheckUtils]: 13: Hoare triple {21904#(or (and (= (select |#length| 6) (select |old(#length)| 6)) (= (select |#valid| |~#commands~0.base|) 1)) (not (= 6 |~#commands~0.base|)))} SUMMARY for call #t~mem6#1.base, #t~mem6#1.offset := read~$Pointer$(~#commands~0.base, 4 + (~#commands~0.offset + 9 * ~i~0#1), 4); srcloc: L695 {21904#(or (and (= (select |#length| 6) (select |old(#length)| 6)) (= (select |#valid| |~#commands~0.base|) 1)) (not (= 6 |~#commands~0.base|)))} is VALID [2022-02-20 23:38:05,102 INFO L290 TraceCheckUtils]: 14: Hoare triple {21904#(or (and (= (select |#length| 6) (select |old(#length)| 6)) (= (select |#valid| |~#commands~0.base|) 1)) (not (= 6 |~#commands~0.base|)))} assume { :begin_inline_##fun~~TO~VOID } true;##fun~~TO~VOID_#in~#fp#1.base, ##fun~~TO~VOID_#in~#fp#1.offset := #t~mem6#1.base, #t~mem6#1.offset; {21904#(or (and (= (select |#length| 6) (select |old(#length)| 6)) (= (select |#valid| |~#commands~0.base|) 1)) (not (= 6 |~#commands~0.base|)))} is VALID [2022-02-20 23:38:05,102 INFO L290 TraceCheckUtils]: 15: Hoare triple {21904#(or (and (= (select |#length| 6) (select |old(#length)| 6)) (= (select |#valid| |~#commands~0.base|) 1)) (not (= 6 |~#commands~0.base|)))} assume !(##fun~~TO~VOID_#in~#fp#1.base == #funAddr~c2.base && ##fun~~TO~VOID_#in~#fp#1.offset == #funAddr~c2.offset);assume { :begin_inline_c1 } true;havoc c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset, c1_~x~0#1.base, c1_~x~0#1.offset;call c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset := #Ultimate.allocOnHeap(1);c1_~x~0#1.base, c1_~x~0#1.offset := c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset;havoc c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset; {21905#(or (and (not (= |parse_input_c1_~x~0#1.base| 6)) (= (select |#length| 6) (select |old(#length)| 6))) (not (= 6 |~#commands~0.base|)))} is VALID [2022-02-20 23:38:05,103 INFO L290 TraceCheckUtils]: 16: Hoare triple {21905#(or (and (not (= |parse_input_c1_~x~0#1.base| 6)) (= (select |#length| 6) (select |old(#length)| 6))) (not (= 6 |~#commands~0.base|)))} assume !(c1_~x~0#1.base == 0 && c1_~x~0#1.offset == 0); {21905#(or (and (not (= |parse_input_c1_~x~0#1.base| 6)) (= (select |#length| 6) (select |old(#length)| 6))) (not (= 6 |~#commands~0.base|)))} is VALID [2022-02-20 23:38:05,103 INFO L290 TraceCheckUtils]: 17: Hoare triple {21905#(or (and (not (= |parse_input_c1_~x~0#1.base| 6)) (= (select |#length| 6) (select |old(#length)| 6))) (not (= 6 |~#commands~0.base|)))} assume !(~global~0.base != 0 || ~global~0.offset != 0); {21905#(or (and (not (= |parse_input_c1_~x~0#1.base| 6)) (= (select |#length| 6) (select |old(#length)| 6))) (not (= 6 |~#commands~0.base|)))} is VALID [2022-02-20 23:38:05,104 INFO L290 TraceCheckUtils]: 18: Hoare triple {21905#(or (and (not (= |parse_input_c1_~x~0#1.base| 6)) (= (select |#length| 6) (select |old(#length)| 6))) (not (= 6 |~#commands~0.base|)))} ~global~0.base, ~global~0.offset := c1_~x~0#1.base, c1_~x~0#1.offset;~state~0 := ~unnamed3~0~STATE_2; {21906#(or (= (select |#length| 6) (select |old(#length)| 6)) (not (= 6 |~#commands~0.base|)))} is VALID [2022-02-20 23:38:05,104 INFO L290 TraceCheckUtils]: 19: Hoare triple {21906#(or (= (select |#length| 6) (select |old(#length)| 6)) (not (= 6 |~#commands~0.base|)))} assume { :end_inline_c1 } true; {21906#(or (= (select |#length| 6) (select |old(#length)| 6)) (not (= 6 |~#commands~0.base|)))} is VALID [2022-02-20 23:38:05,104 INFO L290 TraceCheckUtils]: 20: Hoare triple {21906#(or (= (select |#length| 6) (select |old(#length)| 6)) (not (= 6 |~#commands~0.base|)))} assume { :end_inline_##fun~~TO~VOID } true;havoc #t~mem6#1.base, #t~mem6#1.offset; {21906#(or (= (select |#length| 6) (select |old(#length)| 6)) (not (= 6 |~#commands~0.base|)))} is VALID [2022-02-20 23:38:05,105 INFO L290 TraceCheckUtils]: 21: Hoare triple {21906#(or (= (select |#length| 6) (select |old(#length)| 6)) (not (= 6 |~#commands~0.base|)))} assume true; {21906#(or (= (select |#length| 6) (select |old(#length)| 6)) (not (= 6 |~#commands~0.base|)))} is VALID [2022-02-20 23:38:05,105 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {21906#(or (= (select |#length| 6) (select |old(#length)| 6)) (not (= 6 |~#commands~0.base|)))} {21877#(and (= 6 |~#commands~0.base|) (= (select |#length| 6) 18) (<= 0 |~#commands~0.offset|) (<= |~#commands~0.offset| 0))} #101#return; {21877#(and (= 6 |~#commands~0.base|) (= (select |#length| 6) 18) (<= 0 |~#commands~0.offset|) (<= |~#commands~0.offset| 0))} is VALID [2022-02-20 23:38:05,106 INFO L272 TraceCheckUtils]: 23: Hoare triple {21877#(and (= 6 |~#commands~0.base|) (= (select |#length| 6) 18) (<= 0 |~#commands~0.offset|) (<= |~#commands~0.offset| 0))} call parse_input(4, 0); {21898#(and (= (+ (select |#length| |~#commands~0.base|) (- 18)) 0) (<= 0 |~#commands~0.offset|) (<= |~#commands~0.offset| 0))} is VALID [2022-02-20 23:38:05,106 INFO L290 TraceCheckUtils]: 24: Hoare triple {21898#(and (= (+ (select |#length| |~#commands~0.base|) (- 18)) 0) (<= 0 |~#commands~0.offset|) (<= |~#commands~0.offset| 0))} ~input#1.base, ~input#1.offset := #in~input#1.base, #in~input#1.offset;~i~0#1 := 0; {21899#(and (= (+ (select |#length| |~#commands~0.base|) (- 18)) 0) (<= 0 |~#commands~0.offset|) (= |parse_input_~i~0#1| 0) (<= |~#commands~0.offset| 0))} is VALID [2022-02-20 23:38:05,107 INFO L290 TraceCheckUtils]: 25: Hoare triple {21899#(and (= (+ (select |#length| |~#commands~0.base|) (- 18)) 0) (<= 0 |~#commands~0.offset|) (= |parse_input_~i~0#1| 0) (<= |~#commands~0.offset| 0))} assume !!(~i~0#1 < 2); {21899#(and (= (+ (select |#length| |~#commands~0.base|) (- 18)) 0) (<= 0 |~#commands~0.offset|) (= |parse_input_~i~0#1| 0) (<= |~#commands~0.offset| 0))} is VALID [2022-02-20 23:38:05,107 INFO L290 TraceCheckUtils]: 26: Hoare triple {21899#(and (= (+ (select |#length| |~#commands~0.base|) (- 18)) 0) (<= 0 |~#commands~0.offset|) (= |parse_input_~i~0#1| 0) (<= |~#commands~0.offset| 0))} SUMMARY for call #t~mem3#1.base, #t~mem3#1.offset := read~$Pointer$(~#commands~0.base, ~#commands~0.offset + 9 * ~i~0#1, 4); srcloc: L693 {21899#(and (= (+ (select |#length| |~#commands~0.base|) (- 18)) 0) (<= 0 |~#commands~0.offset|) (= |parse_input_~i~0#1| 0) (<= |~#commands~0.offset| 0))} is VALID [2022-02-20 23:38:05,107 INFO L290 TraceCheckUtils]: 27: Hoare triple {21899#(and (= (+ (select |#length| |~#commands~0.base|) (- 18)) 0) (<= 0 |~#commands~0.offset|) (= |parse_input_~i~0#1| 0) (<= |~#commands~0.offset| 0))} assume 1 == #valid[#t~mem3#1.base]; {21899#(and (= (+ (select |#length| |~#commands~0.base|) (- 18)) 0) (<= 0 |~#commands~0.offset|) (= |parse_input_~i~0#1| 0) (<= |~#commands~0.offset| 0))} is VALID [2022-02-20 23:38:05,108 INFO L290 TraceCheckUtils]: 28: Hoare triple {21899#(and (= (+ (select |#length| |~#commands~0.base|) (- 18)) 0) (<= 0 |~#commands~0.offset|) (= |parse_input_~i~0#1| 0) (<= |~#commands~0.offset| 0))} assume #t~mem3#1.offset < #length[#t~mem3#1.base] && #t~mem3#1.offset >= 0; {21899#(and (= (+ (select |#length| |~#commands~0.base|) (- 18)) 0) (<= 0 |~#commands~0.offset|) (= |parse_input_~i~0#1| 0) (<= |~#commands~0.offset| 0))} is VALID [2022-02-20 23:38:05,108 INFO L290 TraceCheckUtils]: 29: Hoare triple {21899#(and (= (+ (select |#length| |~#commands~0.base|) (- 18)) 0) (<= 0 |~#commands~0.offset|) (= |parse_input_~i~0#1| 0) (<= |~#commands~0.offset| 0))} assume 1 == #valid[~input#1.base]; {21899#(and (= (+ (select |#length| |~#commands~0.base|) (- 18)) 0) (<= 0 |~#commands~0.offset|) (= |parse_input_~i~0#1| 0) (<= |~#commands~0.offset| 0))} is VALID [2022-02-20 23:38:05,109 INFO L290 TraceCheckUtils]: 30: Hoare triple {21899#(and (= (+ (select |#length| |~#commands~0.base|) (- 18)) 0) (<= 0 |~#commands~0.offset|) (= |parse_input_~i~0#1| 0) (<= |~#commands~0.offset| 0))} assume ~input#1.offset < #length[~input#1.base] && ~input#1.offset >= 0; {21899#(and (= (+ (select |#length| |~#commands~0.base|) (- 18)) 0) (<= 0 |~#commands~0.offset|) (= |parse_input_~i~0#1| 0) (<= |~#commands~0.offset| 0))} is VALID [2022-02-20 23:38:05,109 INFO L290 TraceCheckUtils]: 31: Hoare triple {21899#(and (= (+ (select |#length| |~#commands~0.base|) (- 18)) 0) (<= 0 |~#commands~0.offset|) (= |parse_input_~i~0#1| 0) (<= |~#commands~0.offset| 0))} assume !(0 == #t~nondet4#1);havoc #t~mem3#1.base, #t~mem3#1.offset;havoc #t~nondet4#1; {21899#(and (= (+ (select |#length| |~#commands~0.base|) (- 18)) 0) (<= 0 |~#commands~0.offset|) (= |parse_input_~i~0#1| 0) (<= |~#commands~0.offset| 0))} is VALID [2022-02-20 23:38:05,109 INFO L290 TraceCheckUtils]: 32: Hoare triple {21899#(and (= (+ (select |#length| |~#commands~0.base|) (- 18)) 0) (<= 0 |~#commands~0.offset|) (= |parse_input_~i~0#1| 0) (<= |~#commands~0.offset| 0))} #t~post2#1 := ~i~0#1;~i~0#1 := 1 + #t~post2#1;havoc #t~post2#1; {21900#(and (<= 9 (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset|)) (= (+ (select |#length| |~#commands~0.base|) (- 18)) 0) (<= |~#commands~0.offset| 0))} is VALID [2022-02-20 23:38:05,110 INFO L290 TraceCheckUtils]: 33: Hoare triple {21900#(and (<= 9 (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset|)) (= (+ (select |#length| |~#commands~0.base|) (- 18)) 0) (<= |~#commands~0.offset| 0))} assume !!(~i~0#1 < 2); {21901#(and (<= 9 (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset|)) (= (+ (select |#length| |~#commands~0.base|) (- 18)) 0) (<= (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset|) 9))} is VALID [2022-02-20 23:38:05,112 INFO L290 TraceCheckUtils]: 34: Hoare triple {21901#(and (<= 9 (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset|)) (= (+ (select |#length| |~#commands~0.base|) (- 18)) 0) (<= (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset|) 9))} assume !(4 + (~#commands~0.offset + 9 * ~i~0#1) <= #length[~#commands~0.base] && 0 <= ~#commands~0.offset + 9 * ~i~0#1); {21876#false} is VALID [2022-02-20 23:38:05,112 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:38:05,112 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:38:05,112 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277356863] [2022-02-20 23:38:05,112 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1277356863] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 23:38:05,112 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1487466751] [2022-02-20 23:38:05,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:38:05,112 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:38:05,112 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:38:05,113 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 23:38:05,114 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-02-20 23:38:05,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:38:05,168 INFO L263 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 21 conjunts are in the unsatisfiable core [2022-02-20 23:38:05,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:38:05,177 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:38:05,593 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:38:05,594 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-02-20 23:38:05,775 INFO L290 TraceCheckUtils]: 0: Hoare triple {21875#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(3, 1);call write~init~int(99, 1, 0, 1);call write~init~int(49, 1, 1, 1);call write~init~int(0, 1, 2, 1);call #Ultimate.allocInit(3, 2);call write~init~int(99, 2, 0, 1);call write~init~int(50, 2, 1, 1);call write~init~int(0, 2, 2, 1);call #Ultimate.allocInit(3, 3);call write~init~int(99, 3, 0, 1);call write~init~int(49, 3, 1, 1);call write~init~int(0, 3, 2, 1);call #Ultimate.allocInit(3, 4);call write~init~int(99, 4, 0, 1);call write~init~int(49, 4, 1, 1);call write~init~int(0, 4, 2, 1);call #Ultimate.allocInit(3, 5);call write~init~int(99, 5, 0, 1);call write~init~int(50, 5, 1, 1);call write~init~int(0, 5, 2, 1);~state~0 := ~unnamed3~0~STATE_1;~global~0.base, ~global~0.offset := 0, 0;~#commands~0.base, ~#commands~0.offset := 6, 0;call #Ultimate.allocInit(18, 6);call write~init~$Pointer$(1, 0, ~#commands~0.base, ~#commands~0.offset, 4);call write~init~$Pointer$(#funAddr~c1.base, #funAddr~c1.offset, ~#commands~0.base, 4 + ~#commands~0.offset, 4);call write~init~int((if ~unnamed3~0~STATE_1 % 256 <= 127 then ~unnamed3~0~STATE_1 % 256 else ~unnamed3~0~STATE_1 % 256 - 256), ~#commands~0.base, 8 + ~#commands~0.offset, 1);call write~init~$Pointer$(2, 0, ~#commands~0.base, 9 + ~#commands~0.offset, 4);call write~init~$Pointer$(#funAddr~c2.base, #funAddr~c2.offset, ~#commands~0.base, 13 + ~#commands~0.offset, 4);call write~init~int((if ~unnamed3~0~STATE_2 % 256 <= 127 then ~unnamed3~0~STATE_2 % 256 else ~unnamed3~0~STATE_2 % 256 - 256), ~#commands~0.base, 17 + ~#commands~0.offset, 1); {21910#(and (= 6 |~#commands~0.base|) (<= 18 (select |#length| 6)) (= |~#commands~0.offset| 0) (= (select |#valid| 6) 1))} is VALID [2022-02-20 23:38:05,776 INFO L290 TraceCheckUtils]: 1: Hoare triple {21910#(and (= 6 |~#commands~0.base|) (<= 18 (select |#length| 6)) (= |~#commands~0.offset| 0) (= (select |#valid| 6) 1))} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1; {21910#(and (= 6 |~#commands~0.base|) (<= 18 (select |#length| 6)) (= |~#commands~0.offset| 0) (= (select |#valid| 6) 1))} is VALID [2022-02-20 23:38:05,777 INFO L272 TraceCheckUtils]: 2: Hoare triple {21910#(and (= 6 |~#commands~0.base|) (<= 18 (select |#length| 6)) (= |~#commands~0.offset| 0) (= (select |#valid| 6) 1))} call parse_input(3, 0); {21917#(and (= |old(#length)| |#length|) (= 6 |~#commands~0.base|) (= |~#commands~0.offset| 0) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 23:38:05,777 INFO L290 TraceCheckUtils]: 3: Hoare triple {21917#(and (= |old(#length)| |#length|) (= 6 |~#commands~0.base|) (= |~#commands~0.offset| 0) (= |old(#valid)| |#valid|))} ~input#1.base, ~input#1.offset := #in~input#1.base, #in~input#1.offset;~i~0#1 := 0; {21917#(and (= |old(#length)| |#length|) (= 6 |~#commands~0.base|) (= |~#commands~0.offset| 0) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 23:38:05,777 INFO L290 TraceCheckUtils]: 4: Hoare triple {21917#(and (= |old(#length)| |#length|) (= 6 |~#commands~0.base|) (= |~#commands~0.offset| 0) (= |old(#valid)| |#valid|))} assume !!(~i~0#1 < 2); {21917#(and (= |old(#length)| |#length|) (= 6 |~#commands~0.base|) (= |~#commands~0.offset| 0) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 23:38:05,778 INFO L290 TraceCheckUtils]: 5: Hoare triple {21917#(and (= |old(#length)| |#length|) (= 6 |~#commands~0.base|) (= |~#commands~0.offset| 0) (= |old(#valid)| |#valid|))} SUMMARY for call #t~mem3#1.base, #t~mem3#1.offset := read~$Pointer$(~#commands~0.base, ~#commands~0.offset + 9 * ~i~0#1, 4); srcloc: L693 {21917#(and (= |old(#length)| |#length|) (= 6 |~#commands~0.base|) (= |~#commands~0.offset| 0) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 23:38:05,778 INFO L290 TraceCheckUtils]: 6: Hoare triple {21917#(and (= |old(#length)| |#length|) (= 6 |~#commands~0.base|) (= |~#commands~0.offset| 0) (= |old(#valid)| |#valid|))} assume 1 == #valid[#t~mem3#1.base]; {21917#(and (= |old(#length)| |#length|) (= 6 |~#commands~0.base|) (= |~#commands~0.offset| 0) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 23:38:05,779 INFO L290 TraceCheckUtils]: 7: Hoare triple {21917#(and (= |old(#length)| |#length|) (= 6 |~#commands~0.base|) (= |~#commands~0.offset| 0) (= |old(#valid)| |#valid|))} assume #t~mem3#1.offset < #length[#t~mem3#1.base] && #t~mem3#1.offset >= 0; {21917#(and (= |old(#length)| |#length|) (= 6 |~#commands~0.base|) (= |~#commands~0.offset| 0) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 23:38:05,779 INFO L290 TraceCheckUtils]: 8: Hoare triple {21917#(and (= |old(#length)| |#length|) (= 6 |~#commands~0.base|) (= |~#commands~0.offset| 0) (= |old(#valid)| |#valid|))} assume 1 == #valid[~input#1.base]; {21917#(and (= |old(#length)| |#length|) (= 6 |~#commands~0.base|) (= |~#commands~0.offset| 0) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 23:38:05,780 INFO L290 TraceCheckUtils]: 9: Hoare triple {21917#(and (= |old(#length)| |#length|) (= 6 |~#commands~0.base|) (= |~#commands~0.offset| 0) (= |old(#valid)| |#valid|))} assume ~input#1.offset < #length[~input#1.base] && ~input#1.offset >= 0; {21917#(and (= |old(#length)| |#length|) (= 6 |~#commands~0.base|) (= |~#commands~0.offset| 0) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 23:38:05,780 INFO L290 TraceCheckUtils]: 10: Hoare triple {21917#(and (= |old(#length)| |#length|) (= 6 |~#commands~0.base|) (= |~#commands~0.offset| 0) (= |old(#valid)| |#valid|))} assume 0 == #t~nondet4#1;havoc #t~mem3#1.base, #t~mem3#1.offset;havoc #t~nondet4#1; {21917#(and (= |old(#length)| |#length|) (= 6 |~#commands~0.base|) (= |~#commands~0.offset| 0) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 23:38:05,780 INFO L290 TraceCheckUtils]: 11: Hoare triple {21917#(and (= |old(#length)| |#length|) (= 6 |~#commands~0.base|) (= |~#commands~0.offset| 0) (= |old(#valid)| |#valid|))} SUMMARY for call #t~mem5#1 := read~int(~#commands~0.base, 8 + (~#commands~0.offset + 9 * ~i~0#1), 1); srcloc: L694 {21917#(and (= |old(#length)| |#length|) (= 6 |~#commands~0.base|) (= |~#commands~0.offset| 0) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 23:38:05,781 INFO L290 TraceCheckUtils]: 12: Hoare triple {21917#(and (= |old(#length)| |#length|) (= 6 |~#commands~0.base|) (= |~#commands~0.offset| 0) (= |old(#valid)| |#valid|))} assume ~state~0 >= #t~mem5#1;havoc #t~mem5#1; {21917#(and (= |old(#length)| |#length|) (= 6 |~#commands~0.base|) (= |~#commands~0.offset| 0) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 23:38:05,781 INFO L290 TraceCheckUtils]: 13: Hoare triple {21917#(and (= |old(#length)| |#length|) (= 6 |~#commands~0.base|) (= |~#commands~0.offset| 0) (= |old(#valid)| |#valid|))} SUMMARY for call #t~mem6#1.base, #t~mem6#1.offset := read~$Pointer$(~#commands~0.base, 4 + (~#commands~0.offset + 9 * ~i~0#1), 4); srcloc: L695 {21917#(and (= |old(#length)| |#length|) (= 6 |~#commands~0.base|) (= |~#commands~0.offset| 0) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 23:38:05,782 INFO L290 TraceCheckUtils]: 14: Hoare triple {21917#(and (= |old(#length)| |#length|) (= 6 |~#commands~0.base|) (= |~#commands~0.offset| 0) (= |old(#valid)| |#valid|))} assume { :begin_inline_##fun~~TO~VOID } true;##fun~~TO~VOID_#in~#fp#1.base, ##fun~~TO~VOID_#in~#fp#1.offset := #t~mem6#1.base, #t~mem6#1.offset; {21917#(and (= |old(#length)| |#length|) (= 6 |~#commands~0.base|) (= |~#commands~0.offset| 0) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 23:38:05,782 INFO L290 TraceCheckUtils]: 15: Hoare triple {21917#(and (= |old(#length)| |#length|) (= 6 |~#commands~0.base|) (= |~#commands~0.offset| 0) (= |old(#valid)| |#valid|))} assume !(##fun~~TO~VOID_#in~#fp#1.base == #funAddr~c2.base && ##fun~~TO~VOID_#in~#fp#1.offset == #funAddr~c2.offset);assume { :begin_inline_c1 } true;havoc c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset, c1_~x~0#1.base, c1_~x~0#1.offset;call c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset := #Ultimate.allocOnHeap(1);c1_~x~0#1.base, c1_~x~0#1.offset := c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset;havoc c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset; {21957#(and (= 6 |~#commands~0.base|) (= |~#commands~0.offset| 0) (exists ((|parse_input_c1_~x~0#1.base| Int) (v_ArrVal_31 Int)) (and (= (select |old(#valid)| |parse_input_c1_~x~0#1.base|) 0) (= |#length| (store |old(#length)| |parse_input_c1_~x~0#1.base| v_ArrVal_31)))))} is VALID [2022-02-20 23:38:05,783 INFO L290 TraceCheckUtils]: 16: Hoare triple {21957#(and (= 6 |~#commands~0.base|) (= |~#commands~0.offset| 0) (exists ((|parse_input_c1_~x~0#1.base| Int) (v_ArrVal_31 Int)) (and (= (select |old(#valid)| |parse_input_c1_~x~0#1.base|) 0) (= |#length| (store |old(#length)| |parse_input_c1_~x~0#1.base| v_ArrVal_31)))))} assume !(c1_~x~0#1.base == 0 && c1_~x~0#1.offset == 0); {21957#(and (= 6 |~#commands~0.base|) (= |~#commands~0.offset| 0) (exists ((|parse_input_c1_~x~0#1.base| Int) (v_ArrVal_31 Int)) (and (= (select |old(#valid)| |parse_input_c1_~x~0#1.base|) 0) (= |#length| (store |old(#length)| |parse_input_c1_~x~0#1.base| v_ArrVal_31)))))} is VALID [2022-02-20 23:38:05,784 INFO L290 TraceCheckUtils]: 17: Hoare triple {21957#(and (= 6 |~#commands~0.base|) (= |~#commands~0.offset| 0) (exists ((|parse_input_c1_~x~0#1.base| Int) (v_ArrVal_31 Int)) (and (= (select |old(#valid)| |parse_input_c1_~x~0#1.base|) 0) (= |#length| (store |old(#length)| |parse_input_c1_~x~0#1.base| v_ArrVal_31)))))} assume !(~global~0.base != 0 || ~global~0.offset != 0); {21957#(and (= 6 |~#commands~0.base|) (= |~#commands~0.offset| 0) (exists ((|parse_input_c1_~x~0#1.base| Int) (v_ArrVal_31 Int)) (and (= (select |old(#valid)| |parse_input_c1_~x~0#1.base|) 0) (= |#length| (store |old(#length)| |parse_input_c1_~x~0#1.base| v_ArrVal_31)))))} is VALID [2022-02-20 23:38:05,784 INFO L290 TraceCheckUtils]: 18: Hoare triple {21957#(and (= 6 |~#commands~0.base|) (= |~#commands~0.offset| 0) (exists ((|parse_input_c1_~x~0#1.base| Int) (v_ArrVal_31 Int)) (and (= (select |old(#valid)| |parse_input_c1_~x~0#1.base|) 0) (= |#length| (store |old(#length)| |parse_input_c1_~x~0#1.base| v_ArrVal_31)))))} ~global~0.base, ~global~0.offset := c1_~x~0#1.base, c1_~x~0#1.offset;~state~0 := ~unnamed3~0~STATE_2; {21957#(and (= 6 |~#commands~0.base|) (= |~#commands~0.offset| 0) (exists ((|parse_input_c1_~x~0#1.base| Int) (v_ArrVal_31 Int)) (and (= (select |old(#valid)| |parse_input_c1_~x~0#1.base|) 0) (= |#length| (store |old(#length)| |parse_input_c1_~x~0#1.base| v_ArrVal_31)))))} is VALID [2022-02-20 23:38:05,785 INFO L290 TraceCheckUtils]: 19: Hoare triple {21957#(and (= 6 |~#commands~0.base|) (= |~#commands~0.offset| 0) (exists ((|parse_input_c1_~x~0#1.base| Int) (v_ArrVal_31 Int)) (and (= (select |old(#valid)| |parse_input_c1_~x~0#1.base|) 0) (= |#length| (store |old(#length)| |parse_input_c1_~x~0#1.base| v_ArrVal_31)))))} assume { :end_inline_c1 } true; {21957#(and (= 6 |~#commands~0.base|) (= |~#commands~0.offset| 0) (exists ((|parse_input_c1_~x~0#1.base| Int) (v_ArrVal_31 Int)) (and (= (select |old(#valid)| |parse_input_c1_~x~0#1.base|) 0) (= |#length| (store |old(#length)| |parse_input_c1_~x~0#1.base| v_ArrVal_31)))))} is VALID [2022-02-20 23:38:05,785 INFO L290 TraceCheckUtils]: 20: Hoare triple {21957#(and (= 6 |~#commands~0.base|) (= |~#commands~0.offset| 0) (exists ((|parse_input_c1_~x~0#1.base| Int) (v_ArrVal_31 Int)) (and (= (select |old(#valid)| |parse_input_c1_~x~0#1.base|) 0) (= |#length| (store |old(#length)| |parse_input_c1_~x~0#1.base| v_ArrVal_31)))))} assume { :end_inline_##fun~~TO~VOID } true;havoc #t~mem6#1.base, #t~mem6#1.offset; {21957#(and (= 6 |~#commands~0.base|) (= |~#commands~0.offset| 0) (exists ((|parse_input_c1_~x~0#1.base| Int) (v_ArrVal_31 Int)) (and (= (select |old(#valid)| |parse_input_c1_~x~0#1.base|) 0) (= |#length| (store |old(#length)| |parse_input_c1_~x~0#1.base| v_ArrVal_31)))))} is VALID [2022-02-20 23:38:05,786 INFO L290 TraceCheckUtils]: 21: Hoare triple {21957#(and (= 6 |~#commands~0.base|) (= |~#commands~0.offset| 0) (exists ((|parse_input_c1_~x~0#1.base| Int) (v_ArrVal_31 Int)) (and (= (select |old(#valid)| |parse_input_c1_~x~0#1.base|) 0) (= |#length| (store |old(#length)| |parse_input_c1_~x~0#1.base| v_ArrVal_31)))))} assume true; {21957#(and (= 6 |~#commands~0.base|) (= |~#commands~0.offset| 0) (exists ((|parse_input_c1_~x~0#1.base| Int) (v_ArrVal_31 Int)) (and (= (select |old(#valid)| |parse_input_c1_~x~0#1.base|) 0) (= |#length| (store |old(#length)| |parse_input_c1_~x~0#1.base| v_ArrVal_31)))))} is VALID [2022-02-20 23:38:05,787 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {21957#(and (= 6 |~#commands~0.base|) (= |~#commands~0.offset| 0) (exists ((|parse_input_c1_~x~0#1.base| Int) (v_ArrVal_31 Int)) (and (= (select |old(#valid)| |parse_input_c1_~x~0#1.base|) 0) (= |#length| (store |old(#length)| |parse_input_c1_~x~0#1.base| v_ArrVal_31)))))} {21910#(and (= 6 |~#commands~0.base|) (<= 18 (select |#length| 6)) (= |~#commands~0.offset| 0) (= (select |#valid| 6) 1))} #101#return; {21979#(and (= 6 |~#commands~0.base|) (<= 18 (select |#length| 6)) (= |~#commands~0.offset| 0))} is VALID [2022-02-20 23:38:05,787 INFO L272 TraceCheckUtils]: 23: Hoare triple {21979#(and (= 6 |~#commands~0.base|) (<= 18 (select |#length| 6)) (= |~#commands~0.offset| 0))} call parse_input(4, 0); {21979#(and (= 6 |~#commands~0.base|) (<= 18 (select |#length| 6)) (= |~#commands~0.offset| 0))} is VALID [2022-02-20 23:38:05,787 INFO L290 TraceCheckUtils]: 24: Hoare triple {21979#(and (= 6 |~#commands~0.base|) (<= 18 (select |#length| 6)) (= |~#commands~0.offset| 0))} ~input#1.base, ~input#1.offset := #in~input#1.base, #in~input#1.offset;~i~0#1 := 0; {21986#(and (= 6 |~#commands~0.base|) (<= 18 (select |#length| 6)) (= |~#commands~0.offset| 0) (= |parse_input_~i~0#1| 0))} is VALID [2022-02-20 23:38:05,788 INFO L290 TraceCheckUtils]: 25: Hoare triple {21986#(and (= 6 |~#commands~0.base|) (<= 18 (select |#length| 6)) (= |~#commands~0.offset| 0) (= |parse_input_~i~0#1| 0))} assume !!(~i~0#1 < 2); {21986#(and (= 6 |~#commands~0.base|) (<= 18 (select |#length| 6)) (= |~#commands~0.offset| 0) (= |parse_input_~i~0#1| 0))} is VALID [2022-02-20 23:38:05,788 INFO L290 TraceCheckUtils]: 26: Hoare triple {21986#(and (= 6 |~#commands~0.base|) (<= 18 (select |#length| 6)) (= |~#commands~0.offset| 0) (= |parse_input_~i~0#1| 0))} SUMMARY for call #t~mem3#1.base, #t~mem3#1.offset := read~$Pointer$(~#commands~0.base, ~#commands~0.offset + 9 * ~i~0#1, 4); srcloc: L693 {21986#(and (= 6 |~#commands~0.base|) (<= 18 (select |#length| 6)) (= |~#commands~0.offset| 0) (= |parse_input_~i~0#1| 0))} is VALID [2022-02-20 23:38:05,789 INFO L290 TraceCheckUtils]: 27: Hoare triple {21986#(and (= 6 |~#commands~0.base|) (<= 18 (select |#length| 6)) (= |~#commands~0.offset| 0) (= |parse_input_~i~0#1| 0))} assume 1 == #valid[#t~mem3#1.base]; {21986#(and (= 6 |~#commands~0.base|) (<= 18 (select |#length| 6)) (= |~#commands~0.offset| 0) (= |parse_input_~i~0#1| 0))} is VALID [2022-02-20 23:38:05,789 INFO L290 TraceCheckUtils]: 28: Hoare triple {21986#(and (= 6 |~#commands~0.base|) (<= 18 (select |#length| 6)) (= |~#commands~0.offset| 0) (= |parse_input_~i~0#1| 0))} assume #t~mem3#1.offset < #length[#t~mem3#1.base] && #t~mem3#1.offset >= 0; {21986#(and (= 6 |~#commands~0.base|) (<= 18 (select |#length| 6)) (= |~#commands~0.offset| 0) (= |parse_input_~i~0#1| 0))} is VALID [2022-02-20 23:38:05,790 INFO L290 TraceCheckUtils]: 29: Hoare triple {21986#(and (= 6 |~#commands~0.base|) (<= 18 (select |#length| 6)) (= |~#commands~0.offset| 0) (= |parse_input_~i~0#1| 0))} assume 1 == #valid[~input#1.base]; {21986#(and (= 6 |~#commands~0.base|) (<= 18 (select |#length| 6)) (= |~#commands~0.offset| 0) (= |parse_input_~i~0#1| 0))} is VALID [2022-02-20 23:38:05,790 INFO L290 TraceCheckUtils]: 30: Hoare triple {21986#(and (= 6 |~#commands~0.base|) (<= 18 (select |#length| 6)) (= |~#commands~0.offset| 0) (= |parse_input_~i~0#1| 0))} assume ~input#1.offset < #length[~input#1.base] && ~input#1.offset >= 0; {21986#(and (= 6 |~#commands~0.base|) (<= 18 (select |#length| 6)) (= |~#commands~0.offset| 0) (= |parse_input_~i~0#1| 0))} is VALID [2022-02-20 23:38:05,791 INFO L290 TraceCheckUtils]: 31: Hoare triple {21986#(and (= 6 |~#commands~0.base|) (<= 18 (select |#length| 6)) (= |~#commands~0.offset| 0) (= |parse_input_~i~0#1| 0))} assume !(0 == #t~nondet4#1);havoc #t~mem3#1.base, #t~mem3#1.offset;havoc #t~nondet4#1; {21986#(and (= 6 |~#commands~0.base|) (<= 18 (select |#length| 6)) (= |~#commands~0.offset| 0) (= |parse_input_~i~0#1| 0))} is VALID [2022-02-20 23:38:05,791 INFO L290 TraceCheckUtils]: 32: Hoare triple {21986#(and (= 6 |~#commands~0.base|) (<= 18 (select |#length| 6)) (= |~#commands~0.offset| 0) (= |parse_input_~i~0#1| 0))} #t~post2#1 := ~i~0#1;~i~0#1 := 1 + #t~post2#1;havoc #t~post2#1; {22011#(and (= 6 |~#commands~0.base|) (<= 18 (select |#length| 6)) (= |parse_input_~i~0#1| 1) (= |~#commands~0.offset| 0))} is VALID [2022-02-20 23:38:05,791 INFO L290 TraceCheckUtils]: 33: Hoare triple {22011#(and (= 6 |~#commands~0.base|) (<= 18 (select |#length| 6)) (= |parse_input_~i~0#1| 1) (= |~#commands~0.offset| 0))} assume !!(~i~0#1 < 2); {22011#(and (= 6 |~#commands~0.base|) (<= 18 (select |#length| 6)) (= |parse_input_~i~0#1| 1) (= |~#commands~0.offset| 0))} is VALID [2022-02-20 23:38:05,792 INFO L290 TraceCheckUtils]: 34: Hoare triple {22011#(and (= 6 |~#commands~0.base|) (<= 18 (select |#length| 6)) (= |parse_input_~i~0#1| 1) (= |~#commands~0.offset| 0))} assume !(4 + (~#commands~0.offset + 9 * ~i~0#1) <= #length[~#commands~0.base] && 0 <= ~#commands~0.offset + 9 * ~i~0#1); {21876#false} is VALID [2022-02-20 23:38:05,792 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:38:05,792 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:38:06,060 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1487466751] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 23:38:06,060 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 23:38:06,060 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 6] total 16 [2022-02-20 23:38:06,060 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655391562] [2022-02-20 23:38:06,060 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 23:38:06,061 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 3.764705882352941) internal successors, (64), 14 states have internal predecessors, (64), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 35 [2022-02-20 23:38:06,061 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:38:06,061 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 18 states, 17 states have (on average 3.764705882352941) internal successors, (64), 14 states have internal predecessors, (64), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:38:06,113 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:38:06,113 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-02-20 23:38:06,114 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:38:06,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-02-20 23:38:06,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=394, Unknown=0, NotChecked=0, Total=462 [2022-02-20 23:38:06,114 INFO L87 Difference]: Start difference. First operand 433 states and 582 transitions. Second operand has 18 states, 17 states have (on average 3.764705882352941) internal successors, (64), 14 states have internal predecessors, (64), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:38:07,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:38:07,778 INFO L93 Difference]: Finished difference Result 498 states and 615 transitions. [2022-02-20 23:38:07,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-02-20 23:38:07,778 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 3.764705882352941) internal successors, (64), 14 states have internal predecessors, (64), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 35 [2022-02-20 23:38:07,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:38:07,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 3.764705882352941) internal successors, (64), 14 states have internal predecessors, (64), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:38:07,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 187 transitions. [2022-02-20 23:38:07,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 3.764705882352941) internal successors, (64), 14 states have internal predecessors, (64), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:38:07,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 187 transitions. [2022-02-20 23:38:07,781 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states and 187 transitions. [2022-02-20 23:38:07,939 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 23:38:07,947 INFO L225 Difference]: With dead ends: 498 [2022-02-20 23:38:07,947 INFO L226 Difference]: Without dead ends: 498 [2022-02-20 23:38:07,948 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 193 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=258, Invalid=1002, Unknown=0, NotChecked=0, Total=1260 [2022-02-20 23:38:07,948 INFO L933 BasicCegarLoop]: 41 mSDtfsCounter, 567 mSDsluCounter, 328 mSDsCounter, 0 mSdLazyCounter, 469 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 567 SdHoareTripleChecker+Valid, 369 SdHoareTripleChecker+Invalid, 635 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 469 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 79 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-02-20 23:38:07,948 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [567 Valid, 369 Invalid, 635 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 469 Invalid, 0 Unknown, 79 Unchecked, 0.5s Time] [2022-02-20 23:38:07,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 498 states. [2022-02-20 23:38:07,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 498 to 433. [2022-02-20 23:38:07,953 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:38:07,954 INFO L82 GeneralOperation]: Start isEquivalent. First operand 498 states. Second operand has 433 states, 389 states have (on average 1.3804627249357326) internal successors, (537), 414 states have internal predecessors, (537), 9 states have call successors, (9), 9 states have call predecessors, (9), 17 states have return successors, (23), 9 states have call predecessors, (23), 9 states have call successors, (23) [2022-02-20 23:38:07,954 INFO L74 IsIncluded]: Start isIncluded. First operand 498 states. Second operand has 433 states, 389 states have (on average 1.3804627249357326) internal successors, (537), 414 states have internal predecessors, (537), 9 states have call successors, (9), 9 states have call predecessors, (9), 17 states have return successors, (23), 9 states have call predecessors, (23), 9 states have call successors, (23) [2022-02-20 23:38:07,955 INFO L87 Difference]: Start difference. First operand 498 states. Second operand has 433 states, 389 states have (on average 1.3804627249357326) internal successors, (537), 414 states have internal predecessors, (537), 9 states have call successors, (9), 9 states have call predecessors, (9), 17 states have return successors, (23), 9 states have call predecessors, (23), 9 states have call successors, (23) [2022-02-20 23:38:07,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:38:07,963 INFO L93 Difference]: Finished difference Result 498 states and 615 transitions. [2022-02-20 23:38:07,963 INFO L276 IsEmpty]: Start isEmpty. Operand 498 states and 615 transitions. [2022-02-20 23:38:07,964 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:38:07,964 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:38:07,964 INFO L74 IsIncluded]: Start isIncluded. First operand has 433 states, 389 states have (on average 1.3804627249357326) internal successors, (537), 414 states have internal predecessors, (537), 9 states have call successors, (9), 9 states have call predecessors, (9), 17 states have return successors, (23), 9 states have call predecessors, (23), 9 states have call successors, (23) Second operand 498 states. [2022-02-20 23:38:07,965 INFO L87 Difference]: Start difference. First operand has 433 states, 389 states have (on average 1.3804627249357326) internal successors, (537), 414 states have internal predecessors, (537), 9 states have call successors, (9), 9 states have call predecessors, (9), 17 states have return successors, (23), 9 states have call predecessors, (23), 9 states have call successors, (23) Second operand 498 states. [2022-02-20 23:38:07,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:38:07,973 INFO L93 Difference]: Finished difference Result 498 states and 615 transitions. [2022-02-20 23:38:07,973 INFO L276 IsEmpty]: Start isEmpty. Operand 498 states and 615 transitions. [2022-02-20 23:38:07,974 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:38:07,974 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:38:07,974 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:38:07,974 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:38:07,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 433 states, 389 states have (on average 1.3804627249357326) internal successors, (537), 414 states have internal predecessors, (537), 9 states have call successors, (9), 9 states have call predecessors, (9), 17 states have return successors, (23), 9 states have call predecessors, (23), 9 states have call successors, (23) [2022-02-20 23:38:07,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 433 states to 433 states and 569 transitions. [2022-02-20 23:38:07,981 INFO L78 Accepts]: Start accepts. Automaton has 433 states and 569 transitions. Word has length 35 [2022-02-20 23:38:07,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:38:07,982 INFO L470 AbstractCegarLoop]: Abstraction has 433 states and 569 transitions. [2022-02-20 23:38:07,982 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 3.764705882352941) internal successors, (64), 14 states have internal predecessors, (64), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:38:07,982 INFO L276 IsEmpty]: Start isEmpty. Operand 433 states and 569 transitions. [2022-02-20 23:38:07,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-02-20 23:38:07,983 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:38:07,983 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:38:08,002 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-02-20 23:38:08,199 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-02-20 23:38:08,200 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting parse_inputErr16ASSERT_VIOLATIONMEMORY_FREE === [parse_inputErr0REQUIRES_VIOLATION, parse_inputErr1REQUIRES_VIOLATION, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2022-02-20 23:38:08,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:38:08,200 INFO L85 PathProgramCache]: Analyzing trace with hash 753387604, now seen corresponding path program 1 times [2022-02-20 23:38:08,200 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:38:08,200 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317668842] [2022-02-20 23:38:08,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:38:08,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:38:08,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:38:08,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 23:38:08,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:38:08,256 INFO L290 TraceCheckUtils]: 0: Hoare triple {24040#(and (= ~global~0.base |old(~global~0.base)|) (= |old(#length)| |#length|) (= |old(~global~0.offset)| ~global~0.offset) (= ~state~0 |old(~state~0)|) (= |old(#valid)| |#valid|))} ~input#1.base, ~input#1.offset := #in~input#1.base, #in~input#1.offset;~i~0#1 := 0; {24017#true} is VALID [2022-02-20 23:38:08,257 INFO L290 TraceCheckUtils]: 1: Hoare triple {24017#true} assume !!(~i~0#1 < 2); {24017#true} is VALID [2022-02-20 23:38:08,257 INFO L290 TraceCheckUtils]: 2: Hoare triple {24017#true} SUMMARY for call #t~mem3#1.base, #t~mem3#1.offset := read~$Pointer$(~#commands~0.base, ~#commands~0.offset + 9 * ~i~0#1, 4); srcloc: L693 {24017#true} is VALID [2022-02-20 23:38:08,257 INFO L290 TraceCheckUtils]: 3: Hoare triple {24017#true} assume 1 == #valid[#t~mem3#1.base]; {24017#true} is VALID [2022-02-20 23:38:08,257 INFO L290 TraceCheckUtils]: 4: Hoare triple {24017#true} assume #t~mem3#1.offset < #length[#t~mem3#1.base] && #t~mem3#1.offset >= 0; {24017#true} is VALID [2022-02-20 23:38:08,257 INFO L290 TraceCheckUtils]: 5: Hoare triple {24017#true} assume 1 == #valid[~input#1.base]; {24017#true} is VALID [2022-02-20 23:38:08,257 INFO L290 TraceCheckUtils]: 6: Hoare triple {24017#true} assume ~input#1.offset < #length[~input#1.base] && ~input#1.offset >= 0; {24017#true} is VALID [2022-02-20 23:38:08,257 INFO L290 TraceCheckUtils]: 7: Hoare triple {24017#true} assume 0 == #t~nondet4#1;havoc #t~mem3#1.base, #t~mem3#1.offset;havoc #t~nondet4#1; {24017#true} is VALID [2022-02-20 23:38:08,257 INFO L290 TraceCheckUtils]: 8: Hoare triple {24017#true} SUMMARY for call #t~mem5#1 := read~int(~#commands~0.base, 8 + (~#commands~0.offset + 9 * ~i~0#1), 1); srcloc: L694 {24017#true} is VALID [2022-02-20 23:38:08,258 INFO L290 TraceCheckUtils]: 9: Hoare triple {24017#true} assume ~state~0 >= #t~mem5#1;havoc #t~mem5#1; {24017#true} is VALID [2022-02-20 23:38:08,258 INFO L290 TraceCheckUtils]: 10: Hoare triple {24017#true} SUMMARY for call #t~mem6#1.base, #t~mem6#1.offset := read~$Pointer$(~#commands~0.base, 4 + (~#commands~0.offset + 9 * ~i~0#1), 4); srcloc: L695 {24017#true} is VALID [2022-02-20 23:38:08,258 INFO L290 TraceCheckUtils]: 11: Hoare triple {24017#true} assume { :begin_inline_##fun~~TO~VOID } true;##fun~~TO~VOID_#in~#fp#1.base, ##fun~~TO~VOID_#in~#fp#1.offset := #t~mem6#1.base, #t~mem6#1.offset; {24017#true} is VALID [2022-02-20 23:38:08,258 INFO L290 TraceCheckUtils]: 12: Hoare triple {24017#true} assume !(##fun~~TO~VOID_#in~#fp#1.base == #funAddr~c2.base && ##fun~~TO~VOID_#in~#fp#1.offset == #funAddr~c2.offset);assume { :begin_inline_c1 } true;havoc c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset, c1_~x~0#1.base, c1_~x~0#1.offset;call c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset := #Ultimate.allocOnHeap(1);c1_~x~0#1.base, c1_~x~0#1.offset := c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset;havoc c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset; {24041#(and (<= 0 |parse_input_c1_~x~0#1.offset|) (<= |parse_input_c1_~x~0#1.offset| 0))} is VALID [2022-02-20 23:38:08,259 INFO L290 TraceCheckUtils]: 13: Hoare triple {24041#(and (<= 0 |parse_input_c1_~x~0#1.offset|) (<= |parse_input_c1_~x~0#1.offset| 0))} assume !(c1_~x~0#1.base == 0 && c1_~x~0#1.offset == 0); {24041#(and (<= 0 |parse_input_c1_~x~0#1.offset|) (<= |parse_input_c1_~x~0#1.offset| 0))} is VALID [2022-02-20 23:38:08,259 INFO L290 TraceCheckUtils]: 14: Hoare triple {24041#(and (<= 0 |parse_input_c1_~x~0#1.offset|) (<= |parse_input_c1_~x~0#1.offset| 0))} assume !(~global~0.base != 0 || ~global~0.offset != 0); {24041#(and (<= 0 |parse_input_c1_~x~0#1.offset|) (<= |parse_input_c1_~x~0#1.offset| 0))} is VALID [2022-02-20 23:38:08,259 INFO L290 TraceCheckUtils]: 15: Hoare triple {24041#(and (<= 0 |parse_input_c1_~x~0#1.offset|) (<= |parse_input_c1_~x~0#1.offset| 0))} ~global~0.base, ~global~0.offset := c1_~x~0#1.base, c1_~x~0#1.offset;~state~0 := ~unnamed3~0~STATE_2; {24039#(= ~global~0.offset 0)} is VALID [2022-02-20 23:38:08,260 INFO L290 TraceCheckUtils]: 16: Hoare triple {24039#(= ~global~0.offset 0)} assume { :end_inline_c1 } true; {24039#(= ~global~0.offset 0)} is VALID [2022-02-20 23:38:08,260 INFO L290 TraceCheckUtils]: 17: Hoare triple {24039#(= ~global~0.offset 0)} assume { :end_inline_##fun~~TO~VOID } true;havoc #t~mem6#1.base, #t~mem6#1.offset; {24039#(= ~global~0.offset 0)} is VALID [2022-02-20 23:38:08,260 INFO L290 TraceCheckUtils]: 18: Hoare triple {24039#(= ~global~0.offset 0)} assume true; {24039#(= ~global~0.offset 0)} is VALID [2022-02-20 23:38:08,261 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {24039#(= ~global~0.offset 0)} {24017#true} #101#return; {24039#(= ~global~0.offset 0)} is VALID [2022-02-20 23:38:08,261 INFO L290 TraceCheckUtils]: 0: Hoare triple {24017#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(3, 1);call write~init~int(99, 1, 0, 1);call write~init~int(49, 1, 1, 1);call write~init~int(0, 1, 2, 1);call #Ultimate.allocInit(3, 2);call write~init~int(99, 2, 0, 1);call write~init~int(50, 2, 1, 1);call write~init~int(0, 2, 2, 1);call #Ultimate.allocInit(3, 3);call write~init~int(99, 3, 0, 1);call write~init~int(49, 3, 1, 1);call write~init~int(0, 3, 2, 1);call #Ultimate.allocInit(3, 4);call write~init~int(99, 4, 0, 1);call write~init~int(49, 4, 1, 1);call write~init~int(0, 4, 2, 1);call #Ultimate.allocInit(3, 5);call write~init~int(99, 5, 0, 1);call write~init~int(50, 5, 1, 1);call write~init~int(0, 5, 2, 1);~state~0 := ~unnamed3~0~STATE_1;~global~0.base, ~global~0.offset := 0, 0;~#commands~0.base, ~#commands~0.offset := 6, 0;call #Ultimate.allocInit(18, 6);call write~init~$Pointer$(1, 0, ~#commands~0.base, ~#commands~0.offset, 4);call write~init~$Pointer$(#funAddr~c1.base, #funAddr~c1.offset, ~#commands~0.base, 4 + ~#commands~0.offset, 4);call write~init~int((if ~unnamed3~0~STATE_1 % 256 <= 127 then ~unnamed3~0~STATE_1 % 256 else ~unnamed3~0~STATE_1 % 256 - 256), ~#commands~0.base, 8 + ~#commands~0.offset, 1);call write~init~$Pointer$(2, 0, ~#commands~0.base, 9 + ~#commands~0.offset, 4);call write~init~$Pointer$(#funAddr~c2.base, #funAddr~c2.offset, ~#commands~0.base, 13 + ~#commands~0.offset, 4);call write~init~int((if ~unnamed3~0~STATE_2 % 256 <= 127 then ~unnamed3~0~STATE_2 % 256 else ~unnamed3~0~STATE_2 % 256 - 256), ~#commands~0.base, 17 + ~#commands~0.offset, 1); {24017#true} is VALID [2022-02-20 23:38:08,261 INFO L290 TraceCheckUtils]: 1: Hoare triple {24017#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1; {24017#true} is VALID [2022-02-20 23:38:08,262 INFO L272 TraceCheckUtils]: 2: Hoare triple {24017#true} call parse_input(3, 0); {24040#(and (= ~global~0.base |old(~global~0.base)|) (= |old(#length)| |#length|) (= |old(~global~0.offset)| ~global~0.offset) (= ~state~0 |old(~state~0)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 23:38:08,262 INFO L290 TraceCheckUtils]: 3: Hoare triple {24040#(and (= ~global~0.base |old(~global~0.base)|) (= |old(#length)| |#length|) (= |old(~global~0.offset)| ~global~0.offset) (= ~state~0 |old(~state~0)|) (= |old(#valid)| |#valid|))} ~input#1.base, ~input#1.offset := #in~input#1.base, #in~input#1.offset;~i~0#1 := 0; {24017#true} is VALID [2022-02-20 23:38:08,262 INFO L290 TraceCheckUtils]: 4: Hoare triple {24017#true} assume !!(~i~0#1 < 2); {24017#true} is VALID [2022-02-20 23:38:08,262 INFO L290 TraceCheckUtils]: 5: Hoare triple {24017#true} SUMMARY for call #t~mem3#1.base, #t~mem3#1.offset := read~$Pointer$(~#commands~0.base, ~#commands~0.offset + 9 * ~i~0#1, 4); srcloc: L693 {24017#true} is VALID [2022-02-20 23:38:08,262 INFO L290 TraceCheckUtils]: 6: Hoare triple {24017#true} assume 1 == #valid[#t~mem3#1.base]; {24017#true} is VALID [2022-02-20 23:38:08,262 INFO L290 TraceCheckUtils]: 7: Hoare triple {24017#true} assume #t~mem3#1.offset < #length[#t~mem3#1.base] && #t~mem3#1.offset >= 0; {24017#true} is VALID [2022-02-20 23:38:08,262 INFO L290 TraceCheckUtils]: 8: Hoare triple {24017#true} assume 1 == #valid[~input#1.base]; {24017#true} is VALID [2022-02-20 23:38:08,263 INFO L290 TraceCheckUtils]: 9: Hoare triple {24017#true} assume ~input#1.offset < #length[~input#1.base] && ~input#1.offset >= 0; {24017#true} is VALID [2022-02-20 23:38:08,263 INFO L290 TraceCheckUtils]: 10: Hoare triple {24017#true} assume 0 == #t~nondet4#1;havoc #t~mem3#1.base, #t~mem3#1.offset;havoc #t~nondet4#1; {24017#true} is VALID [2022-02-20 23:38:08,263 INFO L290 TraceCheckUtils]: 11: Hoare triple {24017#true} SUMMARY for call #t~mem5#1 := read~int(~#commands~0.base, 8 + (~#commands~0.offset + 9 * ~i~0#1), 1); srcloc: L694 {24017#true} is VALID [2022-02-20 23:38:08,263 INFO L290 TraceCheckUtils]: 12: Hoare triple {24017#true} assume ~state~0 >= #t~mem5#1;havoc #t~mem5#1; {24017#true} is VALID [2022-02-20 23:38:08,263 INFO L290 TraceCheckUtils]: 13: Hoare triple {24017#true} SUMMARY for call #t~mem6#1.base, #t~mem6#1.offset := read~$Pointer$(~#commands~0.base, 4 + (~#commands~0.offset + 9 * ~i~0#1), 4); srcloc: L695 {24017#true} is VALID [2022-02-20 23:38:08,263 INFO L290 TraceCheckUtils]: 14: Hoare triple {24017#true} assume { :begin_inline_##fun~~TO~VOID } true;##fun~~TO~VOID_#in~#fp#1.base, ##fun~~TO~VOID_#in~#fp#1.offset := #t~mem6#1.base, #t~mem6#1.offset; {24017#true} is VALID [2022-02-20 23:38:08,264 INFO L290 TraceCheckUtils]: 15: Hoare triple {24017#true} assume !(##fun~~TO~VOID_#in~#fp#1.base == #funAddr~c2.base && ##fun~~TO~VOID_#in~#fp#1.offset == #funAddr~c2.offset);assume { :begin_inline_c1 } true;havoc c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset, c1_~x~0#1.base, c1_~x~0#1.offset;call c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset := #Ultimate.allocOnHeap(1);c1_~x~0#1.base, c1_~x~0#1.offset := c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset;havoc c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset; {24041#(and (<= 0 |parse_input_c1_~x~0#1.offset|) (<= |parse_input_c1_~x~0#1.offset| 0))} is VALID [2022-02-20 23:38:08,264 INFO L290 TraceCheckUtils]: 16: Hoare triple {24041#(and (<= 0 |parse_input_c1_~x~0#1.offset|) (<= |parse_input_c1_~x~0#1.offset| 0))} assume !(c1_~x~0#1.base == 0 && c1_~x~0#1.offset == 0); {24041#(and (<= 0 |parse_input_c1_~x~0#1.offset|) (<= |parse_input_c1_~x~0#1.offset| 0))} is VALID [2022-02-20 23:38:08,264 INFO L290 TraceCheckUtils]: 17: Hoare triple {24041#(and (<= 0 |parse_input_c1_~x~0#1.offset|) (<= |parse_input_c1_~x~0#1.offset| 0))} assume !(~global~0.base != 0 || ~global~0.offset != 0); {24041#(and (<= 0 |parse_input_c1_~x~0#1.offset|) (<= |parse_input_c1_~x~0#1.offset| 0))} is VALID [2022-02-20 23:38:08,265 INFO L290 TraceCheckUtils]: 18: Hoare triple {24041#(and (<= 0 |parse_input_c1_~x~0#1.offset|) (<= |parse_input_c1_~x~0#1.offset| 0))} ~global~0.base, ~global~0.offset := c1_~x~0#1.base, c1_~x~0#1.offset;~state~0 := ~unnamed3~0~STATE_2; {24039#(= ~global~0.offset 0)} is VALID [2022-02-20 23:38:08,265 INFO L290 TraceCheckUtils]: 19: Hoare triple {24039#(= ~global~0.offset 0)} assume { :end_inline_c1 } true; {24039#(= ~global~0.offset 0)} is VALID [2022-02-20 23:38:08,265 INFO L290 TraceCheckUtils]: 20: Hoare triple {24039#(= ~global~0.offset 0)} assume { :end_inline_##fun~~TO~VOID } true;havoc #t~mem6#1.base, #t~mem6#1.offset; {24039#(= ~global~0.offset 0)} is VALID [2022-02-20 23:38:08,266 INFO L290 TraceCheckUtils]: 21: Hoare triple {24039#(= ~global~0.offset 0)} assume true; {24039#(= ~global~0.offset 0)} is VALID [2022-02-20 23:38:08,266 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {24039#(= ~global~0.offset 0)} {24017#true} #101#return; {24039#(= ~global~0.offset 0)} is VALID [2022-02-20 23:38:08,266 INFO L272 TraceCheckUtils]: 23: Hoare triple {24039#(= ~global~0.offset 0)} call parse_input(4, 0); {24039#(= ~global~0.offset 0)} is VALID [2022-02-20 23:38:08,267 INFO L290 TraceCheckUtils]: 24: Hoare triple {24039#(= ~global~0.offset 0)} ~input#1.base, ~input#1.offset := #in~input#1.base, #in~input#1.offset;~i~0#1 := 0; {24039#(= ~global~0.offset 0)} is VALID [2022-02-20 23:38:08,267 INFO L290 TraceCheckUtils]: 25: Hoare triple {24039#(= ~global~0.offset 0)} assume !!(~i~0#1 < 2); {24039#(= ~global~0.offset 0)} is VALID [2022-02-20 23:38:08,267 INFO L290 TraceCheckUtils]: 26: Hoare triple {24039#(= ~global~0.offset 0)} SUMMARY for call #t~mem3#1.base, #t~mem3#1.offset := read~$Pointer$(~#commands~0.base, ~#commands~0.offset + 9 * ~i~0#1, 4); srcloc: L693 {24039#(= ~global~0.offset 0)} is VALID [2022-02-20 23:38:08,267 INFO L290 TraceCheckUtils]: 27: Hoare triple {24039#(= ~global~0.offset 0)} assume 1 == #valid[#t~mem3#1.base]; {24039#(= ~global~0.offset 0)} is VALID [2022-02-20 23:38:08,268 INFO L290 TraceCheckUtils]: 28: Hoare triple {24039#(= ~global~0.offset 0)} assume #t~mem3#1.offset < #length[#t~mem3#1.base] && #t~mem3#1.offset >= 0; {24039#(= ~global~0.offset 0)} is VALID [2022-02-20 23:38:08,268 INFO L290 TraceCheckUtils]: 29: Hoare triple {24039#(= ~global~0.offset 0)} assume 1 == #valid[~input#1.base]; {24039#(= ~global~0.offset 0)} is VALID [2022-02-20 23:38:08,268 INFO L290 TraceCheckUtils]: 30: Hoare triple {24039#(= ~global~0.offset 0)} assume ~input#1.offset < #length[~input#1.base] && ~input#1.offset >= 0; {24039#(= ~global~0.offset 0)} is VALID [2022-02-20 23:38:08,268 INFO L290 TraceCheckUtils]: 31: Hoare triple {24039#(= ~global~0.offset 0)} assume 0 == #t~nondet4#1;havoc #t~mem3#1.base, #t~mem3#1.offset;havoc #t~nondet4#1; {24039#(= ~global~0.offset 0)} is VALID [2022-02-20 23:38:08,269 INFO L290 TraceCheckUtils]: 32: Hoare triple {24039#(= ~global~0.offset 0)} SUMMARY for call #t~mem5#1 := read~int(~#commands~0.base, 8 + (~#commands~0.offset + 9 * ~i~0#1), 1); srcloc: L694 {24039#(= ~global~0.offset 0)} is VALID [2022-02-20 23:38:08,269 INFO L290 TraceCheckUtils]: 33: Hoare triple {24039#(= ~global~0.offset 0)} assume ~state~0 >= #t~mem5#1;havoc #t~mem5#1; {24039#(= ~global~0.offset 0)} is VALID [2022-02-20 23:38:08,269 INFO L290 TraceCheckUtils]: 34: Hoare triple {24039#(= ~global~0.offset 0)} SUMMARY for call #t~mem6#1.base, #t~mem6#1.offset := read~$Pointer$(~#commands~0.base, 4 + (~#commands~0.offset + 9 * ~i~0#1), 4); srcloc: L695 {24039#(= ~global~0.offset 0)} is VALID [2022-02-20 23:38:08,270 INFO L290 TraceCheckUtils]: 35: Hoare triple {24039#(= ~global~0.offset 0)} assume { :begin_inline_##fun~~TO~VOID } true;##fun~~TO~VOID_#in~#fp#1.base, ##fun~~TO~VOID_#in~#fp#1.offset := #t~mem6#1.base, #t~mem6#1.offset; {24039#(= ~global~0.offset 0)} is VALID [2022-02-20 23:38:08,270 INFO L290 TraceCheckUtils]: 36: Hoare triple {24039#(= ~global~0.offset 0)} assume !(##fun~~TO~VOID_#in~#fp#1.base == #funAddr~c2.base && ##fun~~TO~VOID_#in~#fp#1.offset == #funAddr~c2.offset);assume { :begin_inline_c1 } true;havoc c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset, c1_~x~0#1.base, c1_~x~0#1.offset;call c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset := #Ultimate.allocOnHeap(1);c1_~x~0#1.base, c1_~x~0#1.offset := c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset;havoc c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset; {24039#(= ~global~0.offset 0)} is VALID [2022-02-20 23:38:08,270 INFO L290 TraceCheckUtils]: 37: Hoare triple {24039#(= ~global~0.offset 0)} assume !(c1_~x~0#1.base == 0 && c1_~x~0#1.offset == 0); {24039#(= ~global~0.offset 0)} is VALID [2022-02-20 23:38:08,270 INFO L290 TraceCheckUtils]: 38: Hoare triple {24039#(= ~global~0.offset 0)} assume ~global~0.base != 0 || ~global~0.offset != 0; {24039#(= ~global~0.offset 0)} is VALID [2022-02-20 23:38:08,271 INFO L290 TraceCheckUtils]: 39: Hoare triple {24039#(= ~global~0.offset 0)} assume !(0 == ~global~0.offset); {24018#false} is VALID [2022-02-20 23:38:08,271 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 12 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:38:08,271 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:38:08,271 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317668842] [2022-02-20 23:38:08,271 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1317668842] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 23:38:08,272 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1919805695] [2022-02-20 23:38:08,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:38:08,272 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:38:08,272 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:38:08,273 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 23:38:08,275 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-02-20 23:38:08,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:38:08,329 INFO L263 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 9 conjunts are in the unsatisfiable core [2022-02-20 23:38:08,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:38:08,343 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:38:08,433 INFO L290 TraceCheckUtils]: 0: Hoare triple {24017#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(3, 1);call write~init~int(99, 1, 0, 1);call write~init~int(49, 1, 1, 1);call write~init~int(0, 1, 2, 1);call #Ultimate.allocInit(3, 2);call write~init~int(99, 2, 0, 1);call write~init~int(50, 2, 1, 1);call write~init~int(0, 2, 2, 1);call #Ultimate.allocInit(3, 3);call write~init~int(99, 3, 0, 1);call write~init~int(49, 3, 1, 1);call write~init~int(0, 3, 2, 1);call #Ultimate.allocInit(3, 4);call write~init~int(99, 4, 0, 1);call write~init~int(49, 4, 1, 1);call write~init~int(0, 4, 2, 1);call #Ultimate.allocInit(3, 5);call write~init~int(99, 5, 0, 1);call write~init~int(50, 5, 1, 1);call write~init~int(0, 5, 2, 1);~state~0 := ~unnamed3~0~STATE_1;~global~0.base, ~global~0.offset := 0, 0;~#commands~0.base, ~#commands~0.offset := 6, 0;call #Ultimate.allocInit(18, 6);call write~init~$Pointer$(1, 0, ~#commands~0.base, ~#commands~0.offset, 4);call write~init~$Pointer$(#funAddr~c1.base, #funAddr~c1.offset, ~#commands~0.base, 4 + ~#commands~0.offset, 4);call write~init~int((if ~unnamed3~0~STATE_1 % 256 <= 127 then ~unnamed3~0~STATE_1 % 256 else ~unnamed3~0~STATE_1 % 256 - 256), ~#commands~0.base, 8 + ~#commands~0.offset, 1);call write~init~$Pointer$(2, 0, ~#commands~0.base, 9 + ~#commands~0.offset, 4);call write~init~$Pointer$(#funAddr~c2.base, #funAddr~c2.offset, ~#commands~0.base, 13 + ~#commands~0.offset, 4);call write~init~int((if ~unnamed3~0~STATE_2 % 256 <= 127 then ~unnamed3~0~STATE_2 % 256 else ~unnamed3~0~STATE_2 % 256 - 256), ~#commands~0.base, 17 + ~#commands~0.offset, 1); {24017#true} is VALID [2022-02-20 23:38:08,433 INFO L290 TraceCheckUtils]: 1: Hoare triple {24017#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1; {24017#true} is VALID [2022-02-20 23:38:08,433 INFO L272 TraceCheckUtils]: 2: Hoare triple {24017#true} call parse_input(3, 0); {24017#true} is VALID [2022-02-20 23:38:08,433 INFO L290 TraceCheckUtils]: 3: Hoare triple {24017#true} ~input#1.base, ~input#1.offset := #in~input#1.base, #in~input#1.offset;~i~0#1 := 0; {24017#true} is VALID [2022-02-20 23:38:08,433 INFO L290 TraceCheckUtils]: 4: Hoare triple {24017#true} assume !!(~i~0#1 < 2); {24017#true} is VALID [2022-02-20 23:38:08,433 INFO L290 TraceCheckUtils]: 5: Hoare triple {24017#true} SUMMARY for call #t~mem3#1.base, #t~mem3#1.offset := read~$Pointer$(~#commands~0.base, ~#commands~0.offset + 9 * ~i~0#1, 4); srcloc: L693 {24017#true} is VALID [2022-02-20 23:38:08,433 INFO L290 TraceCheckUtils]: 6: Hoare triple {24017#true} assume 1 == #valid[#t~mem3#1.base]; {24017#true} is VALID [2022-02-20 23:38:08,433 INFO L290 TraceCheckUtils]: 7: Hoare triple {24017#true} assume #t~mem3#1.offset < #length[#t~mem3#1.base] && #t~mem3#1.offset >= 0; {24017#true} is VALID [2022-02-20 23:38:08,433 INFO L290 TraceCheckUtils]: 8: Hoare triple {24017#true} assume 1 == #valid[~input#1.base]; {24017#true} is VALID [2022-02-20 23:38:08,433 INFO L290 TraceCheckUtils]: 9: Hoare triple {24017#true} assume ~input#1.offset < #length[~input#1.base] && ~input#1.offset >= 0; {24017#true} is VALID [2022-02-20 23:38:08,435 INFO L290 TraceCheckUtils]: 10: Hoare triple {24017#true} assume 0 == #t~nondet4#1;havoc #t~mem3#1.base, #t~mem3#1.offset;havoc #t~nondet4#1; {24017#true} is VALID [2022-02-20 23:38:08,435 INFO L290 TraceCheckUtils]: 11: Hoare triple {24017#true} SUMMARY for call #t~mem5#1 := read~int(~#commands~0.base, 8 + (~#commands~0.offset + 9 * ~i~0#1), 1); srcloc: L694 {24017#true} is VALID [2022-02-20 23:38:08,435 INFO L290 TraceCheckUtils]: 12: Hoare triple {24017#true} assume ~state~0 >= #t~mem5#1;havoc #t~mem5#1; {24017#true} is VALID [2022-02-20 23:38:08,436 INFO L290 TraceCheckUtils]: 13: Hoare triple {24017#true} SUMMARY for call #t~mem6#1.base, #t~mem6#1.offset := read~$Pointer$(~#commands~0.base, 4 + (~#commands~0.offset + 9 * ~i~0#1), 4); srcloc: L695 {24017#true} is VALID [2022-02-20 23:38:08,436 INFO L290 TraceCheckUtils]: 14: Hoare triple {24017#true} assume { :begin_inline_##fun~~TO~VOID } true;##fun~~TO~VOID_#in~#fp#1.base, ##fun~~TO~VOID_#in~#fp#1.offset := #t~mem6#1.base, #t~mem6#1.offset; {24017#true} is VALID [2022-02-20 23:38:08,436 INFO L290 TraceCheckUtils]: 15: Hoare triple {24017#true} assume !(##fun~~TO~VOID_#in~#fp#1.base == #funAddr~c2.base && ##fun~~TO~VOID_#in~#fp#1.offset == #funAddr~c2.offset);assume { :begin_inline_c1 } true;havoc c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset, c1_~x~0#1.base, c1_~x~0#1.offset;call c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset := #Ultimate.allocOnHeap(1);c1_~x~0#1.base, c1_~x~0#1.offset := c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset;havoc c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset; {24041#(and (<= 0 |parse_input_c1_~x~0#1.offset|) (<= |parse_input_c1_~x~0#1.offset| 0))} is VALID [2022-02-20 23:38:08,436 INFO L290 TraceCheckUtils]: 16: Hoare triple {24041#(and (<= 0 |parse_input_c1_~x~0#1.offset|) (<= |parse_input_c1_~x~0#1.offset| 0))} assume !(c1_~x~0#1.base == 0 && c1_~x~0#1.offset == 0); {24041#(and (<= 0 |parse_input_c1_~x~0#1.offset|) (<= |parse_input_c1_~x~0#1.offset| 0))} is VALID [2022-02-20 23:38:08,437 INFO L290 TraceCheckUtils]: 17: Hoare triple {24041#(and (<= 0 |parse_input_c1_~x~0#1.offset|) (<= |parse_input_c1_~x~0#1.offset| 0))} assume !(~global~0.base != 0 || ~global~0.offset != 0); {24041#(and (<= 0 |parse_input_c1_~x~0#1.offset|) (<= |parse_input_c1_~x~0#1.offset| 0))} is VALID [2022-02-20 23:38:08,437 INFO L290 TraceCheckUtils]: 18: Hoare triple {24041#(and (<= 0 |parse_input_c1_~x~0#1.offset|) (<= |parse_input_c1_~x~0#1.offset| 0))} ~global~0.base, ~global~0.offset := c1_~x~0#1.base, c1_~x~0#1.offset;~state~0 := ~unnamed3~0~STATE_2; {24039#(= ~global~0.offset 0)} is VALID [2022-02-20 23:38:08,437 INFO L290 TraceCheckUtils]: 19: Hoare triple {24039#(= ~global~0.offset 0)} assume { :end_inline_c1 } true; {24039#(= ~global~0.offset 0)} is VALID [2022-02-20 23:38:08,438 INFO L290 TraceCheckUtils]: 20: Hoare triple {24039#(= ~global~0.offset 0)} assume { :end_inline_##fun~~TO~VOID } true;havoc #t~mem6#1.base, #t~mem6#1.offset; {24039#(= ~global~0.offset 0)} is VALID [2022-02-20 23:38:08,438 INFO L290 TraceCheckUtils]: 21: Hoare triple {24039#(= ~global~0.offset 0)} assume true; {24039#(= ~global~0.offset 0)} is VALID [2022-02-20 23:38:08,438 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {24039#(= ~global~0.offset 0)} {24017#true} #101#return; {24039#(= ~global~0.offset 0)} is VALID [2022-02-20 23:38:08,439 INFO L272 TraceCheckUtils]: 23: Hoare triple {24039#(= ~global~0.offset 0)} call parse_input(4, 0); {24039#(= ~global~0.offset 0)} is VALID [2022-02-20 23:38:08,439 INFO L290 TraceCheckUtils]: 24: Hoare triple {24039#(= ~global~0.offset 0)} ~input#1.base, ~input#1.offset := #in~input#1.base, #in~input#1.offset;~i~0#1 := 0; {24039#(= ~global~0.offset 0)} is VALID [2022-02-20 23:38:08,439 INFO L290 TraceCheckUtils]: 25: Hoare triple {24039#(= ~global~0.offset 0)} assume !!(~i~0#1 < 2); {24039#(= ~global~0.offset 0)} is VALID [2022-02-20 23:38:08,440 INFO L290 TraceCheckUtils]: 26: Hoare triple {24039#(= ~global~0.offset 0)} SUMMARY for call #t~mem3#1.base, #t~mem3#1.offset := read~$Pointer$(~#commands~0.base, ~#commands~0.offset + 9 * ~i~0#1, 4); srcloc: L693 {24039#(= ~global~0.offset 0)} is VALID [2022-02-20 23:38:08,440 INFO L290 TraceCheckUtils]: 27: Hoare triple {24039#(= ~global~0.offset 0)} assume 1 == #valid[#t~mem3#1.base]; {24039#(= ~global~0.offset 0)} is VALID [2022-02-20 23:38:08,440 INFO L290 TraceCheckUtils]: 28: Hoare triple {24039#(= ~global~0.offset 0)} assume #t~mem3#1.offset < #length[#t~mem3#1.base] && #t~mem3#1.offset >= 0; {24039#(= ~global~0.offset 0)} is VALID [2022-02-20 23:38:08,440 INFO L290 TraceCheckUtils]: 29: Hoare triple {24039#(= ~global~0.offset 0)} assume 1 == #valid[~input#1.base]; {24039#(= ~global~0.offset 0)} is VALID [2022-02-20 23:38:08,441 INFO L290 TraceCheckUtils]: 30: Hoare triple {24039#(= ~global~0.offset 0)} assume ~input#1.offset < #length[~input#1.base] && ~input#1.offset >= 0; {24039#(= ~global~0.offset 0)} is VALID [2022-02-20 23:38:08,441 INFO L290 TraceCheckUtils]: 31: Hoare triple {24039#(= ~global~0.offset 0)} assume 0 == #t~nondet4#1;havoc #t~mem3#1.base, #t~mem3#1.offset;havoc #t~nondet4#1; {24039#(= ~global~0.offset 0)} is VALID [2022-02-20 23:38:08,441 INFO L290 TraceCheckUtils]: 32: Hoare triple {24039#(= ~global~0.offset 0)} SUMMARY for call #t~mem5#1 := read~int(~#commands~0.base, 8 + (~#commands~0.offset + 9 * ~i~0#1), 1); srcloc: L694 {24039#(= ~global~0.offset 0)} is VALID [2022-02-20 23:38:08,441 INFO L290 TraceCheckUtils]: 33: Hoare triple {24039#(= ~global~0.offset 0)} assume ~state~0 >= #t~mem5#1;havoc #t~mem5#1; {24039#(= ~global~0.offset 0)} is VALID [2022-02-20 23:38:08,442 INFO L290 TraceCheckUtils]: 34: Hoare triple {24039#(= ~global~0.offset 0)} SUMMARY for call #t~mem6#1.base, #t~mem6#1.offset := read~$Pointer$(~#commands~0.base, 4 + (~#commands~0.offset + 9 * ~i~0#1), 4); srcloc: L695 {24039#(= ~global~0.offset 0)} is VALID [2022-02-20 23:38:08,442 INFO L290 TraceCheckUtils]: 35: Hoare triple {24039#(= ~global~0.offset 0)} assume { :begin_inline_##fun~~TO~VOID } true;##fun~~TO~VOID_#in~#fp#1.base, ##fun~~TO~VOID_#in~#fp#1.offset := #t~mem6#1.base, #t~mem6#1.offset; {24039#(= ~global~0.offset 0)} is VALID [2022-02-20 23:38:08,442 INFO L290 TraceCheckUtils]: 36: Hoare triple {24039#(= ~global~0.offset 0)} assume !(##fun~~TO~VOID_#in~#fp#1.base == #funAddr~c2.base && ##fun~~TO~VOID_#in~#fp#1.offset == #funAddr~c2.offset);assume { :begin_inline_c1 } true;havoc c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset, c1_~x~0#1.base, c1_~x~0#1.offset;call c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset := #Ultimate.allocOnHeap(1);c1_~x~0#1.base, c1_~x~0#1.offset := c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset;havoc c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset; {24039#(= ~global~0.offset 0)} is VALID [2022-02-20 23:38:08,442 INFO L290 TraceCheckUtils]: 37: Hoare triple {24039#(= ~global~0.offset 0)} assume !(c1_~x~0#1.base == 0 && c1_~x~0#1.offset == 0); {24039#(= ~global~0.offset 0)} is VALID [2022-02-20 23:38:08,443 INFO L290 TraceCheckUtils]: 38: Hoare triple {24039#(= ~global~0.offset 0)} assume ~global~0.base != 0 || ~global~0.offset != 0; {24039#(= ~global~0.offset 0)} is VALID [2022-02-20 23:38:08,443 INFO L290 TraceCheckUtils]: 39: Hoare triple {24039#(= ~global~0.offset 0)} assume !(0 == ~global~0.offset); {24018#false} is VALID [2022-02-20 23:38:08,443 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:38:08,443 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:38:08,538 INFO L290 TraceCheckUtils]: 39: Hoare triple {24039#(= ~global~0.offset 0)} assume !(0 == ~global~0.offset); {24018#false} is VALID [2022-02-20 23:38:08,538 INFO L290 TraceCheckUtils]: 38: Hoare triple {24039#(= ~global~0.offset 0)} assume ~global~0.base != 0 || ~global~0.offset != 0; {24039#(= ~global~0.offset 0)} is VALID [2022-02-20 23:38:08,539 INFO L290 TraceCheckUtils]: 37: Hoare triple {24039#(= ~global~0.offset 0)} assume !(c1_~x~0#1.base == 0 && c1_~x~0#1.offset == 0); {24039#(= ~global~0.offset 0)} is VALID [2022-02-20 23:38:08,539 INFO L290 TraceCheckUtils]: 36: Hoare triple {24039#(= ~global~0.offset 0)} assume !(##fun~~TO~VOID_#in~#fp#1.base == #funAddr~c2.base && ##fun~~TO~VOID_#in~#fp#1.offset == #funAddr~c2.offset);assume { :begin_inline_c1 } true;havoc c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset, c1_~x~0#1.base, c1_~x~0#1.offset;call c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset := #Ultimate.allocOnHeap(1);c1_~x~0#1.base, c1_~x~0#1.offset := c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset;havoc c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset; {24039#(= ~global~0.offset 0)} is VALID [2022-02-20 23:38:08,539 INFO L290 TraceCheckUtils]: 35: Hoare triple {24039#(= ~global~0.offset 0)} assume { :begin_inline_##fun~~TO~VOID } true;##fun~~TO~VOID_#in~#fp#1.base, ##fun~~TO~VOID_#in~#fp#1.offset := #t~mem6#1.base, #t~mem6#1.offset; {24039#(= ~global~0.offset 0)} is VALID [2022-02-20 23:38:08,539 INFO L290 TraceCheckUtils]: 34: Hoare triple {24039#(= ~global~0.offset 0)} SUMMARY for call #t~mem6#1.base, #t~mem6#1.offset := read~$Pointer$(~#commands~0.base, 4 + (~#commands~0.offset + 9 * ~i~0#1), 4); srcloc: L695 {24039#(= ~global~0.offset 0)} is VALID [2022-02-20 23:38:08,540 INFO L290 TraceCheckUtils]: 33: Hoare triple {24039#(= ~global~0.offset 0)} assume ~state~0 >= #t~mem5#1;havoc #t~mem5#1; {24039#(= ~global~0.offset 0)} is VALID [2022-02-20 23:38:08,540 INFO L290 TraceCheckUtils]: 32: Hoare triple {24039#(= ~global~0.offset 0)} SUMMARY for call #t~mem5#1 := read~int(~#commands~0.base, 8 + (~#commands~0.offset + 9 * ~i~0#1), 1); srcloc: L694 {24039#(= ~global~0.offset 0)} is VALID [2022-02-20 23:38:08,540 INFO L290 TraceCheckUtils]: 31: Hoare triple {24039#(= ~global~0.offset 0)} assume 0 == #t~nondet4#1;havoc #t~mem3#1.base, #t~mem3#1.offset;havoc #t~nondet4#1; {24039#(= ~global~0.offset 0)} is VALID [2022-02-20 23:38:08,540 INFO L290 TraceCheckUtils]: 30: Hoare triple {24039#(= ~global~0.offset 0)} assume ~input#1.offset < #length[~input#1.base] && ~input#1.offset >= 0; {24039#(= ~global~0.offset 0)} is VALID [2022-02-20 23:38:08,541 INFO L290 TraceCheckUtils]: 29: Hoare triple {24039#(= ~global~0.offset 0)} assume 1 == #valid[~input#1.base]; {24039#(= ~global~0.offset 0)} is VALID [2022-02-20 23:38:08,541 INFO L290 TraceCheckUtils]: 28: Hoare triple {24039#(= ~global~0.offset 0)} assume #t~mem3#1.offset < #length[#t~mem3#1.base] && #t~mem3#1.offset >= 0; {24039#(= ~global~0.offset 0)} is VALID [2022-02-20 23:38:08,541 INFO L290 TraceCheckUtils]: 27: Hoare triple {24039#(= ~global~0.offset 0)} assume 1 == #valid[#t~mem3#1.base]; {24039#(= ~global~0.offset 0)} is VALID [2022-02-20 23:38:08,542 INFO L290 TraceCheckUtils]: 26: Hoare triple {24039#(= ~global~0.offset 0)} SUMMARY for call #t~mem3#1.base, #t~mem3#1.offset := read~$Pointer$(~#commands~0.base, ~#commands~0.offset + 9 * ~i~0#1, 4); srcloc: L693 {24039#(= ~global~0.offset 0)} is VALID [2022-02-20 23:38:08,542 INFO L290 TraceCheckUtils]: 25: Hoare triple {24039#(= ~global~0.offset 0)} assume !!(~i~0#1 < 2); {24039#(= ~global~0.offset 0)} is VALID [2022-02-20 23:38:08,542 INFO L290 TraceCheckUtils]: 24: Hoare triple {24039#(= ~global~0.offset 0)} ~input#1.base, ~input#1.offset := #in~input#1.base, #in~input#1.offset;~i~0#1 := 0; {24039#(= ~global~0.offset 0)} is VALID [2022-02-20 23:38:08,542 INFO L272 TraceCheckUtils]: 23: Hoare triple {24039#(= ~global~0.offset 0)} call parse_input(4, 0); {24039#(= ~global~0.offset 0)} is VALID [2022-02-20 23:38:08,543 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {24039#(= ~global~0.offset 0)} {24017#true} #101#return; {24039#(= ~global~0.offset 0)} is VALID [2022-02-20 23:38:08,543 INFO L290 TraceCheckUtils]: 21: Hoare triple {24039#(= ~global~0.offset 0)} assume true; {24039#(= ~global~0.offset 0)} is VALID [2022-02-20 23:38:08,543 INFO L290 TraceCheckUtils]: 20: Hoare triple {24039#(= ~global~0.offset 0)} assume { :end_inline_##fun~~TO~VOID } true;havoc #t~mem6#1.base, #t~mem6#1.offset; {24039#(= ~global~0.offset 0)} is VALID [2022-02-20 23:38:08,544 INFO L290 TraceCheckUtils]: 19: Hoare triple {24039#(= ~global~0.offset 0)} assume { :end_inline_c1 } true; {24039#(= ~global~0.offset 0)} is VALID [2022-02-20 23:38:08,544 INFO L290 TraceCheckUtils]: 18: Hoare triple {24041#(and (<= 0 |parse_input_c1_~x~0#1.offset|) (<= |parse_input_c1_~x~0#1.offset| 0))} ~global~0.base, ~global~0.offset := c1_~x~0#1.base, c1_~x~0#1.offset;~state~0 := ~unnamed3~0~STATE_2; {24039#(= ~global~0.offset 0)} is VALID [2022-02-20 23:38:08,544 INFO L290 TraceCheckUtils]: 17: Hoare triple {24041#(and (<= 0 |parse_input_c1_~x~0#1.offset|) (<= |parse_input_c1_~x~0#1.offset| 0))} assume !(~global~0.base != 0 || ~global~0.offset != 0); {24041#(and (<= 0 |parse_input_c1_~x~0#1.offset|) (<= |parse_input_c1_~x~0#1.offset| 0))} is VALID [2022-02-20 23:38:08,546 INFO L290 TraceCheckUtils]: 16: Hoare triple {24041#(and (<= 0 |parse_input_c1_~x~0#1.offset|) (<= |parse_input_c1_~x~0#1.offset| 0))} assume !(c1_~x~0#1.base == 0 && c1_~x~0#1.offset == 0); {24041#(and (<= 0 |parse_input_c1_~x~0#1.offset|) (<= |parse_input_c1_~x~0#1.offset| 0))} is VALID [2022-02-20 23:38:08,546 INFO L290 TraceCheckUtils]: 15: Hoare triple {24017#true} assume !(##fun~~TO~VOID_#in~#fp#1.base == #funAddr~c2.base && ##fun~~TO~VOID_#in~#fp#1.offset == #funAddr~c2.offset);assume { :begin_inline_c1 } true;havoc c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset, c1_~x~0#1.base, c1_~x~0#1.offset;call c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset := #Ultimate.allocOnHeap(1);c1_~x~0#1.base, c1_~x~0#1.offset := c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset;havoc c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset; {24041#(and (<= 0 |parse_input_c1_~x~0#1.offset|) (<= |parse_input_c1_~x~0#1.offset| 0))} is VALID [2022-02-20 23:38:08,546 INFO L290 TraceCheckUtils]: 14: Hoare triple {24017#true} assume { :begin_inline_##fun~~TO~VOID } true;##fun~~TO~VOID_#in~#fp#1.base, ##fun~~TO~VOID_#in~#fp#1.offset := #t~mem6#1.base, #t~mem6#1.offset; {24017#true} is VALID [2022-02-20 23:38:08,546 INFO L290 TraceCheckUtils]: 13: Hoare triple {24017#true} SUMMARY for call #t~mem6#1.base, #t~mem6#1.offset := read~$Pointer$(~#commands~0.base, 4 + (~#commands~0.offset + 9 * ~i~0#1), 4); srcloc: L695 {24017#true} is VALID [2022-02-20 23:38:08,546 INFO L290 TraceCheckUtils]: 12: Hoare triple {24017#true} assume ~state~0 >= #t~mem5#1;havoc #t~mem5#1; {24017#true} is VALID [2022-02-20 23:38:08,547 INFO L290 TraceCheckUtils]: 11: Hoare triple {24017#true} SUMMARY for call #t~mem5#1 := read~int(~#commands~0.base, 8 + (~#commands~0.offset + 9 * ~i~0#1), 1); srcloc: L694 {24017#true} is VALID [2022-02-20 23:38:08,547 INFO L290 TraceCheckUtils]: 10: Hoare triple {24017#true} assume 0 == #t~nondet4#1;havoc #t~mem3#1.base, #t~mem3#1.offset;havoc #t~nondet4#1; {24017#true} is VALID [2022-02-20 23:38:08,547 INFO L290 TraceCheckUtils]: 9: Hoare triple {24017#true} assume ~input#1.offset < #length[~input#1.base] && ~input#1.offset >= 0; {24017#true} is VALID [2022-02-20 23:38:08,547 INFO L290 TraceCheckUtils]: 8: Hoare triple {24017#true} assume 1 == #valid[~input#1.base]; {24017#true} is VALID [2022-02-20 23:38:08,547 INFO L290 TraceCheckUtils]: 7: Hoare triple {24017#true} assume #t~mem3#1.offset < #length[#t~mem3#1.base] && #t~mem3#1.offset >= 0; {24017#true} is VALID [2022-02-20 23:38:08,547 INFO L290 TraceCheckUtils]: 6: Hoare triple {24017#true} assume 1 == #valid[#t~mem3#1.base]; {24017#true} is VALID [2022-02-20 23:38:08,547 INFO L290 TraceCheckUtils]: 5: Hoare triple {24017#true} SUMMARY for call #t~mem3#1.base, #t~mem3#1.offset := read~$Pointer$(~#commands~0.base, ~#commands~0.offset + 9 * ~i~0#1, 4); srcloc: L693 {24017#true} is VALID [2022-02-20 23:38:08,547 INFO L290 TraceCheckUtils]: 4: Hoare triple {24017#true} assume !!(~i~0#1 < 2); {24017#true} is VALID [2022-02-20 23:38:08,547 INFO L290 TraceCheckUtils]: 3: Hoare triple {24017#true} ~input#1.base, ~input#1.offset := #in~input#1.base, #in~input#1.offset;~i~0#1 := 0; {24017#true} is VALID [2022-02-20 23:38:08,547 INFO L272 TraceCheckUtils]: 2: Hoare triple {24017#true} call parse_input(3, 0); {24017#true} is VALID [2022-02-20 23:38:08,547 INFO L290 TraceCheckUtils]: 1: Hoare triple {24017#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1; {24017#true} is VALID [2022-02-20 23:38:08,547 INFO L290 TraceCheckUtils]: 0: Hoare triple {24017#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(3, 1);call write~init~int(99, 1, 0, 1);call write~init~int(49, 1, 1, 1);call write~init~int(0, 1, 2, 1);call #Ultimate.allocInit(3, 2);call write~init~int(99, 2, 0, 1);call write~init~int(50, 2, 1, 1);call write~init~int(0, 2, 2, 1);call #Ultimate.allocInit(3, 3);call write~init~int(99, 3, 0, 1);call write~init~int(49, 3, 1, 1);call write~init~int(0, 3, 2, 1);call #Ultimate.allocInit(3, 4);call write~init~int(99, 4, 0, 1);call write~init~int(49, 4, 1, 1);call write~init~int(0, 4, 2, 1);call #Ultimate.allocInit(3, 5);call write~init~int(99, 5, 0, 1);call write~init~int(50, 5, 1, 1);call write~init~int(0, 5, 2, 1);~state~0 := ~unnamed3~0~STATE_1;~global~0.base, ~global~0.offset := 0, 0;~#commands~0.base, ~#commands~0.offset := 6, 0;call #Ultimate.allocInit(18, 6);call write~init~$Pointer$(1, 0, ~#commands~0.base, ~#commands~0.offset, 4);call write~init~$Pointer$(#funAddr~c1.base, #funAddr~c1.offset, ~#commands~0.base, 4 + ~#commands~0.offset, 4);call write~init~int((if ~unnamed3~0~STATE_1 % 256 <= 127 then ~unnamed3~0~STATE_1 % 256 else ~unnamed3~0~STATE_1 % 256 - 256), ~#commands~0.base, 8 + ~#commands~0.offset, 1);call write~init~$Pointer$(2, 0, ~#commands~0.base, 9 + ~#commands~0.offset, 4);call write~init~$Pointer$(#funAddr~c2.base, #funAddr~c2.offset, ~#commands~0.base, 13 + ~#commands~0.offset, 4);call write~init~int((if ~unnamed3~0~STATE_2 % 256 <= 127 then ~unnamed3~0~STATE_2 % 256 else ~unnamed3~0~STATE_2 % 256 - 256), ~#commands~0.base, 17 + ~#commands~0.offset, 1); {24017#true} is VALID [2022-02-20 23:38:08,547 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:38:08,547 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1919805695] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 23:38:08,548 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 23:38:08,548 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 4 [2022-02-20 23:38:08,548 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382553514] [2022-02-20 23:38:08,548 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 23:38:08,548 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 40 [2022-02-20 23:38:08,548 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:38:08,548 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:38:08,574 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:38:08,574 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 23:38:08,574 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:38:08,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 23:38:08,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:38:08,575 INFO L87 Difference]: Start difference. First operand 433 states and 569 transitions. Second operand has 5 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:38:08,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:38:08,789 INFO L93 Difference]: Finished difference Result 455 states and 586 transitions. [2022-02-20 23:38:08,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 23:38:08,789 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 40 [2022-02-20 23:38:08,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:38:08,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:38:08,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 74 transitions. [2022-02-20 23:38:08,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:38:08,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 74 transitions. [2022-02-20 23:38:08,792 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 74 transitions. [2022-02-20 23:38:08,853 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 23:38:08,860 INFO L225 Difference]: With dead ends: 455 [2022-02-20 23:38:08,861 INFO L226 Difference]: Without dead ends: 455 [2022-02-20 23:38:08,862 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 79 SyntacticMatches, 4 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-02-20 23:38:08,863 INFO L933 BasicCegarLoop]: 36 mSDtfsCounter, 84 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:38:08,863 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [84 Valid, 70 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:38:08,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455 states. [2022-02-20 23:38:08,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 455 to 431. [2022-02-20 23:38:08,869 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:38:08,870 INFO L82 GeneralOperation]: Start isEquivalent. First operand 455 states. Second operand has 431 states, 389 states have (on average 1.3624678663239074) internal successors, (530), 412 states have internal predecessors, (530), 9 states have call successors, (9), 9 states have call predecessors, (9), 17 states have return successors, (23), 9 states have call predecessors, (23), 9 states have call successors, (23) [2022-02-20 23:38:08,870 INFO L74 IsIncluded]: Start isIncluded. First operand 455 states. Second operand has 431 states, 389 states have (on average 1.3624678663239074) internal successors, (530), 412 states have internal predecessors, (530), 9 states have call successors, (9), 9 states have call predecessors, (9), 17 states have return successors, (23), 9 states have call predecessors, (23), 9 states have call successors, (23) [2022-02-20 23:38:08,870 INFO L87 Difference]: Start difference. First operand 455 states. Second operand has 431 states, 389 states have (on average 1.3624678663239074) internal successors, (530), 412 states have internal predecessors, (530), 9 states have call successors, (9), 9 states have call predecessors, (9), 17 states have return successors, (23), 9 states have call predecessors, (23), 9 states have call successors, (23) [2022-02-20 23:38:08,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:38:08,878 INFO L93 Difference]: Finished difference Result 455 states and 586 transitions. [2022-02-20 23:38:08,878 INFO L276 IsEmpty]: Start isEmpty. Operand 455 states and 586 transitions. [2022-02-20 23:38:08,878 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:38:08,878 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:38:08,879 INFO L74 IsIncluded]: Start isIncluded. First operand has 431 states, 389 states have (on average 1.3624678663239074) internal successors, (530), 412 states have internal predecessors, (530), 9 states have call successors, (9), 9 states have call predecessors, (9), 17 states have return successors, (23), 9 states have call predecessors, (23), 9 states have call successors, (23) Second operand 455 states. [2022-02-20 23:38:08,879 INFO L87 Difference]: Start difference. First operand has 431 states, 389 states have (on average 1.3624678663239074) internal successors, (530), 412 states have internal predecessors, (530), 9 states have call successors, (9), 9 states have call predecessors, (9), 17 states have return successors, (23), 9 states have call predecessors, (23), 9 states have call successors, (23) Second operand 455 states. [2022-02-20 23:38:08,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:38:08,887 INFO L93 Difference]: Finished difference Result 455 states and 586 transitions. [2022-02-20 23:38:08,887 INFO L276 IsEmpty]: Start isEmpty. Operand 455 states and 586 transitions. [2022-02-20 23:38:08,887 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:38:08,887 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:38:08,888 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:38:08,888 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:38:08,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 431 states, 389 states have (on average 1.3624678663239074) internal successors, (530), 412 states have internal predecessors, (530), 9 states have call successors, (9), 9 states have call predecessors, (9), 17 states have return successors, (23), 9 states have call predecessors, (23), 9 states have call successors, (23) [2022-02-20 23:38:08,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 431 states and 562 transitions. [2022-02-20 23:38:08,895 INFO L78 Accepts]: Start accepts. Automaton has 431 states and 562 transitions. Word has length 40 [2022-02-20 23:38:08,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:38:08,895 INFO L470 AbstractCegarLoop]: Abstraction has 431 states and 562 transitions. [2022-02-20 23:38:08,895 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:38:08,895 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 562 transitions. [2022-02-20 23:38:08,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-02-20 23:38:08,896 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:38:08,896 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:38:08,914 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-02-20 23:38:09,112 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-02-20 23:38:09,112 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting parse_inputErr17ASSERT_VIOLATIONMEMORY_FREE === [parse_inputErr0REQUIRES_VIOLATION, parse_inputErr1REQUIRES_VIOLATION, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2022-02-20 23:38:09,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:38:09,112 INFO L85 PathProgramCache]: Analyzing trace with hash 1880179342, now seen corresponding path program 1 times [2022-02-20 23:38:09,112 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:38:09,112 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165883019] [2022-02-20 23:38:09,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:38:09,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:38:09,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:38:09,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 23:38:09,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:38:09,181 INFO L290 TraceCheckUtils]: 0: Hoare triple {26102#(and (= ~global~0.base |old(~global~0.base)|) (= |old(#length)| |#length|) (= |old(~global~0.offset)| ~global~0.offset) (= ~state~0 |old(~state~0)|) (= |old(#valid)| |#valid|))} ~input#1.base, ~input#1.offset := #in~input#1.base, #in~input#1.offset;~i~0#1 := 0; {26079#true} is VALID [2022-02-20 23:38:09,181 INFO L290 TraceCheckUtils]: 1: Hoare triple {26079#true} assume !!(~i~0#1 < 2); {26079#true} is VALID [2022-02-20 23:38:09,181 INFO L290 TraceCheckUtils]: 2: Hoare triple {26079#true} SUMMARY for call #t~mem3#1.base, #t~mem3#1.offset := read~$Pointer$(~#commands~0.base, ~#commands~0.offset + 9 * ~i~0#1, 4); srcloc: L693 {26079#true} is VALID [2022-02-20 23:38:09,181 INFO L290 TraceCheckUtils]: 3: Hoare triple {26079#true} assume 1 == #valid[#t~mem3#1.base]; {26079#true} is VALID [2022-02-20 23:38:09,181 INFO L290 TraceCheckUtils]: 4: Hoare triple {26079#true} assume #t~mem3#1.offset < #length[#t~mem3#1.base] && #t~mem3#1.offset >= 0; {26079#true} is VALID [2022-02-20 23:38:09,181 INFO L290 TraceCheckUtils]: 5: Hoare triple {26079#true} assume 1 == #valid[~input#1.base]; {26079#true} is VALID [2022-02-20 23:38:09,182 INFO L290 TraceCheckUtils]: 6: Hoare triple {26079#true} assume ~input#1.offset < #length[~input#1.base] && ~input#1.offset >= 0; {26079#true} is VALID [2022-02-20 23:38:09,182 INFO L290 TraceCheckUtils]: 7: Hoare triple {26079#true} assume 0 == #t~nondet4#1;havoc #t~mem3#1.base, #t~mem3#1.offset;havoc #t~nondet4#1; {26079#true} is VALID [2022-02-20 23:38:09,182 INFO L290 TraceCheckUtils]: 8: Hoare triple {26079#true} SUMMARY for call #t~mem5#1 := read~int(~#commands~0.base, 8 + (~#commands~0.offset + 9 * ~i~0#1), 1); srcloc: L694 {26079#true} is VALID [2022-02-20 23:38:09,182 INFO L290 TraceCheckUtils]: 9: Hoare triple {26079#true} assume ~state~0 >= #t~mem5#1;havoc #t~mem5#1; {26079#true} is VALID [2022-02-20 23:38:09,182 INFO L290 TraceCheckUtils]: 10: Hoare triple {26079#true} SUMMARY for call #t~mem6#1.base, #t~mem6#1.offset := read~$Pointer$(~#commands~0.base, 4 + (~#commands~0.offset + 9 * ~i~0#1), 4); srcloc: L695 {26079#true} is VALID [2022-02-20 23:38:09,182 INFO L290 TraceCheckUtils]: 11: Hoare triple {26079#true} assume { :begin_inline_##fun~~TO~VOID } true;##fun~~TO~VOID_#in~#fp#1.base, ##fun~~TO~VOID_#in~#fp#1.offset := #t~mem6#1.base, #t~mem6#1.offset; {26079#true} is VALID [2022-02-20 23:38:09,183 INFO L290 TraceCheckUtils]: 12: Hoare triple {26079#true} assume !(##fun~~TO~VOID_#in~#fp#1.base == #funAddr~c2.base && ##fun~~TO~VOID_#in~#fp#1.offset == #funAddr~c2.offset);assume { :begin_inline_c1 } true;havoc c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset, c1_~x~0#1.base, c1_~x~0#1.offset;call c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset := #Ultimate.allocOnHeap(1);c1_~x~0#1.base, c1_~x~0#1.offset := c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset;havoc c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset; {26103#(<= (+ |parse_input_c1_~x~0#1.base| 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:38:09,183 INFO L290 TraceCheckUtils]: 13: Hoare triple {26103#(<= (+ |parse_input_c1_~x~0#1.base| 1) |#StackHeapBarrier|)} assume !(c1_~x~0#1.base == 0 && c1_~x~0#1.offset == 0); {26103#(<= (+ |parse_input_c1_~x~0#1.base| 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:38:09,183 INFO L290 TraceCheckUtils]: 14: Hoare triple {26103#(<= (+ |parse_input_c1_~x~0#1.base| 1) |#StackHeapBarrier|)} assume !(~global~0.base != 0 || ~global~0.offset != 0); {26103#(<= (+ |parse_input_c1_~x~0#1.base| 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:38:09,184 INFO L290 TraceCheckUtils]: 15: Hoare triple {26103#(<= (+ |parse_input_c1_~x~0#1.base| 1) |#StackHeapBarrier|)} ~global~0.base, ~global~0.offset := c1_~x~0#1.base, c1_~x~0#1.offset;~state~0 := ~unnamed3~0~STATE_2; {26101#(<= (+ ~global~0.base 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:38:09,184 INFO L290 TraceCheckUtils]: 16: Hoare triple {26101#(<= (+ ~global~0.base 1) |#StackHeapBarrier|)} assume { :end_inline_c1 } true; {26101#(<= (+ ~global~0.base 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:38:09,184 INFO L290 TraceCheckUtils]: 17: Hoare triple {26101#(<= (+ ~global~0.base 1) |#StackHeapBarrier|)} assume { :end_inline_##fun~~TO~VOID } true;havoc #t~mem6#1.base, #t~mem6#1.offset; {26101#(<= (+ ~global~0.base 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:38:09,185 INFO L290 TraceCheckUtils]: 18: Hoare triple {26101#(<= (+ ~global~0.base 1) |#StackHeapBarrier|)} assume true; {26101#(<= (+ ~global~0.base 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:38:09,185 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {26101#(<= (+ ~global~0.base 1) |#StackHeapBarrier|)} {26079#true} #101#return; {26101#(<= (+ ~global~0.base 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:38:09,185 INFO L290 TraceCheckUtils]: 0: Hoare triple {26079#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(3, 1);call write~init~int(99, 1, 0, 1);call write~init~int(49, 1, 1, 1);call write~init~int(0, 1, 2, 1);call #Ultimate.allocInit(3, 2);call write~init~int(99, 2, 0, 1);call write~init~int(50, 2, 1, 1);call write~init~int(0, 2, 2, 1);call #Ultimate.allocInit(3, 3);call write~init~int(99, 3, 0, 1);call write~init~int(49, 3, 1, 1);call write~init~int(0, 3, 2, 1);call #Ultimate.allocInit(3, 4);call write~init~int(99, 4, 0, 1);call write~init~int(49, 4, 1, 1);call write~init~int(0, 4, 2, 1);call #Ultimate.allocInit(3, 5);call write~init~int(99, 5, 0, 1);call write~init~int(50, 5, 1, 1);call write~init~int(0, 5, 2, 1);~state~0 := ~unnamed3~0~STATE_1;~global~0.base, ~global~0.offset := 0, 0;~#commands~0.base, ~#commands~0.offset := 6, 0;call #Ultimate.allocInit(18, 6);call write~init~$Pointer$(1, 0, ~#commands~0.base, ~#commands~0.offset, 4);call write~init~$Pointer$(#funAddr~c1.base, #funAddr~c1.offset, ~#commands~0.base, 4 + ~#commands~0.offset, 4);call write~init~int((if ~unnamed3~0~STATE_1 % 256 <= 127 then ~unnamed3~0~STATE_1 % 256 else ~unnamed3~0~STATE_1 % 256 - 256), ~#commands~0.base, 8 + ~#commands~0.offset, 1);call write~init~$Pointer$(2, 0, ~#commands~0.base, 9 + ~#commands~0.offset, 4);call write~init~$Pointer$(#funAddr~c2.base, #funAddr~c2.offset, ~#commands~0.base, 13 + ~#commands~0.offset, 4);call write~init~int((if ~unnamed3~0~STATE_2 % 256 <= 127 then ~unnamed3~0~STATE_2 % 256 else ~unnamed3~0~STATE_2 % 256 - 256), ~#commands~0.base, 17 + ~#commands~0.offset, 1); {26079#true} is VALID [2022-02-20 23:38:09,185 INFO L290 TraceCheckUtils]: 1: Hoare triple {26079#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1; {26079#true} is VALID [2022-02-20 23:38:09,186 INFO L272 TraceCheckUtils]: 2: Hoare triple {26079#true} call parse_input(3, 0); {26102#(and (= ~global~0.base |old(~global~0.base)|) (= |old(#length)| |#length|) (= |old(~global~0.offset)| ~global~0.offset) (= ~state~0 |old(~state~0)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 23:38:09,186 INFO L290 TraceCheckUtils]: 3: Hoare triple {26102#(and (= ~global~0.base |old(~global~0.base)|) (= |old(#length)| |#length|) (= |old(~global~0.offset)| ~global~0.offset) (= ~state~0 |old(~state~0)|) (= |old(#valid)| |#valid|))} ~input#1.base, ~input#1.offset := #in~input#1.base, #in~input#1.offset;~i~0#1 := 0; {26079#true} is VALID [2022-02-20 23:38:09,186 INFO L290 TraceCheckUtils]: 4: Hoare triple {26079#true} assume !!(~i~0#1 < 2); {26079#true} is VALID [2022-02-20 23:38:09,186 INFO L290 TraceCheckUtils]: 5: Hoare triple {26079#true} SUMMARY for call #t~mem3#1.base, #t~mem3#1.offset := read~$Pointer$(~#commands~0.base, ~#commands~0.offset + 9 * ~i~0#1, 4); srcloc: L693 {26079#true} is VALID [2022-02-20 23:38:09,187 INFO L290 TraceCheckUtils]: 6: Hoare triple {26079#true} assume 1 == #valid[#t~mem3#1.base]; {26079#true} is VALID [2022-02-20 23:38:09,187 INFO L290 TraceCheckUtils]: 7: Hoare triple {26079#true} assume #t~mem3#1.offset < #length[#t~mem3#1.base] && #t~mem3#1.offset >= 0; {26079#true} is VALID [2022-02-20 23:38:09,187 INFO L290 TraceCheckUtils]: 8: Hoare triple {26079#true} assume 1 == #valid[~input#1.base]; {26079#true} is VALID [2022-02-20 23:38:09,187 INFO L290 TraceCheckUtils]: 9: Hoare triple {26079#true} assume ~input#1.offset < #length[~input#1.base] && ~input#1.offset >= 0; {26079#true} is VALID [2022-02-20 23:38:09,187 INFO L290 TraceCheckUtils]: 10: Hoare triple {26079#true} assume 0 == #t~nondet4#1;havoc #t~mem3#1.base, #t~mem3#1.offset;havoc #t~nondet4#1; {26079#true} is VALID [2022-02-20 23:38:09,187 INFO L290 TraceCheckUtils]: 11: Hoare triple {26079#true} SUMMARY for call #t~mem5#1 := read~int(~#commands~0.base, 8 + (~#commands~0.offset + 9 * ~i~0#1), 1); srcloc: L694 {26079#true} is VALID [2022-02-20 23:38:09,187 INFO L290 TraceCheckUtils]: 12: Hoare triple {26079#true} assume ~state~0 >= #t~mem5#1;havoc #t~mem5#1; {26079#true} is VALID [2022-02-20 23:38:09,187 INFO L290 TraceCheckUtils]: 13: Hoare triple {26079#true} SUMMARY for call #t~mem6#1.base, #t~mem6#1.offset := read~$Pointer$(~#commands~0.base, 4 + (~#commands~0.offset + 9 * ~i~0#1), 4); srcloc: L695 {26079#true} is VALID [2022-02-20 23:38:09,187 INFO L290 TraceCheckUtils]: 14: Hoare triple {26079#true} assume { :begin_inline_##fun~~TO~VOID } true;##fun~~TO~VOID_#in~#fp#1.base, ##fun~~TO~VOID_#in~#fp#1.offset := #t~mem6#1.base, #t~mem6#1.offset; {26079#true} is VALID [2022-02-20 23:38:09,188 INFO L290 TraceCheckUtils]: 15: Hoare triple {26079#true} assume !(##fun~~TO~VOID_#in~#fp#1.base == #funAddr~c2.base && ##fun~~TO~VOID_#in~#fp#1.offset == #funAddr~c2.offset);assume { :begin_inline_c1 } true;havoc c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset, c1_~x~0#1.base, c1_~x~0#1.offset;call c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset := #Ultimate.allocOnHeap(1);c1_~x~0#1.base, c1_~x~0#1.offset := c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset;havoc c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset; {26103#(<= (+ |parse_input_c1_~x~0#1.base| 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:38:09,188 INFO L290 TraceCheckUtils]: 16: Hoare triple {26103#(<= (+ |parse_input_c1_~x~0#1.base| 1) |#StackHeapBarrier|)} assume !(c1_~x~0#1.base == 0 && c1_~x~0#1.offset == 0); {26103#(<= (+ |parse_input_c1_~x~0#1.base| 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:38:09,189 INFO L290 TraceCheckUtils]: 17: Hoare triple {26103#(<= (+ |parse_input_c1_~x~0#1.base| 1) |#StackHeapBarrier|)} assume !(~global~0.base != 0 || ~global~0.offset != 0); {26103#(<= (+ |parse_input_c1_~x~0#1.base| 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:38:09,189 INFO L290 TraceCheckUtils]: 18: Hoare triple {26103#(<= (+ |parse_input_c1_~x~0#1.base| 1) |#StackHeapBarrier|)} ~global~0.base, ~global~0.offset := c1_~x~0#1.base, c1_~x~0#1.offset;~state~0 := ~unnamed3~0~STATE_2; {26101#(<= (+ ~global~0.base 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:38:09,189 INFO L290 TraceCheckUtils]: 19: Hoare triple {26101#(<= (+ ~global~0.base 1) |#StackHeapBarrier|)} assume { :end_inline_c1 } true; {26101#(<= (+ ~global~0.base 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:38:09,190 INFO L290 TraceCheckUtils]: 20: Hoare triple {26101#(<= (+ ~global~0.base 1) |#StackHeapBarrier|)} assume { :end_inline_##fun~~TO~VOID } true;havoc #t~mem6#1.base, #t~mem6#1.offset; {26101#(<= (+ ~global~0.base 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:38:09,190 INFO L290 TraceCheckUtils]: 21: Hoare triple {26101#(<= (+ ~global~0.base 1) |#StackHeapBarrier|)} assume true; {26101#(<= (+ ~global~0.base 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:38:09,190 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {26101#(<= (+ ~global~0.base 1) |#StackHeapBarrier|)} {26079#true} #101#return; {26101#(<= (+ ~global~0.base 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:38:09,191 INFO L272 TraceCheckUtils]: 23: Hoare triple {26101#(<= (+ ~global~0.base 1) |#StackHeapBarrier|)} call parse_input(4, 0); {26101#(<= (+ ~global~0.base 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:38:09,191 INFO L290 TraceCheckUtils]: 24: Hoare triple {26101#(<= (+ ~global~0.base 1) |#StackHeapBarrier|)} ~input#1.base, ~input#1.offset := #in~input#1.base, #in~input#1.offset;~i~0#1 := 0; {26101#(<= (+ ~global~0.base 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:38:09,191 INFO L290 TraceCheckUtils]: 25: Hoare triple {26101#(<= (+ ~global~0.base 1) |#StackHeapBarrier|)} assume !!(~i~0#1 < 2); {26101#(<= (+ ~global~0.base 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:38:09,192 INFO L290 TraceCheckUtils]: 26: Hoare triple {26101#(<= (+ ~global~0.base 1) |#StackHeapBarrier|)} SUMMARY for call #t~mem3#1.base, #t~mem3#1.offset := read~$Pointer$(~#commands~0.base, ~#commands~0.offset + 9 * ~i~0#1, 4); srcloc: L693 {26101#(<= (+ ~global~0.base 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:38:09,192 INFO L290 TraceCheckUtils]: 27: Hoare triple {26101#(<= (+ ~global~0.base 1) |#StackHeapBarrier|)} assume 1 == #valid[#t~mem3#1.base]; {26101#(<= (+ ~global~0.base 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:38:09,192 INFO L290 TraceCheckUtils]: 28: Hoare triple {26101#(<= (+ ~global~0.base 1) |#StackHeapBarrier|)} assume #t~mem3#1.offset < #length[#t~mem3#1.base] && #t~mem3#1.offset >= 0; {26101#(<= (+ ~global~0.base 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:38:09,192 INFO L290 TraceCheckUtils]: 29: Hoare triple {26101#(<= (+ ~global~0.base 1) |#StackHeapBarrier|)} assume 1 == #valid[~input#1.base]; {26101#(<= (+ ~global~0.base 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:38:09,193 INFO L290 TraceCheckUtils]: 30: Hoare triple {26101#(<= (+ ~global~0.base 1) |#StackHeapBarrier|)} assume ~input#1.offset < #length[~input#1.base] && ~input#1.offset >= 0; {26101#(<= (+ ~global~0.base 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:38:09,193 INFO L290 TraceCheckUtils]: 31: Hoare triple {26101#(<= (+ ~global~0.base 1) |#StackHeapBarrier|)} assume 0 == #t~nondet4#1;havoc #t~mem3#1.base, #t~mem3#1.offset;havoc #t~nondet4#1; {26101#(<= (+ ~global~0.base 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:38:09,193 INFO L290 TraceCheckUtils]: 32: Hoare triple {26101#(<= (+ ~global~0.base 1) |#StackHeapBarrier|)} SUMMARY for call #t~mem5#1 := read~int(~#commands~0.base, 8 + (~#commands~0.offset + 9 * ~i~0#1), 1); srcloc: L694 {26101#(<= (+ ~global~0.base 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:38:09,194 INFO L290 TraceCheckUtils]: 33: Hoare triple {26101#(<= (+ ~global~0.base 1) |#StackHeapBarrier|)} assume ~state~0 >= #t~mem5#1;havoc #t~mem5#1; {26101#(<= (+ ~global~0.base 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:38:09,194 INFO L290 TraceCheckUtils]: 34: Hoare triple {26101#(<= (+ ~global~0.base 1) |#StackHeapBarrier|)} SUMMARY for call #t~mem6#1.base, #t~mem6#1.offset := read~$Pointer$(~#commands~0.base, 4 + (~#commands~0.offset + 9 * ~i~0#1), 4); srcloc: L695 {26101#(<= (+ ~global~0.base 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:38:09,194 INFO L290 TraceCheckUtils]: 35: Hoare triple {26101#(<= (+ ~global~0.base 1) |#StackHeapBarrier|)} assume { :begin_inline_##fun~~TO~VOID } true;##fun~~TO~VOID_#in~#fp#1.base, ##fun~~TO~VOID_#in~#fp#1.offset := #t~mem6#1.base, #t~mem6#1.offset; {26101#(<= (+ ~global~0.base 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:38:09,194 INFO L290 TraceCheckUtils]: 36: Hoare triple {26101#(<= (+ ~global~0.base 1) |#StackHeapBarrier|)} assume !(##fun~~TO~VOID_#in~#fp#1.base == #funAddr~c2.base && ##fun~~TO~VOID_#in~#fp#1.offset == #funAddr~c2.offset);assume { :begin_inline_c1 } true;havoc c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset, c1_~x~0#1.base, c1_~x~0#1.offset;call c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset := #Ultimate.allocOnHeap(1);c1_~x~0#1.base, c1_~x~0#1.offset := c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset;havoc c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset; {26101#(<= (+ ~global~0.base 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:38:09,195 INFO L290 TraceCheckUtils]: 37: Hoare triple {26101#(<= (+ ~global~0.base 1) |#StackHeapBarrier|)} assume !(c1_~x~0#1.base == 0 && c1_~x~0#1.offset == 0); {26101#(<= (+ ~global~0.base 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:38:09,195 INFO L290 TraceCheckUtils]: 38: Hoare triple {26101#(<= (+ ~global~0.base 1) |#StackHeapBarrier|)} assume ~global~0.base != 0 || ~global~0.offset != 0; {26101#(<= (+ ~global~0.base 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:38:09,195 INFO L290 TraceCheckUtils]: 39: Hoare triple {26101#(<= (+ ~global~0.base 1) |#StackHeapBarrier|)} assume 0 == ~global~0.offset; {26101#(<= (+ ~global~0.base 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:38:09,196 INFO L290 TraceCheckUtils]: 40: Hoare triple {26101#(<= (+ ~global~0.base 1) |#StackHeapBarrier|)} assume !(~global~0.base < #StackHeapBarrier); {26080#false} is VALID [2022-02-20 23:38:09,196 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 12 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:38:09,196 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:38:09,196 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165883019] [2022-02-20 23:38:09,196 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [165883019] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 23:38:09,196 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [203890589] [2022-02-20 23:38:09,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:38:09,197 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:38:09,197 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:38:09,198 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 23:38:09,199 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-02-20 23:38:09,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:38:09,260 INFO L263 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-20 23:38:09,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:38:09,273 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:38:09,413 INFO L290 TraceCheckUtils]: 0: Hoare triple {26079#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(3, 1);call write~init~int(99, 1, 0, 1);call write~init~int(49, 1, 1, 1);call write~init~int(0, 1, 2, 1);call #Ultimate.allocInit(3, 2);call write~init~int(99, 2, 0, 1);call write~init~int(50, 2, 1, 1);call write~init~int(0, 2, 2, 1);call #Ultimate.allocInit(3, 3);call write~init~int(99, 3, 0, 1);call write~init~int(49, 3, 1, 1);call write~init~int(0, 3, 2, 1);call #Ultimate.allocInit(3, 4);call write~init~int(99, 4, 0, 1);call write~init~int(49, 4, 1, 1);call write~init~int(0, 4, 2, 1);call #Ultimate.allocInit(3, 5);call write~init~int(99, 5, 0, 1);call write~init~int(50, 5, 1, 1);call write~init~int(0, 5, 2, 1);~state~0 := ~unnamed3~0~STATE_1;~global~0.base, ~global~0.offset := 0, 0;~#commands~0.base, ~#commands~0.offset := 6, 0;call #Ultimate.allocInit(18, 6);call write~init~$Pointer$(1, 0, ~#commands~0.base, ~#commands~0.offset, 4);call write~init~$Pointer$(#funAddr~c1.base, #funAddr~c1.offset, ~#commands~0.base, 4 + ~#commands~0.offset, 4);call write~init~int((if ~unnamed3~0~STATE_1 % 256 <= 127 then ~unnamed3~0~STATE_1 % 256 else ~unnamed3~0~STATE_1 % 256 - 256), ~#commands~0.base, 8 + ~#commands~0.offset, 1);call write~init~$Pointer$(2, 0, ~#commands~0.base, 9 + ~#commands~0.offset, 4);call write~init~$Pointer$(#funAddr~c2.base, #funAddr~c2.offset, ~#commands~0.base, 13 + ~#commands~0.offset, 4);call write~init~int((if ~unnamed3~0~STATE_2 % 256 <= 127 then ~unnamed3~0~STATE_2 % 256 else ~unnamed3~0~STATE_2 % 256 - 256), ~#commands~0.base, 17 + ~#commands~0.offset, 1); {26079#true} is VALID [2022-02-20 23:38:09,414 INFO L290 TraceCheckUtils]: 1: Hoare triple {26079#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1; {26079#true} is VALID [2022-02-20 23:38:09,414 INFO L272 TraceCheckUtils]: 2: Hoare triple {26079#true} call parse_input(3, 0); {26079#true} is VALID [2022-02-20 23:38:09,414 INFO L290 TraceCheckUtils]: 3: Hoare triple {26079#true} ~input#1.base, ~input#1.offset := #in~input#1.base, #in~input#1.offset;~i~0#1 := 0; {26079#true} is VALID [2022-02-20 23:38:09,414 INFO L290 TraceCheckUtils]: 4: Hoare triple {26079#true} assume !!(~i~0#1 < 2); {26079#true} is VALID [2022-02-20 23:38:09,414 INFO L290 TraceCheckUtils]: 5: Hoare triple {26079#true} SUMMARY for call #t~mem3#1.base, #t~mem3#1.offset := read~$Pointer$(~#commands~0.base, ~#commands~0.offset + 9 * ~i~0#1, 4); srcloc: L693 {26079#true} is VALID [2022-02-20 23:38:09,414 INFO L290 TraceCheckUtils]: 6: Hoare triple {26079#true} assume 1 == #valid[#t~mem3#1.base]; {26079#true} is VALID [2022-02-20 23:38:09,414 INFO L290 TraceCheckUtils]: 7: Hoare triple {26079#true} assume #t~mem3#1.offset < #length[#t~mem3#1.base] && #t~mem3#1.offset >= 0; {26079#true} is VALID [2022-02-20 23:38:09,414 INFO L290 TraceCheckUtils]: 8: Hoare triple {26079#true} assume 1 == #valid[~input#1.base]; {26079#true} is VALID [2022-02-20 23:38:09,414 INFO L290 TraceCheckUtils]: 9: Hoare triple {26079#true} assume ~input#1.offset < #length[~input#1.base] && ~input#1.offset >= 0; {26079#true} is VALID [2022-02-20 23:38:09,414 INFO L290 TraceCheckUtils]: 10: Hoare triple {26079#true} assume 0 == #t~nondet4#1;havoc #t~mem3#1.base, #t~mem3#1.offset;havoc #t~nondet4#1; {26079#true} is VALID [2022-02-20 23:38:09,414 INFO L290 TraceCheckUtils]: 11: Hoare triple {26079#true} SUMMARY for call #t~mem5#1 := read~int(~#commands~0.base, 8 + (~#commands~0.offset + 9 * ~i~0#1), 1); srcloc: L694 {26079#true} is VALID [2022-02-20 23:38:09,414 INFO L290 TraceCheckUtils]: 12: Hoare triple {26079#true} assume ~state~0 >= #t~mem5#1;havoc #t~mem5#1; {26079#true} is VALID [2022-02-20 23:38:09,414 INFO L290 TraceCheckUtils]: 13: Hoare triple {26079#true} SUMMARY for call #t~mem6#1.base, #t~mem6#1.offset := read~$Pointer$(~#commands~0.base, 4 + (~#commands~0.offset + 9 * ~i~0#1), 4); srcloc: L695 {26079#true} is VALID [2022-02-20 23:38:09,414 INFO L290 TraceCheckUtils]: 14: Hoare triple {26079#true} assume { :begin_inline_##fun~~TO~VOID } true;##fun~~TO~VOID_#in~#fp#1.base, ##fun~~TO~VOID_#in~#fp#1.offset := #t~mem6#1.base, #t~mem6#1.offset; {26079#true} is VALID [2022-02-20 23:38:09,415 INFO L290 TraceCheckUtils]: 15: Hoare triple {26079#true} assume !(##fun~~TO~VOID_#in~#fp#1.base == #funAddr~c2.base && ##fun~~TO~VOID_#in~#fp#1.offset == #funAddr~c2.offset);assume { :begin_inline_c1 } true;havoc c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset, c1_~x~0#1.base, c1_~x~0#1.offset;call c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset := #Ultimate.allocOnHeap(1);c1_~x~0#1.base, c1_~x~0#1.offset := c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset;havoc c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset; {26103#(<= (+ |parse_input_c1_~x~0#1.base| 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:38:09,415 INFO L290 TraceCheckUtils]: 16: Hoare triple {26103#(<= (+ |parse_input_c1_~x~0#1.base| 1) |#StackHeapBarrier|)} assume !(c1_~x~0#1.base == 0 && c1_~x~0#1.offset == 0); {26103#(<= (+ |parse_input_c1_~x~0#1.base| 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:38:09,416 INFO L290 TraceCheckUtils]: 17: Hoare triple {26103#(<= (+ |parse_input_c1_~x~0#1.base| 1) |#StackHeapBarrier|)} assume !(~global~0.base != 0 || ~global~0.offset != 0); {26103#(<= (+ |parse_input_c1_~x~0#1.base| 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:38:09,416 INFO L290 TraceCheckUtils]: 18: Hoare triple {26103#(<= (+ |parse_input_c1_~x~0#1.base| 1) |#StackHeapBarrier|)} ~global~0.base, ~global~0.offset := c1_~x~0#1.base, c1_~x~0#1.offset;~state~0 := ~unnamed3~0~STATE_2; {26101#(<= (+ ~global~0.base 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:38:09,416 INFO L290 TraceCheckUtils]: 19: Hoare triple {26101#(<= (+ ~global~0.base 1) |#StackHeapBarrier|)} assume { :end_inline_c1 } true; {26101#(<= (+ ~global~0.base 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:38:09,416 INFO L290 TraceCheckUtils]: 20: Hoare triple {26101#(<= (+ ~global~0.base 1) |#StackHeapBarrier|)} assume { :end_inline_##fun~~TO~VOID } true;havoc #t~mem6#1.base, #t~mem6#1.offset; {26101#(<= (+ ~global~0.base 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:38:09,417 INFO L290 TraceCheckUtils]: 21: Hoare triple {26101#(<= (+ ~global~0.base 1) |#StackHeapBarrier|)} assume true; {26101#(<= (+ ~global~0.base 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:38:09,417 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {26101#(<= (+ ~global~0.base 1) |#StackHeapBarrier|)} {26079#true} #101#return; {26101#(<= (+ ~global~0.base 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:38:09,417 INFO L272 TraceCheckUtils]: 23: Hoare triple {26101#(<= (+ ~global~0.base 1) |#StackHeapBarrier|)} call parse_input(4, 0); {26101#(<= (+ ~global~0.base 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:38:09,418 INFO L290 TraceCheckUtils]: 24: Hoare triple {26101#(<= (+ ~global~0.base 1) |#StackHeapBarrier|)} ~input#1.base, ~input#1.offset := #in~input#1.base, #in~input#1.offset;~i~0#1 := 0; {26101#(<= (+ ~global~0.base 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:38:09,418 INFO L290 TraceCheckUtils]: 25: Hoare triple {26101#(<= (+ ~global~0.base 1) |#StackHeapBarrier|)} assume !!(~i~0#1 < 2); {26101#(<= (+ ~global~0.base 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:38:09,418 INFO L290 TraceCheckUtils]: 26: Hoare triple {26101#(<= (+ ~global~0.base 1) |#StackHeapBarrier|)} SUMMARY for call #t~mem3#1.base, #t~mem3#1.offset := read~$Pointer$(~#commands~0.base, ~#commands~0.offset + 9 * ~i~0#1, 4); srcloc: L693 {26101#(<= (+ ~global~0.base 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:38:09,419 INFO L290 TraceCheckUtils]: 27: Hoare triple {26101#(<= (+ ~global~0.base 1) |#StackHeapBarrier|)} assume 1 == #valid[#t~mem3#1.base]; {26101#(<= (+ ~global~0.base 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:38:09,419 INFO L290 TraceCheckUtils]: 28: Hoare triple {26101#(<= (+ ~global~0.base 1) |#StackHeapBarrier|)} assume #t~mem3#1.offset < #length[#t~mem3#1.base] && #t~mem3#1.offset >= 0; {26101#(<= (+ ~global~0.base 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:38:09,419 INFO L290 TraceCheckUtils]: 29: Hoare triple {26101#(<= (+ ~global~0.base 1) |#StackHeapBarrier|)} assume 1 == #valid[~input#1.base]; {26101#(<= (+ ~global~0.base 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:38:09,419 INFO L290 TraceCheckUtils]: 30: Hoare triple {26101#(<= (+ ~global~0.base 1) |#StackHeapBarrier|)} assume ~input#1.offset < #length[~input#1.base] && ~input#1.offset >= 0; {26101#(<= (+ ~global~0.base 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:38:09,420 INFO L290 TraceCheckUtils]: 31: Hoare triple {26101#(<= (+ ~global~0.base 1) |#StackHeapBarrier|)} assume 0 == #t~nondet4#1;havoc #t~mem3#1.base, #t~mem3#1.offset;havoc #t~nondet4#1; {26101#(<= (+ ~global~0.base 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:38:09,420 INFO L290 TraceCheckUtils]: 32: Hoare triple {26101#(<= (+ ~global~0.base 1) |#StackHeapBarrier|)} SUMMARY for call #t~mem5#1 := read~int(~#commands~0.base, 8 + (~#commands~0.offset + 9 * ~i~0#1), 1); srcloc: L694 {26101#(<= (+ ~global~0.base 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:38:09,420 INFO L290 TraceCheckUtils]: 33: Hoare triple {26101#(<= (+ ~global~0.base 1) |#StackHeapBarrier|)} assume ~state~0 >= #t~mem5#1;havoc #t~mem5#1; {26101#(<= (+ ~global~0.base 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:38:09,420 INFO L290 TraceCheckUtils]: 34: Hoare triple {26101#(<= (+ ~global~0.base 1) |#StackHeapBarrier|)} SUMMARY for call #t~mem6#1.base, #t~mem6#1.offset := read~$Pointer$(~#commands~0.base, 4 + (~#commands~0.offset + 9 * ~i~0#1), 4); srcloc: L695 {26101#(<= (+ ~global~0.base 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:38:09,421 INFO L290 TraceCheckUtils]: 35: Hoare triple {26101#(<= (+ ~global~0.base 1) |#StackHeapBarrier|)} assume { :begin_inline_##fun~~TO~VOID } true;##fun~~TO~VOID_#in~#fp#1.base, ##fun~~TO~VOID_#in~#fp#1.offset := #t~mem6#1.base, #t~mem6#1.offset; {26101#(<= (+ ~global~0.base 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:38:09,421 INFO L290 TraceCheckUtils]: 36: Hoare triple {26101#(<= (+ ~global~0.base 1) |#StackHeapBarrier|)} assume !(##fun~~TO~VOID_#in~#fp#1.base == #funAddr~c2.base && ##fun~~TO~VOID_#in~#fp#1.offset == #funAddr~c2.offset);assume { :begin_inline_c1 } true;havoc c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset, c1_~x~0#1.base, c1_~x~0#1.offset;call c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset := #Ultimate.allocOnHeap(1);c1_~x~0#1.base, c1_~x~0#1.offset := c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset;havoc c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset; {26101#(<= (+ ~global~0.base 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:38:09,421 INFO L290 TraceCheckUtils]: 37: Hoare triple {26101#(<= (+ ~global~0.base 1) |#StackHeapBarrier|)} assume !(c1_~x~0#1.base == 0 && c1_~x~0#1.offset == 0); {26101#(<= (+ ~global~0.base 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:38:09,421 INFO L290 TraceCheckUtils]: 38: Hoare triple {26101#(<= (+ ~global~0.base 1) |#StackHeapBarrier|)} assume ~global~0.base != 0 || ~global~0.offset != 0; {26101#(<= (+ ~global~0.base 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:38:09,422 INFO L290 TraceCheckUtils]: 39: Hoare triple {26101#(<= (+ ~global~0.base 1) |#StackHeapBarrier|)} assume 0 == ~global~0.offset; {26101#(<= (+ ~global~0.base 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:38:09,422 INFO L290 TraceCheckUtils]: 40: Hoare triple {26101#(<= (+ ~global~0.base 1) |#StackHeapBarrier|)} assume !(~global~0.base < #StackHeapBarrier); {26080#false} is VALID [2022-02-20 23:38:09,422 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:38:09,422 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:38:09,608 INFO L290 TraceCheckUtils]: 40: Hoare triple {26101#(<= (+ ~global~0.base 1) |#StackHeapBarrier|)} assume !(~global~0.base < #StackHeapBarrier); {26080#false} is VALID [2022-02-20 23:38:09,608 INFO L290 TraceCheckUtils]: 39: Hoare triple {26101#(<= (+ ~global~0.base 1) |#StackHeapBarrier|)} assume 0 == ~global~0.offset; {26101#(<= (+ ~global~0.base 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:38:09,609 INFO L290 TraceCheckUtils]: 38: Hoare triple {26101#(<= (+ ~global~0.base 1) |#StackHeapBarrier|)} assume ~global~0.base != 0 || ~global~0.offset != 0; {26101#(<= (+ ~global~0.base 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:38:09,609 INFO L290 TraceCheckUtils]: 37: Hoare triple {26101#(<= (+ ~global~0.base 1) |#StackHeapBarrier|)} assume !(c1_~x~0#1.base == 0 && c1_~x~0#1.offset == 0); {26101#(<= (+ ~global~0.base 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:38:09,609 INFO L290 TraceCheckUtils]: 36: Hoare triple {26101#(<= (+ ~global~0.base 1) |#StackHeapBarrier|)} assume !(##fun~~TO~VOID_#in~#fp#1.base == #funAddr~c2.base && ##fun~~TO~VOID_#in~#fp#1.offset == #funAddr~c2.offset);assume { :begin_inline_c1 } true;havoc c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset, c1_~x~0#1.base, c1_~x~0#1.offset;call c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset := #Ultimate.allocOnHeap(1);c1_~x~0#1.base, c1_~x~0#1.offset := c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset;havoc c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset; {26101#(<= (+ ~global~0.base 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:38:09,609 INFO L290 TraceCheckUtils]: 35: Hoare triple {26101#(<= (+ ~global~0.base 1) |#StackHeapBarrier|)} assume { :begin_inline_##fun~~TO~VOID } true;##fun~~TO~VOID_#in~#fp#1.base, ##fun~~TO~VOID_#in~#fp#1.offset := #t~mem6#1.base, #t~mem6#1.offset; {26101#(<= (+ ~global~0.base 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:38:09,611 INFO L290 TraceCheckUtils]: 34: Hoare triple {26101#(<= (+ ~global~0.base 1) |#StackHeapBarrier|)} SUMMARY for call #t~mem6#1.base, #t~mem6#1.offset := read~$Pointer$(~#commands~0.base, 4 + (~#commands~0.offset + 9 * ~i~0#1), 4); srcloc: L695 {26101#(<= (+ ~global~0.base 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:38:09,611 INFO L290 TraceCheckUtils]: 33: Hoare triple {26101#(<= (+ ~global~0.base 1) |#StackHeapBarrier|)} assume ~state~0 >= #t~mem5#1;havoc #t~mem5#1; {26101#(<= (+ ~global~0.base 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:38:09,612 INFO L290 TraceCheckUtils]: 32: Hoare triple {26101#(<= (+ ~global~0.base 1) |#StackHeapBarrier|)} SUMMARY for call #t~mem5#1 := read~int(~#commands~0.base, 8 + (~#commands~0.offset + 9 * ~i~0#1), 1); srcloc: L694 {26101#(<= (+ ~global~0.base 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:38:09,612 INFO L290 TraceCheckUtils]: 31: Hoare triple {26101#(<= (+ ~global~0.base 1) |#StackHeapBarrier|)} assume 0 == #t~nondet4#1;havoc #t~mem3#1.base, #t~mem3#1.offset;havoc #t~nondet4#1; {26101#(<= (+ ~global~0.base 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:38:09,612 INFO L290 TraceCheckUtils]: 30: Hoare triple {26101#(<= (+ ~global~0.base 1) |#StackHeapBarrier|)} assume ~input#1.offset < #length[~input#1.base] && ~input#1.offset >= 0; {26101#(<= (+ ~global~0.base 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:38:09,612 INFO L290 TraceCheckUtils]: 29: Hoare triple {26101#(<= (+ ~global~0.base 1) |#StackHeapBarrier|)} assume 1 == #valid[~input#1.base]; {26101#(<= (+ ~global~0.base 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:38:09,613 INFO L290 TraceCheckUtils]: 28: Hoare triple {26101#(<= (+ ~global~0.base 1) |#StackHeapBarrier|)} assume #t~mem3#1.offset < #length[#t~mem3#1.base] && #t~mem3#1.offset >= 0; {26101#(<= (+ ~global~0.base 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:38:09,613 INFO L290 TraceCheckUtils]: 27: Hoare triple {26101#(<= (+ ~global~0.base 1) |#StackHeapBarrier|)} assume 1 == #valid[#t~mem3#1.base]; {26101#(<= (+ ~global~0.base 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:38:09,613 INFO L290 TraceCheckUtils]: 26: Hoare triple {26101#(<= (+ ~global~0.base 1) |#StackHeapBarrier|)} SUMMARY for call #t~mem3#1.base, #t~mem3#1.offset := read~$Pointer$(~#commands~0.base, ~#commands~0.offset + 9 * ~i~0#1, 4); srcloc: L693 {26101#(<= (+ ~global~0.base 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:38:09,613 INFO L290 TraceCheckUtils]: 25: Hoare triple {26101#(<= (+ ~global~0.base 1) |#StackHeapBarrier|)} assume !!(~i~0#1 < 2); {26101#(<= (+ ~global~0.base 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:38:09,614 INFO L290 TraceCheckUtils]: 24: Hoare triple {26101#(<= (+ ~global~0.base 1) |#StackHeapBarrier|)} ~input#1.base, ~input#1.offset := #in~input#1.base, #in~input#1.offset;~i~0#1 := 0; {26101#(<= (+ ~global~0.base 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:38:09,614 INFO L272 TraceCheckUtils]: 23: Hoare triple {26101#(<= (+ ~global~0.base 1) |#StackHeapBarrier|)} call parse_input(4, 0); {26101#(<= (+ ~global~0.base 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:38:09,615 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {26101#(<= (+ ~global~0.base 1) |#StackHeapBarrier|)} {26079#true} #101#return; {26101#(<= (+ ~global~0.base 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:38:09,615 INFO L290 TraceCheckUtils]: 21: Hoare triple {26101#(<= (+ ~global~0.base 1) |#StackHeapBarrier|)} assume true; {26101#(<= (+ ~global~0.base 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:38:09,615 INFO L290 TraceCheckUtils]: 20: Hoare triple {26101#(<= (+ ~global~0.base 1) |#StackHeapBarrier|)} assume { :end_inline_##fun~~TO~VOID } true;havoc #t~mem6#1.base, #t~mem6#1.offset; {26101#(<= (+ ~global~0.base 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:38:09,615 INFO L290 TraceCheckUtils]: 19: Hoare triple {26101#(<= (+ ~global~0.base 1) |#StackHeapBarrier|)} assume { :end_inline_c1 } true; {26101#(<= (+ ~global~0.base 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:38:09,616 INFO L290 TraceCheckUtils]: 18: Hoare triple {26103#(<= (+ |parse_input_c1_~x~0#1.base| 1) |#StackHeapBarrier|)} ~global~0.base, ~global~0.offset := c1_~x~0#1.base, c1_~x~0#1.offset;~state~0 := ~unnamed3~0~STATE_2; {26101#(<= (+ ~global~0.base 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:38:09,616 INFO L290 TraceCheckUtils]: 17: Hoare triple {26103#(<= (+ |parse_input_c1_~x~0#1.base| 1) |#StackHeapBarrier|)} assume !(~global~0.base != 0 || ~global~0.offset != 0); {26103#(<= (+ |parse_input_c1_~x~0#1.base| 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:38:09,616 INFO L290 TraceCheckUtils]: 16: Hoare triple {26103#(<= (+ |parse_input_c1_~x~0#1.base| 1) |#StackHeapBarrier|)} assume !(c1_~x~0#1.base == 0 && c1_~x~0#1.offset == 0); {26103#(<= (+ |parse_input_c1_~x~0#1.base| 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:38:09,617 INFO L290 TraceCheckUtils]: 15: Hoare triple {26079#true} assume !(##fun~~TO~VOID_#in~#fp#1.base == #funAddr~c2.base && ##fun~~TO~VOID_#in~#fp#1.offset == #funAddr~c2.offset);assume { :begin_inline_c1 } true;havoc c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset, c1_~x~0#1.base, c1_~x~0#1.offset;call c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset := #Ultimate.allocOnHeap(1);c1_~x~0#1.base, c1_~x~0#1.offset := c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset;havoc c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset; {26103#(<= (+ |parse_input_c1_~x~0#1.base| 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:38:09,617 INFO L290 TraceCheckUtils]: 14: Hoare triple {26079#true} assume { :begin_inline_##fun~~TO~VOID } true;##fun~~TO~VOID_#in~#fp#1.base, ##fun~~TO~VOID_#in~#fp#1.offset := #t~mem6#1.base, #t~mem6#1.offset; {26079#true} is VALID [2022-02-20 23:38:09,617 INFO L290 TraceCheckUtils]: 13: Hoare triple {26079#true} SUMMARY for call #t~mem6#1.base, #t~mem6#1.offset := read~$Pointer$(~#commands~0.base, 4 + (~#commands~0.offset + 9 * ~i~0#1), 4); srcloc: L695 {26079#true} is VALID [2022-02-20 23:38:09,617 INFO L290 TraceCheckUtils]: 12: Hoare triple {26079#true} assume ~state~0 >= #t~mem5#1;havoc #t~mem5#1; {26079#true} is VALID [2022-02-20 23:38:09,617 INFO L290 TraceCheckUtils]: 11: Hoare triple {26079#true} SUMMARY for call #t~mem5#1 := read~int(~#commands~0.base, 8 + (~#commands~0.offset + 9 * ~i~0#1), 1); srcloc: L694 {26079#true} is VALID [2022-02-20 23:38:09,617 INFO L290 TraceCheckUtils]: 10: Hoare triple {26079#true} assume 0 == #t~nondet4#1;havoc #t~mem3#1.base, #t~mem3#1.offset;havoc #t~nondet4#1; {26079#true} is VALID [2022-02-20 23:38:09,617 INFO L290 TraceCheckUtils]: 9: Hoare triple {26079#true} assume ~input#1.offset < #length[~input#1.base] && ~input#1.offset >= 0; {26079#true} is VALID [2022-02-20 23:38:09,617 INFO L290 TraceCheckUtils]: 8: Hoare triple {26079#true} assume 1 == #valid[~input#1.base]; {26079#true} is VALID [2022-02-20 23:38:09,617 INFO L290 TraceCheckUtils]: 7: Hoare triple {26079#true} assume #t~mem3#1.offset < #length[#t~mem3#1.base] && #t~mem3#1.offset >= 0; {26079#true} is VALID [2022-02-20 23:38:09,617 INFO L290 TraceCheckUtils]: 6: Hoare triple {26079#true} assume 1 == #valid[#t~mem3#1.base]; {26079#true} is VALID [2022-02-20 23:38:09,617 INFO L290 TraceCheckUtils]: 5: Hoare triple {26079#true} SUMMARY for call #t~mem3#1.base, #t~mem3#1.offset := read~$Pointer$(~#commands~0.base, ~#commands~0.offset + 9 * ~i~0#1, 4); srcloc: L693 {26079#true} is VALID [2022-02-20 23:38:09,617 INFO L290 TraceCheckUtils]: 4: Hoare triple {26079#true} assume !!(~i~0#1 < 2); {26079#true} is VALID [2022-02-20 23:38:09,617 INFO L290 TraceCheckUtils]: 3: Hoare triple {26079#true} ~input#1.base, ~input#1.offset := #in~input#1.base, #in~input#1.offset;~i~0#1 := 0; {26079#true} is VALID [2022-02-20 23:38:09,618 INFO L272 TraceCheckUtils]: 2: Hoare triple {26079#true} call parse_input(3, 0); {26079#true} is VALID [2022-02-20 23:38:09,618 INFO L290 TraceCheckUtils]: 1: Hoare triple {26079#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1; {26079#true} is VALID [2022-02-20 23:38:09,618 INFO L290 TraceCheckUtils]: 0: Hoare triple {26079#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(3, 1);call write~init~int(99, 1, 0, 1);call write~init~int(49, 1, 1, 1);call write~init~int(0, 1, 2, 1);call #Ultimate.allocInit(3, 2);call write~init~int(99, 2, 0, 1);call write~init~int(50, 2, 1, 1);call write~init~int(0, 2, 2, 1);call #Ultimate.allocInit(3, 3);call write~init~int(99, 3, 0, 1);call write~init~int(49, 3, 1, 1);call write~init~int(0, 3, 2, 1);call #Ultimate.allocInit(3, 4);call write~init~int(99, 4, 0, 1);call write~init~int(49, 4, 1, 1);call write~init~int(0, 4, 2, 1);call #Ultimate.allocInit(3, 5);call write~init~int(99, 5, 0, 1);call write~init~int(50, 5, 1, 1);call write~init~int(0, 5, 2, 1);~state~0 := ~unnamed3~0~STATE_1;~global~0.base, ~global~0.offset := 0, 0;~#commands~0.base, ~#commands~0.offset := 6, 0;call #Ultimate.allocInit(18, 6);call write~init~$Pointer$(1, 0, ~#commands~0.base, ~#commands~0.offset, 4);call write~init~$Pointer$(#funAddr~c1.base, #funAddr~c1.offset, ~#commands~0.base, 4 + ~#commands~0.offset, 4);call write~init~int((if ~unnamed3~0~STATE_1 % 256 <= 127 then ~unnamed3~0~STATE_1 % 256 else ~unnamed3~0~STATE_1 % 256 - 256), ~#commands~0.base, 8 + ~#commands~0.offset, 1);call write~init~$Pointer$(2, 0, ~#commands~0.base, 9 + ~#commands~0.offset, 4);call write~init~$Pointer$(#funAddr~c2.base, #funAddr~c2.offset, ~#commands~0.base, 13 + ~#commands~0.offset, 4);call write~init~int((if ~unnamed3~0~STATE_2 % 256 <= 127 then ~unnamed3~0~STATE_2 % 256 else ~unnamed3~0~STATE_2 % 256 - 256), ~#commands~0.base, 17 + ~#commands~0.offset, 1); {26079#true} is VALID [2022-02-20 23:38:09,618 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:38:09,618 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [203890589] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 23:38:09,618 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 23:38:09,618 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 4 [2022-02-20 23:38:09,618 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385397094] [2022-02-20 23:38:09,618 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 23:38:09,619 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 41 [2022-02-20 23:38:09,619 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:38:09,619 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:38:09,656 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:38:09,656 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 23:38:09,656 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:38:09,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 23:38:09,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:38:09,657 INFO L87 Difference]: Start difference. First operand 431 states and 562 transitions. Second operand has 5 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:38:09,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:38:09,902 INFO L93 Difference]: Finished difference Result 453 states and 579 transitions. [2022-02-20 23:38:09,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 23:38:09,902 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 41 [2022-02-20 23:38:09,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:38:09,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:38:09,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 72 transitions. [2022-02-20 23:38:09,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:38:09,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 72 transitions. [2022-02-20 23:38:09,904 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 72 transitions. [2022-02-20 23:38:09,958 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:38:09,965 INFO L225 Difference]: With dead ends: 453 [2022-02-20 23:38:09,965 INFO L226 Difference]: Without dead ends: 453 [2022-02-20 23:38:09,966 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 83 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-02-20 23:38:09,966 INFO L933 BasicCegarLoop]: 28 mSDtfsCounter, 80 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:38:09,967 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [80 Valid, 50 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:38:09,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453 states. [2022-02-20 23:38:09,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453 to 429. [2022-02-20 23:38:09,972 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:38:09,972 INFO L82 GeneralOperation]: Start isEquivalent. First operand 453 states. Second operand has 429 states, 389 states have (on average 1.3444730077120823) internal successors, (523), 410 states have internal predecessors, (523), 9 states have call successors, (9), 9 states have call predecessors, (9), 17 states have return successors, (23), 9 states have call predecessors, (23), 9 states have call successors, (23) [2022-02-20 23:38:09,972 INFO L74 IsIncluded]: Start isIncluded. First operand 453 states. Second operand has 429 states, 389 states have (on average 1.3444730077120823) internal successors, (523), 410 states have internal predecessors, (523), 9 states have call successors, (9), 9 states have call predecessors, (9), 17 states have return successors, (23), 9 states have call predecessors, (23), 9 states have call successors, (23) [2022-02-20 23:38:09,973 INFO L87 Difference]: Start difference. First operand 453 states. Second operand has 429 states, 389 states have (on average 1.3444730077120823) internal successors, (523), 410 states have internal predecessors, (523), 9 states have call successors, (9), 9 states have call predecessors, (9), 17 states have return successors, (23), 9 states have call predecessors, (23), 9 states have call successors, (23) [2022-02-20 23:38:09,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:38:09,980 INFO L93 Difference]: Finished difference Result 453 states and 579 transitions. [2022-02-20 23:38:09,980 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 579 transitions. [2022-02-20 23:38:09,980 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:38:09,981 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:38:09,981 INFO L74 IsIncluded]: Start isIncluded. First operand has 429 states, 389 states have (on average 1.3444730077120823) internal successors, (523), 410 states have internal predecessors, (523), 9 states have call successors, (9), 9 states have call predecessors, (9), 17 states have return successors, (23), 9 states have call predecessors, (23), 9 states have call successors, (23) Second operand 453 states. [2022-02-20 23:38:09,981 INFO L87 Difference]: Start difference. First operand has 429 states, 389 states have (on average 1.3444730077120823) internal successors, (523), 410 states have internal predecessors, (523), 9 states have call successors, (9), 9 states have call predecessors, (9), 17 states have return successors, (23), 9 states have call predecessors, (23), 9 states have call successors, (23) Second operand 453 states. [2022-02-20 23:38:09,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:38:09,988 INFO L93 Difference]: Finished difference Result 453 states and 579 transitions. [2022-02-20 23:38:09,989 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 579 transitions. [2022-02-20 23:38:09,989 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:38:09,989 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:38:09,989 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:38:09,989 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:38:09,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 429 states, 389 states have (on average 1.3444730077120823) internal successors, (523), 410 states have internal predecessors, (523), 9 states have call successors, (9), 9 states have call predecessors, (9), 17 states have return successors, (23), 9 states have call predecessors, (23), 9 states have call successors, (23) [2022-02-20 23:38:09,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 555 transitions. [2022-02-20 23:38:09,998 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 555 transitions. Word has length 41 [2022-02-20 23:38:09,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:38:09,998 INFO L470 AbstractCegarLoop]: Abstraction has 429 states and 555 transitions. [2022-02-20 23:38:09,998 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:38:09,998 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 555 transitions. [2022-02-20 23:38:09,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-02-20 23:38:09,999 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:38:09,999 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:38:10,019 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-02-20 23:38:10,207 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:38:10,207 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting parse_inputErr18ASSERT_VIOLATIONMEMORY_FREE === [parse_inputErr0REQUIRES_VIOLATION, parse_inputErr1REQUIRES_VIOLATION, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2022-02-20 23:38:10,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:38:10,208 INFO L85 PathProgramCache]: Analyzing trace with hash -1843982442, now seen corresponding path program 1 times [2022-02-20 23:38:10,208 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:38:10,208 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604285956] [2022-02-20 23:38:10,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:38:10,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:38:10,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:38:10,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 23:38:10,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:38:10,281 INFO L290 TraceCheckUtils]: 0: Hoare triple {28162#(and (= ~global~0.base |old(~global~0.base)|) (= |old(#length)| |#length|) (= |old(~global~0.offset)| ~global~0.offset) (= ~state~0 |old(~state~0)|) (= |old(#valid)| |#valid|))} ~input#1.base, ~input#1.offset := #in~input#1.base, #in~input#1.offset;~i~0#1 := 0; {28139#true} is VALID [2022-02-20 23:38:10,281 INFO L290 TraceCheckUtils]: 1: Hoare triple {28139#true} assume !!(~i~0#1 < 2); {28139#true} is VALID [2022-02-20 23:38:10,281 INFO L290 TraceCheckUtils]: 2: Hoare triple {28139#true} SUMMARY for call #t~mem3#1.base, #t~mem3#1.offset := read~$Pointer$(~#commands~0.base, ~#commands~0.offset + 9 * ~i~0#1, 4); srcloc: L693 {28139#true} is VALID [2022-02-20 23:38:10,281 INFO L290 TraceCheckUtils]: 3: Hoare triple {28139#true} assume 1 == #valid[#t~mem3#1.base]; {28139#true} is VALID [2022-02-20 23:38:10,281 INFO L290 TraceCheckUtils]: 4: Hoare triple {28139#true} assume #t~mem3#1.offset < #length[#t~mem3#1.base] && #t~mem3#1.offset >= 0; {28139#true} is VALID [2022-02-20 23:38:10,281 INFO L290 TraceCheckUtils]: 5: Hoare triple {28139#true} assume 1 == #valid[~input#1.base]; {28139#true} is VALID [2022-02-20 23:38:10,282 INFO L290 TraceCheckUtils]: 6: Hoare triple {28139#true} assume ~input#1.offset < #length[~input#1.base] && ~input#1.offset >= 0; {28139#true} is VALID [2022-02-20 23:38:10,282 INFO L290 TraceCheckUtils]: 7: Hoare triple {28139#true} assume 0 == #t~nondet4#1;havoc #t~mem3#1.base, #t~mem3#1.offset;havoc #t~nondet4#1; {28139#true} is VALID [2022-02-20 23:38:10,282 INFO L290 TraceCheckUtils]: 8: Hoare triple {28139#true} SUMMARY for call #t~mem5#1 := read~int(~#commands~0.base, 8 + (~#commands~0.offset + 9 * ~i~0#1), 1); srcloc: L694 {28139#true} is VALID [2022-02-20 23:38:10,283 INFO L290 TraceCheckUtils]: 9: Hoare triple {28139#true} assume ~state~0 >= #t~mem5#1;havoc #t~mem5#1; {28139#true} is VALID [2022-02-20 23:38:10,283 INFO L290 TraceCheckUtils]: 10: Hoare triple {28139#true} SUMMARY for call #t~mem6#1.base, #t~mem6#1.offset := read~$Pointer$(~#commands~0.base, 4 + (~#commands~0.offset + 9 * ~i~0#1), 4); srcloc: L695 {28139#true} is VALID [2022-02-20 23:38:10,283 INFO L290 TraceCheckUtils]: 11: Hoare triple {28139#true} assume { :begin_inline_##fun~~TO~VOID } true;##fun~~TO~VOID_#in~#fp#1.base, ##fun~~TO~VOID_#in~#fp#1.offset := #t~mem6#1.base, #t~mem6#1.offset; {28139#true} is VALID [2022-02-20 23:38:10,284 INFO L290 TraceCheckUtils]: 12: Hoare triple {28139#true} assume !(##fun~~TO~VOID_#in~#fp#1.base == #funAddr~c2.base && ##fun~~TO~VOID_#in~#fp#1.offset == #funAddr~c2.offset);assume { :begin_inline_c1 } true;havoc c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset, c1_~x~0#1.base, c1_~x~0#1.offset;call c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset := #Ultimate.allocOnHeap(1);c1_~x~0#1.base, c1_~x~0#1.offset := c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset;havoc c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset; {28163#(= (select |#valid| |parse_input_c1_~x~0#1.base|) 1)} is VALID [2022-02-20 23:38:10,284 INFO L290 TraceCheckUtils]: 13: Hoare triple {28163#(= (select |#valid| |parse_input_c1_~x~0#1.base|) 1)} assume !(c1_~x~0#1.base == 0 && c1_~x~0#1.offset == 0); {28163#(= (select |#valid| |parse_input_c1_~x~0#1.base|) 1)} is VALID [2022-02-20 23:38:10,284 INFO L290 TraceCheckUtils]: 14: Hoare triple {28163#(= (select |#valid| |parse_input_c1_~x~0#1.base|) 1)} assume !(~global~0.base != 0 || ~global~0.offset != 0); {28163#(= (select |#valid| |parse_input_c1_~x~0#1.base|) 1)} is VALID [2022-02-20 23:38:10,284 INFO L290 TraceCheckUtils]: 15: Hoare triple {28163#(= (select |#valid| |parse_input_c1_~x~0#1.base|) 1)} ~global~0.base, ~global~0.offset := c1_~x~0#1.base, c1_~x~0#1.offset;~state~0 := ~unnamed3~0~STATE_2; {28161#(= (select |#valid| ~global~0.base) 1)} is VALID [2022-02-20 23:38:10,285 INFO L290 TraceCheckUtils]: 16: Hoare triple {28161#(= (select |#valid| ~global~0.base) 1)} assume { :end_inline_c1 } true; {28161#(= (select |#valid| ~global~0.base) 1)} is VALID [2022-02-20 23:38:10,285 INFO L290 TraceCheckUtils]: 17: Hoare triple {28161#(= (select |#valid| ~global~0.base) 1)} assume { :end_inline_##fun~~TO~VOID } true;havoc #t~mem6#1.base, #t~mem6#1.offset; {28161#(= (select |#valid| ~global~0.base) 1)} is VALID [2022-02-20 23:38:10,285 INFO L290 TraceCheckUtils]: 18: Hoare triple {28161#(= (select |#valid| ~global~0.base) 1)} assume true; {28161#(= (select |#valid| ~global~0.base) 1)} is VALID [2022-02-20 23:38:10,286 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {28161#(= (select |#valid| ~global~0.base) 1)} {28139#true} #101#return; {28161#(= (select |#valid| ~global~0.base) 1)} is VALID [2022-02-20 23:38:10,286 INFO L290 TraceCheckUtils]: 0: Hoare triple {28139#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(3, 1);call write~init~int(99, 1, 0, 1);call write~init~int(49, 1, 1, 1);call write~init~int(0, 1, 2, 1);call #Ultimate.allocInit(3, 2);call write~init~int(99, 2, 0, 1);call write~init~int(50, 2, 1, 1);call write~init~int(0, 2, 2, 1);call #Ultimate.allocInit(3, 3);call write~init~int(99, 3, 0, 1);call write~init~int(49, 3, 1, 1);call write~init~int(0, 3, 2, 1);call #Ultimate.allocInit(3, 4);call write~init~int(99, 4, 0, 1);call write~init~int(49, 4, 1, 1);call write~init~int(0, 4, 2, 1);call #Ultimate.allocInit(3, 5);call write~init~int(99, 5, 0, 1);call write~init~int(50, 5, 1, 1);call write~init~int(0, 5, 2, 1);~state~0 := ~unnamed3~0~STATE_1;~global~0.base, ~global~0.offset := 0, 0;~#commands~0.base, ~#commands~0.offset := 6, 0;call #Ultimate.allocInit(18, 6);call write~init~$Pointer$(1, 0, ~#commands~0.base, ~#commands~0.offset, 4);call write~init~$Pointer$(#funAddr~c1.base, #funAddr~c1.offset, ~#commands~0.base, 4 + ~#commands~0.offset, 4);call write~init~int((if ~unnamed3~0~STATE_1 % 256 <= 127 then ~unnamed3~0~STATE_1 % 256 else ~unnamed3~0~STATE_1 % 256 - 256), ~#commands~0.base, 8 + ~#commands~0.offset, 1);call write~init~$Pointer$(2, 0, ~#commands~0.base, 9 + ~#commands~0.offset, 4);call write~init~$Pointer$(#funAddr~c2.base, #funAddr~c2.offset, ~#commands~0.base, 13 + ~#commands~0.offset, 4);call write~init~int((if ~unnamed3~0~STATE_2 % 256 <= 127 then ~unnamed3~0~STATE_2 % 256 else ~unnamed3~0~STATE_2 % 256 - 256), ~#commands~0.base, 17 + ~#commands~0.offset, 1); {28139#true} is VALID [2022-02-20 23:38:10,286 INFO L290 TraceCheckUtils]: 1: Hoare triple {28139#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1; {28139#true} is VALID [2022-02-20 23:38:10,287 INFO L272 TraceCheckUtils]: 2: Hoare triple {28139#true} call parse_input(3, 0); {28162#(and (= ~global~0.base |old(~global~0.base)|) (= |old(#length)| |#length|) (= |old(~global~0.offset)| ~global~0.offset) (= ~state~0 |old(~state~0)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 23:38:10,287 INFO L290 TraceCheckUtils]: 3: Hoare triple {28162#(and (= ~global~0.base |old(~global~0.base)|) (= |old(#length)| |#length|) (= |old(~global~0.offset)| ~global~0.offset) (= ~state~0 |old(~state~0)|) (= |old(#valid)| |#valid|))} ~input#1.base, ~input#1.offset := #in~input#1.base, #in~input#1.offset;~i~0#1 := 0; {28139#true} is VALID [2022-02-20 23:38:10,287 INFO L290 TraceCheckUtils]: 4: Hoare triple {28139#true} assume !!(~i~0#1 < 2); {28139#true} is VALID [2022-02-20 23:38:10,287 INFO L290 TraceCheckUtils]: 5: Hoare triple {28139#true} SUMMARY for call #t~mem3#1.base, #t~mem3#1.offset := read~$Pointer$(~#commands~0.base, ~#commands~0.offset + 9 * ~i~0#1, 4); srcloc: L693 {28139#true} is VALID [2022-02-20 23:38:10,287 INFO L290 TraceCheckUtils]: 6: Hoare triple {28139#true} assume 1 == #valid[#t~mem3#1.base]; {28139#true} is VALID [2022-02-20 23:38:10,287 INFO L290 TraceCheckUtils]: 7: Hoare triple {28139#true} assume #t~mem3#1.offset < #length[#t~mem3#1.base] && #t~mem3#1.offset >= 0; {28139#true} is VALID [2022-02-20 23:38:10,287 INFO L290 TraceCheckUtils]: 8: Hoare triple {28139#true} assume 1 == #valid[~input#1.base]; {28139#true} is VALID [2022-02-20 23:38:10,287 INFO L290 TraceCheckUtils]: 9: Hoare triple {28139#true} assume ~input#1.offset < #length[~input#1.base] && ~input#1.offset >= 0; {28139#true} is VALID [2022-02-20 23:38:10,288 INFO L290 TraceCheckUtils]: 10: Hoare triple {28139#true} assume 0 == #t~nondet4#1;havoc #t~mem3#1.base, #t~mem3#1.offset;havoc #t~nondet4#1; {28139#true} is VALID [2022-02-20 23:38:10,288 INFO L290 TraceCheckUtils]: 11: Hoare triple {28139#true} SUMMARY for call #t~mem5#1 := read~int(~#commands~0.base, 8 + (~#commands~0.offset + 9 * ~i~0#1), 1); srcloc: L694 {28139#true} is VALID [2022-02-20 23:38:10,288 INFO L290 TraceCheckUtils]: 12: Hoare triple {28139#true} assume ~state~0 >= #t~mem5#1;havoc #t~mem5#1; {28139#true} is VALID [2022-02-20 23:38:10,288 INFO L290 TraceCheckUtils]: 13: Hoare triple {28139#true} SUMMARY for call #t~mem6#1.base, #t~mem6#1.offset := read~$Pointer$(~#commands~0.base, 4 + (~#commands~0.offset + 9 * ~i~0#1), 4); srcloc: L695 {28139#true} is VALID [2022-02-20 23:38:10,288 INFO L290 TraceCheckUtils]: 14: Hoare triple {28139#true} assume { :begin_inline_##fun~~TO~VOID } true;##fun~~TO~VOID_#in~#fp#1.base, ##fun~~TO~VOID_#in~#fp#1.offset := #t~mem6#1.base, #t~mem6#1.offset; {28139#true} is VALID [2022-02-20 23:38:10,289 INFO L290 TraceCheckUtils]: 15: Hoare triple {28139#true} assume !(##fun~~TO~VOID_#in~#fp#1.base == #funAddr~c2.base && ##fun~~TO~VOID_#in~#fp#1.offset == #funAddr~c2.offset);assume { :begin_inline_c1 } true;havoc c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset, c1_~x~0#1.base, c1_~x~0#1.offset;call c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset := #Ultimate.allocOnHeap(1);c1_~x~0#1.base, c1_~x~0#1.offset := c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset;havoc c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset; {28163#(= (select |#valid| |parse_input_c1_~x~0#1.base|) 1)} is VALID [2022-02-20 23:38:10,289 INFO L290 TraceCheckUtils]: 16: Hoare triple {28163#(= (select |#valid| |parse_input_c1_~x~0#1.base|) 1)} assume !(c1_~x~0#1.base == 0 && c1_~x~0#1.offset == 0); {28163#(= (select |#valid| |parse_input_c1_~x~0#1.base|) 1)} is VALID [2022-02-20 23:38:10,289 INFO L290 TraceCheckUtils]: 17: Hoare triple {28163#(= (select |#valid| |parse_input_c1_~x~0#1.base|) 1)} assume !(~global~0.base != 0 || ~global~0.offset != 0); {28163#(= (select |#valid| |parse_input_c1_~x~0#1.base|) 1)} is VALID [2022-02-20 23:38:10,289 INFO L290 TraceCheckUtils]: 18: Hoare triple {28163#(= (select |#valid| |parse_input_c1_~x~0#1.base|) 1)} ~global~0.base, ~global~0.offset := c1_~x~0#1.base, c1_~x~0#1.offset;~state~0 := ~unnamed3~0~STATE_2; {28161#(= (select |#valid| ~global~0.base) 1)} is VALID [2022-02-20 23:38:10,290 INFO L290 TraceCheckUtils]: 19: Hoare triple {28161#(= (select |#valid| ~global~0.base) 1)} assume { :end_inline_c1 } true; {28161#(= (select |#valid| ~global~0.base) 1)} is VALID [2022-02-20 23:38:10,290 INFO L290 TraceCheckUtils]: 20: Hoare triple {28161#(= (select |#valid| ~global~0.base) 1)} assume { :end_inline_##fun~~TO~VOID } true;havoc #t~mem6#1.base, #t~mem6#1.offset; {28161#(= (select |#valid| ~global~0.base) 1)} is VALID [2022-02-20 23:38:10,290 INFO L290 TraceCheckUtils]: 21: Hoare triple {28161#(= (select |#valid| ~global~0.base) 1)} assume true; {28161#(= (select |#valid| ~global~0.base) 1)} is VALID [2022-02-20 23:38:10,291 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {28161#(= (select |#valid| ~global~0.base) 1)} {28139#true} #101#return; {28161#(= (select |#valid| ~global~0.base) 1)} is VALID [2022-02-20 23:38:10,291 INFO L272 TraceCheckUtils]: 23: Hoare triple {28161#(= (select |#valid| ~global~0.base) 1)} call parse_input(4, 0); {28161#(= (select |#valid| ~global~0.base) 1)} is VALID [2022-02-20 23:38:10,291 INFO L290 TraceCheckUtils]: 24: Hoare triple {28161#(= (select |#valid| ~global~0.base) 1)} ~input#1.base, ~input#1.offset := #in~input#1.base, #in~input#1.offset;~i~0#1 := 0; {28161#(= (select |#valid| ~global~0.base) 1)} is VALID [2022-02-20 23:38:10,292 INFO L290 TraceCheckUtils]: 25: Hoare triple {28161#(= (select |#valid| ~global~0.base) 1)} assume !!(~i~0#1 < 2); {28161#(= (select |#valid| ~global~0.base) 1)} is VALID [2022-02-20 23:38:10,292 INFO L290 TraceCheckUtils]: 26: Hoare triple {28161#(= (select |#valid| ~global~0.base) 1)} SUMMARY for call #t~mem3#1.base, #t~mem3#1.offset := read~$Pointer$(~#commands~0.base, ~#commands~0.offset + 9 * ~i~0#1, 4); srcloc: L693 {28161#(= (select |#valid| ~global~0.base) 1)} is VALID [2022-02-20 23:38:10,292 INFO L290 TraceCheckUtils]: 27: Hoare triple {28161#(= (select |#valid| ~global~0.base) 1)} assume 1 == #valid[#t~mem3#1.base]; {28161#(= (select |#valid| ~global~0.base) 1)} is VALID [2022-02-20 23:38:10,292 INFO L290 TraceCheckUtils]: 28: Hoare triple {28161#(= (select |#valid| ~global~0.base) 1)} assume #t~mem3#1.offset < #length[#t~mem3#1.base] && #t~mem3#1.offset >= 0; {28161#(= (select |#valid| ~global~0.base) 1)} is VALID [2022-02-20 23:38:10,293 INFO L290 TraceCheckUtils]: 29: Hoare triple {28161#(= (select |#valid| ~global~0.base) 1)} assume 1 == #valid[~input#1.base]; {28161#(= (select |#valid| ~global~0.base) 1)} is VALID [2022-02-20 23:38:10,293 INFO L290 TraceCheckUtils]: 30: Hoare triple {28161#(= (select |#valid| ~global~0.base) 1)} assume ~input#1.offset < #length[~input#1.base] && ~input#1.offset >= 0; {28161#(= (select |#valid| ~global~0.base) 1)} is VALID [2022-02-20 23:38:10,293 INFO L290 TraceCheckUtils]: 31: Hoare triple {28161#(= (select |#valid| ~global~0.base) 1)} assume 0 == #t~nondet4#1;havoc #t~mem3#1.base, #t~mem3#1.offset;havoc #t~nondet4#1; {28161#(= (select |#valid| ~global~0.base) 1)} is VALID [2022-02-20 23:38:10,293 INFO L290 TraceCheckUtils]: 32: Hoare triple {28161#(= (select |#valid| ~global~0.base) 1)} SUMMARY for call #t~mem5#1 := read~int(~#commands~0.base, 8 + (~#commands~0.offset + 9 * ~i~0#1), 1); srcloc: L694 {28161#(= (select |#valid| ~global~0.base) 1)} is VALID [2022-02-20 23:38:10,294 INFO L290 TraceCheckUtils]: 33: Hoare triple {28161#(= (select |#valid| ~global~0.base) 1)} assume ~state~0 >= #t~mem5#1;havoc #t~mem5#1; {28161#(= (select |#valid| ~global~0.base) 1)} is VALID [2022-02-20 23:38:10,294 INFO L290 TraceCheckUtils]: 34: Hoare triple {28161#(= (select |#valid| ~global~0.base) 1)} SUMMARY for call #t~mem6#1.base, #t~mem6#1.offset := read~$Pointer$(~#commands~0.base, 4 + (~#commands~0.offset + 9 * ~i~0#1), 4); srcloc: L695 {28161#(= (select |#valid| ~global~0.base) 1)} is VALID [2022-02-20 23:38:10,294 INFO L290 TraceCheckUtils]: 35: Hoare triple {28161#(= (select |#valid| ~global~0.base) 1)} assume { :begin_inline_##fun~~TO~VOID } true;##fun~~TO~VOID_#in~#fp#1.base, ##fun~~TO~VOID_#in~#fp#1.offset := #t~mem6#1.base, #t~mem6#1.offset; {28161#(= (select |#valid| ~global~0.base) 1)} is VALID [2022-02-20 23:38:10,295 INFO L290 TraceCheckUtils]: 36: Hoare triple {28161#(= (select |#valid| ~global~0.base) 1)} assume !(##fun~~TO~VOID_#in~#fp#1.base == #funAddr~c2.base && ##fun~~TO~VOID_#in~#fp#1.offset == #funAddr~c2.offset);assume { :begin_inline_c1 } true;havoc c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset, c1_~x~0#1.base, c1_~x~0#1.offset;call c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset := #Ultimate.allocOnHeap(1);c1_~x~0#1.base, c1_~x~0#1.offset := c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset;havoc c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset; {28161#(= (select |#valid| ~global~0.base) 1)} is VALID [2022-02-20 23:38:10,295 INFO L290 TraceCheckUtils]: 37: Hoare triple {28161#(= (select |#valid| ~global~0.base) 1)} assume !(c1_~x~0#1.base == 0 && c1_~x~0#1.offset == 0); {28161#(= (select |#valid| ~global~0.base) 1)} is VALID [2022-02-20 23:38:10,295 INFO L290 TraceCheckUtils]: 38: Hoare triple {28161#(= (select |#valid| ~global~0.base) 1)} assume ~global~0.base != 0 || ~global~0.offset != 0; {28161#(= (select |#valid| ~global~0.base) 1)} is VALID [2022-02-20 23:38:10,296 INFO L290 TraceCheckUtils]: 39: Hoare triple {28161#(= (select |#valid| ~global~0.base) 1)} assume 0 == ~global~0.offset; {28161#(= (select |#valid| ~global~0.base) 1)} is VALID [2022-02-20 23:38:10,296 INFO L290 TraceCheckUtils]: 40: Hoare triple {28161#(= (select |#valid| ~global~0.base) 1)} assume ~global~0.base < #StackHeapBarrier; {28161#(= (select |#valid| ~global~0.base) 1)} is VALID [2022-02-20 23:38:10,296 INFO L290 TraceCheckUtils]: 41: Hoare triple {28161#(= (select |#valid| ~global~0.base) 1)} assume !(0 == ~global~0.base || 1 == #valid[~global~0.base]); {28140#false} is VALID [2022-02-20 23:38:10,297 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 12 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:38:10,297 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:38:10,298 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604285956] [2022-02-20 23:38:10,298 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1604285956] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 23:38:10,298 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [669958711] [2022-02-20 23:38:10,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:38:10,298 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:38:10,298 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:38:10,300 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 23:38:10,319 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-02-20 23:38:10,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:38:10,372 INFO L263 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 15 conjunts are in the unsatisfiable core [2022-02-20 23:38:10,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:38:10,381 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:38:10,411 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-02-20 23:38:10,484 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-02-20 23:38:10,484 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-02-20 23:38:10,500 INFO L290 TraceCheckUtils]: 0: Hoare triple {28139#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(3, 1);call write~init~int(99, 1, 0, 1);call write~init~int(49, 1, 1, 1);call write~init~int(0, 1, 2, 1);call #Ultimate.allocInit(3, 2);call write~init~int(99, 2, 0, 1);call write~init~int(50, 2, 1, 1);call write~init~int(0, 2, 2, 1);call #Ultimate.allocInit(3, 3);call write~init~int(99, 3, 0, 1);call write~init~int(49, 3, 1, 1);call write~init~int(0, 3, 2, 1);call #Ultimate.allocInit(3, 4);call write~init~int(99, 4, 0, 1);call write~init~int(49, 4, 1, 1);call write~init~int(0, 4, 2, 1);call #Ultimate.allocInit(3, 5);call write~init~int(99, 5, 0, 1);call write~init~int(50, 5, 1, 1);call write~init~int(0, 5, 2, 1);~state~0 := ~unnamed3~0~STATE_1;~global~0.base, ~global~0.offset := 0, 0;~#commands~0.base, ~#commands~0.offset := 6, 0;call #Ultimate.allocInit(18, 6);call write~init~$Pointer$(1, 0, ~#commands~0.base, ~#commands~0.offset, 4);call write~init~$Pointer$(#funAddr~c1.base, #funAddr~c1.offset, ~#commands~0.base, 4 + ~#commands~0.offset, 4);call write~init~int((if ~unnamed3~0~STATE_1 % 256 <= 127 then ~unnamed3~0~STATE_1 % 256 else ~unnamed3~0~STATE_1 % 256 - 256), ~#commands~0.base, 8 + ~#commands~0.offset, 1);call write~init~$Pointer$(2, 0, ~#commands~0.base, 9 + ~#commands~0.offset, 4);call write~init~$Pointer$(#funAddr~c2.base, #funAddr~c2.offset, ~#commands~0.base, 13 + ~#commands~0.offset, 4);call write~init~int((if ~unnamed3~0~STATE_2 % 256 <= 127 then ~unnamed3~0~STATE_2 % 256 else ~unnamed3~0~STATE_2 % 256 - 256), ~#commands~0.base, 17 + ~#commands~0.offset, 1); {28139#true} is VALID [2022-02-20 23:38:10,501 INFO L290 TraceCheckUtils]: 1: Hoare triple {28139#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1; {28139#true} is VALID [2022-02-20 23:38:10,501 INFO L272 TraceCheckUtils]: 2: Hoare triple {28139#true} call parse_input(3, 0); {28139#true} is VALID [2022-02-20 23:38:10,501 INFO L290 TraceCheckUtils]: 3: Hoare triple {28139#true} ~input#1.base, ~input#1.offset := #in~input#1.base, #in~input#1.offset;~i~0#1 := 0; {28139#true} is VALID [2022-02-20 23:38:10,501 INFO L290 TraceCheckUtils]: 4: Hoare triple {28139#true} assume !!(~i~0#1 < 2); {28139#true} is VALID [2022-02-20 23:38:10,501 INFO L290 TraceCheckUtils]: 5: Hoare triple {28139#true} SUMMARY for call #t~mem3#1.base, #t~mem3#1.offset := read~$Pointer$(~#commands~0.base, ~#commands~0.offset + 9 * ~i~0#1, 4); srcloc: L693 {28139#true} is VALID [2022-02-20 23:38:10,501 INFO L290 TraceCheckUtils]: 6: Hoare triple {28139#true} assume 1 == #valid[#t~mem3#1.base]; {28139#true} is VALID [2022-02-20 23:38:10,501 INFO L290 TraceCheckUtils]: 7: Hoare triple {28139#true} assume #t~mem3#1.offset < #length[#t~mem3#1.base] && #t~mem3#1.offset >= 0; {28139#true} is VALID [2022-02-20 23:38:10,501 INFO L290 TraceCheckUtils]: 8: Hoare triple {28139#true} assume 1 == #valid[~input#1.base]; {28139#true} is VALID [2022-02-20 23:38:10,502 INFO L290 TraceCheckUtils]: 9: Hoare triple {28139#true} assume ~input#1.offset < #length[~input#1.base] && ~input#1.offset >= 0; {28139#true} is VALID [2022-02-20 23:38:10,502 INFO L290 TraceCheckUtils]: 10: Hoare triple {28139#true} assume 0 == #t~nondet4#1;havoc #t~mem3#1.base, #t~mem3#1.offset;havoc #t~nondet4#1; {28139#true} is VALID [2022-02-20 23:38:10,502 INFO L290 TraceCheckUtils]: 11: Hoare triple {28139#true} SUMMARY for call #t~mem5#1 := read~int(~#commands~0.base, 8 + (~#commands~0.offset + 9 * ~i~0#1), 1); srcloc: L694 {28139#true} is VALID [2022-02-20 23:38:10,502 INFO L290 TraceCheckUtils]: 12: Hoare triple {28139#true} assume ~state~0 >= #t~mem5#1;havoc #t~mem5#1; {28139#true} is VALID [2022-02-20 23:38:10,502 INFO L290 TraceCheckUtils]: 13: Hoare triple {28139#true} SUMMARY for call #t~mem6#1.base, #t~mem6#1.offset := read~$Pointer$(~#commands~0.base, 4 + (~#commands~0.offset + 9 * ~i~0#1), 4); srcloc: L695 {28139#true} is VALID [2022-02-20 23:38:10,502 INFO L290 TraceCheckUtils]: 14: Hoare triple {28139#true} assume { :begin_inline_##fun~~TO~VOID } true;##fun~~TO~VOID_#in~#fp#1.base, ##fun~~TO~VOID_#in~#fp#1.offset := #t~mem6#1.base, #t~mem6#1.offset; {28139#true} is VALID [2022-02-20 23:38:10,503 INFO L290 TraceCheckUtils]: 15: Hoare triple {28139#true} assume !(##fun~~TO~VOID_#in~#fp#1.base == #funAddr~c2.base && ##fun~~TO~VOID_#in~#fp#1.offset == #funAddr~c2.offset);assume { :begin_inline_c1 } true;havoc c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset, c1_~x~0#1.base, c1_~x~0#1.offset;call c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset := #Ultimate.allocOnHeap(1);c1_~x~0#1.base, c1_~x~0#1.offset := c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset;havoc c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset; {28163#(= (select |#valid| |parse_input_c1_~x~0#1.base|) 1)} is VALID [2022-02-20 23:38:10,503 INFO L290 TraceCheckUtils]: 16: Hoare triple {28163#(= (select |#valid| |parse_input_c1_~x~0#1.base|) 1)} assume !(c1_~x~0#1.base == 0 && c1_~x~0#1.offset == 0); {28163#(= (select |#valid| |parse_input_c1_~x~0#1.base|) 1)} is VALID [2022-02-20 23:38:10,503 INFO L290 TraceCheckUtils]: 17: Hoare triple {28163#(= (select |#valid| |parse_input_c1_~x~0#1.base|) 1)} assume !(~global~0.base != 0 || ~global~0.offset != 0); {28163#(= (select |#valid| |parse_input_c1_~x~0#1.base|) 1)} is VALID [2022-02-20 23:38:10,504 INFO L290 TraceCheckUtils]: 18: Hoare triple {28163#(= (select |#valid| |parse_input_c1_~x~0#1.base|) 1)} ~global~0.base, ~global~0.offset := c1_~x~0#1.base, c1_~x~0#1.offset;~state~0 := ~unnamed3~0~STATE_2; {28161#(= (select |#valid| ~global~0.base) 1)} is VALID [2022-02-20 23:38:10,504 INFO L290 TraceCheckUtils]: 19: Hoare triple {28161#(= (select |#valid| ~global~0.base) 1)} assume { :end_inline_c1 } true; {28161#(= (select |#valid| ~global~0.base) 1)} is VALID [2022-02-20 23:38:10,504 INFO L290 TraceCheckUtils]: 20: Hoare triple {28161#(= (select |#valid| ~global~0.base) 1)} assume { :end_inline_##fun~~TO~VOID } true;havoc #t~mem6#1.base, #t~mem6#1.offset; {28161#(= (select |#valid| ~global~0.base) 1)} is VALID [2022-02-20 23:38:10,505 INFO L290 TraceCheckUtils]: 21: Hoare triple {28161#(= (select |#valid| ~global~0.base) 1)} assume true; {28161#(= (select |#valid| ~global~0.base) 1)} is VALID [2022-02-20 23:38:10,505 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {28161#(= (select |#valid| ~global~0.base) 1)} {28139#true} #101#return; {28161#(= (select |#valid| ~global~0.base) 1)} is VALID [2022-02-20 23:38:10,505 INFO L272 TraceCheckUtils]: 23: Hoare triple {28161#(= (select |#valid| ~global~0.base) 1)} call parse_input(4, 0); {28161#(= (select |#valid| ~global~0.base) 1)} is VALID [2022-02-20 23:38:10,506 INFO L290 TraceCheckUtils]: 24: Hoare triple {28161#(= (select |#valid| ~global~0.base) 1)} ~input#1.base, ~input#1.offset := #in~input#1.base, #in~input#1.offset;~i~0#1 := 0; {28161#(= (select |#valid| ~global~0.base) 1)} is VALID [2022-02-20 23:38:10,506 INFO L290 TraceCheckUtils]: 25: Hoare triple {28161#(= (select |#valid| ~global~0.base) 1)} assume !!(~i~0#1 < 2); {28161#(= (select |#valid| ~global~0.base) 1)} is VALID [2022-02-20 23:38:10,506 INFO L290 TraceCheckUtils]: 26: Hoare triple {28161#(= (select |#valid| ~global~0.base) 1)} SUMMARY for call #t~mem3#1.base, #t~mem3#1.offset := read~$Pointer$(~#commands~0.base, ~#commands~0.offset + 9 * ~i~0#1, 4); srcloc: L693 {28161#(= (select |#valid| ~global~0.base) 1)} is VALID [2022-02-20 23:38:10,506 INFO L290 TraceCheckUtils]: 27: Hoare triple {28161#(= (select |#valid| ~global~0.base) 1)} assume 1 == #valid[#t~mem3#1.base]; {28161#(= (select |#valid| ~global~0.base) 1)} is VALID [2022-02-20 23:38:10,507 INFO L290 TraceCheckUtils]: 28: Hoare triple {28161#(= (select |#valid| ~global~0.base) 1)} assume #t~mem3#1.offset < #length[#t~mem3#1.base] && #t~mem3#1.offset >= 0; {28161#(= (select |#valid| ~global~0.base) 1)} is VALID [2022-02-20 23:38:10,507 INFO L290 TraceCheckUtils]: 29: Hoare triple {28161#(= (select |#valid| ~global~0.base) 1)} assume 1 == #valid[~input#1.base]; {28161#(= (select |#valid| ~global~0.base) 1)} is VALID [2022-02-20 23:38:10,507 INFO L290 TraceCheckUtils]: 30: Hoare triple {28161#(= (select |#valid| ~global~0.base) 1)} assume ~input#1.offset < #length[~input#1.base] && ~input#1.offset >= 0; {28161#(= (select |#valid| ~global~0.base) 1)} is VALID [2022-02-20 23:38:10,508 INFO L290 TraceCheckUtils]: 31: Hoare triple {28161#(= (select |#valid| ~global~0.base) 1)} assume 0 == #t~nondet4#1;havoc #t~mem3#1.base, #t~mem3#1.offset;havoc #t~nondet4#1; {28161#(= (select |#valid| ~global~0.base) 1)} is VALID [2022-02-20 23:38:10,508 INFO L290 TraceCheckUtils]: 32: Hoare triple {28161#(= (select |#valid| ~global~0.base) 1)} SUMMARY for call #t~mem5#1 := read~int(~#commands~0.base, 8 + (~#commands~0.offset + 9 * ~i~0#1), 1); srcloc: L694 {28161#(= (select |#valid| ~global~0.base) 1)} is VALID [2022-02-20 23:38:10,508 INFO L290 TraceCheckUtils]: 33: Hoare triple {28161#(= (select |#valid| ~global~0.base) 1)} assume ~state~0 >= #t~mem5#1;havoc #t~mem5#1; {28161#(= (select |#valid| ~global~0.base) 1)} is VALID [2022-02-20 23:38:10,508 INFO L290 TraceCheckUtils]: 34: Hoare triple {28161#(= (select |#valid| ~global~0.base) 1)} SUMMARY for call #t~mem6#1.base, #t~mem6#1.offset := read~$Pointer$(~#commands~0.base, 4 + (~#commands~0.offset + 9 * ~i~0#1), 4); srcloc: L695 {28161#(= (select |#valid| ~global~0.base) 1)} is VALID [2022-02-20 23:38:10,509 INFO L290 TraceCheckUtils]: 35: Hoare triple {28161#(= (select |#valid| ~global~0.base) 1)} assume { :begin_inline_##fun~~TO~VOID } true;##fun~~TO~VOID_#in~#fp#1.base, ##fun~~TO~VOID_#in~#fp#1.offset := #t~mem6#1.base, #t~mem6#1.offset; {28161#(= (select |#valid| ~global~0.base) 1)} is VALID [2022-02-20 23:38:10,509 INFO L290 TraceCheckUtils]: 36: Hoare triple {28161#(= (select |#valid| ~global~0.base) 1)} assume !(##fun~~TO~VOID_#in~#fp#1.base == #funAddr~c2.base && ##fun~~TO~VOID_#in~#fp#1.offset == #funAddr~c2.offset);assume { :begin_inline_c1 } true;havoc c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset, c1_~x~0#1.base, c1_~x~0#1.offset;call c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset := #Ultimate.allocOnHeap(1);c1_~x~0#1.base, c1_~x~0#1.offset := c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset;havoc c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset; {28161#(= (select |#valid| ~global~0.base) 1)} is VALID [2022-02-20 23:38:10,510 INFO L290 TraceCheckUtils]: 37: Hoare triple {28161#(= (select |#valid| ~global~0.base) 1)} assume !(c1_~x~0#1.base == 0 && c1_~x~0#1.offset == 0); {28161#(= (select |#valid| ~global~0.base) 1)} is VALID [2022-02-20 23:38:10,510 INFO L290 TraceCheckUtils]: 38: Hoare triple {28161#(= (select |#valid| ~global~0.base) 1)} assume ~global~0.base != 0 || ~global~0.offset != 0; {28161#(= (select |#valid| ~global~0.base) 1)} is VALID [2022-02-20 23:38:10,510 INFO L290 TraceCheckUtils]: 39: Hoare triple {28161#(= (select |#valid| ~global~0.base) 1)} assume 0 == ~global~0.offset; {28161#(= (select |#valid| ~global~0.base) 1)} is VALID [2022-02-20 23:38:10,510 INFO L290 TraceCheckUtils]: 40: Hoare triple {28161#(= (select |#valid| ~global~0.base) 1)} assume ~global~0.base < #StackHeapBarrier; {28161#(= (select |#valid| ~global~0.base) 1)} is VALID [2022-02-20 23:38:10,511 INFO L290 TraceCheckUtils]: 41: Hoare triple {28161#(= (select |#valid| ~global~0.base) 1)} assume !(0 == ~global~0.base || 1 == #valid[~global~0.base]); {28140#false} is VALID [2022-02-20 23:38:10,511 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:38:10,511 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:38:11,344 INFO L290 TraceCheckUtils]: 41: Hoare triple {28161#(= (select |#valid| ~global~0.base) 1)} assume !(0 == ~global~0.base || 1 == #valid[~global~0.base]); {28140#false} is VALID [2022-02-20 23:38:11,344 INFO L290 TraceCheckUtils]: 40: Hoare triple {28161#(= (select |#valid| ~global~0.base) 1)} assume ~global~0.base < #StackHeapBarrier; {28161#(= (select |#valid| ~global~0.base) 1)} is VALID [2022-02-20 23:38:11,345 INFO L290 TraceCheckUtils]: 39: Hoare triple {28161#(= (select |#valid| ~global~0.base) 1)} assume 0 == ~global~0.offset; {28161#(= (select |#valid| ~global~0.base) 1)} is VALID [2022-02-20 23:38:11,345 INFO L290 TraceCheckUtils]: 38: Hoare triple {28161#(= (select |#valid| ~global~0.base) 1)} assume ~global~0.base != 0 || ~global~0.offset != 0; {28161#(= (select |#valid| ~global~0.base) 1)} is VALID [2022-02-20 23:38:11,345 INFO L290 TraceCheckUtils]: 37: Hoare triple {28161#(= (select |#valid| ~global~0.base) 1)} assume !(c1_~x~0#1.base == 0 && c1_~x~0#1.offset == 0); {28161#(= (select |#valid| ~global~0.base) 1)} is VALID [2022-02-20 23:38:11,346 INFO L290 TraceCheckUtils]: 36: Hoare triple {28305#(forall ((|v_parse_input_c1_~x~0#1.base_25| Int) (v_ArrVal_66 Int)) (or (not (= (select |#valid| |v_parse_input_c1_~x~0#1.base_25|) 0)) (= (select (store |#valid| |v_parse_input_c1_~x~0#1.base_25| v_ArrVal_66) ~global~0.base) 1)))} assume !(##fun~~TO~VOID_#in~#fp#1.base == #funAddr~c2.base && ##fun~~TO~VOID_#in~#fp#1.offset == #funAddr~c2.offset);assume { :begin_inline_c1 } true;havoc c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset, c1_~x~0#1.base, c1_~x~0#1.offset;call c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset := #Ultimate.allocOnHeap(1);c1_~x~0#1.base, c1_~x~0#1.offset := c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset;havoc c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset; {28161#(= (select |#valid| ~global~0.base) 1)} is VALID [2022-02-20 23:38:11,347 INFO L290 TraceCheckUtils]: 35: Hoare triple {28305#(forall ((|v_parse_input_c1_~x~0#1.base_25| Int) (v_ArrVal_66 Int)) (or (not (= (select |#valid| |v_parse_input_c1_~x~0#1.base_25|) 0)) (= (select (store |#valid| |v_parse_input_c1_~x~0#1.base_25| v_ArrVal_66) ~global~0.base) 1)))} assume { :begin_inline_##fun~~TO~VOID } true;##fun~~TO~VOID_#in~#fp#1.base, ##fun~~TO~VOID_#in~#fp#1.offset := #t~mem6#1.base, #t~mem6#1.offset; {28305#(forall ((|v_parse_input_c1_~x~0#1.base_25| Int) (v_ArrVal_66 Int)) (or (not (= (select |#valid| |v_parse_input_c1_~x~0#1.base_25|) 0)) (= (select (store |#valid| |v_parse_input_c1_~x~0#1.base_25| v_ArrVal_66) ~global~0.base) 1)))} is VALID [2022-02-20 23:38:11,347 INFO L290 TraceCheckUtils]: 34: Hoare triple {28305#(forall ((|v_parse_input_c1_~x~0#1.base_25| Int) (v_ArrVal_66 Int)) (or (not (= (select |#valid| |v_parse_input_c1_~x~0#1.base_25|) 0)) (= (select (store |#valid| |v_parse_input_c1_~x~0#1.base_25| v_ArrVal_66) ~global~0.base) 1)))} SUMMARY for call #t~mem6#1.base, #t~mem6#1.offset := read~$Pointer$(~#commands~0.base, 4 + (~#commands~0.offset + 9 * ~i~0#1), 4); srcloc: L695 {28305#(forall ((|v_parse_input_c1_~x~0#1.base_25| Int) (v_ArrVal_66 Int)) (or (not (= (select |#valid| |v_parse_input_c1_~x~0#1.base_25|) 0)) (= (select (store |#valid| |v_parse_input_c1_~x~0#1.base_25| v_ArrVal_66) ~global~0.base) 1)))} is VALID [2022-02-20 23:38:11,347 INFO L290 TraceCheckUtils]: 33: Hoare triple {28305#(forall ((|v_parse_input_c1_~x~0#1.base_25| Int) (v_ArrVal_66 Int)) (or (not (= (select |#valid| |v_parse_input_c1_~x~0#1.base_25|) 0)) (= (select (store |#valid| |v_parse_input_c1_~x~0#1.base_25| v_ArrVal_66) ~global~0.base) 1)))} assume ~state~0 >= #t~mem5#1;havoc #t~mem5#1; {28305#(forall ((|v_parse_input_c1_~x~0#1.base_25| Int) (v_ArrVal_66 Int)) (or (not (= (select |#valid| |v_parse_input_c1_~x~0#1.base_25|) 0)) (= (select (store |#valid| |v_parse_input_c1_~x~0#1.base_25| v_ArrVal_66) ~global~0.base) 1)))} is VALID [2022-02-20 23:38:11,348 INFO L290 TraceCheckUtils]: 32: Hoare triple {28305#(forall ((|v_parse_input_c1_~x~0#1.base_25| Int) (v_ArrVal_66 Int)) (or (not (= (select |#valid| |v_parse_input_c1_~x~0#1.base_25|) 0)) (= (select (store |#valid| |v_parse_input_c1_~x~0#1.base_25| v_ArrVal_66) ~global~0.base) 1)))} SUMMARY for call #t~mem5#1 := read~int(~#commands~0.base, 8 + (~#commands~0.offset + 9 * ~i~0#1), 1); srcloc: L694 {28305#(forall ((|v_parse_input_c1_~x~0#1.base_25| Int) (v_ArrVal_66 Int)) (or (not (= (select |#valid| |v_parse_input_c1_~x~0#1.base_25|) 0)) (= (select (store |#valid| |v_parse_input_c1_~x~0#1.base_25| v_ArrVal_66) ~global~0.base) 1)))} is VALID [2022-02-20 23:38:11,348 INFO L290 TraceCheckUtils]: 31: Hoare triple {28305#(forall ((|v_parse_input_c1_~x~0#1.base_25| Int) (v_ArrVal_66 Int)) (or (not (= (select |#valid| |v_parse_input_c1_~x~0#1.base_25|) 0)) (= (select (store |#valid| |v_parse_input_c1_~x~0#1.base_25| v_ArrVal_66) ~global~0.base) 1)))} assume 0 == #t~nondet4#1;havoc #t~mem3#1.base, #t~mem3#1.offset;havoc #t~nondet4#1; {28305#(forall ((|v_parse_input_c1_~x~0#1.base_25| Int) (v_ArrVal_66 Int)) (or (not (= (select |#valid| |v_parse_input_c1_~x~0#1.base_25|) 0)) (= (select (store |#valid| |v_parse_input_c1_~x~0#1.base_25| v_ArrVal_66) ~global~0.base) 1)))} is VALID [2022-02-20 23:38:11,348 INFO L290 TraceCheckUtils]: 30: Hoare triple {28305#(forall ((|v_parse_input_c1_~x~0#1.base_25| Int) (v_ArrVal_66 Int)) (or (not (= (select |#valid| |v_parse_input_c1_~x~0#1.base_25|) 0)) (= (select (store |#valid| |v_parse_input_c1_~x~0#1.base_25| v_ArrVal_66) ~global~0.base) 1)))} assume ~input#1.offset < #length[~input#1.base] && ~input#1.offset >= 0; {28305#(forall ((|v_parse_input_c1_~x~0#1.base_25| Int) (v_ArrVal_66 Int)) (or (not (= (select |#valid| |v_parse_input_c1_~x~0#1.base_25|) 0)) (= (select (store |#valid| |v_parse_input_c1_~x~0#1.base_25| v_ArrVal_66) ~global~0.base) 1)))} is VALID [2022-02-20 23:38:11,349 INFO L290 TraceCheckUtils]: 29: Hoare triple {28305#(forall ((|v_parse_input_c1_~x~0#1.base_25| Int) (v_ArrVal_66 Int)) (or (not (= (select |#valid| |v_parse_input_c1_~x~0#1.base_25|) 0)) (= (select (store |#valid| |v_parse_input_c1_~x~0#1.base_25| v_ArrVal_66) ~global~0.base) 1)))} assume 1 == #valid[~input#1.base]; {28305#(forall ((|v_parse_input_c1_~x~0#1.base_25| Int) (v_ArrVal_66 Int)) (or (not (= (select |#valid| |v_parse_input_c1_~x~0#1.base_25|) 0)) (= (select (store |#valid| |v_parse_input_c1_~x~0#1.base_25| v_ArrVal_66) ~global~0.base) 1)))} is VALID [2022-02-20 23:38:11,349 INFO L290 TraceCheckUtils]: 28: Hoare triple {28305#(forall ((|v_parse_input_c1_~x~0#1.base_25| Int) (v_ArrVal_66 Int)) (or (not (= (select |#valid| |v_parse_input_c1_~x~0#1.base_25|) 0)) (= (select (store |#valid| |v_parse_input_c1_~x~0#1.base_25| v_ArrVal_66) ~global~0.base) 1)))} assume #t~mem3#1.offset < #length[#t~mem3#1.base] && #t~mem3#1.offset >= 0; {28305#(forall ((|v_parse_input_c1_~x~0#1.base_25| Int) (v_ArrVal_66 Int)) (or (not (= (select |#valid| |v_parse_input_c1_~x~0#1.base_25|) 0)) (= (select (store |#valid| |v_parse_input_c1_~x~0#1.base_25| v_ArrVal_66) ~global~0.base) 1)))} is VALID [2022-02-20 23:38:11,349 INFO L290 TraceCheckUtils]: 27: Hoare triple {28305#(forall ((|v_parse_input_c1_~x~0#1.base_25| Int) (v_ArrVal_66 Int)) (or (not (= (select |#valid| |v_parse_input_c1_~x~0#1.base_25|) 0)) (= (select (store |#valid| |v_parse_input_c1_~x~0#1.base_25| v_ArrVal_66) ~global~0.base) 1)))} assume 1 == #valid[#t~mem3#1.base]; {28305#(forall ((|v_parse_input_c1_~x~0#1.base_25| Int) (v_ArrVal_66 Int)) (or (not (= (select |#valid| |v_parse_input_c1_~x~0#1.base_25|) 0)) (= (select (store |#valid| |v_parse_input_c1_~x~0#1.base_25| v_ArrVal_66) ~global~0.base) 1)))} is VALID [2022-02-20 23:38:11,350 INFO L290 TraceCheckUtils]: 26: Hoare triple {28305#(forall ((|v_parse_input_c1_~x~0#1.base_25| Int) (v_ArrVal_66 Int)) (or (not (= (select |#valid| |v_parse_input_c1_~x~0#1.base_25|) 0)) (= (select (store |#valid| |v_parse_input_c1_~x~0#1.base_25| v_ArrVal_66) ~global~0.base) 1)))} SUMMARY for call #t~mem3#1.base, #t~mem3#1.offset := read~$Pointer$(~#commands~0.base, ~#commands~0.offset + 9 * ~i~0#1, 4); srcloc: L693 {28305#(forall ((|v_parse_input_c1_~x~0#1.base_25| Int) (v_ArrVal_66 Int)) (or (not (= (select |#valid| |v_parse_input_c1_~x~0#1.base_25|) 0)) (= (select (store |#valid| |v_parse_input_c1_~x~0#1.base_25| v_ArrVal_66) ~global~0.base) 1)))} is VALID [2022-02-20 23:38:11,350 INFO L290 TraceCheckUtils]: 25: Hoare triple {28305#(forall ((|v_parse_input_c1_~x~0#1.base_25| Int) (v_ArrVal_66 Int)) (or (not (= (select |#valid| |v_parse_input_c1_~x~0#1.base_25|) 0)) (= (select (store |#valid| |v_parse_input_c1_~x~0#1.base_25| v_ArrVal_66) ~global~0.base) 1)))} assume !!(~i~0#1 < 2); {28305#(forall ((|v_parse_input_c1_~x~0#1.base_25| Int) (v_ArrVal_66 Int)) (or (not (= (select |#valid| |v_parse_input_c1_~x~0#1.base_25|) 0)) (= (select (store |#valid| |v_parse_input_c1_~x~0#1.base_25| v_ArrVal_66) ~global~0.base) 1)))} is VALID [2022-02-20 23:38:11,350 INFO L290 TraceCheckUtils]: 24: Hoare triple {28305#(forall ((|v_parse_input_c1_~x~0#1.base_25| Int) (v_ArrVal_66 Int)) (or (not (= (select |#valid| |v_parse_input_c1_~x~0#1.base_25|) 0)) (= (select (store |#valid| |v_parse_input_c1_~x~0#1.base_25| v_ArrVal_66) ~global~0.base) 1)))} ~input#1.base, ~input#1.offset := #in~input#1.base, #in~input#1.offset;~i~0#1 := 0; {28305#(forall ((|v_parse_input_c1_~x~0#1.base_25| Int) (v_ArrVal_66 Int)) (or (not (= (select |#valid| |v_parse_input_c1_~x~0#1.base_25|) 0)) (= (select (store |#valid| |v_parse_input_c1_~x~0#1.base_25| v_ArrVal_66) ~global~0.base) 1)))} is VALID [2022-02-20 23:38:11,351 INFO L272 TraceCheckUtils]: 23: Hoare triple {28305#(forall ((|v_parse_input_c1_~x~0#1.base_25| Int) (v_ArrVal_66 Int)) (or (not (= (select |#valid| |v_parse_input_c1_~x~0#1.base_25|) 0)) (= (select (store |#valid| |v_parse_input_c1_~x~0#1.base_25| v_ArrVal_66) ~global~0.base) 1)))} call parse_input(4, 0); {28305#(forall ((|v_parse_input_c1_~x~0#1.base_25| Int) (v_ArrVal_66 Int)) (or (not (= (select |#valid| |v_parse_input_c1_~x~0#1.base_25|) 0)) (= (select (store |#valid| |v_parse_input_c1_~x~0#1.base_25| v_ArrVal_66) ~global~0.base) 1)))} is VALID [2022-02-20 23:38:11,351 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {28305#(forall ((|v_parse_input_c1_~x~0#1.base_25| Int) (v_ArrVal_66 Int)) (or (not (= (select |#valid| |v_parse_input_c1_~x~0#1.base_25|) 0)) (= (select (store |#valid| |v_parse_input_c1_~x~0#1.base_25| v_ArrVal_66) ~global~0.base) 1)))} {28139#true} #101#return; {28305#(forall ((|v_parse_input_c1_~x~0#1.base_25| Int) (v_ArrVal_66 Int)) (or (not (= (select |#valid| |v_parse_input_c1_~x~0#1.base_25|) 0)) (= (select (store |#valid| |v_parse_input_c1_~x~0#1.base_25| v_ArrVal_66) ~global~0.base) 1)))} is VALID [2022-02-20 23:38:11,352 INFO L290 TraceCheckUtils]: 21: Hoare triple {28305#(forall ((|v_parse_input_c1_~x~0#1.base_25| Int) (v_ArrVal_66 Int)) (or (not (= (select |#valid| |v_parse_input_c1_~x~0#1.base_25|) 0)) (= (select (store |#valid| |v_parse_input_c1_~x~0#1.base_25| v_ArrVal_66) ~global~0.base) 1)))} assume true; {28305#(forall ((|v_parse_input_c1_~x~0#1.base_25| Int) (v_ArrVal_66 Int)) (or (not (= (select |#valid| |v_parse_input_c1_~x~0#1.base_25|) 0)) (= (select (store |#valid| |v_parse_input_c1_~x~0#1.base_25| v_ArrVal_66) ~global~0.base) 1)))} is VALID [2022-02-20 23:38:11,352 INFO L290 TraceCheckUtils]: 20: Hoare triple {28305#(forall ((|v_parse_input_c1_~x~0#1.base_25| Int) (v_ArrVal_66 Int)) (or (not (= (select |#valid| |v_parse_input_c1_~x~0#1.base_25|) 0)) (= (select (store |#valid| |v_parse_input_c1_~x~0#1.base_25| v_ArrVal_66) ~global~0.base) 1)))} assume { :end_inline_##fun~~TO~VOID } true;havoc #t~mem6#1.base, #t~mem6#1.offset; {28305#(forall ((|v_parse_input_c1_~x~0#1.base_25| Int) (v_ArrVal_66 Int)) (or (not (= (select |#valid| |v_parse_input_c1_~x~0#1.base_25|) 0)) (= (select (store |#valid| |v_parse_input_c1_~x~0#1.base_25| v_ArrVal_66) ~global~0.base) 1)))} is VALID [2022-02-20 23:38:11,352 INFO L290 TraceCheckUtils]: 19: Hoare triple {28305#(forall ((|v_parse_input_c1_~x~0#1.base_25| Int) (v_ArrVal_66 Int)) (or (not (= (select |#valid| |v_parse_input_c1_~x~0#1.base_25|) 0)) (= (select (store |#valid| |v_parse_input_c1_~x~0#1.base_25| v_ArrVal_66) ~global~0.base) 1)))} assume { :end_inline_c1 } true; {28305#(forall ((|v_parse_input_c1_~x~0#1.base_25| Int) (v_ArrVal_66 Int)) (or (not (= (select |#valid| |v_parse_input_c1_~x~0#1.base_25|) 0)) (= (select (store |#valid| |v_parse_input_c1_~x~0#1.base_25| v_ArrVal_66) ~global~0.base) 1)))} is VALID [2022-02-20 23:38:11,353 INFO L290 TraceCheckUtils]: 18: Hoare triple {28363#(forall ((|v_parse_input_c1_~x~0#1.base_25| Int) (v_ArrVal_66 Int)) (or (not (= (select |#valid| |v_parse_input_c1_~x~0#1.base_25|) 0)) (= (select (store |#valid| |v_parse_input_c1_~x~0#1.base_25| v_ArrVal_66) |parse_input_c1_~x~0#1.base|) 1)))} ~global~0.base, ~global~0.offset := c1_~x~0#1.base, c1_~x~0#1.offset;~state~0 := ~unnamed3~0~STATE_2; {28305#(forall ((|v_parse_input_c1_~x~0#1.base_25| Int) (v_ArrVal_66 Int)) (or (not (= (select |#valid| |v_parse_input_c1_~x~0#1.base_25|) 0)) (= (select (store |#valid| |v_parse_input_c1_~x~0#1.base_25| v_ArrVal_66) ~global~0.base) 1)))} is VALID [2022-02-20 23:38:11,353 INFO L290 TraceCheckUtils]: 17: Hoare triple {28363#(forall ((|v_parse_input_c1_~x~0#1.base_25| Int) (v_ArrVal_66 Int)) (or (not (= (select |#valid| |v_parse_input_c1_~x~0#1.base_25|) 0)) (= (select (store |#valid| |v_parse_input_c1_~x~0#1.base_25| v_ArrVal_66) |parse_input_c1_~x~0#1.base|) 1)))} assume !(~global~0.base != 0 || ~global~0.offset != 0); {28363#(forall ((|v_parse_input_c1_~x~0#1.base_25| Int) (v_ArrVal_66 Int)) (or (not (= (select |#valid| |v_parse_input_c1_~x~0#1.base_25|) 0)) (= (select (store |#valid| |v_parse_input_c1_~x~0#1.base_25| v_ArrVal_66) |parse_input_c1_~x~0#1.base|) 1)))} is VALID [2022-02-20 23:38:11,353 INFO L290 TraceCheckUtils]: 16: Hoare triple {28363#(forall ((|v_parse_input_c1_~x~0#1.base_25| Int) (v_ArrVal_66 Int)) (or (not (= (select |#valid| |v_parse_input_c1_~x~0#1.base_25|) 0)) (= (select (store |#valid| |v_parse_input_c1_~x~0#1.base_25| v_ArrVal_66) |parse_input_c1_~x~0#1.base|) 1)))} assume !(c1_~x~0#1.base == 0 && c1_~x~0#1.offset == 0); {28363#(forall ((|v_parse_input_c1_~x~0#1.base_25| Int) (v_ArrVal_66 Int)) (or (not (= (select |#valid| |v_parse_input_c1_~x~0#1.base_25|) 0)) (= (select (store |#valid| |v_parse_input_c1_~x~0#1.base_25| v_ArrVal_66) |parse_input_c1_~x~0#1.base|) 1)))} is VALID [2022-02-20 23:38:11,354 INFO L290 TraceCheckUtils]: 15: Hoare triple {28139#true} assume !(##fun~~TO~VOID_#in~#fp#1.base == #funAddr~c2.base && ##fun~~TO~VOID_#in~#fp#1.offset == #funAddr~c2.offset);assume { :begin_inline_c1 } true;havoc c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset, c1_~x~0#1.base, c1_~x~0#1.offset;call c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset := #Ultimate.allocOnHeap(1);c1_~x~0#1.base, c1_~x~0#1.offset := c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset;havoc c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset; {28363#(forall ((|v_parse_input_c1_~x~0#1.base_25| Int) (v_ArrVal_66 Int)) (or (not (= (select |#valid| |v_parse_input_c1_~x~0#1.base_25|) 0)) (= (select (store |#valid| |v_parse_input_c1_~x~0#1.base_25| v_ArrVal_66) |parse_input_c1_~x~0#1.base|) 1)))} is VALID [2022-02-20 23:38:11,354 INFO L290 TraceCheckUtils]: 14: Hoare triple {28139#true} assume { :begin_inline_##fun~~TO~VOID } true;##fun~~TO~VOID_#in~#fp#1.base, ##fun~~TO~VOID_#in~#fp#1.offset := #t~mem6#1.base, #t~mem6#1.offset; {28139#true} is VALID [2022-02-20 23:38:11,354 INFO L290 TraceCheckUtils]: 13: Hoare triple {28139#true} SUMMARY for call #t~mem6#1.base, #t~mem6#1.offset := read~$Pointer$(~#commands~0.base, 4 + (~#commands~0.offset + 9 * ~i~0#1), 4); srcloc: L695 {28139#true} is VALID [2022-02-20 23:38:11,354 INFO L290 TraceCheckUtils]: 12: Hoare triple {28139#true} assume ~state~0 >= #t~mem5#1;havoc #t~mem5#1; {28139#true} is VALID [2022-02-20 23:38:11,354 INFO L290 TraceCheckUtils]: 11: Hoare triple {28139#true} SUMMARY for call #t~mem5#1 := read~int(~#commands~0.base, 8 + (~#commands~0.offset + 9 * ~i~0#1), 1); srcloc: L694 {28139#true} is VALID [2022-02-20 23:38:11,354 INFO L290 TraceCheckUtils]: 10: Hoare triple {28139#true} assume 0 == #t~nondet4#1;havoc #t~mem3#1.base, #t~mem3#1.offset;havoc #t~nondet4#1; {28139#true} is VALID [2022-02-20 23:38:11,355 INFO L290 TraceCheckUtils]: 9: Hoare triple {28139#true} assume ~input#1.offset < #length[~input#1.base] && ~input#1.offset >= 0; {28139#true} is VALID [2022-02-20 23:38:11,355 INFO L290 TraceCheckUtils]: 8: Hoare triple {28139#true} assume 1 == #valid[~input#1.base]; {28139#true} is VALID [2022-02-20 23:38:11,355 INFO L290 TraceCheckUtils]: 7: Hoare triple {28139#true} assume #t~mem3#1.offset < #length[#t~mem3#1.base] && #t~mem3#1.offset >= 0; {28139#true} is VALID [2022-02-20 23:38:11,355 INFO L290 TraceCheckUtils]: 6: Hoare triple {28139#true} assume 1 == #valid[#t~mem3#1.base]; {28139#true} is VALID [2022-02-20 23:38:11,355 INFO L290 TraceCheckUtils]: 5: Hoare triple {28139#true} SUMMARY for call #t~mem3#1.base, #t~mem3#1.offset := read~$Pointer$(~#commands~0.base, ~#commands~0.offset + 9 * ~i~0#1, 4); srcloc: L693 {28139#true} is VALID [2022-02-20 23:38:11,355 INFO L290 TraceCheckUtils]: 4: Hoare triple {28139#true} assume !!(~i~0#1 < 2); {28139#true} is VALID [2022-02-20 23:38:11,355 INFO L290 TraceCheckUtils]: 3: Hoare triple {28139#true} ~input#1.base, ~input#1.offset := #in~input#1.base, #in~input#1.offset;~i~0#1 := 0; {28139#true} is VALID [2022-02-20 23:38:11,355 INFO L272 TraceCheckUtils]: 2: Hoare triple {28139#true} call parse_input(3, 0); {28139#true} is VALID [2022-02-20 23:38:11,355 INFO L290 TraceCheckUtils]: 1: Hoare triple {28139#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1; {28139#true} is VALID [2022-02-20 23:38:11,355 INFO L290 TraceCheckUtils]: 0: Hoare triple {28139#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(3, 1);call write~init~int(99, 1, 0, 1);call write~init~int(49, 1, 1, 1);call write~init~int(0, 1, 2, 1);call #Ultimate.allocInit(3, 2);call write~init~int(99, 2, 0, 1);call write~init~int(50, 2, 1, 1);call write~init~int(0, 2, 2, 1);call #Ultimate.allocInit(3, 3);call write~init~int(99, 3, 0, 1);call write~init~int(49, 3, 1, 1);call write~init~int(0, 3, 2, 1);call #Ultimate.allocInit(3, 4);call write~init~int(99, 4, 0, 1);call write~init~int(49, 4, 1, 1);call write~init~int(0, 4, 2, 1);call #Ultimate.allocInit(3, 5);call write~init~int(99, 5, 0, 1);call write~init~int(50, 5, 1, 1);call write~init~int(0, 5, 2, 1);~state~0 := ~unnamed3~0~STATE_1;~global~0.base, ~global~0.offset := 0, 0;~#commands~0.base, ~#commands~0.offset := 6, 0;call #Ultimate.allocInit(18, 6);call write~init~$Pointer$(1, 0, ~#commands~0.base, ~#commands~0.offset, 4);call write~init~$Pointer$(#funAddr~c1.base, #funAddr~c1.offset, ~#commands~0.base, 4 + ~#commands~0.offset, 4);call write~init~int((if ~unnamed3~0~STATE_1 % 256 <= 127 then ~unnamed3~0~STATE_1 % 256 else ~unnamed3~0~STATE_1 % 256 - 256), ~#commands~0.base, 8 + ~#commands~0.offset, 1);call write~init~$Pointer$(2, 0, ~#commands~0.base, 9 + ~#commands~0.offset, 4);call write~init~$Pointer$(#funAddr~c2.base, #funAddr~c2.offset, ~#commands~0.base, 13 + ~#commands~0.offset, 4);call write~init~int((if ~unnamed3~0~STATE_2 % 256 <= 127 then ~unnamed3~0~STATE_2 % 256 else ~unnamed3~0~STATE_2 % 256 - 256), ~#commands~0.base, 17 + ~#commands~0.offset, 1); {28139#true} is VALID [2022-02-20 23:38:11,355 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:38:11,355 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [669958711] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 23:38:11,356 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 23:38:11,356 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 4] total 6 [2022-02-20 23:38:11,356 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897386962] [2022-02-20 23:38:11,356 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 23:38:11,356 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 42 [2022-02-20 23:38:11,356 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:38:11,356 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 23:38:11,407 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:38:11,407 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 23:38:11,407 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:38:11,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 23:38:11,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-02-20 23:38:11,407 INFO L87 Difference]: Start difference. First operand 429 states and 555 transitions. Second operand has 7 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 23:38:11,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:38:11,688 INFO L93 Difference]: Finished difference Result 474 states and 593 transitions. [2022-02-20 23:38:11,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 23:38:11,688 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 42 [2022-02-20 23:38:11,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:38:11,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 23:38:11,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 124 transitions. [2022-02-20 23:38:11,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 23:38:11,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 124 transitions. [2022-02-20 23:38:11,690 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 124 transitions. [2022-02-20 23:38:11,785 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 124 edges. 124 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:38:11,793 INFO L225 Difference]: With dead ends: 474 [2022-02-20 23:38:11,793 INFO L226 Difference]: Without dead ends: 474 [2022-02-20 23:38:11,793 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2022-02-20 23:38:11,794 INFO L933 BasicCegarLoop]: 53 mSDtfsCounter, 94 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 87 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:38:11,794 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [94 Valid, 142 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 118 Invalid, 0 Unknown, 87 Unchecked, 0.1s Time] [2022-02-20 23:38:11,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2022-02-20 23:38:11,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 435. [2022-02-20 23:38:11,799 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:38:11,800 INFO L82 GeneralOperation]: Start isEquivalent. First operand 474 states. Second operand has 435 states, 395 states have (on average 1.339240506329114) internal successors, (529), 416 states have internal predecessors, (529), 9 states have call successors, (9), 9 states have call predecessors, (9), 17 states have return successors, (23), 9 states have call predecessors, (23), 9 states have call successors, (23) [2022-02-20 23:38:11,800 INFO L74 IsIncluded]: Start isIncluded. First operand 474 states. Second operand has 435 states, 395 states have (on average 1.339240506329114) internal successors, (529), 416 states have internal predecessors, (529), 9 states have call successors, (9), 9 states have call predecessors, (9), 17 states have return successors, (23), 9 states have call predecessors, (23), 9 states have call successors, (23) [2022-02-20 23:38:11,801 INFO L87 Difference]: Start difference. First operand 474 states. Second operand has 435 states, 395 states have (on average 1.339240506329114) internal successors, (529), 416 states have internal predecessors, (529), 9 states have call successors, (9), 9 states have call predecessors, (9), 17 states have return successors, (23), 9 states have call predecessors, (23), 9 states have call successors, (23) [2022-02-20 23:38:11,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:38:11,808 INFO L93 Difference]: Finished difference Result 474 states and 593 transitions. [2022-02-20 23:38:11,808 INFO L276 IsEmpty]: Start isEmpty. Operand 474 states and 593 transitions. [2022-02-20 23:38:11,809 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:38:11,809 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:38:11,810 INFO L74 IsIncluded]: Start isIncluded. First operand has 435 states, 395 states have (on average 1.339240506329114) internal successors, (529), 416 states have internal predecessors, (529), 9 states have call successors, (9), 9 states have call predecessors, (9), 17 states have return successors, (23), 9 states have call predecessors, (23), 9 states have call successors, (23) Second operand 474 states. [2022-02-20 23:38:11,810 INFO L87 Difference]: Start difference. First operand has 435 states, 395 states have (on average 1.339240506329114) internal successors, (529), 416 states have internal predecessors, (529), 9 states have call successors, (9), 9 states have call predecessors, (9), 17 states have return successors, (23), 9 states have call predecessors, (23), 9 states have call successors, (23) Second operand 474 states. [2022-02-20 23:38:11,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:38:11,818 INFO L93 Difference]: Finished difference Result 474 states and 593 transitions. [2022-02-20 23:38:11,818 INFO L276 IsEmpty]: Start isEmpty. Operand 474 states and 593 transitions. [2022-02-20 23:38:11,818 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:38:11,818 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:38:11,818 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:38:11,818 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:38:11,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 435 states, 395 states have (on average 1.339240506329114) internal successors, (529), 416 states have internal predecessors, (529), 9 states have call successors, (9), 9 states have call predecessors, (9), 17 states have return successors, (23), 9 states have call predecessors, (23), 9 states have call successors, (23) [2022-02-20 23:38:11,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 435 states and 561 transitions. [2022-02-20 23:38:11,825 INFO L78 Accepts]: Start accepts. Automaton has 435 states and 561 transitions. Word has length 42 [2022-02-20 23:38:11,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:38:11,826 INFO L470 AbstractCegarLoop]: Abstraction has 435 states and 561 transitions. [2022-02-20 23:38:11,826 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 23:38:11,826 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 561 transitions. [2022-02-20 23:38:11,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-02-20 23:38:11,826 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:38:11,826 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:38:11,859 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-02-20 23:38:12,039 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:38:12,039 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATION, parse_inputErr1REQUIRES_VIOLATION, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2022-02-20 23:38:12,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:38:12,040 INFO L85 PathProgramCache]: Analyzing trace with hash 1200736699, now seen corresponding path program 1 times [2022-02-20 23:38:12,040 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:38:12,040 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737481037] [2022-02-20 23:38:12,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:38:12,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:38:12,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:38:12,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 23:38:12,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:38:12,100 INFO L290 TraceCheckUtils]: 0: Hoare triple {30302#(and (= ~global~0.base |old(~global~0.base)|) (= |old(#length)| |#length|) (= |old(~global~0.offset)| ~global~0.offset) (= ~state~0 |old(~state~0)|) (= |old(#valid)| |#valid|))} ~input#1.base, ~input#1.offset := #in~input#1.base, #in~input#1.offset;~i~0#1 := 0; {30277#true} is VALID [2022-02-20 23:38:12,100 INFO L290 TraceCheckUtils]: 1: Hoare triple {30277#true} assume !!(~i~0#1 < 2); {30277#true} is VALID [2022-02-20 23:38:12,100 INFO L290 TraceCheckUtils]: 2: Hoare triple {30277#true} SUMMARY for call #t~mem3#1.base, #t~mem3#1.offset := read~$Pointer$(~#commands~0.base, ~#commands~0.offset + 9 * ~i~0#1, 4); srcloc: L693 {30277#true} is VALID [2022-02-20 23:38:12,100 INFO L290 TraceCheckUtils]: 3: Hoare triple {30277#true} assume 1 == #valid[#t~mem3#1.base]; {30277#true} is VALID [2022-02-20 23:38:12,100 INFO L290 TraceCheckUtils]: 4: Hoare triple {30277#true} assume #t~mem3#1.offset < #length[#t~mem3#1.base] && #t~mem3#1.offset >= 0; {30277#true} is VALID [2022-02-20 23:38:12,101 INFO L290 TraceCheckUtils]: 5: Hoare triple {30277#true} assume 1 == #valid[~input#1.base]; {30277#true} is VALID [2022-02-20 23:38:12,101 INFO L290 TraceCheckUtils]: 6: Hoare triple {30277#true} assume ~input#1.offset < #length[~input#1.base] && ~input#1.offset >= 0; {30277#true} is VALID [2022-02-20 23:38:12,101 INFO L290 TraceCheckUtils]: 7: Hoare triple {30277#true} assume 0 == #t~nondet4#1;havoc #t~mem3#1.base, #t~mem3#1.offset;havoc #t~nondet4#1; {30277#true} is VALID [2022-02-20 23:38:12,101 INFO L290 TraceCheckUtils]: 8: Hoare triple {30277#true} SUMMARY for call #t~mem5#1 := read~int(~#commands~0.base, 8 + (~#commands~0.offset + 9 * ~i~0#1), 1); srcloc: L694 {30277#true} is VALID [2022-02-20 23:38:12,101 INFO L290 TraceCheckUtils]: 9: Hoare triple {30277#true} assume ~state~0 >= #t~mem5#1;havoc #t~mem5#1; {30277#true} is VALID [2022-02-20 23:38:12,101 INFO L290 TraceCheckUtils]: 10: Hoare triple {30277#true} SUMMARY for call #t~mem6#1.base, #t~mem6#1.offset := read~$Pointer$(~#commands~0.base, 4 + (~#commands~0.offset + 9 * ~i~0#1), 4); srcloc: L695 {30277#true} is VALID [2022-02-20 23:38:12,101 INFO L290 TraceCheckUtils]: 11: Hoare triple {30277#true} assume { :begin_inline_##fun~~TO~VOID } true;##fun~~TO~VOID_#in~#fp#1.base, ##fun~~TO~VOID_#in~#fp#1.offset := #t~mem6#1.base, #t~mem6#1.offset; {30277#true} is VALID [2022-02-20 23:38:12,101 INFO L290 TraceCheckUtils]: 12: Hoare triple {30277#true} assume !(##fun~~TO~VOID_#in~#fp#1.base == #funAddr~c2.base && ##fun~~TO~VOID_#in~#fp#1.offset == #funAddr~c2.offset);assume { :begin_inline_c1 } true;havoc c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset, c1_~x~0#1.base, c1_~x~0#1.offset;call c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset := #Ultimate.allocOnHeap(1);c1_~x~0#1.base, c1_~x~0#1.offset := c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset;havoc c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset; {30277#true} is VALID [2022-02-20 23:38:12,102 INFO L290 TraceCheckUtils]: 13: Hoare triple {30277#true} assume !(c1_~x~0#1.base == 0 && c1_~x~0#1.offset == 0); {30277#true} is VALID [2022-02-20 23:38:12,102 INFO L290 TraceCheckUtils]: 14: Hoare triple {30277#true} assume !(~global~0.base != 0 || ~global~0.offset != 0); {30277#true} is VALID [2022-02-20 23:38:12,102 INFO L290 TraceCheckUtils]: 15: Hoare triple {30277#true} ~global~0.base, ~global~0.offset := c1_~x~0#1.base, c1_~x~0#1.offset;~state~0 := ~unnamed3~0~STATE_2; {30277#true} is VALID [2022-02-20 23:38:12,102 INFO L290 TraceCheckUtils]: 16: Hoare triple {30277#true} assume { :end_inline_c1 } true; {30277#true} is VALID [2022-02-20 23:38:12,102 INFO L290 TraceCheckUtils]: 17: Hoare triple {30277#true} assume { :end_inline_##fun~~TO~VOID } true;havoc #t~mem6#1.base, #t~mem6#1.offset; {30277#true} is VALID [2022-02-20 23:38:12,102 INFO L290 TraceCheckUtils]: 18: Hoare triple {30277#true} assume true; {30277#true} is VALID [2022-02-20 23:38:12,102 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {30277#true} {30277#true} #101#return; {30277#true} is VALID [2022-02-20 23:38:12,103 INFO L290 TraceCheckUtils]: 0: Hoare triple {30277#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(3, 1);call write~init~int(99, 1, 0, 1);call write~init~int(49, 1, 1, 1);call write~init~int(0, 1, 2, 1);call #Ultimate.allocInit(3, 2);call write~init~int(99, 2, 0, 1);call write~init~int(50, 2, 1, 1);call write~init~int(0, 2, 2, 1);call #Ultimate.allocInit(3, 3);call write~init~int(99, 3, 0, 1);call write~init~int(49, 3, 1, 1);call write~init~int(0, 3, 2, 1);call #Ultimate.allocInit(3, 4);call write~init~int(99, 4, 0, 1);call write~init~int(49, 4, 1, 1);call write~init~int(0, 4, 2, 1);call #Ultimate.allocInit(3, 5);call write~init~int(99, 5, 0, 1);call write~init~int(50, 5, 1, 1);call write~init~int(0, 5, 2, 1);~state~0 := ~unnamed3~0~STATE_1;~global~0.base, ~global~0.offset := 0, 0;~#commands~0.base, ~#commands~0.offset := 6, 0;call #Ultimate.allocInit(18, 6);call write~init~$Pointer$(1, 0, ~#commands~0.base, ~#commands~0.offset, 4);call write~init~$Pointer$(#funAddr~c1.base, #funAddr~c1.offset, ~#commands~0.base, 4 + ~#commands~0.offset, 4);call write~init~int((if ~unnamed3~0~STATE_1 % 256 <= 127 then ~unnamed3~0~STATE_1 % 256 else ~unnamed3~0~STATE_1 % 256 - 256), ~#commands~0.base, 8 + ~#commands~0.offset, 1);call write~init~$Pointer$(2, 0, ~#commands~0.base, 9 + ~#commands~0.offset, 4);call write~init~$Pointer$(#funAddr~c2.base, #funAddr~c2.offset, ~#commands~0.base, 13 + ~#commands~0.offset, 4);call write~init~int((if ~unnamed3~0~STATE_2 % 256 <= 127 then ~unnamed3~0~STATE_2 % 256 else ~unnamed3~0~STATE_2 % 256 - 256), ~#commands~0.base, 17 + ~#commands~0.offset, 1); {30277#true} is VALID [2022-02-20 23:38:12,103 INFO L290 TraceCheckUtils]: 1: Hoare triple {30277#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1; {30277#true} is VALID [2022-02-20 23:38:12,103 INFO L272 TraceCheckUtils]: 2: Hoare triple {30277#true} call parse_input(3, 0); {30302#(and (= ~global~0.base |old(~global~0.base)|) (= |old(#length)| |#length|) (= |old(~global~0.offset)| ~global~0.offset) (= ~state~0 |old(~state~0)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 23:38:12,103 INFO L290 TraceCheckUtils]: 3: Hoare triple {30302#(and (= ~global~0.base |old(~global~0.base)|) (= |old(#length)| |#length|) (= |old(~global~0.offset)| ~global~0.offset) (= ~state~0 |old(~state~0)|) (= |old(#valid)| |#valid|))} ~input#1.base, ~input#1.offset := #in~input#1.base, #in~input#1.offset;~i~0#1 := 0; {30277#true} is VALID [2022-02-20 23:38:12,104 INFO L290 TraceCheckUtils]: 4: Hoare triple {30277#true} assume !!(~i~0#1 < 2); {30277#true} is VALID [2022-02-20 23:38:12,104 INFO L290 TraceCheckUtils]: 5: Hoare triple {30277#true} SUMMARY for call #t~mem3#1.base, #t~mem3#1.offset := read~$Pointer$(~#commands~0.base, ~#commands~0.offset + 9 * ~i~0#1, 4); srcloc: L693 {30277#true} is VALID [2022-02-20 23:38:12,104 INFO L290 TraceCheckUtils]: 6: Hoare triple {30277#true} assume 1 == #valid[#t~mem3#1.base]; {30277#true} is VALID [2022-02-20 23:38:12,104 INFO L290 TraceCheckUtils]: 7: Hoare triple {30277#true} assume #t~mem3#1.offset < #length[#t~mem3#1.base] && #t~mem3#1.offset >= 0; {30277#true} is VALID [2022-02-20 23:38:12,104 INFO L290 TraceCheckUtils]: 8: Hoare triple {30277#true} assume 1 == #valid[~input#1.base]; {30277#true} is VALID [2022-02-20 23:38:12,104 INFO L290 TraceCheckUtils]: 9: Hoare triple {30277#true} assume ~input#1.offset < #length[~input#1.base] && ~input#1.offset >= 0; {30277#true} is VALID [2022-02-20 23:38:12,104 INFO L290 TraceCheckUtils]: 10: Hoare triple {30277#true} assume 0 == #t~nondet4#1;havoc #t~mem3#1.base, #t~mem3#1.offset;havoc #t~nondet4#1; {30277#true} is VALID [2022-02-20 23:38:12,104 INFO L290 TraceCheckUtils]: 11: Hoare triple {30277#true} SUMMARY for call #t~mem5#1 := read~int(~#commands~0.base, 8 + (~#commands~0.offset + 9 * ~i~0#1), 1); srcloc: L694 {30277#true} is VALID [2022-02-20 23:38:12,104 INFO L290 TraceCheckUtils]: 12: Hoare triple {30277#true} assume ~state~0 >= #t~mem5#1;havoc #t~mem5#1; {30277#true} is VALID [2022-02-20 23:38:12,105 INFO L290 TraceCheckUtils]: 13: Hoare triple {30277#true} SUMMARY for call #t~mem6#1.base, #t~mem6#1.offset := read~$Pointer$(~#commands~0.base, 4 + (~#commands~0.offset + 9 * ~i~0#1), 4); srcloc: L695 {30277#true} is VALID [2022-02-20 23:38:12,105 INFO L290 TraceCheckUtils]: 14: Hoare triple {30277#true} assume { :begin_inline_##fun~~TO~VOID } true;##fun~~TO~VOID_#in~#fp#1.base, ##fun~~TO~VOID_#in~#fp#1.offset := #t~mem6#1.base, #t~mem6#1.offset; {30277#true} is VALID [2022-02-20 23:38:12,105 INFO L290 TraceCheckUtils]: 15: Hoare triple {30277#true} assume !(##fun~~TO~VOID_#in~#fp#1.base == #funAddr~c2.base && ##fun~~TO~VOID_#in~#fp#1.offset == #funAddr~c2.offset);assume { :begin_inline_c1 } true;havoc c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset, c1_~x~0#1.base, c1_~x~0#1.offset;call c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset := #Ultimate.allocOnHeap(1);c1_~x~0#1.base, c1_~x~0#1.offset := c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset;havoc c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset; {30277#true} is VALID [2022-02-20 23:38:12,105 INFO L290 TraceCheckUtils]: 16: Hoare triple {30277#true} assume !(c1_~x~0#1.base == 0 && c1_~x~0#1.offset == 0); {30277#true} is VALID [2022-02-20 23:38:12,105 INFO L290 TraceCheckUtils]: 17: Hoare triple {30277#true} assume !(~global~0.base != 0 || ~global~0.offset != 0); {30277#true} is VALID [2022-02-20 23:38:12,105 INFO L290 TraceCheckUtils]: 18: Hoare triple {30277#true} ~global~0.base, ~global~0.offset := c1_~x~0#1.base, c1_~x~0#1.offset;~state~0 := ~unnamed3~0~STATE_2; {30277#true} is VALID [2022-02-20 23:38:12,105 INFO L290 TraceCheckUtils]: 19: Hoare triple {30277#true} assume { :end_inline_c1 } true; {30277#true} is VALID [2022-02-20 23:38:12,105 INFO L290 TraceCheckUtils]: 20: Hoare triple {30277#true} assume { :end_inline_##fun~~TO~VOID } true;havoc #t~mem6#1.base, #t~mem6#1.offset; {30277#true} is VALID [2022-02-20 23:38:12,106 INFO L290 TraceCheckUtils]: 21: Hoare triple {30277#true} assume true; {30277#true} is VALID [2022-02-20 23:38:12,106 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {30277#true} {30277#true} #101#return; {30277#true} is VALID [2022-02-20 23:38:12,106 INFO L272 TraceCheckUtils]: 23: Hoare triple {30277#true} call parse_input(4, 0); {30277#true} is VALID [2022-02-20 23:38:12,106 INFO L290 TraceCheckUtils]: 24: Hoare triple {30277#true} ~input#1.base, ~input#1.offset := #in~input#1.base, #in~input#1.offset;~i~0#1 := 0; {30299#(= |parse_input_~i~0#1| 0)} is VALID [2022-02-20 23:38:12,106 INFO L290 TraceCheckUtils]: 25: Hoare triple {30299#(= |parse_input_~i~0#1| 0)} assume !!(~i~0#1 < 2); {30299#(= |parse_input_~i~0#1| 0)} is VALID [2022-02-20 23:38:12,107 INFO L290 TraceCheckUtils]: 26: Hoare triple {30299#(= |parse_input_~i~0#1| 0)} SUMMARY for call #t~mem3#1.base, #t~mem3#1.offset := read~$Pointer$(~#commands~0.base, ~#commands~0.offset + 9 * ~i~0#1, 4); srcloc: L693 {30299#(= |parse_input_~i~0#1| 0)} is VALID [2022-02-20 23:38:12,107 INFO L290 TraceCheckUtils]: 27: Hoare triple {30299#(= |parse_input_~i~0#1| 0)} assume 1 == #valid[#t~mem3#1.base]; {30299#(= |parse_input_~i~0#1| 0)} is VALID [2022-02-20 23:38:12,107 INFO L290 TraceCheckUtils]: 28: Hoare triple {30299#(= |parse_input_~i~0#1| 0)} assume #t~mem3#1.offset < #length[#t~mem3#1.base] && #t~mem3#1.offset >= 0; {30299#(= |parse_input_~i~0#1| 0)} is VALID [2022-02-20 23:38:12,107 INFO L290 TraceCheckUtils]: 29: Hoare triple {30299#(= |parse_input_~i~0#1| 0)} assume 1 == #valid[~input#1.base]; {30299#(= |parse_input_~i~0#1| 0)} is VALID [2022-02-20 23:38:12,108 INFO L290 TraceCheckUtils]: 30: Hoare triple {30299#(= |parse_input_~i~0#1| 0)} assume ~input#1.offset < #length[~input#1.base] && ~input#1.offset >= 0; {30299#(= |parse_input_~i~0#1| 0)} is VALID [2022-02-20 23:38:12,108 INFO L290 TraceCheckUtils]: 31: Hoare triple {30299#(= |parse_input_~i~0#1| 0)} assume !(0 == #t~nondet4#1);havoc #t~mem3#1.base, #t~mem3#1.offset;havoc #t~nondet4#1; {30299#(= |parse_input_~i~0#1| 0)} is VALID [2022-02-20 23:38:12,108 INFO L290 TraceCheckUtils]: 32: Hoare triple {30299#(= |parse_input_~i~0#1| 0)} #t~post2#1 := ~i~0#1;~i~0#1 := 1 + #t~post2#1;havoc #t~post2#1; {30300#(<= 1 |parse_input_~i~0#1|)} is VALID [2022-02-20 23:38:12,109 INFO L290 TraceCheckUtils]: 33: Hoare triple {30300#(<= 1 |parse_input_~i~0#1|)} assume !!(~i~0#1 < 2); {30300#(<= 1 |parse_input_~i~0#1|)} is VALID [2022-02-20 23:38:12,109 INFO L290 TraceCheckUtils]: 34: Hoare triple {30300#(<= 1 |parse_input_~i~0#1|)} SUMMARY for call #t~mem3#1.base, #t~mem3#1.offset := read~$Pointer$(~#commands~0.base, ~#commands~0.offset + 9 * ~i~0#1, 4); srcloc: L693 {30300#(<= 1 |parse_input_~i~0#1|)} is VALID [2022-02-20 23:38:12,109 INFO L290 TraceCheckUtils]: 35: Hoare triple {30300#(<= 1 |parse_input_~i~0#1|)} assume 1 == #valid[#t~mem3#1.base]; {30300#(<= 1 |parse_input_~i~0#1|)} is VALID [2022-02-20 23:38:12,109 INFO L290 TraceCheckUtils]: 36: Hoare triple {30300#(<= 1 |parse_input_~i~0#1|)} assume #t~mem3#1.offset < #length[#t~mem3#1.base] && #t~mem3#1.offset >= 0; {30300#(<= 1 |parse_input_~i~0#1|)} is VALID [2022-02-20 23:38:12,110 INFO L290 TraceCheckUtils]: 37: Hoare triple {30300#(<= 1 |parse_input_~i~0#1|)} assume 1 == #valid[~input#1.base]; {30300#(<= 1 |parse_input_~i~0#1|)} is VALID [2022-02-20 23:38:12,110 INFO L290 TraceCheckUtils]: 38: Hoare triple {30300#(<= 1 |parse_input_~i~0#1|)} assume ~input#1.offset < #length[~input#1.base] && ~input#1.offset >= 0; {30300#(<= 1 |parse_input_~i~0#1|)} is VALID [2022-02-20 23:38:12,110 INFO L290 TraceCheckUtils]: 39: Hoare triple {30300#(<= 1 |parse_input_~i~0#1|)} assume !(0 == #t~nondet4#1);havoc #t~mem3#1.base, #t~mem3#1.offset;havoc #t~nondet4#1; {30300#(<= 1 |parse_input_~i~0#1|)} is VALID [2022-02-20 23:38:12,111 INFO L290 TraceCheckUtils]: 40: Hoare triple {30300#(<= 1 |parse_input_~i~0#1|)} #t~post2#1 := ~i~0#1;~i~0#1 := 1 + #t~post2#1;havoc #t~post2#1; {30301#(<= 2 |parse_input_~i~0#1|)} is VALID [2022-02-20 23:38:12,111 INFO L290 TraceCheckUtils]: 41: Hoare triple {30301#(<= 2 |parse_input_~i~0#1|)} assume !!(~i~0#1 < 2); {30278#false} is VALID [2022-02-20 23:38:12,111 INFO L290 TraceCheckUtils]: 42: Hoare triple {30278#false} SUMMARY for call #t~mem3#1.base, #t~mem3#1.offset := read~$Pointer$(~#commands~0.base, ~#commands~0.offset + 9 * ~i~0#1, 4); srcloc: L693 {30278#false} is VALID [2022-02-20 23:38:12,111 INFO L290 TraceCheckUtils]: 43: Hoare triple {30278#false} assume 1 == #valid[#t~mem3#1.base]; {30278#false} is VALID [2022-02-20 23:38:12,111 INFO L290 TraceCheckUtils]: 44: Hoare triple {30278#false} assume !(#t~mem3#1.offset < #length[#t~mem3#1.base] && #t~mem3#1.offset >= 0); {30278#false} is VALID [2022-02-20 23:38:12,111 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 25 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:38:12,112 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:38:12,112 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737481037] [2022-02-20 23:38:12,112 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1737481037] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 23:38:12,112 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [509762686] [2022-02-20 23:38:12,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:38:12,112 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:38:12,112 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:38:12,113 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 23:38:12,115 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-02-20 23:38:12,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:38:12,174 INFO L263 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-20 23:38:12,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:38:12,183 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:38:12,274 INFO L290 TraceCheckUtils]: 0: Hoare triple {30277#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(3, 1);call write~init~int(99, 1, 0, 1);call write~init~int(49, 1, 1, 1);call write~init~int(0, 1, 2, 1);call #Ultimate.allocInit(3, 2);call write~init~int(99, 2, 0, 1);call write~init~int(50, 2, 1, 1);call write~init~int(0, 2, 2, 1);call #Ultimate.allocInit(3, 3);call write~init~int(99, 3, 0, 1);call write~init~int(49, 3, 1, 1);call write~init~int(0, 3, 2, 1);call #Ultimate.allocInit(3, 4);call write~init~int(99, 4, 0, 1);call write~init~int(49, 4, 1, 1);call write~init~int(0, 4, 2, 1);call #Ultimate.allocInit(3, 5);call write~init~int(99, 5, 0, 1);call write~init~int(50, 5, 1, 1);call write~init~int(0, 5, 2, 1);~state~0 := ~unnamed3~0~STATE_1;~global~0.base, ~global~0.offset := 0, 0;~#commands~0.base, ~#commands~0.offset := 6, 0;call #Ultimate.allocInit(18, 6);call write~init~$Pointer$(1, 0, ~#commands~0.base, ~#commands~0.offset, 4);call write~init~$Pointer$(#funAddr~c1.base, #funAddr~c1.offset, ~#commands~0.base, 4 + ~#commands~0.offset, 4);call write~init~int((if ~unnamed3~0~STATE_1 % 256 <= 127 then ~unnamed3~0~STATE_1 % 256 else ~unnamed3~0~STATE_1 % 256 - 256), ~#commands~0.base, 8 + ~#commands~0.offset, 1);call write~init~$Pointer$(2, 0, ~#commands~0.base, 9 + ~#commands~0.offset, 4);call write~init~$Pointer$(#funAddr~c2.base, #funAddr~c2.offset, ~#commands~0.base, 13 + ~#commands~0.offset, 4);call write~init~int((if ~unnamed3~0~STATE_2 % 256 <= 127 then ~unnamed3~0~STATE_2 % 256 else ~unnamed3~0~STATE_2 % 256 - 256), ~#commands~0.base, 17 + ~#commands~0.offset, 1); {30277#true} is VALID [2022-02-20 23:38:12,274 INFO L290 TraceCheckUtils]: 1: Hoare triple {30277#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1; {30277#true} is VALID [2022-02-20 23:38:12,274 INFO L272 TraceCheckUtils]: 2: Hoare triple {30277#true} call parse_input(3, 0); {30277#true} is VALID [2022-02-20 23:38:12,274 INFO L290 TraceCheckUtils]: 3: Hoare triple {30277#true} ~input#1.base, ~input#1.offset := #in~input#1.base, #in~input#1.offset;~i~0#1 := 0; {30277#true} is VALID [2022-02-20 23:38:12,274 INFO L290 TraceCheckUtils]: 4: Hoare triple {30277#true} assume !!(~i~0#1 < 2); {30277#true} is VALID [2022-02-20 23:38:12,274 INFO L290 TraceCheckUtils]: 5: Hoare triple {30277#true} SUMMARY for call #t~mem3#1.base, #t~mem3#1.offset := read~$Pointer$(~#commands~0.base, ~#commands~0.offset + 9 * ~i~0#1, 4); srcloc: L693 {30277#true} is VALID [2022-02-20 23:38:12,274 INFO L290 TraceCheckUtils]: 6: Hoare triple {30277#true} assume 1 == #valid[#t~mem3#1.base]; {30277#true} is VALID [2022-02-20 23:38:12,274 INFO L290 TraceCheckUtils]: 7: Hoare triple {30277#true} assume #t~mem3#1.offset < #length[#t~mem3#1.base] && #t~mem3#1.offset >= 0; {30277#true} is VALID [2022-02-20 23:38:12,274 INFO L290 TraceCheckUtils]: 8: Hoare triple {30277#true} assume 1 == #valid[~input#1.base]; {30277#true} is VALID [2022-02-20 23:38:12,274 INFO L290 TraceCheckUtils]: 9: Hoare triple {30277#true} assume ~input#1.offset < #length[~input#1.base] && ~input#1.offset >= 0; {30277#true} is VALID [2022-02-20 23:38:12,275 INFO L290 TraceCheckUtils]: 10: Hoare triple {30277#true} assume 0 == #t~nondet4#1;havoc #t~mem3#1.base, #t~mem3#1.offset;havoc #t~nondet4#1; {30277#true} is VALID [2022-02-20 23:38:12,275 INFO L290 TraceCheckUtils]: 11: Hoare triple {30277#true} SUMMARY for call #t~mem5#1 := read~int(~#commands~0.base, 8 + (~#commands~0.offset + 9 * ~i~0#1), 1); srcloc: L694 {30277#true} is VALID [2022-02-20 23:38:12,275 INFO L290 TraceCheckUtils]: 12: Hoare triple {30277#true} assume ~state~0 >= #t~mem5#1;havoc #t~mem5#1; {30277#true} is VALID [2022-02-20 23:38:12,275 INFO L290 TraceCheckUtils]: 13: Hoare triple {30277#true} SUMMARY for call #t~mem6#1.base, #t~mem6#1.offset := read~$Pointer$(~#commands~0.base, 4 + (~#commands~0.offset + 9 * ~i~0#1), 4); srcloc: L695 {30277#true} is VALID [2022-02-20 23:38:12,275 INFO L290 TraceCheckUtils]: 14: Hoare triple {30277#true} assume { :begin_inline_##fun~~TO~VOID } true;##fun~~TO~VOID_#in~#fp#1.base, ##fun~~TO~VOID_#in~#fp#1.offset := #t~mem6#1.base, #t~mem6#1.offset; {30277#true} is VALID [2022-02-20 23:38:12,275 INFO L290 TraceCheckUtils]: 15: Hoare triple {30277#true} assume !(##fun~~TO~VOID_#in~#fp#1.base == #funAddr~c2.base && ##fun~~TO~VOID_#in~#fp#1.offset == #funAddr~c2.offset);assume { :begin_inline_c1 } true;havoc c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset, c1_~x~0#1.base, c1_~x~0#1.offset;call c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset := #Ultimate.allocOnHeap(1);c1_~x~0#1.base, c1_~x~0#1.offset := c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset;havoc c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset; {30277#true} is VALID [2022-02-20 23:38:12,275 INFO L290 TraceCheckUtils]: 16: Hoare triple {30277#true} assume !(c1_~x~0#1.base == 0 && c1_~x~0#1.offset == 0); {30277#true} is VALID [2022-02-20 23:38:12,275 INFO L290 TraceCheckUtils]: 17: Hoare triple {30277#true} assume !(~global~0.base != 0 || ~global~0.offset != 0); {30277#true} is VALID [2022-02-20 23:38:12,275 INFO L290 TraceCheckUtils]: 18: Hoare triple {30277#true} ~global~0.base, ~global~0.offset := c1_~x~0#1.base, c1_~x~0#1.offset;~state~0 := ~unnamed3~0~STATE_2; {30277#true} is VALID [2022-02-20 23:38:12,275 INFO L290 TraceCheckUtils]: 19: Hoare triple {30277#true} assume { :end_inline_c1 } true; {30277#true} is VALID [2022-02-20 23:38:12,275 INFO L290 TraceCheckUtils]: 20: Hoare triple {30277#true} assume { :end_inline_##fun~~TO~VOID } true;havoc #t~mem6#1.base, #t~mem6#1.offset; {30277#true} is VALID [2022-02-20 23:38:12,275 INFO L290 TraceCheckUtils]: 21: Hoare triple {30277#true} assume true; {30277#true} is VALID [2022-02-20 23:38:12,275 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {30277#true} {30277#true} #101#return; {30277#true} is VALID [2022-02-20 23:38:12,275 INFO L272 TraceCheckUtils]: 23: Hoare triple {30277#true} call parse_input(4, 0); {30277#true} is VALID [2022-02-20 23:38:12,276 INFO L290 TraceCheckUtils]: 24: Hoare triple {30277#true} ~input#1.base, ~input#1.offset := #in~input#1.base, #in~input#1.offset;~i~0#1 := 0; {30378#(<= 0 |parse_input_~i~0#1|)} is VALID [2022-02-20 23:38:12,276 INFO L290 TraceCheckUtils]: 25: Hoare triple {30378#(<= 0 |parse_input_~i~0#1|)} assume !!(~i~0#1 < 2); {30378#(<= 0 |parse_input_~i~0#1|)} is VALID [2022-02-20 23:38:12,276 INFO L290 TraceCheckUtils]: 26: Hoare triple {30378#(<= 0 |parse_input_~i~0#1|)} SUMMARY for call #t~mem3#1.base, #t~mem3#1.offset := read~$Pointer$(~#commands~0.base, ~#commands~0.offset + 9 * ~i~0#1, 4); srcloc: L693 {30378#(<= 0 |parse_input_~i~0#1|)} is VALID [2022-02-20 23:38:12,276 INFO L290 TraceCheckUtils]: 27: Hoare triple {30378#(<= 0 |parse_input_~i~0#1|)} assume 1 == #valid[#t~mem3#1.base]; {30378#(<= 0 |parse_input_~i~0#1|)} is VALID [2022-02-20 23:38:12,277 INFO L290 TraceCheckUtils]: 28: Hoare triple {30378#(<= 0 |parse_input_~i~0#1|)} assume #t~mem3#1.offset < #length[#t~mem3#1.base] && #t~mem3#1.offset >= 0; {30378#(<= 0 |parse_input_~i~0#1|)} is VALID [2022-02-20 23:38:12,277 INFO L290 TraceCheckUtils]: 29: Hoare triple {30378#(<= 0 |parse_input_~i~0#1|)} assume 1 == #valid[~input#1.base]; {30378#(<= 0 |parse_input_~i~0#1|)} is VALID [2022-02-20 23:38:12,277 INFO L290 TraceCheckUtils]: 30: Hoare triple {30378#(<= 0 |parse_input_~i~0#1|)} assume ~input#1.offset < #length[~input#1.base] && ~input#1.offset >= 0; {30378#(<= 0 |parse_input_~i~0#1|)} is VALID [2022-02-20 23:38:12,277 INFO L290 TraceCheckUtils]: 31: Hoare triple {30378#(<= 0 |parse_input_~i~0#1|)} assume !(0 == #t~nondet4#1);havoc #t~mem3#1.base, #t~mem3#1.offset;havoc #t~nondet4#1; {30378#(<= 0 |parse_input_~i~0#1|)} is VALID [2022-02-20 23:38:12,278 INFO L290 TraceCheckUtils]: 32: Hoare triple {30378#(<= 0 |parse_input_~i~0#1|)} #t~post2#1 := ~i~0#1;~i~0#1 := 1 + #t~post2#1;havoc #t~post2#1; {30300#(<= 1 |parse_input_~i~0#1|)} is VALID [2022-02-20 23:38:12,278 INFO L290 TraceCheckUtils]: 33: Hoare triple {30300#(<= 1 |parse_input_~i~0#1|)} assume !!(~i~0#1 < 2); {30300#(<= 1 |parse_input_~i~0#1|)} is VALID [2022-02-20 23:38:12,278 INFO L290 TraceCheckUtils]: 34: Hoare triple {30300#(<= 1 |parse_input_~i~0#1|)} SUMMARY for call #t~mem3#1.base, #t~mem3#1.offset := read~$Pointer$(~#commands~0.base, ~#commands~0.offset + 9 * ~i~0#1, 4); srcloc: L693 {30300#(<= 1 |parse_input_~i~0#1|)} is VALID [2022-02-20 23:38:12,278 INFO L290 TraceCheckUtils]: 35: Hoare triple {30300#(<= 1 |parse_input_~i~0#1|)} assume 1 == #valid[#t~mem3#1.base]; {30300#(<= 1 |parse_input_~i~0#1|)} is VALID [2022-02-20 23:38:12,279 INFO L290 TraceCheckUtils]: 36: Hoare triple {30300#(<= 1 |parse_input_~i~0#1|)} assume #t~mem3#1.offset < #length[#t~mem3#1.base] && #t~mem3#1.offset >= 0; {30300#(<= 1 |parse_input_~i~0#1|)} is VALID [2022-02-20 23:38:12,279 INFO L290 TraceCheckUtils]: 37: Hoare triple {30300#(<= 1 |parse_input_~i~0#1|)} assume 1 == #valid[~input#1.base]; {30300#(<= 1 |parse_input_~i~0#1|)} is VALID [2022-02-20 23:38:12,279 INFO L290 TraceCheckUtils]: 38: Hoare triple {30300#(<= 1 |parse_input_~i~0#1|)} assume ~input#1.offset < #length[~input#1.base] && ~input#1.offset >= 0; {30300#(<= 1 |parse_input_~i~0#1|)} is VALID [2022-02-20 23:38:12,279 INFO L290 TraceCheckUtils]: 39: Hoare triple {30300#(<= 1 |parse_input_~i~0#1|)} assume !(0 == #t~nondet4#1);havoc #t~mem3#1.base, #t~mem3#1.offset;havoc #t~nondet4#1; {30300#(<= 1 |parse_input_~i~0#1|)} is VALID [2022-02-20 23:38:12,280 INFO L290 TraceCheckUtils]: 40: Hoare triple {30300#(<= 1 |parse_input_~i~0#1|)} #t~post2#1 := ~i~0#1;~i~0#1 := 1 + #t~post2#1;havoc #t~post2#1; {30301#(<= 2 |parse_input_~i~0#1|)} is VALID [2022-02-20 23:38:12,280 INFO L290 TraceCheckUtils]: 41: Hoare triple {30301#(<= 2 |parse_input_~i~0#1|)} assume !!(~i~0#1 < 2); {30278#false} is VALID [2022-02-20 23:38:12,280 INFO L290 TraceCheckUtils]: 42: Hoare triple {30278#false} SUMMARY for call #t~mem3#1.base, #t~mem3#1.offset := read~$Pointer$(~#commands~0.base, ~#commands~0.offset + 9 * ~i~0#1, 4); srcloc: L693 {30278#false} is VALID [2022-02-20 23:38:12,280 INFO L290 TraceCheckUtils]: 43: Hoare triple {30278#false} assume 1 == #valid[#t~mem3#1.base]; {30278#false} is VALID [2022-02-20 23:38:12,280 INFO L290 TraceCheckUtils]: 44: Hoare triple {30278#false} assume !(#t~mem3#1.offset < #length[#t~mem3#1.base] && #t~mem3#1.offset >= 0); {30278#false} is VALID [2022-02-20 23:38:12,280 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-20 23:38:12,280 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:38:12,280 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [509762686] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:38:12,281 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-20 23:38:12,281 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2022-02-20 23:38:12,281 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963563164] [2022-02-20 23:38:12,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:38:12,281 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 45 [2022-02-20 23:38:12,281 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:38:12,281 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:38:12,305 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:38:12,305 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 23:38:12,305 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:38:12,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 23:38:12,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-02-20 23:38:12,305 INFO L87 Difference]: Start difference. First operand 435 states and 561 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:38:12,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:38:12,433 INFO L93 Difference]: Finished difference Result 527 states and 645 transitions. [2022-02-20 23:38:12,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 23:38:12,433 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 45 [2022-02-20 23:38:12,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:38:12,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:38:12,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 100 transitions. [2022-02-20 23:38:12,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:38:12,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 100 transitions. [2022-02-20 23:38:12,435 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 100 transitions. [2022-02-20 23:38:12,504 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 100 edges. 100 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:38:12,512 INFO L225 Difference]: With dead ends: 527 [2022-02-20 23:38:12,512 INFO L226 Difference]: Without dead ends: 527 [2022-02-20 23:38:12,513 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-02-20 23:38:12,513 INFO L933 BasicCegarLoop]: 73 mSDtfsCounter, 82 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:38:12,513 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [82 Valid, 172 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:38:12,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 527 states. [2022-02-20 23:38:12,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 527 to 425. [2022-02-20 23:38:12,518 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:38:12,519 INFO L82 GeneralOperation]: Start isEquivalent. First operand 527 states. Second operand has 425 states, 385 states have (on average 1.3116883116883118) internal successors, (505), 406 states have internal predecessors, (505), 9 states have call successors, (9), 9 states have call predecessors, (9), 17 states have return successors, (23), 9 states have call predecessors, (23), 9 states have call successors, (23) [2022-02-20 23:38:12,519 INFO L74 IsIncluded]: Start isIncluded. First operand 527 states. Second operand has 425 states, 385 states have (on average 1.3116883116883118) internal successors, (505), 406 states have internal predecessors, (505), 9 states have call successors, (9), 9 states have call predecessors, (9), 17 states have return successors, (23), 9 states have call predecessors, (23), 9 states have call successors, (23) [2022-02-20 23:38:12,519 INFO L87 Difference]: Start difference. First operand 527 states. Second operand has 425 states, 385 states have (on average 1.3116883116883118) internal successors, (505), 406 states have internal predecessors, (505), 9 states have call successors, (9), 9 states have call predecessors, (9), 17 states have return successors, (23), 9 states have call predecessors, (23), 9 states have call successors, (23) [2022-02-20 23:38:12,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:38:12,528 INFO L93 Difference]: Finished difference Result 527 states and 645 transitions. [2022-02-20 23:38:12,528 INFO L276 IsEmpty]: Start isEmpty. Operand 527 states and 645 transitions. [2022-02-20 23:38:12,528 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:38:12,528 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:38:12,529 INFO L74 IsIncluded]: Start isIncluded. First operand has 425 states, 385 states have (on average 1.3116883116883118) internal successors, (505), 406 states have internal predecessors, (505), 9 states have call successors, (9), 9 states have call predecessors, (9), 17 states have return successors, (23), 9 states have call predecessors, (23), 9 states have call successors, (23) Second operand 527 states. [2022-02-20 23:38:12,529 INFO L87 Difference]: Start difference. First operand has 425 states, 385 states have (on average 1.3116883116883118) internal successors, (505), 406 states have internal predecessors, (505), 9 states have call successors, (9), 9 states have call predecessors, (9), 17 states have return successors, (23), 9 states have call predecessors, (23), 9 states have call successors, (23) Second operand 527 states. [2022-02-20 23:38:12,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:38:12,538 INFO L93 Difference]: Finished difference Result 527 states and 645 transitions. [2022-02-20 23:38:12,538 INFO L276 IsEmpty]: Start isEmpty. Operand 527 states and 645 transitions. [2022-02-20 23:38:12,539 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:38:12,539 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:38:12,539 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:38:12,539 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:38:12,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 425 states, 385 states have (on average 1.3116883116883118) internal successors, (505), 406 states have internal predecessors, (505), 9 states have call successors, (9), 9 states have call predecessors, (9), 17 states have return successors, (23), 9 states have call predecessors, (23), 9 states have call successors, (23) [2022-02-20 23:38:12,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 537 transitions. [2022-02-20 23:38:12,545 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 537 transitions. Word has length 45 [2022-02-20 23:38:12,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:38:12,545 INFO L470 AbstractCegarLoop]: Abstraction has 425 states and 537 transitions. [2022-02-20 23:38:12,545 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:38:12,545 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 537 transitions. [2022-02-20 23:38:12,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-02-20 23:38:12,545 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:38:12,546 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:38:12,564 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-02-20 23:38:12,765 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2022-02-20 23:38:12,765 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting parse_inputErr1REQUIRES_VIOLATION === [parse_inputErr0REQUIRES_VIOLATION, parse_inputErr1REQUIRES_VIOLATION, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2022-02-20 23:38:12,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:38:12,765 INFO L85 PathProgramCache]: Analyzing trace with hash -1458472979, now seen corresponding path program 1 times [2022-02-20 23:38:12,765 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:38:12,765 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79038775] [2022-02-20 23:38:12,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:38:12,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:38:12,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:38:12,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 23:38:12,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:38:12,865 INFO L290 TraceCheckUtils]: 0: Hoare triple {32490#(and (= ~global~0.base |old(~global~0.base)|) (= |old(#length)| |#length|) (= |old(~global~0.offset)| ~global~0.offset) (= ~state~0 |old(~state~0)|) (= |old(#valid)| |#valid|))} ~input#1.base, ~input#1.offset := #in~input#1.base, #in~input#1.offset;~i~0#1 := 0; {32491#(= |old(#length)| |#length|)} is VALID [2022-02-20 23:38:12,865 INFO L290 TraceCheckUtils]: 1: Hoare triple {32491#(= |old(#length)| |#length|)} assume !!(~i~0#1 < 2); {32491#(= |old(#length)| |#length|)} is VALID [2022-02-20 23:38:12,865 INFO L290 TraceCheckUtils]: 2: Hoare triple {32491#(= |old(#length)| |#length|)} SUMMARY for call #t~mem3#1.base, #t~mem3#1.offset := read~$Pointer$(~#commands~0.base, ~#commands~0.offset + 9 * ~i~0#1, 4); srcloc: L693 {32491#(= |old(#length)| |#length|)} is VALID [2022-02-20 23:38:12,866 INFO L290 TraceCheckUtils]: 3: Hoare triple {32491#(= |old(#length)| |#length|)} assume 1 == #valid[#t~mem3#1.base]; {32491#(= |old(#length)| |#length|)} is VALID [2022-02-20 23:38:12,866 INFO L290 TraceCheckUtils]: 4: Hoare triple {32491#(= |old(#length)| |#length|)} assume #t~mem3#1.offset < #length[#t~mem3#1.base] && #t~mem3#1.offset >= 0; {32491#(= |old(#length)| |#length|)} is VALID [2022-02-20 23:38:12,866 INFO L290 TraceCheckUtils]: 5: Hoare triple {32491#(= |old(#length)| |#length|)} assume 1 == #valid[~input#1.base]; {32491#(= |old(#length)| |#length|)} is VALID [2022-02-20 23:38:12,866 INFO L290 TraceCheckUtils]: 6: Hoare triple {32491#(= |old(#length)| |#length|)} assume ~input#1.offset < #length[~input#1.base] && ~input#1.offset >= 0; {32491#(= |old(#length)| |#length|)} is VALID [2022-02-20 23:38:12,867 INFO L290 TraceCheckUtils]: 7: Hoare triple {32491#(= |old(#length)| |#length|)} assume !(0 == #t~nondet4#1);havoc #t~mem3#1.base, #t~mem3#1.offset;havoc #t~nondet4#1; {32491#(= |old(#length)| |#length|)} is VALID [2022-02-20 23:38:12,867 INFO L290 TraceCheckUtils]: 8: Hoare triple {32491#(= |old(#length)| |#length|)} #t~post2#1 := ~i~0#1;~i~0#1 := 1 + #t~post2#1;havoc #t~post2#1; {32491#(= |old(#length)| |#length|)} is VALID [2022-02-20 23:38:12,867 INFO L290 TraceCheckUtils]: 9: Hoare triple {32491#(= |old(#length)| |#length|)} assume !!(~i~0#1 < 2); {32491#(= |old(#length)| |#length|)} is VALID [2022-02-20 23:38:12,867 INFO L290 TraceCheckUtils]: 10: Hoare triple {32491#(= |old(#length)| |#length|)} SUMMARY for call #t~mem3#1.base, #t~mem3#1.offset := read~$Pointer$(~#commands~0.base, ~#commands~0.offset + 9 * ~i~0#1, 4); srcloc: L693 {32491#(= |old(#length)| |#length|)} is VALID [2022-02-20 23:38:12,868 INFO L290 TraceCheckUtils]: 11: Hoare triple {32491#(= |old(#length)| |#length|)} assume 1 == #valid[#t~mem3#1.base]; {32491#(= |old(#length)| |#length|)} is VALID [2022-02-20 23:38:12,868 INFO L290 TraceCheckUtils]: 12: Hoare triple {32491#(= |old(#length)| |#length|)} assume #t~mem3#1.offset < #length[#t~mem3#1.base] && #t~mem3#1.offset >= 0; {32491#(= |old(#length)| |#length|)} is VALID [2022-02-20 23:38:12,868 INFO L290 TraceCheckUtils]: 13: Hoare triple {32491#(= |old(#length)| |#length|)} assume 1 == #valid[~input#1.base]; {32491#(= |old(#length)| |#length|)} is VALID [2022-02-20 23:38:12,868 INFO L290 TraceCheckUtils]: 14: Hoare triple {32491#(= |old(#length)| |#length|)} assume ~input#1.offset < #length[~input#1.base] && ~input#1.offset >= 0; {32491#(= |old(#length)| |#length|)} is VALID [2022-02-20 23:38:12,868 INFO L290 TraceCheckUtils]: 15: Hoare triple {32491#(= |old(#length)| |#length|)} assume !(0 == #t~nondet4#1);havoc #t~mem3#1.base, #t~mem3#1.offset;havoc #t~nondet4#1; {32491#(= |old(#length)| |#length|)} is VALID [2022-02-20 23:38:12,869 INFO L290 TraceCheckUtils]: 16: Hoare triple {32491#(= |old(#length)| |#length|)} #t~post2#1 := ~i~0#1;~i~0#1 := 1 + #t~post2#1;havoc #t~post2#1; {32491#(= |old(#length)| |#length|)} is VALID [2022-02-20 23:38:12,869 INFO L290 TraceCheckUtils]: 17: Hoare triple {32491#(= |old(#length)| |#length|)} assume !(~i~0#1 < 2); {32491#(= |old(#length)| |#length|)} is VALID [2022-02-20 23:38:12,869 INFO L290 TraceCheckUtils]: 18: Hoare triple {32491#(= |old(#length)| |#length|)} assume true; {32491#(= |old(#length)| |#length|)} is VALID [2022-02-20 23:38:12,870 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {32491#(= |old(#length)| |#length|)} {32446#(and (= 6 |~#commands~0.base|) (= (select |#length| 6) 18) (<= 0 |~#commands~0.offset|) (<= |~#commands~0.offset| 0))} #101#return; {32467#(and (<= 0 |~#commands~0.offset|) (= 18 (select |#length| |~#commands~0.base|)) (<= |~#commands~0.offset| 0))} is VALID [2022-02-20 23:38:12,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-02-20 23:38:12,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:38:12,899 INFO L290 TraceCheckUtils]: 0: Hoare triple {32490#(and (= ~global~0.base |old(~global~0.base)|) (= |old(#length)| |#length|) (= |old(~global~0.offset)| ~global~0.offset) (= ~state~0 |old(~state~0)|) (= |old(#valid)| |#valid|))} ~input#1.base, ~input#1.offset := #in~input#1.base, #in~input#1.offset;~i~0#1 := 0; {32491#(= |old(#length)| |#length|)} is VALID [2022-02-20 23:38:12,899 INFO L290 TraceCheckUtils]: 1: Hoare triple {32491#(= |old(#length)| |#length|)} assume !!(~i~0#1 < 2); {32491#(= |old(#length)| |#length|)} is VALID [2022-02-20 23:38:12,900 INFO L290 TraceCheckUtils]: 2: Hoare triple {32491#(= |old(#length)| |#length|)} SUMMARY for call #t~mem3#1.base, #t~mem3#1.offset := read~$Pointer$(~#commands~0.base, ~#commands~0.offset + 9 * ~i~0#1, 4); srcloc: L693 {32492#(and (= |old(#length)| |#length|) (= (select |#valid| |~#commands~0.base|) 1))} is VALID [2022-02-20 23:38:12,900 INFO L290 TraceCheckUtils]: 3: Hoare triple {32492#(and (= |old(#length)| |#length|) (= (select |#valid| |~#commands~0.base|) 1))} assume 1 == #valid[#t~mem3#1.base]; {32492#(and (= |old(#length)| |#length|) (= (select |#valid| |~#commands~0.base|) 1))} is VALID [2022-02-20 23:38:12,900 INFO L290 TraceCheckUtils]: 4: Hoare triple {32492#(and (= |old(#length)| |#length|) (= (select |#valid| |~#commands~0.base|) 1))} assume #t~mem3#1.offset < #length[#t~mem3#1.base] && #t~mem3#1.offset >= 0; {32492#(and (= |old(#length)| |#length|) (= (select |#valid| |~#commands~0.base|) 1))} is VALID [2022-02-20 23:38:12,901 INFO L290 TraceCheckUtils]: 5: Hoare triple {32492#(and (= |old(#length)| |#length|) (= (select |#valid| |~#commands~0.base|) 1))} assume 1 == #valid[~input#1.base]; {32492#(and (= |old(#length)| |#length|) (= (select |#valid| |~#commands~0.base|) 1))} is VALID [2022-02-20 23:38:12,901 INFO L290 TraceCheckUtils]: 6: Hoare triple {32492#(and (= |old(#length)| |#length|) (= (select |#valid| |~#commands~0.base|) 1))} assume ~input#1.offset < #length[~input#1.base] && ~input#1.offset >= 0; {32492#(and (= |old(#length)| |#length|) (= (select |#valid| |~#commands~0.base|) 1))} is VALID [2022-02-20 23:38:12,901 INFO L290 TraceCheckUtils]: 7: Hoare triple {32492#(and (= |old(#length)| |#length|) (= (select |#valid| |~#commands~0.base|) 1))} assume 0 == #t~nondet4#1;havoc #t~mem3#1.base, #t~mem3#1.offset;havoc #t~nondet4#1; {32492#(and (= |old(#length)| |#length|) (= (select |#valid| |~#commands~0.base|) 1))} is VALID [2022-02-20 23:38:12,902 INFO L290 TraceCheckUtils]: 8: Hoare triple {32492#(and (= |old(#length)| |#length|) (= (select |#valid| |~#commands~0.base|) 1))} SUMMARY for call #t~mem5#1 := read~int(~#commands~0.base, 8 + (~#commands~0.offset + 9 * ~i~0#1), 1); srcloc: L694 {32492#(and (= |old(#length)| |#length|) (= (select |#valid| |~#commands~0.base|) 1))} is VALID [2022-02-20 23:38:12,902 INFO L290 TraceCheckUtils]: 9: Hoare triple {32492#(and (= |old(#length)| |#length|) (= (select |#valid| |~#commands~0.base|) 1))} assume ~state~0 >= #t~mem5#1;havoc #t~mem5#1; {32492#(and (= |old(#length)| |#length|) (= (select |#valid| |~#commands~0.base|) 1))} is VALID [2022-02-20 23:38:12,902 INFO L290 TraceCheckUtils]: 10: Hoare triple {32492#(and (= |old(#length)| |#length|) (= (select |#valid| |~#commands~0.base|) 1))} SUMMARY for call #t~mem6#1.base, #t~mem6#1.offset := read~$Pointer$(~#commands~0.base, 4 + (~#commands~0.offset + 9 * ~i~0#1), 4); srcloc: L695 {32492#(and (= |old(#length)| |#length|) (= (select |#valid| |~#commands~0.base|) 1))} is VALID [2022-02-20 23:38:12,903 INFO L290 TraceCheckUtils]: 11: Hoare triple {32492#(and (= |old(#length)| |#length|) (= (select |#valid| |~#commands~0.base|) 1))} assume { :begin_inline_##fun~~TO~VOID } true;##fun~~TO~VOID_#in~#fp#1.base, ##fun~~TO~VOID_#in~#fp#1.offset := #t~mem6#1.base, #t~mem6#1.offset; {32492#(and (= |old(#length)| |#length|) (= (select |#valid| |~#commands~0.base|) 1))} is VALID [2022-02-20 23:38:12,903 INFO L290 TraceCheckUtils]: 12: Hoare triple {32492#(and (= |old(#length)| |#length|) (= (select |#valid| |~#commands~0.base|) 1))} assume !(##fun~~TO~VOID_#in~#fp#1.base == #funAddr~c2.base && ##fun~~TO~VOID_#in~#fp#1.offset == #funAddr~c2.offset);assume { :begin_inline_c1 } true;havoc c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset, c1_~x~0#1.base, c1_~x~0#1.offset;call c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset := #Ultimate.allocOnHeap(1);c1_~x~0#1.base, c1_~x~0#1.offset := c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset;havoc c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset; {32493#(or (= (+ (select |#length| |~#commands~0.base|) (- 18)) 0) (= (select |#length| |~#commands~0.base|) (select |old(#length)| |~#commands~0.base|)))} is VALID [2022-02-20 23:38:12,904 INFO L290 TraceCheckUtils]: 13: Hoare triple {32493#(or (= (+ (select |#length| |~#commands~0.base|) (- 18)) 0) (= (select |#length| |~#commands~0.base|) (select |old(#length)| |~#commands~0.base|)))} assume !(c1_~x~0#1.base == 0 && c1_~x~0#1.offset == 0); {32493#(or (= (+ (select |#length| |~#commands~0.base|) (- 18)) 0) (= (select |#length| |~#commands~0.base|) (select |old(#length)| |~#commands~0.base|)))} is VALID [2022-02-20 23:38:12,904 INFO L290 TraceCheckUtils]: 14: Hoare triple {32493#(or (= (+ (select |#length| |~#commands~0.base|) (- 18)) 0) (= (select |#length| |~#commands~0.base|) (select |old(#length)| |~#commands~0.base|)))} assume !(~global~0.base != 0 || ~global~0.offset != 0); {32493#(or (= (+ (select |#length| |~#commands~0.base|) (- 18)) 0) (= (select |#length| |~#commands~0.base|) (select |old(#length)| |~#commands~0.base|)))} is VALID [2022-02-20 23:38:12,904 INFO L290 TraceCheckUtils]: 15: Hoare triple {32493#(or (= (+ (select |#length| |~#commands~0.base|) (- 18)) 0) (= (select |#length| |~#commands~0.base|) (select |old(#length)| |~#commands~0.base|)))} ~global~0.base, ~global~0.offset := c1_~x~0#1.base, c1_~x~0#1.offset;~state~0 := ~unnamed3~0~STATE_2; {32493#(or (= (+ (select |#length| |~#commands~0.base|) (- 18)) 0) (= (select |#length| |~#commands~0.base|) (select |old(#length)| |~#commands~0.base|)))} is VALID [2022-02-20 23:38:12,905 INFO L290 TraceCheckUtils]: 16: Hoare triple {32493#(or (= (+ (select |#length| |~#commands~0.base|) (- 18)) 0) (= (select |#length| |~#commands~0.base|) (select |old(#length)| |~#commands~0.base|)))} assume { :end_inline_c1 } true; {32493#(or (= (+ (select |#length| |~#commands~0.base|) (- 18)) 0) (= (select |#length| |~#commands~0.base|) (select |old(#length)| |~#commands~0.base|)))} is VALID [2022-02-20 23:38:12,905 INFO L290 TraceCheckUtils]: 17: Hoare triple {32493#(or (= (+ (select |#length| |~#commands~0.base|) (- 18)) 0) (= (select |#length| |~#commands~0.base|) (select |old(#length)| |~#commands~0.base|)))} assume { :end_inline_##fun~~TO~VOID } true;havoc #t~mem6#1.base, #t~mem6#1.offset; {32493#(or (= (+ (select |#length| |~#commands~0.base|) (- 18)) 0) (= (select |#length| |~#commands~0.base|) (select |old(#length)| |~#commands~0.base|)))} is VALID [2022-02-20 23:38:12,905 INFO L290 TraceCheckUtils]: 18: Hoare triple {32493#(or (= (+ (select |#length| |~#commands~0.base|) (- 18)) 0) (= (select |#length| |~#commands~0.base|) (select |old(#length)| |~#commands~0.base|)))} assume true; {32493#(or (= (+ (select |#length| |~#commands~0.base|) (- 18)) 0) (= (select |#length| |~#commands~0.base|) (select |old(#length)| |~#commands~0.base|)))} is VALID [2022-02-20 23:38:12,906 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {32493#(or (= (+ (select |#length| |~#commands~0.base|) (- 18)) 0) (= (select |#length| |~#commands~0.base|) (select |old(#length)| |~#commands~0.base|)))} {32467#(and (<= 0 |~#commands~0.offset|) (= 18 (select |#length| |~#commands~0.base|)) (<= |~#commands~0.offset| 0))} #103#return; {32488#(and (<= (+ |~#commands~0.offset| 18) (select |#length| |~#commands~0.base|)) (<= 0 |~#commands~0.offset|))} is VALID [2022-02-20 23:38:12,907 INFO L290 TraceCheckUtils]: 0: Hoare triple {32444#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(3, 1);call write~init~int(99, 1, 0, 1);call write~init~int(49, 1, 1, 1);call write~init~int(0, 1, 2, 1);call #Ultimate.allocInit(3, 2);call write~init~int(99, 2, 0, 1);call write~init~int(50, 2, 1, 1);call write~init~int(0, 2, 2, 1);call #Ultimate.allocInit(3, 3);call write~init~int(99, 3, 0, 1);call write~init~int(49, 3, 1, 1);call write~init~int(0, 3, 2, 1);call #Ultimate.allocInit(3, 4);call write~init~int(99, 4, 0, 1);call write~init~int(49, 4, 1, 1);call write~init~int(0, 4, 2, 1);call #Ultimate.allocInit(3, 5);call write~init~int(99, 5, 0, 1);call write~init~int(50, 5, 1, 1);call write~init~int(0, 5, 2, 1);~state~0 := ~unnamed3~0~STATE_1;~global~0.base, ~global~0.offset := 0, 0;~#commands~0.base, ~#commands~0.offset := 6, 0;call #Ultimate.allocInit(18, 6);call write~init~$Pointer$(1, 0, ~#commands~0.base, ~#commands~0.offset, 4);call write~init~$Pointer$(#funAddr~c1.base, #funAddr~c1.offset, ~#commands~0.base, 4 + ~#commands~0.offset, 4);call write~init~int((if ~unnamed3~0~STATE_1 % 256 <= 127 then ~unnamed3~0~STATE_1 % 256 else ~unnamed3~0~STATE_1 % 256 - 256), ~#commands~0.base, 8 + ~#commands~0.offset, 1);call write~init~$Pointer$(2, 0, ~#commands~0.base, 9 + ~#commands~0.offset, 4);call write~init~$Pointer$(#funAddr~c2.base, #funAddr~c2.offset, ~#commands~0.base, 13 + ~#commands~0.offset, 4);call write~init~int((if ~unnamed3~0~STATE_2 % 256 <= 127 then ~unnamed3~0~STATE_2 % 256 else ~unnamed3~0~STATE_2 % 256 - 256), ~#commands~0.base, 17 + ~#commands~0.offset, 1); {32446#(and (= 6 |~#commands~0.base|) (= (select |#length| 6) 18) (<= 0 |~#commands~0.offset|) (<= |~#commands~0.offset| 0))} is VALID [2022-02-20 23:38:12,908 INFO L290 TraceCheckUtils]: 1: Hoare triple {32446#(and (= 6 |~#commands~0.base|) (= (select |#length| 6) 18) (<= 0 |~#commands~0.offset|) (<= |~#commands~0.offset| 0))} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1; {32446#(and (= 6 |~#commands~0.base|) (= (select |#length| 6) 18) (<= 0 |~#commands~0.offset|) (<= |~#commands~0.offset| 0))} is VALID [2022-02-20 23:38:12,909 INFO L272 TraceCheckUtils]: 2: Hoare triple {32446#(and (= 6 |~#commands~0.base|) (= (select |#length| 6) 18) (<= 0 |~#commands~0.offset|) (<= |~#commands~0.offset| 0))} call parse_input(3, 0); {32490#(and (= ~global~0.base |old(~global~0.base)|) (= |old(#length)| |#length|) (= |old(~global~0.offset)| ~global~0.offset) (= ~state~0 |old(~state~0)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 23:38:12,909 INFO L290 TraceCheckUtils]: 3: Hoare triple {32490#(and (= ~global~0.base |old(~global~0.base)|) (= |old(#length)| |#length|) (= |old(~global~0.offset)| ~global~0.offset) (= ~state~0 |old(~state~0)|) (= |old(#valid)| |#valid|))} ~input#1.base, ~input#1.offset := #in~input#1.base, #in~input#1.offset;~i~0#1 := 0; {32491#(= |old(#length)| |#length|)} is VALID [2022-02-20 23:38:12,909 INFO L290 TraceCheckUtils]: 4: Hoare triple {32491#(= |old(#length)| |#length|)} assume !!(~i~0#1 < 2); {32491#(= |old(#length)| |#length|)} is VALID [2022-02-20 23:38:12,909 INFO L290 TraceCheckUtils]: 5: Hoare triple {32491#(= |old(#length)| |#length|)} SUMMARY for call #t~mem3#1.base, #t~mem3#1.offset := read~$Pointer$(~#commands~0.base, ~#commands~0.offset + 9 * ~i~0#1, 4); srcloc: L693 {32491#(= |old(#length)| |#length|)} is VALID [2022-02-20 23:38:12,909 INFO L290 TraceCheckUtils]: 6: Hoare triple {32491#(= |old(#length)| |#length|)} assume 1 == #valid[#t~mem3#1.base]; {32491#(= |old(#length)| |#length|)} is VALID [2022-02-20 23:38:12,910 INFO L290 TraceCheckUtils]: 7: Hoare triple {32491#(= |old(#length)| |#length|)} assume #t~mem3#1.offset < #length[#t~mem3#1.base] && #t~mem3#1.offset >= 0; {32491#(= |old(#length)| |#length|)} is VALID [2022-02-20 23:38:12,910 INFO L290 TraceCheckUtils]: 8: Hoare triple {32491#(= |old(#length)| |#length|)} assume 1 == #valid[~input#1.base]; {32491#(= |old(#length)| |#length|)} is VALID [2022-02-20 23:38:12,910 INFO L290 TraceCheckUtils]: 9: Hoare triple {32491#(= |old(#length)| |#length|)} assume ~input#1.offset < #length[~input#1.base] && ~input#1.offset >= 0; {32491#(= |old(#length)| |#length|)} is VALID [2022-02-20 23:38:12,910 INFO L290 TraceCheckUtils]: 10: Hoare triple {32491#(= |old(#length)| |#length|)} assume !(0 == #t~nondet4#1);havoc #t~mem3#1.base, #t~mem3#1.offset;havoc #t~nondet4#1; {32491#(= |old(#length)| |#length|)} is VALID [2022-02-20 23:38:12,911 INFO L290 TraceCheckUtils]: 11: Hoare triple {32491#(= |old(#length)| |#length|)} #t~post2#1 := ~i~0#1;~i~0#1 := 1 + #t~post2#1;havoc #t~post2#1; {32491#(= |old(#length)| |#length|)} is VALID [2022-02-20 23:38:12,911 INFO L290 TraceCheckUtils]: 12: Hoare triple {32491#(= |old(#length)| |#length|)} assume !!(~i~0#1 < 2); {32491#(= |old(#length)| |#length|)} is VALID [2022-02-20 23:38:12,911 INFO L290 TraceCheckUtils]: 13: Hoare triple {32491#(= |old(#length)| |#length|)} SUMMARY for call #t~mem3#1.base, #t~mem3#1.offset := read~$Pointer$(~#commands~0.base, ~#commands~0.offset + 9 * ~i~0#1, 4); srcloc: L693 {32491#(= |old(#length)| |#length|)} is VALID [2022-02-20 23:38:12,911 INFO L290 TraceCheckUtils]: 14: Hoare triple {32491#(= |old(#length)| |#length|)} assume 1 == #valid[#t~mem3#1.base]; {32491#(= |old(#length)| |#length|)} is VALID [2022-02-20 23:38:12,912 INFO L290 TraceCheckUtils]: 15: Hoare triple {32491#(= |old(#length)| |#length|)} assume #t~mem3#1.offset < #length[#t~mem3#1.base] && #t~mem3#1.offset >= 0; {32491#(= |old(#length)| |#length|)} is VALID [2022-02-20 23:38:12,912 INFO L290 TraceCheckUtils]: 16: Hoare triple {32491#(= |old(#length)| |#length|)} assume 1 == #valid[~input#1.base]; {32491#(= |old(#length)| |#length|)} is VALID [2022-02-20 23:38:12,912 INFO L290 TraceCheckUtils]: 17: Hoare triple {32491#(= |old(#length)| |#length|)} assume ~input#1.offset < #length[~input#1.base] && ~input#1.offset >= 0; {32491#(= |old(#length)| |#length|)} is VALID [2022-02-20 23:38:12,912 INFO L290 TraceCheckUtils]: 18: Hoare triple {32491#(= |old(#length)| |#length|)} assume !(0 == #t~nondet4#1);havoc #t~mem3#1.base, #t~mem3#1.offset;havoc #t~nondet4#1; {32491#(= |old(#length)| |#length|)} is VALID [2022-02-20 23:38:12,913 INFO L290 TraceCheckUtils]: 19: Hoare triple {32491#(= |old(#length)| |#length|)} #t~post2#1 := ~i~0#1;~i~0#1 := 1 + #t~post2#1;havoc #t~post2#1; {32491#(= |old(#length)| |#length|)} is VALID [2022-02-20 23:38:12,913 INFO L290 TraceCheckUtils]: 20: Hoare triple {32491#(= |old(#length)| |#length|)} assume !(~i~0#1 < 2); {32491#(= |old(#length)| |#length|)} is VALID [2022-02-20 23:38:12,913 INFO L290 TraceCheckUtils]: 21: Hoare triple {32491#(= |old(#length)| |#length|)} assume true; {32491#(= |old(#length)| |#length|)} is VALID [2022-02-20 23:38:12,914 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {32491#(= |old(#length)| |#length|)} {32446#(and (= 6 |~#commands~0.base|) (= (select |#length| 6) 18) (<= 0 |~#commands~0.offset|) (<= |~#commands~0.offset| 0))} #101#return; {32467#(and (<= 0 |~#commands~0.offset|) (= 18 (select |#length| |~#commands~0.base|)) (<= |~#commands~0.offset| 0))} is VALID [2022-02-20 23:38:12,914 INFO L272 TraceCheckUtils]: 23: Hoare triple {32467#(and (<= 0 |~#commands~0.offset|) (= 18 (select |#length| |~#commands~0.base|)) (<= |~#commands~0.offset| 0))} call parse_input(4, 0); {32490#(and (= ~global~0.base |old(~global~0.base)|) (= |old(#length)| |#length|) (= |old(~global~0.offset)| ~global~0.offset) (= ~state~0 |old(~state~0)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 23:38:12,915 INFO L290 TraceCheckUtils]: 24: Hoare triple {32490#(and (= ~global~0.base |old(~global~0.base)|) (= |old(#length)| |#length|) (= |old(~global~0.offset)| ~global~0.offset) (= ~state~0 |old(~state~0)|) (= |old(#valid)| |#valid|))} ~input#1.base, ~input#1.offset := #in~input#1.base, #in~input#1.offset;~i~0#1 := 0; {32491#(= |old(#length)| |#length|)} is VALID [2022-02-20 23:38:12,915 INFO L290 TraceCheckUtils]: 25: Hoare triple {32491#(= |old(#length)| |#length|)} assume !!(~i~0#1 < 2); {32491#(= |old(#length)| |#length|)} is VALID [2022-02-20 23:38:12,915 INFO L290 TraceCheckUtils]: 26: Hoare triple {32491#(= |old(#length)| |#length|)} SUMMARY for call #t~mem3#1.base, #t~mem3#1.offset := read~$Pointer$(~#commands~0.base, ~#commands~0.offset + 9 * ~i~0#1, 4); srcloc: L693 {32492#(and (= |old(#length)| |#length|) (= (select |#valid| |~#commands~0.base|) 1))} is VALID [2022-02-20 23:38:12,916 INFO L290 TraceCheckUtils]: 27: Hoare triple {32492#(and (= |old(#length)| |#length|) (= (select |#valid| |~#commands~0.base|) 1))} assume 1 == #valid[#t~mem3#1.base]; {32492#(and (= |old(#length)| |#length|) (= (select |#valid| |~#commands~0.base|) 1))} is VALID [2022-02-20 23:38:12,916 INFO L290 TraceCheckUtils]: 28: Hoare triple {32492#(and (= |old(#length)| |#length|) (= (select |#valid| |~#commands~0.base|) 1))} assume #t~mem3#1.offset < #length[#t~mem3#1.base] && #t~mem3#1.offset >= 0; {32492#(and (= |old(#length)| |#length|) (= (select |#valid| |~#commands~0.base|) 1))} is VALID [2022-02-20 23:38:12,916 INFO L290 TraceCheckUtils]: 29: Hoare triple {32492#(and (= |old(#length)| |#length|) (= (select |#valid| |~#commands~0.base|) 1))} assume 1 == #valid[~input#1.base]; {32492#(and (= |old(#length)| |#length|) (= (select |#valid| |~#commands~0.base|) 1))} is VALID [2022-02-20 23:38:12,917 INFO L290 TraceCheckUtils]: 30: Hoare triple {32492#(and (= |old(#length)| |#length|) (= (select |#valid| |~#commands~0.base|) 1))} assume ~input#1.offset < #length[~input#1.base] && ~input#1.offset >= 0; {32492#(and (= |old(#length)| |#length|) (= (select |#valid| |~#commands~0.base|) 1))} is VALID [2022-02-20 23:38:12,917 INFO L290 TraceCheckUtils]: 31: Hoare triple {32492#(and (= |old(#length)| |#length|) (= (select |#valid| |~#commands~0.base|) 1))} assume 0 == #t~nondet4#1;havoc #t~mem3#1.base, #t~mem3#1.offset;havoc #t~nondet4#1; {32492#(and (= |old(#length)| |#length|) (= (select |#valid| |~#commands~0.base|) 1))} is VALID [2022-02-20 23:38:12,917 INFO L290 TraceCheckUtils]: 32: Hoare triple {32492#(and (= |old(#length)| |#length|) (= (select |#valid| |~#commands~0.base|) 1))} SUMMARY for call #t~mem5#1 := read~int(~#commands~0.base, 8 + (~#commands~0.offset + 9 * ~i~0#1), 1); srcloc: L694 {32492#(and (= |old(#length)| |#length|) (= (select |#valid| |~#commands~0.base|) 1))} is VALID [2022-02-20 23:38:12,918 INFO L290 TraceCheckUtils]: 33: Hoare triple {32492#(and (= |old(#length)| |#length|) (= (select |#valid| |~#commands~0.base|) 1))} assume ~state~0 >= #t~mem5#1;havoc #t~mem5#1; {32492#(and (= |old(#length)| |#length|) (= (select |#valid| |~#commands~0.base|) 1))} is VALID [2022-02-20 23:38:12,918 INFO L290 TraceCheckUtils]: 34: Hoare triple {32492#(and (= |old(#length)| |#length|) (= (select |#valid| |~#commands~0.base|) 1))} SUMMARY for call #t~mem6#1.base, #t~mem6#1.offset := read~$Pointer$(~#commands~0.base, 4 + (~#commands~0.offset + 9 * ~i~0#1), 4); srcloc: L695 {32492#(and (= |old(#length)| |#length|) (= (select |#valid| |~#commands~0.base|) 1))} is VALID [2022-02-20 23:38:12,918 INFO L290 TraceCheckUtils]: 35: Hoare triple {32492#(and (= |old(#length)| |#length|) (= (select |#valid| |~#commands~0.base|) 1))} assume { :begin_inline_##fun~~TO~VOID } true;##fun~~TO~VOID_#in~#fp#1.base, ##fun~~TO~VOID_#in~#fp#1.offset := #t~mem6#1.base, #t~mem6#1.offset; {32492#(and (= |old(#length)| |#length|) (= (select |#valid| |~#commands~0.base|) 1))} is VALID [2022-02-20 23:38:12,919 INFO L290 TraceCheckUtils]: 36: Hoare triple {32492#(and (= |old(#length)| |#length|) (= (select |#valid| |~#commands~0.base|) 1))} assume !(##fun~~TO~VOID_#in~#fp#1.base == #funAddr~c2.base && ##fun~~TO~VOID_#in~#fp#1.offset == #funAddr~c2.offset);assume { :begin_inline_c1 } true;havoc c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset, c1_~x~0#1.base, c1_~x~0#1.offset;call c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset := #Ultimate.allocOnHeap(1);c1_~x~0#1.base, c1_~x~0#1.offset := c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset;havoc c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset; {32493#(or (= (+ (select |#length| |~#commands~0.base|) (- 18)) 0) (= (select |#length| |~#commands~0.base|) (select |old(#length)| |~#commands~0.base|)))} is VALID [2022-02-20 23:38:12,920 INFO L290 TraceCheckUtils]: 37: Hoare triple {32493#(or (= (+ (select |#length| |~#commands~0.base|) (- 18)) 0) (= (select |#length| |~#commands~0.base|) (select |old(#length)| |~#commands~0.base|)))} assume !(c1_~x~0#1.base == 0 && c1_~x~0#1.offset == 0); {32493#(or (= (+ (select |#length| |~#commands~0.base|) (- 18)) 0) (= (select |#length| |~#commands~0.base|) (select |old(#length)| |~#commands~0.base|)))} is VALID [2022-02-20 23:38:12,921 INFO L290 TraceCheckUtils]: 38: Hoare triple {32493#(or (= (+ (select |#length| |~#commands~0.base|) (- 18)) 0) (= (select |#length| |~#commands~0.base|) (select |old(#length)| |~#commands~0.base|)))} assume !(~global~0.base != 0 || ~global~0.offset != 0); {32493#(or (= (+ (select |#length| |~#commands~0.base|) (- 18)) 0) (= (select |#length| |~#commands~0.base|) (select |old(#length)| |~#commands~0.base|)))} is VALID [2022-02-20 23:38:12,921 INFO L290 TraceCheckUtils]: 39: Hoare triple {32493#(or (= (+ (select |#length| |~#commands~0.base|) (- 18)) 0) (= (select |#length| |~#commands~0.base|) (select |old(#length)| |~#commands~0.base|)))} ~global~0.base, ~global~0.offset := c1_~x~0#1.base, c1_~x~0#1.offset;~state~0 := ~unnamed3~0~STATE_2; {32493#(or (= (+ (select |#length| |~#commands~0.base|) (- 18)) 0) (= (select |#length| |~#commands~0.base|) (select |old(#length)| |~#commands~0.base|)))} is VALID [2022-02-20 23:38:12,921 INFO L290 TraceCheckUtils]: 40: Hoare triple {32493#(or (= (+ (select |#length| |~#commands~0.base|) (- 18)) 0) (= (select |#length| |~#commands~0.base|) (select |old(#length)| |~#commands~0.base|)))} assume { :end_inline_c1 } true; {32493#(or (= (+ (select |#length| |~#commands~0.base|) (- 18)) 0) (= (select |#length| |~#commands~0.base|) (select |old(#length)| |~#commands~0.base|)))} is VALID [2022-02-20 23:38:12,922 INFO L290 TraceCheckUtils]: 41: Hoare triple {32493#(or (= (+ (select |#length| |~#commands~0.base|) (- 18)) 0) (= (select |#length| |~#commands~0.base|) (select |old(#length)| |~#commands~0.base|)))} assume { :end_inline_##fun~~TO~VOID } true;havoc #t~mem6#1.base, #t~mem6#1.offset; {32493#(or (= (+ (select |#length| |~#commands~0.base|) (- 18)) 0) (= (select |#length| |~#commands~0.base|) (select |old(#length)| |~#commands~0.base|)))} is VALID [2022-02-20 23:38:12,922 INFO L290 TraceCheckUtils]: 42: Hoare triple {32493#(or (= (+ (select |#length| |~#commands~0.base|) (- 18)) 0) (= (select |#length| |~#commands~0.base|) (select |old(#length)| |~#commands~0.base|)))} assume true; {32493#(or (= (+ (select |#length| |~#commands~0.base|) (- 18)) 0) (= (select |#length| |~#commands~0.base|) (select |old(#length)| |~#commands~0.base|)))} is VALID [2022-02-20 23:38:12,923 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {32493#(or (= (+ (select |#length| |~#commands~0.base|) (- 18)) 0) (= (select |#length| |~#commands~0.base|) (select |old(#length)| |~#commands~0.base|)))} {32467#(and (<= 0 |~#commands~0.offset|) (= 18 (select |#length| |~#commands~0.base|)) (<= |~#commands~0.offset| 0))} #103#return; {32488#(and (<= (+ |~#commands~0.offset| 18) (select |#length| |~#commands~0.base|)) (<= 0 |~#commands~0.offset|))} is VALID [2022-02-20 23:38:12,923 INFO L272 TraceCheckUtils]: 44: Hoare triple {32488#(and (<= (+ |~#commands~0.offset| 18) (select |#length| |~#commands~0.base|)) (<= 0 |~#commands~0.offset|))} call parse_input(5, 0); {32488#(and (<= (+ |~#commands~0.offset| 18) (select |#length| |~#commands~0.base|)) (<= 0 |~#commands~0.offset|))} is VALID [2022-02-20 23:38:12,924 INFO L290 TraceCheckUtils]: 45: Hoare triple {32488#(and (<= (+ |~#commands~0.offset| 18) (select |#length| |~#commands~0.base|)) (<= 0 |~#commands~0.offset|))} ~input#1.base, ~input#1.offset := #in~input#1.base, #in~input#1.offset;~i~0#1 := 0; {32489#(and (<= (+ |~#commands~0.offset| 18) (select |#length| |~#commands~0.base|)) (<= 0 |~#commands~0.offset|) (= |parse_input_~i~0#1| 0))} is VALID [2022-02-20 23:38:12,924 INFO L290 TraceCheckUtils]: 46: Hoare triple {32489#(and (<= (+ |~#commands~0.offset| 18) (select |#length| |~#commands~0.base|)) (<= 0 |~#commands~0.offset|) (= |parse_input_~i~0#1| 0))} assume !!(~i~0#1 < 2); {32489#(and (<= (+ |~#commands~0.offset| 18) (select |#length| |~#commands~0.base|)) (<= 0 |~#commands~0.offset|) (= |parse_input_~i~0#1| 0))} is VALID [2022-02-20 23:38:12,924 INFO L290 TraceCheckUtils]: 47: Hoare triple {32489#(and (<= (+ |~#commands~0.offset| 18) (select |#length| |~#commands~0.base|)) (<= 0 |~#commands~0.offset|) (= |parse_input_~i~0#1| 0))} assume !(4 + (~#commands~0.offset + 9 * ~i~0#1) <= #length[~#commands~0.base] && 0 <= ~#commands~0.offset + 9 * ~i~0#1); {32445#false} is VALID [2022-02-20 23:38:12,925 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 10 proven. 11 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-02-20 23:38:12,925 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:38:12,925 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79038775] [2022-02-20 23:38:12,925 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [79038775] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 23:38:12,925 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1295425658] [2022-02-20 23:38:12,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:38:12,925 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:38:12,926 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:38:12,936 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 23:38:12,936 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-02-20 23:38:13,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:38:13,004 INFO L263 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 23 conjunts are in the unsatisfiable core [2022-02-20 23:38:13,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:38:13,019 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:38:13,650 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:38:13,651 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-02-20 23:38:13,716 INFO L290 TraceCheckUtils]: 0: Hoare triple {32444#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(3, 1);call write~init~int(99, 1, 0, 1);call write~init~int(49, 1, 1, 1);call write~init~int(0, 1, 2, 1);call #Ultimate.allocInit(3, 2);call write~init~int(99, 2, 0, 1);call write~init~int(50, 2, 1, 1);call write~init~int(0, 2, 2, 1);call #Ultimate.allocInit(3, 3);call write~init~int(99, 3, 0, 1);call write~init~int(49, 3, 1, 1);call write~init~int(0, 3, 2, 1);call #Ultimate.allocInit(3, 4);call write~init~int(99, 4, 0, 1);call write~init~int(49, 4, 1, 1);call write~init~int(0, 4, 2, 1);call #Ultimate.allocInit(3, 5);call write~init~int(99, 5, 0, 1);call write~init~int(50, 5, 1, 1);call write~init~int(0, 5, 2, 1);~state~0 := ~unnamed3~0~STATE_1;~global~0.base, ~global~0.offset := 0, 0;~#commands~0.base, ~#commands~0.offset := 6, 0;call #Ultimate.allocInit(18, 6);call write~init~$Pointer$(1, 0, ~#commands~0.base, ~#commands~0.offset, 4);call write~init~$Pointer$(#funAddr~c1.base, #funAddr~c1.offset, ~#commands~0.base, 4 + ~#commands~0.offset, 4);call write~init~int((if ~unnamed3~0~STATE_1 % 256 <= 127 then ~unnamed3~0~STATE_1 % 256 else ~unnamed3~0~STATE_1 % 256 - 256), ~#commands~0.base, 8 + ~#commands~0.offset, 1);call write~init~$Pointer$(2, 0, ~#commands~0.base, 9 + ~#commands~0.offset, 4);call write~init~$Pointer$(#funAddr~c2.base, #funAddr~c2.offset, ~#commands~0.base, 13 + ~#commands~0.offset, 4);call write~init~int((if ~unnamed3~0~STATE_2 % 256 <= 127 then ~unnamed3~0~STATE_2 % 256 else ~unnamed3~0~STATE_2 % 256 - 256), ~#commands~0.base, 17 + ~#commands~0.offset, 1); {32497#(and (= 6 |~#commands~0.base|) (<= 18 (select |#length| 6)) (= |~#commands~0.offset| 0) (= (select |#valid| 6) 1))} is VALID [2022-02-20 23:38:13,717 INFO L290 TraceCheckUtils]: 1: Hoare triple {32497#(and (= 6 |~#commands~0.base|) (<= 18 (select |#length| 6)) (= |~#commands~0.offset| 0) (= (select |#valid| 6) 1))} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1; {32497#(and (= 6 |~#commands~0.base|) (<= 18 (select |#length| 6)) (= |~#commands~0.offset| 0) (= (select |#valid| 6) 1))} is VALID [2022-02-20 23:38:13,718 INFO L272 TraceCheckUtils]: 2: Hoare triple {32497#(and (= 6 |~#commands~0.base|) (<= 18 (select |#length| 6)) (= |~#commands~0.offset| 0) (= (select |#valid| 6) 1))} call parse_input(3, 0); {32504#(and (= |old(#length)| |#length|) (= 6 |~#commands~0.base|) (= |~#commands~0.offset| 0) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 23:38:13,718 INFO L290 TraceCheckUtils]: 3: Hoare triple {32504#(and (= |old(#length)| |#length|) (= 6 |~#commands~0.base|) (= |~#commands~0.offset| 0) (= |old(#valid)| |#valid|))} ~input#1.base, ~input#1.offset := #in~input#1.base, #in~input#1.offset;~i~0#1 := 0; {32504#(and (= |old(#length)| |#length|) (= 6 |~#commands~0.base|) (= |~#commands~0.offset| 0) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 23:38:13,718 INFO L290 TraceCheckUtils]: 4: Hoare triple {32504#(and (= |old(#length)| |#length|) (= 6 |~#commands~0.base|) (= |~#commands~0.offset| 0) (= |old(#valid)| |#valid|))} assume !!(~i~0#1 < 2); {32504#(and (= |old(#length)| |#length|) (= 6 |~#commands~0.base|) (= |~#commands~0.offset| 0) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 23:38:13,719 INFO L290 TraceCheckUtils]: 5: Hoare triple {32504#(and (= |old(#length)| |#length|) (= 6 |~#commands~0.base|) (= |~#commands~0.offset| 0) (= |old(#valid)| |#valid|))} SUMMARY for call #t~mem3#1.base, #t~mem3#1.offset := read~$Pointer$(~#commands~0.base, ~#commands~0.offset + 9 * ~i~0#1, 4); srcloc: L693 {32504#(and (= |old(#length)| |#length|) (= 6 |~#commands~0.base|) (= |~#commands~0.offset| 0) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 23:38:13,719 INFO L290 TraceCheckUtils]: 6: Hoare triple {32504#(and (= |old(#length)| |#length|) (= 6 |~#commands~0.base|) (= |~#commands~0.offset| 0) (= |old(#valid)| |#valid|))} assume 1 == #valid[#t~mem3#1.base]; {32504#(and (= |old(#length)| |#length|) (= 6 |~#commands~0.base|) (= |~#commands~0.offset| 0) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 23:38:13,719 INFO L290 TraceCheckUtils]: 7: Hoare triple {32504#(and (= |old(#length)| |#length|) (= 6 |~#commands~0.base|) (= |~#commands~0.offset| 0) (= |old(#valid)| |#valid|))} assume #t~mem3#1.offset < #length[#t~mem3#1.base] && #t~mem3#1.offset >= 0; {32504#(and (= |old(#length)| |#length|) (= 6 |~#commands~0.base|) (= |~#commands~0.offset| 0) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 23:38:13,720 INFO L290 TraceCheckUtils]: 8: Hoare triple {32504#(and (= |old(#length)| |#length|) (= 6 |~#commands~0.base|) (= |~#commands~0.offset| 0) (= |old(#valid)| |#valid|))} assume 1 == #valid[~input#1.base]; {32504#(and (= |old(#length)| |#length|) (= 6 |~#commands~0.base|) (= |~#commands~0.offset| 0) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 23:38:13,720 INFO L290 TraceCheckUtils]: 9: Hoare triple {32504#(and (= |old(#length)| |#length|) (= 6 |~#commands~0.base|) (= |~#commands~0.offset| 0) (= |old(#valid)| |#valid|))} assume ~input#1.offset < #length[~input#1.base] && ~input#1.offset >= 0; {32504#(and (= |old(#length)| |#length|) (= 6 |~#commands~0.base|) (= |~#commands~0.offset| 0) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 23:38:13,721 INFO L290 TraceCheckUtils]: 10: Hoare triple {32504#(and (= |old(#length)| |#length|) (= 6 |~#commands~0.base|) (= |~#commands~0.offset| 0) (= |old(#valid)| |#valid|))} assume !(0 == #t~nondet4#1);havoc #t~mem3#1.base, #t~mem3#1.offset;havoc #t~nondet4#1; {32504#(and (= |old(#length)| |#length|) (= 6 |~#commands~0.base|) (= |~#commands~0.offset| 0) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 23:38:13,721 INFO L290 TraceCheckUtils]: 11: Hoare triple {32504#(and (= |old(#length)| |#length|) (= 6 |~#commands~0.base|) (= |~#commands~0.offset| 0) (= |old(#valid)| |#valid|))} #t~post2#1 := ~i~0#1;~i~0#1 := 1 + #t~post2#1;havoc #t~post2#1; {32504#(and (= |old(#length)| |#length|) (= 6 |~#commands~0.base|) (= |~#commands~0.offset| 0) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 23:38:13,721 INFO L290 TraceCheckUtils]: 12: Hoare triple {32504#(and (= |old(#length)| |#length|) (= 6 |~#commands~0.base|) (= |~#commands~0.offset| 0) (= |old(#valid)| |#valid|))} assume !!(~i~0#1 < 2); {32504#(and (= |old(#length)| |#length|) (= 6 |~#commands~0.base|) (= |~#commands~0.offset| 0) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 23:38:13,722 INFO L290 TraceCheckUtils]: 13: Hoare triple {32504#(and (= |old(#length)| |#length|) (= 6 |~#commands~0.base|) (= |~#commands~0.offset| 0) (= |old(#valid)| |#valid|))} SUMMARY for call #t~mem3#1.base, #t~mem3#1.offset := read~$Pointer$(~#commands~0.base, ~#commands~0.offset + 9 * ~i~0#1, 4); srcloc: L693 {32504#(and (= |old(#length)| |#length|) (= 6 |~#commands~0.base|) (= |~#commands~0.offset| 0) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 23:38:13,722 INFO L290 TraceCheckUtils]: 14: Hoare triple {32504#(and (= |old(#length)| |#length|) (= 6 |~#commands~0.base|) (= |~#commands~0.offset| 0) (= |old(#valid)| |#valid|))} assume 1 == #valid[#t~mem3#1.base]; {32504#(and (= |old(#length)| |#length|) (= 6 |~#commands~0.base|) (= |~#commands~0.offset| 0) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 23:38:13,722 INFO L290 TraceCheckUtils]: 15: Hoare triple {32504#(and (= |old(#length)| |#length|) (= 6 |~#commands~0.base|) (= |~#commands~0.offset| 0) (= |old(#valid)| |#valid|))} assume #t~mem3#1.offset < #length[#t~mem3#1.base] && #t~mem3#1.offset >= 0; {32504#(and (= |old(#length)| |#length|) (= 6 |~#commands~0.base|) (= |~#commands~0.offset| 0) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 23:38:13,723 INFO L290 TraceCheckUtils]: 16: Hoare triple {32504#(and (= |old(#length)| |#length|) (= 6 |~#commands~0.base|) (= |~#commands~0.offset| 0) (= |old(#valid)| |#valid|))} assume 1 == #valid[~input#1.base]; {32504#(and (= |old(#length)| |#length|) (= 6 |~#commands~0.base|) (= |~#commands~0.offset| 0) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 23:38:13,723 INFO L290 TraceCheckUtils]: 17: Hoare triple {32504#(and (= |old(#length)| |#length|) (= 6 |~#commands~0.base|) (= |~#commands~0.offset| 0) (= |old(#valid)| |#valid|))} assume ~input#1.offset < #length[~input#1.base] && ~input#1.offset >= 0; {32504#(and (= |old(#length)| |#length|) (= 6 |~#commands~0.base|) (= |~#commands~0.offset| 0) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 23:38:13,723 INFO L290 TraceCheckUtils]: 18: Hoare triple {32504#(and (= |old(#length)| |#length|) (= 6 |~#commands~0.base|) (= |~#commands~0.offset| 0) (= |old(#valid)| |#valid|))} assume !(0 == #t~nondet4#1);havoc #t~mem3#1.base, #t~mem3#1.offset;havoc #t~nondet4#1; {32504#(and (= |old(#length)| |#length|) (= 6 |~#commands~0.base|) (= |~#commands~0.offset| 0) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 23:38:13,724 INFO L290 TraceCheckUtils]: 19: Hoare triple {32504#(and (= |old(#length)| |#length|) (= 6 |~#commands~0.base|) (= |~#commands~0.offset| 0) (= |old(#valid)| |#valid|))} #t~post2#1 := ~i~0#1;~i~0#1 := 1 + #t~post2#1;havoc #t~post2#1; {32504#(and (= |old(#length)| |#length|) (= 6 |~#commands~0.base|) (= |~#commands~0.offset| 0) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 23:38:13,724 INFO L290 TraceCheckUtils]: 20: Hoare triple {32504#(and (= |old(#length)| |#length|) (= 6 |~#commands~0.base|) (= |~#commands~0.offset| 0) (= |old(#valid)| |#valid|))} assume !(~i~0#1 < 2); {32504#(and (= |old(#length)| |#length|) (= 6 |~#commands~0.base|) (= |~#commands~0.offset| 0) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 23:38:13,725 INFO L290 TraceCheckUtils]: 21: Hoare triple {32504#(and (= |old(#length)| |#length|) (= 6 |~#commands~0.base|) (= |~#commands~0.offset| 0) (= |old(#valid)| |#valid|))} assume true; {32504#(and (= |old(#length)| |#length|) (= 6 |~#commands~0.base|) (= |~#commands~0.offset| 0) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 23:38:13,725 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {32504#(and (= |old(#length)| |#length|) (= 6 |~#commands~0.base|) (= |~#commands~0.offset| 0) (= |old(#valid)| |#valid|))} {32497#(and (= 6 |~#commands~0.base|) (<= 18 (select |#length| 6)) (= |~#commands~0.offset| 0) (= (select |#valid| 6) 1))} #101#return; {32497#(and (= 6 |~#commands~0.base|) (<= 18 (select |#length| 6)) (= |~#commands~0.offset| 0) (= (select |#valid| 6) 1))} is VALID [2022-02-20 23:38:13,726 INFO L272 TraceCheckUtils]: 23: Hoare triple {32497#(and (= 6 |~#commands~0.base|) (<= 18 (select |#length| 6)) (= |~#commands~0.offset| 0) (= (select |#valid| 6) 1))} call parse_input(4, 0); {32504#(and (= |old(#length)| |#length|) (= 6 |~#commands~0.base|) (= |~#commands~0.offset| 0) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 23:38:13,726 INFO L290 TraceCheckUtils]: 24: Hoare triple {32504#(and (= |old(#length)| |#length|) (= 6 |~#commands~0.base|) (= |~#commands~0.offset| 0) (= |old(#valid)| |#valid|))} ~input#1.base, ~input#1.offset := #in~input#1.base, #in~input#1.offset;~i~0#1 := 0; {32504#(and (= |old(#length)| |#length|) (= 6 |~#commands~0.base|) (= |~#commands~0.offset| 0) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 23:38:13,727 INFO L290 TraceCheckUtils]: 25: Hoare triple {32504#(and (= |old(#length)| |#length|) (= 6 |~#commands~0.base|) (= |~#commands~0.offset| 0) (= |old(#valid)| |#valid|))} assume !!(~i~0#1 < 2); {32504#(and (= |old(#length)| |#length|) (= 6 |~#commands~0.base|) (= |~#commands~0.offset| 0) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 23:38:13,727 INFO L290 TraceCheckUtils]: 26: Hoare triple {32504#(and (= |old(#length)| |#length|) (= 6 |~#commands~0.base|) (= |~#commands~0.offset| 0) (= |old(#valid)| |#valid|))} SUMMARY for call #t~mem3#1.base, #t~mem3#1.offset := read~$Pointer$(~#commands~0.base, ~#commands~0.offset + 9 * ~i~0#1, 4); srcloc: L693 {32504#(and (= |old(#length)| |#length|) (= 6 |~#commands~0.base|) (= |~#commands~0.offset| 0) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 23:38:13,727 INFO L290 TraceCheckUtils]: 27: Hoare triple {32504#(and (= |old(#length)| |#length|) (= 6 |~#commands~0.base|) (= |~#commands~0.offset| 0) (= |old(#valid)| |#valid|))} assume 1 == #valid[#t~mem3#1.base]; {32504#(and (= |old(#length)| |#length|) (= 6 |~#commands~0.base|) (= |~#commands~0.offset| 0) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 23:38:13,728 INFO L290 TraceCheckUtils]: 28: Hoare triple {32504#(and (= |old(#length)| |#length|) (= 6 |~#commands~0.base|) (= |~#commands~0.offset| 0) (= |old(#valid)| |#valid|))} assume #t~mem3#1.offset < #length[#t~mem3#1.base] && #t~mem3#1.offset >= 0; {32504#(and (= |old(#length)| |#length|) (= 6 |~#commands~0.base|) (= |~#commands~0.offset| 0) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 23:38:13,728 INFO L290 TraceCheckUtils]: 29: Hoare triple {32504#(and (= |old(#length)| |#length|) (= 6 |~#commands~0.base|) (= |~#commands~0.offset| 0) (= |old(#valid)| |#valid|))} assume 1 == #valid[~input#1.base]; {32504#(and (= |old(#length)| |#length|) (= 6 |~#commands~0.base|) (= |~#commands~0.offset| 0) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 23:38:13,728 INFO L290 TraceCheckUtils]: 30: Hoare triple {32504#(and (= |old(#length)| |#length|) (= 6 |~#commands~0.base|) (= |~#commands~0.offset| 0) (= |old(#valid)| |#valid|))} assume ~input#1.offset < #length[~input#1.base] && ~input#1.offset >= 0; {32504#(and (= |old(#length)| |#length|) (= 6 |~#commands~0.base|) (= |~#commands~0.offset| 0) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 23:38:13,729 INFO L290 TraceCheckUtils]: 31: Hoare triple {32504#(and (= |old(#length)| |#length|) (= 6 |~#commands~0.base|) (= |~#commands~0.offset| 0) (= |old(#valid)| |#valid|))} assume 0 == #t~nondet4#1;havoc #t~mem3#1.base, #t~mem3#1.offset;havoc #t~nondet4#1; {32504#(and (= |old(#length)| |#length|) (= 6 |~#commands~0.base|) (= |~#commands~0.offset| 0) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 23:38:13,729 INFO L290 TraceCheckUtils]: 32: Hoare triple {32504#(and (= |old(#length)| |#length|) (= 6 |~#commands~0.base|) (= |~#commands~0.offset| 0) (= |old(#valid)| |#valid|))} SUMMARY for call #t~mem5#1 := read~int(~#commands~0.base, 8 + (~#commands~0.offset + 9 * ~i~0#1), 1); srcloc: L694 {32504#(and (= |old(#length)| |#length|) (= 6 |~#commands~0.base|) (= |~#commands~0.offset| 0) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 23:38:13,730 INFO L290 TraceCheckUtils]: 33: Hoare triple {32504#(and (= |old(#length)| |#length|) (= 6 |~#commands~0.base|) (= |~#commands~0.offset| 0) (= |old(#valid)| |#valid|))} assume ~state~0 >= #t~mem5#1;havoc #t~mem5#1; {32504#(and (= |old(#length)| |#length|) (= 6 |~#commands~0.base|) (= |~#commands~0.offset| 0) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 23:38:13,730 INFO L290 TraceCheckUtils]: 34: Hoare triple {32504#(and (= |old(#length)| |#length|) (= 6 |~#commands~0.base|) (= |~#commands~0.offset| 0) (= |old(#valid)| |#valid|))} SUMMARY for call #t~mem6#1.base, #t~mem6#1.offset := read~$Pointer$(~#commands~0.base, 4 + (~#commands~0.offset + 9 * ~i~0#1), 4); srcloc: L695 {32504#(and (= |old(#length)| |#length|) (= 6 |~#commands~0.base|) (= |~#commands~0.offset| 0) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 23:38:13,730 INFO L290 TraceCheckUtils]: 35: Hoare triple {32504#(and (= |old(#length)| |#length|) (= 6 |~#commands~0.base|) (= |~#commands~0.offset| 0) (= |old(#valid)| |#valid|))} assume { :begin_inline_##fun~~TO~VOID } true;##fun~~TO~VOID_#in~#fp#1.base, ##fun~~TO~VOID_#in~#fp#1.offset := #t~mem6#1.base, #t~mem6#1.offset; {32504#(and (= |old(#length)| |#length|) (= 6 |~#commands~0.base|) (= |~#commands~0.offset| 0) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 23:38:13,731 INFO L290 TraceCheckUtils]: 36: Hoare triple {32504#(and (= |old(#length)| |#length|) (= 6 |~#commands~0.base|) (= |~#commands~0.offset| 0) (= |old(#valid)| |#valid|))} assume !(##fun~~TO~VOID_#in~#fp#1.base == #funAddr~c2.base && ##fun~~TO~VOID_#in~#fp#1.offset == #funAddr~c2.offset);assume { :begin_inline_c1 } true;havoc c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset, c1_~x~0#1.base, c1_~x~0#1.offset;call c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset := #Ultimate.allocOnHeap(1);c1_~x~0#1.base, c1_~x~0#1.offset := c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset;havoc c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset; {32607#(and (exists ((|parse_input_c1_~x~0#1.base| Int) (v_ArrVal_80 Int)) (and (= |#length| (store |old(#length)| |parse_input_c1_~x~0#1.base| v_ArrVal_80)) (= (select |old(#valid)| |parse_input_c1_~x~0#1.base|) 0))) (= 6 |~#commands~0.base|) (= |~#commands~0.offset| 0))} is VALID [2022-02-20 23:38:13,732 INFO L290 TraceCheckUtils]: 37: Hoare triple {32607#(and (exists ((|parse_input_c1_~x~0#1.base| Int) (v_ArrVal_80 Int)) (and (= |#length| (store |old(#length)| |parse_input_c1_~x~0#1.base| v_ArrVal_80)) (= (select |old(#valid)| |parse_input_c1_~x~0#1.base|) 0))) (= 6 |~#commands~0.base|) (= |~#commands~0.offset| 0))} assume !(c1_~x~0#1.base == 0 && c1_~x~0#1.offset == 0); {32607#(and (exists ((|parse_input_c1_~x~0#1.base| Int) (v_ArrVal_80 Int)) (and (= |#length| (store |old(#length)| |parse_input_c1_~x~0#1.base| v_ArrVal_80)) (= (select |old(#valid)| |parse_input_c1_~x~0#1.base|) 0))) (= 6 |~#commands~0.base|) (= |~#commands~0.offset| 0))} is VALID [2022-02-20 23:38:13,732 INFO L290 TraceCheckUtils]: 38: Hoare triple {32607#(and (exists ((|parse_input_c1_~x~0#1.base| Int) (v_ArrVal_80 Int)) (and (= |#length| (store |old(#length)| |parse_input_c1_~x~0#1.base| v_ArrVal_80)) (= (select |old(#valid)| |parse_input_c1_~x~0#1.base|) 0))) (= 6 |~#commands~0.base|) (= |~#commands~0.offset| 0))} assume !(~global~0.base != 0 || ~global~0.offset != 0); {32607#(and (exists ((|parse_input_c1_~x~0#1.base| Int) (v_ArrVal_80 Int)) (and (= |#length| (store |old(#length)| |parse_input_c1_~x~0#1.base| v_ArrVal_80)) (= (select |old(#valid)| |parse_input_c1_~x~0#1.base|) 0))) (= 6 |~#commands~0.base|) (= |~#commands~0.offset| 0))} is VALID [2022-02-20 23:38:13,733 INFO L290 TraceCheckUtils]: 39: Hoare triple {32607#(and (exists ((|parse_input_c1_~x~0#1.base| Int) (v_ArrVal_80 Int)) (and (= |#length| (store |old(#length)| |parse_input_c1_~x~0#1.base| v_ArrVal_80)) (= (select |old(#valid)| |parse_input_c1_~x~0#1.base|) 0))) (= 6 |~#commands~0.base|) (= |~#commands~0.offset| 0))} ~global~0.base, ~global~0.offset := c1_~x~0#1.base, c1_~x~0#1.offset;~state~0 := ~unnamed3~0~STATE_2; {32607#(and (exists ((|parse_input_c1_~x~0#1.base| Int) (v_ArrVal_80 Int)) (and (= |#length| (store |old(#length)| |parse_input_c1_~x~0#1.base| v_ArrVal_80)) (= (select |old(#valid)| |parse_input_c1_~x~0#1.base|) 0))) (= 6 |~#commands~0.base|) (= |~#commands~0.offset| 0))} is VALID [2022-02-20 23:38:13,733 INFO L290 TraceCheckUtils]: 40: Hoare triple {32607#(and (exists ((|parse_input_c1_~x~0#1.base| Int) (v_ArrVal_80 Int)) (and (= |#length| (store |old(#length)| |parse_input_c1_~x~0#1.base| v_ArrVal_80)) (= (select |old(#valid)| |parse_input_c1_~x~0#1.base|) 0))) (= 6 |~#commands~0.base|) (= |~#commands~0.offset| 0))} assume { :end_inline_c1 } true; {32607#(and (exists ((|parse_input_c1_~x~0#1.base| Int) (v_ArrVal_80 Int)) (and (= |#length| (store |old(#length)| |parse_input_c1_~x~0#1.base| v_ArrVal_80)) (= (select |old(#valid)| |parse_input_c1_~x~0#1.base|) 0))) (= 6 |~#commands~0.base|) (= |~#commands~0.offset| 0))} is VALID [2022-02-20 23:38:13,734 INFO L290 TraceCheckUtils]: 41: Hoare triple {32607#(and (exists ((|parse_input_c1_~x~0#1.base| Int) (v_ArrVal_80 Int)) (and (= |#length| (store |old(#length)| |parse_input_c1_~x~0#1.base| v_ArrVal_80)) (= (select |old(#valid)| |parse_input_c1_~x~0#1.base|) 0))) (= 6 |~#commands~0.base|) (= |~#commands~0.offset| 0))} assume { :end_inline_##fun~~TO~VOID } true;havoc #t~mem6#1.base, #t~mem6#1.offset; {32607#(and (exists ((|parse_input_c1_~x~0#1.base| Int) (v_ArrVal_80 Int)) (and (= |#length| (store |old(#length)| |parse_input_c1_~x~0#1.base| v_ArrVal_80)) (= (select |old(#valid)| |parse_input_c1_~x~0#1.base|) 0))) (= 6 |~#commands~0.base|) (= |~#commands~0.offset| 0))} is VALID [2022-02-20 23:38:13,734 INFO L290 TraceCheckUtils]: 42: Hoare triple {32607#(and (exists ((|parse_input_c1_~x~0#1.base| Int) (v_ArrVal_80 Int)) (and (= |#length| (store |old(#length)| |parse_input_c1_~x~0#1.base| v_ArrVal_80)) (= (select |old(#valid)| |parse_input_c1_~x~0#1.base|) 0))) (= 6 |~#commands~0.base|) (= |~#commands~0.offset| 0))} assume true; {32607#(and (exists ((|parse_input_c1_~x~0#1.base| Int) (v_ArrVal_80 Int)) (and (= |#length| (store |old(#length)| |parse_input_c1_~x~0#1.base| v_ArrVal_80)) (= (select |old(#valid)| |parse_input_c1_~x~0#1.base|) 0))) (= 6 |~#commands~0.base|) (= |~#commands~0.offset| 0))} is VALID [2022-02-20 23:38:13,735 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {32607#(and (exists ((|parse_input_c1_~x~0#1.base| Int) (v_ArrVal_80 Int)) (and (= |#length| (store |old(#length)| |parse_input_c1_~x~0#1.base| v_ArrVal_80)) (= (select |old(#valid)| |parse_input_c1_~x~0#1.base|) 0))) (= 6 |~#commands~0.base|) (= |~#commands~0.offset| 0))} {32497#(and (= 6 |~#commands~0.base|) (<= 18 (select |#length| 6)) (= |~#commands~0.offset| 0) (= (select |#valid| 6) 1))} #103#return; {32629#(and (= 6 |~#commands~0.base|) (<= 18 (select |#length| 6)) (= |~#commands~0.offset| 0))} is VALID [2022-02-20 23:38:13,736 INFO L272 TraceCheckUtils]: 44: Hoare triple {32629#(and (= 6 |~#commands~0.base|) (<= 18 (select |#length| 6)) (= |~#commands~0.offset| 0))} call parse_input(5, 0); {32629#(and (= 6 |~#commands~0.base|) (<= 18 (select |#length| 6)) (= |~#commands~0.offset| 0))} is VALID [2022-02-20 23:38:13,736 INFO L290 TraceCheckUtils]: 45: Hoare triple {32629#(and (= 6 |~#commands~0.base|) (<= 18 (select |#length| 6)) (= |~#commands~0.offset| 0))} ~input#1.base, ~input#1.offset := #in~input#1.base, #in~input#1.offset;~i~0#1 := 0; {32636#(and (= 6 |~#commands~0.base|) (<= 18 (select |#length| 6)) (= |~#commands~0.offset| 0) (= |parse_input_~i~0#1| 0))} is VALID [2022-02-20 23:38:13,736 INFO L290 TraceCheckUtils]: 46: Hoare triple {32636#(and (= 6 |~#commands~0.base|) (<= 18 (select |#length| 6)) (= |~#commands~0.offset| 0) (= |parse_input_~i~0#1| 0))} assume !!(~i~0#1 < 2); {32636#(and (= 6 |~#commands~0.base|) (<= 18 (select |#length| 6)) (= |~#commands~0.offset| 0) (= |parse_input_~i~0#1| 0))} is VALID [2022-02-20 23:38:13,737 INFO L290 TraceCheckUtils]: 47: Hoare triple {32636#(and (= 6 |~#commands~0.base|) (<= 18 (select |#length| 6)) (= |~#commands~0.offset| 0) (= |parse_input_~i~0#1| 0))} assume !(4 + (~#commands~0.offset + 9 * ~i~0#1) <= #length[~#commands~0.base] && 0 <= ~#commands~0.offset + 9 * ~i~0#1); {32445#false} is VALID [2022-02-20 23:38:13,737 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-02-20 23:38:13,737 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:38:13,912 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1295425658] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 23:38:13,912 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 23:38:13,912 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 13 [2022-02-20 23:38:13,912 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27051707] [2022-02-20 23:38:13,912 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 23:38:13,912 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 4.6923076923076925) internal successors, (61), 10 states have internal predecessors, (61), 5 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 48 [2022-02-20 23:38:13,914 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:38:13,914 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 15 states, 13 states have (on average 4.6923076923076925) internal successors, (61), 10 states have internal predecessors, (61), 5 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-02-20 23:38:13,962 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:38:13,962 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-02-20 23:38:13,962 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:38:13,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-02-20 23:38:13,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=243, Unknown=0, NotChecked=0, Total=306 [2022-02-20 23:38:13,963 INFO L87 Difference]: Start difference. First operand 425 states and 537 transitions. Second operand has 15 states, 13 states have (on average 4.6923076923076925) internal successors, (61), 10 states have internal predecessors, (61), 5 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-02-20 23:38:14,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:38:14,981 INFO L93 Difference]: Finished difference Result 515 states and 610 transitions. [2022-02-20 23:38:14,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-02-20 23:38:14,981 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 4.6923076923076925) internal successors, (61), 10 states have internal predecessors, (61), 5 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 48 [2022-02-20 23:38:14,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:38:14,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 13 states have (on average 4.6923076923076925) internal successors, (61), 10 states have internal predecessors, (61), 5 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-02-20 23:38:14,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 225 transitions. [2022-02-20 23:38:14,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 13 states have (on average 4.6923076923076925) internal successors, (61), 10 states have internal predecessors, (61), 5 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-02-20 23:38:14,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 225 transitions. [2022-02-20 23:38:14,984 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states and 225 transitions. [2022-02-20 23:38:15,163 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 225 edges. 225 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:38:15,172 INFO L225 Difference]: With dead ends: 515 [2022-02-20 23:38:15,172 INFO L226 Difference]: Without dead ends: 515 [2022-02-20 23:38:15,172 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=242, Invalid=688, Unknown=0, NotChecked=0, Total=930 [2022-02-20 23:38:15,172 INFO L933 BasicCegarLoop]: 48 mSDtfsCounter, 535 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 269 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 535 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 432 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 101 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 23:38:15,172 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [535 Valid, 325 Invalid, 432 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 269 Invalid, 0 Unknown, 101 Unchecked, 0.2s Time] [2022-02-20 23:38:15,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states. [2022-02-20 23:38:15,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 429. [2022-02-20 23:38:15,177 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:38:15,177 INFO L82 GeneralOperation]: Start isEquivalent. First operand 515 states. Second operand has 429 states, 390 states have (on average 1.3051282051282052) internal successors, (509), 410 states have internal predecessors, (509), 9 states have call successors, (9), 9 states have call predecessors, (9), 16 states have return successors, (21), 9 states have call predecessors, (21), 9 states have call successors, (21) [2022-02-20 23:38:15,178 INFO L74 IsIncluded]: Start isIncluded. First operand 515 states. Second operand has 429 states, 390 states have (on average 1.3051282051282052) internal successors, (509), 410 states have internal predecessors, (509), 9 states have call successors, (9), 9 states have call predecessors, (9), 16 states have return successors, (21), 9 states have call predecessors, (21), 9 states have call successors, (21) [2022-02-20 23:38:15,178 INFO L87 Difference]: Start difference. First operand 515 states. Second operand has 429 states, 390 states have (on average 1.3051282051282052) internal successors, (509), 410 states have internal predecessors, (509), 9 states have call successors, (9), 9 states have call predecessors, (9), 16 states have return successors, (21), 9 states have call predecessors, (21), 9 states have call successors, (21) [2022-02-20 23:38:15,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:38:15,186 INFO L93 Difference]: Finished difference Result 515 states and 610 transitions. [2022-02-20 23:38:15,186 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 610 transitions. [2022-02-20 23:38:15,187 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:38:15,187 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:38:15,187 INFO L74 IsIncluded]: Start isIncluded. First operand has 429 states, 390 states have (on average 1.3051282051282052) internal successors, (509), 410 states have internal predecessors, (509), 9 states have call successors, (9), 9 states have call predecessors, (9), 16 states have return successors, (21), 9 states have call predecessors, (21), 9 states have call successors, (21) Second operand 515 states. [2022-02-20 23:38:15,188 INFO L87 Difference]: Start difference. First operand has 429 states, 390 states have (on average 1.3051282051282052) internal successors, (509), 410 states have internal predecessors, (509), 9 states have call successors, (9), 9 states have call predecessors, (9), 16 states have return successors, (21), 9 states have call predecessors, (21), 9 states have call successors, (21) Second operand 515 states. [2022-02-20 23:38:15,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:38:15,196 INFO L93 Difference]: Finished difference Result 515 states and 610 transitions. [2022-02-20 23:38:15,196 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 610 transitions. [2022-02-20 23:38:15,197 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:38:15,197 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:38:15,197 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:38:15,197 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:38:15,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 429 states, 390 states have (on average 1.3051282051282052) internal successors, (509), 410 states have internal predecessors, (509), 9 states have call successors, (9), 9 states have call predecessors, (9), 16 states have return successors, (21), 9 states have call predecessors, (21), 9 states have call successors, (21) [2022-02-20 23:38:15,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 539 transitions. [2022-02-20 23:38:15,204 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 539 transitions. Word has length 48 [2022-02-20 23:38:15,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:38:15,204 INFO L470 AbstractCegarLoop]: Abstraction has 429 states and 539 transitions. [2022-02-20 23:38:15,204 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 4.6923076923076925) internal successors, (61), 10 states have internal predecessors, (61), 5 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-02-20 23:38:15,204 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 539 transitions. [2022-02-20 23:38:15,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-02-20 23:38:15,205 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:38:15,205 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:38:15,227 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-02-20 23:38:15,421 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:38:15,421 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting parse_inputErr10ASSERT_VIOLATIONMEMORY_FREE === [parse_inputErr0REQUIRES_VIOLATION, parse_inputErr1REQUIRES_VIOLATION, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2022-02-20 23:38:15,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:38:15,422 INFO L85 PathProgramCache]: Analyzing trace with hash -639148643, now seen corresponding path program 1 times [2022-02-20 23:38:15,422 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:38:15,422 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925050578] [2022-02-20 23:38:15,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:38:15,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:38:15,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:38:15,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 23:38:15,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:38:15,473 INFO L290 TraceCheckUtils]: 0: Hoare triple {34683#(and (= ~global~0.base |old(~global~0.base)|) (= |old(#length)| |#length|) (= |old(~global~0.offset)| ~global~0.offset) (= ~state~0 |old(~state~0)|) (= |old(#valid)| |#valid|))} ~input#1.base, ~input#1.offset := #in~input#1.base, #in~input#1.offset;~i~0#1 := 0; {34660#true} is VALID [2022-02-20 23:38:15,474 INFO L290 TraceCheckUtils]: 1: Hoare triple {34660#true} assume !!(~i~0#1 < 2); {34660#true} is VALID [2022-02-20 23:38:15,474 INFO L290 TraceCheckUtils]: 2: Hoare triple {34660#true} SUMMARY for call #t~mem3#1.base, #t~mem3#1.offset := read~$Pointer$(~#commands~0.base, ~#commands~0.offset + 9 * ~i~0#1, 4); srcloc: L693 {34660#true} is VALID [2022-02-20 23:38:15,474 INFO L290 TraceCheckUtils]: 3: Hoare triple {34660#true} assume 1 == #valid[#t~mem3#1.base]; {34660#true} is VALID [2022-02-20 23:38:15,474 INFO L290 TraceCheckUtils]: 4: Hoare triple {34660#true} assume #t~mem3#1.offset < #length[#t~mem3#1.base] && #t~mem3#1.offset >= 0; {34660#true} is VALID [2022-02-20 23:38:15,474 INFO L290 TraceCheckUtils]: 5: Hoare triple {34660#true} assume 1 == #valid[~input#1.base]; {34660#true} is VALID [2022-02-20 23:38:15,474 INFO L290 TraceCheckUtils]: 6: Hoare triple {34660#true} assume ~input#1.offset < #length[~input#1.base] && ~input#1.offset >= 0; {34660#true} is VALID [2022-02-20 23:38:15,474 INFO L290 TraceCheckUtils]: 7: Hoare triple {34660#true} assume 0 == #t~nondet4#1;havoc #t~mem3#1.base, #t~mem3#1.offset;havoc #t~nondet4#1; {34660#true} is VALID [2022-02-20 23:38:15,474 INFO L290 TraceCheckUtils]: 8: Hoare triple {34660#true} SUMMARY for call #t~mem5#1 := read~int(~#commands~0.base, 8 + (~#commands~0.offset + 9 * ~i~0#1), 1); srcloc: L694 {34660#true} is VALID [2022-02-20 23:38:15,475 INFO L290 TraceCheckUtils]: 9: Hoare triple {34660#true} assume ~state~0 >= #t~mem5#1;havoc #t~mem5#1; {34660#true} is VALID [2022-02-20 23:38:15,475 INFO L290 TraceCheckUtils]: 10: Hoare triple {34660#true} SUMMARY for call #t~mem6#1.base, #t~mem6#1.offset := read~$Pointer$(~#commands~0.base, 4 + (~#commands~0.offset + 9 * ~i~0#1), 4); srcloc: L695 {34660#true} is VALID [2022-02-20 23:38:15,475 INFO L290 TraceCheckUtils]: 11: Hoare triple {34660#true} assume { :begin_inline_##fun~~TO~VOID } true;##fun~~TO~VOID_#in~#fp#1.base, ##fun~~TO~VOID_#in~#fp#1.offset := #t~mem6#1.base, #t~mem6#1.offset; {34660#true} is VALID [2022-02-20 23:38:15,475 INFO L290 TraceCheckUtils]: 12: Hoare triple {34660#true} assume !(##fun~~TO~VOID_#in~#fp#1.base == #funAddr~c2.base && ##fun~~TO~VOID_#in~#fp#1.offset == #funAddr~c2.offset);assume { :begin_inline_c1 } true;havoc c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset, c1_~x~0#1.base, c1_~x~0#1.offset;call c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset := #Ultimate.allocOnHeap(1);c1_~x~0#1.base, c1_~x~0#1.offset := c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset;havoc c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset; {34660#true} is VALID [2022-02-20 23:38:15,475 INFO L290 TraceCheckUtils]: 13: Hoare triple {34660#true} assume !(c1_~x~0#1.base == 0 && c1_~x~0#1.offset == 0); {34660#true} is VALID [2022-02-20 23:38:15,475 INFO L290 TraceCheckUtils]: 14: Hoare triple {34660#true} assume !(~global~0.base != 0 || ~global~0.offset != 0); {34660#true} is VALID [2022-02-20 23:38:15,475 INFO L290 TraceCheckUtils]: 15: Hoare triple {34660#true} ~global~0.base, ~global~0.offset := c1_~x~0#1.base, c1_~x~0#1.offset;~state~0 := ~unnamed3~0~STATE_2; {34660#true} is VALID [2022-02-20 23:38:15,475 INFO L290 TraceCheckUtils]: 16: Hoare triple {34660#true} assume { :end_inline_c1 } true; {34660#true} is VALID [2022-02-20 23:38:15,476 INFO L290 TraceCheckUtils]: 17: Hoare triple {34660#true} assume { :end_inline_##fun~~TO~VOID } true;havoc #t~mem6#1.base, #t~mem6#1.offset; {34660#true} is VALID [2022-02-20 23:38:15,476 INFO L290 TraceCheckUtils]: 18: Hoare triple {34660#true} assume true; {34660#true} is VALID [2022-02-20 23:38:15,476 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {34660#true} {34660#true} #101#return; {34660#true} is VALID [2022-02-20 23:38:15,476 INFO L290 TraceCheckUtils]: 0: Hoare triple {34660#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(3, 1);call write~init~int(99, 1, 0, 1);call write~init~int(49, 1, 1, 1);call write~init~int(0, 1, 2, 1);call #Ultimate.allocInit(3, 2);call write~init~int(99, 2, 0, 1);call write~init~int(50, 2, 1, 1);call write~init~int(0, 2, 2, 1);call #Ultimate.allocInit(3, 3);call write~init~int(99, 3, 0, 1);call write~init~int(49, 3, 1, 1);call write~init~int(0, 3, 2, 1);call #Ultimate.allocInit(3, 4);call write~init~int(99, 4, 0, 1);call write~init~int(49, 4, 1, 1);call write~init~int(0, 4, 2, 1);call #Ultimate.allocInit(3, 5);call write~init~int(99, 5, 0, 1);call write~init~int(50, 5, 1, 1);call write~init~int(0, 5, 2, 1);~state~0 := ~unnamed3~0~STATE_1;~global~0.base, ~global~0.offset := 0, 0;~#commands~0.base, ~#commands~0.offset := 6, 0;call #Ultimate.allocInit(18, 6);call write~init~$Pointer$(1, 0, ~#commands~0.base, ~#commands~0.offset, 4);call write~init~$Pointer$(#funAddr~c1.base, #funAddr~c1.offset, ~#commands~0.base, 4 + ~#commands~0.offset, 4);call write~init~int((if ~unnamed3~0~STATE_1 % 256 <= 127 then ~unnamed3~0~STATE_1 % 256 else ~unnamed3~0~STATE_1 % 256 - 256), ~#commands~0.base, 8 + ~#commands~0.offset, 1);call write~init~$Pointer$(2, 0, ~#commands~0.base, 9 + ~#commands~0.offset, 4);call write~init~$Pointer$(#funAddr~c2.base, #funAddr~c2.offset, ~#commands~0.base, 13 + ~#commands~0.offset, 4);call write~init~int((if ~unnamed3~0~STATE_2 % 256 <= 127 then ~unnamed3~0~STATE_2 % 256 else ~unnamed3~0~STATE_2 % 256 - 256), ~#commands~0.base, 17 + ~#commands~0.offset, 1); {34660#true} is VALID [2022-02-20 23:38:15,476 INFO L290 TraceCheckUtils]: 1: Hoare triple {34660#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1; {34660#true} is VALID [2022-02-20 23:38:15,477 INFO L272 TraceCheckUtils]: 2: Hoare triple {34660#true} call parse_input(3, 0); {34683#(and (= ~global~0.base |old(~global~0.base)|) (= |old(#length)| |#length|) (= |old(~global~0.offset)| ~global~0.offset) (= ~state~0 |old(~state~0)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 23:38:15,477 INFO L290 TraceCheckUtils]: 3: Hoare triple {34683#(and (= ~global~0.base |old(~global~0.base)|) (= |old(#length)| |#length|) (= |old(~global~0.offset)| ~global~0.offset) (= ~state~0 |old(~state~0)|) (= |old(#valid)| |#valid|))} ~input#1.base, ~input#1.offset := #in~input#1.base, #in~input#1.offset;~i~0#1 := 0; {34660#true} is VALID [2022-02-20 23:38:15,477 INFO L290 TraceCheckUtils]: 4: Hoare triple {34660#true} assume !!(~i~0#1 < 2); {34660#true} is VALID [2022-02-20 23:38:15,477 INFO L290 TraceCheckUtils]: 5: Hoare triple {34660#true} SUMMARY for call #t~mem3#1.base, #t~mem3#1.offset := read~$Pointer$(~#commands~0.base, ~#commands~0.offset + 9 * ~i~0#1, 4); srcloc: L693 {34660#true} is VALID [2022-02-20 23:38:15,477 INFO L290 TraceCheckUtils]: 6: Hoare triple {34660#true} assume 1 == #valid[#t~mem3#1.base]; {34660#true} is VALID [2022-02-20 23:38:15,477 INFO L290 TraceCheckUtils]: 7: Hoare triple {34660#true} assume #t~mem3#1.offset < #length[#t~mem3#1.base] && #t~mem3#1.offset >= 0; {34660#true} is VALID [2022-02-20 23:38:15,477 INFO L290 TraceCheckUtils]: 8: Hoare triple {34660#true} assume 1 == #valid[~input#1.base]; {34660#true} is VALID [2022-02-20 23:38:15,477 INFO L290 TraceCheckUtils]: 9: Hoare triple {34660#true} assume ~input#1.offset < #length[~input#1.base] && ~input#1.offset >= 0; {34660#true} is VALID [2022-02-20 23:38:15,478 INFO L290 TraceCheckUtils]: 10: Hoare triple {34660#true} assume 0 == #t~nondet4#1;havoc #t~mem3#1.base, #t~mem3#1.offset;havoc #t~nondet4#1; {34660#true} is VALID [2022-02-20 23:38:15,478 INFO L290 TraceCheckUtils]: 11: Hoare triple {34660#true} SUMMARY for call #t~mem5#1 := read~int(~#commands~0.base, 8 + (~#commands~0.offset + 9 * ~i~0#1), 1); srcloc: L694 {34660#true} is VALID [2022-02-20 23:38:15,478 INFO L290 TraceCheckUtils]: 12: Hoare triple {34660#true} assume ~state~0 >= #t~mem5#1;havoc #t~mem5#1; {34660#true} is VALID [2022-02-20 23:38:15,478 INFO L290 TraceCheckUtils]: 13: Hoare triple {34660#true} SUMMARY for call #t~mem6#1.base, #t~mem6#1.offset := read~$Pointer$(~#commands~0.base, 4 + (~#commands~0.offset + 9 * ~i~0#1), 4); srcloc: L695 {34660#true} is VALID [2022-02-20 23:38:15,478 INFO L290 TraceCheckUtils]: 14: Hoare triple {34660#true} assume { :begin_inline_##fun~~TO~VOID } true;##fun~~TO~VOID_#in~#fp#1.base, ##fun~~TO~VOID_#in~#fp#1.offset := #t~mem6#1.base, #t~mem6#1.offset; {34660#true} is VALID [2022-02-20 23:38:15,478 INFO L290 TraceCheckUtils]: 15: Hoare triple {34660#true} assume !(##fun~~TO~VOID_#in~#fp#1.base == #funAddr~c2.base && ##fun~~TO~VOID_#in~#fp#1.offset == #funAddr~c2.offset);assume { :begin_inline_c1 } true;havoc c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset, c1_~x~0#1.base, c1_~x~0#1.offset;call c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset := #Ultimate.allocOnHeap(1);c1_~x~0#1.base, c1_~x~0#1.offset := c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset;havoc c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset; {34660#true} is VALID [2022-02-20 23:38:15,478 INFO L290 TraceCheckUtils]: 16: Hoare triple {34660#true} assume !(c1_~x~0#1.base == 0 && c1_~x~0#1.offset == 0); {34660#true} is VALID [2022-02-20 23:38:15,478 INFO L290 TraceCheckUtils]: 17: Hoare triple {34660#true} assume !(~global~0.base != 0 || ~global~0.offset != 0); {34660#true} is VALID [2022-02-20 23:38:15,478 INFO L290 TraceCheckUtils]: 18: Hoare triple {34660#true} ~global~0.base, ~global~0.offset := c1_~x~0#1.base, c1_~x~0#1.offset;~state~0 := ~unnamed3~0~STATE_2; {34660#true} is VALID [2022-02-20 23:38:15,479 INFO L290 TraceCheckUtils]: 19: Hoare triple {34660#true} assume { :end_inline_c1 } true; {34660#true} is VALID [2022-02-20 23:38:15,479 INFO L290 TraceCheckUtils]: 20: Hoare triple {34660#true} assume { :end_inline_##fun~~TO~VOID } true;havoc #t~mem6#1.base, #t~mem6#1.offset; {34660#true} is VALID [2022-02-20 23:38:15,479 INFO L290 TraceCheckUtils]: 21: Hoare triple {34660#true} assume true; {34660#true} is VALID [2022-02-20 23:38:15,479 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {34660#true} {34660#true} #101#return; {34660#true} is VALID [2022-02-20 23:38:15,479 INFO L272 TraceCheckUtils]: 23: Hoare triple {34660#true} call parse_input(4, 0); {34660#true} is VALID [2022-02-20 23:38:15,479 INFO L290 TraceCheckUtils]: 24: Hoare triple {34660#true} ~input#1.base, ~input#1.offset := #in~input#1.base, #in~input#1.offset;~i~0#1 := 0; {34660#true} is VALID [2022-02-20 23:38:15,479 INFO L290 TraceCheckUtils]: 25: Hoare triple {34660#true} assume !!(~i~0#1 < 2); {34660#true} is VALID [2022-02-20 23:38:15,479 INFO L290 TraceCheckUtils]: 26: Hoare triple {34660#true} SUMMARY for call #t~mem3#1.base, #t~mem3#1.offset := read~$Pointer$(~#commands~0.base, ~#commands~0.offset + 9 * ~i~0#1, 4); srcloc: L693 {34660#true} is VALID [2022-02-20 23:38:15,479 INFO L290 TraceCheckUtils]: 27: Hoare triple {34660#true} assume 1 == #valid[#t~mem3#1.base]; {34660#true} is VALID [2022-02-20 23:38:15,480 INFO L290 TraceCheckUtils]: 28: Hoare triple {34660#true} assume #t~mem3#1.offset < #length[#t~mem3#1.base] && #t~mem3#1.offset >= 0; {34660#true} is VALID [2022-02-20 23:38:15,480 INFO L290 TraceCheckUtils]: 29: Hoare triple {34660#true} assume 1 == #valid[~input#1.base]; {34660#true} is VALID [2022-02-20 23:38:15,480 INFO L290 TraceCheckUtils]: 30: Hoare triple {34660#true} assume ~input#1.offset < #length[~input#1.base] && ~input#1.offset >= 0; {34660#true} is VALID [2022-02-20 23:38:15,480 INFO L290 TraceCheckUtils]: 31: Hoare triple {34660#true} assume !(0 == #t~nondet4#1);havoc #t~mem3#1.base, #t~mem3#1.offset;havoc #t~nondet4#1; {34660#true} is VALID [2022-02-20 23:38:15,480 INFO L290 TraceCheckUtils]: 32: Hoare triple {34660#true} #t~post2#1 := ~i~0#1;~i~0#1 := 1 + #t~post2#1;havoc #t~post2#1; {34660#true} is VALID [2022-02-20 23:38:15,480 INFO L290 TraceCheckUtils]: 33: Hoare triple {34660#true} assume !!(~i~0#1 < 2); {34660#true} is VALID [2022-02-20 23:38:15,480 INFO L290 TraceCheckUtils]: 34: Hoare triple {34660#true} SUMMARY for call #t~mem3#1.base, #t~mem3#1.offset := read~$Pointer$(~#commands~0.base, ~#commands~0.offset + 9 * ~i~0#1, 4); srcloc: L693 {34660#true} is VALID [2022-02-20 23:38:15,480 INFO L290 TraceCheckUtils]: 35: Hoare triple {34660#true} assume 1 == #valid[#t~mem3#1.base]; {34660#true} is VALID [2022-02-20 23:38:15,481 INFO L290 TraceCheckUtils]: 36: Hoare triple {34660#true} assume #t~mem3#1.offset < #length[#t~mem3#1.base] && #t~mem3#1.offset >= 0; {34660#true} is VALID [2022-02-20 23:38:15,481 INFO L290 TraceCheckUtils]: 37: Hoare triple {34660#true} assume 1 == #valid[~input#1.base]; {34660#true} is VALID [2022-02-20 23:38:15,481 INFO L290 TraceCheckUtils]: 38: Hoare triple {34660#true} assume ~input#1.offset < #length[~input#1.base] && ~input#1.offset >= 0; {34660#true} is VALID [2022-02-20 23:38:15,481 INFO L290 TraceCheckUtils]: 39: Hoare triple {34660#true} assume 0 == #t~nondet4#1;havoc #t~mem3#1.base, #t~mem3#1.offset;havoc #t~nondet4#1; {34660#true} is VALID [2022-02-20 23:38:15,481 INFO L290 TraceCheckUtils]: 40: Hoare triple {34660#true} SUMMARY for call #t~mem5#1 := read~int(~#commands~0.base, 8 + (~#commands~0.offset + 9 * ~i~0#1), 1); srcloc: L694 {34660#true} is VALID [2022-02-20 23:38:15,481 INFO L290 TraceCheckUtils]: 41: Hoare triple {34660#true} assume ~state~0 >= #t~mem5#1;havoc #t~mem5#1; {34660#true} is VALID [2022-02-20 23:38:15,481 INFO L290 TraceCheckUtils]: 42: Hoare triple {34660#true} SUMMARY for call #t~mem6#1.base, #t~mem6#1.offset := read~$Pointer$(~#commands~0.base, 4 + (~#commands~0.offset + 9 * ~i~0#1), 4); srcloc: L695 {34660#true} is VALID [2022-02-20 23:38:15,481 INFO L290 TraceCheckUtils]: 43: Hoare triple {34660#true} assume { :begin_inline_##fun~~TO~VOID } true;##fun~~TO~VOID_#in~#fp#1.base, ##fun~~TO~VOID_#in~#fp#1.offset := #t~mem6#1.base, #t~mem6#1.offset; {34660#true} is VALID [2022-02-20 23:38:15,482 INFO L290 TraceCheckUtils]: 44: Hoare triple {34660#true} assume ##fun~~TO~VOID_#in~#fp#1.base == #funAddr~c2.base && ##fun~~TO~VOID_#in~#fp#1.offset == #funAddr~c2.offset;assume { :begin_inline_c2 } true;havoc c2_~y~0#1.base, c2_~y~0#1.offset;c2_~y~0#1.base, c2_~y~0#1.offset := 0, 0; {34682#(and (= |parse_input_c2_~y~0#1.base| 0) (= |parse_input_c2_~y~0#1.offset| 0))} is VALID [2022-02-20 23:38:15,482 INFO L290 TraceCheckUtils]: 45: Hoare triple {34682#(and (= |parse_input_c2_~y~0#1.base| 0) (= |parse_input_c2_~y~0#1.offset| 0))} assume !((c2_~y~0#1.base == 0 && c2_~y~0#1.offset == 0) || (~global~0.base == 0 && ~global~0.offset == 0)); {34661#false} is VALID [2022-02-20 23:38:15,482 INFO L290 TraceCheckUtils]: 46: Hoare triple {34661#false} assume !(0 == c2_~y~0#1.offset); {34661#false} is VALID [2022-02-20 23:38:15,482 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-02-20 23:38:15,483 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:38:15,483 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925050578] [2022-02-20 23:38:15,483 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [925050578] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 23:38:15,483 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1446266381] [2022-02-20 23:38:15,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:38:15,483 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:38:15,483 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:38:15,484 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 23:38:15,485 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-02-20 23:38:15,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:38:15,549 INFO L263 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-20 23:38:15,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:38:15,554 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:38:15,614 INFO L290 TraceCheckUtils]: 0: Hoare triple {34660#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(3, 1);call write~init~int(99, 1, 0, 1);call write~init~int(49, 1, 1, 1);call write~init~int(0, 1, 2, 1);call #Ultimate.allocInit(3, 2);call write~init~int(99, 2, 0, 1);call write~init~int(50, 2, 1, 1);call write~init~int(0, 2, 2, 1);call #Ultimate.allocInit(3, 3);call write~init~int(99, 3, 0, 1);call write~init~int(49, 3, 1, 1);call write~init~int(0, 3, 2, 1);call #Ultimate.allocInit(3, 4);call write~init~int(99, 4, 0, 1);call write~init~int(49, 4, 1, 1);call write~init~int(0, 4, 2, 1);call #Ultimate.allocInit(3, 5);call write~init~int(99, 5, 0, 1);call write~init~int(50, 5, 1, 1);call write~init~int(0, 5, 2, 1);~state~0 := ~unnamed3~0~STATE_1;~global~0.base, ~global~0.offset := 0, 0;~#commands~0.base, ~#commands~0.offset := 6, 0;call #Ultimate.allocInit(18, 6);call write~init~$Pointer$(1, 0, ~#commands~0.base, ~#commands~0.offset, 4);call write~init~$Pointer$(#funAddr~c1.base, #funAddr~c1.offset, ~#commands~0.base, 4 + ~#commands~0.offset, 4);call write~init~int((if ~unnamed3~0~STATE_1 % 256 <= 127 then ~unnamed3~0~STATE_1 % 256 else ~unnamed3~0~STATE_1 % 256 - 256), ~#commands~0.base, 8 + ~#commands~0.offset, 1);call write~init~$Pointer$(2, 0, ~#commands~0.base, 9 + ~#commands~0.offset, 4);call write~init~$Pointer$(#funAddr~c2.base, #funAddr~c2.offset, ~#commands~0.base, 13 + ~#commands~0.offset, 4);call write~init~int((if ~unnamed3~0~STATE_2 % 256 <= 127 then ~unnamed3~0~STATE_2 % 256 else ~unnamed3~0~STATE_2 % 256 - 256), ~#commands~0.base, 17 + ~#commands~0.offset, 1); {34660#true} is VALID [2022-02-20 23:38:15,615 INFO L290 TraceCheckUtils]: 1: Hoare triple {34660#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1; {34660#true} is VALID [2022-02-20 23:38:15,615 INFO L272 TraceCheckUtils]: 2: Hoare triple {34660#true} call parse_input(3, 0); {34660#true} is VALID [2022-02-20 23:38:15,615 INFO L290 TraceCheckUtils]: 3: Hoare triple {34660#true} ~input#1.base, ~input#1.offset := #in~input#1.base, #in~input#1.offset;~i~0#1 := 0; {34660#true} is VALID [2022-02-20 23:38:15,615 INFO L290 TraceCheckUtils]: 4: Hoare triple {34660#true} assume !!(~i~0#1 < 2); {34660#true} is VALID [2022-02-20 23:38:15,615 INFO L290 TraceCheckUtils]: 5: Hoare triple {34660#true} SUMMARY for call #t~mem3#1.base, #t~mem3#1.offset := read~$Pointer$(~#commands~0.base, ~#commands~0.offset + 9 * ~i~0#1, 4); srcloc: L693 {34660#true} is VALID [2022-02-20 23:38:15,615 INFO L290 TraceCheckUtils]: 6: Hoare triple {34660#true} assume 1 == #valid[#t~mem3#1.base]; {34660#true} is VALID [2022-02-20 23:38:15,615 INFO L290 TraceCheckUtils]: 7: Hoare triple {34660#true} assume #t~mem3#1.offset < #length[#t~mem3#1.base] && #t~mem3#1.offset >= 0; {34660#true} is VALID [2022-02-20 23:38:15,616 INFO L290 TraceCheckUtils]: 8: Hoare triple {34660#true} assume 1 == #valid[~input#1.base]; {34660#true} is VALID [2022-02-20 23:38:15,616 INFO L290 TraceCheckUtils]: 9: Hoare triple {34660#true} assume ~input#1.offset < #length[~input#1.base] && ~input#1.offset >= 0; {34660#true} is VALID [2022-02-20 23:38:15,616 INFO L290 TraceCheckUtils]: 10: Hoare triple {34660#true} assume 0 == #t~nondet4#1;havoc #t~mem3#1.base, #t~mem3#1.offset;havoc #t~nondet4#1; {34660#true} is VALID [2022-02-20 23:38:15,616 INFO L290 TraceCheckUtils]: 11: Hoare triple {34660#true} SUMMARY for call #t~mem5#1 := read~int(~#commands~0.base, 8 + (~#commands~0.offset + 9 * ~i~0#1), 1); srcloc: L694 {34660#true} is VALID [2022-02-20 23:38:15,616 INFO L290 TraceCheckUtils]: 12: Hoare triple {34660#true} assume ~state~0 >= #t~mem5#1;havoc #t~mem5#1; {34660#true} is VALID [2022-02-20 23:38:15,616 INFO L290 TraceCheckUtils]: 13: Hoare triple {34660#true} SUMMARY for call #t~mem6#1.base, #t~mem6#1.offset := read~$Pointer$(~#commands~0.base, 4 + (~#commands~0.offset + 9 * ~i~0#1), 4); srcloc: L695 {34660#true} is VALID [2022-02-20 23:38:15,616 INFO L290 TraceCheckUtils]: 14: Hoare triple {34660#true} assume { :begin_inline_##fun~~TO~VOID } true;##fun~~TO~VOID_#in~#fp#1.base, ##fun~~TO~VOID_#in~#fp#1.offset := #t~mem6#1.base, #t~mem6#1.offset; {34660#true} is VALID [2022-02-20 23:38:15,616 INFO L290 TraceCheckUtils]: 15: Hoare triple {34660#true} assume !(##fun~~TO~VOID_#in~#fp#1.base == #funAddr~c2.base && ##fun~~TO~VOID_#in~#fp#1.offset == #funAddr~c2.offset);assume { :begin_inline_c1 } true;havoc c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset, c1_~x~0#1.base, c1_~x~0#1.offset;call c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset := #Ultimate.allocOnHeap(1);c1_~x~0#1.base, c1_~x~0#1.offset := c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset;havoc c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset; {34660#true} is VALID [2022-02-20 23:38:15,617 INFO L290 TraceCheckUtils]: 16: Hoare triple {34660#true} assume !(c1_~x~0#1.base == 0 && c1_~x~0#1.offset == 0); {34660#true} is VALID [2022-02-20 23:38:15,617 INFO L290 TraceCheckUtils]: 17: Hoare triple {34660#true} assume !(~global~0.base != 0 || ~global~0.offset != 0); {34660#true} is VALID [2022-02-20 23:38:15,617 INFO L290 TraceCheckUtils]: 18: Hoare triple {34660#true} ~global~0.base, ~global~0.offset := c1_~x~0#1.base, c1_~x~0#1.offset;~state~0 := ~unnamed3~0~STATE_2; {34660#true} is VALID [2022-02-20 23:38:15,617 INFO L290 TraceCheckUtils]: 19: Hoare triple {34660#true} assume { :end_inline_c1 } true; {34660#true} is VALID [2022-02-20 23:38:15,617 INFO L290 TraceCheckUtils]: 20: Hoare triple {34660#true} assume { :end_inline_##fun~~TO~VOID } true;havoc #t~mem6#1.base, #t~mem6#1.offset; {34660#true} is VALID [2022-02-20 23:38:15,617 INFO L290 TraceCheckUtils]: 21: Hoare triple {34660#true} assume true; {34660#true} is VALID [2022-02-20 23:38:15,617 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {34660#true} {34660#true} #101#return; {34660#true} is VALID [2022-02-20 23:38:15,617 INFO L272 TraceCheckUtils]: 23: Hoare triple {34660#true} call parse_input(4, 0); {34660#true} is VALID [2022-02-20 23:38:15,617 INFO L290 TraceCheckUtils]: 24: Hoare triple {34660#true} ~input#1.base, ~input#1.offset := #in~input#1.base, #in~input#1.offset;~i~0#1 := 0; {34660#true} is VALID [2022-02-20 23:38:15,618 INFO L290 TraceCheckUtils]: 25: Hoare triple {34660#true} assume !!(~i~0#1 < 2); {34660#true} is VALID [2022-02-20 23:38:15,618 INFO L290 TraceCheckUtils]: 26: Hoare triple {34660#true} SUMMARY for call #t~mem3#1.base, #t~mem3#1.offset := read~$Pointer$(~#commands~0.base, ~#commands~0.offset + 9 * ~i~0#1, 4); srcloc: L693 {34660#true} is VALID [2022-02-20 23:38:15,618 INFO L290 TraceCheckUtils]: 27: Hoare triple {34660#true} assume 1 == #valid[#t~mem3#1.base]; {34660#true} is VALID [2022-02-20 23:38:15,618 INFO L290 TraceCheckUtils]: 28: Hoare triple {34660#true} assume #t~mem3#1.offset < #length[#t~mem3#1.base] && #t~mem3#1.offset >= 0; {34660#true} is VALID [2022-02-20 23:38:15,618 INFO L290 TraceCheckUtils]: 29: Hoare triple {34660#true} assume 1 == #valid[~input#1.base]; {34660#true} is VALID [2022-02-20 23:38:15,618 INFO L290 TraceCheckUtils]: 30: Hoare triple {34660#true} assume ~input#1.offset < #length[~input#1.base] && ~input#1.offset >= 0; {34660#true} is VALID [2022-02-20 23:38:15,618 INFO L290 TraceCheckUtils]: 31: Hoare triple {34660#true} assume !(0 == #t~nondet4#1);havoc #t~mem3#1.base, #t~mem3#1.offset;havoc #t~nondet4#1; {34660#true} is VALID [2022-02-20 23:38:15,618 INFO L290 TraceCheckUtils]: 32: Hoare triple {34660#true} #t~post2#1 := ~i~0#1;~i~0#1 := 1 + #t~post2#1;havoc #t~post2#1; {34660#true} is VALID [2022-02-20 23:38:15,618 INFO L290 TraceCheckUtils]: 33: Hoare triple {34660#true} assume !!(~i~0#1 < 2); {34660#true} is VALID [2022-02-20 23:38:15,619 INFO L290 TraceCheckUtils]: 34: Hoare triple {34660#true} SUMMARY for call #t~mem3#1.base, #t~mem3#1.offset := read~$Pointer$(~#commands~0.base, ~#commands~0.offset + 9 * ~i~0#1, 4); srcloc: L693 {34660#true} is VALID [2022-02-20 23:38:15,619 INFO L290 TraceCheckUtils]: 35: Hoare triple {34660#true} assume 1 == #valid[#t~mem3#1.base]; {34660#true} is VALID [2022-02-20 23:38:15,619 INFO L290 TraceCheckUtils]: 36: Hoare triple {34660#true} assume #t~mem3#1.offset < #length[#t~mem3#1.base] && #t~mem3#1.offset >= 0; {34660#true} is VALID [2022-02-20 23:38:15,619 INFO L290 TraceCheckUtils]: 37: Hoare triple {34660#true} assume 1 == #valid[~input#1.base]; {34660#true} is VALID [2022-02-20 23:38:15,619 INFO L290 TraceCheckUtils]: 38: Hoare triple {34660#true} assume ~input#1.offset < #length[~input#1.base] && ~input#1.offset >= 0; {34660#true} is VALID [2022-02-20 23:38:15,619 INFO L290 TraceCheckUtils]: 39: Hoare triple {34660#true} assume 0 == #t~nondet4#1;havoc #t~mem3#1.base, #t~mem3#1.offset;havoc #t~nondet4#1; {34660#true} is VALID [2022-02-20 23:38:15,619 INFO L290 TraceCheckUtils]: 40: Hoare triple {34660#true} SUMMARY for call #t~mem5#1 := read~int(~#commands~0.base, 8 + (~#commands~0.offset + 9 * ~i~0#1), 1); srcloc: L694 {34660#true} is VALID [2022-02-20 23:38:15,619 INFO L290 TraceCheckUtils]: 41: Hoare triple {34660#true} assume ~state~0 >= #t~mem5#1;havoc #t~mem5#1; {34660#true} is VALID [2022-02-20 23:38:15,619 INFO L290 TraceCheckUtils]: 42: Hoare triple {34660#true} SUMMARY for call #t~mem6#1.base, #t~mem6#1.offset := read~$Pointer$(~#commands~0.base, 4 + (~#commands~0.offset + 9 * ~i~0#1), 4); srcloc: L695 {34660#true} is VALID [2022-02-20 23:38:15,620 INFO L290 TraceCheckUtils]: 43: Hoare triple {34660#true} assume { :begin_inline_##fun~~TO~VOID } true;##fun~~TO~VOID_#in~#fp#1.base, ##fun~~TO~VOID_#in~#fp#1.offset := #t~mem6#1.base, #t~mem6#1.offset; {34660#true} is VALID [2022-02-20 23:38:15,620 INFO L290 TraceCheckUtils]: 44: Hoare triple {34660#true} assume ##fun~~TO~VOID_#in~#fp#1.base == #funAddr~c2.base && ##fun~~TO~VOID_#in~#fp#1.offset == #funAddr~c2.offset;assume { :begin_inline_c2 } true;havoc c2_~y~0#1.base, c2_~y~0#1.offset;c2_~y~0#1.base, c2_~y~0#1.offset := 0, 0; {34819#(= |parse_input_c2_~y~0#1.offset| 0)} is VALID [2022-02-20 23:38:15,620 INFO L290 TraceCheckUtils]: 45: Hoare triple {34819#(= |parse_input_c2_~y~0#1.offset| 0)} assume !((c2_~y~0#1.base == 0 && c2_~y~0#1.offset == 0) || (~global~0.base == 0 && ~global~0.offset == 0)); {34819#(= |parse_input_c2_~y~0#1.offset| 0)} is VALID [2022-02-20 23:38:15,620 INFO L290 TraceCheckUtils]: 46: Hoare triple {34819#(= |parse_input_c2_~y~0#1.offset| 0)} assume !(0 == c2_~y~0#1.offset); {34661#false} is VALID [2022-02-20 23:38:15,621 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-02-20 23:38:15,621 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:38:15,621 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1446266381] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:38:15,621 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-20 23:38:15,621 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2022-02-20 23:38:15,621 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932622772] [2022-02-20 23:38:15,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:38:15,622 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 13.0) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 47 [2022-02-20 23:38:15,622 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:38:15,622 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 13.0) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:38:15,636 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:38:15,637 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:38:15,637 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:38:15,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:38:15,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:38:15,638 INFO L87 Difference]: Start difference. First operand 429 states and 539 transitions. Second operand has 3 states, 2 states have (on average 13.0) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:38:15,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:38:15,683 INFO L93 Difference]: Finished difference Result 452 states and 558 transitions. [2022-02-20 23:38:15,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:38:15,683 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 13.0) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 47 [2022-02-20 23:38:15,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:38:15,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 13.0) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:38:15,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 65 transitions. [2022-02-20 23:38:15,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 13.0) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:38:15,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 65 transitions. [2022-02-20 23:38:15,685 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 65 transitions. [2022-02-20 23:38:15,726 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:38:15,732 INFO L225 Difference]: With dead ends: 452 [2022-02-20 23:38:15,733 INFO L226 Difference]: Without dead ends: 452 [2022-02-20 23:38:15,733 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:38:15,733 INFO L933 BasicCegarLoop]: 61 mSDtfsCounter, 13 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:38:15,733 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 110 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:38:15,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2022-02-20 23:38:15,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 428. [2022-02-20 23:38:15,740 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:38:15,741 INFO L82 GeneralOperation]: Start isEquivalent. First operand 452 states. Second operand has 428 states, 390 states have (on average 1.2923076923076924) internal successors, (504), 409 states have internal predecessors, (504), 9 states have call successors, (9), 9 states have call predecessors, (9), 16 states have return successors, (21), 9 states have call predecessors, (21), 9 states have call successors, (21) [2022-02-20 23:38:15,741 INFO L74 IsIncluded]: Start isIncluded. First operand 452 states. Second operand has 428 states, 390 states have (on average 1.2923076923076924) internal successors, (504), 409 states have internal predecessors, (504), 9 states have call successors, (9), 9 states have call predecessors, (9), 16 states have return successors, (21), 9 states have call predecessors, (21), 9 states have call successors, (21) [2022-02-20 23:38:15,742 INFO L87 Difference]: Start difference. First operand 452 states. Second operand has 428 states, 390 states have (on average 1.2923076923076924) internal successors, (504), 409 states have internal predecessors, (504), 9 states have call successors, (9), 9 states have call predecessors, (9), 16 states have return successors, (21), 9 states have call predecessors, (21), 9 states have call successors, (21) [2022-02-20 23:38:15,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:38:15,749 INFO L93 Difference]: Finished difference Result 452 states and 558 transitions. [2022-02-20 23:38:15,749 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 558 transitions. [2022-02-20 23:38:15,749 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:38:15,749 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:38:15,750 INFO L74 IsIncluded]: Start isIncluded. First operand has 428 states, 390 states have (on average 1.2923076923076924) internal successors, (504), 409 states have internal predecessors, (504), 9 states have call successors, (9), 9 states have call predecessors, (9), 16 states have return successors, (21), 9 states have call predecessors, (21), 9 states have call successors, (21) Second operand 452 states. [2022-02-20 23:38:15,750 INFO L87 Difference]: Start difference. First operand has 428 states, 390 states have (on average 1.2923076923076924) internal successors, (504), 409 states have internal predecessors, (504), 9 states have call successors, (9), 9 states have call predecessors, (9), 16 states have return successors, (21), 9 states have call predecessors, (21), 9 states have call successors, (21) Second operand 452 states. [2022-02-20 23:38:15,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:38:15,758 INFO L93 Difference]: Finished difference Result 452 states and 558 transitions. [2022-02-20 23:38:15,759 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 558 transitions. [2022-02-20 23:38:15,759 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:38:15,759 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:38:15,759 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:38:15,759 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:38:15,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 428 states, 390 states have (on average 1.2923076923076924) internal successors, (504), 409 states have internal predecessors, (504), 9 states have call successors, (9), 9 states have call predecessors, (9), 16 states have return successors, (21), 9 states have call predecessors, (21), 9 states have call successors, (21) [2022-02-20 23:38:15,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 534 transitions. [2022-02-20 23:38:15,766 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 534 transitions. Word has length 47 [2022-02-20 23:38:15,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:38:15,766 INFO L470 AbstractCegarLoop]: Abstraction has 428 states and 534 transitions. [2022-02-20 23:38:15,766 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 13.0) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:38:15,767 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 534 transitions. [2022-02-20 23:38:15,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-02-20 23:38:15,767 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:38:15,767 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:38:15,791 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-02-20 23:38:15,983 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:38:15,983 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting parse_inputErr1REQUIRES_VIOLATION === [parse_inputErr0REQUIRES_VIOLATION, parse_inputErr1REQUIRES_VIOLATION, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2022-02-20 23:38:15,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:38:15,984 INFO L85 PathProgramCache]: Analyzing trace with hash 296907458, now seen corresponding path program 1 times [2022-02-20 23:38:15,984 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:38:15,984 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171842458] [2022-02-20 23:38:15,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:38:15,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:38:16,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:38:16,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 23:38:16,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:38:16,057 INFO L290 TraceCheckUtils]: 0: Hoare triple {36652#(and (= ~global~0.base |old(~global~0.base)|) (= |old(#length)| |#length|) (= |old(~global~0.offset)| ~global~0.offset) (= ~state~0 |old(~state~0)|) (= |old(#valid)| |#valid|))} ~input#1.base, ~input#1.offset := #in~input#1.base, #in~input#1.offset;~i~0#1 := 0; {36653#(= |parse_input_#in~input#1.offset| |parse_input_~input#1.offset|)} is VALID [2022-02-20 23:38:16,058 INFO L290 TraceCheckUtils]: 1: Hoare triple {36653#(= |parse_input_#in~input#1.offset| |parse_input_~input#1.offset|)} assume !!(~i~0#1 < 2); {36653#(= |parse_input_#in~input#1.offset| |parse_input_~input#1.offset|)} is VALID [2022-02-20 23:38:16,058 INFO L290 TraceCheckUtils]: 2: Hoare triple {36653#(= |parse_input_#in~input#1.offset| |parse_input_~input#1.offset|)} SUMMARY for call #t~mem3#1.base, #t~mem3#1.offset := read~$Pointer$(~#commands~0.base, ~#commands~0.offset + 9 * ~i~0#1, 4); srcloc: L693 {36653#(= |parse_input_#in~input#1.offset| |parse_input_~input#1.offset|)} is VALID [2022-02-20 23:38:16,058 INFO L290 TraceCheckUtils]: 3: Hoare triple {36653#(= |parse_input_#in~input#1.offset| |parse_input_~input#1.offset|)} assume 1 == #valid[#t~mem3#1.base]; {36653#(= |parse_input_#in~input#1.offset| |parse_input_~input#1.offset|)} is VALID [2022-02-20 23:38:16,059 INFO L290 TraceCheckUtils]: 4: Hoare triple {36653#(= |parse_input_#in~input#1.offset| |parse_input_~input#1.offset|)} assume #t~mem3#1.offset < #length[#t~mem3#1.base] && #t~mem3#1.offset >= 0; {36653#(= |parse_input_#in~input#1.offset| |parse_input_~input#1.offset|)} is VALID [2022-02-20 23:38:16,059 INFO L290 TraceCheckUtils]: 5: Hoare triple {36653#(= |parse_input_#in~input#1.offset| |parse_input_~input#1.offset|)} assume 1 == #valid[~input#1.base]; {36653#(= |parse_input_#in~input#1.offset| |parse_input_~input#1.offset|)} is VALID [2022-02-20 23:38:16,059 INFO L290 TraceCheckUtils]: 6: Hoare triple {36653#(= |parse_input_#in~input#1.offset| |parse_input_~input#1.offset|)} assume ~input#1.offset < #length[~input#1.base] && ~input#1.offset >= 0; {36609#true} is VALID [2022-02-20 23:38:16,059 INFO L290 TraceCheckUtils]: 7: Hoare triple {36609#true} assume 0 == #t~nondet4#1;havoc #t~mem3#1.base, #t~mem3#1.offset;havoc #t~nondet4#1; {36609#true} is VALID [2022-02-20 23:38:16,059 INFO L290 TraceCheckUtils]: 8: Hoare triple {36609#true} SUMMARY for call #t~mem5#1 := read~int(~#commands~0.base, 8 + (~#commands~0.offset + 9 * ~i~0#1), 1); srcloc: L694 {36609#true} is VALID [2022-02-20 23:38:16,059 INFO L290 TraceCheckUtils]: 9: Hoare triple {36609#true} assume ~state~0 >= #t~mem5#1;havoc #t~mem5#1; {36609#true} is VALID [2022-02-20 23:38:16,059 INFO L290 TraceCheckUtils]: 10: Hoare triple {36609#true} SUMMARY for call #t~mem6#1.base, #t~mem6#1.offset := read~$Pointer$(~#commands~0.base, 4 + (~#commands~0.offset + 9 * ~i~0#1), 4); srcloc: L695 {36609#true} is VALID [2022-02-20 23:38:16,059 INFO L290 TraceCheckUtils]: 11: Hoare triple {36609#true} assume { :begin_inline_##fun~~TO~VOID } true;##fun~~TO~VOID_#in~#fp#1.base, ##fun~~TO~VOID_#in~#fp#1.offset := #t~mem6#1.base, #t~mem6#1.offset; {36609#true} is VALID [2022-02-20 23:38:16,060 INFO L290 TraceCheckUtils]: 12: Hoare triple {36609#true} assume !(##fun~~TO~VOID_#in~#fp#1.base == #funAddr~c2.base && ##fun~~TO~VOID_#in~#fp#1.offset == #funAddr~c2.offset);assume { :begin_inline_c1 } true;havoc c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset, c1_~x~0#1.base, c1_~x~0#1.offset;call c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset := #Ultimate.allocOnHeap(1);c1_~x~0#1.base, c1_~x~0#1.offset := c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset;havoc c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset; {36654#(or (not (= |parse_input_#in~input#1.offset| 0)) (<= 1 |parse_input_c1_~x~0#1.base|) (<= (+ |parse_input_c1_~x~0#1.base| 1) 0))} is VALID [2022-02-20 23:38:16,060 INFO L290 TraceCheckUtils]: 13: Hoare triple {36654#(or (not (= |parse_input_#in~input#1.offset| 0)) (<= 1 |parse_input_c1_~x~0#1.base|) (<= (+ |parse_input_c1_~x~0#1.base| 1) 0))} assume !(c1_~x~0#1.base == 0 && c1_~x~0#1.offset == 0); {36654#(or (not (= |parse_input_#in~input#1.offset| 0)) (<= 1 |parse_input_c1_~x~0#1.base|) (<= (+ |parse_input_c1_~x~0#1.base| 1) 0))} is VALID [2022-02-20 23:38:16,061 INFO L290 TraceCheckUtils]: 14: Hoare triple {36654#(or (not (= |parse_input_#in~input#1.offset| 0)) (<= 1 |parse_input_c1_~x~0#1.base|) (<= (+ |parse_input_c1_~x~0#1.base| 1) 0))} assume !(~global~0.base != 0 || ~global~0.offset != 0); {36654#(or (not (= |parse_input_#in~input#1.offset| 0)) (<= 1 |parse_input_c1_~x~0#1.base|) (<= (+ |parse_input_c1_~x~0#1.base| 1) 0))} is VALID [2022-02-20 23:38:16,061 INFO L290 TraceCheckUtils]: 15: Hoare triple {36654#(or (not (= |parse_input_#in~input#1.offset| 0)) (<= 1 |parse_input_c1_~x~0#1.base|) (<= (+ |parse_input_c1_~x~0#1.base| 1) 0))} ~global~0.base, ~global~0.offset := c1_~x~0#1.base, c1_~x~0#1.offset;~state~0 := ~unnamed3~0~STATE_2; {36655#(or (not (= |parse_input_#in~input#1.offset| 0)) (<= 1 ~global~0.base) (<= (+ ~global~0.base 1) 0))} is VALID [2022-02-20 23:38:16,061 INFO L290 TraceCheckUtils]: 16: Hoare triple {36655#(or (not (= |parse_input_#in~input#1.offset| 0)) (<= 1 ~global~0.base) (<= (+ ~global~0.base 1) 0))} assume { :end_inline_c1 } true; {36655#(or (not (= |parse_input_#in~input#1.offset| 0)) (<= 1 ~global~0.base) (<= (+ ~global~0.base 1) 0))} is VALID [2022-02-20 23:38:16,062 INFO L290 TraceCheckUtils]: 17: Hoare triple {36655#(or (not (= |parse_input_#in~input#1.offset| 0)) (<= 1 ~global~0.base) (<= (+ ~global~0.base 1) 0))} assume { :end_inline_##fun~~TO~VOID } true;havoc #t~mem6#1.base, #t~mem6#1.offset; {36655#(or (not (= |parse_input_#in~input#1.offset| 0)) (<= 1 ~global~0.base) (<= (+ ~global~0.base 1) 0))} is VALID [2022-02-20 23:38:16,062 INFO L290 TraceCheckUtils]: 18: Hoare triple {36655#(or (not (= |parse_input_#in~input#1.offset| 0)) (<= 1 ~global~0.base) (<= (+ ~global~0.base 1) 0))} assume true; {36655#(or (not (= |parse_input_#in~input#1.offset| 0)) (<= 1 ~global~0.base) (<= (+ ~global~0.base 1) 0))} is VALID [2022-02-20 23:38:16,062 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {36655#(or (not (= |parse_input_#in~input#1.offset| 0)) (<= 1 ~global~0.base) (<= (+ ~global~0.base 1) 0))} {36609#true} #101#return; {36631#(not (= ~global~0.base 0))} is VALID [2022-02-20 23:38:16,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-02-20 23:38:16,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:38:16,084 INFO L290 TraceCheckUtils]: 0: Hoare triple {36652#(and (= ~global~0.base |old(~global~0.base)|) (= |old(#length)| |#length|) (= |old(~global~0.offset)| ~global~0.offset) (= ~state~0 |old(~state~0)|) (= |old(#valid)| |#valid|))} ~input#1.base, ~input#1.offset := #in~input#1.base, #in~input#1.offset;~i~0#1 := 0; {36656#(= ~global~0.base |old(~global~0.base)|)} is VALID [2022-02-20 23:38:16,084 INFO L290 TraceCheckUtils]: 1: Hoare triple {36656#(= ~global~0.base |old(~global~0.base)|)} assume !!(~i~0#1 < 2); {36656#(= ~global~0.base |old(~global~0.base)|)} is VALID [2022-02-20 23:38:16,084 INFO L290 TraceCheckUtils]: 2: Hoare triple {36656#(= ~global~0.base |old(~global~0.base)|)} SUMMARY for call #t~mem3#1.base, #t~mem3#1.offset := read~$Pointer$(~#commands~0.base, ~#commands~0.offset + 9 * ~i~0#1, 4); srcloc: L693 {36656#(= ~global~0.base |old(~global~0.base)|)} is VALID [2022-02-20 23:38:16,085 INFO L290 TraceCheckUtils]: 3: Hoare triple {36656#(= ~global~0.base |old(~global~0.base)|)} assume 1 == #valid[#t~mem3#1.base]; {36656#(= ~global~0.base |old(~global~0.base)|)} is VALID [2022-02-20 23:38:16,085 INFO L290 TraceCheckUtils]: 4: Hoare triple {36656#(= ~global~0.base |old(~global~0.base)|)} assume #t~mem3#1.offset < #length[#t~mem3#1.base] && #t~mem3#1.offset >= 0; {36656#(= ~global~0.base |old(~global~0.base)|)} is VALID [2022-02-20 23:38:16,085 INFO L290 TraceCheckUtils]: 5: Hoare triple {36656#(= ~global~0.base |old(~global~0.base)|)} assume 1 == #valid[~input#1.base]; {36656#(= ~global~0.base |old(~global~0.base)|)} is VALID [2022-02-20 23:38:16,085 INFO L290 TraceCheckUtils]: 6: Hoare triple {36656#(= ~global~0.base |old(~global~0.base)|)} assume ~input#1.offset < #length[~input#1.base] && ~input#1.offset >= 0; {36656#(= ~global~0.base |old(~global~0.base)|)} is VALID [2022-02-20 23:38:16,086 INFO L290 TraceCheckUtils]: 7: Hoare triple {36656#(= ~global~0.base |old(~global~0.base)|)} assume 0 == #t~nondet4#1;havoc #t~mem3#1.base, #t~mem3#1.offset;havoc #t~nondet4#1; {36656#(= ~global~0.base |old(~global~0.base)|)} is VALID [2022-02-20 23:38:16,086 INFO L290 TraceCheckUtils]: 8: Hoare triple {36656#(= ~global~0.base |old(~global~0.base)|)} SUMMARY for call #t~mem5#1 := read~int(~#commands~0.base, 8 + (~#commands~0.offset + 9 * ~i~0#1), 1); srcloc: L694 {36656#(= ~global~0.base |old(~global~0.base)|)} is VALID [2022-02-20 23:38:16,086 INFO L290 TraceCheckUtils]: 9: Hoare triple {36656#(= ~global~0.base |old(~global~0.base)|)} assume ~state~0 >= #t~mem5#1;havoc #t~mem5#1; {36656#(= ~global~0.base |old(~global~0.base)|)} is VALID [2022-02-20 23:38:16,086 INFO L290 TraceCheckUtils]: 10: Hoare triple {36656#(= ~global~0.base |old(~global~0.base)|)} SUMMARY for call #t~mem6#1.base, #t~mem6#1.offset := read~$Pointer$(~#commands~0.base, 4 + (~#commands~0.offset + 9 * ~i~0#1), 4); srcloc: L695 {36656#(= ~global~0.base |old(~global~0.base)|)} is VALID [2022-02-20 23:38:16,087 INFO L290 TraceCheckUtils]: 11: Hoare triple {36656#(= ~global~0.base |old(~global~0.base)|)} assume { :begin_inline_##fun~~TO~VOID } true;##fun~~TO~VOID_#in~#fp#1.base, ##fun~~TO~VOID_#in~#fp#1.offset := #t~mem6#1.base, #t~mem6#1.offset; {36656#(= ~global~0.base |old(~global~0.base)|)} is VALID [2022-02-20 23:38:16,087 INFO L290 TraceCheckUtils]: 12: Hoare triple {36656#(= ~global~0.base |old(~global~0.base)|)} assume !(##fun~~TO~VOID_#in~#fp#1.base == #funAddr~c2.base && ##fun~~TO~VOID_#in~#fp#1.offset == #funAddr~c2.offset);assume { :begin_inline_c1 } true;havoc c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset, c1_~x~0#1.base, c1_~x~0#1.offset;call c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset := #Ultimate.allocOnHeap(1);c1_~x~0#1.base, c1_~x~0#1.offset := c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset;havoc c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset; {36656#(= ~global~0.base |old(~global~0.base)|)} is VALID [2022-02-20 23:38:16,087 INFO L290 TraceCheckUtils]: 13: Hoare triple {36656#(= ~global~0.base |old(~global~0.base)|)} assume !(c1_~x~0#1.base == 0 && c1_~x~0#1.offset == 0); {36656#(= ~global~0.base |old(~global~0.base)|)} is VALID [2022-02-20 23:38:16,087 INFO L290 TraceCheckUtils]: 14: Hoare triple {36656#(= ~global~0.base |old(~global~0.base)|)} assume !(~global~0.base != 0 || ~global~0.offset != 0); {36657#(= |old(~global~0.base)| 0)} is VALID [2022-02-20 23:38:16,088 INFO L290 TraceCheckUtils]: 15: Hoare triple {36657#(= |old(~global~0.base)| 0)} ~global~0.base, ~global~0.offset := c1_~x~0#1.base, c1_~x~0#1.offset;~state~0 := ~unnamed3~0~STATE_2; {36657#(= |old(~global~0.base)| 0)} is VALID [2022-02-20 23:38:16,088 INFO L290 TraceCheckUtils]: 16: Hoare triple {36657#(= |old(~global~0.base)| 0)} assume { :end_inline_c1 } true; {36657#(= |old(~global~0.base)| 0)} is VALID [2022-02-20 23:38:16,088 INFO L290 TraceCheckUtils]: 17: Hoare triple {36657#(= |old(~global~0.base)| 0)} assume { :end_inline_##fun~~TO~VOID } true;havoc #t~mem6#1.base, #t~mem6#1.offset; {36657#(= |old(~global~0.base)| 0)} is VALID [2022-02-20 23:38:16,089 INFO L290 TraceCheckUtils]: 18: Hoare triple {36657#(= |old(~global~0.base)| 0)} assume true; {36657#(= |old(~global~0.base)| 0)} is VALID [2022-02-20 23:38:16,089 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {36657#(= |old(~global~0.base)| 0)} {36631#(not (= ~global~0.base 0))} #103#return; {36610#false} is VALID [2022-02-20 23:38:16,089 INFO L290 TraceCheckUtils]: 0: Hoare triple {36609#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(3, 1);call write~init~int(99, 1, 0, 1);call write~init~int(49, 1, 1, 1);call write~init~int(0, 1, 2, 1);call #Ultimate.allocInit(3, 2);call write~init~int(99, 2, 0, 1);call write~init~int(50, 2, 1, 1);call write~init~int(0, 2, 2, 1);call #Ultimate.allocInit(3, 3);call write~init~int(99, 3, 0, 1);call write~init~int(49, 3, 1, 1);call write~init~int(0, 3, 2, 1);call #Ultimate.allocInit(3, 4);call write~init~int(99, 4, 0, 1);call write~init~int(49, 4, 1, 1);call write~init~int(0, 4, 2, 1);call #Ultimate.allocInit(3, 5);call write~init~int(99, 5, 0, 1);call write~init~int(50, 5, 1, 1);call write~init~int(0, 5, 2, 1);~state~0 := ~unnamed3~0~STATE_1;~global~0.base, ~global~0.offset := 0, 0;~#commands~0.base, ~#commands~0.offset := 6, 0;call #Ultimate.allocInit(18, 6);call write~init~$Pointer$(1, 0, ~#commands~0.base, ~#commands~0.offset, 4);call write~init~$Pointer$(#funAddr~c1.base, #funAddr~c1.offset, ~#commands~0.base, 4 + ~#commands~0.offset, 4);call write~init~int((if ~unnamed3~0~STATE_1 % 256 <= 127 then ~unnamed3~0~STATE_1 % 256 else ~unnamed3~0~STATE_1 % 256 - 256), ~#commands~0.base, 8 + ~#commands~0.offset, 1);call write~init~$Pointer$(2, 0, ~#commands~0.base, 9 + ~#commands~0.offset, 4);call write~init~$Pointer$(#funAddr~c2.base, #funAddr~c2.offset, ~#commands~0.base, 13 + ~#commands~0.offset, 4);call write~init~int((if ~unnamed3~0~STATE_2 % 256 <= 127 then ~unnamed3~0~STATE_2 % 256 else ~unnamed3~0~STATE_2 % 256 - 256), ~#commands~0.base, 17 + ~#commands~0.offset, 1); {36609#true} is VALID [2022-02-20 23:38:16,089 INFO L290 TraceCheckUtils]: 1: Hoare triple {36609#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1; {36609#true} is VALID [2022-02-20 23:38:16,090 INFO L272 TraceCheckUtils]: 2: Hoare triple {36609#true} call parse_input(3, 0); {36652#(and (= ~global~0.base |old(~global~0.base)|) (= |old(#length)| |#length|) (= |old(~global~0.offset)| ~global~0.offset) (= ~state~0 |old(~state~0)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 23:38:16,090 INFO L290 TraceCheckUtils]: 3: Hoare triple {36652#(and (= ~global~0.base |old(~global~0.base)|) (= |old(#length)| |#length|) (= |old(~global~0.offset)| ~global~0.offset) (= ~state~0 |old(~state~0)|) (= |old(#valid)| |#valid|))} ~input#1.base, ~input#1.offset := #in~input#1.base, #in~input#1.offset;~i~0#1 := 0; {36653#(= |parse_input_#in~input#1.offset| |parse_input_~input#1.offset|)} is VALID [2022-02-20 23:38:16,090 INFO L290 TraceCheckUtils]: 4: Hoare triple {36653#(= |parse_input_#in~input#1.offset| |parse_input_~input#1.offset|)} assume !!(~i~0#1 < 2); {36653#(= |parse_input_#in~input#1.offset| |parse_input_~input#1.offset|)} is VALID [2022-02-20 23:38:16,091 INFO L290 TraceCheckUtils]: 5: Hoare triple {36653#(= |parse_input_#in~input#1.offset| |parse_input_~input#1.offset|)} SUMMARY for call #t~mem3#1.base, #t~mem3#1.offset := read~$Pointer$(~#commands~0.base, ~#commands~0.offset + 9 * ~i~0#1, 4); srcloc: L693 {36653#(= |parse_input_#in~input#1.offset| |parse_input_~input#1.offset|)} is VALID [2022-02-20 23:38:16,091 INFO L290 TraceCheckUtils]: 6: Hoare triple {36653#(= |parse_input_#in~input#1.offset| |parse_input_~input#1.offset|)} assume 1 == #valid[#t~mem3#1.base]; {36653#(= |parse_input_#in~input#1.offset| |parse_input_~input#1.offset|)} is VALID [2022-02-20 23:38:16,091 INFO L290 TraceCheckUtils]: 7: Hoare triple {36653#(= |parse_input_#in~input#1.offset| |parse_input_~input#1.offset|)} assume #t~mem3#1.offset < #length[#t~mem3#1.base] && #t~mem3#1.offset >= 0; {36653#(= |parse_input_#in~input#1.offset| |parse_input_~input#1.offset|)} is VALID [2022-02-20 23:38:16,092 INFO L290 TraceCheckUtils]: 8: Hoare triple {36653#(= |parse_input_#in~input#1.offset| |parse_input_~input#1.offset|)} assume 1 == #valid[~input#1.base]; {36653#(= |parse_input_#in~input#1.offset| |parse_input_~input#1.offset|)} is VALID [2022-02-20 23:38:16,092 INFO L290 TraceCheckUtils]: 9: Hoare triple {36653#(= |parse_input_#in~input#1.offset| |parse_input_~input#1.offset|)} assume ~input#1.offset < #length[~input#1.base] && ~input#1.offset >= 0; {36609#true} is VALID [2022-02-20 23:38:16,092 INFO L290 TraceCheckUtils]: 10: Hoare triple {36609#true} assume 0 == #t~nondet4#1;havoc #t~mem3#1.base, #t~mem3#1.offset;havoc #t~nondet4#1; {36609#true} is VALID [2022-02-20 23:38:16,092 INFO L290 TraceCheckUtils]: 11: Hoare triple {36609#true} SUMMARY for call #t~mem5#1 := read~int(~#commands~0.base, 8 + (~#commands~0.offset + 9 * ~i~0#1), 1); srcloc: L694 {36609#true} is VALID [2022-02-20 23:38:16,092 INFO L290 TraceCheckUtils]: 12: Hoare triple {36609#true} assume ~state~0 >= #t~mem5#1;havoc #t~mem5#1; {36609#true} is VALID [2022-02-20 23:38:16,092 INFO L290 TraceCheckUtils]: 13: Hoare triple {36609#true} SUMMARY for call #t~mem6#1.base, #t~mem6#1.offset := read~$Pointer$(~#commands~0.base, 4 + (~#commands~0.offset + 9 * ~i~0#1), 4); srcloc: L695 {36609#true} is VALID [2022-02-20 23:38:16,092 INFO L290 TraceCheckUtils]: 14: Hoare triple {36609#true} assume { :begin_inline_##fun~~TO~VOID } true;##fun~~TO~VOID_#in~#fp#1.base, ##fun~~TO~VOID_#in~#fp#1.offset := #t~mem6#1.base, #t~mem6#1.offset; {36609#true} is VALID [2022-02-20 23:38:16,093 INFO L290 TraceCheckUtils]: 15: Hoare triple {36609#true} assume !(##fun~~TO~VOID_#in~#fp#1.base == #funAddr~c2.base && ##fun~~TO~VOID_#in~#fp#1.offset == #funAddr~c2.offset);assume { :begin_inline_c1 } true;havoc c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset, c1_~x~0#1.base, c1_~x~0#1.offset;call c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset := #Ultimate.allocOnHeap(1);c1_~x~0#1.base, c1_~x~0#1.offset := c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset;havoc c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset; {36654#(or (not (= |parse_input_#in~input#1.offset| 0)) (<= 1 |parse_input_c1_~x~0#1.base|) (<= (+ |parse_input_c1_~x~0#1.base| 1) 0))} is VALID [2022-02-20 23:38:16,093 INFO L290 TraceCheckUtils]: 16: Hoare triple {36654#(or (not (= |parse_input_#in~input#1.offset| 0)) (<= 1 |parse_input_c1_~x~0#1.base|) (<= (+ |parse_input_c1_~x~0#1.base| 1) 0))} assume !(c1_~x~0#1.base == 0 && c1_~x~0#1.offset == 0); {36654#(or (not (= |parse_input_#in~input#1.offset| 0)) (<= 1 |parse_input_c1_~x~0#1.base|) (<= (+ |parse_input_c1_~x~0#1.base| 1) 0))} is VALID [2022-02-20 23:38:16,093 INFO L290 TraceCheckUtils]: 17: Hoare triple {36654#(or (not (= |parse_input_#in~input#1.offset| 0)) (<= 1 |parse_input_c1_~x~0#1.base|) (<= (+ |parse_input_c1_~x~0#1.base| 1) 0))} assume !(~global~0.base != 0 || ~global~0.offset != 0); {36654#(or (not (= |parse_input_#in~input#1.offset| 0)) (<= 1 |parse_input_c1_~x~0#1.base|) (<= (+ |parse_input_c1_~x~0#1.base| 1) 0))} is VALID [2022-02-20 23:38:16,094 INFO L290 TraceCheckUtils]: 18: Hoare triple {36654#(or (not (= |parse_input_#in~input#1.offset| 0)) (<= 1 |parse_input_c1_~x~0#1.base|) (<= (+ |parse_input_c1_~x~0#1.base| 1) 0))} ~global~0.base, ~global~0.offset := c1_~x~0#1.base, c1_~x~0#1.offset;~state~0 := ~unnamed3~0~STATE_2; {36655#(or (not (= |parse_input_#in~input#1.offset| 0)) (<= 1 ~global~0.base) (<= (+ ~global~0.base 1) 0))} is VALID [2022-02-20 23:38:16,094 INFO L290 TraceCheckUtils]: 19: Hoare triple {36655#(or (not (= |parse_input_#in~input#1.offset| 0)) (<= 1 ~global~0.base) (<= (+ ~global~0.base 1) 0))} assume { :end_inline_c1 } true; {36655#(or (not (= |parse_input_#in~input#1.offset| 0)) (<= 1 ~global~0.base) (<= (+ ~global~0.base 1) 0))} is VALID [2022-02-20 23:38:16,094 INFO L290 TraceCheckUtils]: 20: Hoare triple {36655#(or (not (= |parse_input_#in~input#1.offset| 0)) (<= 1 ~global~0.base) (<= (+ ~global~0.base 1) 0))} assume { :end_inline_##fun~~TO~VOID } true;havoc #t~mem6#1.base, #t~mem6#1.offset; {36655#(or (not (= |parse_input_#in~input#1.offset| 0)) (<= 1 ~global~0.base) (<= (+ ~global~0.base 1) 0))} is VALID [2022-02-20 23:38:16,095 INFO L290 TraceCheckUtils]: 21: Hoare triple {36655#(or (not (= |parse_input_#in~input#1.offset| 0)) (<= 1 ~global~0.base) (<= (+ ~global~0.base 1) 0))} assume true; {36655#(or (not (= |parse_input_#in~input#1.offset| 0)) (<= 1 ~global~0.base) (<= (+ ~global~0.base 1) 0))} is VALID [2022-02-20 23:38:16,095 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {36655#(or (not (= |parse_input_#in~input#1.offset| 0)) (<= 1 ~global~0.base) (<= (+ ~global~0.base 1) 0))} {36609#true} #101#return; {36631#(not (= ~global~0.base 0))} is VALID [2022-02-20 23:38:16,096 INFO L272 TraceCheckUtils]: 23: Hoare triple {36631#(not (= ~global~0.base 0))} call parse_input(4, 0); {36652#(and (= ~global~0.base |old(~global~0.base)|) (= |old(#length)| |#length|) (= |old(~global~0.offset)| ~global~0.offset) (= ~state~0 |old(~state~0)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 23:38:16,096 INFO L290 TraceCheckUtils]: 24: Hoare triple {36652#(and (= ~global~0.base |old(~global~0.base)|) (= |old(#length)| |#length|) (= |old(~global~0.offset)| ~global~0.offset) (= ~state~0 |old(~state~0)|) (= |old(#valid)| |#valid|))} ~input#1.base, ~input#1.offset := #in~input#1.base, #in~input#1.offset;~i~0#1 := 0; {36656#(= ~global~0.base |old(~global~0.base)|)} is VALID [2022-02-20 23:38:16,096 INFO L290 TraceCheckUtils]: 25: Hoare triple {36656#(= ~global~0.base |old(~global~0.base)|)} assume !!(~i~0#1 < 2); {36656#(= ~global~0.base |old(~global~0.base)|)} is VALID [2022-02-20 23:38:16,096 INFO L290 TraceCheckUtils]: 26: Hoare triple {36656#(= ~global~0.base |old(~global~0.base)|)} SUMMARY for call #t~mem3#1.base, #t~mem3#1.offset := read~$Pointer$(~#commands~0.base, ~#commands~0.offset + 9 * ~i~0#1, 4); srcloc: L693 {36656#(= ~global~0.base |old(~global~0.base)|)} is VALID [2022-02-20 23:38:16,097 INFO L290 TraceCheckUtils]: 27: Hoare triple {36656#(= ~global~0.base |old(~global~0.base)|)} assume 1 == #valid[#t~mem3#1.base]; {36656#(= ~global~0.base |old(~global~0.base)|)} is VALID [2022-02-20 23:38:16,097 INFO L290 TraceCheckUtils]: 28: Hoare triple {36656#(= ~global~0.base |old(~global~0.base)|)} assume #t~mem3#1.offset < #length[#t~mem3#1.base] && #t~mem3#1.offset >= 0; {36656#(= ~global~0.base |old(~global~0.base)|)} is VALID [2022-02-20 23:38:16,097 INFO L290 TraceCheckUtils]: 29: Hoare triple {36656#(= ~global~0.base |old(~global~0.base)|)} assume 1 == #valid[~input#1.base]; {36656#(= ~global~0.base |old(~global~0.base)|)} is VALID [2022-02-20 23:38:16,097 INFO L290 TraceCheckUtils]: 30: Hoare triple {36656#(= ~global~0.base |old(~global~0.base)|)} assume ~input#1.offset < #length[~input#1.base] && ~input#1.offset >= 0; {36656#(= ~global~0.base |old(~global~0.base)|)} is VALID [2022-02-20 23:38:16,098 INFO L290 TraceCheckUtils]: 31: Hoare triple {36656#(= ~global~0.base |old(~global~0.base)|)} assume 0 == #t~nondet4#1;havoc #t~mem3#1.base, #t~mem3#1.offset;havoc #t~nondet4#1; {36656#(= ~global~0.base |old(~global~0.base)|)} is VALID [2022-02-20 23:38:16,098 INFO L290 TraceCheckUtils]: 32: Hoare triple {36656#(= ~global~0.base |old(~global~0.base)|)} SUMMARY for call #t~mem5#1 := read~int(~#commands~0.base, 8 + (~#commands~0.offset + 9 * ~i~0#1), 1); srcloc: L694 {36656#(= ~global~0.base |old(~global~0.base)|)} is VALID [2022-02-20 23:38:16,098 INFO L290 TraceCheckUtils]: 33: Hoare triple {36656#(= ~global~0.base |old(~global~0.base)|)} assume ~state~0 >= #t~mem5#1;havoc #t~mem5#1; {36656#(= ~global~0.base |old(~global~0.base)|)} is VALID [2022-02-20 23:38:16,098 INFO L290 TraceCheckUtils]: 34: Hoare triple {36656#(= ~global~0.base |old(~global~0.base)|)} SUMMARY for call #t~mem6#1.base, #t~mem6#1.offset := read~$Pointer$(~#commands~0.base, 4 + (~#commands~0.offset + 9 * ~i~0#1), 4); srcloc: L695 {36656#(= ~global~0.base |old(~global~0.base)|)} is VALID [2022-02-20 23:38:16,099 INFO L290 TraceCheckUtils]: 35: Hoare triple {36656#(= ~global~0.base |old(~global~0.base)|)} assume { :begin_inline_##fun~~TO~VOID } true;##fun~~TO~VOID_#in~#fp#1.base, ##fun~~TO~VOID_#in~#fp#1.offset := #t~mem6#1.base, #t~mem6#1.offset; {36656#(= ~global~0.base |old(~global~0.base)|)} is VALID [2022-02-20 23:38:16,099 INFO L290 TraceCheckUtils]: 36: Hoare triple {36656#(= ~global~0.base |old(~global~0.base)|)} assume !(##fun~~TO~VOID_#in~#fp#1.base == #funAddr~c2.base && ##fun~~TO~VOID_#in~#fp#1.offset == #funAddr~c2.offset);assume { :begin_inline_c1 } true;havoc c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset, c1_~x~0#1.base, c1_~x~0#1.offset;call c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset := #Ultimate.allocOnHeap(1);c1_~x~0#1.base, c1_~x~0#1.offset := c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset;havoc c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset; {36656#(= ~global~0.base |old(~global~0.base)|)} is VALID [2022-02-20 23:38:16,099 INFO L290 TraceCheckUtils]: 37: Hoare triple {36656#(= ~global~0.base |old(~global~0.base)|)} assume !(c1_~x~0#1.base == 0 && c1_~x~0#1.offset == 0); {36656#(= ~global~0.base |old(~global~0.base)|)} is VALID [2022-02-20 23:38:16,099 INFO L290 TraceCheckUtils]: 38: Hoare triple {36656#(= ~global~0.base |old(~global~0.base)|)} assume !(~global~0.base != 0 || ~global~0.offset != 0); {36657#(= |old(~global~0.base)| 0)} is VALID [2022-02-20 23:38:16,100 INFO L290 TraceCheckUtils]: 39: Hoare triple {36657#(= |old(~global~0.base)| 0)} ~global~0.base, ~global~0.offset := c1_~x~0#1.base, c1_~x~0#1.offset;~state~0 := ~unnamed3~0~STATE_2; {36657#(= |old(~global~0.base)| 0)} is VALID [2022-02-20 23:38:16,100 INFO L290 TraceCheckUtils]: 40: Hoare triple {36657#(= |old(~global~0.base)| 0)} assume { :end_inline_c1 } true; {36657#(= |old(~global~0.base)| 0)} is VALID [2022-02-20 23:38:16,100 INFO L290 TraceCheckUtils]: 41: Hoare triple {36657#(= |old(~global~0.base)| 0)} assume { :end_inline_##fun~~TO~VOID } true;havoc #t~mem6#1.base, #t~mem6#1.offset; {36657#(= |old(~global~0.base)| 0)} is VALID [2022-02-20 23:38:16,100 INFO L290 TraceCheckUtils]: 42: Hoare triple {36657#(= |old(~global~0.base)| 0)} assume true; {36657#(= |old(~global~0.base)| 0)} is VALID [2022-02-20 23:38:16,101 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {36657#(= |old(~global~0.base)| 0)} {36631#(not (= ~global~0.base 0))} #103#return; {36610#false} is VALID [2022-02-20 23:38:16,101 INFO L272 TraceCheckUtils]: 44: Hoare triple {36610#false} call parse_input(5, 0); {36610#false} is VALID [2022-02-20 23:38:16,101 INFO L290 TraceCheckUtils]: 45: Hoare triple {36610#false} ~input#1.base, ~input#1.offset := #in~input#1.base, #in~input#1.offset;~i~0#1 := 0; {36610#false} is VALID [2022-02-20 23:38:16,101 INFO L290 TraceCheckUtils]: 46: Hoare triple {36610#false} assume !!(~i~0#1 < 2); {36610#false} is VALID [2022-02-20 23:38:16,101 INFO L290 TraceCheckUtils]: 47: Hoare triple {36610#false} assume !(4 + (~#commands~0.offset + 9 * ~i~0#1) <= #length[~#commands~0.base] && 0 <= ~#commands~0.offset + 9 * ~i~0#1); {36610#false} is VALID [2022-02-20 23:38:16,101 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 12 proven. 13 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-20 23:38:16,101 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:38:16,101 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171842458] [2022-02-20 23:38:16,101 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1171842458] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 23:38:16,102 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1932404225] [2022-02-20 23:38:16,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:38:16,102 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:38:16,102 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:38:16,103 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 23:38:16,104 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-02-20 23:38:16,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:38:16,175 INFO L263 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 9 conjunts are in the unsatisfiable core [2022-02-20 23:38:16,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:38:16,183 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:38:16,274 INFO L290 TraceCheckUtils]: 0: Hoare triple {36609#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(3, 1);call write~init~int(99, 1, 0, 1);call write~init~int(49, 1, 1, 1);call write~init~int(0, 1, 2, 1);call #Ultimate.allocInit(3, 2);call write~init~int(99, 2, 0, 1);call write~init~int(50, 2, 1, 1);call write~init~int(0, 2, 2, 1);call #Ultimate.allocInit(3, 3);call write~init~int(99, 3, 0, 1);call write~init~int(49, 3, 1, 1);call write~init~int(0, 3, 2, 1);call #Ultimate.allocInit(3, 4);call write~init~int(99, 4, 0, 1);call write~init~int(49, 4, 1, 1);call write~init~int(0, 4, 2, 1);call #Ultimate.allocInit(3, 5);call write~init~int(99, 5, 0, 1);call write~init~int(50, 5, 1, 1);call write~init~int(0, 5, 2, 1);~state~0 := ~unnamed3~0~STATE_1;~global~0.base, ~global~0.offset := 0, 0;~#commands~0.base, ~#commands~0.offset := 6, 0;call #Ultimate.allocInit(18, 6);call write~init~$Pointer$(1, 0, ~#commands~0.base, ~#commands~0.offset, 4);call write~init~$Pointer$(#funAddr~c1.base, #funAddr~c1.offset, ~#commands~0.base, 4 + ~#commands~0.offset, 4);call write~init~int((if ~unnamed3~0~STATE_1 % 256 <= 127 then ~unnamed3~0~STATE_1 % 256 else ~unnamed3~0~STATE_1 % 256 - 256), ~#commands~0.base, 8 + ~#commands~0.offset, 1);call write~init~$Pointer$(2, 0, ~#commands~0.base, 9 + ~#commands~0.offset, 4);call write~init~$Pointer$(#funAddr~c2.base, #funAddr~c2.offset, ~#commands~0.base, 13 + ~#commands~0.offset, 4);call write~init~int((if ~unnamed3~0~STATE_2 % 256 <= 127 then ~unnamed3~0~STATE_2 % 256 else ~unnamed3~0~STATE_2 % 256 - 256), ~#commands~0.base, 17 + ~#commands~0.offset, 1); {36609#true} is VALID [2022-02-20 23:38:16,274 INFO L290 TraceCheckUtils]: 1: Hoare triple {36609#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1; {36609#true} is VALID [2022-02-20 23:38:16,274 INFO L272 TraceCheckUtils]: 2: Hoare triple {36609#true} call parse_input(3, 0); {36609#true} is VALID [2022-02-20 23:38:16,274 INFO L290 TraceCheckUtils]: 3: Hoare triple {36609#true} ~input#1.base, ~input#1.offset := #in~input#1.base, #in~input#1.offset;~i~0#1 := 0; {36609#true} is VALID [2022-02-20 23:38:16,274 INFO L290 TraceCheckUtils]: 4: Hoare triple {36609#true} assume !!(~i~0#1 < 2); {36609#true} is VALID [2022-02-20 23:38:16,274 INFO L290 TraceCheckUtils]: 5: Hoare triple {36609#true} SUMMARY for call #t~mem3#1.base, #t~mem3#1.offset := read~$Pointer$(~#commands~0.base, ~#commands~0.offset + 9 * ~i~0#1, 4); srcloc: L693 {36609#true} is VALID [2022-02-20 23:38:16,274 INFO L290 TraceCheckUtils]: 6: Hoare triple {36609#true} assume 1 == #valid[#t~mem3#1.base]; {36609#true} is VALID [2022-02-20 23:38:16,274 INFO L290 TraceCheckUtils]: 7: Hoare triple {36609#true} assume #t~mem3#1.offset < #length[#t~mem3#1.base] && #t~mem3#1.offset >= 0; {36609#true} is VALID [2022-02-20 23:38:16,274 INFO L290 TraceCheckUtils]: 8: Hoare triple {36609#true} assume 1 == #valid[~input#1.base]; {36609#true} is VALID [2022-02-20 23:38:16,274 INFO L290 TraceCheckUtils]: 9: Hoare triple {36609#true} assume ~input#1.offset < #length[~input#1.base] && ~input#1.offset >= 0; {36609#true} is VALID [2022-02-20 23:38:16,274 INFO L290 TraceCheckUtils]: 10: Hoare triple {36609#true} assume 0 == #t~nondet4#1;havoc #t~mem3#1.base, #t~mem3#1.offset;havoc #t~nondet4#1; {36609#true} is VALID [2022-02-20 23:38:16,274 INFO L290 TraceCheckUtils]: 11: Hoare triple {36609#true} SUMMARY for call #t~mem5#1 := read~int(~#commands~0.base, 8 + (~#commands~0.offset + 9 * ~i~0#1), 1); srcloc: L694 {36609#true} is VALID [2022-02-20 23:38:16,274 INFO L290 TraceCheckUtils]: 12: Hoare triple {36609#true} assume ~state~0 >= #t~mem5#1;havoc #t~mem5#1; {36609#true} is VALID [2022-02-20 23:38:16,275 INFO L290 TraceCheckUtils]: 13: Hoare triple {36609#true} SUMMARY for call #t~mem6#1.base, #t~mem6#1.offset := read~$Pointer$(~#commands~0.base, 4 + (~#commands~0.offset + 9 * ~i~0#1), 4); srcloc: L695 {36609#true} is VALID [2022-02-20 23:38:16,275 INFO L290 TraceCheckUtils]: 14: Hoare triple {36609#true} assume { :begin_inline_##fun~~TO~VOID } true;##fun~~TO~VOID_#in~#fp#1.base, ##fun~~TO~VOID_#in~#fp#1.offset := #t~mem6#1.base, #t~mem6#1.offset; {36609#true} is VALID [2022-02-20 23:38:16,275 INFO L290 TraceCheckUtils]: 15: Hoare triple {36609#true} assume !(##fun~~TO~VOID_#in~#fp#1.base == #funAddr~c2.base && ##fun~~TO~VOID_#in~#fp#1.offset == #funAddr~c2.offset);assume { :begin_inline_c1 } true;havoc c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset, c1_~x~0#1.base, c1_~x~0#1.offset;call c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset := #Ultimate.allocOnHeap(1);c1_~x~0#1.base, c1_~x~0#1.offset := c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset;havoc c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset; {36706#(not (= |parse_input_c1_~x~0#1.base| 0))} is VALID [2022-02-20 23:38:16,275 INFO L290 TraceCheckUtils]: 16: Hoare triple {36706#(not (= |parse_input_c1_~x~0#1.base| 0))} assume !(c1_~x~0#1.base == 0 && c1_~x~0#1.offset == 0); {36706#(not (= |parse_input_c1_~x~0#1.base| 0))} is VALID [2022-02-20 23:38:16,275 INFO L290 TraceCheckUtils]: 17: Hoare triple {36706#(not (= |parse_input_c1_~x~0#1.base| 0))} assume !(~global~0.base != 0 || ~global~0.offset != 0); {36706#(not (= |parse_input_c1_~x~0#1.base| 0))} is VALID [2022-02-20 23:38:16,276 INFO L290 TraceCheckUtils]: 18: Hoare triple {36706#(not (= |parse_input_c1_~x~0#1.base| 0))} ~global~0.base, ~global~0.offset := c1_~x~0#1.base, c1_~x~0#1.offset;~state~0 := ~unnamed3~0~STATE_2; {36631#(not (= ~global~0.base 0))} is VALID [2022-02-20 23:38:16,276 INFO L290 TraceCheckUtils]: 19: Hoare triple {36631#(not (= ~global~0.base 0))} assume { :end_inline_c1 } true; {36631#(not (= ~global~0.base 0))} is VALID [2022-02-20 23:38:16,276 INFO L290 TraceCheckUtils]: 20: Hoare triple {36631#(not (= ~global~0.base 0))} assume { :end_inline_##fun~~TO~VOID } true;havoc #t~mem6#1.base, #t~mem6#1.offset; {36631#(not (= ~global~0.base 0))} is VALID [2022-02-20 23:38:16,277 INFO L290 TraceCheckUtils]: 21: Hoare triple {36631#(not (= ~global~0.base 0))} assume true; {36631#(not (= ~global~0.base 0))} is VALID [2022-02-20 23:38:16,277 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {36631#(not (= ~global~0.base 0))} {36609#true} #101#return; {36631#(not (= ~global~0.base 0))} is VALID [2022-02-20 23:38:16,277 INFO L272 TraceCheckUtils]: 23: Hoare triple {36631#(not (= ~global~0.base 0))} call parse_input(4, 0); {36656#(= ~global~0.base |old(~global~0.base)|)} is VALID [2022-02-20 23:38:16,278 INFO L290 TraceCheckUtils]: 24: Hoare triple {36656#(= ~global~0.base |old(~global~0.base)|)} ~input#1.base, ~input#1.offset := #in~input#1.base, #in~input#1.offset;~i~0#1 := 0; {36656#(= ~global~0.base |old(~global~0.base)|)} is VALID [2022-02-20 23:38:16,278 INFO L290 TraceCheckUtils]: 25: Hoare triple {36656#(= ~global~0.base |old(~global~0.base)|)} assume !!(~i~0#1 < 2); {36656#(= ~global~0.base |old(~global~0.base)|)} is VALID [2022-02-20 23:38:16,278 INFO L290 TraceCheckUtils]: 26: Hoare triple {36656#(= ~global~0.base |old(~global~0.base)|)} SUMMARY for call #t~mem3#1.base, #t~mem3#1.offset := read~$Pointer$(~#commands~0.base, ~#commands~0.offset + 9 * ~i~0#1, 4); srcloc: L693 {36656#(= ~global~0.base |old(~global~0.base)|)} is VALID [2022-02-20 23:38:16,278 INFO L290 TraceCheckUtils]: 27: Hoare triple {36656#(= ~global~0.base |old(~global~0.base)|)} assume 1 == #valid[#t~mem3#1.base]; {36656#(= ~global~0.base |old(~global~0.base)|)} is VALID [2022-02-20 23:38:16,279 INFO L290 TraceCheckUtils]: 28: Hoare triple {36656#(= ~global~0.base |old(~global~0.base)|)} assume #t~mem3#1.offset < #length[#t~mem3#1.base] && #t~mem3#1.offset >= 0; {36656#(= ~global~0.base |old(~global~0.base)|)} is VALID [2022-02-20 23:38:16,279 INFO L290 TraceCheckUtils]: 29: Hoare triple {36656#(= ~global~0.base |old(~global~0.base)|)} assume 1 == #valid[~input#1.base]; {36656#(= ~global~0.base |old(~global~0.base)|)} is VALID [2022-02-20 23:38:16,279 INFO L290 TraceCheckUtils]: 30: Hoare triple {36656#(= ~global~0.base |old(~global~0.base)|)} assume ~input#1.offset < #length[~input#1.base] && ~input#1.offset >= 0; {36656#(= ~global~0.base |old(~global~0.base)|)} is VALID [2022-02-20 23:38:16,279 INFO L290 TraceCheckUtils]: 31: Hoare triple {36656#(= ~global~0.base |old(~global~0.base)|)} assume 0 == #t~nondet4#1;havoc #t~mem3#1.base, #t~mem3#1.offset;havoc #t~nondet4#1; {36656#(= ~global~0.base |old(~global~0.base)|)} is VALID [2022-02-20 23:38:16,280 INFO L290 TraceCheckUtils]: 32: Hoare triple {36656#(= ~global~0.base |old(~global~0.base)|)} SUMMARY for call #t~mem5#1 := read~int(~#commands~0.base, 8 + (~#commands~0.offset + 9 * ~i~0#1), 1); srcloc: L694 {36656#(= ~global~0.base |old(~global~0.base)|)} is VALID [2022-02-20 23:38:16,280 INFO L290 TraceCheckUtils]: 33: Hoare triple {36656#(= ~global~0.base |old(~global~0.base)|)} assume ~state~0 >= #t~mem5#1;havoc #t~mem5#1; {36656#(= ~global~0.base |old(~global~0.base)|)} is VALID [2022-02-20 23:38:16,280 INFO L290 TraceCheckUtils]: 34: Hoare triple {36656#(= ~global~0.base |old(~global~0.base)|)} SUMMARY for call #t~mem6#1.base, #t~mem6#1.offset := read~$Pointer$(~#commands~0.base, 4 + (~#commands~0.offset + 9 * ~i~0#1), 4); srcloc: L695 {36656#(= ~global~0.base |old(~global~0.base)|)} is VALID [2022-02-20 23:38:16,280 INFO L290 TraceCheckUtils]: 35: Hoare triple {36656#(= ~global~0.base |old(~global~0.base)|)} assume { :begin_inline_##fun~~TO~VOID } true;##fun~~TO~VOID_#in~#fp#1.base, ##fun~~TO~VOID_#in~#fp#1.offset := #t~mem6#1.base, #t~mem6#1.offset; {36656#(= ~global~0.base |old(~global~0.base)|)} is VALID [2022-02-20 23:38:16,281 INFO L290 TraceCheckUtils]: 36: Hoare triple {36656#(= ~global~0.base |old(~global~0.base)|)} assume !(##fun~~TO~VOID_#in~#fp#1.base == #funAddr~c2.base && ##fun~~TO~VOID_#in~#fp#1.offset == #funAddr~c2.offset);assume { :begin_inline_c1 } true;havoc c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset, c1_~x~0#1.base, c1_~x~0#1.offset;call c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset := #Ultimate.allocOnHeap(1);c1_~x~0#1.base, c1_~x~0#1.offset := c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset;havoc c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset; {36656#(= ~global~0.base |old(~global~0.base)|)} is VALID [2022-02-20 23:38:16,281 INFO L290 TraceCheckUtils]: 37: Hoare triple {36656#(= ~global~0.base |old(~global~0.base)|)} assume !(c1_~x~0#1.base == 0 && c1_~x~0#1.offset == 0); {36656#(= ~global~0.base |old(~global~0.base)|)} is VALID [2022-02-20 23:38:16,281 INFO L290 TraceCheckUtils]: 38: Hoare triple {36656#(= ~global~0.base |old(~global~0.base)|)} assume !(~global~0.base != 0 || ~global~0.offset != 0); {36657#(= |old(~global~0.base)| 0)} is VALID [2022-02-20 23:38:16,281 INFO L290 TraceCheckUtils]: 39: Hoare triple {36657#(= |old(~global~0.base)| 0)} ~global~0.base, ~global~0.offset := c1_~x~0#1.base, c1_~x~0#1.offset;~state~0 := ~unnamed3~0~STATE_2; {36657#(= |old(~global~0.base)| 0)} is VALID [2022-02-20 23:38:16,282 INFO L290 TraceCheckUtils]: 40: Hoare triple {36657#(= |old(~global~0.base)| 0)} assume { :end_inline_c1 } true; {36657#(= |old(~global~0.base)| 0)} is VALID [2022-02-20 23:38:16,282 INFO L290 TraceCheckUtils]: 41: Hoare triple {36657#(= |old(~global~0.base)| 0)} assume { :end_inline_##fun~~TO~VOID } true;havoc #t~mem6#1.base, #t~mem6#1.offset; {36657#(= |old(~global~0.base)| 0)} is VALID [2022-02-20 23:38:16,282 INFO L290 TraceCheckUtils]: 42: Hoare triple {36657#(= |old(~global~0.base)| 0)} assume true; {36657#(= |old(~global~0.base)| 0)} is VALID [2022-02-20 23:38:16,283 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {36657#(= |old(~global~0.base)| 0)} {36631#(not (= ~global~0.base 0))} #103#return; {36610#false} is VALID [2022-02-20 23:38:16,283 INFO L272 TraceCheckUtils]: 44: Hoare triple {36610#false} call parse_input(5, 0); {36610#false} is VALID [2022-02-20 23:38:16,283 INFO L290 TraceCheckUtils]: 45: Hoare triple {36610#false} ~input#1.base, ~input#1.offset := #in~input#1.base, #in~input#1.offset;~i~0#1 := 0; {36610#false} is VALID [2022-02-20 23:38:16,283 INFO L290 TraceCheckUtils]: 46: Hoare triple {36610#false} assume !!(~i~0#1 < 2); {36610#false} is VALID [2022-02-20 23:38:16,283 INFO L290 TraceCheckUtils]: 47: Hoare triple {36610#false} assume !(4 + (~#commands~0.offset + 9 * ~i~0#1) <= #length[~#commands~0.base] && 0 <= ~#commands~0.offset + 9 * ~i~0#1); {36610#false} is VALID [2022-02-20 23:38:16,283 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 19 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:38:16,283 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:38:16,463 INFO L290 TraceCheckUtils]: 47: Hoare triple {36610#false} assume !(4 + (~#commands~0.offset + 9 * ~i~0#1) <= #length[~#commands~0.base] && 0 <= ~#commands~0.offset + 9 * ~i~0#1); {36610#false} is VALID [2022-02-20 23:38:16,464 INFO L290 TraceCheckUtils]: 46: Hoare triple {36610#false} assume !!(~i~0#1 < 2); {36610#false} is VALID [2022-02-20 23:38:16,464 INFO L290 TraceCheckUtils]: 45: Hoare triple {36610#false} ~input#1.base, ~input#1.offset := #in~input#1.base, #in~input#1.offset;~i~0#1 := 0; {36610#false} is VALID [2022-02-20 23:38:16,464 INFO L272 TraceCheckUtils]: 44: Hoare triple {36610#false} call parse_input(5, 0); {36610#false} is VALID [2022-02-20 23:38:16,464 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {36657#(= |old(~global~0.base)| 0)} {36631#(not (= ~global~0.base 0))} #103#return; {36610#false} is VALID [2022-02-20 23:38:16,464 INFO L290 TraceCheckUtils]: 42: Hoare triple {36657#(= |old(~global~0.base)| 0)} assume true; {36657#(= |old(~global~0.base)| 0)} is VALID [2022-02-20 23:38:16,465 INFO L290 TraceCheckUtils]: 41: Hoare triple {36657#(= |old(~global~0.base)| 0)} assume { :end_inline_##fun~~TO~VOID } true;havoc #t~mem6#1.base, #t~mem6#1.offset; {36657#(= |old(~global~0.base)| 0)} is VALID [2022-02-20 23:38:16,465 INFO L290 TraceCheckUtils]: 40: Hoare triple {36657#(= |old(~global~0.base)| 0)} assume { :end_inline_c1 } true; {36657#(= |old(~global~0.base)| 0)} is VALID [2022-02-20 23:38:16,465 INFO L290 TraceCheckUtils]: 39: Hoare triple {36657#(= |old(~global~0.base)| 0)} ~global~0.base, ~global~0.offset := c1_~x~0#1.base, c1_~x~0#1.offset;~state~0 := ~unnamed3~0~STATE_2; {36657#(= |old(~global~0.base)| 0)} is VALID [2022-02-20 23:38:16,466 INFO L290 TraceCheckUtils]: 38: Hoare triple {36833#(or (not (= ~global~0.base 0)) (= |old(~global~0.base)| 0))} assume !(~global~0.base != 0 || ~global~0.offset != 0); {36657#(= |old(~global~0.base)| 0)} is VALID [2022-02-20 23:38:16,466 INFO L290 TraceCheckUtils]: 37: Hoare triple {36833#(or (not (= ~global~0.base 0)) (= |old(~global~0.base)| 0))} assume !(c1_~x~0#1.base == 0 && c1_~x~0#1.offset == 0); {36833#(or (not (= ~global~0.base 0)) (= |old(~global~0.base)| 0))} is VALID [2022-02-20 23:38:16,466 INFO L290 TraceCheckUtils]: 36: Hoare triple {36833#(or (not (= ~global~0.base 0)) (= |old(~global~0.base)| 0))} assume !(##fun~~TO~VOID_#in~#fp#1.base == #funAddr~c2.base && ##fun~~TO~VOID_#in~#fp#1.offset == #funAddr~c2.offset);assume { :begin_inline_c1 } true;havoc c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset, c1_~x~0#1.base, c1_~x~0#1.offset;call c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset := #Ultimate.allocOnHeap(1);c1_~x~0#1.base, c1_~x~0#1.offset := c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset;havoc c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset; {36833#(or (not (= ~global~0.base 0)) (= |old(~global~0.base)| 0))} is VALID [2022-02-20 23:38:16,466 INFO L290 TraceCheckUtils]: 35: Hoare triple {36833#(or (not (= ~global~0.base 0)) (= |old(~global~0.base)| 0))} assume { :begin_inline_##fun~~TO~VOID } true;##fun~~TO~VOID_#in~#fp#1.base, ##fun~~TO~VOID_#in~#fp#1.offset := #t~mem6#1.base, #t~mem6#1.offset; {36833#(or (not (= ~global~0.base 0)) (= |old(~global~0.base)| 0))} is VALID [2022-02-20 23:38:16,467 INFO L290 TraceCheckUtils]: 34: Hoare triple {36833#(or (not (= ~global~0.base 0)) (= |old(~global~0.base)| 0))} SUMMARY for call #t~mem6#1.base, #t~mem6#1.offset := read~$Pointer$(~#commands~0.base, 4 + (~#commands~0.offset + 9 * ~i~0#1), 4); srcloc: L695 {36833#(or (not (= ~global~0.base 0)) (= |old(~global~0.base)| 0))} is VALID [2022-02-20 23:38:16,467 INFO L290 TraceCheckUtils]: 33: Hoare triple {36833#(or (not (= ~global~0.base 0)) (= |old(~global~0.base)| 0))} assume ~state~0 >= #t~mem5#1;havoc #t~mem5#1; {36833#(or (not (= ~global~0.base 0)) (= |old(~global~0.base)| 0))} is VALID [2022-02-20 23:38:16,467 INFO L290 TraceCheckUtils]: 32: Hoare triple {36833#(or (not (= ~global~0.base 0)) (= |old(~global~0.base)| 0))} SUMMARY for call #t~mem5#1 := read~int(~#commands~0.base, 8 + (~#commands~0.offset + 9 * ~i~0#1), 1); srcloc: L694 {36833#(or (not (= ~global~0.base 0)) (= |old(~global~0.base)| 0))} is VALID [2022-02-20 23:38:16,467 INFO L290 TraceCheckUtils]: 31: Hoare triple {36833#(or (not (= ~global~0.base 0)) (= |old(~global~0.base)| 0))} assume 0 == #t~nondet4#1;havoc #t~mem3#1.base, #t~mem3#1.offset;havoc #t~nondet4#1; {36833#(or (not (= ~global~0.base 0)) (= |old(~global~0.base)| 0))} is VALID [2022-02-20 23:38:16,468 INFO L290 TraceCheckUtils]: 30: Hoare triple {36833#(or (not (= ~global~0.base 0)) (= |old(~global~0.base)| 0))} assume ~input#1.offset < #length[~input#1.base] && ~input#1.offset >= 0; {36833#(or (not (= ~global~0.base 0)) (= |old(~global~0.base)| 0))} is VALID [2022-02-20 23:38:16,468 INFO L290 TraceCheckUtils]: 29: Hoare triple {36833#(or (not (= ~global~0.base 0)) (= |old(~global~0.base)| 0))} assume 1 == #valid[~input#1.base]; {36833#(or (not (= ~global~0.base 0)) (= |old(~global~0.base)| 0))} is VALID [2022-02-20 23:38:16,468 INFO L290 TraceCheckUtils]: 28: Hoare triple {36833#(or (not (= ~global~0.base 0)) (= |old(~global~0.base)| 0))} assume #t~mem3#1.offset < #length[#t~mem3#1.base] && #t~mem3#1.offset >= 0; {36833#(or (not (= ~global~0.base 0)) (= |old(~global~0.base)| 0))} is VALID [2022-02-20 23:38:16,468 INFO L290 TraceCheckUtils]: 27: Hoare triple {36833#(or (not (= ~global~0.base 0)) (= |old(~global~0.base)| 0))} assume 1 == #valid[#t~mem3#1.base]; {36833#(or (not (= ~global~0.base 0)) (= |old(~global~0.base)| 0))} is VALID [2022-02-20 23:38:16,469 INFO L290 TraceCheckUtils]: 26: Hoare triple {36833#(or (not (= ~global~0.base 0)) (= |old(~global~0.base)| 0))} SUMMARY for call #t~mem3#1.base, #t~mem3#1.offset := read~$Pointer$(~#commands~0.base, ~#commands~0.offset + 9 * ~i~0#1, 4); srcloc: L693 {36833#(or (not (= ~global~0.base 0)) (= |old(~global~0.base)| 0))} is VALID [2022-02-20 23:38:16,469 INFO L290 TraceCheckUtils]: 25: Hoare triple {36833#(or (not (= ~global~0.base 0)) (= |old(~global~0.base)| 0))} assume !!(~i~0#1 < 2); {36833#(or (not (= ~global~0.base 0)) (= |old(~global~0.base)| 0))} is VALID [2022-02-20 23:38:16,469 INFO L290 TraceCheckUtils]: 24: Hoare triple {36833#(or (not (= ~global~0.base 0)) (= |old(~global~0.base)| 0))} ~input#1.base, ~input#1.offset := #in~input#1.base, #in~input#1.offset;~i~0#1 := 0; {36833#(or (not (= ~global~0.base 0)) (= |old(~global~0.base)| 0))} is VALID [2022-02-20 23:38:16,470 INFO L272 TraceCheckUtils]: 23: Hoare triple {36631#(not (= ~global~0.base 0))} call parse_input(4, 0); {36833#(or (not (= ~global~0.base 0)) (= |old(~global~0.base)| 0))} is VALID [2022-02-20 23:38:16,477 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {36631#(not (= ~global~0.base 0))} {36609#true} #101#return; {36631#(not (= ~global~0.base 0))} is VALID [2022-02-20 23:38:16,477 INFO L290 TraceCheckUtils]: 21: Hoare triple {36631#(not (= ~global~0.base 0))} assume true; {36631#(not (= ~global~0.base 0))} is VALID [2022-02-20 23:38:16,477 INFO L290 TraceCheckUtils]: 20: Hoare triple {36631#(not (= ~global~0.base 0))} assume { :end_inline_##fun~~TO~VOID } true;havoc #t~mem6#1.base, #t~mem6#1.offset; {36631#(not (= ~global~0.base 0))} is VALID [2022-02-20 23:38:16,478 INFO L290 TraceCheckUtils]: 19: Hoare triple {36631#(not (= ~global~0.base 0))} assume { :end_inline_c1 } true; {36631#(not (= ~global~0.base 0))} is VALID [2022-02-20 23:38:16,478 INFO L290 TraceCheckUtils]: 18: Hoare triple {36706#(not (= |parse_input_c1_~x~0#1.base| 0))} ~global~0.base, ~global~0.offset := c1_~x~0#1.base, c1_~x~0#1.offset;~state~0 := ~unnamed3~0~STATE_2; {36631#(not (= ~global~0.base 0))} is VALID [2022-02-20 23:38:16,478 INFO L290 TraceCheckUtils]: 17: Hoare triple {36706#(not (= |parse_input_c1_~x~0#1.base| 0))} assume !(~global~0.base != 0 || ~global~0.offset != 0); {36706#(not (= |parse_input_c1_~x~0#1.base| 0))} is VALID [2022-02-20 23:38:16,479 INFO L290 TraceCheckUtils]: 16: Hoare triple {36706#(not (= |parse_input_c1_~x~0#1.base| 0))} assume !(c1_~x~0#1.base == 0 && c1_~x~0#1.offset == 0); {36706#(not (= |parse_input_c1_~x~0#1.base| 0))} is VALID [2022-02-20 23:38:16,479 INFO L290 TraceCheckUtils]: 15: Hoare triple {36609#true} assume !(##fun~~TO~VOID_#in~#fp#1.base == #funAddr~c2.base && ##fun~~TO~VOID_#in~#fp#1.offset == #funAddr~c2.offset);assume { :begin_inline_c1 } true;havoc c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset, c1_~x~0#1.base, c1_~x~0#1.offset;call c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset := #Ultimate.allocOnHeap(1);c1_~x~0#1.base, c1_~x~0#1.offset := c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset;havoc c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset; {36706#(not (= |parse_input_c1_~x~0#1.base| 0))} is VALID [2022-02-20 23:38:16,479 INFO L290 TraceCheckUtils]: 14: Hoare triple {36609#true} assume { :begin_inline_##fun~~TO~VOID } true;##fun~~TO~VOID_#in~#fp#1.base, ##fun~~TO~VOID_#in~#fp#1.offset := #t~mem6#1.base, #t~mem6#1.offset; {36609#true} is VALID [2022-02-20 23:38:16,479 INFO L290 TraceCheckUtils]: 13: Hoare triple {36609#true} SUMMARY for call #t~mem6#1.base, #t~mem6#1.offset := read~$Pointer$(~#commands~0.base, 4 + (~#commands~0.offset + 9 * ~i~0#1), 4); srcloc: L695 {36609#true} is VALID [2022-02-20 23:38:16,479 INFO L290 TraceCheckUtils]: 12: Hoare triple {36609#true} assume ~state~0 >= #t~mem5#1;havoc #t~mem5#1; {36609#true} is VALID [2022-02-20 23:38:16,479 INFO L290 TraceCheckUtils]: 11: Hoare triple {36609#true} SUMMARY for call #t~mem5#1 := read~int(~#commands~0.base, 8 + (~#commands~0.offset + 9 * ~i~0#1), 1); srcloc: L694 {36609#true} is VALID [2022-02-20 23:38:16,479 INFO L290 TraceCheckUtils]: 10: Hoare triple {36609#true} assume 0 == #t~nondet4#1;havoc #t~mem3#1.base, #t~mem3#1.offset;havoc #t~nondet4#1; {36609#true} is VALID [2022-02-20 23:38:16,479 INFO L290 TraceCheckUtils]: 9: Hoare triple {36609#true} assume ~input#1.offset < #length[~input#1.base] && ~input#1.offset >= 0; {36609#true} is VALID [2022-02-20 23:38:16,479 INFO L290 TraceCheckUtils]: 8: Hoare triple {36609#true} assume 1 == #valid[~input#1.base]; {36609#true} is VALID [2022-02-20 23:38:16,479 INFO L290 TraceCheckUtils]: 7: Hoare triple {36609#true} assume #t~mem3#1.offset < #length[#t~mem3#1.base] && #t~mem3#1.offset >= 0; {36609#true} is VALID [2022-02-20 23:38:16,480 INFO L290 TraceCheckUtils]: 6: Hoare triple {36609#true} assume 1 == #valid[#t~mem3#1.base]; {36609#true} is VALID [2022-02-20 23:38:16,480 INFO L290 TraceCheckUtils]: 5: Hoare triple {36609#true} SUMMARY for call #t~mem3#1.base, #t~mem3#1.offset := read~$Pointer$(~#commands~0.base, ~#commands~0.offset + 9 * ~i~0#1, 4); srcloc: L693 {36609#true} is VALID [2022-02-20 23:38:16,480 INFO L290 TraceCheckUtils]: 4: Hoare triple {36609#true} assume !!(~i~0#1 < 2); {36609#true} is VALID [2022-02-20 23:38:16,480 INFO L290 TraceCheckUtils]: 3: Hoare triple {36609#true} ~input#1.base, ~input#1.offset := #in~input#1.base, #in~input#1.offset;~i~0#1 := 0; {36609#true} is VALID [2022-02-20 23:38:16,480 INFO L272 TraceCheckUtils]: 2: Hoare triple {36609#true} call parse_input(3, 0); {36609#true} is VALID [2022-02-20 23:38:16,480 INFO L290 TraceCheckUtils]: 1: Hoare triple {36609#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1; {36609#true} is VALID [2022-02-20 23:38:16,480 INFO L290 TraceCheckUtils]: 0: Hoare triple {36609#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(3, 1);call write~init~int(99, 1, 0, 1);call write~init~int(49, 1, 1, 1);call write~init~int(0, 1, 2, 1);call #Ultimate.allocInit(3, 2);call write~init~int(99, 2, 0, 1);call write~init~int(50, 2, 1, 1);call write~init~int(0, 2, 2, 1);call #Ultimate.allocInit(3, 3);call write~init~int(99, 3, 0, 1);call write~init~int(49, 3, 1, 1);call write~init~int(0, 3, 2, 1);call #Ultimate.allocInit(3, 4);call write~init~int(99, 4, 0, 1);call write~init~int(49, 4, 1, 1);call write~init~int(0, 4, 2, 1);call #Ultimate.allocInit(3, 5);call write~init~int(99, 5, 0, 1);call write~init~int(50, 5, 1, 1);call write~init~int(0, 5, 2, 1);~state~0 := ~unnamed3~0~STATE_1;~global~0.base, ~global~0.offset := 0, 0;~#commands~0.base, ~#commands~0.offset := 6, 0;call #Ultimate.allocInit(18, 6);call write~init~$Pointer$(1, 0, ~#commands~0.base, ~#commands~0.offset, 4);call write~init~$Pointer$(#funAddr~c1.base, #funAddr~c1.offset, ~#commands~0.base, 4 + ~#commands~0.offset, 4);call write~init~int((if ~unnamed3~0~STATE_1 % 256 <= 127 then ~unnamed3~0~STATE_1 % 256 else ~unnamed3~0~STATE_1 % 256 - 256), ~#commands~0.base, 8 + ~#commands~0.offset, 1);call write~init~$Pointer$(2, 0, ~#commands~0.base, 9 + ~#commands~0.offset, 4);call write~init~$Pointer$(#funAddr~c2.base, #funAddr~c2.offset, ~#commands~0.base, 13 + ~#commands~0.offset, 4);call write~init~int((if ~unnamed3~0~STATE_2 % 256 <= 127 then ~unnamed3~0~STATE_2 % 256 else ~unnamed3~0~STATE_2 % 256 - 256), ~#commands~0.base, 17 + ~#commands~0.offset, 1); {36609#true} is VALID [2022-02-20 23:38:16,480 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 19 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:38:16,480 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1932404225] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 23:38:16,480 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 23:38:16,480 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6, 6] total 11 [2022-02-20 23:38:16,480 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519716406] [2022-02-20 23:38:16,481 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 23:38:16,481 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.636363636363637) internal successors, (73), 10 states have internal predecessors, (73), 3 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 48 [2022-02-20 23:38:16,481 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:38:16,481 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 6.636363636363637) internal successors, (73), 10 states have internal predecessors, (73), 3 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 23:38:16,527 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:38:16,527 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-02-20 23:38:16,528 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:38:16,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-02-20 23:38:16,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-02-20 23:38:16,528 INFO L87 Difference]: Start difference. First operand 428 states and 534 transitions. Second operand has 11 states, 11 states have (on average 6.636363636363637) internal successors, (73), 10 states have internal predecessors, (73), 3 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 23:38:17,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:38:17,206 INFO L93 Difference]: Finished difference Result 397 states and 476 transitions. [2022-02-20 23:38:17,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-02-20 23:38:17,206 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.636363636363637) internal successors, (73), 10 states have internal predecessors, (73), 3 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 48 [2022-02-20 23:38:17,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:38:17,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 6.636363636363637) internal successors, (73), 10 states have internal predecessors, (73), 3 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 23:38:17,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 107 transitions. [2022-02-20 23:38:17,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 6.636363636363637) internal successors, (73), 10 states have internal predecessors, (73), 3 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 23:38:17,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 107 transitions. [2022-02-20 23:38:17,208 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 107 transitions. [2022-02-20 23:38:17,280 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 107 edges. 107 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:38:17,286 INFO L225 Difference]: With dead ends: 397 [2022-02-20 23:38:17,286 INFO L226 Difference]: Without dead ends: 397 [2022-02-20 23:38:17,287 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=103, Invalid=277, Unknown=0, NotChecked=0, Total=380 [2022-02-20 23:38:17,287 INFO L933 BasicCegarLoop]: 39 mSDtfsCounter, 263 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 282 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 263 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 333 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 282 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 23:38:17,288 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [263 Valid, 164 Invalid, 333 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 282 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-20 23:38:17,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2022-02-20 23:38:17,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 368. [2022-02-20 23:38:17,293 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:38:17,293 INFO L82 GeneralOperation]: Start isEquivalent. First operand 397 states. Second operand has 368 states, 334 states have (on average 1.2754491017964071) internal successors, (426), 351 states have internal predecessors, (426), 8 states have call successors, (8), 8 states have call predecessors, (8), 13 states have return successors, (16), 8 states have call predecessors, (16), 8 states have call successors, (16) [2022-02-20 23:38:17,294 INFO L74 IsIncluded]: Start isIncluded. First operand 397 states. Second operand has 368 states, 334 states have (on average 1.2754491017964071) internal successors, (426), 351 states have internal predecessors, (426), 8 states have call successors, (8), 8 states have call predecessors, (8), 13 states have return successors, (16), 8 states have call predecessors, (16), 8 states have call successors, (16) [2022-02-20 23:38:17,294 INFO L87 Difference]: Start difference. First operand 397 states. Second operand has 368 states, 334 states have (on average 1.2754491017964071) internal successors, (426), 351 states have internal predecessors, (426), 8 states have call successors, (8), 8 states have call predecessors, (8), 13 states have return successors, (16), 8 states have call predecessors, (16), 8 states have call successors, (16) [2022-02-20 23:38:17,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:38:17,299 INFO L93 Difference]: Finished difference Result 397 states and 476 transitions. [2022-02-20 23:38:17,300 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 476 transitions. [2022-02-20 23:38:17,300 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:38:17,300 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:38:17,300 INFO L74 IsIncluded]: Start isIncluded. First operand has 368 states, 334 states have (on average 1.2754491017964071) internal successors, (426), 351 states have internal predecessors, (426), 8 states have call successors, (8), 8 states have call predecessors, (8), 13 states have return successors, (16), 8 states have call predecessors, (16), 8 states have call successors, (16) Second operand 397 states. [2022-02-20 23:38:17,301 INFO L87 Difference]: Start difference. First operand has 368 states, 334 states have (on average 1.2754491017964071) internal successors, (426), 351 states have internal predecessors, (426), 8 states have call successors, (8), 8 states have call predecessors, (8), 13 states have return successors, (16), 8 states have call predecessors, (16), 8 states have call successors, (16) Second operand 397 states. [2022-02-20 23:38:17,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:38:17,307 INFO L93 Difference]: Finished difference Result 397 states and 476 transitions. [2022-02-20 23:38:17,307 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 476 transitions. [2022-02-20 23:38:17,307 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:38:17,308 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:38:17,308 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:38:17,308 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:38:17,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 368 states, 334 states have (on average 1.2754491017964071) internal successors, (426), 351 states have internal predecessors, (426), 8 states have call successors, (8), 8 states have call predecessors, (8), 13 states have return successors, (16), 8 states have call predecessors, (16), 8 states have call successors, (16) [2022-02-20 23:38:17,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 450 transitions. [2022-02-20 23:38:17,313 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 450 transitions. Word has length 48 [2022-02-20 23:38:17,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:38:17,313 INFO L470 AbstractCegarLoop]: Abstraction has 368 states and 450 transitions. [2022-02-20 23:38:17,313 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.636363636363637) internal successors, (73), 10 states have internal predecessors, (73), 3 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 23:38:17,313 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 450 transitions. [2022-02-20 23:38:17,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-02-20 23:38:17,314 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:38:17,314 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:38:17,333 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-02-20 23:38:17,515 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2022-02-20 23:38:17,516 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting parse_inputErr11ASSERT_VIOLATIONMEMORY_FREE === [parse_inputErr0REQUIRES_VIOLATION, parse_inputErr1REQUIRES_VIOLATION, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2022-02-20 23:38:17,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:38:17,516 INFO L85 PathProgramCache]: Analyzing trace with hash 1661228621, now seen corresponding path program 1 times [2022-02-20 23:38:17,516 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:38:17,516 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101123820] [2022-02-20 23:38:17,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:38:17,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:38:17,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:38:17,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 23:38:17,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:38:17,560 INFO L290 TraceCheckUtils]: 0: Hoare triple {38546#(and (= ~global~0.base |old(~global~0.base)|) (= |old(#length)| |#length|) (= |old(~global~0.offset)| ~global~0.offset) (= ~state~0 |old(~state~0)|) (= |old(#valid)| |#valid|))} ~input#1.base, ~input#1.offset := #in~input#1.base, #in~input#1.offset;~i~0#1 := 0; {38523#true} is VALID [2022-02-20 23:38:17,560 INFO L290 TraceCheckUtils]: 1: Hoare triple {38523#true} assume !!(~i~0#1 < 2); {38523#true} is VALID [2022-02-20 23:38:17,560 INFO L290 TraceCheckUtils]: 2: Hoare triple {38523#true} SUMMARY for call #t~mem3#1.base, #t~mem3#1.offset := read~$Pointer$(~#commands~0.base, ~#commands~0.offset + 9 * ~i~0#1, 4); srcloc: L693 {38523#true} is VALID [2022-02-20 23:38:17,561 INFO L290 TraceCheckUtils]: 3: Hoare triple {38523#true} assume 1 == #valid[#t~mem3#1.base]; {38523#true} is VALID [2022-02-20 23:38:17,561 INFO L290 TraceCheckUtils]: 4: Hoare triple {38523#true} assume #t~mem3#1.offset < #length[#t~mem3#1.base] && #t~mem3#1.offset >= 0; {38523#true} is VALID [2022-02-20 23:38:17,561 INFO L290 TraceCheckUtils]: 5: Hoare triple {38523#true} assume 1 == #valid[~input#1.base]; {38523#true} is VALID [2022-02-20 23:38:17,561 INFO L290 TraceCheckUtils]: 6: Hoare triple {38523#true} assume ~input#1.offset < #length[~input#1.base] && ~input#1.offset >= 0; {38523#true} is VALID [2022-02-20 23:38:17,561 INFO L290 TraceCheckUtils]: 7: Hoare triple {38523#true} assume 0 == #t~nondet4#1;havoc #t~mem3#1.base, #t~mem3#1.offset;havoc #t~nondet4#1; {38523#true} is VALID [2022-02-20 23:38:17,561 INFO L290 TraceCheckUtils]: 8: Hoare triple {38523#true} SUMMARY for call #t~mem5#1 := read~int(~#commands~0.base, 8 + (~#commands~0.offset + 9 * ~i~0#1), 1); srcloc: L694 {38523#true} is VALID [2022-02-20 23:38:17,561 INFO L290 TraceCheckUtils]: 9: Hoare triple {38523#true} assume ~state~0 >= #t~mem5#1;havoc #t~mem5#1; {38523#true} is VALID [2022-02-20 23:38:17,561 INFO L290 TraceCheckUtils]: 10: Hoare triple {38523#true} SUMMARY for call #t~mem6#1.base, #t~mem6#1.offset := read~$Pointer$(~#commands~0.base, 4 + (~#commands~0.offset + 9 * ~i~0#1), 4); srcloc: L695 {38523#true} is VALID [2022-02-20 23:38:17,562 INFO L290 TraceCheckUtils]: 11: Hoare triple {38523#true} assume { :begin_inline_##fun~~TO~VOID } true;##fun~~TO~VOID_#in~#fp#1.base, ##fun~~TO~VOID_#in~#fp#1.offset := #t~mem6#1.base, #t~mem6#1.offset; {38523#true} is VALID [2022-02-20 23:38:17,562 INFO L290 TraceCheckUtils]: 12: Hoare triple {38523#true} assume !(##fun~~TO~VOID_#in~#fp#1.base == #funAddr~c2.base && ##fun~~TO~VOID_#in~#fp#1.offset == #funAddr~c2.offset);assume { :begin_inline_c1 } true;havoc c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset, c1_~x~0#1.base, c1_~x~0#1.offset;call c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset := #Ultimate.allocOnHeap(1);c1_~x~0#1.base, c1_~x~0#1.offset := c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset;havoc c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset; {38523#true} is VALID [2022-02-20 23:38:17,562 INFO L290 TraceCheckUtils]: 13: Hoare triple {38523#true} assume !(c1_~x~0#1.base == 0 && c1_~x~0#1.offset == 0); {38523#true} is VALID [2022-02-20 23:38:17,562 INFO L290 TraceCheckUtils]: 14: Hoare triple {38523#true} assume !(~global~0.base != 0 || ~global~0.offset != 0); {38523#true} is VALID [2022-02-20 23:38:17,562 INFO L290 TraceCheckUtils]: 15: Hoare triple {38523#true} ~global~0.base, ~global~0.offset := c1_~x~0#1.base, c1_~x~0#1.offset;~state~0 := ~unnamed3~0~STATE_2; {38523#true} is VALID [2022-02-20 23:38:17,562 INFO L290 TraceCheckUtils]: 16: Hoare triple {38523#true} assume { :end_inline_c1 } true; {38523#true} is VALID [2022-02-20 23:38:17,562 INFO L290 TraceCheckUtils]: 17: Hoare triple {38523#true} assume { :end_inline_##fun~~TO~VOID } true;havoc #t~mem6#1.base, #t~mem6#1.offset; {38523#true} is VALID [2022-02-20 23:38:17,562 INFO L290 TraceCheckUtils]: 18: Hoare triple {38523#true} assume true; {38523#true} is VALID [2022-02-20 23:38:17,563 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {38523#true} {38523#true} #101#return; {38523#true} is VALID [2022-02-20 23:38:17,563 INFO L290 TraceCheckUtils]: 0: Hoare triple {38523#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(3, 1);call write~init~int(99, 1, 0, 1);call write~init~int(49, 1, 1, 1);call write~init~int(0, 1, 2, 1);call #Ultimate.allocInit(3, 2);call write~init~int(99, 2, 0, 1);call write~init~int(50, 2, 1, 1);call write~init~int(0, 2, 2, 1);call #Ultimate.allocInit(3, 3);call write~init~int(99, 3, 0, 1);call write~init~int(49, 3, 1, 1);call write~init~int(0, 3, 2, 1);call #Ultimate.allocInit(3, 4);call write~init~int(99, 4, 0, 1);call write~init~int(49, 4, 1, 1);call write~init~int(0, 4, 2, 1);call #Ultimate.allocInit(3, 5);call write~init~int(99, 5, 0, 1);call write~init~int(50, 5, 1, 1);call write~init~int(0, 5, 2, 1);~state~0 := ~unnamed3~0~STATE_1;~global~0.base, ~global~0.offset := 0, 0;~#commands~0.base, ~#commands~0.offset := 6, 0;call #Ultimate.allocInit(18, 6);call write~init~$Pointer$(1, 0, ~#commands~0.base, ~#commands~0.offset, 4);call write~init~$Pointer$(#funAddr~c1.base, #funAddr~c1.offset, ~#commands~0.base, 4 + ~#commands~0.offset, 4);call write~init~int((if ~unnamed3~0~STATE_1 % 256 <= 127 then ~unnamed3~0~STATE_1 % 256 else ~unnamed3~0~STATE_1 % 256 - 256), ~#commands~0.base, 8 + ~#commands~0.offset, 1);call write~init~$Pointer$(2, 0, ~#commands~0.base, 9 + ~#commands~0.offset, 4);call write~init~$Pointer$(#funAddr~c2.base, #funAddr~c2.offset, ~#commands~0.base, 13 + ~#commands~0.offset, 4);call write~init~int((if ~unnamed3~0~STATE_2 % 256 <= 127 then ~unnamed3~0~STATE_2 % 256 else ~unnamed3~0~STATE_2 % 256 - 256), ~#commands~0.base, 17 + ~#commands~0.offset, 1); {38523#true} is VALID [2022-02-20 23:38:17,563 INFO L290 TraceCheckUtils]: 1: Hoare triple {38523#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1; {38523#true} is VALID [2022-02-20 23:38:17,564 INFO L272 TraceCheckUtils]: 2: Hoare triple {38523#true} call parse_input(3, 0); {38546#(and (= ~global~0.base |old(~global~0.base)|) (= |old(#length)| |#length|) (= |old(~global~0.offset)| ~global~0.offset) (= ~state~0 |old(~state~0)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 23:38:17,564 INFO L290 TraceCheckUtils]: 3: Hoare triple {38546#(and (= ~global~0.base |old(~global~0.base)|) (= |old(#length)| |#length|) (= |old(~global~0.offset)| ~global~0.offset) (= ~state~0 |old(~state~0)|) (= |old(#valid)| |#valid|))} ~input#1.base, ~input#1.offset := #in~input#1.base, #in~input#1.offset;~i~0#1 := 0; {38523#true} is VALID [2022-02-20 23:38:17,564 INFO L290 TraceCheckUtils]: 4: Hoare triple {38523#true} assume !!(~i~0#1 < 2); {38523#true} is VALID [2022-02-20 23:38:17,564 INFO L290 TraceCheckUtils]: 5: Hoare triple {38523#true} SUMMARY for call #t~mem3#1.base, #t~mem3#1.offset := read~$Pointer$(~#commands~0.base, ~#commands~0.offset + 9 * ~i~0#1, 4); srcloc: L693 {38523#true} is VALID [2022-02-20 23:38:17,564 INFO L290 TraceCheckUtils]: 6: Hoare triple {38523#true} assume 1 == #valid[#t~mem3#1.base]; {38523#true} is VALID [2022-02-20 23:38:17,564 INFO L290 TraceCheckUtils]: 7: Hoare triple {38523#true} assume #t~mem3#1.offset < #length[#t~mem3#1.base] && #t~mem3#1.offset >= 0; {38523#true} is VALID [2022-02-20 23:38:17,564 INFO L290 TraceCheckUtils]: 8: Hoare triple {38523#true} assume 1 == #valid[~input#1.base]; {38523#true} is VALID [2022-02-20 23:38:17,564 INFO L290 TraceCheckUtils]: 9: Hoare triple {38523#true} assume ~input#1.offset < #length[~input#1.base] && ~input#1.offset >= 0; {38523#true} is VALID [2022-02-20 23:38:17,565 INFO L290 TraceCheckUtils]: 10: Hoare triple {38523#true} assume 0 == #t~nondet4#1;havoc #t~mem3#1.base, #t~mem3#1.offset;havoc #t~nondet4#1; {38523#true} is VALID [2022-02-20 23:38:17,565 INFO L290 TraceCheckUtils]: 11: Hoare triple {38523#true} SUMMARY for call #t~mem5#1 := read~int(~#commands~0.base, 8 + (~#commands~0.offset + 9 * ~i~0#1), 1); srcloc: L694 {38523#true} is VALID [2022-02-20 23:38:17,565 INFO L290 TraceCheckUtils]: 12: Hoare triple {38523#true} assume ~state~0 >= #t~mem5#1;havoc #t~mem5#1; {38523#true} is VALID [2022-02-20 23:38:17,565 INFO L290 TraceCheckUtils]: 13: Hoare triple {38523#true} SUMMARY for call #t~mem6#1.base, #t~mem6#1.offset := read~$Pointer$(~#commands~0.base, 4 + (~#commands~0.offset + 9 * ~i~0#1), 4); srcloc: L695 {38523#true} is VALID [2022-02-20 23:38:17,565 INFO L290 TraceCheckUtils]: 14: Hoare triple {38523#true} assume { :begin_inline_##fun~~TO~VOID } true;##fun~~TO~VOID_#in~#fp#1.base, ##fun~~TO~VOID_#in~#fp#1.offset := #t~mem6#1.base, #t~mem6#1.offset; {38523#true} is VALID [2022-02-20 23:38:17,565 INFO L290 TraceCheckUtils]: 15: Hoare triple {38523#true} assume !(##fun~~TO~VOID_#in~#fp#1.base == #funAddr~c2.base && ##fun~~TO~VOID_#in~#fp#1.offset == #funAddr~c2.offset);assume { :begin_inline_c1 } true;havoc c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset, c1_~x~0#1.base, c1_~x~0#1.offset;call c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset := #Ultimate.allocOnHeap(1);c1_~x~0#1.base, c1_~x~0#1.offset := c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset;havoc c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset; {38523#true} is VALID [2022-02-20 23:38:17,565 INFO L290 TraceCheckUtils]: 16: Hoare triple {38523#true} assume !(c1_~x~0#1.base == 0 && c1_~x~0#1.offset == 0); {38523#true} is VALID [2022-02-20 23:38:17,565 INFO L290 TraceCheckUtils]: 17: Hoare triple {38523#true} assume !(~global~0.base != 0 || ~global~0.offset != 0); {38523#true} is VALID [2022-02-20 23:38:17,566 INFO L290 TraceCheckUtils]: 18: Hoare triple {38523#true} ~global~0.base, ~global~0.offset := c1_~x~0#1.base, c1_~x~0#1.offset;~state~0 := ~unnamed3~0~STATE_2; {38523#true} is VALID [2022-02-20 23:38:17,566 INFO L290 TraceCheckUtils]: 19: Hoare triple {38523#true} assume { :end_inline_c1 } true; {38523#true} is VALID [2022-02-20 23:38:17,566 INFO L290 TraceCheckUtils]: 20: Hoare triple {38523#true} assume { :end_inline_##fun~~TO~VOID } true;havoc #t~mem6#1.base, #t~mem6#1.offset; {38523#true} is VALID [2022-02-20 23:38:17,566 INFO L290 TraceCheckUtils]: 21: Hoare triple {38523#true} assume true; {38523#true} is VALID [2022-02-20 23:38:17,566 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {38523#true} {38523#true} #101#return; {38523#true} is VALID [2022-02-20 23:38:17,566 INFO L272 TraceCheckUtils]: 23: Hoare triple {38523#true} call parse_input(4, 0); {38523#true} is VALID [2022-02-20 23:38:17,566 INFO L290 TraceCheckUtils]: 24: Hoare triple {38523#true} ~input#1.base, ~input#1.offset := #in~input#1.base, #in~input#1.offset;~i~0#1 := 0; {38523#true} is VALID [2022-02-20 23:38:17,566 INFO L290 TraceCheckUtils]: 25: Hoare triple {38523#true} assume !!(~i~0#1 < 2); {38523#true} is VALID [2022-02-20 23:38:17,566 INFO L290 TraceCheckUtils]: 26: Hoare triple {38523#true} SUMMARY for call #t~mem3#1.base, #t~mem3#1.offset := read~$Pointer$(~#commands~0.base, ~#commands~0.offset + 9 * ~i~0#1, 4); srcloc: L693 {38523#true} is VALID [2022-02-20 23:38:17,567 INFO L290 TraceCheckUtils]: 27: Hoare triple {38523#true} assume 1 == #valid[#t~mem3#1.base]; {38523#true} is VALID [2022-02-20 23:38:17,567 INFO L290 TraceCheckUtils]: 28: Hoare triple {38523#true} assume #t~mem3#1.offset < #length[#t~mem3#1.base] && #t~mem3#1.offset >= 0; {38523#true} is VALID [2022-02-20 23:38:17,567 INFO L290 TraceCheckUtils]: 29: Hoare triple {38523#true} assume 1 == #valid[~input#1.base]; {38523#true} is VALID [2022-02-20 23:38:17,567 INFO L290 TraceCheckUtils]: 30: Hoare triple {38523#true} assume ~input#1.offset < #length[~input#1.base] && ~input#1.offset >= 0; {38523#true} is VALID [2022-02-20 23:38:17,567 INFO L290 TraceCheckUtils]: 31: Hoare triple {38523#true} assume !(0 == #t~nondet4#1);havoc #t~mem3#1.base, #t~mem3#1.offset;havoc #t~nondet4#1; {38523#true} is VALID [2022-02-20 23:38:17,567 INFO L290 TraceCheckUtils]: 32: Hoare triple {38523#true} #t~post2#1 := ~i~0#1;~i~0#1 := 1 + #t~post2#1;havoc #t~post2#1; {38523#true} is VALID [2022-02-20 23:38:17,567 INFO L290 TraceCheckUtils]: 33: Hoare triple {38523#true} assume !!(~i~0#1 < 2); {38523#true} is VALID [2022-02-20 23:38:17,567 INFO L290 TraceCheckUtils]: 34: Hoare triple {38523#true} SUMMARY for call #t~mem3#1.base, #t~mem3#1.offset := read~$Pointer$(~#commands~0.base, ~#commands~0.offset + 9 * ~i~0#1, 4); srcloc: L693 {38523#true} is VALID [2022-02-20 23:38:17,568 INFO L290 TraceCheckUtils]: 35: Hoare triple {38523#true} assume 1 == #valid[#t~mem3#1.base]; {38523#true} is VALID [2022-02-20 23:38:17,568 INFO L290 TraceCheckUtils]: 36: Hoare triple {38523#true} assume #t~mem3#1.offset < #length[#t~mem3#1.base] && #t~mem3#1.offset >= 0; {38523#true} is VALID [2022-02-20 23:38:17,568 INFO L290 TraceCheckUtils]: 37: Hoare triple {38523#true} assume 1 == #valid[~input#1.base]; {38523#true} is VALID [2022-02-20 23:38:17,568 INFO L290 TraceCheckUtils]: 38: Hoare triple {38523#true} assume ~input#1.offset < #length[~input#1.base] && ~input#1.offset >= 0; {38523#true} is VALID [2022-02-20 23:38:17,568 INFO L290 TraceCheckUtils]: 39: Hoare triple {38523#true} assume 0 == #t~nondet4#1;havoc #t~mem3#1.base, #t~mem3#1.offset;havoc #t~nondet4#1; {38523#true} is VALID [2022-02-20 23:38:17,568 INFO L290 TraceCheckUtils]: 40: Hoare triple {38523#true} SUMMARY for call #t~mem5#1 := read~int(~#commands~0.base, 8 + (~#commands~0.offset + 9 * ~i~0#1), 1); srcloc: L694 {38523#true} is VALID [2022-02-20 23:38:17,568 INFO L290 TraceCheckUtils]: 41: Hoare triple {38523#true} assume ~state~0 >= #t~mem5#1;havoc #t~mem5#1; {38523#true} is VALID [2022-02-20 23:38:17,568 INFO L290 TraceCheckUtils]: 42: Hoare triple {38523#true} SUMMARY for call #t~mem6#1.base, #t~mem6#1.offset := read~$Pointer$(~#commands~0.base, 4 + (~#commands~0.offset + 9 * ~i~0#1), 4); srcloc: L695 {38523#true} is VALID [2022-02-20 23:38:17,568 INFO L290 TraceCheckUtils]: 43: Hoare triple {38523#true} assume { :begin_inline_##fun~~TO~VOID } true;##fun~~TO~VOID_#in~#fp#1.base, ##fun~~TO~VOID_#in~#fp#1.offset := #t~mem6#1.base, #t~mem6#1.offset; {38523#true} is VALID [2022-02-20 23:38:17,569 INFO L290 TraceCheckUtils]: 44: Hoare triple {38523#true} assume ##fun~~TO~VOID_#in~#fp#1.base == #funAddr~c2.base && ##fun~~TO~VOID_#in~#fp#1.offset == #funAddr~c2.offset;assume { :begin_inline_c2 } true;havoc c2_~y~0#1.base, c2_~y~0#1.offset;c2_~y~0#1.base, c2_~y~0#1.offset := 0, 0; {38545#(and (= |parse_input_c2_~y~0#1.base| 0) (= |parse_input_c2_~y~0#1.offset| 0))} is VALID [2022-02-20 23:38:17,569 INFO L290 TraceCheckUtils]: 45: Hoare triple {38545#(and (= |parse_input_c2_~y~0#1.base| 0) (= |parse_input_c2_~y~0#1.offset| 0))} assume !((c2_~y~0#1.base == 0 && c2_~y~0#1.offset == 0) || (~global~0.base == 0 && ~global~0.offset == 0)); {38524#false} is VALID [2022-02-20 23:38:17,569 INFO L290 TraceCheckUtils]: 46: Hoare triple {38524#false} assume 0 == c2_~y~0#1.offset; {38524#false} is VALID [2022-02-20 23:38:17,570 INFO L290 TraceCheckUtils]: 47: Hoare triple {38524#false} assume !(c2_~y~0#1.base < #StackHeapBarrier); {38524#false} is VALID [2022-02-20 23:38:17,571 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-02-20 23:38:17,571 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:38:17,571 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101123820] [2022-02-20 23:38:17,571 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [101123820] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 23:38:17,571 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [308808013] [2022-02-20 23:38:17,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:38:17,571 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:38:17,572 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:38:17,573 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 23:38:17,608 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-02-20 23:38:17,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:38:17,650 INFO L263 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-20 23:38:17,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:38:17,659 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:38:17,813 INFO L290 TraceCheckUtils]: 0: Hoare triple {38523#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(3, 1);call write~init~int(99, 1, 0, 1);call write~init~int(49, 1, 1, 1);call write~init~int(0, 1, 2, 1);call #Ultimate.allocInit(3, 2);call write~init~int(99, 2, 0, 1);call write~init~int(50, 2, 1, 1);call write~init~int(0, 2, 2, 1);call #Ultimate.allocInit(3, 3);call write~init~int(99, 3, 0, 1);call write~init~int(49, 3, 1, 1);call write~init~int(0, 3, 2, 1);call #Ultimate.allocInit(3, 4);call write~init~int(99, 4, 0, 1);call write~init~int(49, 4, 1, 1);call write~init~int(0, 4, 2, 1);call #Ultimate.allocInit(3, 5);call write~init~int(99, 5, 0, 1);call write~init~int(50, 5, 1, 1);call write~init~int(0, 5, 2, 1);~state~0 := ~unnamed3~0~STATE_1;~global~0.base, ~global~0.offset := 0, 0;~#commands~0.base, ~#commands~0.offset := 6, 0;call #Ultimate.allocInit(18, 6);call write~init~$Pointer$(1, 0, ~#commands~0.base, ~#commands~0.offset, 4);call write~init~$Pointer$(#funAddr~c1.base, #funAddr~c1.offset, ~#commands~0.base, 4 + ~#commands~0.offset, 4);call write~init~int((if ~unnamed3~0~STATE_1 % 256 <= 127 then ~unnamed3~0~STATE_1 % 256 else ~unnamed3~0~STATE_1 % 256 - 256), ~#commands~0.base, 8 + ~#commands~0.offset, 1);call write~init~$Pointer$(2, 0, ~#commands~0.base, 9 + ~#commands~0.offset, 4);call write~init~$Pointer$(#funAddr~c2.base, #funAddr~c2.offset, ~#commands~0.base, 13 + ~#commands~0.offset, 4);call write~init~int((if ~unnamed3~0~STATE_2 % 256 <= 127 then ~unnamed3~0~STATE_2 % 256 else ~unnamed3~0~STATE_2 % 256 - 256), ~#commands~0.base, 17 + ~#commands~0.offset, 1); {38550#(< 0 |#StackHeapBarrier|)} is VALID [2022-02-20 23:38:17,814 INFO L290 TraceCheckUtils]: 1: Hoare triple {38550#(< 0 |#StackHeapBarrier|)} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1; {38550#(< 0 |#StackHeapBarrier|)} is VALID [2022-02-20 23:38:17,814 INFO L272 TraceCheckUtils]: 2: Hoare triple {38550#(< 0 |#StackHeapBarrier|)} call parse_input(3, 0); {38550#(< 0 |#StackHeapBarrier|)} is VALID [2022-02-20 23:38:17,814 INFO L290 TraceCheckUtils]: 3: Hoare triple {38550#(< 0 |#StackHeapBarrier|)} ~input#1.base, ~input#1.offset := #in~input#1.base, #in~input#1.offset;~i~0#1 := 0; {38550#(< 0 |#StackHeapBarrier|)} is VALID [2022-02-20 23:38:17,815 INFO L290 TraceCheckUtils]: 4: Hoare triple {38550#(< 0 |#StackHeapBarrier|)} assume !!(~i~0#1 < 2); {38550#(< 0 |#StackHeapBarrier|)} is VALID [2022-02-20 23:38:17,815 INFO L290 TraceCheckUtils]: 5: Hoare triple {38550#(< 0 |#StackHeapBarrier|)} SUMMARY for call #t~mem3#1.base, #t~mem3#1.offset := read~$Pointer$(~#commands~0.base, ~#commands~0.offset + 9 * ~i~0#1, 4); srcloc: L693 {38550#(< 0 |#StackHeapBarrier|)} is VALID [2022-02-20 23:38:17,815 INFO L290 TraceCheckUtils]: 6: Hoare triple {38550#(< 0 |#StackHeapBarrier|)} assume 1 == #valid[#t~mem3#1.base]; {38550#(< 0 |#StackHeapBarrier|)} is VALID [2022-02-20 23:38:17,816 INFO L290 TraceCheckUtils]: 7: Hoare triple {38550#(< 0 |#StackHeapBarrier|)} assume #t~mem3#1.offset < #length[#t~mem3#1.base] && #t~mem3#1.offset >= 0; {38550#(< 0 |#StackHeapBarrier|)} is VALID [2022-02-20 23:38:17,816 INFO L290 TraceCheckUtils]: 8: Hoare triple {38550#(< 0 |#StackHeapBarrier|)} assume 1 == #valid[~input#1.base]; {38550#(< 0 |#StackHeapBarrier|)} is VALID [2022-02-20 23:38:17,816 INFO L290 TraceCheckUtils]: 9: Hoare triple {38550#(< 0 |#StackHeapBarrier|)} assume ~input#1.offset < #length[~input#1.base] && ~input#1.offset >= 0; {38550#(< 0 |#StackHeapBarrier|)} is VALID [2022-02-20 23:38:17,816 INFO L290 TraceCheckUtils]: 10: Hoare triple {38550#(< 0 |#StackHeapBarrier|)} assume 0 == #t~nondet4#1;havoc #t~mem3#1.base, #t~mem3#1.offset;havoc #t~nondet4#1; {38550#(< 0 |#StackHeapBarrier|)} is VALID [2022-02-20 23:38:17,817 INFO L290 TraceCheckUtils]: 11: Hoare triple {38550#(< 0 |#StackHeapBarrier|)} SUMMARY for call #t~mem5#1 := read~int(~#commands~0.base, 8 + (~#commands~0.offset + 9 * ~i~0#1), 1); srcloc: L694 {38550#(< 0 |#StackHeapBarrier|)} is VALID [2022-02-20 23:38:17,817 INFO L290 TraceCheckUtils]: 12: Hoare triple {38550#(< 0 |#StackHeapBarrier|)} assume ~state~0 >= #t~mem5#1;havoc #t~mem5#1; {38550#(< 0 |#StackHeapBarrier|)} is VALID [2022-02-20 23:38:17,817 INFO L290 TraceCheckUtils]: 13: Hoare triple {38550#(< 0 |#StackHeapBarrier|)} SUMMARY for call #t~mem6#1.base, #t~mem6#1.offset := read~$Pointer$(~#commands~0.base, 4 + (~#commands~0.offset + 9 * ~i~0#1), 4); srcloc: L695 {38550#(< 0 |#StackHeapBarrier|)} is VALID [2022-02-20 23:38:17,817 INFO L290 TraceCheckUtils]: 14: Hoare triple {38550#(< 0 |#StackHeapBarrier|)} assume { :begin_inline_##fun~~TO~VOID } true;##fun~~TO~VOID_#in~#fp#1.base, ##fun~~TO~VOID_#in~#fp#1.offset := #t~mem6#1.base, #t~mem6#1.offset; {38550#(< 0 |#StackHeapBarrier|)} is VALID [2022-02-20 23:38:17,818 INFO L290 TraceCheckUtils]: 15: Hoare triple {38550#(< 0 |#StackHeapBarrier|)} assume !(##fun~~TO~VOID_#in~#fp#1.base == #funAddr~c2.base && ##fun~~TO~VOID_#in~#fp#1.offset == #funAddr~c2.offset);assume { :begin_inline_c1 } true;havoc c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset, c1_~x~0#1.base, c1_~x~0#1.offset;call c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset := #Ultimate.allocOnHeap(1);c1_~x~0#1.base, c1_~x~0#1.offset := c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset;havoc c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset; {38550#(< 0 |#StackHeapBarrier|)} is VALID [2022-02-20 23:38:17,818 INFO L290 TraceCheckUtils]: 16: Hoare triple {38550#(< 0 |#StackHeapBarrier|)} assume !(c1_~x~0#1.base == 0 && c1_~x~0#1.offset == 0); {38550#(< 0 |#StackHeapBarrier|)} is VALID [2022-02-20 23:38:17,818 INFO L290 TraceCheckUtils]: 17: Hoare triple {38550#(< 0 |#StackHeapBarrier|)} assume !(~global~0.base != 0 || ~global~0.offset != 0); {38550#(< 0 |#StackHeapBarrier|)} is VALID [2022-02-20 23:38:17,819 INFO L290 TraceCheckUtils]: 18: Hoare triple {38550#(< 0 |#StackHeapBarrier|)} ~global~0.base, ~global~0.offset := c1_~x~0#1.base, c1_~x~0#1.offset;~state~0 := ~unnamed3~0~STATE_2; {38550#(< 0 |#StackHeapBarrier|)} is VALID [2022-02-20 23:38:17,819 INFO L290 TraceCheckUtils]: 19: Hoare triple {38550#(< 0 |#StackHeapBarrier|)} assume { :end_inline_c1 } true; {38550#(< 0 |#StackHeapBarrier|)} is VALID [2022-02-20 23:38:17,819 INFO L290 TraceCheckUtils]: 20: Hoare triple {38550#(< 0 |#StackHeapBarrier|)} assume { :end_inline_##fun~~TO~VOID } true;havoc #t~mem6#1.base, #t~mem6#1.offset; {38550#(< 0 |#StackHeapBarrier|)} is VALID [2022-02-20 23:38:17,819 INFO L290 TraceCheckUtils]: 21: Hoare triple {38550#(< 0 |#StackHeapBarrier|)} assume true; {38550#(< 0 |#StackHeapBarrier|)} is VALID [2022-02-20 23:38:17,820 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {38550#(< 0 |#StackHeapBarrier|)} {38550#(< 0 |#StackHeapBarrier|)} #101#return; {38550#(< 0 |#StackHeapBarrier|)} is VALID [2022-02-20 23:38:17,820 INFO L272 TraceCheckUtils]: 23: Hoare triple {38550#(< 0 |#StackHeapBarrier|)} call parse_input(4, 0); {38550#(< 0 |#StackHeapBarrier|)} is VALID [2022-02-20 23:38:17,820 INFO L290 TraceCheckUtils]: 24: Hoare triple {38550#(< 0 |#StackHeapBarrier|)} ~input#1.base, ~input#1.offset := #in~input#1.base, #in~input#1.offset;~i~0#1 := 0; {38550#(< 0 |#StackHeapBarrier|)} is VALID [2022-02-20 23:38:17,821 INFO L290 TraceCheckUtils]: 25: Hoare triple {38550#(< 0 |#StackHeapBarrier|)} assume !!(~i~0#1 < 2); {38550#(< 0 |#StackHeapBarrier|)} is VALID [2022-02-20 23:38:17,821 INFO L290 TraceCheckUtils]: 26: Hoare triple {38550#(< 0 |#StackHeapBarrier|)} SUMMARY for call #t~mem3#1.base, #t~mem3#1.offset := read~$Pointer$(~#commands~0.base, ~#commands~0.offset + 9 * ~i~0#1, 4); srcloc: L693 {38550#(< 0 |#StackHeapBarrier|)} is VALID [2022-02-20 23:38:17,821 INFO L290 TraceCheckUtils]: 27: Hoare triple {38550#(< 0 |#StackHeapBarrier|)} assume 1 == #valid[#t~mem3#1.base]; {38550#(< 0 |#StackHeapBarrier|)} is VALID [2022-02-20 23:38:17,821 INFO L290 TraceCheckUtils]: 28: Hoare triple {38550#(< 0 |#StackHeapBarrier|)} assume #t~mem3#1.offset < #length[#t~mem3#1.base] && #t~mem3#1.offset >= 0; {38550#(< 0 |#StackHeapBarrier|)} is VALID [2022-02-20 23:38:17,822 INFO L290 TraceCheckUtils]: 29: Hoare triple {38550#(< 0 |#StackHeapBarrier|)} assume 1 == #valid[~input#1.base]; {38550#(< 0 |#StackHeapBarrier|)} is VALID [2022-02-20 23:38:17,822 INFO L290 TraceCheckUtils]: 30: Hoare triple {38550#(< 0 |#StackHeapBarrier|)} assume ~input#1.offset < #length[~input#1.base] && ~input#1.offset >= 0; {38550#(< 0 |#StackHeapBarrier|)} is VALID [2022-02-20 23:38:17,822 INFO L290 TraceCheckUtils]: 31: Hoare triple {38550#(< 0 |#StackHeapBarrier|)} assume !(0 == #t~nondet4#1);havoc #t~mem3#1.base, #t~mem3#1.offset;havoc #t~nondet4#1; {38550#(< 0 |#StackHeapBarrier|)} is VALID [2022-02-20 23:38:17,822 INFO L290 TraceCheckUtils]: 32: Hoare triple {38550#(< 0 |#StackHeapBarrier|)} #t~post2#1 := ~i~0#1;~i~0#1 := 1 + #t~post2#1;havoc #t~post2#1; {38550#(< 0 |#StackHeapBarrier|)} is VALID [2022-02-20 23:38:17,823 INFO L290 TraceCheckUtils]: 33: Hoare triple {38550#(< 0 |#StackHeapBarrier|)} assume !!(~i~0#1 < 2); {38550#(< 0 |#StackHeapBarrier|)} is VALID [2022-02-20 23:38:17,823 INFO L290 TraceCheckUtils]: 34: Hoare triple {38550#(< 0 |#StackHeapBarrier|)} SUMMARY for call #t~mem3#1.base, #t~mem3#1.offset := read~$Pointer$(~#commands~0.base, ~#commands~0.offset + 9 * ~i~0#1, 4); srcloc: L693 {38550#(< 0 |#StackHeapBarrier|)} is VALID [2022-02-20 23:38:17,823 INFO L290 TraceCheckUtils]: 35: Hoare triple {38550#(< 0 |#StackHeapBarrier|)} assume 1 == #valid[#t~mem3#1.base]; {38550#(< 0 |#StackHeapBarrier|)} is VALID [2022-02-20 23:38:17,824 INFO L290 TraceCheckUtils]: 36: Hoare triple {38550#(< 0 |#StackHeapBarrier|)} assume #t~mem3#1.offset < #length[#t~mem3#1.base] && #t~mem3#1.offset >= 0; {38550#(< 0 |#StackHeapBarrier|)} is VALID [2022-02-20 23:38:17,824 INFO L290 TraceCheckUtils]: 37: Hoare triple {38550#(< 0 |#StackHeapBarrier|)} assume 1 == #valid[~input#1.base]; {38550#(< 0 |#StackHeapBarrier|)} is VALID [2022-02-20 23:38:17,824 INFO L290 TraceCheckUtils]: 38: Hoare triple {38550#(< 0 |#StackHeapBarrier|)} assume ~input#1.offset < #length[~input#1.base] && ~input#1.offset >= 0; {38550#(< 0 |#StackHeapBarrier|)} is VALID [2022-02-20 23:38:17,824 INFO L290 TraceCheckUtils]: 39: Hoare triple {38550#(< 0 |#StackHeapBarrier|)} assume 0 == #t~nondet4#1;havoc #t~mem3#1.base, #t~mem3#1.offset;havoc #t~nondet4#1; {38550#(< 0 |#StackHeapBarrier|)} is VALID [2022-02-20 23:38:17,825 INFO L290 TraceCheckUtils]: 40: Hoare triple {38550#(< 0 |#StackHeapBarrier|)} SUMMARY for call #t~mem5#1 := read~int(~#commands~0.base, 8 + (~#commands~0.offset + 9 * ~i~0#1), 1); srcloc: L694 {38550#(< 0 |#StackHeapBarrier|)} is VALID [2022-02-20 23:38:17,825 INFO L290 TraceCheckUtils]: 41: Hoare triple {38550#(< 0 |#StackHeapBarrier|)} assume ~state~0 >= #t~mem5#1;havoc #t~mem5#1; {38550#(< 0 |#StackHeapBarrier|)} is VALID [2022-02-20 23:38:17,825 INFO L290 TraceCheckUtils]: 42: Hoare triple {38550#(< 0 |#StackHeapBarrier|)} SUMMARY for call #t~mem6#1.base, #t~mem6#1.offset := read~$Pointer$(~#commands~0.base, 4 + (~#commands~0.offset + 9 * ~i~0#1), 4); srcloc: L695 {38550#(< 0 |#StackHeapBarrier|)} is VALID [2022-02-20 23:38:17,825 INFO L290 TraceCheckUtils]: 43: Hoare triple {38550#(< 0 |#StackHeapBarrier|)} assume { :begin_inline_##fun~~TO~VOID } true;##fun~~TO~VOID_#in~#fp#1.base, ##fun~~TO~VOID_#in~#fp#1.offset := #t~mem6#1.base, #t~mem6#1.offset; {38550#(< 0 |#StackHeapBarrier|)} is VALID [2022-02-20 23:38:17,826 INFO L290 TraceCheckUtils]: 44: Hoare triple {38550#(< 0 |#StackHeapBarrier|)} assume ##fun~~TO~VOID_#in~#fp#1.base == #funAddr~c2.base && ##fun~~TO~VOID_#in~#fp#1.offset == #funAddr~c2.offset;assume { :begin_inline_c2 } true;havoc c2_~y~0#1.base, c2_~y~0#1.offset;c2_~y~0#1.base, c2_~y~0#1.offset := 0, 0; {38683#(and (<= |parse_input_c2_~y~0#1.base| 0) (< 0 |#StackHeapBarrier|))} is VALID [2022-02-20 23:38:17,826 INFO L290 TraceCheckUtils]: 45: Hoare triple {38683#(and (<= |parse_input_c2_~y~0#1.base| 0) (< 0 |#StackHeapBarrier|))} assume !((c2_~y~0#1.base == 0 && c2_~y~0#1.offset == 0) || (~global~0.base == 0 && ~global~0.offset == 0)); {38683#(and (<= |parse_input_c2_~y~0#1.base| 0) (< 0 |#StackHeapBarrier|))} is VALID [2022-02-20 23:38:17,826 INFO L290 TraceCheckUtils]: 46: Hoare triple {38683#(and (<= |parse_input_c2_~y~0#1.base| 0) (< 0 |#StackHeapBarrier|))} assume 0 == c2_~y~0#1.offset; {38683#(and (<= |parse_input_c2_~y~0#1.base| 0) (< 0 |#StackHeapBarrier|))} is VALID [2022-02-20 23:38:17,827 INFO L290 TraceCheckUtils]: 47: Hoare triple {38683#(and (<= |parse_input_c2_~y~0#1.base| 0) (< 0 |#StackHeapBarrier|))} assume !(c2_~y~0#1.base < #StackHeapBarrier); {38524#false} is VALID [2022-02-20 23:38:17,827 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-02-20 23:38:17,827 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:38:17,827 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [308808013] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:38:17,827 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-20 23:38:17,828 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 6 [2022-02-20 23:38:17,828 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554735760] [2022-02-20 23:38:17,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:38:17,828 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 48 [2022-02-20 23:38:17,828 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:38:17,829 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:38:17,846 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:38:17,846 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 23:38:17,846 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:38:17,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 23:38:17,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-02-20 23:38:17,847 INFO L87 Difference]: Start difference. First operand 368 states and 450 transitions. Second operand has 4 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:38:17,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:38:17,917 INFO L93 Difference]: Finished difference Result 384 states and 462 transitions. [2022-02-20 23:38:17,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 23:38:17,917 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 48 [2022-02-20 23:38:17,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:38:17,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:38:17,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 64 transitions. [2022-02-20 23:38:17,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:38:17,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 64 transitions. [2022-02-20 23:38:17,919 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 64 transitions. [2022-02-20 23:38:17,960 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:38:17,965 INFO L225 Difference]: With dead ends: 384 [2022-02-20 23:38:17,965 INFO L226 Difference]: Without dead ends: 384 [2022-02-20 23:38:17,965 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-02-20 23:38:17,965 INFO L933 BasicCegarLoop]: 55 mSDtfsCounter, 43 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:38:17,966 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [43 Valid, 92 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:38:17,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2022-02-20 23:38:17,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 367. [2022-02-20 23:38:17,969 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:38:17,970 INFO L82 GeneralOperation]: Start isEquivalent. First operand 384 states. Second operand has 367 states, 334 states have (on average 1.2604790419161678) internal successors, (421), 350 states have internal predecessors, (421), 8 states have call successors, (8), 8 states have call predecessors, (8), 13 states have return successors, (16), 8 states have call predecessors, (16), 8 states have call successors, (16) [2022-02-20 23:38:17,970 INFO L74 IsIncluded]: Start isIncluded. First operand 384 states. Second operand has 367 states, 334 states have (on average 1.2604790419161678) internal successors, (421), 350 states have internal predecessors, (421), 8 states have call successors, (8), 8 states have call predecessors, (8), 13 states have return successors, (16), 8 states have call predecessors, (16), 8 states have call successors, (16) [2022-02-20 23:38:17,970 INFO L87 Difference]: Start difference. First operand 384 states. Second operand has 367 states, 334 states have (on average 1.2604790419161678) internal successors, (421), 350 states have internal predecessors, (421), 8 states have call successors, (8), 8 states have call predecessors, (8), 13 states have return successors, (16), 8 states have call predecessors, (16), 8 states have call successors, (16) [2022-02-20 23:38:17,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:38:17,975 INFO L93 Difference]: Finished difference Result 384 states and 462 transitions. [2022-02-20 23:38:17,975 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 462 transitions. [2022-02-20 23:38:17,976 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:38:17,976 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:38:17,977 INFO L74 IsIncluded]: Start isIncluded. First operand has 367 states, 334 states have (on average 1.2604790419161678) internal successors, (421), 350 states have internal predecessors, (421), 8 states have call successors, (8), 8 states have call predecessors, (8), 13 states have return successors, (16), 8 states have call predecessors, (16), 8 states have call successors, (16) Second operand 384 states. [2022-02-20 23:38:17,977 INFO L87 Difference]: Start difference. First operand has 367 states, 334 states have (on average 1.2604790419161678) internal successors, (421), 350 states have internal predecessors, (421), 8 states have call successors, (8), 8 states have call predecessors, (8), 13 states have return successors, (16), 8 states have call predecessors, (16), 8 states have call successors, (16) Second operand 384 states. [2022-02-20 23:38:17,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:38:17,982 INFO L93 Difference]: Finished difference Result 384 states and 462 transitions. [2022-02-20 23:38:17,983 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 462 transitions. [2022-02-20 23:38:17,983 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:38:17,983 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:38:17,983 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:38:17,983 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:38:17,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 367 states, 334 states have (on average 1.2604790419161678) internal successors, (421), 350 states have internal predecessors, (421), 8 states have call successors, (8), 8 states have call predecessors, (8), 13 states have return successors, (16), 8 states have call predecessors, (16), 8 states have call successors, (16) [2022-02-20 23:38:17,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 445 transitions. [2022-02-20 23:38:17,988 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 445 transitions. Word has length 48 [2022-02-20 23:38:17,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:38:17,989 INFO L470 AbstractCegarLoop]: Abstraction has 367 states and 445 transitions. [2022-02-20 23:38:17,989 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:38:17,989 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 445 transitions. [2022-02-20 23:38:17,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-02-20 23:38:17,989 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:38:17,989 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:38:18,012 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-02-20 23:38:18,203 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:38:18,203 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATION, parse_inputErr1REQUIRES_VIOLATION, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2022-02-20 23:38:18,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:38:18,204 INFO L85 PathProgramCache]: Analyzing trace with hash -1433195828, now seen corresponding path program 1 times [2022-02-20 23:38:18,204 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:38:18,204 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325616477] [2022-02-20 23:38:18,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:38:18,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:38:18,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:38:18,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 23:38:18,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:38:18,362 INFO L290 TraceCheckUtils]: 0: Hoare triple {40257#(and (= ~global~0.base |old(~global~0.base)|) (= |old(#length)| |#length|) (= |old(~global~0.offset)| ~global~0.offset) (= ~state~0 |old(~state~0)|) (= |old(#valid)| |#valid|))} ~input#1.base, ~input#1.offset := #in~input#1.base, #in~input#1.offset;~i~0#1 := 0; {40258#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 23:38:18,363 INFO L290 TraceCheckUtils]: 1: Hoare triple {40258#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} assume !!(~i~0#1 < 2); {40258#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 23:38:18,363 INFO L290 TraceCheckUtils]: 2: Hoare triple {40258#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} SUMMARY for call #t~mem3#1.base, #t~mem3#1.offset := read~$Pointer$(~#commands~0.base, ~#commands~0.offset + 9 * ~i~0#1, 4); srcloc: L693 {40258#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 23:38:18,364 INFO L290 TraceCheckUtils]: 3: Hoare triple {40258#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} assume 1 == #valid[#t~mem3#1.base]; {40258#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 23:38:18,364 INFO L290 TraceCheckUtils]: 4: Hoare triple {40258#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} assume #t~mem3#1.offset < #length[#t~mem3#1.base] && #t~mem3#1.offset >= 0; {40258#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 23:38:18,364 INFO L290 TraceCheckUtils]: 5: Hoare triple {40258#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} assume 1 == #valid[~input#1.base]; {40258#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 23:38:18,365 INFO L290 TraceCheckUtils]: 6: Hoare triple {40258#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} assume ~input#1.offset < #length[~input#1.base] && ~input#1.offset >= 0; {40258#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 23:38:18,365 INFO L290 TraceCheckUtils]: 7: Hoare triple {40258#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} assume !(0 == #t~nondet4#1);havoc #t~mem3#1.base, #t~mem3#1.offset;havoc #t~nondet4#1; {40258#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 23:38:18,365 INFO L290 TraceCheckUtils]: 8: Hoare triple {40258#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} #t~post2#1 := ~i~0#1;~i~0#1 := 1 + #t~post2#1;havoc #t~post2#1; {40258#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 23:38:18,366 INFO L290 TraceCheckUtils]: 9: Hoare triple {40258#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} assume !!(~i~0#1 < 2); {40258#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 23:38:18,366 INFO L290 TraceCheckUtils]: 10: Hoare triple {40258#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} SUMMARY for call #t~mem3#1.base, #t~mem3#1.offset := read~$Pointer$(~#commands~0.base, ~#commands~0.offset + 9 * ~i~0#1, 4); srcloc: L693 {40258#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 23:38:18,367 INFO L290 TraceCheckUtils]: 11: Hoare triple {40258#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} assume 1 == #valid[#t~mem3#1.base]; {40258#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 23:38:18,371 INFO L290 TraceCheckUtils]: 12: Hoare triple {40258#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} assume #t~mem3#1.offset < #length[#t~mem3#1.base] && #t~mem3#1.offset >= 0; {40258#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 23:38:18,371 INFO L290 TraceCheckUtils]: 13: Hoare triple {40258#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} assume 1 == #valid[~input#1.base]; {40258#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 23:38:18,372 INFO L290 TraceCheckUtils]: 14: Hoare triple {40258#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} assume ~input#1.offset < #length[~input#1.base] && ~input#1.offset >= 0; {40258#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 23:38:18,372 INFO L290 TraceCheckUtils]: 15: Hoare triple {40258#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} assume !(0 == #t~nondet4#1);havoc #t~mem3#1.base, #t~mem3#1.offset;havoc #t~nondet4#1; {40258#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 23:38:18,372 INFO L290 TraceCheckUtils]: 16: Hoare triple {40258#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} #t~post2#1 := ~i~0#1;~i~0#1 := 1 + #t~post2#1;havoc #t~post2#1; {40258#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 23:38:18,373 INFO L290 TraceCheckUtils]: 17: Hoare triple {40258#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} assume !(~i~0#1 < 2); {40258#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 23:38:18,373 INFO L290 TraceCheckUtils]: 18: Hoare triple {40258#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} assume true; {40258#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 23:38:18,374 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {40258#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} {40213#(and (= 3 (select |#length| 1)) (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0) (= |~#commands~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1) (= (select |#valid| 1) (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|)))} #101#return; {40213#(and (= 3 (select |#length| 1)) (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0) (= |~#commands~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1) (= (select |#valid| 1) (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|)))} is VALID [2022-02-20 23:38:18,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-02-20 23:38:18,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:38:18,543 INFO L290 TraceCheckUtils]: 0: Hoare triple {40257#(and (= ~global~0.base |old(~global~0.base)|) (= |old(#length)| |#length|) (= |old(~global~0.offset)| ~global~0.offset) (= ~state~0 |old(~state~0)|) (= |old(#valid)| |#valid|))} ~input#1.base, ~input#1.offset := #in~input#1.base, #in~input#1.offset;~i~0#1 := 0; {40259#(and (= (select |old(#length)| 1) (select |#length| 1)) (= |parse_input_~i~0#1| 0) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 23:38:18,543 INFO L290 TraceCheckUtils]: 1: Hoare triple {40259#(and (= (select |old(#length)| 1) (select |#length| 1)) (= |parse_input_~i~0#1| 0) (= |old(#valid)| |#valid|))} assume !!(~i~0#1 < 2); {40259#(and (= (select |old(#length)| 1) (select |#length| 1)) (= |parse_input_~i~0#1| 0) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 23:38:18,544 INFO L290 TraceCheckUtils]: 2: Hoare triple {40259#(and (= (select |old(#length)| 1) (select |#length| 1)) (= |parse_input_~i~0#1| 0) (= |old(#valid)| |#valid|))} SUMMARY for call #t~mem3#1.base, #t~mem3#1.offset := read~$Pointer$(~#commands~0.base, ~#commands~0.offset + 9 * ~i~0#1, 4); srcloc: L693 {40260#(and (or (not (= (+ (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) (* (- 1) |parse_input_~i~0#1|)) 0)) (and (= |parse_input_~i~0#1| 0) (or (= (select |old(#length)| 1) (select |#length| 1)) (not (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) 1)) (not (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|)))) (= |old(#valid)| |#valid|))) (or (= |parse_input_~i~0#1| 0) (not (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|)))))} is VALID [2022-02-20 23:38:18,545 INFO L290 TraceCheckUtils]: 3: Hoare triple {40260#(and (or (not (= (+ (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) (* (- 1) |parse_input_~i~0#1|)) 0)) (and (= |parse_input_~i~0#1| 0) (or (= (select |old(#length)| 1) (select |#length| 1)) (not (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) 1)) (not (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|)))) (= |old(#valid)| |#valid|))) (or (= |parse_input_~i~0#1| 0) (not (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|)))))} assume 1 == #valid[#t~mem3#1.base]; {40260#(and (or (not (= (+ (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) (* (- 1) |parse_input_~i~0#1|)) 0)) (and (= |parse_input_~i~0#1| 0) (or (= (select |old(#length)| 1) (select |#length| 1)) (not (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) 1)) (not (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|)))) (= |old(#valid)| |#valid|))) (or (= |parse_input_~i~0#1| 0) (not (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|)))))} is VALID [2022-02-20 23:38:18,545 INFO L290 TraceCheckUtils]: 4: Hoare triple {40260#(and (or (not (= (+ (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) (* (- 1) |parse_input_~i~0#1|)) 0)) (and (= |parse_input_~i~0#1| 0) (or (= (select |old(#length)| 1) (select |#length| 1)) (not (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) 1)) (not (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|)))) (= |old(#valid)| |#valid|))) (or (= |parse_input_~i~0#1| 0) (not (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|)))))} assume #t~mem3#1.offset < #length[#t~mem3#1.base] && #t~mem3#1.offset >= 0; {40260#(and (or (not (= (+ (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) (* (- 1) |parse_input_~i~0#1|)) 0)) (and (= |parse_input_~i~0#1| 0) (or (= (select |old(#length)| 1) (select |#length| 1)) (not (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) 1)) (not (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|)))) (= |old(#valid)| |#valid|))) (or (= |parse_input_~i~0#1| 0) (not (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|)))))} is VALID [2022-02-20 23:38:18,546 INFO L290 TraceCheckUtils]: 5: Hoare triple {40260#(and (or (not (= (+ (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) (* (- 1) |parse_input_~i~0#1|)) 0)) (and (= |parse_input_~i~0#1| 0) (or (= (select |old(#length)| 1) (select |#length| 1)) (not (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) 1)) (not (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|)))) (= |old(#valid)| |#valid|))) (or (= |parse_input_~i~0#1| 0) (not (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|)))))} assume 1 == #valid[~input#1.base]; {40260#(and (or (not (= (+ (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) (* (- 1) |parse_input_~i~0#1|)) 0)) (and (= |parse_input_~i~0#1| 0) (or (= (select |old(#length)| 1) (select |#length| 1)) (not (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) 1)) (not (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|)))) (= |old(#valid)| |#valid|))) (or (= |parse_input_~i~0#1| 0) (not (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|)))))} is VALID [2022-02-20 23:38:18,547 INFO L290 TraceCheckUtils]: 6: Hoare triple {40260#(and (or (not (= (+ (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) (* (- 1) |parse_input_~i~0#1|)) 0)) (and (= |parse_input_~i~0#1| 0) (or (= (select |old(#length)| 1) (select |#length| 1)) (not (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) 1)) (not (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|)))) (= |old(#valid)| |#valid|))) (or (= |parse_input_~i~0#1| 0) (not (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|)))))} assume ~input#1.offset < #length[~input#1.base] && ~input#1.offset >= 0; {40260#(and (or (not (= (+ (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) (* (- 1) |parse_input_~i~0#1|)) 0)) (and (= |parse_input_~i~0#1| 0) (or (= (select |old(#length)| 1) (select |#length| 1)) (not (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) 1)) (not (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|)))) (= |old(#valid)| |#valid|))) (or (= |parse_input_~i~0#1| 0) (not (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|)))))} is VALID [2022-02-20 23:38:18,547 INFO L290 TraceCheckUtils]: 7: Hoare triple {40260#(and (or (not (= (+ (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) (* (- 1) |parse_input_~i~0#1|)) 0)) (and (= |parse_input_~i~0#1| 0) (or (= (select |old(#length)| 1) (select |#length| 1)) (not (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) 1)) (not (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|)))) (= |old(#valid)| |#valid|))) (or (= |parse_input_~i~0#1| 0) (not (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|)))))} assume 0 == #t~nondet4#1;havoc #t~mem3#1.base, #t~mem3#1.offset;havoc #t~nondet4#1; {40260#(and (or (not (= (+ (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) (* (- 1) |parse_input_~i~0#1|)) 0)) (and (= |parse_input_~i~0#1| 0) (or (= (select |old(#length)| 1) (select |#length| 1)) (not (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) 1)) (not (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|)))) (= |old(#valid)| |#valid|))) (or (= |parse_input_~i~0#1| 0) (not (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|)))))} is VALID [2022-02-20 23:38:18,548 INFO L290 TraceCheckUtils]: 8: Hoare triple {40260#(and (or (not (= (+ (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) (* (- 1) |parse_input_~i~0#1|)) 0)) (and (= |parse_input_~i~0#1| 0) (or (= (select |old(#length)| 1) (select |#length| 1)) (not (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) 1)) (not (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|)))) (= |old(#valid)| |#valid|))) (or (= |parse_input_~i~0#1| 0) (not (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|)))))} SUMMARY for call #t~mem5#1 := read~int(~#commands~0.base, 8 + (~#commands~0.offset + 9 * ~i~0#1), 1); srcloc: L694 {40260#(and (or (not (= (+ (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) (* (- 1) |parse_input_~i~0#1|)) 0)) (and (= |parse_input_~i~0#1| 0) (or (= (select |old(#length)| 1) (select |#length| 1)) (not (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) 1)) (not (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|)))) (= |old(#valid)| |#valid|))) (or (= |parse_input_~i~0#1| 0) (not (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|)))))} is VALID [2022-02-20 23:38:18,549 INFO L290 TraceCheckUtils]: 9: Hoare triple {40260#(and (or (not (= (+ (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) (* (- 1) |parse_input_~i~0#1|)) 0)) (and (= |parse_input_~i~0#1| 0) (or (= (select |old(#length)| 1) (select |#length| 1)) (not (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) 1)) (not (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|)))) (= |old(#valid)| |#valid|))) (or (= |parse_input_~i~0#1| 0) (not (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|)))))} assume ~state~0 >= #t~mem5#1;havoc #t~mem5#1; {40260#(and (or (not (= (+ (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) (* (- 1) |parse_input_~i~0#1|)) 0)) (and (= |parse_input_~i~0#1| 0) (or (= (select |old(#length)| 1) (select |#length| 1)) (not (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) 1)) (not (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|)))) (= |old(#valid)| |#valid|))) (or (= |parse_input_~i~0#1| 0) (not (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|)))))} is VALID [2022-02-20 23:38:18,549 INFO L290 TraceCheckUtils]: 10: Hoare triple {40260#(and (or (not (= (+ (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) (* (- 1) |parse_input_~i~0#1|)) 0)) (and (= |parse_input_~i~0#1| 0) (or (= (select |old(#length)| 1) (select |#length| 1)) (not (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) 1)) (not (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|)))) (= |old(#valid)| |#valid|))) (or (= |parse_input_~i~0#1| 0) (not (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|)))))} SUMMARY for call #t~mem6#1.base, #t~mem6#1.offset := read~$Pointer$(~#commands~0.base, 4 + (~#commands~0.offset + 9 * ~i~0#1), 4); srcloc: L695 {40261#(or (and (or (= (select |old(#length)| 1) (select |#length| 1)) (not (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) 1)) (not (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|)))) (= |old(#valid)| |#valid|)) (not (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) 0)) (not (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|))))} is VALID [2022-02-20 23:38:18,550 INFO L290 TraceCheckUtils]: 11: Hoare triple {40261#(or (and (or (= (select |old(#length)| 1) (select |#length| 1)) (not (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) 1)) (not (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|)))) (= |old(#valid)| |#valid|)) (not (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) 0)) (not (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|))))} assume { :begin_inline_##fun~~TO~VOID } true;##fun~~TO~VOID_#in~#fp#1.base, ##fun~~TO~VOID_#in~#fp#1.offset := #t~mem6#1.base, #t~mem6#1.offset; {40261#(or (and (or (= (select |old(#length)| 1) (select |#length| 1)) (not (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) 1)) (not (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|)))) (= |old(#valid)| |#valid|)) (not (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) 0)) (not (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|))))} is VALID [2022-02-20 23:38:18,551 INFO L290 TraceCheckUtils]: 12: Hoare triple {40261#(or (and (or (= (select |old(#length)| 1) (select |#length| 1)) (not (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) 1)) (not (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|)))) (= |old(#valid)| |#valid|)) (not (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) 0)) (not (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|))))} assume !(##fun~~TO~VOID_#in~#fp#1.base == #funAddr~c2.base && ##fun~~TO~VOID_#in~#fp#1.offset == #funAddr~c2.offset);assume { :begin_inline_c1 } true;havoc c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset, c1_~x~0#1.base, c1_~x~0#1.offset;call c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset := #Ultimate.allocOnHeap(1);c1_~x~0#1.base, c1_~x~0#1.offset := c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset;havoc c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset; {40262#(or (not (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) 0)) (not (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|))) (and (or (= (select |old(#length)| 1) (select |#length| 1)) (not (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) 1)) (= |parse_input_c1_~x~0#1.base| 1) (not (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|)))) (or (not (= |parse_input_c1_~x~0#1.base| 1)) (not (= |parse_input_c1_~x~0#1.base| (select |old(#valid)| |parse_input_c1_~x~0#1.base|))))))} is VALID [2022-02-20 23:38:18,552 INFO L290 TraceCheckUtils]: 13: Hoare triple {40262#(or (not (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) 0)) (not (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|))) (and (or (= (select |old(#length)| 1) (select |#length| 1)) (not (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) 1)) (= |parse_input_c1_~x~0#1.base| 1) (not (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|)))) (or (not (= |parse_input_c1_~x~0#1.base| 1)) (not (= |parse_input_c1_~x~0#1.base| (select |old(#valid)| |parse_input_c1_~x~0#1.base|))))))} assume !(c1_~x~0#1.base == 0 && c1_~x~0#1.offset == 0); {40262#(or (not (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) 0)) (not (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|))) (and (or (= (select |old(#length)| 1) (select |#length| 1)) (not (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) 1)) (= |parse_input_c1_~x~0#1.base| 1) (not (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|)))) (or (not (= |parse_input_c1_~x~0#1.base| 1)) (not (= |parse_input_c1_~x~0#1.base| (select |old(#valid)| |parse_input_c1_~x~0#1.base|))))))} is VALID [2022-02-20 23:38:18,552 INFO L290 TraceCheckUtils]: 14: Hoare triple {40262#(or (not (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) 0)) (not (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|))) (and (or (= (select |old(#length)| 1) (select |#length| 1)) (not (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) 1)) (= |parse_input_c1_~x~0#1.base| 1) (not (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|)))) (or (not (= |parse_input_c1_~x~0#1.base| 1)) (not (= |parse_input_c1_~x~0#1.base| (select |old(#valid)| |parse_input_c1_~x~0#1.base|))))))} assume !(~global~0.base != 0 || ~global~0.offset != 0); {40262#(or (not (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) 0)) (not (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|))) (and (or (= (select |old(#length)| 1) (select |#length| 1)) (not (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) 1)) (= |parse_input_c1_~x~0#1.base| 1) (not (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|)))) (or (not (= |parse_input_c1_~x~0#1.base| 1)) (not (= |parse_input_c1_~x~0#1.base| (select |old(#valid)| |parse_input_c1_~x~0#1.base|))))))} is VALID [2022-02-20 23:38:18,553 INFO L290 TraceCheckUtils]: 15: Hoare triple {40262#(or (not (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) 0)) (not (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|))) (and (or (= (select |old(#length)| 1) (select |#length| 1)) (not (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) 1)) (= |parse_input_c1_~x~0#1.base| 1) (not (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|)))) (or (not (= |parse_input_c1_~x~0#1.base| 1)) (not (= |parse_input_c1_~x~0#1.base| (select |old(#valid)| |parse_input_c1_~x~0#1.base|))))))} ~global~0.base, ~global~0.offset := c1_~x~0#1.base, c1_~x~0#1.offset;~state~0 := ~unnamed3~0~STATE_2; {40263#(or (not (= (select |old(#valid)| 1) 1)) (= (select |old(#length)| 1) (select |#length| 1)) (not (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) 1)) (not (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|))) (not (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) 0)) (not (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|))))} is VALID [2022-02-20 23:38:18,553 INFO L290 TraceCheckUtils]: 16: Hoare triple {40263#(or (not (= (select |old(#valid)| 1) 1)) (= (select |old(#length)| 1) (select |#length| 1)) (not (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) 1)) (not (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|))) (not (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) 0)) (not (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|))))} assume { :end_inline_c1 } true; {40263#(or (not (= (select |old(#valid)| 1) 1)) (= (select |old(#length)| 1) (select |#length| 1)) (not (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) 1)) (not (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|))) (not (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) 0)) (not (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|))))} is VALID [2022-02-20 23:38:18,554 INFO L290 TraceCheckUtils]: 17: Hoare triple {40263#(or (not (= (select |old(#valid)| 1) 1)) (= (select |old(#length)| 1) (select |#length| 1)) (not (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) 1)) (not (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|))) (not (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) 0)) (not (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|))))} assume { :end_inline_##fun~~TO~VOID } true;havoc #t~mem6#1.base, #t~mem6#1.offset; {40263#(or (not (= (select |old(#valid)| 1) 1)) (= (select |old(#length)| 1) (select |#length| 1)) (not (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) 1)) (not (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|))) (not (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) 0)) (not (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|))))} is VALID [2022-02-20 23:38:18,554 INFO L290 TraceCheckUtils]: 18: Hoare triple {40263#(or (not (= (select |old(#valid)| 1) 1)) (= (select |old(#length)| 1) (select |#length| 1)) (not (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) 1)) (not (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|))) (not (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) 0)) (not (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|))))} assume true; {40263#(or (not (= (select |old(#valid)| 1) 1)) (= (select |old(#length)| 1) (select |#length| 1)) (not (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) 1)) (not (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|))) (not (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) 0)) (not (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|))))} is VALID [2022-02-20 23:38:18,555 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {40263#(or (not (= (select |old(#valid)| 1) 1)) (= (select |old(#length)| 1) (select |#length| 1)) (not (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) 1)) (not (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|))) (not (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) 0)) (not (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|))))} {40213#(and (= 3 (select |#length| 1)) (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0) (= |~#commands~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1) (= (select |#valid| 1) (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|)))} #103#return; {40254#(and (<= (+ (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) 3) (select |#length| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0))) (<= 0 (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0)) (= |~#commands~0.offset| 0))} is VALID [2022-02-20 23:38:18,557 INFO L290 TraceCheckUtils]: 0: Hoare triple {40211#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(3, 1);call write~init~int(99, 1, 0, 1);call write~init~int(49, 1, 1, 1);call write~init~int(0, 1, 2, 1);call #Ultimate.allocInit(3, 2);call write~init~int(99, 2, 0, 1);call write~init~int(50, 2, 1, 1);call write~init~int(0, 2, 2, 1);call #Ultimate.allocInit(3, 3);call write~init~int(99, 3, 0, 1);call write~init~int(49, 3, 1, 1);call write~init~int(0, 3, 2, 1);call #Ultimate.allocInit(3, 4);call write~init~int(99, 4, 0, 1);call write~init~int(49, 4, 1, 1);call write~init~int(0, 4, 2, 1);call #Ultimate.allocInit(3, 5);call write~init~int(99, 5, 0, 1);call write~init~int(50, 5, 1, 1);call write~init~int(0, 5, 2, 1);~state~0 := ~unnamed3~0~STATE_1;~global~0.base, ~global~0.offset := 0, 0;~#commands~0.base, ~#commands~0.offset := 6, 0;call #Ultimate.allocInit(18, 6);call write~init~$Pointer$(1, 0, ~#commands~0.base, ~#commands~0.offset, 4);call write~init~$Pointer$(#funAddr~c1.base, #funAddr~c1.offset, ~#commands~0.base, 4 + ~#commands~0.offset, 4);call write~init~int((if ~unnamed3~0~STATE_1 % 256 <= 127 then ~unnamed3~0~STATE_1 % 256 else ~unnamed3~0~STATE_1 % 256 - 256), ~#commands~0.base, 8 + ~#commands~0.offset, 1);call write~init~$Pointer$(2, 0, ~#commands~0.base, 9 + ~#commands~0.offset, 4);call write~init~$Pointer$(#funAddr~c2.base, #funAddr~c2.offset, ~#commands~0.base, 13 + ~#commands~0.offset, 4);call write~init~int((if ~unnamed3~0~STATE_2 % 256 <= 127 then ~unnamed3~0~STATE_2 % 256 else ~unnamed3~0~STATE_2 % 256 - 256), ~#commands~0.base, 17 + ~#commands~0.offset, 1); {40213#(and (= 3 (select |#length| 1)) (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0) (= |~#commands~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1) (= (select |#valid| 1) (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|)))} is VALID [2022-02-20 23:38:18,557 INFO L290 TraceCheckUtils]: 1: Hoare triple {40213#(and (= 3 (select |#length| 1)) (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0) (= |~#commands~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1) (= (select |#valid| 1) (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|)))} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1; {40213#(and (= 3 (select |#length| 1)) (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0) (= |~#commands~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1) (= (select |#valid| 1) (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|)))} is VALID [2022-02-20 23:38:18,558 INFO L272 TraceCheckUtils]: 2: Hoare triple {40213#(and (= 3 (select |#length| 1)) (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0) (= |~#commands~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1) (= (select |#valid| 1) (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|)))} call parse_input(3, 0); {40257#(and (= ~global~0.base |old(~global~0.base)|) (= |old(#length)| |#length|) (= |old(~global~0.offset)| ~global~0.offset) (= ~state~0 |old(~state~0)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 23:38:18,558 INFO L290 TraceCheckUtils]: 3: Hoare triple {40257#(and (= ~global~0.base |old(~global~0.base)|) (= |old(#length)| |#length|) (= |old(~global~0.offset)| ~global~0.offset) (= ~state~0 |old(~state~0)|) (= |old(#valid)| |#valid|))} ~input#1.base, ~input#1.offset := #in~input#1.base, #in~input#1.offset;~i~0#1 := 0; {40258#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 23:38:18,559 INFO L290 TraceCheckUtils]: 4: Hoare triple {40258#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} assume !!(~i~0#1 < 2); {40258#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 23:38:18,559 INFO L290 TraceCheckUtils]: 5: Hoare triple {40258#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} SUMMARY for call #t~mem3#1.base, #t~mem3#1.offset := read~$Pointer$(~#commands~0.base, ~#commands~0.offset + 9 * ~i~0#1, 4); srcloc: L693 {40258#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 23:38:18,560 INFO L290 TraceCheckUtils]: 6: Hoare triple {40258#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} assume 1 == #valid[#t~mem3#1.base]; {40258#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 23:38:18,560 INFO L290 TraceCheckUtils]: 7: Hoare triple {40258#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} assume #t~mem3#1.offset < #length[#t~mem3#1.base] && #t~mem3#1.offset >= 0; {40258#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 23:38:18,560 INFO L290 TraceCheckUtils]: 8: Hoare triple {40258#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} assume 1 == #valid[~input#1.base]; {40258#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 23:38:18,561 INFO L290 TraceCheckUtils]: 9: Hoare triple {40258#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} assume ~input#1.offset < #length[~input#1.base] && ~input#1.offset >= 0; {40258#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 23:38:18,561 INFO L290 TraceCheckUtils]: 10: Hoare triple {40258#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} assume !(0 == #t~nondet4#1);havoc #t~mem3#1.base, #t~mem3#1.offset;havoc #t~nondet4#1; {40258#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 23:38:18,561 INFO L290 TraceCheckUtils]: 11: Hoare triple {40258#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} #t~post2#1 := ~i~0#1;~i~0#1 := 1 + #t~post2#1;havoc #t~post2#1; {40258#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 23:38:18,562 INFO L290 TraceCheckUtils]: 12: Hoare triple {40258#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} assume !!(~i~0#1 < 2); {40258#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 23:38:18,562 INFO L290 TraceCheckUtils]: 13: Hoare triple {40258#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} SUMMARY for call #t~mem3#1.base, #t~mem3#1.offset := read~$Pointer$(~#commands~0.base, ~#commands~0.offset + 9 * ~i~0#1, 4); srcloc: L693 {40258#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 23:38:18,563 INFO L290 TraceCheckUtils]: 14: Hoare triple {40258#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} assume 1 == #valid[#t~mem3#1.base]; {40258#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 23:38:18,563 INFO L290 TraceCheckUtils]: 15: Hoare triple {40258#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} assume #t~mem3#1.offset < #length[#t~mem3#1.base] && #t~mem3#1.offset >= 0; {40258#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 23:38:18,563 INFO L290 TraceCheckUtils]: 16: Hoare triple {40258#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} assume 1 == #valid[~input#1.base]; {40258#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 23:38:18,564 INFO L290 TraceCheckUtils]: 17: Hoare triple {40258#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} assume ~input#1.offset < #length[~input#1.base] && ~input#1.offset >= 0; {40258#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 23:38:18,564 INFO L290 TraceCheckUtils]: 18: Hoare triple {40258#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} assume !(0 == #t~nondet4#1);havoc #t~mem3#1.base, #t~mem3#1.offset;havoc #t~nondet4#1; {40258#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 23:38:18,564 INFO L290 TraceCheckUtils]: 19: Hoare triple {40258#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} #t~post2#1 := ~i~0#1;~i~0#1 := 1 + #t~post2#1;havoc #t~post2#1; {40258#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 23:38:18,565 INFO L290 TraceCheckUtils]: 20: Hoare triple {40258#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} assume !(~i~0#1 < 2); {40258#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 23:38:18,565 INFO L290 TraceCheckUtils]: 21: Hoare triple {40258#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} assume true; {40258#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 23:38:18,566 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {40258#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} {40213#(and (= 3 (select |#length| 1)) (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0) (= |~#commands~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1) (= (select |#valid| 1) (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|)))} #101#return; {40213#(and (= 3 (select |#length| 1)) (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0) (= |~#commands~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1) (= (select |#valid| 1) (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|)))} is VALID [2022-02-20 23:38:18,567 INFO L272 TraceCheckUtils]: 23: Hoare triple {40213#(and (= 3 (select |#length| 1)) (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0) (= |~#commands~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1) (= (select |#valid| 1) (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|)))} call parse_input(4, 0); {40257#(and (= ~global~0.base |old(~global~0.base)|) (= |old(#length)| |#length|) (= |old(~global~0.offset)| ~global~0.offset) (= ~state~0 |old(~state~0)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 23:38:18,567 INFO L290 TraceCheckUtils]: 24: Hoare triple {40257#(and (= ~global~0.base |old(~global~0.base)|) (= |old(#length)| |#length|) (= |old(~global~0.offset)| ~global~0.offset) (= ~state~0 |old(~state~0)|) (= |old(#valid)| |#valid|))} ~input#1.base, ~input#1.offset := #in~input#1.base, #in~input#1.offset;~i~0#1 := 0; {40259#(and (= (select |old(#length)| 1) (select |#length| 1)) (= |parse_input_~i~0#1| 0) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 23:38:18,568 INFO L290 TraceCheckUtils]: 25: Hoare triple {40259#(and (= (select |old(#length)| 1) (select |#length| 1)) (= |parse_input_~i~0#1| 0) (= |old(#valid)| |#valid|))} assume !!(~i~0#1 < 2); {40259#(and (= (select |old(#length)| 1) (select |#length| 1)) (= |parse_input_~i~0#1| 0) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 23:38:18,568 INFO L290 TraceCheckUtils]: 26: Hoare triple {40259#(and (= (select |old(#length)| 1) (select |#length| 1)) (= |parse_input_~i~0#1| 0) (= |old(#valid)| |#valid|))} SUMMARY for call #t~mem3#1.base, #t~mem3#1.offset := read~$Pointer$(~#commands~0.base, ~#commands~0.offset + 9 * ~i~0#1, 4); srcloc: L693 {40260#(and (or (not (= (+ (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) (* (- 1) |parse_input_~i~0#1|)) 0)) (and (= |parse_input_~i~0#1| 0) (or (= (select |old(#length)| 1) (select |#length| 1)) (not (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) 1)) (not (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|)))) (= |old(#valid)| |#valid|))) (or (= |parse_input_~i~0#1| 0) (not (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|)))))} is VALID [2022-02-20 23:38:18,569 INFO L290 TraceCheckUtils]: 27: Hoare triple {40260#(and (or (not (= (+ (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) (* (- 1) |parse_input_~i~0#1|)) 0)) (and (= |parse_input_~i~0#1| 0) (or (= (select |old(#length)| 1) (select |#length| 1)) (not (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) 1)) (not (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|)))) (= |old(#valid)| |#valid|))) (or (= |parse_input_~i~0#1| 0) (not (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|)))))} assume 1 == #valid[#t~mem3#1.base]; {40260#(and (or (not (= (+ (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) (* (- 1) |parse_input_~i~0#1|)) 0)) (and (= |parse_input_~i~0#1| 0) (or (= (select |old(#length)| 1) (select |#length| 1)) (not (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) 1)) (not (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|)))) (= |old(#valid)| |#valid|))) (or (= |parse_input_~i~0#1| 0) (not (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|)))))} is VALID [2022-02-20 23:38:18,570 INFO L290 TraceCheckUtils]: 28: Hoare triple {40260#(and (or (not (= (+ (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) (* (- 1) |parse_input_~i~0#1|)) 0)) (and (= |parse_input_~i~0#1| 0) (or (= (select |old(#length)| 1) (select |#length| 1)) (not (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) 1)) (not (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|)))) (= |old(#valid)| |#valid|))) (or (= |parse_input_~i~0#1| 0) (not (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|)))))} assume #t~mem3#1.offset < #length[#t~mem3#1.base] && #t~mem3#1.offset >= 0; {40260#(and (or (not (= (+ (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) (* (- 1) |parse_input_~i~0#1|)) 0)) (and (= |parse_input_~i~0#1| 0) (or (= (select |old(#length)| 1) (select |#length| 1)) (not (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) 1)) (not (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|)))) (= |old(#valid)| |#valid|))) (or (= |parse_input_~i~0#1| 0) (not (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|)))))} is VALID [2022-02-20 23:38:18,570 INFO L290 TraceCheckUtils]: 29: Hoare triple {40260#(and (or (not (= (+ (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) (* (- 1) |parse_input_~i~0#1|)) 0)) (and (= |parse_input_~i~0#1| 0) (or (= (select |old(#length)| 1) (select |#length| 1)) (not (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) 1)) (not (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|)))) (= |old(#valid)| |#valid|))) (or (= |parse_input_~i~0#1| 0) (not (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|)))))} assume 1 == #valid[~input#1.base]; {40260#(and (or (not (= (+ (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) (* (- 1) |parse_input_~i~0#1|)) 0)) (and (= |parse_input_~i~0#1| 0) (or (= (select |old(#length)| 1) (select |#length| 1)) (not (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) 1)) (not (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|)))) (= |old(#valid)| |#valid|))) (or (= |parse_input_~i~0#1| 0) (not (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|)))))} is VALID [2022-02-20 23:38:18,571 INFO L290 TraceCheckUtils]: 30: Hoare triple {40260#(and (or (not (= (+ (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) (* (- 1) |parse_input_~i~0#1|)) 0)) (and (= |parse_input_~i~0#1| 0) (or (= (select |old(#length)| 1) (select |#length| 1)) (not (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) 1)) (not (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|)))) (= |old(#valid)| |#valid|))) (or (= |parse_input_~i~0#1| 0) (not (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|)))))} assume ~input#1.offset < #length[~input#1.base] && ~input#1.offset >= 0; {40260#(and (or (not (= (+ (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) (* (- 1) |parse_input_~i~0#1|)) 0)) (and (= |parse_input_~i~0#1| 0) (or (= (select |old(#length)| 1) (select |#length| 1)) (not (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) 1)) (not (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|)))) (= |old(#valid)| |#valid|))) (or (= |parse_input_~i~0#1| 0) (not (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|)))))} is VALID [2022-02-20 23:38:18,572 INFO L290 TraceCheckUtils]: 31: Hoare triple {40260#(and (or (not (= (+ (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) (* (- 1) |parse_input_~i~0#1|)) 0)) (and (= |parse_input_~i~0#1| 0) (or (= (select |old(#length)| 1) (select |#length| 1)) (not (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) 1)) (not (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|)))) (= |old(#valid)| |#valid|))) (or (= |parse_input_~i~0#1| 0) (not (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|)))))} assume 0 == #t~nondet4#1;havoc #t~mem3#1.base, #t~mem3#1.offset;havoc #t~nondet4#1; {40260#(and (or (not (= (+ (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) (* (- 1) |parse_input_~i~0#1|)) 0)) (and (= |parse_input_~i~0#1| 0) (or (= (select |old(#length)| 1) (select |#length| 1)) (not (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) 1)) (not (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|)))) (= |old(#valid)| |#valid|))) (or (= |parse_input_~i~0#1| 0) (not (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|)))))} is VALID [2022-02-20 23:38:18,572 INFO L290 TraceCheckUtils]: 32: Hoare triple {40260#(and (or (not (= (+ (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) (* (- 1) |parse_input_~i~0#1|)) 0)) (and (= |parse_input_~i~0#1| 0) (or (= (select |old(#length)| 1) (select |#length| 1)) (not (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) 1)) (not (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|)))) (= |old(#valid)| |#valid|))) (or (= |parse_input_~i~0#1| 0) (not (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|)))))} SUMMARY for call #t~mem5#1 := read~int(~#commands~0.base, 8 + (~#commands~0.offset + 9 * ~i~0#1), 1); srcloc: L694 {40260#(and (or (not (= (+ (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) (* (- 1) |parse_input_~i~0#1|)) 0)) (and (= |parse_input_~i~0#1| 0) (or (= (select |old(#length)| 1) (select |#length| 1)) (not (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) 1)) (not (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|)))) (= |old(#valid)| |#valid|))) (or (= |parse_input_~i~0#1| 0) (not (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|)))))} is VALID [2022-02-20 23:38:18,573 INFO L290 TraceCheckUtils]: 33: Hoare triple {40260#(and (or (not (= (+ (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) (* (- 1) |parse_input_~i~0#1|)) 0)) (and (= |parse_input_~i~0#1| 0) (or (= (select |old(#length)| 1) (select |#length| 1)) (not (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) 1)) (not (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|)))) (= |old(#valid)| |#valid|))) (or (= |parse_input_~i~0#1| 0) (not (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|)))))} assume ~state~0 >= #t~mem5#1;havoc #t~mem5#1; {40260#(and (or (not (= (+ (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) (* (- 1) |parse_input_~i~0#1|)) 0)) (and (= |parse_input_~i~0#1| 0) (or (= (select |old(#length)| 1) (select |#length| 1)) (not (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) 1)) (not (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|)))) (= |old(#valid)| |#valid|))) (or (= |parse_input_~i~0#1| 0) (not (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|)))))} is VALID [2022-02-20 23:38:18,574 INFO L290 TraceCheckUtils]: 34: Hoare triple {40260#(and (or (not (= (+ (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) (* (- 1) |parse_input_~i~0#1|)) 0)) (and (= |parse_input_~i~0#1| 0) (or (= (select |old(#length)| 1) (select |#length| 1)) (not (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) 1)) (not (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|)))) (= |old(#valid)| |#valid|))) (or (= |parse_input_~i~0#1| 0) (not (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|)))))} SUMMARY for call #t~mem6#1.base, #t~mem6#1.offset := read~$Pointer$(~#commands~0.base, 4 + (~#commands~0.offset + 9 * ~i~0#1), 4); srcloc: L695 {40261#(or (and (or (= (select |old(#length)| 1) (select |#length| 1)) (not (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) 1)) (not (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|)))) (= |old(#valid)| |#valid|)) (not (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) 0)) (not (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|))))} is VALID [2022-02-20 23:38:18,575 INFO L290 TraceCheckUtils]: 35: Hoare triple {40261#(or (and (or (= (select |old(#length)| 1) (select |#length| 1)) (not (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) 1)) (not (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|)))) (= |old(#valid)| |#valid|)) (not (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) 0)) (not (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|))))} assume { :begin_inline_##fun~~TO~VOID } true;##fun~~TO~VOID_#in~#fp#1.base, ##fun~~TO~VOID_#in~#fp#1.offset := #t~mem6#1.base, #t~mem6#1.offset; {40261#(or (and (or (= (select |old(#length)| 1) (select |#length| 1)) (not (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) 1)) (not (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|)))) (= |old(#valid)| |#valid|)) (not (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) 0)) (not (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|))))} is VALID [2022-02-20 23:38:18,575 INFO L290 TraceCheckUtils]: 36: Hoare triple {40261#(or (and (or (= (select |old(#length)| 1) (select |#length| 1)) (not (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) 1)) (not (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|)))) (= |old(#valid)| |#valid|)) (not (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) 0)) (not (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|))))} assume !(##fun~~TO~VOID_#in~#fp#1.base == #funAddr~c2.base && ##fun~~TO~VOID_#in~#fp#1.offset == #funAddr~c2.offset);assume { :begin_inline_c1 } true;havoc c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset, c1_~x~0#1.base, c1_~x~0#1.offset;call c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset := #Ultimate.allocOnHeap(1);c1_~x~0#1.base, c1_~x~0#1.offset := c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset;havoc c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset; {40262#(or (not (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) 0)) (not (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|))) (and (or (= (select |old(#length)| 1) (select |#length| 1)) (not (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) 1)) (= |parse_input_c1_~x~0#1.base| 1) (not (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|)))) (or (not (= |parse_input_c1_~x~0#1.base| 1)) (not (= |parse_input_c1_~x~0#1.base| (select |old(#valid)| |parse_input_c1_~x~0#1.base|))))))} is VALID [2022-02-20 23:38:18,576 INFO L290 TraceCheckUtils]: 37: Hoare triple {40262#(or (not (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) 0)) (not (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|))) (and (or (= (select |old(#length)| 1) (select |#length| 1)) (not (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) 1)) (= |parse_input_c1_~x~0#1.base| 1) (not (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|)))) (or (not (= |parse_input_c1_~x~0#1.base| 1)) (not (= |parse_input_c1_~x~0#1.base| (select |old(#valid)| |parse_input_c1_~x~0#1.base|))))))} assume !(c1_~x~0#1.base == 0 && c1_~x~0#1.offset == 0); {40262#(or (not (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) 0)) (not (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|))) (and (or (= (select |old(#length)| 1) (select |#length| 1)) (not (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) 1)) (= |parse_input_c1_~x~0#1.base| 1) (not (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|)))) (or (not (= |parse_input_c1_~x~0#1.base| 1)) (not (= |parse_input_c1_~x~0#1.base| (select |old(#valid)| |parse_input_c1_~x~0#1.base|))))))} is VALID [2022-02-20 23:38:18,577 INFO L290 TraceCheckUtils]: 38: Hoare triple {40262#(or (not (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) 0)) (not (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|))) (and (or (= (select |old(#length)| 1) (select |#length| 1)) (not (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) 1)) (= |parse_input_c1_~x~0#1.base| 1) (not (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|)))) (or (not (= |parse_input_c1_~x~0#1.base| 1)) (not (= |parse_input_c1_~x~0#1.base| (select |old(#valid)| |parse_input_c1_~x~0#1.base|))))))} assume !(~global~0.base != 0 || ~global~0.offset != 0); {40262#(or (not (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) 0)) (not (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|))) (and (or (= (select |old(#length)| 1) (select |#length| 1)) (not (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) 1)) (= |parse_input_c1_~x~0#1.base| 1) (not (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|)))) (or (not (= |parse_input_c1_~x~0#1.base| 1)) (not (= |parse_input_c1_~x~0#1.base| (select |old(#valid)| |parse_input_c1_~x~0#1.base|))))))} is VALID [2022-02-20 23:38:18,577 INFO L290 TraceCheckUtils]: 39: Hoare triple {40262#(or (not (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) 0)) (not (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|))) (and (or (= (select |old(#length)| 1) (select |#length| 1)) (not (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) 1)) (= |parse_input_c1_~x~0#1.base| 1) (not (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|)))) (or (not (= |parse_input_c1_~x~0#1.base| 1)) (not (= |parse_input_c1_~x~0#1.base| (select |old(#valid)| |parse_input_c1_~x~0#1.base|))))))} ~global~0.base, ~global~0.offset := c1_~x~0#1.base, c1_~x~0#1.offset;~state~0 := ~unnamed3~0~STATE_2; {40263#(or (not (= (select |old(#valid)| 1) 1)) (= (select |old(#length)| 1) (select |#length| 1)) (not (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) 1)) (not (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|))) (not (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) 0)) (not (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|))))} is VALID [2022-02-20 23:38:18,578 INFO L290 TraceCheckUtils]: 40: Hoare triple {40263#(or (not (= (select |old(#valid)| 1) 1)) (= (select |old(#length)| 1) (select |#length| 1)) (not (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) 1)) (not (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|))) (not (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) 0)) (not (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|))))} assume { :end_inline_c1 } true; {40263#(or (not (= (select |old(#valid)| 1) 1)) (= (select |old(#length)| 1) (select |#length| 1)) (not (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) 1)) (not (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|))) (not (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) 0)) (not (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|))))} is VALID [2022-02-20 23:38:18,578 INFO L290 TraceCheckUtils]: 41: Hoare triple {40263#(or (not (= (select |old(#valid)| 1) 1)) (= (select |old(#length)| 1) (select |#length| 1)) (not (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) 1)) (not (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|))) (not (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) 0)) (not (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|))))} assume { :end_inline_##fun~~TO~VOID } true;havoc #t~mem6#1.base, #t~mem6#1.offset; {40263#(or (not (= (select |old(#valid)| 1) 1)) (= (select |old(#length)| 1) (select |#length| 1)) (not (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) 1)) (not (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|))) (not (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) 0)) (not (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|))))} is VALID [2022-02-20 23:38:18,579 INFO L290 TraceCheckUtils]: 42: Hoare triple {40263#(or (not (= (select |old(#valid)| 1) 1)) (= (select |old(#length)| 1) (select |#length| 1)) (not (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) 1)) (not (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|))) (not (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) 0)) (not (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|))))} assume true; {40263#(or (not (= (select |old(#valid)| 1) 1)) (= (select |old(#length)| 1) (select |#length| 1)) (not (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) 1)) (not (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|))) (not (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) 0)) (not (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|))))} is VALID [2022-02-20 23:38:18,579 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {40263#(or (not (= (select |old(#valid)| 1) 1)) (= (select |old(#length)| 1) (select |#length| 1)) (not (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) 1)) (not (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|))) (not (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) 0)) (not (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|))))} {40213#(and (= 3 (select |#length| 1)) (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0) (= |~#commands~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1) (= (select |#valid| 1) (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|)))} #103#return; {40254#(and (<= (+ (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) 3) (select |#length| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0))) (<= 0 (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0)) (= |~#commands~0.offset| 0))} is VALID [2022-02-20 23:38:18,580 INFO L272 TraceCheckUtils]: 44: Hoare triple {40254#(and (<= (+ (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) 3) (select |#length| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0))) (<= 0 (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0)) (= |~#commands~0.offset| 0))} call parse_input(5, 0); {40254#(and (<= (+ (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) 3) (select |#length| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0))) (<= 0 (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0)) (= |~#commands~0.offset| 0))} is VALID [2022-02-20 23:38:18,581 INFO L290 TraceCheckUtils]: 45: Hoare triple {40254#(and (<= (+ (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) 3) (select |#length| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0))) (<= 0 (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0)) (= |~#commands~0.offset| 0))} ~input#1.base, ~input#1.offset := #in~input#1.base, #in~input#1.offset;~i~0#1 := 0; {40255#(and (<= (+ (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset|)) 3) (select |#length| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset|)))) (<= 0 (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset|))) (= (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset|) 0) (= |parse_input_~i~0#1| 0))} is VALID [2022-02-20 23:38:18,581 INFO L290 TraceCheckUtils]: 46: Hoare triple {40255#(and (<= (+ (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset|)) 3) (select |#length| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset|)))) (<= 0 (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset|))) (= (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset|) 0) (= |parse_input_~i~0#1| 0))} assume !!(~i~0#1 < 2); {40255#(and (<= (+ (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset|)) 3) (select |#length| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset|)))) (<= 0 (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset|))) (= (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset|) 0) (= |parse_input_~i~0#1| 0))} is VALID [2022-02-20 23:38:18,581 INFO L290 TraceCheckUtils]: 47: Hoare triple {40255#(and (<= (+ (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset|)) 3) (select |#length| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset|)))) (<= 0 (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset|))) (= (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset|) 0) (= |parse_input_~i~0#1| 0))} SUMMARY for call #t~mem3#1.base, #t~mem3#1.offset := read~$Pointer$(~#commands~0.base, ~#commands~0.offset + 9 * ~i~0#1, 4); srcloc: L693 {40256#(and (<= (+ |parse_input_#t~mem3#1.offset| 3) (select |#length| |parse_input_#t~mem3#1.base|)) (<= 0 |parse_input_#t~mem3#1.offset|))} is VALID [2022-02-20 23:38:18,582 INFO L290 TraceCheckUtils]: 48: Hoare triple {40256#(and (<= (+ |parse_input_#t~mem3#1.offset| 3) (select |#length| |parse_input_#t~mem3#1.base|)) (<= 0 |parse_input_#t~mem3#1.offset|))} assume 1 == #valid[#t~mem3#1.base]; {40256#(and (<= (+ |parse_input_#t~mem3#1.offset| 3) (select |#length| |parse_input_#t~mem3#1.base|)) (<= 0 |parse_input_#t~mem3#1.offset|))} is VALID [2022-02-20 23:38:18,582 INFO L290 TraceCheckUtils]: 49: Hoare triple {40256#(and (<= (+ |parse_input_#t~mem3#1.offset| 3) (select |#length| |parse_input_#t~mem3#1.base|)) (<= 0 |parse_input_#t~mem3#1.offset|))} assume !(#t~mem3#1.offset < #length[#t~mem3#1.base] && #t~mem3#1.offset >= 0); {40212#false} is VALID [2022-02-20 23:38:18,583 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-02-20 23:38:18,583 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:38:18,583 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325616477] [2022-02-20 23:38:18,583 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1325616477] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 23:38:18,583 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [529062271] [2022-02-20 23:38:18,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:38:18,583 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:38:18,584 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:38:18,585 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 23:38:18,586 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-02-20 23:38:18,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:38:18,678 INFO L263 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 29 conjunts are in the unsatisfiable core [2022-02-20 23:38:18,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:38:18,690 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:38:19,443 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:38:19,451 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-02-20 23:38:19,580 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-02-20 23:38:19,586 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-02-20 23:38:19,609 INFO L290 TraceCheckUtils]: 0: Hoare triple {40211#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(3, 1);call write~init~int(99, 1, 0, 1);call write~init~int(49, 1, 1, 1);call write~init~int(0, 1, 2, 1);call #Ultimate.allocInit(3, 2);call write~init~int(99, 2, 0, 1);call write~init~int(50, 2, 1, 1);call write~init~int(0, 2, 2, 1);call #Ultimate.allocInit(3, 3);call write~init~int(99, 3, 0, 1);call write~init~int(49, 3, 1, 1);call write~init~int(0, 3, 2, 1);call #Ultimate.allocInit(3, 4);call write~init~int(99, 4, 0, 1);call write~init~int(49, 4, 1, 1);call write~init~int(0, 4, 2, 1);call #Ultimate.allocInit(3, 5);call write~init~int(99, 5, 0, 1);call write~init~int(50, 5, 1, 1);call write~init~int(0, 5, 2, 1);~state~0 := ~unnamed3~0~STATE_1;~global~0.base, ~global~0.offset := 0, 0;~#commands~0.base, ~#commands~0.offset := 6, 0;call #Ultimate.allocInit(18, 6);call write~init~$Pointer$(1, 0, ~#commands~0.base, ~#commands~0.offset, 4);call write~init~$Pointer$(#funAddr~c1.base, #funAddr~c1.offset, ~#commands~0.base, 4 + ~#commands~0.offset, 4);call write~init~int((if ~unnamed3~0~STATE_1 % 256 <= 127 then ~unnamed3~0~STATE_1 % 256 else ~unnamed3~0~STATE_1 % 256 - 256), ~#commands~0.base, 8 + ~#commands~0.offset, 1);call write~init~$Pointer$(2, 0, ~#commands~0.base, 9 + ~#commands~0.offset, 4);call write~init~$Pointer$(#funAddr~c2.base, #funAddr~c2.offset, ~#commands~0.base, 13 + ~#commands~0.offset, 4);call write~init~int((if ~unnamed3~0~STATE_2 % 256 <= 127 then ~unnamed3~0~STATE_2 % 256 else ~unnamed3~0~STATE_2 % 256 - 256), ~#commands~0.base, 17 + ~#commands~0.offset, 1); {40267#(and (<= 3 (select |#length| 1)) (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0) (= (select |#valid| 1) 1) (= |~#commands~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1))} is VALID [2022-02-20 23:38:19,609 INFO L290 TraceCheckUtils]: 1: Hoare triple {40267#(and (<= 3 (select |#length| 1)) (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0) (= (select |#valid| 1) 1) (= |~#commands~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1))} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1; {40267#(and (<= 3 (select |#length| 1)) (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0) (= (select |#valid| 1) 1) (= |~#commands~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1))} is VALID [2022-02-20 23:38:19,610 INFO L272 TraceCheckUtils]: 2: Hoare triple {40267#(and (<= 3 (select |#length| 1)) (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0) (= (select |#valid| 1) 1) (= |~#commands~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1))} call parse_input(3, 0); {40274#(and (= |old(#length)| |#length|) (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0) (= |~#commands~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 23:38:19,611 INFO L290 TraceCheckUtils]: 3: Hoare triple {40274#(and (= |old(#length)| |#length|) (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0) (= |~#commands~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1) (= |old(#valid)| |#valid|))} ~input#1.base, ~input#1.offset := #in~input#1.base, #in~input#1.offset;~i~0#1 := 0; {40274#(and (= |old(#length)| |#length|) (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0) (= |~#commands~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 23:38:19,611 INFO L290 TraceCheckUtils]: 4: Hoare triple {40274#(and (= |old(#length)| |#length|) (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0) (= |~#commands~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1) (= |old(#valid)| |#valid|))} assume !!(~i~0#1 < 2); {40274#(and (= |old(#length)| |#length|) (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0) (= |~#commands~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 23:38:19,612 INFO L290 TraceCheckUtils]: 5: Hoare triple {40274#(and (= |old(#length)| |#length|) (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0) (= |~#commands~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1) (= |old(#valid)| |#valid|))} SUMMARY for call #t~mem3#1.base, #t~mem3#1.offset := read~$Pointer$(~#commands~0.base, ~#commands~0.offset + 9 * ~i~0#1, 4); srcloc: L693 {40274#(and (= |old(#length)| |#length|) (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0) (= |~#commands~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 23:38:19,612 INFO L290 TraceCheckUtils]: 6: Hoare triple {40274#(and (= |old(#length)| |#length|) (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0) (= |~#commands~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1) (= |old(#valid)| |#valid|))} assume 1 == #valid[#t~mem3#1.base]; {40274#(and (= |old(#length)| |#length|) (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0) (= |~#commands~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 23:38:19,612 INFO L290 TraceCheckUtils]: 7: Hoare triple {40274#(and (= |old(#length)| |#length|) (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0) (= |~#commands~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1) (= |old(#valid)| |#valid|))} assume #t~mem3#1.offset < #length[#t~mem3#1.base] && #t~mem3#1.offset >= 0; {40274#(and (= |old(#length)| |#length|) (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0) (= |~#commands~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 23:38:19,620 INFO L290 TraceCheckUtils]: 8: Hoare triple {40274#(and (= |old(#length)| |#length|) (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0) (= |~#commands~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1) (= |old(#valid)| |#valid|))} assume 1 == #valid[~input#1.base]; {40274#(and (= |old(#length)| |#length|) (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0) (= |~#commands~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 23:38:19,620 INFO L290 TraceCheckUtils]: 9: Hoare triple {40274#(and (= |old(#length)| |#length|) (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0) (= |~#commands~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1) (= |old(#valid)| |#valid|))} assume ~input#1.offset < #length[~input#1.base] && ~input#1.offset >= 0; {40274#(and (= |old(#length)| |#length|) (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0) (= |~#commands~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 23:38:19,621 INFO L290 TraceCheckUtils]: 10: Hoare triple {40274#(and (= |old(#length)| |#length|) (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0) (= |~#commands~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1) (= |old(#valid)| |#valid|))} assume !(0 == #t~nondet4#1);havoc #t~mem3#1.base, #t~mem3#1.offset;havoc #t~nondet4#1; {40274#(and (= |old(#length)| |#length|) (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0) (= |~#commands~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 23:38:19,621 INFO L290 TraceCheckUtils]: 11: Hoare triple {40274#(and (= |old(#length)| |#length|) (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0) (= |~#commands~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1) (= |old(#valid)| |#valid|))} #t~post2#1 := ~i~0#1;~i~0#1 := 1 + #t~post2#1;havoc #t~post2#1; {40274#(and (= |old(#length)| |#length|) (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0) (= |~#commands~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 23:38:19,622 INFO L290 TraceCheckUtils]: 12: Hoare triple {40274#(and (= |old(#length)| |#length|) (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0) (= |~#commands~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1) (= |old(#valid)| |#valid|))} assume !!(~i~0#1 < 2); {40274#(and (= |old(#length)| |#length|) (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0) (= |~#commands~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 23:38:19,623 INFO L290 TraceCheckUtils]: 13: Hoare triple {40274#(and (= |old(#length)| |#length|) (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0) (= |~#commands~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1) (= |old(#valid)| |#valid|))} SUMMARY for call #t~mem3#1.base, #t~mem3#1.offset := read~$Pointer$(~#commands~0.base, ~#commands~0.offset + 9 * ~i~0#1, 4); srcloc: L693 {40274#(and (= |old(#length)| |#length|) (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0) (= |~#commands~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 23:38:19,624 INFO L290 TraceCheckUtils]: 14: Hoare triple {40274#(and (= |old(#length)| |#length|) (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0) (= |~#commands~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1) (= |old(#valid)| |#valid|))} assume 1 == #valid[#t~mem3#1.base]; {40274#(and (= |old(#length)| |#length|) (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0) (= |~#commands~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 23:38:19,624 INFO L290 TraceCheckUtils]: 15: Hoare triple {40274#(and (= |old(#length)| |#length|) (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0) (= |~#commands~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1) (= |old(#valid)| |#valid|))} assume #t~mem3#1.offset < #length[#t~mem3#1.base] && #t~mem3#1.offset >= 0; {40274#(and (= |old(#length)| |#length|) (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0) (= |~#commands~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 23:38:19,625 INFO L290 TraceCheckUtils]: 16: Hoare triple {40274#(and (= |old(#length)| |#length|) (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0) (= |~#commands~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1) (= |old(#valid)| |#valid|))} assume 1 == #valid[~input#1.base]; {40274#(and (= |old(#length)| |#length|) (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0) (= |~#commands~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 23:38:19,625 INFO L290 TraceCheckUtils]: 17: Hoare triple {40274#(and (= |old(#length)| |#length|) (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0) (= |~#commands~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1) (= |old(#valid)| |#valid|))} assume ~input#1.offset < #length[~input#1.base] && ~input#1.offset >= 0; {40274#(and (= |old(#length)| |#length|) (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0) (= |~#commands~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 23:38:19,625 INFO L290 TraceCheckUtils]: 18: Hoare triple {40274#(and (= |old(#length)| |#length|) (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0) (= |~#commands~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1) (= |old(#valid)| |#valid|))} assume !(0 == #t~nondet4#1);havoc #t~mem3#1.base, #t~mem3#1.offset;havoc #t~nondet4#1; {40274#(and (= |old(#length)| |#length|) (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0) (= |~#commands~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 23:38:19,626 INFO L290 TraceCheckUtils]: 19: Hoare triple {40274#(and (= |old(#length)| |#length|) (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0) (= |~#commands~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1) (= |old(#valid)| |#valid|))} #t~post2#1 := ~i~0#1;~i~0#1 := 1 + #t~post2#1;havoc #t~post2#1; {40274#(and (= |old(#length)| |#length|) (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0) (= |~#commands~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 23:38:19,626 INFO L290 TraceCheckUtils]: 20: Hoare triple {40274#(and (= |old(#length)| |#length|) (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0) (= |~#commands~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1) (= |old(#valid)| |#valid|))} assume !(~i~0#1 < 2); {40274#(and (= |old(#length)| |#length|) (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0) (= |~#commands~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 23:38:19,627 INFO L290 TraceCheckUtils]: 21: Hoare triple {40274#(and (= |old(#length)| |#length|) (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0) (= |~#commands~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1) (= |old(#valid)| |#valid|))} assume true; {40274#(and (= |old(#length)| |#length|) (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0) (= |~#commands~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 23:38:19,628 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {40274#(and (= |old(#length)| |#length|) (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0) (= |~#commands~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1) (= |old(#valid)| |#valid|))} {40267#(and (<= 3 (select |#length| 1)) (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0) (= (select |#valid| 1) 1) (= |~#commands~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1))} #101#return; {40267#(and (<= 3 (select |#length| 1)) (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0) (= (select |#valid| 1) 1) (= |~#commands~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1))} is VALID [2022-02-20 23:38:19,629 INFO L272 TraceCheckUtils]: 23: Hoare triple {40267#(and (<= 3 (select |#length| 1)) (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0) (= (select |#valid| 1) 1) (= |~#commands~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1))} call parse_input(4, 0); {40274#(and (= |old(#length)| |#length|) (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0) (= |~#commands~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 23:38:19,629 INFO L290 TraceCheckUtils]: 24: Hoare triple {40274#(and (= |old(#length)| |#length|) (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0) (= |~#commands~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1) (= |old(#valid)| |#valid|))} ~input#1.base, ~input#1.offset := #in~input#1.base, #in~input#1.offset;~i~0#1 := 0; {40274#(and (= |old(#length)| |#length|) (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0) (= |~#commands~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 23:38:19,630 INFO L290 TraceCheckUtils]: 25: Hoare triple {40274#(and (= |old(#length)| |#length|) (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0) (= |~#commands~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1) (= |old(#valid)| |#valid|))} assume !!(~i~0#1 < 2); {40274#(and (= |old(#length)| |#length|) (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0) (= |~#commands~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 23:38:19,630 INFO L290 TraceCheckUtils]: 26: Hoare triple {40274#(and (= |old(#length)| |#length|) (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0) (= |~#commands~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1) (= |old(#valid)| |#valid|))} SUMMARY for call #t~mem3#1.base, #t~mem3#1.offset := read~$Pointer$(~#commands~0.base, ~#commands~0.offset + 9 * ~i~0#1, 4); srcloc: L693 {40274#(and (= |old(#length)| |#length|) (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0) (= |~#commands~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 23:38:19,631 INFO L290 TraceCheckUtils]: 27: Hoare triple {40274#(and (= |old(#length)| |#length|) (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0) (= |~#commands~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1) (= |old(#valid)| |#valid|))} assume 1 == #valid[#t~mem3#1.base]; {40274#(and (= |old(#length)| |#length|) (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0) (= |~#commands~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 23:38:19,631 INFO L290 TraceCheckUtils]: 28: Hoare triple {40274#(and (= |old(#length)| |#length|) (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0) (= |~#commands~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1) (= |old(#valid)| |#valid|))} assume #t~mem3#1.offset < #length[#t~mem3#1.base] && #t~mem3#1.offset >= 0; {40274#(and (= |old(#length)| |#length|) (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0) (= |~#commands~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 23:38:19,632 INFO L290 TraceCheckUtils]: 29: Hoare triple {40274#(and (= |old(#length)| |#length|) (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0) (= |~#commands~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1) (= |old(#valid)| |#valid|))} assume 1 == #valid[~input#1.base]; {40274#(and (= |old(#length)| |#length|) (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0) (= |~#commands~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 23:38:19,632 INFO L290 TraceCheckUtils]: 30: Hoare triple {40274#(and (= |old(#length)| |#length|) (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0) (= |~#commands~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1) (= |old(#valid)| |#valid|))} assume ~input#1.offset < #length[~input#1.base] && ~input#1.offset >= 0; {40274#(and (= |old(#length)| |#length|) (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0) (= |~#commands~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 23:38:19,633 INFO L290 TraceCheckUtils]: 31: Hoare triple {40274#(and (= |old(#length)| |#length|) (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0) (= |~#commands~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1) (= |old(#valid)| |#valid|))} assume 0 == #t~nondet4#1;havoc #t~mem3#1.base, #t~mem3#1.offset;havoc #t~nondet4#1; {40274#(and (= |old(#length)| |#length|) (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0) (= |~#commands~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 23:38:19,633 INFO L290 TraceCheckUtils]: 32: Hoare triple {40274#(and (= |old(#length)| |#length|) (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0) (= |~#commands~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1) (= |old(#valid)| |#valid|))} SUMMARY for call #t~mem5#1 := read~int(~#commands~0.base, 8 + (~#commands~0.offset + 9 * ~i~0#1), 1); srcloc: L694 {40274#(and (= |old(#length)| |#length|) (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0) (= |~#commands~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 23:38:19,634 INFO L290 TraceCheckUtils]: 33: Hoare triple {40274#(and (= |old(#length)| |#length|) (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0) (= |~#commands~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1) (= |old(#valid)| |#valid|))} assume ~state~0 >= #t~mem5#1;havoc #t~mem5#1; {40274#(and (= |old(#length)| |#length|) (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0) (= |~#commands~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 23:38:19,635 INFO L290 TraceCheckUtils]: 34: Hoare triple {40274#(and (= |old(#length)| |#length|) (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0) (= |~#commands~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1) (= |old(#valid)| |#valid|))} SUMMARY for call #t~mem6#1.base, #t~mem6#1.offset := read~$Pointer$(~#commands~0.base, 4 + (~#commands~0.offset + 9 * ~i~0#1), 4); srcloc: L695 {40274#(and (= |old(#length)| |#length|) (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0) (= |~#commands~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 23:38:19,635 INFO L290 TraceCheckUtils]: 35: Hoare triple {40274#(and (= |old(#length)| |#length|) (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0) (= |~#commands~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1) (= |old(#valid)| |#valid|))} assume { :begin_inline_##fun~~TO~VOID } true;##fun~~TO~VOID_#in~#fp#1.base, ##fun~~TO~VOID_#in~#fp#1.offset := #t~mem6#1.base, #t~mem6#1.offset; {40274#(and (= |old(#length)| |#length|) (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0) (= |~#commands~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 23:38:19,636 INFO L290 TraceCheckUtils]: 36: Hoare triple {40274#(and (= |old(#length)| |#length|) (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0) (= |~#commands~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1) (= |old(#valid)| |#valid|))} assume !(##fun~~TO~VOID_#in~#fp#1.base == #funAddr~c2.base && ##fun~~TO~VOID_#in~#fp#1.offset == #funAddr~c2.offset);assume { :begin_inline_c1 } true;havoc c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset, c1_~x~0#1.base, c1_~x~0#1.offset;call c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset := #Ultimate.allocOnHeap(1);c1_~x~0#1.base, c1_~x~0#1.offset := c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset;havoc c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset; {40377#(and (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0) (= |~#commands~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1) (exists ((v_ArrVal_114 Int) (|parse_input_c1_~x~0#1.base| Int)) (and (= (select |old(#valid)| |parse_input_c1_~x~0#1.base|) 0) (= (store |old(#length)| |parse_input_c1_~x~0#1.base| v_ArrVal_114) |#length|))))} is VALID [2022-02-20 23:38:19,637 INFO L290 TraceCheckUtils]: 37: Hoare triple {40377#(and (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0) (= |~#commands~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1) (exists ((v_ArrVal_114 Int) (|parse_input_c1_~x~0#1.base| Int)) (and (= (select |old(#valid)| |parse_input_c1_~x~0#1.base|) 0) (= (store |old(#length)| |parse_input_c1_~x~0#1.base| v_ArrVal_114) |#length|))))} assume !(c1_~x~0#1.base == 0 && c1_~x~0#1.offset == 0); {40377#(and (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0) (= |~#commands~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1) (exists ((v_ArrVal_114 Int) (|parse_input_c1_~x~0#1.base| Int)) (and (= (select |old(#valid)| |parse_input_c1_~x~0#1.base|) 0) (= (store |old(#length)| |parse_input_c1_~x~0#1.base| v_ArrVal_114) |#length|))))} is VALID [2022-02-20 23:38:19,637 INFO L290 TraceCheckUtils]: 38: Hoare triple {40377#(and (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0) (= |~#commands~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1) (exists ((v_ArrVal_114 Int) (|parse_input_c1_~x~0#1.base| Int)) (and (= (select |old(#valid)| |parse_input_c1_~x~0#1.base|) 0) (= (store |old(#length)| |parse_input_c1_~x~0#1.base| v_ArrVal_114) |#length|))))} assume !(~global~0.base != 0 || ~global~0.offset != 0); {40377#(and (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0) (= |~#commands~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1) (exists ((v_ArrVal_114 Int) (|parse_input_c1_~x~0#1.base| Int)) (and (= (select |old(#valid)| |parse_input_c1_~x~0#1.base|) 0) (= (store |old(#length)| |parse_input_c1_~x~0#1.base| v_ArrVal_114) |#length|))))} is VALID [2022-02-20 23:38:19,638 INFO L290 TraceCheckUtils]: 39: Hoare triple {40377#(and (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0) (= |~#commands~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1) (exists ((v_ArrVal_114 Int) (|parse_input_c1_~x~0#1.base| Int)) (and (= (select |old(#valid)| |parse_input_c1_~x~0#1.base|) 0) (= (store |old(#length)| |parse_input_c1_~x~0#1.base| v_ArrVal_114) |#length|))))} ~global~0.base, ~global~0.offset := c1_~x~0#1.base, c1_~x~0#1.offset;~state~0 := ~unnamed3~0~STATE_2; {40377#(and (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0) (= |~#commands~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1) (exists ((v_ArrVal_114 Int) (|parse_input_c1_~x~0#1.base| Int)) (and (= (select |old(#valid)| |parse_input_c1_~x~0#1.base|) 0) (= (store |old(#length)| |parse_input_c1_~x~0#1.base| v_ArrVal_114) |#length|))))} is VALID [2022-02-20 23:38:19,639 INFO L290 TraceCheckUtils]: 40: Hoare triple {40377#(and (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0) (= |~#commands~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1) (exists ((v_ArrVal_114 Int) (|parse_input_c1_~x~0#1.base| Int)) (and (= (select |old(#valid)| |parse_input_c1_~x~0#1.base|) 0) (= (store |old(#length)| |parse_input_c1_~x~0#1.base| v_ArrVal_114) |#length|))))} assume { :end_inline_c1 } true; {40377#(and (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0) (= |~#commands~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1) (exists ((v_ArrVal_114 Int) (|parse_input_c1_~x~0#1.base| Int)) (and (= (select |old(#valid)| |parse_input_c1_~x~0#1.base|) 0) (= (store |old(#length)| |parse_input_c1_~x~0#1.base| v_ArrVal_114) |#length|))))} is VALID [2022-02-20 23:38:19,639 INFO L290 TraceCheckUtils]: 41: Hoare triple {40377#(and (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0) (= |~#commands~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1) (exists ((v_ArrVal_114 Int) (|parse_input_c1_~x~0#1.base| Int)) (and (= (select |old(#valid)| |parse_input_c1_~x~0#1.base|) 0) (= (store |old(#length)| |parse_input_c1_~x~0#1.base| v_ArrVal_114) |#length|))))} assume { :end_inline_##fun~~TO~VOID } true;havoc #t~mem6#1.base, #t~mem6#1.offset; {40377#(and (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0) (= |~#commands~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1) (exists ((v_ArrVal_114 Int) (|parse_input_c1_~x~0#1.base| Int)) (and (= (select |old(#valid)| |parse_input_c1_~x~0#1.base|) 0) (= (store |old(#length)| |parse_input_c1_~x~0#1.base| v_ArrVal_114) |#length|))))} is VALID [2022-02-20 23:38:19,640 INFO L290 TraceCheckUtils]: 42: Hoare triple {40377#(and (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0) (= |~#commands~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1) (exists ((v_ArrVal_114 Int) (|parse_input_c1_~x~0#1.base| Int)) (and (= (select |old(#valid)| |parse_input_c1_~x~0#1.base|) 0) (= (store |old(#length)| |parse_input_c1_~x~0#1.base| v_ArrVal_114) |#length|))))} assume true; {40377#(and (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0) (= |~#commands~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1) (exists ((v_ArrVal_114 Int) (|parse_input_c1_~x~0#1.base| Int)) (and (= (select |old(#valid)| |parse_input_c1_~x~0#1.base|) 0) (= (store |old(#length)| |parse_input_c1_~x~0#1.base| v_ArrVal_114) |#length|))))} is VALID [2022-02-20 23:38:19,641 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {40377#(and (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0) (= |~#commands~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1) (exists ((v_ArrVal_114 Int) (|parse_input_c1_~x~0#1.base| Int)) (and (= (select |old(#valid)| |parse_input_c1_~x~0#1.base|) 0) (= (store |old(#length)| |parse_input_c1_~x~0#1.base| v_ArrVal_114) |#length|))))} {40267#(and (<= 3 (select |#length| 1)) (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0) (= (select |#valid| 1) 1) (= |~#commands~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1))} #103#return; {40399#(and (<= 3 (select |#length| 1)) (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0) (= |~#commands~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1))} is VALID [2022-02-20 23:38:19,642 INFO L272 TraceCheckUtils]: 44: Hoare triple {40399#(and (<= 3 (select |#length| 1)) (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0) (= |~#commands~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1))} call parse_input(5, 0); {40399#(and (<= 3 (select |#length| 1)) (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0) (= |~#commands~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1))} is VALID [2022-02-20 23:38:19,642 INFO L290 TraceCheckUtils]: 45: Hoare triple {40399#(and (<= 3 (select |#length| 1)) (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0) (= |~#commands~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1))} ~input#1.base, ~input#1.offset := #in~input#1.base, #in~input#1.offset;~i~0#1 := 0; {40406#(and (<= 3 (select |#length| 1)) (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0) (= |~#commands~0.offset| 0) (= |parse_input_~i~0#1| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1))} is VALID [2022-02-20 23:38:19,642 INFO L290 TraceCheckUtils]: 46: Hoare triple {40406#(and (<= 3 (select |#length| 1)) (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0) (= |~#commands~0.offset| 0) (= |parse_input_~i~0#1| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1))} assume !!(~i~0#1 < 2); {40406#(and (<= 3 (select |#length| 1)) (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0) (= |~#commands~0.offset| 0) (= |parse_input_~i~0#1| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1))} is VALID [2022-02-20 23:38:19,643 INFO L290 TraceCheckUtils]: 47: Hoare triple {40406#(and (<= 3 (select |#length| 1)) (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0) (= |~#commands~0.offset| 0) (= |parse_input_~i~0#1| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1))} SUMMARY for call #t~mem3#1.base, #t~mem3#1.offset := read~$Pointer$(~#commands~0.base, ~#commands~0.offset + 9 * ~i~0#1, 4); srcloc: L693 {40413#(and (<= 3 (select |#length| 1)) (= |parse_input_#t~mem3#1.offset| 0) (= |parse_input_#t~mem3#1.base| 1))} is VALID [2022-02-20 23:38:19,643 INFO L290 TraceCheckUtils]: 48: Hoare triple {40413#(and (<= 3 (select |#length| 1)) (= |parse_input_#t~mem3#1.offset| 0) (= |parse_input_#t~mem3#1.base| 1))} assume 1 == #valid[#t~mem3#1.base]; {40413#(and (<= 3 (select |#length| 1)) (= |parse_input_#t~mem3#1.offset| 0) (= |parse_input_#t~mem3#1.base| 1))} is VALID [2022-02-20 23:38:19,644 INFO L290 TraceCheckUtils]: 49: Hoare triple {40413#(and (<= 3 (select |#length| 1)) (= |parse_input_#t~mem3#1.offset| 0) (= |parse_input_#t~mem3#1.base| 1))} assume !(#t~mem3#1.offset < #length[#t~mem3#1.base] && #t~mem3#1.offset >= 0); {40212#false} is VALID [2022-02-20 23:38:19,644 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-02-20 23:38:19,644 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:38:19,847 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [529062271] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 23:38:19,848 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 23:38:19,848 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 6] total 17 [2022-02-20 23:38:19,848 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018933557] [2022-02-20 23:38:19,848 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 23:38:19,848 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 3.7222222222222223) internal successors, (67), 15 states have internal predecessors, (67), 4 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) Word has length 50 [2022-02-20 23:38:19,848 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:38:19,848 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 19 states, 18 states have (on average 3.7222222222222223) internal successors, (67), 15 states have internal predecessors, (67), 4 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 23:38:19,906 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:38:19,907 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-02-20 23:38:19,907 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:38:19,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-02-20 23:38:19,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=424, Unknown=0, NotChecked=0, Total=506 [2022-02-20 23:38:19,908 INFO L87 Difference]: Start difference. First operand 367 states and 445 transitions. Second operand has 19 states, 18 states have (on average 3.7222222222222223) internal successors, (67), 15 states have internal predecessors, (67), 4 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 23:38:21,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:38:21,523 INFO L93 Difference]: Finished difference Result 418 states and 477 transitions. [2022-02-20 23:38:21,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-02-20 23:38:21,523 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 3.7222222222222223) internal successors, (67), 15 states have internal predecessors, (67), 4 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) Word has length 50 [2022-02-20 23:38:21,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:38:21,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 3.7222222222222223) internal successors, (67), 15 states have internal predecessors, (67), 4 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 23:38:21,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 210 transitions. [2022-02-20 23:38:21,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 3.7222222222222223) internal successors, (67), 15 states have internal predecessors, (67), 4 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 23:38:21,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 210 transitions. [2022-02-20 23:38:21,525 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states and 210 transitions. [2022-02-20 23:38:21,692 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 210 edges. 210 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:38:21,697 INFO L225 Difference]: With dead ends: 418 [2022-02-20 23:38:21,697 INFO L226 Difference]: Without dead ends: 418 [2022-02-20 23:38:21,698 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 257 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=329, Invalid=1077, Unknown=0, NotChecked=0, Total=1406 [2022-02-20 23:38:21,698 INFO L933 BasicCegarLoop]: 43 mSDtfsCounter, 372 mSDsluCounter, 382 mSDsCounter, 0 mSdLazyCounter, 466 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 372 SdHoareTripleChecker+Valid, 425 SdHoareTripleChecker+Invalid, 609 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 466 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 108 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-20 23:38:21,699 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [372 Valid, 425 Invalid, 609 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 466 Invalid, 0 Unknown, 108 Unchecked, 0.4s Time] [2022-02-20 23:38:21,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2022-02-20 23:38:21,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 366. [2022-02-20 23:38:21,709 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:38:21,709 INFO L82 GeneralOperation]: Start isEquivalent. First operand 418 states. Second operand has 366 states, 334 states have (on average 1.2574850299401197) internal successors, (420), 349 states have internal predecessors, (420), 8 states have call successors, (8), 8 states have call predecessors, (8), 12 states have return successors, (14), 8 states have call predecessors, (14), 8 states have call successors, (14) [2022-02-20 23:38:21,710 INFO L74 IsIncluded]: Start isIncluded. First operand 418 states. Second operand has 366 states, 334 states have (on average 1.2574850299401197) internal successors, (420), 349 states have internal predecessors, (420), 8 states have call successors, (8), 8 states have call predecessors, (8), 12 states have return successors, (14), 8 states have call predecessors, (14), 8 states have call successors, (14) [2022-02-20 23:38:21,710 INFO L87 Difference]: Start difference. First operand 418 states. Second operand has 366 states, 334 states have (on average 1.2574850299401197) internal successors, (420), 349 states have internal predecessors, (420), 8 states have call successors, (8), 8 states have call predecessors, (8), 12 states have return successors, (14), 8 states have call predecessors, (14), 8 states have call successors, (14) [2022-02-20 23:38:21,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:38:21,716 INFO L93 Difference]: Finished difference Result 418 states and 477 transitions. [2022-02-20 23:38:21,716 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 477 transitions. [2022-02-20 23:38:21,716 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:38:21,716 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:38:21,717 INFO L74 IsIncluded]: Start isIncluded. First operand has 366 states, 334 states have (on average 1.2574850299401197) internal successors, (420), 349 states have internal predecessors, (420), 8 states have call successors, (8), 8 states have call predecessors, (8), 12 states have return successors, (14), 8 states have call predecessors, (14), 8 states have call successors, (14) Second operand 418 states. [2022-02-20 23:38:21,717 INFO L87 Difference]: Start difference. First operand has 366 states, 334 states have (on average 1.2574850299401197) internal successors, (420), 349 states have internal predecessors, (420), 8 states have call successors, (8), 8 states have call predecessors, (8), 12 states have return successors, (14), 8 states have call predecessors, (14), 8 states have call successors, (14) Second operand 418 states. [2022-02-20 23:38:21,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:38:21,723 INFO L93 Difference]: Finished difference Result 418 states and 477 transitions. [2022-02-20 23:38:21,723 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 477 transitions. [2022-02-20 23:38:21,724 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:38:21,724 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:38:21,724 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:38:21,724 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:38:21,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 366 states, 334 states have (on average 1.2574850299401197) internal successors, (420), 349 states have internal predecessors, (420), 8 states have call successors, (8), 8 states have call predecessors, (8), 12 states have return successors, (14), 8 states have call predecessors, (14), 8 states have call successors, (14) [2022-02-20 23:38:21,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 442 transitions. [2022-02-20 23:38:21,729 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 442 transitions. Word has length 50 [2022-02-20 23:38:21,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:38:21,729 INFO L470 AbstractCegarLoop]: Abstraction has 366 states and 442 transitions. [2022-02-20 23:38:21,729 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 3.7222222222222223) internal successors, (67), 15 states have internal predecessors, (67), 4 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 23:38:21,730 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 442 transitions. [2022-02-20 23:38:21,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-02-20 23:38:21,730 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:38:21,730 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:38:21,749 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-02-20 23:38:21,939 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:38:21,939 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting parse_inputErr12ASSERT_VIOLATIONMEMORY_FREE === [parse_inputErr0REQUIRES_VIOLATION, parse_inputErr1REQUIRES_VIOLATION, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2022-02-20 23:38:21,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:38:21,940 INFO L85 PathProgramCache]: Analyzing trace with hash -41520225, now seen corresponding path program 1 times [2022-02-20 23:38:21,940 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:38:21,940 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755220065] [2022-02-20 23:38:21,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:38:21,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:38:21,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:38:21,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 23:38:21,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:38:21,980 INFO L290 TraceCheckUtils]: 0: Hoare triple {42119#(and (= ~global~0.base |old(~global~0.base)|) (= |old(#length)| |#length|) (= |old(~global~0.offset)| ~global~0.offset) (= ~state~0 |old(~state~0)|) (= |old(#valid)| |#valid|))} ~input#1.base, ~input#1.offset := #in~input#1.base, #in~input#1.offset;~i~0#1 := 0; {42096#true} is VALID [2022-02-20 23:38:21,980 INFO L290 TraceCheckUtils]: 1: Hoare triple {42096#true} assume !!(~i~0#1 < 2); {42096#true} is VALID [2022-02-20 23:38:21,980 INFO L290 TraceCheckUtils]: 2: Hoare triple {42096#true} SUMMARY for call #t~mem3#1.base, #t~mem3#1.offset := read~$Pointer$(~#commands~0.base, ~#commands~0.offset + 9 * ~i~0#1, 4); srcloc: L693 {42096#true} is VALID [2022-02-20 23:38:21,980 INFO L290 TraceCheckUtils]: 3: Hoare triple {42096#true} assume 1 == #valid[#t~mem3#1.base]; {42096#true} is VALID [2022-02-20 23:38:21,981 INFO L290 TraceCheckUtils]: 4: Hoare triple {42096#true} assume #t~mem3#1.offset < #length[#t~mem3#1.base] && #t~mem3#1.offset >= 0; {42096#true} is VALID [2022-02-20 23:38:21,981 INFO L290 TraceCheckUtils]: 5: Hoare triple {42096#true} assume 1 == #valid[~input#1.base]; {42096#true} is VALID [2022-02-20 23:38:21,981 INFO L290 TraceCheckUtils]: 6: Hoare triple {42096#true} assume ~input#1.offset < #length[~input#1.base] && ~input#1.offset >= 0; {42096#true} is VALID [2022-02-20 23:38:21,981 INFO L290 TraceCheckUtils]: 7: Hoare triple {42096#true} assume 0 == #t~nondet4#1;havoc #t~mem3#1.base, #t~mem3#1.offset;havoc #t~nondet4#1; {42096#true} is VALID [2022-02-20 23:38:21,981 INFO L290 TraceCheckUtils]: 8: Hoare triple {42096#true} SUMMARY for call #t~mem5#1 := read~int(~#commands~0.base, 8 + (~#commands~0.offset + 9 * ~i~0#1), 1); srcloc: L694 {42096#true} is VALID [2022-02-20 23:38:21,981 INFO L290 TraceCheckUtils]: 9: Hoare triple {42096#true} assume ~state~0 >= #t~mem5#1;havoc #t~mem5#1; {42096#true} is VALID [2022-02-20 23:38:21,981 INFO L290 TraceCheckUtils]: 10: Hoare triple {42096#true} SUMMARY for call #t~mem6#1.base, #t~mem6#1.offset := read~$Pointer$(~#commands~0.base, 4 + (~#commands~0.offset + 9 * ~i~0#1), 4); srcloc: L695 {42096#true} is VALID [2022-02-20 23:38:21,981 INFO L290 TraceCheckUtils]: 11: Hoare triple {42096#true} assume { :begin_inline_##fun~~TO~VOID } true;##fun~~TO~VOID_#in~#fp#1.base, ##fun~~TO~VOID_#in~#fp#1.offset := #t~mem6#1.base, #t~mem6#1.offset; {42096#true} is VALID [2022-02-20 23:38:21,982 INFO L290 TraceCheckUtils]: 12: Hoare triple {42096#true} assume !(##fun~~TO~VOID_#in~#fp#1.base == #funAddr~c2.base && ##fun~~TO~VOID_#in~#fp#1.offset == #funAddr~c2.offset);assume { :begin_inline_c1 } true;havoc c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset, c1_~x~0#1.base, c1_~x~0#1.offset;call c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset := #Ultimate.allocOnHeap(1);c1_~x~0#1.base, c1_~x~0#1.offset := c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset;havoc c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset; {42096#true} is VALID [2022-02-20 23:38:21,982 INFO L290 TraceCheckUtils]: 13: Hoare triple {42096#true} assume !(c1_~x~0#1.base == 0 && c1_~x~0#1.offset == 0); {42096#true} is VALID [2022-02-20 23:38:21,982 INFO L290 TraceCheckUtils]: 14: Hoare triple {42096#true} assume !(~global~0.base != 0 || ~global~0.offset != 0); {42096#true} is VALID [2022-02-20 23:38:21,982 INFO L290 TraceCheckUtils]: 15: Hoare triple {42096#true} ~global~0.base, ~global~0.offset := c1_~x~0#1.base, c1_~x~0#1.offset;~state~0 := ~unnamed3~0~STATE_2; {42096#true} is VALID [2022-02-20 23:38:21,982 INFO L290 TraceCheckUtils]: 16: Hoare triple {42096#true} assume { :end_inline_c1 } true; {42096#true} is VALID [2022-02-20 23:38:21,982 INFO L290 TraceCheckUtils]: 17: Hoare triple {42096#true} assume { :end_inline_##fun~~TO~VOID } true;havoc #t~mem6#1.base, #t~mem6#1.offset; {42096#true} is VALID [2022-02-20 23:38:21,982 INFO L290 TraceCheckUtils]: 18: Hoare triple {42096#true} assume true; {42096#true} is VALID [2022-02-20 23:38:21,982 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {42096#true} {42096#true} #101#return; {42096#true} is VALID [2022-02-20 23:38:21,983 INFO L290 TraceCheckUtils]: 0: Hoare triple {42096#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(3, 1);call write~init~int(99, 1, 0, 1);call write~init~int(49, 1, 1, 1);call write~init~int(0, 1, 2, 1);call #Ultimate.allocInit(3, 2);call write~init~int(99, 2, 0, 1);call write~init~int(50, 2, 1, 1);call write~init~int(0, 2, 2, 1);call #Ultimate.allocInit(3, 3);call write~init~int(99, 3, 0, 1);call write~init~int(49, 3, 1, 1);call write~init~int(0, 3, 2, 1);call #Ultimate.allocInit(3, 4);call write~init~int(99, 4, 0, 1);call write~init~int(49, 4, 1, 1);call write~init~int(0, 4, 2, 1);call #Ultimate.allocInit(3, 5);call write~init~int(99, 5, 0, 1);call write~init~int(50, 5, 1, 1);call write~init~int(0, 5, 2, 1);~state~0 := ~unnamed3~0~STATE_1;~global~0.base, ~global~0.offset := 0, 0;~#commands~0.base, ~#commands~0.offset := 6, 0;call #Ultimate.allocInit(18, 6);call write~init~$Pointer$(1, 0, ~#commands~0.base, ~#commands~0.offset, 4);call write~init~$Pointer$(#funAddr~c1.base, #funAddr~c1.offset, ~#commands~0.base, 4 + ~#commands~0.offset, 4);call write~init~int((if ~unnamed3~0~STATE_1 % 256 <= 127 then ~unnamed3~0~STATE_1 % 256 else ~unnamed3~0~STATE_1 % 256 - 256), ~#commands~0.base, 8 + ~#commands~0.offset, 1);call write~init~$Pointer$(2, 0, ~#commands~0.base, 9 + ~#commands~0.offset, 4);call write~init~$Pointer$(#funAddr~c2.base, #funAddr~c2.offset, ~#commands~0.base, 13 + ~#commands~0.offset, 4);call write~init~int((if ~unnamed3~0~STATE_2 % 256 <= 127 then ~unnamed3~0~STATE_2 % 256 else ~unnamed3~0~STATE_2 % 256 - 256), ~#commands~0.base, 17 + ~#commands~0.offset, 1); {42096#true} is VALID [2022-02-20 23:38:21,983 INFO L290 TraceCheckUtils]: 1: Hoare triple {42096#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1; {42096#true} is VALID [2022-02-20 23:38:21,983 INFO L272 TraceCheckUtils]: 2: Hoare triple {42096#true} call parse_input(3, 0); {42119#(and (= ~global~0.base |old(~global~0.base)|) (= |old(#length)| |#length|) (= |old(~global~0.offset)| ~global~0.offset) (= ~state~0 |old(~state~0)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 23:38:21,984 INFO L290 TraceCheckUtils]: 3: Hoare triple {42119#(and (= ~global~0.base |old(~global~0.base)|) (= |old(#length)| |#length|) (= |old(~global~0.offset)| ~global~0.offset) (= ~state~0 |old(~state~0)|) (= |old(#valid)| |#valid|))} ~input#1.base, ~input#1.offset := #in~input#1.base, #in~input#1.offset;~i~0#1 := 0; {42096#true} is VALID [2022-02-20 23:38:21,984 INFO L290 TraceCheckUtils]: 4: Hoare triple {42096#true} assume !!(~i~0#1 < 2); {42096#true} is VALID [2022-02-20 23:38:21,984 INFO L290 TraceCheckUtils]: 5: Hoare triple {42096#true} SUMMARY for call #t~mem3#1.base, #t~mem3#1.offset := read~$Pointer$(~#commands~0.base, ~#commands~0.offset + 9 * ~i~0#1, 4); srcloc: L693 {42096#true} is VALID [2022-02-20 23:38:21,984 INFO L290 TraceCheckUtils]: 6: Hoare triple {42096#true} assume 1 == #valid[#t~mem3#1.base]; {42096#true} is VALID [2022-02-20 23:38:21,984 INFO L290 TraceCheckUtils]: 7: Hoare triple {42096#true} assume #t~mem3#1.offset < #length[#t~mem3#1.base] && #t~mem3#1.offset >= 0; {42096#true} is VALID [2022-02-20 23:38:21,984 INFO L290 TraceCheckUtils]: 8: Hoare triple {42096#true} assume 1 == #valid[~input#1.base]; {42096#true} is VALID [2022-02-20 23:38:21,984 INFO L290 TraceCheckUtils]: 9: Hoare triple {42096#true} assume ~input#1.offset < #length[~input#1.base] && ~input#1.offset >= 0; {42096#true} is VALID [2022-02-20 23:38:21,984 INFO L290 TraceCheckUtils]: 10: Hoare triple {42096#true} assume 0 == #t~nondet4#1;havoc #t~mem3#1.base, #t~mem3#1.offset;havoc #t~nondet4#1; {42096#true} is VALID [2022-02-20 23:38:21,984 INFO L290 TraceCheckUtils]: 11: Hoare triple {42096#true} SUMMARY for call #t~mem5#1 := read~int(~#commands~0.base, 8 + (~#commands~0.offset + 9 * ~i~0#1), 1); srcloc: L694 {42096#true} is VALID [2022-02-20 23:38:21,985 INFO L290 TraceCheckUtils]: 12: Hoare triple {42096#true} assume ~state~0 >= #t~mem5#1;havoc #t~mem5#1; {42096#true} is VALID [2022-02-20 23:38:21,985 INFO L290 TraceCheckUtils]: 13: Hoare triple {42096#true} SUMMARY for call #t~mem6#1.base, #t~mem6#1.offset := read~$Pointer$(~#commands~0.base, 4 + (~#commands~0.offset + 9 * ~i~0#1), 4); srcloc: L695 {42096#true} is VALID [2022-02-20 23:38:21,985 INFO L290 TraceCheckUtils]: 14: Hoare triple {42096#true} assume { :begin_inline_##fun~~TO~VOID } true;##fun~~TO~VOID_#in~#fp#1.base, ##fun~~TO~VOID_#in~#fp#1.offset := #t~mem6#1.base, #t~mem6#1.offset; {42096#true} is VALID [2022-02-20 23:38:21,985 INFO L290 TraceCheckUtils]: 15: Hoare triple {42096#true} assume !(##fun~~TO~VOID_#in~#fp#1.base == #funAddr~c2.base && ##fun~~TO~VOID_#in~#fp#1.offset == #funAddr~c2.offset);assume { :begin_inline_c1 } true;havoc c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset, c1_~x~0#1.base, c1_~x~0#1.offset;call c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset := #Ultimate.allocOnHeap(1);c1_~x~0#1.base, c1_~x~0#1.offset := c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset;havoc c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset; {42096#true} is VALID [2022-02-20 23:38:21,985 INFO L290 TraceCheckUtils]: 16: Hoare triple {42096#true} assume !(c1_~x~0#1.base == 0 && c1_~x~0#1.offset == 0); {42096#true} is VALID [2022-02-20 23:38:21,985 INFO L290 TraceCheckUtils]: 17: Hoare triple {42096#true} assume !(~global~0.base != 0 || ~global~0.offset != 0); {42096#true} is VALID [2022-02-20 23:38:21,985 INFO L290 TraceCheckUtils]: 18: Hoare triple {42096#true} ~global~0.base, ~global~0.offset := c1_~x~0#1.base, c1_~x~0#1.offset;~state~0 := ~unnamed3~0~STATE_2; {42096#true} is VALID [2022-02-20 23:38:21,985 INFO L290 TraceCheckUtils]: 19: Hoare triple {42096#true} assume { :end_inline_c1 } true; {42096#true} is VALID [2022-02-20 23:38:21,986 INFO L290 TraceCheckUtils]: 20: Hoare triple {42096#true} assume { :end_inline_##fun~~TO~VOID } true;havoc #t~mem6#1.base, #t~mem6#1.offset; {42096#true} is VALID [2022-02-20 23:38:21,986 INFO L290 TraceCheckUtils]: 21: Hoare triple {42096#true} assume true; {42096#true} is VALID [2022-02-20 23:38:21,986 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {42096#true} {42096#true} #101#return; {42096#true} is VALID [2022-02-20 23:38:21,986 INFO L272 TraceCheckUtils]: 23: Hoare triple {42096#true} call parse_input(4, 0); {42096#true} is VALID [2022-02-20 23:38:21,986 INFO L290 TraceCheckUtils]: 24: Hoare triple {42096#true} ~input#1.base, ~input#1.offset := #in~input#1.base, #in~input#1.offset;~i~0#1 := 0; {42096#true} is VALID [2022-02-20 23:38:21,986 INFO L290 TraceCheckUtils]: 25: Hoare triple {42096#true} assume !!(~i~0#1 < 2); {42096#true} is VALID [2022-02-20 23:38:21,986 INFO L290 TraceCheckUtils]: 26: Hoare triple {42096#true} SUMMARY for call #t~mem3#1.base, #t~mem3#1.offset := read~$Pointer$(~#commands~0.base, ~#commands~0.offset + 9 * ~i~0#1, 4); srcloc: L693 {42096#true} is VALID [2022-02-20 23:38:21,986 INFO L290 TraceCheckUtils]: 27: Hoare triple {42096#true} assume 1 == #valid[#t~mem3#1.base]; {42096#true} is VALID [2022-02-20 23:38:21,986 INFO L290 TraceCheckUtils]: 28: Hoare triple {42096#true} assume #t~mem3#1.offset < #length[#t~mem3#1.base] && #t~mem3#1.offset >= 0; {42096#true} is VALID [2022-02-20 23:38:21,987 INFO L290 TraceCheckUtils]: 29: Hoare triple {42096#true} assume 1 == #valid[~input#1.base]; {42096#true} is VALID [2022-02-20 23:38:21,987 INFO L290 TraceCheckUtils]: 30: Hoare triple {42096#true} assume ~input#1.offset < #length[~input#1.base] && ~input#1.offset >= 0; {42096#true} is VALID [2022-02-20 23:38:21,987 INFO L290 TraceCheckUtils]: 31: Hoare triple {42096#true} assume !(0 == #t~nondet4#1);havoc #t~mem3#1.base, #t~mem3#1.offset;havoc #t~nondet4#1; {42096#true} is VALID [2022-02-20 23:38:21,987 INFO L290 TraceCheckUtils]: 32: Hoare triple {42096#true} #t~post2#1 := ~i~0#1;~i~0#1 := 1 + #t~post2#1;havoc #t~post2#1; {42096#true} is VALID [2022-02-20 23:38:21,987 INFO L290 TraceCheckUtils]: 33: Hoare triple {42096#true} assume !!(~i~0#1 < 2); {42096#true} is VALID [2022-02-20 23:38:21,987 INFO L290 TraceCheckUtils]: 34: Hoare triple {42096#true} SUMMARY for call #t~mem3#1.base, #t~mem3#1.offset := read~$Pointer$(~#commands~0.base, ~#commands~0.offset + 9 * ~i~0#1, 4); srcloc: L693 {42096#true} is VALID [2022-02-20 23:38:21,987 INFO L290 TraceCheckUtils]: 35: Hoare triple {42096#true} assume 1 == #valid[#t~mem3#1.base]; {42096#true} is VALID [2022-02-20 23:38:21,987 INFO L290 TraceCheckUtils]: 36: Hoare triple {42096#true} assume #t~mem3#1.offset < #length[#t~mem3#1.base] && #t~mem3#1.offset >= 0; {42096#true} is VALID [2022-02-20 23:38:21,987 INFO L290 TraceCheckUtils]: 37: Hoare triple {42096#true} assume 1 == #valid[~input#1.base]; {42096#true} is VALID [2022-02-20 23:38:21,988 INFO L290 TraceCheckUtils]: 38: Hoare triple {42096#true} assume ~input#1.offset < #length[~input#1.base] && ~input#1.offset >= 0; {42096#true} is VALID [2022-02-20 23:38:21,988 INFO L290 TraceCheckUtils]: 39: Hoare triple {42096#true} assume 0 == #t~nondet4#1;havoc #t~mem3#1.base, #t~mem3#1.offset;havoc #t~nondet4#1; {42096#true} is VALID [2022-02-20 23:38:21,988 INFO L290 TraceCheckUtils]: 40: Hoare triple {42096#true} SUMMARY for call #t~mem5#1 := read~int(~#commands~0.base, 8 + (~#commands~0.offset + 9 * ~i~0#1), 1); srcloc: L694 {42096#true} is VALID [2022-02-20 23:38:21,988 INFO L290 TraceCheckUtils]: 41: Hoare triple {42096#true} assume ~state~0 >= #t~mem5#1;havoc #t~mem5#1; {42096#true} is VALID [2022-02-20 23:38:21,988 INFO L290 TraceCheckUtils]: 42: Hoare triple {42096#true} SUMMARY for call #t~mem6#1.base, #t~mem6#1.offset := read~$Pointer$(~#commands~0.base, 4 + (~#commands~0.offset + 9 * ~i~0#1), 4); srcloc: L695 {42096#true} is VALID [2022-02-20 23:38:21,988 INFO L290 TraceCheckUtils]: 43: Hoare triple {42096#true} assume { :begin_inline_##fun~~TO~VOID } true;##fun~~TO~VOID_#in~#fp#1.base, ##fun~~TO~VOID_#in~#fp#1.offset := #t~mem6#1.base, #t~mem6#1.offset; {42096#true} is VALID [2022-02-20 23:38:21,989 INFO L290 TraceCheckUtils]: 44: Hoare triple {42096#true} assume ##fun~~TO~VOID_#in~#fp#1.base == #funAddr~c2.base && ##fun~~TO~VOID_#in~#fp#1.offset == #funAddr~c2.offset;assume { :begin_inline_c2 } true;havoc c2_~y~0#1.base, c2_~y~0#1.offset;c2_~y~0#1.base, c2_~y~0#1.offset := 0, 0; {42118#(and (= |parse_input_c2_~y~0#1.base| 0) (= |parse_input_c2_~y~0#1.offset| 0))} is VALID [2022-02-20 23:38:21,989 INFO L290 TraceCheckUtils]: 45: Hoare triple {42118#(and (= |parse_input_c2_~y~0#1.base| 0) (= |parse_input_c2_~y~0#1.offset| 0))} assume !((c2_~y~0#1.base == 0 && c2_~y~0#1.offset == 0) || (~global~0.base == 0 && ~global~0.offset == 0)); {42097#false} is VALID [2022-02-20 23:38:21,989 INFO L290 TraceCheckUtils]: 46: Hoare triple {42097#false} assume 0 == c2_~y~0#1.offset; {42097#false} is VALID [2022-02-20 23:38:21,989 INFO L290 TraceCheckUtils]: 47: Hoare triple {42097#false} assume c2_~y~0#1.base < #StackHeapBarrier; {42097#false} is VALID [2022-02-20 23:38:21,989 INFO L290 TraceCheckUtils]: 48: Hoare triple {42097#false} assume !(0 == c2_~y~0#1.base || 1 == #valid[c2_~y~0#1.base]); {42097#false} is VALID [2022-02-20 23:38:21,990 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-02-20 23:38:21,990 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:38:21,990 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755220065] [2022-02-20 23:38:21,990 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1755220065] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 23:38:21,990 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1103030998] [2022-02-20 23:38:21,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:38:21,990 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:38:21,991 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:38:21,994 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 23:38:21,997 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-02-20 23:38:22,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:38:22,120 INFO L263 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-20 23:38:22,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:38:22,130 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:38:22,209 INFO L290 TraceCheckUtils]: 0: Hoare triple {42096#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(3, 1);call write~init~int(99, 1, 0, 1);call write~init~int(49, 1, 1, 1);call write~init~int(0, 1, 2, 1);call #Ultimate.allocInit(3, 2);call write~init~int(99, 2, 0, 1);call write~init~int(50, 2, 1, 1);call write~init~int(0, 2, 2, 1);call #Ultimate.allocInit(3, 3);call write~init~int(99, 3, 0, 1);call write~init~int(49, 3, 1, 1);call write~init~int(0, 3, 2, 1);call #Ultimate.allocInit(3, 4);call write~init~int(99, 4, 0, 1);call write~init~int(49, 4, 1, 1);call write~init~int(0, 4, 2, 1);call #Ultimate.allocInit(3, 5);call write~init~int(99, 5, 0, 1);call write~init~int(50, 5, 1, 1);call write~init~int(0, 5, 2, 1);~state~0 := ~unnamed3~0~STATE_1;~global~0.base, ~global~0.offset := 0, 0;~#commands~0.base, ~#commands~0.offset := 6, 0;call #Ultimate.allocInit(18, 6);call write~init~$Pointer$(1, 0, ~#commands~0.base, ~#commands~0.offset, 4);call write~init~$Pointer$(#funAddr~c1.base, #funAddr~c1.offset, ~#commands~0.base, 4 + ~#commands~0.offset, 4);call write~init~int((if ~unnamed3~0~STATE_1 % 256 <= 127 then ~unnamed3~0~STATE_1 % 256 else ~unnamed3~0~STATE_1 % 256 - 256), ~#commands~0.base, 8 + ~#commands~0.offset, 1);call write~init~$Pointer$(2, 0, ~#commands~0.base, 9 + ~#commands~0.offset, 4);call write~init~$Pointer$(#funAddr~c2.base, #funAddr~c2.offset, ~#commands~0.base, 13 + ~#commands~0.offset, 4);call write~init~int((if ~unnamed3~0~STATE_2 % 256 <= 127 then ~unnamed3~0~STATE_2 % 256 else ~unnamed3~0~STATE_2 % 256 - 256), ~#commands~0.base, 17 + ~#commands~0.offset, 1); {42096#true} is VALID [2022-02-20 23:38:22,209 INFO L290 TraceCheckUtils]: 1: Hoare triple {42096#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1; {42096#true} is VALID [2022-02-20 23:38:22,210 INFO L272 TraceCheckUtils]: 2: Hoare triple {42096#true} call parse_input(3, 0); {42096#true} is VALID [2022-02-20 23:38:22,210 INFO L290 TraceCheckUtils]: 3: Hoare triple {42096#true} ~input#1.base, ~input#1.offset := #in~input#1.base, #in~input#1.offset;~i~0#1 := 0; {42096#true} is VALID [2022-02-20 23:38:22,210 INFO L290 TraceCheckUtils]: 4: Hoare triple {42096#true} assume !!(~i~0#1 < 2); {42096#true} is VALID [2022-02-20 23:38:22,210 INFO L290 TraceCheckUtils]: 5: Hoare triple {42096#true} SUMMARY for call #t~mem3#1.base, #t~mem3#1.offset := read~$Pointer$(~#commands~0.base, ~#commands~0.offset + 9 * ~i~0#1, 4); srcloc: L693 {42096#true} is VALID [2022-02-20 23:38:22,210 INFO L290 TraceCheckUtils]: 6: Hoare triple {42096#true} assume 1 == #valid[#t~mem3#1.base]; {42096#true} is VALID [2022-02-20 23:38:22,210 INFO L290 TraceCheckUtils]: 7: Hoare triple {42096#true} assume #t~mem3#1.offset < #length[#t~mem3#1.base] && #t~mem3#1.offset >= 0; {42096#true} is VALID [2022-02-20 23:38:22,210 INFO L290 TraceCheckUtils]: 8: Hoare triple {42096#true} assume 1 == #valid[~input#1.base]; {42096#true} is VALID [2022-02-20 23:38:22,210 INFO L290 TraceCheckUtils]: 9: Hoare triple {42096#true} assume ~input#1.offset < #length[~input#1.base] && ~input#1.offset >= 0; {42096#true} is VALID [2022-02-20 23:38:22,210 INFO L290 TraceCheckUtils]: 10: Hoare triple {42096#true} assume 0 == #t~nondet4#1;havoc #t~mem3#1.base, #t~mem3#1.offset;havoc #t~nondet4#1; {42096#true} is VALID [2022-02-20 23:38:22,210 INFO L290 TraceCheckUtils]: 11: Hoare triple {42096#true} SUMMARY for call #t~mem5#1 := read~int(~#commands~0.base, 8 + (~#commands~0.offset + 9 * ~i~0#1), 1); srcloc: L694 {42096#true} is VALID [2022-02-20 23:38:22,210 INFO L290 TraceCheckUtils]: 12: Hoare triple {42096#true} assume ~state~0 >= #t~mem5#1;havoc #t~mem5#1; {42096#true} is VALID [2022-02-20 23:38:22,210 INFO L290 TraceCheckUtils]: 13: Hoare triple {42096#true} SUMMARY for call #t~mem6#1.base, #t~mem6#1.offset := read~$Pointer$(~#commands~0.base, 4 + (~#commands~0.offset + 9 * ~i~0#1), 4); srcloc: L695 {42096#true} is VALID [2022-02-20 23:38:22,210 INFO L290 TraceCheckUtils]: 14: Hoare triple {42096#true} assume { :begin_inline_##fun~~TO~VOID } true;##fun~~TO~VOID_#in~#fp#1.base, ##fun~~TO~VOID_#in~#fp#1.offset := #t~mem6#1.base, #t~mem6#1.offset; {42096#true} is VALID [2022-02-20 23:38:22,210 INFO L290 TraceCheckUtils]: 15: Hoare triple {42096#true} assume !(##fun~~TO~VOID_#in~#fp#1.base == #funAddr~c2.base && ##fun~~TO~VOID_#in~#fp#1.offset == #funAddr~c2.offset);assume { :begin_inline_c1 } true;havoc c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset, c1_~x~0#1.base, c1_~x~0#1.offset;call c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset := #Ultimate.allocOnHeap(1);c1_~x~0#1.base, c1_~x~0#1.offset := c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset;havoc c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset; {42096#true} is VALID [2022-02-20 23:38:22,210 INFO L290 TraceCheckUtils]: 16: Hoare triple {42096#true} assume !(c1_~x~0#1.base == 0 && c1_~x~0#1.offset == 0); {42096#true} is VALID [2022-02-20 23:38:22,211 INFO L290 TraceCheckUtils]: 17: Hoare triple {42096#true} assume !(~global~0.base != 0 || ~global~0.offset != 0); {42096#true} is VALID [2022-02-20 23:38:22,211 INFO L290 TraceCheckUtils]: 18: Hoare triple {42096#true} ~global~0.base, ~global~0.offset := c1_~x~0#1.base, c1_~x~0#1.offset;~state~0 := ~unnamed3~0~STATE_2; {42096#true} is VALID [2022-02-20 23:38:22,211 INFO L290 TraceCheckUtils]: 19: Hoare triple {42096#true} assume { :end_inline_c1 } true; {42096#true} is VALID [2022-02-20 23:38:22,211 INFO L290 TraceCheckUtils]: 20: Hoare triple {42096#true} assume { :end_inline_##fun~~TO~VOID } true;havoc #t~mem6#1.base, #t~mem6#1.offset; {42096#true} is VALID [2022-02-20 23:38:22,211 INFO L290 TraceCheckUtils]: 21: Hoare triple {42096#true} assume true; {42096#true} is VALID [2022-02-20 23:38:22,211 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {42096#true} {42096#true} #101#return; {42096#true} is VALID [2022-02-20 23:38:22,211 INFO L272 TraceCheckUtils]: 23: Hoare triple {42096#true} call parse_input(4, 0); {42096#true} is VALID [2022-02-20 23:38:22,211 INFO L290 TraceCheckUtils]: 24: Hoare triple {42096#true} ~input#1.base, ~input#1.offset := #in~input#1.base, #in~input#1.offset;~i~0#1 := 0; {42096#true} is VALID [2022-02-20 23:38:22,211 INFO L290 TraceCheckUtils]: 25: Hoare triple {42096#true} assume !!(~i~0#1 < 2); {42096#true} is VALID [2022-02-20 23:38:22,211 INFO L290 TraceCheckUtils]: 26: Hoare triple {42096#true} SUMMARY for call #t~mem3#1.base, #t~mem3#1.offset := read~$Pointer$(~#commands~0.base, ~#commands~0.offset + 9 * ~i~0#1, 4); srcloc: L693 {42096#true} is VALID [2022-02-20 23:38:22,211 INFO L290 TraceCheckUtils]: 27: Hoare triple {42096#true} assume 1 == #valid[#t~mem3#1.base]; {42096#true} is VALID [2022-02-20 23:38:22,211 INFO L290 TraceCheckUtils]: 28: Hoare triple {42096#true} assume #t~mem3#1.offset < #length[#t~mem3#1.base] && #t~mem3#1.offset >= 0; {42096#true} is VALID [2022-02-20 23:38:22,211 INFO L290 TraceCheckUtils]: 29: Hoare triple {42096#true} assume 1 == #valid[~input#1.base]; {42096#true} is VALID [2022-02-20 23:38:22,211 INFO L290 TraceCheckUtils]: 30: Hoare triple {42096#true} assume ~input#1.offset < #length[~input#1.base] && ~input#1.offset >= 0; {42096#true} is VALID [2022-02-20 23:38:22,211 INFO L290 TraceCheckUtils]: 31: Hoare triple {42096#true} assume !(0 == #t~nondet4#1);havoc #t~mem3#1.base, #t~mem3#1.offset;havoc #t~nondet4#1; {42096#true} is VALID [2022-02-20 23:38:22,211 INFO L290 TraceCheckUtils]: 32: Hoare triple {42096#true} #t~post2#1 := ~i~0#1;~i~0#1 := 1 + #t~post2#1;havoc #t~post2#1; {42096#true} is VALID [2022-02-20 23:38:22,212 INFO L290 TraceCheckUtils]: 33: Hoare triple {42096#true} assume !!(~i~0#1 < 2); {42096#true} is VALID [2022-02-20 23:38:22,212 INFO L290 TraceCheckUtils]: 34: Hoare triple {42096#true} SUMMARY for call #t~mem3#1.base, #t~mem3#1.offset := read~$Pointer$(~#commands~0.base, ~#commands~0.offset + 9 * ~i~0#1, 4); srcloc: L693 {42096#true} is VALID [2022-02-20 23:38:22,212 INFO L290 TraceCheckUtils]: 35: Hoare triple {42096#true} assume 1 == #valid[#t~mem3#1.base]; {42096#true} is VALID [2022-02-20 23:38:22,212 INFO L290 TraceCheckUtils]: 36: Hoare triple {42096#true} assume #t~mem3#1.offset < #length[#t~mem3#1.base] && #t~mem3#1.offset >= 0; {42096#true} is VALID [2022-02-20 23:38:22,212 INFO L290 TraceCheckUtils]: 37: Hoare triple {42096#true} assume 1 == #valid[~input#1.base]; {42096#true} is VALID [2022-02-20 23:38:22,212 INFO L290 TraceCheckUtils]: 38: Hoare triple {42096#true} assume ~input#1.offset < #length[~input#1.base] && ~input#1.offset >= 0; {42096#true} is VALID [2022-02-20 23:38:22,212 INFO L290 TraceCheckUtils]: 39: Hoare triple {42096#true} assume 0 == #t~nondet4#1;havoc #t~mem3#1.base, #t~mem3#1.offset;havoc #t~nondet4#1; {42096#true} is VALID [2022-02-20 23:38:22,212 INFO L290 TraceCheckUtils]: 40: Hoare triple {42096#true} SUMMARY for call #t~mem5#1 := read~int(~#commands~0.base, 8 + (~#commands~0.offset + 9 * ~i~0#1), 1); srcloc: L694 {42096#true} is VALID [2022-02-20 23:38:22,212 INFO L290 TraceCheckUtils]: 41: Hoare triple {42096#true} assume ~state~0 >= #t~mem5#1;havoc #t~mem5#1; {42096#true} is VALID [2022-02-20 23:38:22,212 INFO L290 TraceCheckUtils]: 42: Hoare triple {42096#true} SUMMARY for call #t~mem6#1.base, #t~mem6#1.offset := read~$Pointer$(~#commands~0.base, 4 + (~#commands~0.offset + 9 * ~i~0#1), 4); srcloc: L695 {42096#true} is VALID [2022-02-20 23:38:22,212 INFO L290 TraceCheckUtils]: 43: Hoare triple {42096#true} assume { :begin_inline_##fun~~TO~VOID } true;##fun~~TO~VOID_#in~#fp#1.base, ##fun~~TO~VOID_#in~#fp#1.offset := #t~mem6#1.base, #t~mem6#1.offset; {42096#true} is VALID [2022-02-20 23:38:22,212 INFO L290 TraceCheckUtils]: 44: Hoare triple {42096#true} assume ##fun~~TO~VOID_#in~#fp#1.base == #funAddr~c2.base && ##fun~~TO~VOID_#in~#fp#1.offset == #funAddr~c2.offset;assume { :begin_inline_c2 } true;havoc c2_~y~0#1.base, c2_~y~0#1.offset;c2_~y~0#1.base, c2_~y~0#1.offset := 0, 0; {42255#(= |parse_input_c2_~y~0#1.base| 0)} is VALID [2022-02-20 23:38:22,213 INFO L290 TraceCheckUtils]: 45: Hoare triple {42255#(= |parse_input_c2_~y~0#1.base| 0)} assume !((c2_~y~0#1.base == 0 && c2_~y~0#1.offset == 0) || (~global~0.base == 0 && ~global~0.offset == 0)); {42255#(= |parse_input_c2_~y~0#1.base| 0)} is VALID [2022-02-20 23:38:22,213 INFO L290 TraceCheckUtils]: 46: Hoare triple {42255#(= |parse_input_c2_~y~0#1.base| 0)} assume 0 == c2_~y~0#1.offset; {42255#(= |parse_input_c2_~y~0#1.base| 0)} is VALID [2022-02-20 23:38:22,213 INFO L290 TraceCheckUtils]: 47: Hoare triple {42255#(= |parse_input_c2_~y~0#1.base| 0)} assume c2_~y~0#1.base < #StackHeapBarrier; {42255#(= |parse_input_c2_~y~0#1.base| 0)} is VALID [2022-02-20 23:38:22,213 INFO L290 TraceCheckUtils]: 48: Hoare triple {42255#(= |parse_input_c2_~y~0#1.base| 0)} assume !(0 == c2_~y~0#1.base || 1 == #valid[c2_~y~0#1.base]); {42097#false} is VALID [2022-02-20 23:38:22,214 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-02-20 23:38:22,214 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:38:22,214 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1103030998] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:38:22,214 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-20 23:38:22,214 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2022-02-20 23:38:22,214 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559646593] [2022-02-20 23:38:22,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:38:22,214 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 14.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 49 [2022-02-20 23:38:22,214 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:38:22,215 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 14.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:38:22,232 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:38:22,232 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:38:22,232 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:38:22,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:38:22,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:38:22,233 INFO L87 Difference]: Start difference. First operand 366 states and 442 transitions. Second operand has 3 states, 2 states have (on average 14.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:38:22,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:38:22,276 INFO L93 Difference]: Finished difference Result 384 states and 456 transitions. [2022-02-20 23:38:22,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:38:22,276 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 14.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 49 [2022-02-20 23:38:22,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:38:22,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 14.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:38:22,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 63 transitions. [2022-02-20 23:38:22,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 14.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:38:22,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 63 transitions. [2022-02-20 23:38:22,277 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 63 transitions. [2022-02-20 23:38:22,314 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:38:22,318 INFO L225 Difference]: With dead ends: 384 [2022-02-20 23:38:22,318 INFO L226 Difference]: Without dead ends: 384 [2022-02-20 23:38:22,319 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:38:22,319 INFO L933 BasicCegarLoop]: 58 mSDtfsCounter, 9 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:38:22,319 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 107 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:38:22,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2022-02-20 23:38:22,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 365. [2022-02-20 23:38:22,323 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:38:22,324 INFO L82 GeneralOperation]: Start isEquivalent. First operand 384 states. Second operand has 365 states, 334 states have (on average 1.2425149700598803) internal successors, (415), 348 states have internal predecessors, (415), 8 states have call successors, (8), 8 states have call predecessors, (8), 12 states have return successors, (14), 8 states have call predecessors, (14), 8 states have call successors, (14) [2022-02-20 23:38:22,324 INFO L74 IsIncluded]: Start isIncluded. First operand 384 states. Second operand has 365 states, 334 states have (on average 1.2425149700598803) internal successors, (415), 348 states have internal predecessors, (415), 8 states have call successors, (8), 8 states have call predecessors, (8), 12 states have return successors, (14), 8 states have call predecessors, (14), 8 states have call successors, (14) [2022-02-20 23:38:22,324 INFO L87 Difference]: Start difference. First operand 384 states. Second operand has 365 states, 334 states have (on average 1.2425149700598803) internal successors, (415), 348 states have internal predecessors, (415), 8 states have call successors, (8), 8 states have call predecessors, (8), 12 states have return successors, (14), 8 states have call predecessors, (14), 8 states have call successors, (14) [2022-02-20 23:38:22,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:38:22,329 INFO L93 Difference]: Finished difference Result 384 states and 456 transitions. [2022-02-20 23:38:22,329 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 456 transitions. [2022-02-20 23:38:22,330 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:38:22,330 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:38:22,330 INFO L74 IsIncluded]: Start isIncluded. First operand has 365 states, 334 states have (on average 1.2425149700598803) internal successors, (415), 348 states have internal predecessors, (415), 8 states have call successors, (8), 8 states have call predecessors, (8), 12 states have return successors, (14), 8 states have call predecessors, (14), 8 states have call successors, (14) Second operand 384 states. [2022-02-20 23:38:22,331 INFO L87 Difference]: Start difference. First operand has 365 states, 334 states have (on average 1.2425149700598803) internal successors, (415), 348 states have internal predecessors, (415), 8 states have call successors, (8), 8 states have call predecessors, (8), 12 states have return successors, (14), 8 states have call predecessors, (14), 8 states have call successors, (14) Second operand 384 states. [2022-02-20 23:38:22,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:38:22,336 INFO L93 Difference]: Finished difference Result 384 states and 456 transitions. [2022-02-20 23:38:22,336 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 456 transitions. [2022-02-20 23:38:22,336 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:38:22,336 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:38:22,336 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:38:22,337 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:38:22,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 365 states, 334 states have (on average 1.2425149700598803) internal successors, (415), 348 states have internal predecessors, (415), 8 states have call successors, (8), 8 states have call predecessors, (8), 12 states have return successors, (14), 8 states have call predecessors, (14), 8 states have call successors, (14) [2022-02-20 23:38:22,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 437 transitions. [2022-02-20 23:38:22,341 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 437 transitions. Word has length 49 [2022-02-20 23:38:22,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:38:22,342 INFO L470 AbstractCegarLoop]: Abstraction has 365 states and 437 transitions. [2022-02-20 23:38:22,342 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 14.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:38:22,342 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 437 transitions. [2022-02-20 23:38:22,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-02-20 23:38:22,342 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:38:22,342 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:38:22,367 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-02-20 23:38:22,567 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:38:22,568 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATION, parse_inputErr1REQUIRES_VIOLATION, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2022-02-20 23:38:22,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:38:22,568 INFO L85 PathProgramCache]: Analyzing trace with hash 825866446, now seen corresponding path program 1 times [2022-02-20 23:38:22,568 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:38:22,568 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048998737] [2022-02-20 23:38:22,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:38:22,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:38:22,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:38:22,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 23:38:22,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:38:22,636 INFO L290 TraceCheckUtils]: 0: Hoare triple {43829#(and (= ~global~0.base |old(~global~0.base)|) (= |old(#length)| |#length|) (= |old(~global~0.offset)| ~global~0.offset) (= ~state~0 |old(~state~0)|) (= |old(#valid)| |#valid|))} ~input#1.base, ~input#1.offset := #in~input#1.base, #in~input#1.offset;~i~0#1 := 0; {43830#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:38:22,637 INFO L290 TraceCheckUtils]: 1: Hoare triple {43830#(= |old(#valid)| |#valid|)} assume !!(~i~0#1 < 2); {43830#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:38:22,637 INFO L290 TraceCheckUtils]: 2: Hoare triple {43830#(= |old(#valid)| |#valid|)} SUMMARY for call #t~mem3#1.base, #t~mem3#1.offset := read~$Pointer$(~#commands~0.base, ~#commands~0.offset + 9 * ~i~0#1, 4); srcloc: L693 {43830#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:38:22,637 INFO L290 TraceCheckUtils]: 3: Hoare triple {43830#(= |old(#valid)| |#valid|)} assume 1 == #valid[#t~mem3#1.base]; {43830#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:38:22,638 INFO L290 TraceCheckUtils]: 4: Hoare triple {43830#(= |old(#valid)| |#valid|)} assume #t~mem3#1.offset < #length[#t~mem3#1.base] && #t~mem3#1.offset >= 0; {43830#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:38:22,638 INFO L290 TraceCheckUtils]: 5: Hoare triple {43830#(= |old(#valid)| |#valid|)} assume 1 == #valid[~input#1.base]; {43830#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:38:22,638 INFO L290 TraceCheckUtils]: 6: Hoare triple {43830#(= |old(#valid)| |#valid|)} assume ~input#1.offset < #length[~input#1.base] && ~input#1.offset >= 0; {43830#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:38:22,639 INFO L290 TraceCheckUtils]: 7: Hoare triple {43830#(= |old(#valid)| |#valid|)} assume !(0 == #t~nondet4#1);havoc #t~mem3#1.base, #t~mem3#1.offset;havoc #t~nondet4#1; {43830#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:38:22,639 INFO L290 TraceCheckUtils]: 8: Hoare triple {43830#(= |old(#valid)| |#valid|)} #t~post2#1 := ~i~0#1;~i~0#1 := 1 + #t~post2#1;havoc #t~post2#1; {43830#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:38:22,639 INFO L290 TraceCheckUtils]: 9: Hoare triple {43830#(= |old(#valid)| |#valid|)} assume !!(~i~0#1 < 2); {43830#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:38:22,640 INFO L290 TraceCheckUtils]: 10: Hoare triple {43830#(= |old(#valid)| |#valid|)} SUMMARY for call #t~mem3#1.base, #t~mem3#1.offset := read~$Pointer$(~#commands~0.base, ~#commands~0.offset + 9 * ~i~0#1, 4); srcloc: L693 {43830#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:38:22,640 INFO L290 TraceCheckUtils]: 11: Hoare triple {43830#(= |old(#valid)| |#valid|)} assume 1 == #valid[#t~mem3#1.base]; {43830#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:38:22,640 INFO L290 TraceCheckUtils]: 12: Hoare triple {43830#(= |old(#valid)| |#valid|)} assume #t~mem3#1.offset < #length[#t~mem3#1.base] && #t~mem3#1.offset >= 0; {43830#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:38:22,641 INFO L290 TraceCheckUtils]: 13: Hoare triple {43830#(= |old(#valid)| |#valid|)} assume 1 == #valid[~input#1.base]; {43830#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:38:22,641 INFO L290 TraceCheckUtils]: 14: Hoare triple {43830#(= |old(#valid)| |#valid|)} assume ~input#1.offset < #length[~input#1.base] && ~input#1.offset >= 0; {43830#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:38:22,641 INFO L290 TraceCheckUtils]: 15: Hoare triple {43830#(= |old(#valid)| |#valid|)} assume !(0 == #t~nondet4#1);havoc #t~mem3#1.base, #t~mem3#1.offset;havoc #t~nondet4#1; {43830#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:38:22,642 INFO L290 TraceCheckUtils]: 16: Hoare triple {43830#(= |old(#valid)| |#valid|)} #t~post2#1 := ~i~0#1;~i~0#1 := 1 + #t~post2#1;havoc #t~post2#1; {43830#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:38:22,642 INFO L290 TraceCheckUtils]: 17: Hoare triple {43830#(= |old(#valid)| |#valid|)} assume !(~i~0#1 < 2); {43830#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:38:22,642 INFO L290 TraceCheckUtils]: 18: Hoare triple {43830#(= |old(#valid)| |#valid|)} assume true; {43830#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:38:22,643 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {43830#(= |old(#valid)| |#valid|)} {43786#(= 1 (select |#valid| 5))} #101#return; {43786#(= 1 (select |#valid| 5))} is VALID [2022-02-20 23:38:22,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-02-20 23:38:22,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:38:22,659 INFO L290 TraceCheckUtils]: 0: Hoare triple {43829#(and (= ~global~0.base |old(~global~0.base)|) (= |old(#length)| |#length|) (= |old(~global~0.offset)| ~global~0.offset) (= ~state~0 |old(~state~0)|) (= |old(#valid)| |#valid|))} ~input#1.base, ~input#1.offset := #in~input#1.base, #in~input#1.offset;~i~0#1 := 0; {43830#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:38:22,660 INFO L290 TraceCheckUtils]: 1: Hoare triple {43830#(= |old(#valid)| |#valid|)} assume !!(~i~0#1 < 2); {43830#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:38:22,660 INFO L290 TraceCheckUtils]: 2: Hoare triple {43830#(= |old(#valid)| |#valid|)} SUMMARY for call #t~mem3#1.base, #t~mem3#1.offset := read~$Pointer$(~#commands~0.base, ~#commands~0.offset + 9 * ~i~0#1, 4); srcloc: L693 {43830#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:38:22,661 INFO L290 TraceCheckUtils]: 3: Hoare triple {43830#(= |old(#valid)| |#valid|)} assume 1 == #valid[#t~mem3#1.base]; {43830#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:38:22,661 INFO L290 TraceCheckUtils]: 4: Hoare triple {43830#(= |old(#valid)| |#valid|)} assume #t~mem3#1.offset < #length[#t~mem3#1.base] && #t~mem3#1.offset >= 0; {43830#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:38:22,661 INFO L290 TraceCheckUtils]: 5: Hoare triple {43830#(= |old(#valid)| |#valid|)} assume 1 == #valid[~input#1.base]; {43830#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:38:22,662 INFO L290 TraceCheckUtils]: 6: Hoare triple {43830#(= |old(#valid)| |#valid|)} assume ~input#1.offset < #length[~input#1.base] && ~input#1.offset >= 0; {43830#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:38:22,662 INFO L290 TraceCheckUtils]: 7: Hoare triple {43830#(= |old(#valid)| |#valid|)} assume !(0 == #t~nondet4#1);havoc #t~mem3#1.base, #t~mem3#1.offset;havoc #t~nondet4#1; {43830#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:38:22,662 INFO L290 TraceCheckUtils]: 8: Hoare triple {43830#(= |old(#valid)| |#valid|)} #t~post2#1 := ~i~0#1;~i~0#1 := 1 + #t~post2#1;havoc #t~post2#1; {43830#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:38:22,663 INFO L290 TraceCheckUtils]: 9: Hoare triple {43830#(= |old(#valid)| |#valid|)} assume !!(~i~0#1 < 2); {43830#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:38:22,663 INFO L290 TraceCheckUtils]: 10: Hoare triple {43830#(= |old(#valid)| |#valid|)} SUMMARY for call #t~mem3#1.base, #t~mem3#1.offset := read~$Pointer$(~#commands~0.base, ~#commands~0.offset + 9 * ~i~0#1, 4); srcloc: L693 {43830#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:38:22,663 INFO L290 TraceCheckUtils]: 11: Hoare triple {43830#(= |old(#valid)| |#valid|)} assume 1 == #valid[#t~mem3#1.base]; {43830#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:38:22,664 INFO L290 TraceCheckUtils]: 12: Hoare triple {43830#(= |old(#valid)| |#valid|)} assume #t~mem3#1.offset < #length[#t~mem3#1.base] && #t~mem3#1.offset >= 0; {43830#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:38:22,664 INFO L290 TraceCheckUtils]: 13: Hoare triple {43830#(= |old(#valid)| |#valid|)} assume 1 == #valid[~input#1.base]; {43830#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:38:22,664 INFO L290 TraceCheckUtils]: 14: Hoare triple {43830#(= |old(#valid)| |#valid|)} assume ~input#1.offset < #length[~input#1.base] && ~input#1.offset >= 0; {43830#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:38:22,665 INFO L290 TraceCheckUtils]: 15: Hoare triple {43830#(= |old(#valid)| |#valid|)} assume !(0 == #t~nondet4#1);havoc #t~mem3#1.base, #t~mem3#1.offset;havoc #t~nondet4#1; {43830#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:38:22,665 INFO L290 TraceCheckUtils]: 16: Hoare triple {43830#(= |old(#valid)| |#valid|)} #t~post2#1 := ~i~0#1;~i~0#1 := 1 + #t~post2#1;havoc #t~post2#1; {43830#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:38:22,665 INFO L290 TraceCheckUtils]: 17: Hoare triple {43830#(= |old(#valid)| |#valid|)} assume !(~i~0#1 < 2); {43830#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:38:22,666 INFO L290 TraceCheckUtils]: 18: Hoare triple {43830#(= |old(#valid)| |#valid|)} assume true; {43830#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:38:22,666 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {43830#(= |old(#valid)| |#valid|)} {43786#(= 1 (select |#valid| 5))} #103#return; {43786#(= 1 (select |#valid| 5))} is VALID [2022-02-20 23:38:22,667 INFO L290 TraceCheckUtils]: 0: Hoare triple {43784#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(3, 1);call write~init~int(99, 1, 0, 1);call write~init~int(49, 1, 1, 1);call write~init~int(0, 1, 2, 1);call #Ultimate.allocInit(3, 2);call write~init~int(99, 2, 0, 1);call write~init~int(50, 2, 1, 1);call write~init~int(0, 2, 2, 1);call #Ultimate.allocInit(3, 3);call write~init~int(99, 3, 0, 1);call write~init~int(49, 3, 1, 1);call write~init~int(0, 3, 2, 1);call #Ultimate.allocInit(3, 4);call write~init~int(99, 4, 0, 1);call write~init~int(49, 4, 1, 1);call write~init~int(0, 4, 2, 1);call #Ultimate.allocInit(3, 5);call write~init~int(99, 5, 0, 1);call write~init~int(50, 5, 1, 1);call write~init~int(0, 5, 2, 1);~state~0 := ~unnamed3~0~STATE_1;~global~0.base, ~global~0.offset := 0, 0;~#commands~0.base, ~#commands~0.offset := 6, 0;call #Ultimate.allocInit(18, 6);call write~init~$Pointer$(1, 0, ~#commands~0.base, ~#commands~0.offset, 4);call write~init~$Pointer$(#funAddr~c1.base, #funAddr~c1.offset, ~#commands~0.base, 4 + ~#commands~0.offset, 4);call write~init~int((if ~unnamed3~0~STATE_1 % 256 <= 127 then ~unnamed3~0~STATE_1 % 256 else ~unnamed3~0~STATE_1 % 256 - 256), ~#commands~0.base, 8 + ~#commands~0.offset, 1);call write~init~$Pointer$(2, 0, ~#commands~0.base, 9 + ~#commands~0.offset, 4);call write~init~$Pointer$(#funAddr~c2.base, #funAddr~c2.offset, ~#commands~0.base, 13 + ~#commands~0.offset, 4);call write~init~int((if ~unnamed3~0~STATE_2 % 256 <= 127 then ~unnamed3~0~STATE_2 % 256 else ~unnamed3~0~STATE_2 % 256 - 256), ~#commands~0.base, 17 + ~#commands~0.offset, 1); {43786#(= 1 (select |#valid| 5))} is VALID [2022-02-20 23:38:22,668 INFO L290 TraceCheckUtils]: 1: Hoare triple {43786#(= 1 (select |#valid| 5))} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1; {43786#(= 1 (select |#valid| 5))} is VALID [2022-02-20 23:38:22,668 INFO L272 TraceCheckUtils]: 2: Hoare triple {43786#(= 1 (select |#valid| 5))} call parse_input(3, 0); {43829#(and (= ~global~0.base |old(~global~0.base)|) (= |old(#length)| |#length|) (= |old(~global~0.offset)| ~global~0.offset) (= ~state~0 |old(~state~0)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 23:38:22,669 INFO L290 TraceCheckUtils]: 3: Hoare triple {43829#(and (= ~global~0.base |old(~global~0.base)|) (= |old(#length)| |#length|) (= |old(~global~0.offset)| ~global~0.offset) (= ~state~0 |old(~state~0)|) (= |old(#valid)| |#valid|))} ~input#1.base, ~input#1.offset := #in~input#1.base, #in~input#1.offset;~i~0#1 := 0; {43830#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:38:22,669 INFO L290 TraceCheckUtils]: 4: Hoare triple {43830#(= |old(#valid)| |#valid|)} assume !!(~i~0#1 < 2); {43830#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:38:22,669 INFO L290 TraceCheckUtils]: 5: Hoare triple {43830#(= |old(#valid)| |#valid|)} SUMMARY for call #t~mem3#1.base, #t~mem3#1.offset := read~$Pointer$(~#commands~0.base, ~#commands~0.offset + 9 * ~i~0#1, 4); srcloc: L693 {43830#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:38:22,670 INFO L290 TraceCheckUtils]: 6: Hoare triple {43830#(= |old(#valid)| |#valid|)} assume 1 == #valid[#t~mem3#1.base]; {43830#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:38:22,670 INFO L290 TraceCheckUtils]: 7: Hoare triple {43830#(= |old(#valid)| |#valid|)} assume #t~mem3#1.offset < #length[#t~mem3#1.base] && #t~mem3#1.offset >= 0; {43830#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:38:22,670 INFO L290 TraceCheckUtils]: 8: Hoare triple {43830#(= |old(#valid)| |#valid|)} assume 1 == #valid[~input#1.base]; {43830#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:38:22,671 INFO L290 TraceCheckUtils]: 9: Hoare triple {43830#(= |old(#valid)| |#valid|)} assume ~input#1.offset < #length[~input#1.base] && ~input#1.offset >= 0; {43830#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:38:22,671 INFO L290 TraceCheckUtils]: 10: Hoare triple {43830#(= |old(#valid)| |#valid|)} assume !(0 == #t~nondet4#1);havoc #t~mem3#1.base, #t~mem3#1.offset;havoc #t~nondet4#1; {43830#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:38:22,671 INFO L290 TraceCheckUtils]: 11: Hoare triple {43830#(= |old(#valid)| |#valid|)} #t~post2#1 := ~i~0#1;~i~0#1 := 1 + #t~post2#1;havoc #t~post2#1; {43830#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:38:22,672 INFO L290 TraceCheckUtils]: 12: Hoare triple {43830#(= |old(#valid)| |#valid|)} assume !!(~i~0#1 < 2); {43830#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:38:22,672 INFO L290 TraceCheckUtils]: 13: Hoare triple {43830#(= |old(#valid)| |#valid|)} SUMMARY for call #t~mem3#1.base, #t~mem3#1.offset := read~$Pointer$(~#commands~0.base, ~#commands~0.offset + 9 * ~i~0#1, 4); srcloc: L693 {43830#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:38:22,672 INFO L290 TraceCheckUtils]: 14: Hoare triple {43830#(= |old(#valid)| |#valid|)} assume 1 == #valid[#t~mem3#1.base]; {43830#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:38:22,673 INFO L290 TraceCheckUtils]: 15: Hoare triple {43830#(= |old(#valid)| |#valid|)} assume #t~mem3#1.offset < #length[#t~mem3#1.base] && #t~mem3#1.offset >= 0; {43830#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:38:22,673 INFO L290 TraceCheckUtils]: 16: Hoare triple {43830#(= |old(#valid)| |#valid|)} assume 1 == #valid[~input#1.base]; {43830#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:38:22,673 INFO L290 TraceCheckUtils]: 17: Hoare triple {43830#(= |old(#valid)| |#valid|)} assume ~input#1.offset < #length[~input#1.base] && ~input#1.offset >= 0; {43830#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:38:22,674 INFO L290 TraceCheckUtils]: 18: Hoare triple {43830#(= |old(#valid)| |#valid|)} assume !(0 == #t~nondet4#1);havoc #t~mem3#1.base, #t~mem3#1.offset;havoc #t~nondet4#1; {43830#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:38:22,674 INFO L290 TraceCheckUtils]: 19: Hoare triple {43830#(= |old(#valid)| |#valid|)} #t~post2#1 := ~i~0#1;~i~0#1 := 1 + #t~post2#1;havoc #t~post2#1; {43830#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:38:22,674 INFO L290 TraceCheckUtils]: 20: Hoare triple {43830#(= |old(#valid)| |#valid|)} assume !(~i~0#1 < 2); {43830#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:38:22,675 INFO L290 TraceCheckUtils]: 21: Hoare triple {43830#(= |old(#valid)| |#valid|)} assume true; {43830#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:38:22,675 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {43830#(= |old(#valid)| |#valid|)} {43786#(= 1 (select |#valid| 5))} #101#return; {43786#(= 1 (select |#valid| 5))} is VALID [2022-02-20 23:38:22,676 INFO L272 TraceCheckUtils]: 23: Hoare triple {43786#(= 1 (select |#valid| 5))} call parse_input(4, 0); {43829#(and (= ~global~0.base |old(~global~0.base)|) (= |old(#length)| |#length|) (= |old(~global~0.offset)| ~global~0.offset) (= ~state~0 |old(~state~0)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 23:38:22,676 INFO L290 TraceCheckUtils]: 24: Hoare triple {43829#(and (= ~global~0.base |old(~global~0.base)|) (= |old(#length)| |#length|) (= |old(~global~0.offset)| ~global~0.offset) (= ~state~0 |old(~state~0)|) (= |old(#valid)| |#valid|))} ~input#1.base, ~input#1.offset := #in~input#1.base, #in~input#1.offset;~i~0#1 := 0; {43830#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:38:22,677 INFO L290 TraceCheckUtils]: 25: Hoare triple {43830#(= |old(#valid)| |#valid|)} assume !!(~i~0#1 < 2); {43830#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:38:22,677 INFO L290 TraceCheckUtils]: 26: Hoare triple {43830#(= |old(#valid)| |#valid|)} SUMMARY for call #t~mem3#1.base, #t~mem3#1.offset := read~$Pointer$(~#commands~0.base, ~#commands~0.offset + 9 * ~i~0#1, 4); srcloc: L693 {43830#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:38:22,677 INFO L290 TraceCheckUtils]: 27: Hoare triple {43830#(= |old(#valid)| |#valid|)} assume 1 == #valid[#t~mem3#1.base]; {43830#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:38:22,678 INFO L290 TraceCheckUtils]: 28: Hoare triple {43830#(= |old(#valid)| |#valid|)} assume #t~mem3#1.offset < #length[#t~mem3#1.base] && #t~mem3#1.offset >= 0; {43830#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:38:22,678 INFO L290 TraceCheckUtils]: 29: Hoare triple {43830#(= |old(#valid)| |#valid|)} assume 1 == #valid[~input#1.base]; {43830#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:38:22,678 INFO L290 TraceCheckUtils]: 30: Hoare triple {43830#(= |old(#valid)| |#valid|)} assume ~input#1.offset < #length[~input#1.base] && ~input#1.offset >= 0; {43830#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:38:22,679 INFO L290 TraceCheckUtils]: 31: Hoare triple {43830#(= |old(#valid)| |#valid|)} assume !(0 == #t~nondet4#1);havoc #t~mem3#1.base, #t~mem3#1.offset;havoc #t~nondet4#1; {43830#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:38:22,679 INFO L290 TraceCheckUtils]: 32: Hoare triple {43830#(= |old(#valid)| |#valid|)} #t~post2#1 := ~i~0#1;~i~0#1 := 1 + #t~post2#1;havoc #t~post2#1; {43830#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:38:22,679 INFO L290 TraceCheckUtils]: 33: Hoare triple {43830#(= |old(#valid)| |#valid|)} assume !!(~i~0#1 < 2); {43830#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:38:22,680 INFO L290 TraceCheckUtils]: 34: Hoare triple {43830#(= |old(#valid)| |#valid|)} SUMMARY for call #t~mem3#1.base, #t~mem3#1.offset := read~$Pointer$(~#commands~0.base, ~#commands~0.offset + 9 * ~i~0#1, 4); srcloc: L693 {43830#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:38:22,680 INFO L290 TraceCheckUtils]: 35: Hoare triple {43830#(= |old(#valid)| |#valid|)} assume 1 == #valid[#t~mem3#1.base]; {43830#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:38:22,680 INFO L290 TraceCheckUtils]: 36: Hoare triple {43830#(= |old(#valid)| |#valid|)} assume #t~mem3#1.offset < #length[#t~mem3#1.base] && #t~mem3#1.offset >= 0; {43830#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:38:22,681 INFO L290 TraceCheckUtils]: 37: Hoare triple {43830#(= |old(#valid)| |#valid|)} assume 1 == #valid[~input#1.base]; {43830#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:38:22,681 INFO L290 TraceCheckUtils]: 38: Hoare triple {43830#(= |old(#valid)| |#valid|)} assume ~input#1.offset < #length[~input#1.base] && ~input#1.offset >= 0; {43830#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:38:22,681 INFO L290 TraceCheckUtils]: 39: Hoare triple {43830#(= |old(#valid)| |#valid|)} assume !(0 == #t~nondet4#1);havoc #t~mem3#1.base, #t~mem3#1.offset;havoc #t~nondet4#1; {43830#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:38:22,682 INFO L290 TraceCheckUtils]: 40: Hoare triple {43830#(= |old(#valid)| |#valid|)} #t~post2#1 := ~i~0#1;~i~0#1 := 1 + #t~post2#1;havoc #t~post2#1; {43830#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:38:22,682 INFO L290 TraceCheckUtils]: 41: Hoare triple {43830#(= |old(#valid)| |#valid|)} assume !(~i~0#1 < 2); {43830#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:38:22,682 INFO L290 TraceCheckUtils]: 42: Hoare triple {43830#(= |old(#valid)| |#valid|)} assume true; {43830#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:38:22,683 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {43830#(= |old(#valid)| |#valid|)} {43786#(= 1 (select |#valid| 5))} #103#return; {43786#(= 1 (select |#valid| 5))} is VALID [2022-02-20 23:38:22,684 INFO L272 TraceCheckUtils]: 44: Hoare triple {43786#(= 1 (select |#valid| 5))} call parse_input(5, 0); {43827#(and (= 1 (select |#valid| 5)) (= |parse_input_#in~input#1.base| 5))} is VALID [2022-02-20 23:38:22,684 INFO L290 TraceCheckUtils]: 45: Hoare triple {43827#(and (= 1 (select |#valid| 5)) (= |parse_input_#in~input#1.base| 5))} ~input#1.base, ~input#1.offset := #in~input#1.base, #in~input#1.offset;~i~0#1 := 0; {43828#(and (= (select |#valid| |parse_input_~input#1.base|) 1) (= 5 |parse_input_~input#1.base|))} is VALID [2022-02-20 23:38:22,684 INFO L290 TraceCheckUtils]: 46: Hoare triple {43828#(and (= (select |#valid| |parse_input_~input#1.base|) 1) (= 5 |parse_input_~input#1.base|))} assume !!(~i~0#1 < 2); {43828#(and (= (select |#valid| |parse_input_~input#1.base|) 1) (= 5 |parse_input_~input#1.base|))} is VALID [2022-02-20 23:38:22,685 INFO L290 TraceCheckUtils]: 47: Hoare triple {43828#(and (= (select |#valid| |parse_input_~input#1.base|) 1) (= 5 |parse_input_~input#1.base|))} SUMMARY for call #t~mem3#1.base, #t~mem3#1.offset := read~$Pointer$(~#commands~0.base, ~#commands~0.offset + 9 * ~i~0#1, 4); srcloc: L693 {43828#(and (= (select |#valid| |parse_input_~input#1.base|) 1) (= 5 |parse_input_~input#1.base|))} is VALID [2022-02-20 23:38:22,685 INFO L290 TraceCheckUtils]: 48: Hoare triple {43828#(and (= (select |#valid| |parse_input_~input#1.base|) 1) (= 5 |parse_input_~input#1.base|))} assume 1 == #valid[#t~mem3#1.base]; {43828#(and (= (select |#valid| |parse_input_~input#1.base|) 1) (= 5 |parse_input_~input#1.base|))} is VALID [2022-02-20 23:38:22,685 INFO L290 TraceCheckUtils]: 49: Hoare triple {43828#(and (= (select |#valid| |parse_input_~input#1.base|) 1) (= 5 |parse_input_~input#1.base|))} assume #t~mem3#1.offset < #length[#t~mem3#1.base] && #t~mem3#1.offset >= 0; {43828#(and (= (select |#valid| |parse_input_~input#1.base|) 1) (= 5 |parse_input_~input#1.base|))} is VALID [2022-02-20 23:38:22,686 INFO L290 TraceCheckUtils]: 50: Hoare triple {43828#(and (= (select |#valid| |parse_input_~input#1.base|) 1) (= 5 |parse_input_~input#1.base|))} assume !(1 == #valid[~input#1.base]); {43785#false} is VALID [2022-02-20 23:38:22,686 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-02-20 23:38:22,686 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:38:22,686 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048998737] [2022-02-20 23:38:22,686 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2048998737] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 23:38:22,687 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1696000168] [2022-02-20 23:38:22,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:38:22,687 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:38:22,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:38:22,692 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 23:38:22,697 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-02-20 23:38:22,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:38:22,761 INFO L263 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 13 conjunts are in the unsatisfiable core [2022-02-20 23:38:22,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:38:22,771 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:38:22,909 INFO L290 TraceCheckUtils]: 0: Hoare triple {43784#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(3, 1);call write~init~int(99, 1, 0, 1);call write~init~int(49, 1, 1, 1);call write~init~int(0, 1, 2, 1);call #Ultimate.allocInit(3, 2);call write~init~int(99, 2, 0, 1);call write~init~int(50, 2, 1, 1);call write~init~int(0, 2, 2, 1);call #Ultimate.allocInit(3, 3);call write~init~int(99, 3, 0, 1);call write~init~int(49, 3, 1, 1);call write~init~int(0, 3, 2, 1);call #Ultimate.allocInit(3, 4);call write~init~int(99, 4, 0, 1);call write~init~int(49, 4, 1, 1);call write~init~int(0, 4, 2, 1);call #Ultimate.allocInit(3, 5);call write~init~int(99, 5, 0, 1);call write~init~int(50, 5, 1, 1);call write~init~int(0, 5, 2, 1);~state~0 := ~unnamed3~0~STATE_1;~global~0.base, ~global~0.offset := 0, 0;~#commands~0.base, ~#commands~0.offset := 6, 0;call #Ultimate.allocInit(18, 6);call write~init~$Pointer$(1, 0, ~#commands~0.base, ~#commands~0.offset, 4);call write~init~$Pointer$(#funAddr~c1.base, #funAddr~c1.offset, ~#commands~0.base, 4 + ~#commands~0.offset, 4);call write~init~int((if ~unnamed3~0~STATE_1 % 256 <= 127 then ~unnamed3~0~STATE_1 % 256 else ~unnamed3~0~STATE_1 % 256 - 256), ~#commands~0.base, 8 + ~#commands~0.offset, 1);call write~init~$Pointer$(2, 0, ~#commands~0.base, 9 + ~#commands~0.offset, 4);call write~init~$Pointer$(#funAddr~c2.base, #funAddr~c2.offset, ~#commands~0.base, 13 + ~#commands~0.offset, 4);call write~init~int((if ~unnamed3~0~STATE_2 % 256 <= 127 then ~unnamed3~0~STATE_2 % 256 else ~unnamed3~0~STATE_2 % 256 - 256), ~#commands~0.base, 17 + ~#commands~0.offset, 1); {43786#(= 1 (select |#valid| 5))} is VALID [2022-02-20 23:38:22,909 INFO L290 TraceCheckUtils]: 1: Hoare triple {43786#(= 1 (select |#valid| 5))} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1; {43786#(= 1 (select |#valid| 5))} is VALID [2022-02-20 23:38:22,910 INFO L272 TraceCheckUtils]: 2: Hoare triple {43786#(= 1 (select |#valid| 5))} call parse_input(3, 0); {43830#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:38:22,910 INFO L290 TraceCheckUtils]: 3: Hoare triple {43830#(= |old(#valid)| |#valid|)} ~input#1.base, ~input#1.offset := #in~input#1.base, #in~input#1.offset;~i~0#1 := 0; {43830#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:38:22,910 INFO L290 TraceCheckUtils]: 4: Hoare triple {43830#(= |old(#valid)| |#valid|)} assume !!(~i~0#1 < 2); {43830#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:38:22,911 INFO L290 TraceCheckUtils]: 5: Hoare triple {43830#(= |old(#valid)| |#valid|)} SUMMARY for call #t~mem3#1.base, #t~mem3#1.offset := read~$Pointer$(~#commands~0.base, ~#commands~0.offset + 9 * ~i~0#1, 4); srcloc: L693 {43830#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:38:22,911 INFO L290 TraceCheckUtils]: 6: Hoare triple {43830#(= |old(#valid)| |#valid|)} assume 1 == #valid[#t~mem3#1.base]; {43830#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:38:22,911 INFO L290 TraceCheckUtils]: 7: Hoare triple {43830#(= |old(#valid)| |#valid|)} assume #t~mem3#1.offset < #length[#t~mem3#1.base] && #t~mem3#1.offset >= 0; {43830#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:38:22,912 INFO L290 TraceCheckUtils]: 8: Hoare triple {43830#(= |old(#valid)| |#valid|)} assume 1 == #valid[~input#1.base]; {43830#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:38:22,912 INFO L290 TraceCheckUtils]: 9: Hoare triple {43830#(= |old(#valid)| |#valid|)} assume ~input#1.offset < #length[~input#1.base] && ~input#1.offset >= 0; {43830#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:38:22,912 INFO L290 TraceCheckUtils]: 10: Hoare triple {43830#(= |old(#valid)| |#valid|)} assume !(0 == #t~nondet4#1);havoc #t~mem3#1.base, #t~mem3#1.offset;havoc #t~nondet4#1; {43830#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:38:22,912 INFO L290 TraceCheckUtils]: 11: Hoare triple {43830#(= |old(#valid)| |#valid|)} #t~post2#1 := ~i~0#1;~i~0#1 := 1 + #t~post2#1;havoc #t~post2#1; {43830#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:38:22,913 INFO L290 TraceCheckUtils]: 12: Hoare triple {43830#(= |old(#valid)| |#valid|)} assume !!(~i~0#1 < 2); {43830#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:38:22,913 INFO L290 TraceCheckUtils]: 13: Hoare triple {43830#(= |old(#valid)| |#valid|)} SUMMARY for call #t~mem3#1.base, #t~mem3#1.offset := read~$Pointer$(~#commands~0.base, ~#commands~0.offset + 9 * ~i~0#1, 4); srcloc: L693 {43830#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:38:22,913 INFO L290 TraceCheckUtils]: 14: Hoare triple {43830#(= |old(#valid)| |#valid|)} assume 1 == #valid[#t~mem3#1.base]; {43830#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:38:22,914 INFO L290 TraceCheckUtils]: 15: Hoare triple {43830#(= |old(#valid)| |#valid|)} assume #t~mem3#1.offset < #length[#t~mem3#1.base] && #t~mem3#1.offset >= 0; {43830#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:38:22,914 INFO L290 TraceCheckUtils]: 16: Hoare triple {43830#(= |old(#valid)| |#valid|)} assume 1 == #valid[~input#1.base]; {43830#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:38:22,914 INFO L290 TraceCheckUtils]: 17: Hoare triple {43830#(= |old(#valid)| |#valid|)} assume ~input#1.offset < #length[~input#1.base] && ~input#1.offset >= 0; {43830#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:38:22,915 INFO L290 TraceCheckUtils]: 18: Hoare triple {43830#(= |old(#valid)| |#valid|)} assume !(0 == #t~nondet4#1);havoc #t~mem3#1.base, #t~mem3#1.offset;havoc #t~nondet4#1; {43830#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:38:22,915 INFO L290 TraceCheckUtils]: 19: Hoare triple {43830#(= |old(#valid)| |#valid|)} #t~post2#1 := ~i~0#1;~i~0#1 := 1 + #t~post2#1;havoc #t~post2#1; {43830#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:38:22,915 INFO L290 TraceCheckUtils]: 20: Hoare triple {43830#(= |old(#valid)| |#valid|)} assume !(~i~0#1 < 2); {43830#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:38:22,916 INFO L290 TraceCheckUtils]: 21: Hoare triple {43830#(= |old(#valid)| |#valid|)} assume true; {43830#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:38:22,916 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {43830#(= |old(#valid)| |#valid|)} {43786#(= 1 (select |#valid| 5))} #101#return; {43786#(= 1 (select |#valid| 5))} is VALID [2022-02-20 23:38:22,917 INFO L272 TraceCheckUtils]: 23: Hoare triple {43786#(= 1 (select |#valid| 5))} call parse_input(4, 0); {43830#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:38:22,917 INFO L290 TraceCheckUtils]: 24: Hoare triple {43830#(= |old(#valid)| |#valid|)} ~input#1.base, ~input#1.offset := #in~input#1.base, #in~input#1.offset;~i~0#1 := 0; {43830#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:38:22,917 INFO L290 TraceCheckUtils]: 25: Hoare triple {43830#(= |old(#valid)| |#valid|)} assume !!(~i~0#1 < 2); {43830#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:38:22,918 INFO L290 TraceCheckUtils]: 26: Hoare triple {43830#(= |old(#valid)| |#valid|)} SUMMARY for call #t~mem3#1.base, #t~mem3#1.offset := read~$Pointer$(~#commands~0.base, ~#commands~0.offset + 9 * ~i~0#1, 4); srcloc: L693 {43830#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:38:22,918 INFO L290 TraceCheckUtils]: 27: Hoare triple {43830#(= |old(#valid)| |#valid|)} assume 1 == #valid[#t~mem3#1.base]; {43830#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:38:22,918 INFO L290 TraceCheckUtils]: 28: Hoare triple {43830#(= |old(#valid)| |#valid|)} assume #t~mem3#1.offset < #length[#t~mem3#1.base] && #t~mem3#1.offset >= 0; {43830#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:38:22,918 INFO L290 TraceCheckUtils]: 29: Hoare triple {43830#(= |old(#valid)| |#valid|)} assume 1 == #valid[~input#1.base]; {43830#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:38:22,921 INFO L290 TraceCheckUtils]: 30: Hoare triple {43830#(= |old(#valid)| |#valid|)} assume ~input#1.offset < #length[~input#1.base] && ~input#1.offset >= 0; {43830#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:38:22,922 INFO L290 TraceCheckUtils]: 31: Hoare triple {43830#(= |old(#valid)| |#valid|)} assume !(0 == #t~nondet4#1);havoc #t~mem3#1.base, #t~mem3#1.offset;havoc #t~nondet4#1; {43830#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:38:22,922 INFO L290 TraceCheckUtils]: 32: Hoare triple {43830#(= |old(#valid)| |#valid|)} #t~post2#1 := ~i~0#1;~i~0#1 := 1 + #t~post2#1;havoc #t~post2#1; {43830#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:38:22,922 INFO L290 TraceCheckUtils]: 33: Hoare triple {43830#(= |old(#valid)| |#valid|)} assume !!(~i~0#1 < 2); {43830#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:38:22,923 INFO L290 TraceCheckUtils]: 34: Hoare triple {43830#(= |old(#valid)| |#valid|)} SUMMARY for call #t~mem3#1.base, #t~mem3#1.offset := read~$Pointer$(~#commands~0.base, ~#commands~0.offset + 9 * ~i~0#1, 4); srcloc: L693 {43830#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:38:22,923 INFO L290 TraceCheckUtils]: 35: Hoare triple {43830#(= |old(#valid)| |#valid|)} assume 1 == #valid[#t~mem3#1.base]; {43830#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:38:22,923 INFO L290 TraceCheckUtils]: 36: Hoare triple {43830#(= |old(#valid)| |#valid|)} assume #t~mem3#1.offset < #length[#t~mem3#1.base] && #t~mem3#1.offset >= 0; {43830#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:38:22,924 INFO L290 TraceCheckUtils]: 37: Hoare triple {43830#(= |old(#valid)| |#valid|)} assume 1 == #valid[~input#1.base]; {43830#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:38:22,924 INFO L290 TraceCheckUtils]: 38: Hoare triple {43830#(= |old(#valid)| |#valid|)} assume ~input#1.offset < #length[~input#1.base] && ~input#1.offset >= 0; {43830#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:38:22,924 INFO L290 TraceCheckUtils]: 39: Hoare triple {43830#(= |old(#valid)| |#valid|)} assume !(0 == #t~nondet4#1);havoc #t~mem3#1.base, #t~mem3#1.offset;havoc #t~nondet4#1; {43830#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:38:22,925 INFO L290 TraceCheckUtils]: 40: Hoare triple {43830#(= |old(#valid)| |#valid|)} #t~post2#1 := ~i~0#1;~i~0#1 := 1 + #t~post2#1;havoc #t~post2#1; {43830#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:38:22,925 INFO L290 TraceCheckUtils]: 41: Hoare triple {43830#(= |old(#valid)| |#valid|)} assume !(~i~0#1 < 2); {43830#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:38:22,925 INFO L290 TraceCheckUtils]: 42: Hoare triple {43830#(= |old(#valid)| |#valid|)} assume true; {43830#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:38:22,926 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {43830#(= |old(#valid)| |#valid|)} {43786#(= 1 (select |#valid| 5))} #103#return; {43786#(= 1 (select |#valid| 5))} is VALID [2022-02-20 23:38:22,926 INFO L272 TraceCheckUtils]: 44: Hoare triple {43786#(= 1 (select |#valid| 5))} call parse_input(5, 0); {43827#(and (= 1 (select |#valid| 5)) (= |parse_input_#in~input#1.base| 5))} is VALID [2022-02-20 23:38:22,927 INFO L290 TraceCheckUtils]: 45: Hoare triple {43827#(and (= 1 (select |#valid| 5)) (= |parse_input_#in~input#1.base| 5))} ~input#1.base, ~input#1.offset := #in~input#1.base, #in~input#1.offset;~i~0#1 := 0; {43828#(and (= (select |#valid| |parse_input_~input#1.base|) 1) (= 5 |parse_input_~input#1.base|))} is VALID [2022-02-20 23:38:22,927 INFO L290 TraceCheckUtils]: 46: Hoare triple {43828#(and (= (select |#valid| |parse_input_~input#1.base|) 1) (= 5 |parse_input_~input#1.base|))} assume !!(~i~0#1 < 2); {43828#(and (= (select |#valid| |parse_input_~input#1.base|) 1) (= 5 |parse_input_~input#1.base|))} is VALID [2022-02-20 23:38:22,927 INFO L290 TraceCheckUtils]: 47: Hoare triple {43828#(and (= (select |#valid| |parse_input_~input#1.base|) 1) (= 5 |parse_input_~input#1.base|))} SUMMARY for call #t~mem3#1.base, #t~mem3#1.offset := read~$Pointer$(~#commands~0.base, ~#commands~0.offset + 9 * ~i~0#1, 4); srcloc: L693 {43828#(and (= (select |#valid| |parse_input_~input#1.base|) 1) (= 5 |parse_input_~input#1.base|))} is VALID [2022-02-20 23:38:22,928 INFO L290 TraceCheckUtils]: 48: Hoare triple {43828#(and (= (select |#valid| |parse_input_~input#1.base|) 1) (= 5 |parse_input_~input#1.base|))} assume 1 == #valid[#t~mem3#1.base]; {43828#(and (= (select |#valid| |parse_input_~input#1.base|) 1) (= 5 |parse_input_~input#1.base|))} is VALID [2022-02-20 23:38:22,928 INFO L290 TraceCheckUtils]: 49: Hoare triple {43828#(and (= (select |#valid| |parse_input_~input#1.base|) 1) (= 5 |parse_input_~input#1.base|))} assume #t~mem3#1.offset < #length[#t~mem3#1.base] && #t~mem3#1.offset >= 0; {43828#(and (= (select |#valid| |parse_input_~input#1.base|) 1) (= 5 |parse_input_~input#1.base|))} is VALID [2022-02-20 23:38:22,928 INFO L290 TraceCheckUtils]: 50: Hoare triple {43828#(and (= (select |#valid| |parse_input_~input#1.base|) 1) (= 5 |parse_input_~input#1.base|))} assume !(1 == #valid[~input#1.base]); {43785#false} is VALID [2022-02-20 23:38:22,929 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-02-20 23:38:22,929 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:38:23,219 INFO L290 TraceCheckUtils]: 50: Hoare triple {43984#(= (select |#valid| |parse_input_~input#1.base|) 1)} assume !(1 == #valid[~input#1.base]); {43785#false} is VALID [2022-02-20 23:38:23,220 INFO L290 TraceCheckUtils]: 49: Hoare triple {43984#(= (select |#valid| |parse_input_~input#1.base|) 1)} assume #t~mem3#1.offset < #length[#t~mem3#1.base] && #t~mem3#1.offset >= 0; {43984#(= (select |#valid| |parse_input_~input#1.base|) 1)} is VALID [2022-02-20 23:38:23,220 INFO L290 TraceCheckUtils]: 48: Hoare triple {43984#(= (select |#valid| |parse_input_~input#1.base|) 1)} assume 1 == #valid[#t~mem3#1.base]; {43984#(= (select |#valid| |parse_input_~input#1.base|) 1)} is VALID [2022-02-20 23:38:23,220 INFO L290 TraceCheckUtils]: 47: Hoare triple {43984#(= (select |#valid| |parse_input_~input#1.base|) 1)} SUMMARY for call #t~mem3#1.base, #t~mem3#1.offset := read~$Pointer$(~#commands~0.base, ~#commands~0.offset + 9 * ~i~0#1, 4); srcloc: L693 {43984#(= (select |#valid| |parse_input_~input#1.base|) 1)} is VALID [2022-02-20 23:38:23,221 INFO L290 TraceCheckUtils]: 46: Hoare triple {43984#(= (select |#valid| |parse_input_~input#1.base|) 1)} assume !!(~i~0#1 < 2); {43984#(= (select |#valid| |parse_input_~input#1.base|) 1)} is VALID [2022-02-20 23:38:23,221 INFO L290 TraceCheckUtils]: 45: Hoare triple {44000#(= (select |#valid| |parse_input_#in~input#1.base|) 1)} ~input#1.base, ~input#1.offset := #in~input#1.base, #in~input#1.offset;~i~0#1 := 0; {43984#(= (select |#valid| |parse_input_~input#1.base|) 1)} is VALID [2022-02-20 23:38:23,221 INFO L272 TraceCheckUtils]: 44: Hoare triple {43786#(= 1 (select |#valid| 5))} call parse_input(5, 0); {44000#(= (select |#valid| |parse_input_#in~input#1.base|) 1)} is VALID [2022-02-20 23:38:23,222 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {44010#(or (= 1 (select |#valid| 5)) (not (= (select |old(#valid)| 5) 1)))} {43786#(= 1 (select |#valid| 5))} #103#return; {43786#(= 1 (select |#valid| 5))} is VALID [2022-02-20 23:38:23,222 INFO L290 TraceCheckUtils]: 42: Hoare triple {44010#(or (= 1 (select |#valid| 5)) (not (= (select |old(#valid)| 5) 1)))} assume true; {44010#(or (= 1 (select |#valid| 5)) (not (= (select |old(#valid)| 5) 1)))} is VALID [2022-02-20 23:38:23,223 INFO L290 TraceCheckUtils]: 41: Hoare triple {44010#(or (= 1 (select |#valid| 5)) (not (= (select |old(#valid)| 5) 1)))} assume !(~i~0#1 < 2); {44010#(or (= 1 (select |#valid| 5)) (not (= (select |old(#valid)| 5) 1)))} is VALID [2022-02-20 23:38:23,223 INFO L290 TraceCheckUtils]: 40: Hoare triple {44010#(or (= 1 (select |#valid| 5)) (not (= (select |old(#valid)| 5) 1)))} #t~post2#1 := ~i~0#1;~i~0#1 := 1 + #t~post2#1;havoc #t~post2#1; {44010#(or (= 1 (select |#valid| 5)) (not (= (select |old(#valid)| 5) 1)))} is VALID [2022-02-20 23:38:23,223 INFO L290 TraceCheckUtils]: 39: Hoare triple {44010#(or (= 1 (select |#valid| 5)) (not (= (select |old(#valid)| 5) 1)))} assume !(0 == #t~nondet4#1);havoc #t~mem3#1.base, #t~mem3#1.offset;havoc #t~nondet4#1; {44010#(or (= 1 (select |#valid| 5)) (not (= (select |old(#valid)| 5) 1)))} is VALID [2022-02-20 23:38:23,224 INFO L290 TraceCheckUtils]: 38: Hoare triple {44010#(or (= 1 (select |#valid| 5)) (not (= (select |old(#valid)| 5) 1)))} assume ~input#1.offset < #length[~input#1.base] && ~input#1.offset >= 0; {44010#(or (= 1 (select |#valid| 5)) (not (= (select |old(#valid)| 5) 1)))} is VALID [2022-02-20 23:38:23,224 INFO L290 TraceCheckUtils]: 37: Hoare triple {44010#(or (= 1 (select |#valid| 5)) (not (= (select |old(#valid)| 5) 1)))} assume 1 == #valid[~input#1.base]; {44010#(or (= 1 (select |#valid| 5)) (not (= (select |old(#valid)| 5) 1)))} is VALID [2022-02-20 23:38:23,224 INFO L290 TraceCheckUtils]: 36: Hoare triple {44010#(or (= 1 (select |#valid| 5)) (not (= (select |old(#valid)| 5) 1)))} assume #t~mem3#1.offset < #length[#t~mem3#1.base] && #t~mem3#1.offset >= 0; {44010#(or (= 1 (select |#valid| 5)) (not (= (select |old(#valid)| 5) 1)))} is VALID [2022-02-20 23:38:23,225 INFO L290 TraceCheckUtils]: 35: Hoare triple {44010#(or (= 1 (select |#valid| 5)) (not (= (select |old(#valid)| 5) 1)))} assume 1 == #valid[#t~mem3#1.base]; {44010#(or (= 1 (select |#valid| 5)) (not (= (select |old(#valid)| 5) 1)))} is VALID [2022-02-20 23:38:23,225 INFO L290 TraceCheckUtils]: 34: Hoare triple {44010#(or (= 1 (select |#valid| 5)) (not (= (select |old(#valid)| 5) 1)))} SUMMARY for call #t~mem3#1.base, #t~mem3#1.offset := read~$Pointer$(~#commands~0.base, ~#commands~0.offset + 9 * ~i~0#1, 4); srcloc: L693 {44010#(or (= 1 (select |#valid| 5)) (not (= (select |old(#valid)| 5) 1)))} is VALID [2022-02-20 23:38:23,227 INFO L290 TraceCheckUtils]: 33: Hoare triple {44010#(or (= 1 (select |#valid| 5)) (not (= (select |old(#valid)| 5) 1)))} assume !!(~i~0#1 < 2); {44010#(or (= 1 (select |#valid| 5)) (not (= (select |old(#valid)| 5) 1)))} is VALID [2022-02-20 23:38:23,228 INFO L290 TraceCheckUtils]: 32: Hoare triple {44010#(or (= 1 (select |#valid| 5)) (not (= (select |old(#valid)| 5) 1)))} #t~post2#1 := ~i~0#1;~i~0#1 := 1 + #t~post2#1;havoc #t~post2#1; {44010#(or (= 1 (select |#valid| 5)) (not (= (select |old(#valid)| 5) 1)))} is VALID [2022-02-20 23:38:23,228 INFO L290 TraceCheckUtils]: 31: Hoare triple {44010#(or (= 1 (select |#valid| 5)) (not (= (select |old(#valid)| 5) 1)))} assume !(0 == #t~nondet4#1);havoc #t~mem3#1.base, #t~mem3#1.offset;havoc #t~nondet4#1; {44010#(or (= 1 (select |#valid| 5)) (not (= (select |old(#valid)| 5) 1)))} is VALID [2022-02-20 23:38:23,228 INFO L290 TraceCheckUtils]: 30: Hoare triple {44010#(or (= 1 (select |#valid| 5)) (not (= (select |old(#valid)| 5) 1)))} assume ~input#1.offset < #length[~input#1.base] && ~input#1.offset >= 0; {44010#(or (= 1 (select |#valid| 5)) (not (= (select |old(#valid)| 5) 1)))} is VALID [2022-02-20 23:38:23,229 INFO L290 TraceCheckUtils]: 29: Hoare triple {44010#(or (= 1 (select |#valid| 5)) (not (= (select |old(#valid)| 5) 1)))} assume 1 == #valid[~input#1.base]; {44010#(or (= 1 (select |#valid| 5)) (not (= (select |old(#valid)| 5) 1)))} is VALID [2022-02-20 23:38:23,229 INFO L290 TraceCheckUtils]: 28: Hoare triple {44010#(or (= 1 (select |#valid| 5)) (not (= (select |old(#valid)| 5) 1)))} assume #t~mem3#1.offset < #length[#t~mem3#1.base] && #t~mem3#1.offset >= 0; {44010#(or (= 1 (select |#valid| 5)) (not (= (select |old(#valid)| 5) 1)))} is VALID [2022-02-20 23:38:23,229 INFO L290 TraceCheckUtils]: 27: Hoare triple {44010#(or (= 1 (select |#valid| 5)) (not (= (select |old(#valid)| 5) 1)))} assume 1 == #valid[#t~mem3#1.base]; {44010#(or (= 1 (select |#valid| 5)) (not (= (select |old(#valid)| 5) 1)))} is VALID [2022-02-20 23:38:23,230 INFO L290 TraceCheckUtils]: 26: Hoare triple {44010#(or (= 1 (select |#valid| 5)) (not (= (select |old(#valid)| 5) 1)))} SUMMARY for call #t~mem3#1.base, #t~mem3#1.offset := read~$Pointer$(~#commands~0.base, ~#commands~0.offset + 9 * ~i~0#1, 4); srcloc: L693 {44010#(or (= 1 (select |#valid| 5)) (not (= (select |old(#valid)| 5) 1)))} is VALID [2022-02-20 23:38:23,230 INFO L290 TraceCheckUtils]: 25: Hoare triple {44010#(or (= 1 (select |#valid| 5)) (not (= (select |old(#valid)| 5) 1)))} assume !!(~i~0#1 < 2); {44010#(or (= 1 (select |#valid| 5)) (not (= (select |old(#valid)| 5) 1)))} is VALID [2022-02-20 23:38:23,233 INFO L290 TraceCheckUtils]: 24: Hoare triple {44010#(or (= 1 (select |#valid| 5)) (not (= (select |old(#valid)| 5) 1)))} ~input#1.base, ~input#1.offset := #in~input#1.base, #in~input#1.offset;~i~0#1 := 0; {44010#(or (= 1 (select |#valid| 5)) (not (= (select |old(#valid)| 5) 1)))} is VALID [2022-02-20 23:38:23,235 INFO L272 TraceCheckUtils]: 23: Hoare triple {43786#(= 1 (select |#valid| 5))} call parse_input(4, 0); {44010#(or (= 1 (select |#valid| 5)) (not (= (select |old(#valid)| 5) 1)))} is VALID [2022-02-20 23:38:23,236 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {44010#(or (= 1 (select |#valid| 5)) (not (= (select |old(#valid)| 5) 1)))} {43786#(= 1 (select |#valid| 5))} #101#return; {43786#(= 1 (select |#valid| 5))} is VALID [2022-02-20 23:38:23,236 INFO L290 TraceCheckUtils]: 21: Hoare triple {44010#(or (= 1 (select |#valid| 5)) (not (= (select |old(#valid)| 5) 1)))} assume true; {44010#(or (= 1 (select |#valid| 5)) (not (= (select |old(#valid)| 5) 1)))} is VALID [2022-02-20 23:38:23,237 INFO L290 TraceCheckUtils]: 20: Hoare triple {44010#(or (= 1 (select |#valid| 5)) (not (= (select |old(#valid)| 5) 1)))} assume !(~i~0#1 < 2); {44010#(or (= 1 (select |#valid| 5)) (not (= (select |old(#valid)| 5) 1)))} is VALID [2022-02-20 23:38:23,237 INFO L290 TraceCheckUtils]: 19: Hoare triple {44010#(or (= 1 (select |#valid| 5)) (not (= (select |old(#valid)| 5) 1)))} #t~post2#1 := ~i~0#1;~i~0#1 := 1 + #t~post2#1;havoc #t~post2#1; {44010#(or (= 1 (select |#valid| 5)) (not (= (select |old(#valid)| 5) 1)))} is VALID [2022-02-20 23:38:23,237 INFO L290 TraceCheckUtils]: 18: Hoare triple {44010#(or (= 1 (select |#valid| 5)) (not (= (select |old(#valid)| 5) 1)))} assume !(0 == #t~nondet4#1);havoc #t~mem3#1.base, #t~mem3#1.offset;havoc #t~nondet4#1; {44010#(or (= 1 (select |#valid| 5)) (not (= (select |old(#valid)| 5) 1)))} is VALID [2022-02-20 23:38:23,238 INFO L290 TraceCheckUtils]: 17: Hoare triple {44010#(or (= 1 (select |#valid| 5)) (not (= (select |old(#valid)| 5) 1)))} assume ~input#1.offset < #length[~input#1.base] && ~input#1.offset >= 0; {44010#(or (= 1 (select |#valid| 5)) (not (= (select |old(#valid)| 5) 1)))} is VALID [2022-02-20 23:38:23,238 INFO L290 TraceCheckUtils]: 16: Hoare triple {44010#(or (= 1 (select |#valid| 5)) (not (= (select |old(#valid)| 5) 1)))} assume 1 == #valid[~input#1.base]; {44010#(or (= 1 (select |#valid| 5)) (not (= (select |old(#valid)| 5) 1)))} is VALID [2022-02-20 23:38:23,238 INFO L290 TraceCheckUtils]: 15: Hoare triple {44010#(or (= 1 (select |#valid| 5)) (not (= (select |old(#valid)| 5) 1)))} assume #t~mem3#1.offset < #length[#t~mem3#1.base] && #t~mem3#1.offset >= 0; {44010#(or (= 1 (select |#valid| 5)) (not (= (select |old(#valid)| 5) 1)))} is VALID [2022-02-20 23:38:23,238 INFO L290 TraceCheckUtils]: 14: Hoare triple {44010#(or (= 1 (select |#valid| 5)) (not (= (select |old(#valid)| 5) 1)))} assume 1 == #valid[#t~mem3#1.base]; {44010#(or (= 1 (select |#valid| 5)) (not (= (select |old(#valid)| 5) 1)))} is VALID [2022-02-20 23:38:23,239 INFO L290 TraceCheckUtils]: 13: Hoare triple {44010#(or (= 1 (select |#valid| 5)) (not (= (select |old(#valid)| 5) 1)))} SUMMARY for call #t~mem3#1.base, #t~mem3#1.offset := read~$Pointer$(~#commands~0.base, ~#commands~0.offset + 9 * ~i~0#1, 4); srcloc: L693 {44010#(or (= 1 (select |#valid| 5)) (not (= (select |old(#valid)| 5) 1)))} is VALID [2022-02-20 23:38:23,239 INFO L290 TraceCheckUtils]: 12: Hoare triple {44010#(or (= 1 (select |#valid| 5)) (not (= (select |old(#valid)| 5) 1)))} assume !!(~i~0#1 < 2); {44010#(or (= 1 (select |#valid| 5)) (not (= (select |old(#valid)| 5) 1)))} is VALID [2022-02-20 23:38:23,240 INFO L290 TraceCheckUtils]: 11: Hoare triple {44010#(or (= 1 (select |#valid| 5)) (not (= (select |old(#valid)| 5) 1)))} #t~post2#1 := ~i~0#1;~i~0#1 := 1 + #t~post2#1;havoc #t~post2#1; {44010#(or (= 1 (select |#valid| 5)) (not (= (select |old(#valid)| 5) 1)))} is VALID [2022-02-20 23:38:23,240 INFO L290 TraceCheckUtils]: 10: Hoare triple {44010#(or (= 1 (select |#valid| 5)) (not (= (select |old(#valid)| 5) 1)))} assume !(0 == #t~nondet4#1);havoc #t~mem3#1.base, #t~mem3#1.offset;havoc #t~nondet4#1; {44010#(or (= 1 (select |#valid| 5)) (not (= (select |old(#valid)| 5) 1)))} is VALID [2022-02-20 23:38:23,240 INFO L290 TraceCheckUtils]: 9: Hoare triple {44010#(or (= 1 (select |#valid| 5)) (not (= (select |old(#valid)| 5) 1)))} assume ~input#1.offset < #length[~input#1.base] && ~input#1.offset >= 0; {44010#(or (= 1 (select |#valid| 5)) (not (= (select |old(#valid)| 5) 1)))} is VALID [2022-02-20 23:38:23,240 INFO L290 TraceCheckUtils]: 8: Hoare triple {44010#(or (= 1 (select |#valid| 5)) (not (= (select |old(#valid)| 5) 1)))} assume 1 == #valid[~input#1.base]; {44010#(or (= 1 (select |#valid| 5)) (not (= (select |old(#valid)| 5) 1)))} is VALID [2022-02-20 23:38:23,241 INFO L290 TraceCheckUtils]: 7: Hoare triple {44010#(or (= 1 (select |#valid| 5)) (not (= (select |old(#valid)| 5) 1)))} assume #t~mem3#1.offset < #length[#t~mem3#1.base] && #t~mem3#1.offset >= 0; {44010#(or (= 1 (select |#valid| 5)) (not (= (select |old(#valid)| 5) 1)))} is VALID [2022-02-20 23:38:23,241 INFO L290 TraceCheckUtils]: 6: Hoare triple {44010#(or (= 1 (select |#valid| 5)) (not (= (select |old(#valid)| 5) 1)))} assume 1 == #valid[#t~mem3#1.base]; {44010#(or (= 1 (select |#valid| 5)) (not (= (select |old(#valid)| 5) 1)))} is VALID [2022-02-20 23:38:23,242 INFO L290 TraceCheckUtils]: 5: Hoare triple {44010#(or (= 1 (select |#valid| 5)) (not (= (select |old(#valid)| 5) 1)))} SUMMARY for call #t~mem3#1.base, #t~mem3#1.offset := read~$Pointer$(~#commands~0.base, ~#commands~0.offset + 9 * ~i~0#1, 4); srcloc: L693 {44010#(or (= 1 (select |#valid| 5)) (not (= (select |old(#valid)| 5) 1)))} is VALID [2022-02-20 23:38:23,242 INFO L290 TraceCheckUtils]: 4: Hoare triple {44010#(or (= 1 (select |#valid| 5)) (not (= (select |old(#valid)| 5) 1)))} assume !!(~i~0#1 < 2); {44010#(or (= 1 (select |#valid| 5)) (not (= (select |old(#valid)| 5) 1)))} is VALID [2022-02-20 23:38:23,242 INFO L290 TraceCheckUtils]: 3: Hoare triple {44010#(or (= 1 (select |#valid| 5)) (not (= (select |old(#valid)| 5) 1)))} ~input#1.base, ~input#1.offset := #in~input#1.base, #in~input#1.offset;~i~0#1 := 0; {44010#(or (= 1 (select |#valid| 5)) (not (= (select |old(#valid)| 5) 1)))} is VALID [2022-02-20 23:38:23,243 INFO L272 TraceCheckUtils]: 2: Hoare triple {43786#(= 1 (select |#valid| 5))} call parse_input(3, 0); {44010#(or (= 1 (select |#valid| 5)) (not (= (select |old(#valid)| 5) 1)))} is VALID [2022-02-20 23:38:23,243 INFO L290 TraceCheckUtils]: 1: Hoare triple {43786#(= 1 (select |#valid| 5))} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1; {43786#(= 1 (select |#valid| 5))} is VALID [2022-02-20 23:38:23,244 INFO L290 TraceCheckUtils]: 0: Hoare triple {43784#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(3, 1);call write~init~int(99, 1, 0, 1);call write~init~int(49, 1, 1, 1);call write~init~int(0, 1, 2, 1);call #Ultimate.allocInit(3, 2);call write~init~int(99, 2, 0, 1);call write~init~int(50, 2, 1, 1);call write~init~int(0, 2, 2, 1);call #Ultimate.allocInit(3, 3);call write~init~int(99, 3, 0, 1);call write~init~int(49, 3, 1, 1);call write~init~int(0, 3, 2, 1);call #Ultimate.allocInit(3, 4);call write~init~int(99, 4, 0, 1);call write~init~int(49, 4, 1, 1);call write~init~int(0, 4, 2, 1);call #Ultimate.allocInit(3, 5);call write~init~int(99, 5, 0, 1);call write~init~int(50, 5, 1, 1);call write~init~int(0, 5, 2, 1);~state~0 := ~unnamed3~0~STATE_1;~global~0.base, ~global~0.offset := 0, 0;~#commands~0.base, ~#commands~0.offset := 6, 0;call #Ultimate.allocInit(18, 6);call write~init~$Pointer$(1, 0, ~#commands~0.base, ~#commands~0.offset, 4);call write~init~$Pointer$(#funAddr~c1.base, #funAddr~c1.offset, ~#commands~0.base, 4 + ~#commands~0.offset, 4);call write~init~int((if ~unnamed3~0~STATE_1 % 256 <= 127 then ~unnamed3~0~STATE_1 % 256 else ~unnamed3~0~STATE_1 % 256 - 256), ~#commands~0.base, 8 + ~#commands~0.offset, 1);call write~init~$Pointer$(2, 0, ~#commands~0.base, 9 + ~#commands~0.offset, 4);call write~init~$Pointer$(#funAddr~c2.base, #funAddr~c2.offset, ~#commands~0.base, 13 + ~#commands~0.offset, 4);call write~init~int((if ~unnamed3~0~STATE_2 % 256 <= 127 then ~unnamed3~0~STATE_2 % 256 else ~unnamed3~0~STATE_2 % 256 - 256), ~#commands~0.base, 17 + ~#commands~0.offset, 1); {43786#(= 1 (select |#valid| 5))} is VALID [2022-02-20 23:38:23,244 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-02-20 23:38:23,244 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1696000168] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 23:38:23,244 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 23:38:23,244 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 8 [2022-02-20 23:38:23,244 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597608903] [2022-02-20 23:38:23,244 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 23:38:23,245 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.111111111111111) internal successors, (37), 6 states have internal predecessors, (37), 1 states have call successors, (8), 5 states have call predecessors, (8), 2 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 51 [2022-02-20 23:38:23,245 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:38:23,245 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 10 states, 9 states have (on average 4.111111111111111) internal successors, (37), 6 states have internal predecessors, (37), 1 states have call successors, (8), 5 states have call predecessors, (8), 2 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-02-20 23:38:23,274 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:38:23,274 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-20 23:38:23,274 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:38:23,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-20 23:38:23,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2022-02-20 23:38:23,275 INFO L87 Difference]: Start difference. First operand 365 states and 437 transitions. Second operand has 10 states, 9 states have (on average 4.111111111111111) internal successors, (37), 6 states have internal predecessors, (37), 1 states have call successors, (8), 5 states have call predecessors, (8), 2 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-02-20 23:38:23,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:38:23,814 INFO L93 Difference]: Finished difference Result 402 states and 463 transitions. [2022-02-20 23:38:23,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-20 23:38:23,814 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.111111111111111) internal successors, (37), 6 states have internal predecessors, (37), 1 states have call successors, (8), 5 states have call predecessors, (8), 2 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 51 [2022-02-20 23:38:23,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:38:23,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 4.111111111111111) internal successors, (37), 6 states have internal predecessors, (37), 1 states have call successors, (8), 5 states have call predecessors, (8), 2 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-02-20 23:38:23,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 159 transitions. [2022-02-20 23:38:23,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 4.111111111111111) internal successors, (37), 6 states have internal predecessors, (37), 1 states have call successors, (8), 5 states have call predecessors, (8), 2 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-02-20 23:38:23,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 159 transitions. [2022-02-20 23:38:23,817 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 159 transitions. [2022-02-20 23:38:23,926 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 159 edges. 159 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:38:23,932 INFO L225 Difference]: With dead ends: 402 [2022-02-20 23:38:23,932 INFO L226 Difference]: Without dead ends: 402 [2022-02-20 23:38:23,932 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 100 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=99, Invalid=207, Unknown=0, NotChecked=0, Total=306 [2022-02-20 23:38:23,932 INFO L933 BasicCegarLoop]: 54 mSDtfsCounter, 228 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 228 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 23:38:23,932 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [228 Valid, 204 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 23:38:23,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2022-02-20 23:38:23,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 365. [2022-02-20 23:38:23,936 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:38:23,937 INFO L82 GeneralOperation]: Start isEquivalent. First operand 402 states. Second operand has 365 states, 334 states have (on average 1.2335329341317365) internal successors, (412), 348 states have internal predecessors, (412), 8 states have call successors, (8), 8 states have call predecessors, (8), 12 states have return successors, (14), 8 states have call predecessors, (14), 8 states have call successors, (14) [2022-02-20 23:38:23,937 INFO L74 IsIncluded]: Start isIncluded. First operand 402 states. Second operand has 365 states, 334 states have (on average 1.2335329341317365) internal successors, (412), 348 states have internal predecessors, (412), 8 states have call successors, (8), 8 states have call predecessors, (8), 12 states have return successors, (14), 8 states have call predecessors, (14), 8 states have call successors, (14) [2022-02-20 23:38:23,937 INFO L87 Difference]: Start difference. First operand 402 states. Second operand has 365 states, 334 states have (on average 1.2335329341317365) internal successors, (412), 348 states have internal predecessors, (412), 8 states have call successors, (8), 8 states have call predecessors, (8), 12 states have return successors, (14), 8 states have call predecessors, (14), 8 states have call successors, (14) [2022-02-20 23:38:23,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:38:23,948 INFO L93 Difference]: Finished difference Result 402 states and 463 transitions. [2022-02-20 23:38:23,949 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 463 transitions. [2022-02-20 23:38:23,949 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:38:23,949 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:38:23,949 INFO L74 IsIncluded]: Start isIncluded. First operand has 365 states, 334 states have (on average 1.2335329341317365) internal successors, (412), 348 states have internal predecessors, (412), 8 states have call successors, (8), 8 states have call predecessors, (8), 12 states have return successors, (14), 8 states have call predecessors, (14), 8 states have call successors, (14) Second operand 402 states. [2022-02-20 23:38:23,950 INFO L87 Difference]: Start difference. First operand has 365 states, 334 states have (on average 1.2335329341317365) internal successors, (412), 348 states have internal predecessors, (412), 8 states have call successors, (8), 8 states have call predecessors, (8), 12 states have return successors, (14), 8 states have call predecessors, (14), 8 states have call successors, (14) Second operand 402 states. [2022-02-20 23:38:23,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:38:23,955 INFO L93 Difference]: Finished difference Result 402 states and 463 transitions. [2022-02-20 23:38:23,956 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 463 transitions. [2022-02-20 23:38:23,956 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:38:23,956 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:38:23,956 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:38:23,956 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:38:23,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 365 states, 334 states have (on average 1.2335329341317365) internal successors, (412), 348 states have internal predecessors, (412), 8 states have call successors, (8), 8 states have call predecessors, (8), 12 states have return successors, (14), 8 states have call predecessors, (14), 8 states have call successors, (14) [2022-02-20 23:38:23,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 434 transitions. [2022-02-20 23:38:23,961 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 434 transitions. Word has length 51 [2022-02-20 23:38:23,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:38:23,962 INFO L470 AbstractCegarLoop]: Abstraction has 365 states and 434 transitions. [2022-02-20 23:38:23,962 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.111111111111111) internal successors, (37), 6 states have internal predecessors, (37), 1 states have call successors, (8), 5 states have call predecessors, (8), 2 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-02-20 23:38:23,962 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 434 transitions. [2022-02-20 23:38:23,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-02-20 23:38:23,962 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:38:23,962 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:38:23,979 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-02-20 23:38:24,171 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-02-20 23:38:24,171 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting parse_inputErr0REQUIRES_VIOLATION === [parse_inputErr0REQUIRES_VIOLATION, parse_inputErr1REQUIRES_VIOLATION, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2022-02-20 23:38:24,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:38:24,172 INFO L85 PathProgramCache]: Analyzing trace with hash -563187969, now seen corresponding path program 1 times [2022-02-20 23:38:24,172 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:38:24,172 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085109178] [2022-02-20 23:38:24,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:38:24,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:38:24,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:38:24,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 23:38:24,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:38:24,247 INFO L290 TraceCheckUtils]: 0: Hoare triple {45771#(and (= ~global~0.base |old(~global~0.base)|) (= |old(#length)| |#length|) (= |old(~global~0.offset)| ~global~0.offset) (= ~state~0 |old(~state~0)|) (= |old(#valid)| |#valid|))} ~input#1.base, ~input#1.offset := #in~input#1.base, #in~input#1.offset;~i~0#1 := 0; {45723#true} is VALID [2022-02-20 23:38:24,248 INFO L290 TraceCheckUtils]: 1: Hoare triple {45723#true} assume !!(~i~0#1 < 2); {45723#true} is VALID [2022-02-20 23:38:24,248 INFO L290 TraceCheckUtils]: 2: Hoare triple {45723#true} SUMMARY for call #t~mem3#1.base, #t~mem3#1.offset := read~$Pointer$(~#commands~0.base, ~#commands~0.offset + 9 * ~i~0#1, 4); srcloc: L693 {45770#(= (select |#valid| |~#commands~0.base|) 1)} is VALID [2022-02-20 23:38:24,248 INFO L290 TraceCheckUtils]: 3: Hoare triple {45770#(= (select |#valid| |~#commands~0.base|) 1)} assume 1 == #valid[#t~mem3#1.base]; {45770#(= (select |#valid| |~#commands~0.base|) 1)} is VALID [2022-02-20 23:38:24,249 INFO L290 TraceCheckUtils]: 4: Hoare triple {45770#(= (select |#valid| |~#commands~0.base|) 1)} assume #t~mem3#1.offset < #length[#t~mem3#1.base] && #t~mem3#1.offset >= 0; {45770#(= (select |#valid| |~#commands~0.base|) 1)} is VALID [2022-02-20 23:38:24,249 INFO L290 TraceCheckUtils]: 5: Hoare triple {45770#(= (select |#valid| |~#commands~0.base|) 1)} assume 1 == #valid[~input#1.base]; {45770#(= (select |#valid| |~#commands~0.base|) 1)} is VALID [2022-02-20 23:38:24,249 INFO L290 TraceCheckUtils]: 6: Hoare triple {45770#(= (select |#valid| |~#commands~0.base|) 1)} assume ~input#1.offset < #length[~input#1.base] && ~input#1.offset >= 0; {45770#(= (select |#valid| |~#commands~0.base|) 1)} is VALID [2022-02-20 23:38:24,249 INFO L290 TraceCheckUtils]: 7: Hoare triple {45770#(= (select |#valid| |~#commands~0.base|) 1)} assume 0 == #t~nondet4#1;havoc #t~mem3#1.base, #t~mem3#1.offset;havoc #t~nondet4#1; {45770#(= (select |#valid| |~#commands~0.base|) 1)} is VALID [2022-02-20 23:38:24,250 INFO L290 TraceCheckUtils]: 8: Hoare triple {45770#(= (select |#valid| |~#commands~0.base|) 1)} SUMMARY for call #t~mem5#1 := read~int(~#commands~0.base, 8 + (~#commands~0.offset + 9 * ~i~0#1), 1); srcloc: L694 {45770#(= (select |#valid| |~#commands~0.base|) 1)} is VALID [2022-02-20 23:38:24,250 INFO L290 TraceCheckUtils]: 9: Hoare triple {45770#(= (select |#valid| |~#commands~0.base|) 1)} assume ~state~0 >= #t~mem5#1;havoc #t~mem5#1; {45770#(= (select |#valid| |~#commands~0.base|) 1)} is VALID [2022-02-20 23:38:24,250 INFO L290 TraceCheckUtils]: 10: Hoare triple {45770#(= (select |#valid| |~#commands~0.base|) 1)} SUMMARY for call #t~mem6#1.base, #t~mem6#1.offset := read~$Pointer$(~#commands~0.base, 4 + (~#commands~0.offset + 9 * ~i~0#1), 4); srcloc: L695 {45770#(= (select |#valid| |~#commands~0.base|) 1)} is VALID [2022-02-20 23:38:24,250 INFO L290 TraceCheckUtils]: 11: Hoare triple {45770#(= (select |#valid| |~#commands~0.base|) 1)} assume { :begin_inline_##fun~~TO~VOID } true;##fun~~TO~VOID_#in~#fp#1.base, ##fun~~TO~VOID_#in~#fp#1.offset := #t~mem6#1.base, #t~mem6#1.offset; {45770#(= (select |#valid| |~#commands~0.base|) 1)} is VALID [2022-02-20 23:38:24,251 INFO L290 TraceCheckUtils]: 12: Hoare triple {45770#(= (select |#valid| |~#commands~0.base|) 1)} assume !(##fun~~TO~VOID_#in~#fp#1.base == #funAddr~c2.base && ##fun~~TO~VOID_#in~#fp#1.offset == #funAddr~c2.offset);assume { :begin_inline_c1 } true;havoc c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset, c1_~x~0#1.base, c1_~x~0#1.offset;call c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset := #Ultimate.allocOnHeap(1);c1_~x~0#1.base, c1_~x~0#1.offset := c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset;havoc c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset; {45772#(not (= |parse_input_c1_~x~0#1.base| |~#commands~0.base|))} is VALID [2022-02-20 23:38:24,251 INFO L290 TraceCheckUtils]: 13: Hoare triple {45772#(not (= |parse_input_c1_~x~0#1.base| |~#commands~0.base|))} assume !(c1_~x~0#1.base == 0 && c1_~x~0#1.offset == 0); {45772#(not (= |parse_input_c1_~x~0#1.base| |~#commands~0.base|))} is VALID [2022-02-20 23:38:24,252 INFO L290 TraceCheckUtils]: 14: Hoare triple {45772#(not (= |parse_input_c1_~x~0#1.base| |~#commands~0.base|))} assume !(~global~0.base != 0 || ~global~0.offset != 0); {45772#(not (= |parse_input_c1_~x~0#1.base| |~#commands~0.base|))} is VALID [2022-02-20 23:38:24,252 INFO L290 TraceCheckUtils]: 15: Hoare triple {45772#(not (= |parse_input_c1_~x~0#1.base| |~#commands~0.base|))} ~global~0.base, ~global~0.offset := c1_~x~0#1.base, c1_~x~0#1.offset;~state~0 := ~unnamed3~0~STATE_2; {45746#(not (= ~global~0.base |~#commands~0.base|))} is VALID [2022-02-20 23:38:24,252 INFO L290 TraceCheckUtils]: 16: Hoare triple {45746#(not (= ~global~0.base |~#commands~0.base|))} assume { :end_inline_c1 } true; {45746#(not (= ~global~0.base |~#commands~0.base|))} is VALID [2022-02-20 23:38:24,252 INFO L290 TraceCheckUtils]: 17: Hoare triple {45746#(not (= ~global~0.base |~#commands~0.base|))} assume { :end_inline_##fun~~TO~VOID } true;havoc #t~mem6#1.base, #t~mem6#1.offset; {45746#(not (= ~global~0.base |~#commands~0.base|))} is VALID [2022-02-20 23:38:24,253 INFO L290 TraceCheckUtils]: 18: Hoare triple {45746#(not (= ~global~0.base |~#commands~0.base|))} assume true; {45746#(not (= ~global~0.base |~#commands~0.base|))} is VALID [2022-02-20 23:38:24,253 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {45746#(not (= ~global~0.base |~#commands~0.base|))} {45725#(= 6 |~#commands~0.base|)} #101#return; {45746#(not (= ~global~0.base |~#commands~0.base|))} is VALID [2022-02-20 23:38:24,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-02-20 23:38:24,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:38:24,331 INFO L290 TraceCheckUtils]: 0: Hoare triple {45771#(and (= ~global~0.base |old(~global~0.base)|) (= |old(#length)| |#length|) (= |old(~global~0.offset)| ~global~0.offset) (= ~state~0 |old(~state~0)|) (= |old(#valid)| |#valid|))} ~input#1.base, ~input#1.offset := #in~input#1.base, #in~input#1.offset;~i~0#1 := 0; {45773#(= ~global~0.base |old(~global~0.base)|)} is VALID [2022-02-20 23:38:24,331 INFO L290 TraceCheckUtils]: 1: Hoare triple {45773#(= ~global~0.base |old(~global~0.base)|)} assume !!(~i~0#1 < 2); {45773#(= ~global~0.base |old(~global~0.base)|)} is VALID [2022-02-20 23:38:24,332 INFO L290 TraceCheckUtils]: 2: Hoare triple {45773#(= ~global~0.base |old(~global~0.base)|)} SUMMARY for call #t~mem3#1.base, #t~mem3#1.offset := read~$Pointer$(~#commands~0.base, ~#commands~0.offset + 9 * ~i~0#1, 4); srcloc: L693 {45774#(and (or (not (= ~global~0.base |~#commands~0.base|)) (= |~#commands~0.base| |old(~global~0.base)|)) (= (select |#valid| |~#commands~0.base|) 1))} is VALID [2022-02-20 23:38:24,333 INFO L290 TraceCheckUtils]: 3: Hoare triple {45774#(and (or (not (= ~global~0.base |~#commands~0.base|)) (= |~#commands~0.base| |old(~global~0.base)|)) (= (select |#valid| |~#commands~0.base|) 1))} assume 1 == #valid[#t~mem3#1.base]; {45774#(and (or (not (= ~global~0.base |~#commands~0.base|)) (= |~#commands~0.base| |old(~global~0.base)|)) (= (select |#valid| |~#commands~0.base|) 1))} is VALID [2022-02-20 23:38:24,333 INFO L290 TraceCheckUtils]: 4: Hoare triple {45774#(and (or (not (= ~global~0.base |~#commands~0.base|)) (= |~#commands~0.base| |old(~global~0.base)|)) (= (select |#valid| |~#commands~0.base|) 1))} assume #t~mem3#1.offset < #length[#t~mem3#1.base] && #t~mem3#1.offset >= 0; {45774#(and (or (not (= ~global~0.base |~#commands~0.base|)) (= |~#commands~0.base| |old(~global~0.base)|)) (= (select |#valid| |~#commands~0.base|) 1))} is VALID [2022-02-20 23:38:24,334 INFO L290 TraceCheckUtils]: 5: Hoare triple {45774#(and (or (not (= ~global~0.base |~#commands~0.base|)) (= |~#commands~0.base| |old(~global~0.base)|)) (= (select |#valid| |~#commands~0.base|) 1))} assume 1 == #valid[~input#1.base]; {45774#(and (or (not (= ~global~0.base |~#commands~0.base|)) (= |~#commands~0.base| |old(~global~0.base)|)) (= (select |#valid| |~#commands~0.base|) 1))} is VALID [2022-02-20 23:38:24,334 INFO L290 TraceCheckUtils]: 6: Hoare triple {45774#(and (or (not (= ~global~0.base |~#commands~0.base|)) (= |~#commands~0.base| |old(~global~0.base)|)) (= (select |#valid| |~#commands~0.base|) 1))} assume ~input#1.offset < #length[~input#1.base] && ~input#1.offset >= 0; {45774#(and (or (not (= ~global~0.base |~#commands~0.base|)) (= |~#commands~0.base| |old(~global~0.base)|)) (= (select |#valid| |~#commands~0.base|) 1))} is VALID [2022-02-20 23:38:24,335 INFO L290 TraceCheckUtils]: 7: Hoare triple {45774#(and (or (not (= ~global~0.base |~#commands~0.base|)) (= |~#commands~0.base| |old(~global~0.base)|)) (= (select |#valid| |~#commands~0.base|) 1))} assume 0 == #t~nondet4#1;havoc #t~mem3#1.base, #t~mem3#1.offset;havoc #t~nondet4#1; {45774#(and (or (not (= ~global~0.base |~#commands~0.base|)) (= |~#commands~0.base| |old(~global~0.base)|)) (= (select |#valid| |~#commands~0.base|) 1))} is VALID [2022-02-20 23:38:24,335 INFO L290 TraceCheckUtils]: 8: Hoare triple {45774#(and (or (not (= ~global~0.base |~#commands~0.base|)) (= |~#commands~0.base| |old(~global~0.base)|)) (= (select |#valid| |~#commands~0.base|) 1))} SUMMARY for call #t~mem5#1 := read~int(~#commands~0.base, 8 + (~#commands~0.offset + 9 * ~i~0#1), 1); srcloc: L694 {45774#(and (or (not (= ~global~0.base |~#commands~0.base|)) (= |~#commands~0.base| |old(~global~0.base)|)) (= (select |#valid| |~#commands~0.base|) 1))} is VALID [2022-02-20 23:38:24,336 INFO L290 TraceCheckUtils]: 9: Hoare triple {45774#(and (or (not (= ~global~0.base |~#commands~0.base|)) (= |~#commands~0.base| |old(~global~0.base)|)) (= (select |#valid| |~#commands~0.base|) 1))} assume ~state~0 >= #t~mem5#1;havoc #t~mem5#1; {45774#(and (or (not (= ~global~0.base |~#commands~0.base|)) (= |~#commands~0.base| |old(~global~0.base)|)) (= (select |#valid| |~#commands~0.base|) 1))} is VALID [2022-02-20 23:38:24,337 INFO L290 TraceCheckUtils]: 10: Hoare triple {45774#(and (or (not (= ~global~0.base |~#commands~0.base|)) (= |~#commands~0.base| |old(~global~0.base)|)) (= (select |#valid| |~#commands~0.base|) 1))} SUMMARY for call #t~mem6#1.base, #t~mem6#1.offset := read~$Pointer$(~#commands~0.base, 4 + (~#commands~0.offset + 9 * ~i~0#1), 4); srcloc: L695 {45774#(and (or (not (= ~global~0.base |~#commands~0.base|)) (= |~#commands~0.base| |old(~global~0.base)|)) (= (select |#valid| |~#commands~0.base|) 1))} is VALID [2022-02-20 23:38:24,337 INFO L290 TraceCheckUtils]: 11: Hoare triple {45774#(and (or (not (= ~global~0.base |~#commands~0.base|)) (= |~#commands~0.base| |old(~global~0.base)|)) (= (select |#valid| |~#commands~0.base|) 1))} assume { :begin_inline_##fun~~TO~VOID } true;##fun~~TO~VOID_#in~#fp#1.base, ##fun~~TO~VOID_#in~#fp#1.offset := #t~mem6#1.base, #t~mem6#1.offset; {45774#(and (or (not (= ~global~0.base |~#commands~0.base|)) (= |~#commands~0.base| |old(~global~0.base)|)) (= (select |#valid| |~#commands~0.base|) 1))} is VALID [2022-02-20 23:38:24,338 INFO L290 TraceCheckUtils]: 12: Hoare triple {45774#(and (or (not (= ~global~0.base |~#commands~0.base|)) (= |~#commands~0.base| |old(~global~0.base)|)) (= (select |#valid| |~#commands~0.base|) 1))} assume !(##fun~~TO~VOID_#in~#fp#1.base == #funAddr~c2.base && ##fun~~TO~VOID_#in~#fp#1.offset == #funAddr~c2.offset);assume { :begin_inline_c1 } true;havoc c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset, c1_~x~0#1.base, c1_~x~0#1.offset;call c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset := #Ultimate.allocOnHeap(1);c1_~x~0#1.base, c1_~x~0#1.offset := c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset;havoc c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset; {45775#(and (not (= |parse_input_c1_~x~0#1.base| |~#commands~0.base|)) (or (= ~global~0.base |~#commands~0.base|) (= (select |#valid| |~#commands~0.base|) 1)) (or (not (= ~global~0.base |~#commands~0.base|)) (= |~#commands~0.base| |old(~global~0.base)|)))} is VALID [2022-02-20 23:38:24,338 INFO L290 TraceCheckUtils]: 13: Hoare triple {45775#(and (not (= |parse_input_c1_~x~0#1.base| |~#commands~0.base|)) (or (= ~global~0.base |~#commands~0.base|) (= (select |#valid| |~#commands~0.base|) 1)) (or (not (= ~global~0.base |~#commands~0.base|)) (= |~#commands~0.base| |old(~global~0.base)|)))} assume !(c1_~x~0#1.base == 0 && c1_~x~0#1.offset == 0); {45775#(and (not (= |parse_input_c1_~x~0#1.base| |~#commands~0.base|)) (or (= ~global~0.base |~#commands~0.base|) (= (select |#valid| |~#commands~0.base|) 1)) (or (not (= ~global~0.base |~#commands~0.base|)) (= |~#commands~0.base| |old(~global~0.base)|)))} is VALID [2022-02-20 23:38:24,339 INFO L290 TraceCheckUtils]: 14: Hoare triple {45775#(and (not (= |parse_input_c1_~x~0#1.base| |~#commands~0.base|)) (or (= ~global~0.base |~#commands~0.base|) (= (select |#valid| |~#commands~0.base|) 1)) (or (not (= ~global~0.base |~#commands~0.base|)) (= |~#commands~0.base| |old(~global~0.base)|)))} assume ~global~0.base != 0 || ~global~0.offset != 0; {45775#(and (not (= |parse_input_c1_~x~0#1.base| |~#commands~0.base|)) (or (= ~global~0.base |~#commands~0.base|) (= (select |#valid| |~#commands~0.base|) 1)) (or (not (= ~global~0.base |~#commands~0.base|)) (= |~#commands~0.base| |old(~global~0.base)|)))} is VALID [2022-02-20 23:38:24,340 INFO L290 TraceCheckUtils]: 15: Hoare triple {45775#(and (not (= |parse_input_c1_~x~0#1.base| |~#commands~0.base|)) (or (= ~global~0.base |~#commands~0.base|) (= (select |#valid| |~#commands~0.base|) 1)) (or (not (= ~global~0.base |~#commands~0.base|)) (= |~#commands~0.base| |old(~global~0.base)|)))} assume 0 == ~global~0.offset; {45775#(and (not (= |parse_input_c1_~x~0#1.base| |~#commands~0.base|)) (or (= ~global~0.base |~#commands~0.base|) (= (select |#valid| |~#commands~0.base|) 1)) (or (not (= ~global~0.base |~#commands~0.base|)) (= |~#commands~0.base| |old(~global~0.base)|)))} is VALID [2022-02-20 23:38:24,340 INFO L290 TraceCheckUtils]: 16: Hoare triple {45775#(and (not (= |parse_input_c1_~x~0#1.base| |~#commands~0.base|)) (or (= ~global~0.base |~#commands~0.base|) (= (select |#valid| |~#commands~0.base|) 1)) (or (not (= ~global~0.base |~#commands~0.base|)) (= |~#commands~0.base| |old(~global~0.base)|)))} assume ~global~0.base < #StackHeapBarrier; {45775#(and (not (= |parse_input_c1_~x~0#1.base| |~#commands~0.base|)) (or (= ~global~0.base |~#commands~0.base|) (= (select |#valid| |~#commands~0.base|) 1)) (or (not (= ~global~0.base |~#commands~0.base|)) (= |~#commands~0.base| |old(~global~0.base)|)))} is VALID [2022-02-20 23:38:24,341 INFO L290 TraceCheckUtils]: 17: Hoare triple {45775#(and (not (= |parse_input_c1_~x~0#1.base| |~#commands~0.base|)) (or (= ~global~0.base |~#commands~0.base|) (= (select |#valid| |~#commands~0.base|) 1)) (or (not (= ~global~0.base |~#commands~0.base|)) (= |~#commands~0.base| |old(~global~0.base)|)))} assume 0 == ~global~0.base || 1 == #valid[~global~0.base];call ULTIMATE.dealloc(~global~0.base, ~global~0.offset); {45776#(and (not (= |parse_input_c1_~x~0#1.base| |~#commands~0.base|)) (or (= |~#commands~0.base| |old(~global~0.base)|) (= (select |#valid| |~#commands~0.base|) 1)))} is VALID [2022-02-20 23:38:24,341 INFO L290 TraceCheckUtils]: 18: Hoare triple {45776#(and (not (= |parse_input_c1_~x~0#1.base| |~#commands~0.base|)) (or (= |~#commands~0.base| |old(~global~0.base)|) (= (select |#valid| |~#commands~0.base|) 1)))} ~global~0.base, ~global~0.offset := c1_~x~0#1.base, c1_~x~0#1.offset;~state~0 := ~unnamed3~0~STATE_2; {45777#(or (= |~#commands~0.base| |old(~global~0.base)|) (= (select |#valid| |~#commands~0.base|) 1))} is VALID [2022-02-20 23:38:24,341 INFO L290 TraceCheckUtils]: 19: Hoare triple {45777#(or (= |~#commands~0.base| |old(~global~0.base)|) (= (select |#valid| |~#commands~0.base|) 1))} assume { :end_inline_c1 } true; {45777#(or (= |~#commands~0.base| |old(~global~0.base)|) (= (select |#valid| |~#commands~0.base|) 1))} is VALID [2022-02-20 23:38:24,342 INFO L290 TraceCheckUtils]: 20: Hoare triple {45777#(or (= |~#commands~0.base| |old(~global~0.base)|) (= (select |#valid| |~#commands~0.base|) 1))} assume { :end_inline_##fun~~TO~VOID } true;havoc #t~mem6#1.base, #t~mem6#1.offset; {45777#(or (= |~#commands~0.base| |old(~global~0.base)|) (= (select |#valid| |~#commands~0.base|) 1))} is VALID [2022-02-20 23:38:24,342 INFO L290 TraceCheckUtils]: 21: Hoare triple {45777#(or (= |~#commands~0.base| |old(~global~0.base)|) (= (select |#valid| |~#commands~0.base|) 1))} assume true; {45777#(or (= |~#commands~0.base| |old(~global~0.base)|) (= (select |#valid| |~#commands~0.base|) 1))} is VALID [2022-02-20 23:38:24,343 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {45777#(or (= |~#commands~0.base| |old(~global~0.base)|) (= (select |#valid| |~#commands~0.base|) 1))} {45746#(not (= ~global~0.base |~#commands~0.base|))} #103#return; {45770#(= (select |#valid| |~#commands~0.base|) 1)} is VALID [2022-02-20 23:38:24,343 INFO L290 TraceCheckUtils]: 0: Hoare triple {45723#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(3, 1);call write~init~int(99, 1, 0, 1);call write~init~int(49, 1, 1, 1);call write~init~int(0, 1, 2, 1);call #Ultimate.allocInit(3, 2);call write~init~int(99, 2, 0, 1);call write~init~int(50, 2, 1, 1);call write~init~int(0, 2, 2, 1);call #Ultimate.allocInit(3, 3);call write~init~int(99, 3, 0, 1);call write~init~int(49, 3, 1, 1);call write~init~int(0, 3, 2, 1);call #Ultimate.allocInit(3, 4);call write~init~int(99, 4, 0, 1);call write~init~int(49, 4, 1, 1);call write~init~int(0, 4, 2, 1);call #Ultimate.allocInit(3, 5);call write~init~int(99, 5, 0, 1);call write~init~int(50, 5, 1, 1);call write~init~int(0, 5, 2, 1);~state~0 := ~unnamed3~0~STATE_1;~global~0.base, ~global~0.offset := 0, 0;~#commands~0.base, ~#commands~0.offset := 6, 0;call #Ultimate.allocInit(18, 6);call write~init~$Pointer$(1, 0, ~#commands~0.base, ~#commands~0.offset, 4);call write~init~$Pointer$(#funAddr~c1.base, #funAddr~c1.offset, ~#commands~0.base, 4 + ~#commands~0.offset, 4);call write~init~int((if ~unnamed3~0~STATE_1 % 256 <= 127 then ~unnamed3~0~STATE_1 % 256 else ~unnamed3~0~STATE_1 % 256 - 256), ~#commands~0.base, 8 + ~#commands~0.offset, 1);call write~init~$Pointer$(2, 0, ~#commands~0.base, 9 + ~#commands~0.offset, 4);call write~init~$Pointer$(#funAddr~c2.base, #funAddr~c2.offset, ~#commands~0.base, 13 + ~#commands~0.offset, 4);call write~init~int((if ~unnamed3~0~STATE_2 % 256 <= 127 then ~unnamed3~0~STATE_2 % 256 else ~unnamed3~0~STATE_2 % 256 - 256), ~#commands~0.base, 17 + ~#commands~0.offset, 1); {45725#(= 6 |~#commands~0.base|)} is VALID [2022-02-20 23:38:24,344 INFO L290 TraceCheckUtils]: 1: Hoare triple {45725#(= 6 |~#commands~0.base|)} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1; {45725#(= 6 |~#commands~0.base|)} is VALID [2022-02-20 23:38:24,345 INFO L272 TraceCheckUtils]: 2: Hoare triple {45725#(= 6 |~#commands~0.base|)} call parse_input(3, 0); {45771#(and (= ~global~0.base |old(~global~0.base)|) (= |old(#length)| |#length|) (= |old(~global~0.offset)| ~global~0.offset) (= ~state~0 |old(~state~0)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 23:38:24,345 INFO L290 TraceCheckUtils]: 3: Hoare triple {45771#(and (= ~global~0.base |old(~global~0.base)|) (= |old(#length)| |#length|) (= |old(~global~0.offset)| ~global~0.offset) (= ~state~0 |old(~state~0)|) (= |old(#valid)| |#valid|))} ~input#1.base, ~input#1.offset := #in~input#1.base, #in~input#1.offset;~i~0#1 := 0; {45723#true} is VALID [2022-02-20 23:38:24,345 INFO L290 TraceCheckUtils]: 4: Hoare triple {45723#true} assume !!(~i~0#1 < 2); {45723#true} is VALID [2022-02-20 23:38:24,345 INFO L290 TraceCheckUtils]: 5: Hoare triple {45723#true} SUMMARY for call #t~mem3#1.base, #t~mem3#1.offset := read~$Pointer$(~#commands~0.base, ~#commands~0.offset + 9 * ~i~0#1, 4); srcloc: L693 {45770#(= (select |#valid| |~#commands~0.base|) 1)} is VALID [2022-02-20 23:38:24,346 INFO L290 TraceCheckUtils]: 6: Hoare triple {45770#(= (select |#valid| |~#commands~0.base|) 1)} assume 1 == #valid[#t~mem3#1.base]; {45770#(= (select |#valid| |~#commands~0.base|) 1)} is VALID [2022-02-20 23:38:24,346 INFO L290 TraceCheckUtils]: 7: Hoare triple {45770#(= (select |#valid| |~#commands~0.base|) 1)} assume #t~mem3#1.offset < #length[#t~mem3#1.base] && #t~mem3#1.offset >= 0; {45770#(= (select |#valid| |~#commands~0.base|) 1)} is VALID [2022-02-20 23:38:24,346 INFO L290 TraceCheckUtils]: 8: Hoare triple {45770#(= (select |#valid| |~#commands~0.base|) 1)} assume 1 == #valid[~input#1.base]; {45770#(= (select |#valid| |~#commands~0.base|) 1)} is VALID [2022-02-20 23:38:24,347 INFO L290 TraceCheckUtils]: 9: Hoare triple {45770#(= (select |#valid| |~#commands~0.base|) 1)} assume ~input#1.offset < #length[~input#1.base] && ~input#1.offset >= 0; {45770#(= (select |#valid| |~#commands~0.base|) 1)} is VALID [2022-02-20 23:38:24,347 INFO L290 TraceCheckUtils]: 10: Hoare triple {45770#(= (select |#valid| |~#commands~0.base|) 1)} assume 0 == #t~nondet4#1;havoc #t~mem3#1.base, #t~mem3#1.offset;havoc #t~nondet4#1; {45770#(= (select |#valid| |~#commands~0.base|) 1)} is VALID [2022-02-20 23:38:24,347 INFO L290 TraceCheckUtils]: 11: Hoare triple {45770#(= (select |#valid| |~#commands~0.base|) 1)} SUMMARY for call #t~mem5#1 := read~int(~#commands~0.base, 8 + (~#commands~0.offset + 9 * ~i~0#1), 1); srcloc: L694 {45770#(= (select |#valid| |~#commands~0.base|) 1)} is VALID [2022-02-20 23:38:24,348 INFO L290 TraceCheckUtils]: 12: Hoare triple {45770#(= (select |#valid| |~#commands~0.base|) 1)} assume ~state~0 >= #t~mem5#1;havoc #t~mem5#1; {45770#(= (select |#valid| |~#commands~0.base|) 1)} is VALID [2022-02-20 23:38:24,348 INFO L290 TraceCheckUtils]: 13: Hoare triple {45770#(= (select |#valid| |~#commands~0.base|) 1)} SUMMARY for call #t~mem6#1.base, #t~mem6#1.offset := read~$Pointer$(~#commands~0.base, 4 + (~#commands~0.offset + 9 * ~i~0#1), 4); srcloc: L695 {45770#(= (select |#valid| |~#commands~0.base|) 1)} is VALID [2022-02-20 23:38:24,349 INFO L290 TraceCheckUtils]: 14: Hoare triple {45770#(= (select |#valid| |~#commands~0.base|) 1)} assume { :begin_inline_##fun~~TO~VOID } true;##fun~~TO~VOID_#in~#fp#1.base, ##fun~~TO~VOID_#in~#fp#1.offset := #t~mem6#1.base, #t~mem6#1.offset; {45770#(= (select |#valid| |~#commands~0.base|) 1)} is VALID [2022-02-20 23:38:24,349 INFO L290 TraceCheckUtils]: 15: Hoare triple {45770#(= (select |#valid| |~#commands~0.base|) 1)} assume !(##fun~~TO~VOID_#in~#fp#1.base == #funAddr~c2.base && ##fun~~TO~VOID_#in~#fp#1.offset == #funAddr~c2.offset);assume { :begin_inline_c1 } true;havoc c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset, c1_~x~0#1.base, c1_~x~0#1.offset;call c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset := #Ultimate.allocOnHeap(1);c1_~x~0#1.base, c1_~x~0#1.offset := c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset;havoc c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset; {45772#(not (= |parse_input_c1_~x~0#1.base| |~#commands~0.base|))} is VALID [2022-02-20 23:38:24,349 INFO L290 TraceCheckUtils]: 16: Hoare triple {45772#(not (= |parse_input_c1_~x~0#1.base| |~#commands~0.base|))} assume !(c1_~x~0#1.base == 0 && c1_~x~0#1.offset == 0); {45772#(not (= |parse_input_c1_~x~0#1.base| |~#commands~0.base|))} is VALID [2022-02-20 23:38:24,350 INFO L290 TraceCheckUtils]: 17: Hoare triple {45772#(not (= |parse_input_c1_~x~0#1.base| |~#commands~0.base|))} assume !(~global~0.base != 0 || ~global~0.offset != 0); {45772#(not (= |parse_input_c1_~x~0#1.base| |~#commands~0.base|))} is VALID [2022-02-20 23:38:24,350 INFO L290 TraceCheckUtils]: 18: Hoare triple {45772#(not (= |parse_input_c1_~x~0#1.base| |~#commands~0.base|))} ~global~0.base, ~global~0.offset := c1_~x~0#1.base, c1_~x~0#1.offset;~state~0 := ~unnamed3~0~STATE_2; {45746#(not (= ~global~0.base |~#commands~0.base|))} is VALID [2022-02-20 23:38:24,351 INFO L290 TraceCheckUtils]: 19: Hoare triple {45746#(not (= ~global~0.base |~#commands~0.base|))} assume { :end_inline_c1 } true; {45746#(not (= ~global~0.base |~#commands~0.base|))} is VALID [2022-02-20 23:38:24,351 INFO L290 TraceCheckUtils]: 20: Hoare triple {45746#(not (= ~global~0.base |~#commands~0.base|))} assume { :end_inline_##fun~~TO~VOID } true;havoc #t~mem6#1.base, #t~mem6#1.offset; {45746#(not (= ~global~0.base |~#commands~0.base|))} is VALID [2022-02-20 23:38:24,351 INFO L290 TraceCheckUtils]: 21: Hoare triple {45746#(not (= ~global~0.base |~#commands~0.base|))} assume true; {45746#(not (= ~global~0.base |~#commands~0.base|))} is VALID [2022-02-20 23:38:24,352 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {45746#(not (= ~global~0.base |~#commands~0.base|))} {45725#(= 6 |~#commands~0.base|)} #101#return; {45746#(not (= ~global~0.base |~#commands~0.base|))} is VALID [2022-02-20 23:38:24,353 INFO L272 TraceCheckUtils]: 23: Hoare triple {45746#(not (= ~global~0.base |~#commands~0.base|))} call parse_input(4, 0); {45771#(and (= ~global~0.base |old(~global~0.base)|) (= |old(#length)| |#length|) (= |old(~global~0.offset)| ~global~0.offset) (= ~state~0 |old(~state~0)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 23:38:24,353 INFO L290 TraceCheckUtils]: 24: Hoare triple {45771#(and (= ~global~0.base |old(~global~0.base)|) (= |old(#length)| |#length|) (= |old(~global~0.offset)| ~global~0.offset) (= ~state~0 |old(~state~0)|) (= |old(#valid)| |#valid|))} ~input#1.base, ~input#1.offset := #in~input#1.base, #in~input#1.offset;~i~0#1 := 0; {45773#(= ~global~0.base |old(~global~0.base)|)} is VALID [2022-02-20 23:38:24,353 INFO L290 TraceCheckUtils]: 25: Hoare triple {45773#(= ~global~0.base |old(~global~0.base)|)} assume !!(~i~0#1 < 2); {45773#(= ~global~0.base |old(~global~0.base)|)} is VALID [2022-02-20 23:38:24,354 INFO L290 TraceCheckUtils]: 26: Hoare triple {45773#(= ~global~0.base |old(~global~0.base)|)} SUMMARY for call #t~mem3#1.base, #t~mem3#1.offset := read~$Pointer$(~#commands~0.base, ~#commands~0.offset + 9 * ~i~0#1, 4); srcloc: L693 {45774#(and (or (not (= ~global~0.base |~#commands~0.base|)) (= |~#commands~0.base| |old(~global~0.base)|)) (= (select |#valid| |~#commands~0.base|) 1))} is VALID [2022-02-20 23:38:24,354 INFO L290 TraceCheckUtils]: 27: Hoare triple {45774#(and (or (not (= ~global~0.base |~#commands~0.base|)) (= |~#commands~0.base| |old(~global~0.base)|)) (= (select |#valid| |~#commands~0.base|) 1))} assume 1 == #valid[#t~mem3#1.base]; {45774#(and (or (not (= ~global~0.base |~#commands~0.base|)) (= |~#commands~0.base| |old(~global~0.base)|)) (= (select |#valid| |~#commands~0.base|) 1))} is VALID [2022-02-20 23:38:24,355 INFO L290 TraceCheckUtils]: 28: Hoare triple {45774#(and (or (not (= ~global~0.base |~#commands~0.base|)) (= |~#commands~0.base| |old(~global~0.base)|)) (= (select |#valid| |~#commands~0.base|) 1))} assume #t~mem3#1.offset < #length[#t~mem3#1.base] && #t~mem3#1.offset >= 0; {45774#(and (or (not (= ~global~0.base |~#commands~0.base|)) (= |~#commands~0.base| |old(~global~0.base)|)) (= (select |#valid| |~#commands~0.base|) 1))} is VALID [2022-02-20 23:38:24,355 INFO L290 TraceCheckUtils]: 29: Hoare triple {45774#(and (or (not (= ~global~0.base |~#commands~0.base|)) (= |~#commands~0.base| |old(~global~0.base)|)) (= (select |#valid| |~#commands~0.base|) 1))} assume 1 == #valid[~input#1.base]; {45774#(and (or (not (= ~global~0.base |~#commands~0.base|)) (= |~#commands~0.base| |old(~global~0.base)|)) (= (select |#valid| |~#commands~0.base|) 1))} is VALID [2022-02-20 23:38:24,356 INFO L290 TraceCheckUtils]: 30: Hoare triple {45774#(and (or (not (= ~global~0.base |~#commands~0.base|)) (= |~#commands~0.base| |old(~global~0.base)|)) (= (select |#valid| |~#commands~0.base|) 1))} assume ~input#1.offset < #length[~input#1.base] && ~input#1.offset >= 0; {45774#(and (or (not (= ~global~0.base |~#commands~0.base|)) (= |~#commands~0.base| |old(~global~0.base)|)) (= (select |#valid| |~#commands~0.base|) 1))} is VALID [2022-02-20 23:38:24,356 INFO L290 TraceCheckUtils]: 31: Hoare triple {45774#(and (or (not (= ~global~0.base |~#commands~0.base|)) (= |~#commands~0.base| |old(~global~0.base)|)) (= (select |#valid| |~#commands~0.base|) 1))} assume 0 == #t~nondet4#1;havoc #t~mem3#1.base, #t~mem3#1.offset;havoc #t~nondet4#1; {45774#(and (or (not (= ~global~0.base |~#commands~0.base|)) (= |~#commands~0.base| |old(~global~0.base)|)) (= (select |#valid| |~#commands~0.base|) 1))} is VALID [2022-02-20 23:38:24,357 INFO L290 TraceCheckUtils]: 32: Hoare triple {45774#(and (or (not (= ~global~0.base |~#commands~0.base|)) (= |~#commands~0.base| |old(~global~0.base)|)) (= (select |#valid| |~#commands~0.base|) 1))} SUMMARY for call #t~mem5#1 := read~int(~#commands~0.base, 8 + (~#commands~0.offset + 9 * ~i~0#1), 1); srcloc: L694 {45774#(and (or (not (= ~global~0.base |~#commands~0.base|)) (= |~#commands~0.base| |old(~global~0.base)|)) (= (select |#valid| |~#commands~0.base|) 1))} is VALID [2022-02-20 23:38:24,357 INFO L290 TraceCheckUtils]: 33: Hoare triple {45774#(and (or (not (= ~global~0.base |~#commands~0.base|)) (= |~#commands~0.base| |old(~global~0.base)|)) (= (select |#valid| |~#commands~0.base|) 1))} assume ~state~0 >= #t~mem5#1;havoc #t~mem5#1; {45774#(and (or (not (= ~global~0.base |~#commands~0.base|)) (= |~#commands~0.base| |old(~global~0.base)|)) (= (select |#valid| |~#commands~0.base|) 1))} is VALID [2022-02-20 23:38:24,358 INFO L290 TraceCheckUtils]: 34: Hoare triple {45774#(and (or (not (= ~global~0.base |~#commands~0.base|)) (= |~#commands~0.base| |old(~global~0.base)|)) (= (select |#valid| |~#commands~0.base|) 1))} SUMMARY for call #t~mem6#1.base, #t~mem6#1.offset := read~$Pointer$(~#commands~0.base, 4 + (~#commands~0.offset + 9 * ~i~0#1), 4); srcloc: L695 {45774#(and (or (not (= ~global~0.base |~#commands~0.base|)) (= |~#commands~0.base| |old(~global~0.base)|)) (= (select |#valid| |~#commands~0.base|) 1))} is VALID [2022-02-20 23:38:24,358 INFO L290 TraceCheckUtils]: 35: Hoare triple {45774#(and (or (not (= ~global~0.base |~#commands~0.base|)) (= |~#commands~0.base| |old(~global~0.base)|)) (= (select |#valid| |~#commands~0.base|) 1))} assume { :begin_inline_##fun~~TO~VOID } true;##fun~~TO~VOID_#in~#fp#1.base, ##fun~~TO~VOID_#in~#fp#1.offset := #t~mem6#1.base, #t~mem6#1.offset; {45774#(and (or (not (= ~global~0.base |~#commands~0.base|)) (= |~#commands~0.base| |old(~global~0.base)|)) (= (select |#valid| |~#commands~0.base|) 1))} is VALID [2022-02-20 23:38:24,359 INFO L290 TraceCheckUtils]: 36: Hoare triple {45774#(and (or (not (= ~global~0.base |~#commands~0.base|)) (= |~#commands~0.base| |old(~global~0.base)|)) (= (select |#valid| |~#commands~0.base|) 1))} assume !(##fun~~TO~VOID_#in~#fp#1.base == #funAddr~c2.base && ##fun~~TO~VOID_#in~#fp#1.offset == #funAddr~c2.offset);assume { :begin_inline_c1 } true;havoc c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset, c1_~x~0#1.base, c1_~x~0#1.offset;call c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset := #Ultimate.allocOnHeap(1);c1_~x~0#1.base, c1_~x~0#1.offset := c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset;havoc c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset; {45775#(and (not (= |parse_input_c1_~x~0#1.base| |~#commands~0.base|)) (or (= ~global~0.base |~#commands~0.base|) (= (select |#valid| |~#commands~0.base|) 1)) (or (not (= ~global~0.base |~#commands~0.base|)) (= |~#commands~0.base| |old(~global~0.base)|)))} is VALID [2022-02-20 23:38:24,360 INFO L290 TraceCheckUtils]: 37: Hoare triple {45775#(and (not (= |parse_input_c1_~x~0#1.base| |~#commands~0.base|)) (or (= ~global~0.base |~#commands~0.base|) (= (select |#valid| |~#commands~0.base|) 1)) (or (not (= ~global~0.base |~#commands~0.base|)) (= |~#commands~0.base| |old(~global~0.base)|)))} assume !(c1_~x~0#1.base == 0 && c1_~x~0#1.offset == 0); {45775#(and (not (= |parse_input_c1_~x~0#1.base| |~#commands~0.base|)) (or (= ~global~0.base |~#commands~0.base|) (= (select |#valid| |~#commands~0.base|) 1)) (or (not (= ~global~0.base |~#commands~0.base|)) (= |~#commands~0.base| |old(~global~0.base)|)))} is VALID [2022-02-20 23:38:24,360 INFO L290 TraceCheckUtils]: 38: Hoare triple {45775#(and (not (= |parse_input_c1_~x~0#1.base| |~#commands~0.base|)) (or (= ~global~0.base |~#commands~0.base|) (= (select |#valid| |~#commands~0.base|) 1)) (or (not (= ~global~0.base |~#commands~0.base|)) (= |~#commands~0.base| |old(~global~0.base)|)))} assume ~global~0.base != 0 || ~global~0.offset != 0; {45775#(and (not (= |parse_input_c1_~x~0#1.base| |~#commands~0.base|)) (or (= ~global~0.base |~#commands~0.base|) (= (select |#valid| |~#commands~0.base|) 1)) (or (not (= ~global~0.base |~#commands~0.base|)) (= |~#commands~0.base| |old(~global~0.base)|)))} is VALID [2022-02-20 23:38:24,361 INFO L290 TraceCheckUtils]: 39: Hoare triple {45775#(and (not (= |parse_input_c1_~x~0#1.base| |~#commands~0.base|)) (or (= ~global~0.base |~#commands~0.base|) (= (select |#valid| |~#commands~0.base|) 1)) (or (not (= ~global~0.base |~#commands~0.base|)) (= |~#commands~0.base| |old(~global~0.base)|)))} assume 0 == ~global~0.offset; {45775#(and (not (= |parse_input_c1_~x~0#1.base| |~#commands~0.base|)) (or (= ~global~0.base |~#commands~0.base|) (= (select |#valid| |~#commands~0.base|) 1)) (or (not (= ~global~0.base |~#commands~0.base|)) (= |~#commands~0.base| |old(~global~0.base)|)))} is VALID [2022-02-20 23:38:24,361 INFO L290 TraceCheckUtils]: 40: Hoare triple {45775#(and (not (= |parse_input_c1_~x~0#1.base| |~#commands~0.base|)) (or (= ~global~0.base |~#commands~0.base|) (= (select |#valid| |~#commands~0.base|) 1)) (or (not (= ~global~0.base |~#commands~0.base|)) (= |~#commands~0.base| |old(~global~0.base)|)))} assume ~global~0.base < #StackHeapBarrier; {45775#(and (not (= |parse_input_c1_~x~0#1.base| |~#commands~0.base|)) (or (= ~global~0.base |~#commands~0.base|) (= (select |#valid| |~#commands~0.base|) 1)) (or (not (= ~global~0.base |~#commands~0.base|)) (= |~#commands~0.base| |old(~global~0.base)|)))} is VALID [2022-02-20 23:38:24,362 INFO L290 TraceCheckUtils]: 41: Hoare triple {45775#(and (not (= |parse_input_c1_~x~0#1.base| |~#commands~0.base|)) (or (= ~global~0.base |~#commands~0.base|) (= (select |#valid| |~#commands~0.base|) 1)) (or (not (= ~global~0.base |~#commands~0.base|)) (= |~#commands~0.base| |old(~global~0.base)|)))} assume 0 == ~global~0.base || 1 == #valid[~global~0.base];call ULTIMATE.dealloc(~global~0.base, ~global~0.offset); {45776#(and (not (= |parse_input_c1_~x~0#1.base| |~#commands~0.base|)) (or (= |~#commands~0.base| |old(~global~0.base)|) (= (select |#valid| |~#commands~0.base|) 1)))} is VALID [2022-02-20 23:38:24,362 INFO L290 TraceCheckUtils]: 42: Hoare triple {45776#(and (not (= |parse_input_c1_~x~0#1.base| |~#commands~0.base|)) (or (= |~#commands~0.base| |old(~global~0.base)|) (= (select |#valid| |~#commands~0.base|) 1)))} ~global~0.base, ~global~0.offset := c1_~x~0#1.base, c1_~x~0#1.offset;~state~0 := ~unnamed3~0~STATE_2; {45777#(or (= |~#commands~0.base| |old(~global~0.base)|) (= (select |#valid| |~#commands~0.base|) 1))} is VALID [2022-02-20 23:38:24,363 INFO L290 TraceCheckUtils]: 43: Hoare triple {45777#(or (= |~#commands~0.base| |old(~global~0.base)|) (= (select |#valid| |~#commands~0.base|) 1))} assume { :end_inline_c1 } true; {45777#(or (= |~#commands~0.base| |old(~global~0.base)|) (= (select |#valid| |~#commands~0.base|) 1))} is VALID [2022-02-20 23:38:24,363 INFO L290 TraceCheckUtils]: 44: Hoare triple {45777#(or (= |~#commands~0.base| |old(~global~0.base)|) (= (select |#valid| |~#commands~0.base|) 1))} assume { :end_inline_##fun~~TO~VOID } true;havoc #t~mem6#1.base, #t~mem6#1.offset; {45777#(or (= |~#commands~0.base| |old(~global~0.base)|) (= (select |#valid| |~#commands~0.base|) 1))} is VALID [2022-02-20 23:38:24,363 INFO L290 TraceCheckUtils]: 45: Hoare triple {45777#(or (= |~#commands~0.base| |old(~global~0.base)|) (= (select |#valid| |~#commands~0.base|) 1))} assume true; {45777#(or (= |~#commands~0.base| |old(~global~0.base)|) (= (select |#valid| |~#commands~0.base|) 1))} is VALID [2022-02-20 23:38:24,364 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {45777#(or (= |~#commands~0.base| |old(~global~0.base)|) (= (select |#valid| |~#commands~0.base|) 1))} {45746#(not (= ~global~0.base |~#commands~0.base|))} #103#return; {45770#(= (select |#valid| |~#commands~0.base|) 1)} is VALID [2022-02-20 23:38:24,364 INFO L272 TraceCheckUtils]: 47: Hoare triple {45770#(= (select |#valid| |~#commands~0.base|) 1)} call parse_input(5, 0); {45770#(= (select |#valid| |~#commands~0.base|) 1)} is VALID [2022-02-20 23:38:24,365 INFO L290 TraceCheckUtils]: 48: Hoare triple {45770#(= (select |#valid| |~#commands~0.base|) 1)} ~input#1.base, ~input#1.offset := #in~input#1.base, #in~input#1.offset;~i~0#1 := 0; {45770#(= (select |#valid| |~#commands~0.base|) 1)} is VALID [2022-02-20 23:38:24,365 INFO L290 TraceCheckUtils]: 49: Hoare triple {45770#(= (select |#valid| |~#commands~0.base|) 1)} assume !!(~i~0#1 < 2); {45770#(= (select |#valid| |~#commands~0.base|) 1)} is VALID [2022-02-20 23:38:24,365 INFO L290 TraceCheckUtils]: 50: Hoare triple {45770#(= (select |#valid| |~#commands~0.base|) 1)} assume !(1 == #valid[~#commands~0.base]); {45724#false} is VALID [2022-02-20 23:38:24,366 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 17 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-20 23:38:24,366 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:38:24,366 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085109178] [2022-02-20 23:38:24,366 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2085109178] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 23:38:24,366 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1831348857] [2022-02-20 23:38:24,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:38:24,366 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:38:24,367 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:38:24,373 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 23:38:24,374 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-02-20 23:38:24,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:38:24,452 INFO L263 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 23 conjunts are in the unsatisfiable core [2022-02-20 23:38:24,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:38:24,460 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:38:24,602 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-02-20 23:38:24,603 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-02-20 23:38:24,756 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-02-20 23:38:24,756 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-02-20 23:38:24,829 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-02-20 23:38:24,830 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2022-02-20 23:38:24,933 INFO L290 TraceCheckUtils]: 0: Hoare triple {45723#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(3, 1);call write~init~int(99, 1, 0, 1);call write~init~int(49, 1, 1, 1);call write~init~int(0, 1, 2, 1);call #Ultimate.allocInit(3, 2);call write~init~int(99, 2, 0, 1);call write~init~int(50, 2, 1, 1);call write~init~int(0, 2, 2, 1);call #Ultimate.allocInit(3, 3);call write~init~int(99, 3, 0, 1);call write~init~int(49, 3, 1, 1);call write~init~int(0, 3, 2, 1);call #Ultimate.allocInit(3, 4);call write~init~int(99, 4, 0, 1);call write~init~int(49, 4, 1, 1);call write~init~int(0, 4, 2, 1);call #Ultimate.allocInit(3, 5);call write~init~int(99, 5, 0, 1);call write~init~int(50, 5, 1, 1);call write~init~int(0, 5, 2, 1);~state~0 := ~unnamed3~0~STATE_1;~global~0.base, ~global~0.offset := 0, 0;~#commands~0.base, ~#commands~0.offset := 6, 0;call #Ultimate.allocInit(18, 6);call write~init~$Pointer$(1, 0, ~#commands~0.base, ~#commands~0.offset, 4);call write~init~$Pointer$(#funAddr~c1.base, #funAddr~c1.offset, ~#commands~0.base, 4 + ~#commands~0.offset, 4);call write~init~int((if ~unnamed3~0~STATE_1 % 256 <= 127 then ~unnamed3~0~STATE_1 % 256 else ~unnamed3~0~STATE_1 % 256 - 256), ~#commands~0.base, 8 + ~#commands~0.offset, 1);call write~init~$Pointer$(2, 0, ~#commands~0.base, 9 + ~#commands~0.offset, 4);call write~init~$Pointer$(#funAddr~c2.base, #funAddr~c2.offset, ~#commands~0.base, 13 + ~#commands~0.offset, 4);call write~init~int((if ~unnamed3~0~STATE_2 % 256 <= 127 then ~unnamed3~0~STATE_2 % 256 else ~unnamed3~0~STATE_2 % 256 - 256), ~#commands~0.base, 17 + ~#commands~0.offset, 1); {45781#(and (= 6 |~#commands~0.base|) (= (select |#valid| 6) 1))} is VALID [2022-02-20 23:38:24,933 INFO L290 TraceCheckUtils]: 1: Hoare triple {45781#(and (= 6 |~#commands~0.base|) (= (select |#valid| 6) 1))} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1; {45781#(and (= 6 |~#commands~0.base|) (= (select |#valid| 6) 1))} is VALID [2022-02-20 23:38:24,934 INFO L272 TraceCheckUtils]: 2: Hoare triple {45781#(and (= 6 |~#commands~0.base|) (= (select |#valid| 6) 1))} call parse_input(3, 0); {45788#(and (= 6 |~#commands~0.base|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 23:38:24,934 INFO L290 TraceCheckUtils]: 3: Hoare triple {45788#(and (= 6 |~#commands~0.base|) (= |old(#valid)| |#valid|))} ~input#1.base, ~input#1.offset := #in~input#1.base, #in~input#1.offset;~i~0#1 := 0; {45788#(and (= 6 |~#commands~0.base|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 23:38:24,934 INFO L290 TraceCheckUtils]: 4: Hoare triple {45788#(and (= 6 |~#commands~0.base|) (= |old(#valid)| |#valid|))} assume !!(~i~0#1 < 2); {45788#(and (= 6 |~#commands~0.base|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 23:38:24,935 INFO L290 TraceCheckUtils]: 5: Hoare triple {45788#(and (= 6 |~#commands~0.base|) (= |old(#valid)| |#valid|))} SUMMARY for call #t~mem3#1.base, #t~mem3#1.offset := read~$Pointer$(~#commands~0.base, ~#commands~0.offset + 9 * ~i~0#1, 4); srcloc: L693 {45788#(and (= 6 |~#commands~0.base|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 23:38:24,935 INFO L290 TraceCheckUtils]: 6: Hoare triple {45788#(and (= 6 |~#commands~0.base|) (= |old(#valid)| |#valid|))} assume 1 == #valid[#t~mem3#1.base]; {45788#(and (= 6 |~#commands~0.base|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 23:38:24,935 INFO L290 TraceCheckUtils]: 7: Hoare triple {45788#(and (= 6 |~#commands~0.base|) (= |old(#valid)| |#valid|))} assume #t~mem3#1.offset < #length[#t~mem3#1.base] && #t~mem3#1.offset >= 0; {45788#(and (= 6 |~#commands~0.base|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 23:38:24,936 INFO L290 TraceCheckUtils]: 8: Hoare triple {45788#(and (= 6 |~#commands~0.base|) (= |old(#valid)| |#valid|))} assume 1 == #valid[~input#1.base]; {45788#(and (= 6 |~#commands~0.base|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 23:38:24,936 INFO L290 TraceCheckUtils]: 9: Hoare triple {45788#(and (= 6 |~#commands~0.base|) (= |old(#valid)| |#valid|))} assume ~input#1.offset < #length[~input#1.base] && ~input#1.offset >= 0; {45788#(and (= 6 |~#commands~0.base|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 23:38:24,937 INFO L290 TraceCheckUtils]: 10: Hoare triple {45788#(and (= 6 |~#commands~0.base|) (= |old(#valid)| |#valid|))} assume 0 == #t~nondet4#1;havoc #t~mem3#1.base, #t~mem3#1.offset;havoc #t~nondet4#1; {45788#(and (= 6 |~#commands~0.base|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 23:38:24,937 INFO L290 TraceCheckUtils]: 11: Hoare triple {45788#(and (= 6 |~#commands~0.base|) (= |old(#valid)| |#valid|))} SUMMARY for call #t~mem5#1 := read~int(~#commands~0.base, 8 + (~#commands~0.offset + 9 * ~i~0#1), 1); srcloc: L694 {45788#(and (= 6 |~#commands~0.base|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 23:38:24,937 INFO L290 TraceCheckUtils]: 12: Hoare triple {45788#(and (= 6 |~#commands~0.base|) (= |old(#valid)| |#valid|))} assume ~state~0 >= #t~mem5#1;havoc #t~mem5#1; {45788#(and (= 6 |~#commands~0.base|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 23:38:24,938 INFO L290 TraceCheckUtils]: 13: Hoare triple {45788#(and (= 6 |~#commands~0.base|) (= |old(#valid)| |#valid|))} SUMMARY for call #t~mem6#1.base, #t~mem6#1.offset := read~$Pointer$(~#commands~0.base, 4 + (~#commands~0.offset + 9 * ~i~0#1), 4); srcloc: L695 {45788#(and (= 6 |~#commands~0.base|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 23:38:24,938 INFO L290 TraceCheckUtils]: 14: Hoare triple {45788#(and (= 6 |~#commands~0.base|) (= |old(#valid)| |#valid|))} assume { :begin_inline_##fun~~TO~VOID } true;##fun~~TO~VOID_#in~#fp#1.base, ##fun~~TO~VOID_#in~#fp#1.offset := #t~mem6#1.base, #t~mem6#1.offset; {45788#(and (= 6 |~#commands~0.base|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 23:38:24,938 INFO L290 TraceCheckUtils]: 15: Hoare triple {45788#(and (= 6 |~#commands~0.base|) (= |old(#valid)| |#valid|))} assume !(##fun~~TO~VOID_#in~#fp#1.base == #funAddr~c2.base && ##fun~~TO~VOID_#in~#fp#1.offset == #funAddr~c2.offset);assume { :begin_inline_c1 } true;havoc c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset, c1_~x~0#1.base, c1_~x~0#1.offset;call c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset := #Ultimate.allocOnHeap(1);c1_~x~0#1.base, c1_~x~0#1.offset := c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset;havoc c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset; {45828#(and (= 6 |~#commands~0.base|) (= (select |old(#valid)| |parse_input_c1_~x~0#1.base|) 0))} is VALID [2022-02-20 23:38:24,939 INFO L290 TraceCheckUtils]: 16: Hoare triple {45828#(and (= 6 |~#commands~0.base|) (= (select |old(#valid)| |parse_input_c1_~x~0#1.base|) 0))} assume !(c1_~x~0#1.base == 0 && c1_~x~0#1.offset == 0); {45828#(and (= 6 |~#commands~0.base|) (= (select |old(#valid)| |parse_input_c1_~x~0#1.base|) 0))} is VALID [2022-02-20 23:38:24,939 INFO L290 TraceCheckUtils]: 17: Hoare triple {45828#(and (= 6 |~#commands~0.base|) (= (select |old(#valid)| |parse_input_c1_~x~0#1.base|) 0))} assume !(~global~0.base != 0 || ~global~0.offset != 0); {45828#(and (= 6 |~#commands~0.base|) (= (select |old(#valid)| |parse_input_c1_~x~0#1.base|) 0))} is VALID [2022-02-20 23:38:24,939 INFO L290 TraceCheckUtils]: 18: Hoare triple {45828#(and (= 6 |~#commands~0.base|) (= (select |old(#valid)| |parse_input_c1_~x~0#1.base|) 0))} ~global~0.base, ~global~0.offset := c1_~x~0#1.base, c1_~x~0#1.offset;~state~0 := ~unnamed3~0~STATE_2; {45838#(and (= (select |old(#valid)| ~global~0.base) 0) (= 6 |~#commands~0.base|))} is VALID [2022-02-20 23:38:24,940 INFO L290 TraceCheckUtils]: 19: Hoare triple {45838#(and (= (select |old(#valid)| ~global~0.base) 0) (= 6 |~#commands~0.base|))} assume { :end_inline_c1 } true; {45838#(and (= (select |old(#valid)| ~global~0.base) 0) (= 6 |~#commands~0.base|))} is VALID [2022-02-20 23:38:24,940 INFO L290 TraceCheckUtils]: 20: Hoare triple {45838#(and (= (select |old(#valid)| ~global~0.base) 0) (= 6 |~#commands~0.base|))} assume { :end_inline_##fun~~TO~VOID } true;havoc #t~mem6#1.base, #t~mem6#1.offset; {45838#(and (= (select |old(#valid)| ~global~0.base) 0) (= 6 |~#commands~0.base|))} is VALID [2022-02-20 23:38:24,940 INFO L290 TraceCheckUtils]: 21: Hoare triple {45838#(and (= (select |old(#valid)| ~global~0.base) 0) (= 6 |~#commands~0.base|))} assume true; {45838#(and (= (select |old(#valid)| ~global~0.base) 0) (= 6 |~#commands~0.base|))} is VALID [2022-02-20 23:38:24,941 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {45838#(and (= (select |old(#valid)| ~global~0.base) 0) (= 6 |~#commands~0.base|))} {45781#(and (= 6 |~#commands~0.base|) (= (select |#valid| 6) 1))} #101#return; {45851#(and (= 6 |~#commands~0.base|) (not (= ~global~0.base 6)))} is VALID [2022-02-20 23:38:24,941 INFO L272 TraceCheckUtils]: 23: Hoare triple {45851#(and (= 6 |~#commands~0.base|) (not (= ~global~0.base 6)))} call parse_input(4, 0); {45855#(and (= ~global~0.base |old(~global~0.base)|) (= 6 |~#commands~0.base|))} is VALID [2022-02-20 23:38:24,942 INFO L290 TraceCheckUtils]: 24: Hoare triple {45855#(and (= ~global~0.base |old(~global~0.base)|) (= 6 |~#commands~0.base|))} ~input#1.base, ~input#1.offset := #in~input#1.base, #in~input#1.offset;~i~0#1 := 0; {45855#(and (= ~global~0.base |old(~global~0.base)|) (= 6 |~#commands~0.base|))} is VALID [2022-02-20 23:38:24,942 INFO L290 TraceCheckUtils]: 25: Hoare triple {45855#(and (= ~global~0.base |old(~global~0.base)|) (= 6 |~#commands~0.base|))} assume !!(~i~0#1 < 2); {45855#(and (= ~global~0.base |old(~global~0.base)|) (= 6 |~#commands~0.base|))} is VALID [2022-02-20 23:38:24,943 INFO L290 TraceCheckUtils]: 26: Hoare triple {45855#(and (= ~global~0.base |old(~global~0.base)|) (= 6 |~#commands~0.base|))} SUMMARY for call #t~mem3#1.base, #t~mem3#1.offset := read~$Pointer$(~#commands~0.base, ~#commands~0.offset + 9 * ~i~0#1, 4); srcloc: L693 {45865#(and (= ~global~0.base |old(~global~0.base)|) (= 6 |~#commands~0.base|) (= (select |#valid| |~#commands~0.base|) 1))} is VALID [2022-02-20 23:38:24,943 INFO L290 TraceCheckUtils]: 27: Hoare triple {45865#(and (= ~global~0.base |old(~global~0.base)|) (= 6 |~#commands~0.base|) (= (select |#valid| |~#commands~0.base|) 1))} assume 1 == #valid[#t~mem3#1.base]; {45865#(and (= ~global~0.base |old(~global~0.base)|) (= 6 |~#commands~0.base|) (= (select |#valid| |~#commands~0.base|) 1))} is VALID [2022-02-20 23:38:24,948 INFO L290 TraceCheckUtils]: 28: Hoare triple {45865#(and (= ~global~0.base |old(~global~0.base)|) (= 6 |~#commands~0.base|) (= (select |#valid| |~#commands~0.base|) 1))} assume #t~mem3#1.offset < #length[#t~mem3#1.base] && #t~mem3#1.offset >= 0; {45865#(and (= ~global~0.base |old(~global~0.base)|) (= 6 |~#commands~0.base|) (= (select |#valid| |~#commands~0.base|) 1))} is VALID [2022-02-20 23:38:24,949 INFO L290 TraceCheckUtils]: 29: Hoare triple {45865#(and (= ~global~0.base |old(~global~0.base)|) (= 6 |~#commands~0.base|) (= (select |#valid| |~#commands~0.base|) 1))} assume 1 == #valid[~input#1.base]; {45865#(and (= ~global~0.base |old(~global~0.base)|) (= 6 |~#commands~0.base|) (= (select |#valid| |~#commands~0.base|) 1))} is VALID [2022-02-20 23:38:24,949 INFO L290 TraceCheckUtils]: 30: Hoare triple {45865#(and (= ~global~0.base |old(~global~0.base)|) (= 6 |~#commands~0.base|) (= (select |#valid| |~#commands~0.base|) 1))} assume ~input#1.offset < #length[~input#1.base] && ~input#1.offset >= 0; {45865#(and (= ~global~0.base |old(~global~0.base)|) (= 6 |~#commands~0.base|) (= (select |#valid| |~#commands~0.base|) 1))} is VALID [2022-02-20 23:38:24,950 INFO L290 TraceCheckUtils]: 31: Hoare triple {45865#(and (= ~global~0.base |old(~global~0.base)|) (= 6 |~#commands~0.base|) (= (select |#valid| |~#commands~0.base|) 1))} assume 0 == #t~nondet4#1;havoc #t~mem3#1.base, #t~mem3#1.offset;havoc #t~nondet4#1; {45865#(and (= ~global~0.base |old(~global~0.base)|) (= 6 |~#commands~0.base|) (= (select |#valid| |~#commands~0.base|) 1))} is VALID [2022-02-20 23:38:24,950 INFO L290 TraceCheckUtils]: 32: Hoare triple {45865#(and (= ~global~0.base |old(~global~0.base)|) (= 6 |~#commands~0.base|) (= (select |#valid| |~#commands~0.base|) 1))} SUMMARY for call #t~mem5#1 := read~int(~#commands~0.base, 8 + (~#commands~0.offset + 9 * ~i~0#1), 1); srcloc: L694 {45865#(and (= ~global~0.base |old(~global~0.base)|) (= 6 |~#commands~0.base|) (= (select |#valid| |~#commands~0.base|) 1))} is VALID [2022-02-20 23:38:24,950 INFO L290 TraceCheckUtils]: 33: Hoare triple {45865#(and (= ~global~0.base |old(~global~0.base)|) (= 6 |~#commands~0.base|) (= (select |#valid| |~#commands~0.base|) 1))} assume ~state~0 >= #t~mem5#1;havoc #t~mem5#1; {45865#(and (= ~global~0.base |old(~global~0.base)|) (= 6 |~#commands~0.base|) (= (select |#valid| |~#commands~0.base|) 1))} is VALID [2022-02-20 23:38:24,951 INFO L290 TraceCheckUtils]: 34: Hoare triple {45865#(and (= ~global~0.base |old(~global~0.base)|) (= 6 |~#commands~0.base|) (= (select |#valid| |~#commands~0.base|) 1))} SUMMARY for call #t~mem6#1.base, #t~mem6#1.offset := read~$Pointer$(~#commands~0.base, 4 + (~#commands~0.offset + 9 * ~i~0#1), 4); srcloc: L695 {45865#(and (= ~global~0.base |old(~global~0.base)|) (= 6 |~#commands~0.base|) (= (select |#valid| |~#commands~0.base|) 1))} is VALID [2022-02-20 23:38:24,951 INFO L290 TraceCheckUtils]: 35: Hoare triple {45865#(and (= ~global~0.base |old(~global~0.base)|) (= 6 |~#commands~0.base|) (= (select |#valid| |~#commands~0.base|) 1))} assume { :begin_inline_##fun~~TO~VOID } true;##fun~~TO~VOID_#in~#fp#1.base, ##fun~~TO~VOID_#in~#fp#1.offset := #t~mem6#1.base, #t~mem6#1.offset; {45865#(and (= ~global~0.base |old(~global~0.base)|) (= 6 |~#commands~0.base|) (= (select |#valid| |~#commands~0.base|) 1))} is VALID [2022-02-20 23:38:24,952 INFO L290 TraceCheckUtils]: 36: Hoare triple {45865#(and (= ~global~0.base |old(~global~0.base)|) (= 6 |~#commands~0.base|) (= (select |#valid| |~#commands~0.base|) 1))} assume !(##fun~~TO~VOID_#in~#fp#1.base == #funAddr~c2.base && ##fun~~TO~VOID_#in~#fp#1.offset == #funAddr~c2.offset);assume { :begin_inline_c1 } true;havoc c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset, c1_~x~0#1.base, c1_~x~0#1.offset;call c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset := #Ultimate.allocOnHeap(1);c1_~x~0#1.base, c1_~x~0#1.offset := c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset;havoc c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset; {45865#(and (= ~global~0.base |old(~global~0.base)|) (= 6 |~#commands~0.base|) (= (select |#valid| |~#commands~0.base|) 1))} is VALID [2022-02-20 23:38:24,952 INFO L290 TraceCheckUtils]: 37: Hoare triple {45865#(and (= ~global~0.base |old(~global~0.base)|) (= 6 |~#commands~0.base|) (= (select |#valid| |~#commands~0.base|) 1))} assume !(c1_~x~0#1.base == 0 && c1_~x~0#1.offset == 0); {45865#(and (= ~global~0.base |old(~global~0.base)|) (= 6 |~#commands~0.base|) (= (select |#valid| |~#commands~0.base|) 1))} is VALID [2022-02-20 23:38:24,952 INFO L290 TraceCheckUtils]: 38: Hoare triple {45865#(and (= ~global~0.base |old(~global~0.base)|) (= 6 |~#commands~0.base|) (= (select |#valid| |~#commands~0.base|) 1))} assume ~global~0.base != 0 || ~global~0.offset != 0; {45865#(and (= ~global~0.base |old(~global~0.base)|) (= 6 |~#commands~0.base|) (= (select |#valid| |~#commands~0.base|) 1))} is VALID [2022-02-20 23:38:24,953 INFO L290 TraceCheckUtils]: 39: Hoare triple {45865#(and (= ~global~0.base |old(~global~0.base)|) (= 6 |~#commands~0.base|) (= (select |#valid| |~#commands~0.base|) 1))} assume 0 == ~global~0.offset; {45865#(and (= ~global~0.base |old(~global~0.base)|) (= 6 |~#commands~0.base|) (= (select |#valid| |~#commands~0.base|) 1))} is VALID [2022-02-20 23:38:24,953 INFO L290 TraceCheckUtils]: 40: Hoare triple {45865#(and (= ~global~0.base |old(~global~0.base)|) (= 6 |~#commands~0.base|) (= (select |#valid| |~#commands~0.base|) 1))} assume ~global~0.base < #StackHeapBarrier; {45865#(and (= ~global~0.base |old(~global~0.base)|) (= 6 |~#commands~0.base|) (= (select |#valid| |~#commands~0.base|) 1))} is VALID [2022-02-20 23:38:24,954 INFO L290 TraceCheckUtils]: 41: Hoare triple {45865#(and (= ~global~0.base |old(~global~0.base)|) (= 6 |~#commands~0.base|) (= (select |#valid| |~#commands~0.base|) 1))} assume 0 == ~global~0.base || 1 == #valid[~global~0.base];call ULTIMATE.dealloc(~global~0.base, ~global~0.offset); {45911#(and (= 6 |~#commands~0.base|) (or (= |~#commands~0.base| |old(~global~0.base)|) (= (select |#valid| |~#commands~0.base|) 1)))} is VALID [2022-02-20 23:38:24,954 INFO L290 TraceCheckUtils]: 42: Hoare triple {45911#(and (= 6 |~#commands~0.base|) (or (= |~#commands~0.base| |old(~global~0.base)|) (= (select |#valid| |~#commands~0.base|) 1)))} ~global~0.base, ~global~0.offset := c1_~x~0#1.base, c1_~x~0#1.offset;~state~0 := ~unnamed3~0~STATE_2; {45911#(and (= 6 |~#commands~0.base|) (or (= |~#commands~0.base| |old(~global~0.base)|) (= (select |#valid| |~#commands~0.base|) 1)))} is VALID [2022-02-20 23:38:24,954 INFO L290 TraceCheckUtils]: 43: Hoare triple {45911#(and (= 6 |~#commands~0.base|) (or (= |~#commands~0.base| |old(~global~0.base)|) (= (select |#valid| |~#commands~0.base|) 1)))} assume { :end_inline_c1 } true; {45911#(and (= 6 |~#commands~0.base|) (or (= |~#commands~0.base| |old(~global~0.base)|) (= (select |#valid| |~#commands~0.base|) 1)))} is VALID [2022-02-20 23:38:24,955 INFO L290 TraceCheckUtils]: 44: Hoare triple {45911#(and (= 6 |~#commands~0.base|) (or (= |~#commands~0.base| |old(~global~0.base)|) (= (select |#valid| |~#commands~0.base|) 1)))} assume { :end_inline_##fun~~TO~VOID } true;havoc #t~mem6#1.base, #t~mem6#1.offset; {45911#(and (= 6 |~#commands~0.base|) (or (= |~#commands~0.base| |old(~global~0.base)|) (= (select |#valid| |~#commands~0.base|) 1)))} is VALID [2022-02-20 23:38:24,955 INFO L290 TraceCheckUtils]: 45: Hoare triple {45911#(and (= 6 |~#commands~0.base|) (or (= |~#commands~0.base| |old(~global~0.base)|) (= (select |#valid| |~#commands~0.base|) 1)))} assume true; {45911#(and (= 6 |~#commands~0.base|) (or (= |~#commands~0.base| |old(~global~0.base)|) (= (select |#valid| |~#commands~0.base|) 1)))} is VALID [2022-02-20 23:38:24,956 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {45911#(and (= 6 |~#commands~0.base|) (or (= |~#commands~0.base| |old(~global~0.base)|) (= (select |#valid| |~#commands~0.base|) 1)))} {45851#(and (= 6 |~#commands~0.base|) (not (= ~global~0.base 6)))} #103#return; {45781#(and (= 6 |~#commands~0.base|) (= (select |#valid| 6) 1))} is VALID [2022-02-20 23:38:24,956 INFO L272 TraceCheckUtils]: 47: Hoare triple {45781#(and (= 6 |~#commands~0.base|) (= (select |#valid| 6) 1))} call parse_input(5, 0); {45781#(and (= 6 |~#commands~0.base|) (= (select |#valid| 6) 1))} is VALID [2022-02-20 23:38:24,956 INFO L290 TraceCheckUtils]: 48: Hoare triple {45781#(and (= 6 |~#commands~0.base|) (= (select |#valid| 6) 1))} ~input#1.base, ~input#1.offset := #in~input#1.base, #in~input#1.offset;~i~0#1 := 0; {45781#(and (= 6 |~#commands~0.base|) (= (select |#valid| 6) 1))} is VALID [2022-02-20 23:38:24,957 INFO L290 TraceCheckUtils]: 49: Hoare triple {45781#(and (= 6 |~#commands~0.base|) (= (select |#valid| 6) 1))} assume !!(~i~0#1 < 2); {45781#(and (= 6 |~#commands~0.base|) (= (select |#valid| 6) 1))} is VALID [2022-02-20 23:38:24,957 INFO L290 TraceCheckUtils]: 50: Hoare triple {45781#(and (= 6 |~#commands~0.base|) (= (select |#valid| 6) 1))} assume !(1 == #valid[~#commands~0.base]); {45724#false} is VALID [2022-02-20 23:38:24,957 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:38:24,957 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:38:25,149 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-02-20 23:38:25,149 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 110 treesize of output 105 [2022-02-20 23:38:25,988 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-02-20 23:38:25,989 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 110 treesize of output 105 [2022-02-20 23:38:26,253 INFO L290 TraceCheckUtils]: 50: Hoare triple {45770#(= (select |#valid| |~#commands~0.base|) 1)} assume !(1 == #valid[~#commands~0.base]); {45724#false} is VALID [2022-02-20 23:38:26,253 INFO L290 TraceCheckUtils]: 49: Hoare triple {45770#(= (select |#valid| |~#commands~0.base|) 1)} assume !!(~i~0#1 < 2); {45770#(= (select |#valid| |~#commands~0.base|) 1)} is VALID [2022-02-20 23:38:26,253 INFO L290 TraceCheckUtils]: 48: Hoare triple {45770#(= (select |#valid| |~#commands~0.base|) 1)} ~input#1.base, ~input#1.offset := #in~input#1.base, #in~input#1.offset;~i~0#1 := 0; {45770#(= (select |#valid| |~#commands~0.base|) 1)} is VALID [2022-02-20 23:38:26,254 INFO L272 TraceCheckUtils]: 47: Hoare triple {45770#(= (select |#valid| |~#commands~0.base|) 1)} call parse_input(5, 0); {45770#(= (select |#valid| |~#commands~0.base|) 1)} is VALID [2022-02-20 23:38:26,254 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {45777#(or (= |~#commands~0.base| |old(~global~0.base)|) (= (select |#valid| |~#commands~0.base|) 1))} {45746#(not (= ~global~0.base |~#commands~0.base|))} #103#return; {45770#(= (select |#valid| |~#commands~0.base|) 1)} is VALID [2022-02-20 23:38:26,255 INFO L290 TraceCheckUtils]: 45: Hoare triple {45777#(or (= |~#commands~0.base| |old(~global~0.base)|) (= (select |#valid| |~#commands~0.base|) 1))} assume true; {45777#(or (= |~#commands~0.base| |old(~global~0.base)|) (= (select |#valid| |~#commands~0.base|) 1))} is VALID [2022-02-20 23:38:26,255 INFO L290 TraceCheckUtils]: 44: Hoare triple {45777#(or (= |~#commands~0.base| |old(~global~0.base)|) (= (select |#valid| |~#commands~0.base|) 1))} assume { :end_inline_##fun~~TO~VOID } true;havoc #t~mem6#1.base, #t~mem6#1.offset; {45777#(or (= |~#commands~0.base| |old(~global~0.base)|) (= (select |#valid| |~#commands~0.base|) 1))} is VALID [2022-02-20 23:38:26,255 INFO L290 TraceCheckUtils]: 43: Hoare triple {45777#(or (= |~#commands~0.base| |old(~global~0.base)|) (= (select |#valid| |~#commands~0.base|) 1))} assume { :end_inline_c1 } true; {45777#(or (= |~#commands~0.base| |old(~global~0.base)|) (= (select |#valid| |~#commands~0.base|) 1))} is VALID [2022-02-20 23:38:26,255 INFO L290 TraceCheckUtils]: 42: Hoare triple {45777#(or (= |~#commands~0.base| |old(~global~0.base)|) (= (select |#valid| |~#commands~0.base|) 1))} ~global~0.base, ~global~0.offset := c1_~x~0#1.base, c1_~x~0#1.offset;~state~0 := ~unnamed3~0~STATE_2; {45777#(or (= |~#commands~0.base| |old(~global~0.base)|) (= (select |#valid| |~#commands~0.base|) 1))} is VALID [2022-02-20 23:38:26,256 INFO L290 TraceCheckUtils]: 41: Hoare triple {45969#(or (forall ((v_ArrVal_140 Int)) (= 1 (select (store |#valid| ~global~0.base v_ArrVal_140) |~#commands~0.base|))) (= |~#commands~0.base| |old(~global~0.base)|))} assume 0 == ~global~0.base || 1 == #valid[~global~0.base];call ULTIMATE.dealloc(~global~0.base, ~global~0.offset); {45777#(or (= |~#commands~0.base| |old(~global~0.base)|) (= (select |#valid| |~#commands~0.base|) 1))} is VALID [2022-02-20 23:38:26,256 INFO L290 TraceCheckUtils]: 40: Hoare triple {45969#(or (forall ((v_ArrVal_140 Int)) (= 1 (select (store |#valid| ~global~0.base v_ArrVal_140) |~#commands~0.base|))) (= |~#commands~0.base| |old(~global~0.base)|))} assume ~global~0.base < #StackHeapBarrier; {45969#(or (forall ((v_ArrVal_140 Int)) (= 1 (select (store |#valid| ~global~0.base v_ArrVal_140) |~#commands~0.base|))) (= |~#commands~0.base| |old(~global~0.base)|))} is VALID [2022-02-20 23:38:26,257 INFO L290 TraceCheckUtils]: 39: Hoare triple {45969#(or (forall ((v_ArrVal_140 Int)) (= 1 (select (store |#valid| ~global~0.base v_ArrVal_140) |~#commands~0.base|))) (= |~#commands~0.base| |old(~global~0.base)|))} assume 0 == ~global~0.offset; {45969#(or (forall ((v_ArrVal_140 Int)) (= 1 (select (store |#valid| ~global~0.base v_ArrVal_140) |~#commands~0.base|))) (= |~#commands~0.base| |old(~global~0.base)|))} is VALID [2022-02-20 23:38:26,257 INFO L290 TraceCheckUtils]: 38: Hoare triple {45969#(or (forall ((v_ArrVal_140 Int)) (= 1 (select (store |#valid| ~global~0.base v_ArrVal_140) |~#commands~0.base|))) (= |~#commands~0.base| |old(~global~0.base)|))} assume ~global~0.base != 0 || ~global~0.offset != 0; {45969#(or (forall ((v_ArrVal_140 Int)) (= 1 (select (store |#valid| ~global~0.base v_ArrVal_140) |~#commands~0.base|))) (= |~#commands~0.base| |old(~global~0.base)|))} is VALID [2022-02-20 23:38:26,257 INFO L290 TraceCheckUtils]: 37: Hoare triple {45969#(or (forall ((v_ArrVal_140 Int)) (= 1 (select (store |#valid| ~global~0.base v_ArrVal_140) |~#commands~0.base|))) (= |~#commands~0.base| |old(~global~0.base)|))} assume !(c1_~x~0#1.base == 0 && c1_~x~0#1.offset == 0); {45969#(or (forall ((v_ArrVal_140 Int)) (= 1 (select (store |#valid| ~global~0.base v_ArrVal_140) |~#commands~0.base|))) (= |~#commands~0.base| |old(~global~0.base)|))} is VALID [2022-02-20 23:38:26,260 INFO L290 TraceCheckUtils]: 36: Hoare triple {45985#(or (= |~#commands~0.base| |old(~global~0.base)|) (forall ((|v_parse_input_c1_~x~0#1.base_47| Int) (v_ArrVal_140 Int) (v_ArrVal_139 Int)) (or (not (= (select |#valid| |v_parse_input_c1_~x~0#1.base_47|) 0)) (= (select (store (store |#valid| |v_parse_input_c1_~x~0#1.base_47| v_ArrVal_139) ~global~0.base v_ArrVal_140) |~#commands~0.base|) 1))))} assume !(##fun~~TO~VOID_#in~#fp#1.base == #funAddr~c2.base && ##fun~~TO~VOID_#in~#fp#1.offset == #funAddr~c2.offset);assume { :begin_inline_c1 } true;havoc c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset, c1_~x~0#1.base, c1_~x~0#1.offset;call c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset := #Ultimate.allocOnHeap(1);c1_~x~0#1.base, c1_~x~0#1.offset := c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset;havoc c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset; {45969#(or (forall ((v_ArrVal_140 Int)) (= 1 (select (store |#valid| ~global~0.base v_ArrVal_140) |~#commands~0.base|))) (= |~#commands~0.base| |old(~global~0.base)|))} is VALID [2022-02-20 23:38:26,260 INFO L290 TraceCheckUtils]: 35: Hoare triple {45985#(or (= |~#commands~0.base| |old(~global~0.base)|) (forall ((|v_parse_input_c1_~x~0#1.base_47| Int) (v_ArrVal_140 Int) (v_ArrVal_139 Int)) (or (not (= (select |#valid| |v_parse_input_c1_~x~0#1.base_47|) 0)) (= (select (store (store |#valid| |v_parse_input_c1_~x~0#1.base_47| v_ArrVal_139) ~global~0.base v_ArrVal_140) |~#commands~0.base|) 1))))} assume { :begin_inline_##fun~~TO~VOID } true;##fun~~TO~VOID_#in~#fp#1.base, ##fun~~TO~VOID_#in~#fp#1.offset := #t~mem6#1.base, #t~mem6#1.offset; {45985#(or (= |~#commands~0.base| |old(~global~0.base)|) (forall ((|v_parse_input_c1_~x~0#1.base_47| Int) (v_ArrVal_140 Int) (v_ArrVal_139 Int)) (or (not (= (select |#valid| |v_parse_input_c1_~x~0#1.base_47|) 0)) (= (select (store (store |#valid| |v_parse_input_c1_~x~0#1.base_47| v_ArrVal_139) ~global~0.base v_ArrVal_140) |~#commands~0.base|) 1))))} is VALID [2022-02-20 23:38:26,262 INFO L290 TraceCheckUtils]: 34: Hoare triple {45985#(or (= |~#commands~0.base| |old(~global~0.base)|) (forall ((|v_parse_input_c1_~x~0#1.base_47| Int) (v_ArrVal_140 Int) (v_ArrVal_139 Int)) (or (not (= (select |#valid| |v_parse_input_c1_~x~0#1.base_47|) 0)) (= (select (store (store |#valid| |v_parse_input_c1_~x~0#1.base_47| v_ArrVal_139) ~global~0.base v_ArrVal_140) |~#commands~0.base|) 1))))} SUMMARY for call #t~mem6#1.base, #t~mem6#1.offset := read~$Pointer$(~#commands~0.base, 4 + (~#commands~0.offset + 9 * ~i~0#1), 4); srcloc: L695 {45985#(or (= |~#commands~0.base| |old(~global~0.base)|) (forall ((|v_parse_input_c1_~x~0#1.base_47| Int) (v_ArrVal_140 Int) (v_ArrVal_139 Int)) (or (not (= (select |#valid| |v_parse_input_c1_~x~0#1.base_47|) 0)) (= (select (store (store |#valid| |v_parse_input_c1_~x~0#1.base_47| v_ArrVal_139) ~global~0.base v_ArrVal_140) |~#commands~0.base|) 1))))} is VALID [2022-02-20 23:38:26,263 INFO L290 TraceCheckUtils]: 33: Hoare triple {45985#(or (= |~#commands~0.base| |old(~global~0.base)|) (forall ((|v_parse_input_c1_~x~0#1.base_47| Int) (v_ArrVal_140 Int) (v_ArrVal_139 Int)) (or (not (= (select |#valid| |v_parse_input_c1_~x~0#1.base_47|) 0)) (= (select (store (store |#valid| |v_parse_input_c1_~x~0#1.base_47| v_ArrVal_139) ~global~0.base v_ArrVal_140) |~#commands~0.base|) 1))))} assume ~state~0 >= #t~mem5#1;havoc #t~mem5#1; {45985#(or (= |~#commands~0.base| |old(~global~0.base)|) (forall ((|v_parse_input_c1_~x~0#1.base_47| Int) (v_ArrVal_140 Int) (v_ArrVal_139 Int)) (or (not (= (select |#valid| |v_parse_input_c1_~x~0#1.base_47|) 0)) (= (select (store (store |#valid| |v_parse_input_c1_~x~0#1.base_47| v_ArrVal_139) ~global~0.base v_ArrVal_140) |~#commands~0.base|) 1))))} is VALID [2022-02-20 23:38:26,264 INFO L290 TraceCheckUtils]: 32: Hoare triple {45985#(or (= |~#commands~0.base| |old(~global~0.base)|) (forall ((|v_parse_input_c1_~x~0#1.base_47| Int) (v_ArrVal_140 Int) (v_ArrVal_139 Int)) (or (not (= (select |#valid| |v_parse_input_c1_~x~0#1.base_47|) 0)) (= (select (store (store |#valid| |v_parse_input_c1_~x~0#1.base_47| v_ArrVal_139) ~global~0.base v_ArrVal_140) |~#commands~0.base|) 1))))} SUMMARY for call #t~mem5#1 := read~int(~#commands~0.base, 8 + (~#commands~0.offset + 9 * ~i~0#1), 1); srcloc: L694 {45985#(or (= |~#commands~0.base| |old(~global~0.base)|) (forall ((|v_parse_input_c1_~x~0#1.base_47| Int) (v_ArrVal_140 Int) (v_ArrVal_139 Int)) (or (not (= (select |#valid| |v_parse_input_c1_~x~0#1.base_47|) 0)) (= (select (store (store |#valid| |v_parse_input_c1_~x~0#1.base_47| v_ArrVal_139) ~global~0.base v_ArrVal_140) |~#commands~0.base|) 1))))} is VALID [2022-02-20 23:38:26,264 INFO L290 TraceCheckUtils]: 31: Hoare triple {45985#(or (= |~#commands~0.base| |old(~global~0.base)|) (forall ((|v_parse_input_c1_~x~0#1.base_47| Int) (v_ArrVal_140 Int) (v_ArrVal_139 Int)) (or (not (= (select |#valid| |v_parse_input_c1_~x~0#1.base_47|) 0)) (= (select (store (store |#valid| |v_parse_input_c1_~x~0#1.base_47| v_ArrVal_139) ~global~0.base v_ArrVal_140) |~#commands~0.base|) 1))))} assume 0 == #t~nondet4#1;havoc #t~mem3#1.base, #t~mem3#1.offset;havoc #t~nondet4#1; {45985#(or (= |~#commands~0.base| |old(~global~0.base)|) (forall ((|v_parse_input_c1_~x~0#1.base_47| Int) (v_ArrVal_140 Int) (v_ArrVal_139 Int)) (or (not (= (select |#valid| |v_parse_input_c1_~x~0#1.base_47|) 0)) (= (select (store (store |#valid| |v_parse_input_c1_~x~0#1.base_47| v_ArrVal_139) ~global~0.base v_ArrVal_140) |~#commands~0.base|) 1))))} is VALID [2022-02-20 23:38:26,265 INFO L290 TraceCheckUtils]: 30: Hoare triple {45985#(or (= |~#commands~0.base| |old(~global~0.base)|) (forall ((|v_parse_input_c1_~x~0#1.base_47| Int) (v_ArrVal_140 Int) (v_ArrVal_139 Int)) (or (not (= (select |#valid| |v_parse_input_c1_~x~0#1.base_47|) 0)) (= (select (store (store |#valid| |v_parse_input_c1_~x~0#1.base_47| v_ArrVal_139) ~global~0.base v_ArrVal_140) |~#commands~0.base|) 1))))} assume ~input#1.offset < #length[~input#1.base] && ~input#1.offset >= 0; {45985#(or (= |~#commands~0.base| |old(~global~0.base)|) (forall ((|v_parse_input_c1_~x~0#1.base_47| Int) (v_ArrVal_140 Int) (v_ArrVal_139 Int)) (or (not (= (select |#valid| |v_parse_input_c1_~x~0#1.base_47|) 0)) (= (select (store (store |#valid| |v_parse_input_c1_~x~0#1.base_47| v_ArrVal_139) ~global~0.base v_ArrVal_140) |~#commands~0.base|) 1))))} is VALID [2022-02-20 23:38:26,266 INFO L290 TraceCheckUtils]: 29: Hoare triple {45985#(or (= |~#commands~0.base| |old(~global~0.base)|) (forall ((|v_parse_input_c1_~x~0#1.base_47| Int) (v_ArrVal_140 Int) (v_ArrVal_139 Int)) (or (not (= (select |#valid| |v_parse_input_c1_~x~0#1.base_47|) 0)) (= (select (store (store |#valid| |v_parse_input_c1_~x~0#1.base_47| v_ArrVal_139) ~global~0.base v_ArrVal_140) |~#commands~0.base|) 1))))} assume 1 == #valid[~input#1.base]; {45985#(or (= |~#commands~0.base| |old(~global~0.base)|) (forall ((|v_parse_input_c1_~x~0#1.base_47| Int) (v_ArrVal_140 Int) (v_ArrVal_139 Int)) (or (not (= (select |#valid| |v_parse_input_c1_~x~0#1.base_47|) 0)) (= (select (store (store |#valid| |v_parse_input_c1_~x~0#1.base_47| v_ArrVal_139) ~global~0.base v_ArrVal_140) |~#commands~0.base|) 1))))} is VALID [2022-02-20 23:38:26,267 INFO L290 TraceCheckUtils]: 28: Hoare triple {45985#(or (= |~#commands~0.base| |old(~global~0.base)|) (forall ((|v_parse_input_c1_~x~0#1.base_47| Int) (v_ArrVal_140 Int) (v_ArrVal_139 Int)) (or (not (= (select |#valid| |v_parse_input_c1_~x~0#1.base_47|) 0)) (= (select (store (store |#valid| |v_parse_input_c1_~x~0#1.base_47| v_ArrVal_139) ~global~0.base v_ArrVal_140) |~#commands~0.base|) 1))))} assume #t~mem3#1.offset < #length[#t~mem3#1.base] && #t~mem3#1.offset >= 0; {45985#(or (= |~#commands~0.base| |old(~global~0.base)|) (forall ((|v_parse_input_c1_~x~0#1.base_47| Int) (v_ArrVal_140 Int) (v_ArrVal_139 Int)) (or (not (= (select |#valid| |v_parse_input_c1_~x~0#1.base_47|) 0)) (= (select (store (store |#valid| |v_parse_input_c1_~x~0#1.base_47| v_ArrVal_139) ~global~0.base v_ArrVal_140) |~#commands~0.base|) 1))))} is VALID [2022-02-20 23:38:26,268 INFO L290 TraceCheckUtils]: 27: Hoare triple {45985#(or (= |~#commands~0.base| |old(~global~0.base)|) (forall ((|v_parse_input_c1_~x~0#1.base_47| Int) (v_ArrVal_140 Int) (v_ArrVal_139 Int)) (or (not (= (select |#valid| |v_parse_input_c1_~x~0#1.base_47|) 0)) (= (select (store (store |#valid| |v_parse_input_c1_~x~0#1.base_47| v_ArrVal_139) ~global~0.base v_ArrVal_140) |~#commands~0.base|) 1))))} assume 1 == #valid[#t~mem3#1.base]; {45985#(or (= |~#commands~0.base| |old(~global~0.base)|) (forall ((|v_parse_input_c1_~x~0#1.base_47| Int) (v_ArrVal_140 Int) (v_ArrVal_139 Int)) (or (not (= (select |#valid| |v_parse_input_c1_~x~0#1.base_47|) 0)) (= (select (store (store |#valid| |v_parse_input_c1_~x~0#1.base_47| v_ArrVal_139) ~global~0.base v_ArrVal_140) |~#commands~0.base|) 1))))} is VALID [2022-02-20 23:38:26,269 INFO L290 TraceCheckUtils]: 26: Hoare triple {46016#(or (not (= ~global~0.base |~#commands~0.base|)) (= |~#commands~0.base| |old(~global~0.base)|))} SUMMARY for call #t~mem3#1.base, #t~mem3#1.offset := read~$Pointer$(~#commands~0.base, ~#commands~0.offset + 9 * ~i~0#1, 4); srcloc: L693 {45985#(or (= |~#commands~0.base| |old(~global~0.base)|) (forall ((|v_parse_input_c1_~x~0#1.base_47| Int) (v_ArrVal_140 Int) (v_ArrVal_139 Int)) (or (not (= (select |#valid| |v_parse_input_c1_~x~0#1.base_47|) 0)) (= (select (store (store |#valid| |v_parse_input_c1_~x~0#1.base_47| v_ArrVal_139) ~global~0.base v_ArrVal_140) |~#commands~0.base|) 1))))} is VALID [2022-02-20 23:38:26,269 INFO L290 TraceCheckUtils]: 25: Hoare triple {46016#(or (not (= ~global~0.base |~#commands~0.base|)) (= |~#commands~0.base| |old(~global~0.base)|))} assume !!(~i~0#1 < 2); {46016#(or (not (= ~global~0.base |~#commands~0.base|)) (= |~#commands~0.base| |old(~global~0.base)|))} is VALID [2022-02-20 23:38:26,269 INFO L290 TraceCheckUtils]: 24: Hoare triple {46016#(or (not (= ~global~0.base |~#commands~0.base|)) (= |~#commands~0.base| |old(~global~0.base)|))} ~input#1.base, ~input#1.offset := #in~input#1.base, #in~input#1.offset;~i~0#1 := 0; {46016#(or (not (= ~global~0.base |~#commands~0.base|)) (= |~#commands~0.base| |old(~global~0.base)|))} is VALID [2022-02-20 23:38:26,270 INFO L272 TraceCheckUtils]: 23: Hoare triple {45746#(not (= ~global~0.base |~#commands~0.base|))} call parse_input(4, 0); {46016#(or (not (= ~global~0.base |~#commands~0.base|)) (= |~#commands~0.base| |old(~global~0.base)|))} is VALID [2022-02-20 23:38:26,271 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {46030#(or (not (= ~global~0.base |~#commands~0.base|)) (= (select |old(#valid)| |~#commands~0.base|) 0))} {46026#(not (= (select |#valid| |~#commands~0.base|) 0))} #101#return; {45746#(not (= ~global~0.base |~#commands~0.base|))} is VALID [2022-02-20 23:38:26,271 INFO L290 TraceCheckUtils]: 21: Hoare triple {46030#(or (not (= ~global~0.base |~#commands~0.base|)) (= (select |old(#valid)| |~#commands~0.base|) 0))} assume true; {46030#(or (not (= ~global~0.base |~#commands~0.base|)) (= (select |old(#valid)| |~#commands~0.base|) 0))} is VALID [2022-02-20 23:38:26,271 INFO L290 TraceCheckUtils]: 20: Hoare triple {46030#(or (not (= ~global~0.base |~#commands~0.base|)) (= (select |old(#valid)| |~#commands~0.base|) 0))} assume { :end_inline_##fun~~TO~VOID } true;havoc #t~mem6#1.base, #t~mem6#1.offset; {46030#(or (not (= ~global~0.base |~#commands~0.base|)) (= (select |old(#valid)| |~#commands~0.base|) 0))} is VALID [2022-02-20 23:38:26,272 INFO L290 TraceCheckUtils]: 19: Hoare triple {46030#(or (not (= ~global~0.base |~#commands~0.base|)) (= (select |old(#valid)| |~#commands~0.base|) 0))} assume { :end_inline_c1 } true; {46030#(or (not (= ~global~0.base |~#commands~0.base|)) (= (select |old(#valid)| |~#commands~0.base|) 0))} is VALID [2022-02-20 23:38:26,272 INFO L290 TraceCheckUtils]: 18: Hoare triple {46043#(or (not (= |parse_input_c1_~x~0#1.base| |~#commands~0.base|)) (= (select |old(#valid)| |~#commands~0.base|) 0))} ~global~0.base, ~global~0.offset := c1_~x~0#1.base, c1_~x~0#1.offset;~state~0 := ~unnamed3~0~STATE_2; {46030#(or (not (= ~global~0.base |~#commands~0.base|)) (= (select |old(#valid)| |~#commands~0.base|) 0))} is VALID [2022-02-20 23:38:26,272 INFO L290 TraceCheckUtils]: 17: Hoare triple {46043#(or (not (= |parse_input_c1_~x~0#1.base| |~#commands~0.base|)) (= (select |old(#valid)| |~#commands~0.base|) 0))} assume !(~global~0.base != 0 || ~global~0.offset != 0); {46043#(or (not (= |parse_input_c1_~x~0#1.base| |~#commands~0.base|)) (= (select |old(#valid)| |~#commands~0.base|) 0))} is VALID [2022-02-20 23:38:26,272 INFO L290 TraceCheckUtils]: 16: Hoare triple {46043#(or (not (= |parse_input_c1_~x~0#1.base| |~#commands~0.base|)) (= (select |old(#valid)| |~#commands~0.base|) 0))} assume !(c1_~x~0#1.base == 0 && c1_~x~0#1.offset == 0); {46043#(or (not (= |parse_input_c1_~x~0#1.base| |~#commands~0.base|)) (= (select |old(#valid)| |~#commands~0.base|) 0))} is VALID [2022-02-20 23:38:26,273 INFO L290 TraceCheckUtils]: 15: Hoare triple {46053#(or (not (= (select |#valid| |~#commands~0.base|) 0)) (= (select |old(#valid)| |~#commands~0.base|) 0))} assume !(##fun~~TO~VOID_#in~#fp#1.base == #funAddr~c2.base && ##fun~~TO~VOID_#in~#fp#1.offset == #funAddr~c2.offset);assume { :begin_inline_c1 } true;havoc c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset, c1_~x~0#1.base, c1_~x~0#1.offset;call c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset := #Ultimate.allocOnHeap(1);c1_~x~0#1.base, c1_~x~0#1.offset := c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset;havoc c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset; {46043#(or (not (= |parse_input_c1_~x~0#1.base| |~#commands~0.base|)) (= (select |old(#valid)| |~#commands~0.base|) 0))} is VALID [2022-02-20 23:38:26,273 INFO L290 TraceCheckUtils]: 14: Hoare triple {46053#(or (not (= (select |#valid| |~#commands~0.base|) 0)) (= (select |old(#valid)| |~#commands~0.base|) 0))} assume { :begin_inline_##fun~~TO~VOID } true;##fun~~TO~VOID_#in~#fp#1.base, ##fun~~TO~VOID_#in~#fp#1.offset := #t~mem6#1.base, #t~mem6#1.offset; {46053#(or (not (= (select |#valid| |~#commands~0.base|) 0)) (= (select |old(#valid)| |~#commands~0.base|) 0))} is VALID [2022-02-20 23:38:26,274 INFO L290 TraceCheckUtils]: 13: Hoare triple {46053#(or (not (= (select |#valid| |~#commands~0.base|) 0)) (= (select |old(#valid)| |~#commands~0.base|) 0))} SUMMARY for call #t~mem6#1.base, #t~mem6#1.offset := read~$Pointer$(~#commands~0.base, 4 + (~#commands~0.offset + 9 * ~i~0#1), 4); srcloc: L695 {46053#(or (not (= (select |#valid| |~#commands~0.base|) 0)) (= (select |old(#valid)| |~#commands~0.base|) 0))} is VALID [2022-02-20 23:38:26,274 INFO L290 TraceCheckUtils]: 12: Hoare triple {46053#(or (not (= (select |#valid| |~#commands~0.base|) 0)) (= (select |old(#valid)| |~#commands~0.base|) 0))} assume ~state~0 >= #t~mem5#1;havoc #t~mem5#1; {46053#(or (not (= (select |#valid| |~#commands~0.base|) 0)) (= (select |old(#valid)| |~#commands~0.base|) 0))} is VALID [2022-02-20 23:38:26,274 INFO L290 TraceCheckUtils]: 11: Hoare triple {46053#(or (not (= (select |#valid| |~#commands~0.base|) 0)) (= (select |old(#valid)| |~#commands~0.base|) 0))} SUMMARY for call #t~mem5#1 := read~int(~#commands~0.base, 8 + (~#commands~0.offset + 9 * ~i~0#1), 1); srcloc: L694 {46053#(or (not (= (select |#valid| |~#commands~0.base|) 0)) (= (select |old(#valid)| |~#commands~0.base|) 0))} is VALID [2022-02-20 23:38:26,275 INFO L290 TraceCheckUtils]: 10: Hoare triple {46053#(or (not (= (select |#valid| |~#commands~0.base|) 0)) (= (select |old(#valid)| |~#commands~0.base|) 0))} assume 0 == #t~nondet4#1;havoc #t~mem3#1.base, #t~mem3#1.offset;havoc #t~nondet4#1; {46053#(or (not (= (select |#valid| |~#commands~0.base|) 0)) (= (select |old(#valid)| |~#commands~0.base|) 0))} is VALID [2022-02-20 23:38:26,275 INFO L290 TraceCheckUtils]: 9: Hoare triple {46053#(or (not (= (select |#valid| |~#commands~0.base|) 0)) (= (select |old(#valid)| |~#commands~0.base|) 0))} assume ~input#1.offset < #length[~input#1.base] && ~input#1.offset >= 0; {46053#(or (not (= (select |#valid| |~#commands~0.base|) 0)) (= (select |old(#valid)| |~#commands~0.base|) 0))} is VALID [2022-02-20 23:38:26,275 INFO L290 TraceCheckUtils]: 8: Hoare triple {46053#(or (not (= (select |#valid| |~#commands~0.base|) 0)) (= (select |old(#valid)| |~#commands~0.base|) 0))} assume 1 == #valid[~input#1.base]; {46053#(or (not (= (select |#valid| |~#commands~0.base|) 0)) (= (select |old(#valid)| |~#commands~0.base|) 0))} is VALID [2022-02-20 23:38:26,276 INFO L290 TraceCheckUtils]: 7: Hoare triple {46053#(or (not (= (select |#valid| |~#commands~0.base|) 0)) (= (select |old(#valid)| |~#commands~0.base|) 0))} assume #t~mem3#1.offset < #length[#t~mem3#1.base] && #t~mem3#1.offset >= 0; {46053#(or (not (= (select |#valid| |~#commands~0.base|) 0)) (= (select |old(#valid)| |~#commands~0.base|) 0))} is VALID [2022-02-20 23:38:26,276 INFO L290 TraceCheckUtils]: 6: Hoare triple {46053#(or (not (= (select |#valid| |~#commands~0.base|) 0)) (= (select |old(#valid)| |~#commands~0.base|) 0))} assume 1 == #valid[#t~mem3#1.base]; {46053#(or (not (= (select |#valid| |~#commands~0.base|) 0)) (= (select |old(#valid)| |~#commands~0.base|) 0))} is VALID [2022-02-20 23:38:26,276 INFO L290 TraceCheckUtils]: 5: Hoare triple {46053#(or (not (= (select |#valid| |~#commands~0.base|) 0)) (= (select |old(#valid)| |~#commands~0.base|) 0))} SUMMARY for call #t~mem3#1.base, #t~mem3#1.offset := read~$Pointer$(~#commands~0.base, ~#commands~0.offset + 9 * ~i~0#1, 4); srcloc: L693 {46053#(or (not (= (select |#valid| |~#commands~0.base|) 0)) (= (select |old(#valid)| |~#commands~0.base|) 0))} is VALID [2022-02-20 23:38:26,277 INFO L290 TraceCheckUtils]: 4: Hoare triple {46053#(or (not (= (select |#valid| |~#commands~0.base|) 0)) (= (select |old(#valid)| |~#commands~0.base|) 0))} assume !!(~i~0#1 < 2); {46053#(or (not (= (select |#valid| |~#commands~0.base|) 0)) (= (select |old(#valid)| |~#commands~0.base|) 0))} is VALID [2022-02-20 23:38:26,277 INFO L290 TraceCheckUtils]: 3: Hoare triple {46053#(or (not (= (select |#valid| |~#commands~0.base|) 0)) (= (select |old(#valid)| |~#commands~0.base|) 0))} ~input#1.base, ~input#1.offset := #in~input#1.base, #in~input#1.offset;~i~0#1 := 0; {46053#(or (not (= (select |#valid| |~#commands~0.base|) 0)) (= (select |old(#valid)| |~#commands~0.base|) 0))} is VALID [2022-02-20 23:38:26,277 INFO L272 TraceCheckUtils]: 2: Hoare triple {46026#(not (= (select |#valid| |~#commands~0.base|) 0))} call parse_input(3, 0); {46053#(or (not (= (select |#valid| |~#commands~0.base|) 0)) (= (select |old(#valid)| |~#commands~0.base|) 0))} is VALID [2022-02-20 23:38:26,278 INFO L290 TraceCheckUtils]: 1: Hoare triple {46026#(not (= (select |#valid| |~#commands~0.base|) 0))} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1; {46026#(not (= (select |#valid| |~#commands~0.base|) 0))} is VALID [2022-02-20 23:38:26,279 INFO L290 TraceCheckUtils]: 0: Hoare triple {45723#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(3, 1);call write~init~int(99, 1, 0, 1);call write~init~int(49, 1, 1, 1);call write~init~int(0, 1, 2, 1);call #Ultimate.allocInit(3, 2);call write~init~int(99, 2, 0, 1);call write~init~int(50, 2, 1, 1);call write~init~int(0, 2, 2, 1);call #Ultimate.allocInit(3, 3);call write~init~int(99, 3, 0, 1);call write~init~int(49, 3, 1, 1);call write~init~int(0, 3, 2, 1);call #Ultimate.allocInit(3, 4);call write~init~int(99, 4, 0, 1);call write~init~int(49, 4, 1, 1);call write~init~int(0, 4, 2, 1);call #Ultimate.allocInit(3, 5);call write~init~int(99, 5, 0, 1);call write~init~int(50, 5, 1, 1);call write~init~int(0, 5, 2, 1);~state~0 := ~unnamed3~0~STATE_1;~global~0.base, ~global~0.offset := 0, 0;~#commands~0.base, ~#commands~0.offset := 6, 0;call #Ultimate.allocInit(18, 6);call write~init~$Pointer$(1, 0, ~#commands~0.base, ~#commands~0.offset, 4);call write~init~$Pointer$(#funAddr~c1.base, #funAddr~c1.offset, ~#commands~0.base, 4 + ~#commands~0.offset, 4);call write~init~int((if ~unnamed3~0~STATE_1 % 256 <= 127 then ~unnamed3~0~STATE_1 % 256 else ~unnamed3~0~STATE_1 % 256 - 256), ~#commands~0.base, 8 + ~#commands~0.offset, 1);call write~init~$Pointer$(2, 0, ~#commands~0.base, 9 + ~#commands~0.offset, 4);call write~init~$Pointer$(#funAddr~c2.base, #funAddr~c2.offset, ~#commands~0.base, 13 + ~#commands~0.offset, 4);call write~init~int((if ~unnamed3~0~STATE_2 % 256 <= 127 then ~unnamed3~0~STATE_2 % 256 else ~unnamed3~0~STATE_2 % 256 - 256), ~#commands~0.base, 17 + ~#commands~0.offset, 1); {46026#(not (= (select |#valid| |~#commands~0.base|) 0))} is VALID [2022-02-20 23:38:26,279 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 3 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:38:26,279 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1831348857] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 23:38:26,279 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 23:38:26,279 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 10] total 26 [2022-02-20 23:38:26,279 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504493167] [2022-02-20 23:38:26,280 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 23:38:26,280 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 25 states have (on average 5.28) internal successors, (132), 25 states have internal predecessors, (132), 6 states have call successors, (8), 7 states have call predecessors, (8), 5 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) Word has length 51 [2022-02-20 23:38:26,280 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:38:26,280 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 27 states, 25 states have (on average 5.28) internal successors, (132), 25 states have internal predecessors, (132), 6 states have call successors, (8), 7 states have call predecessors, (8), 5 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 23:38:26,389 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 145 edges. 145 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:38:26,389 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-02-20 23:38:26,389 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:38:26,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-02-20 23:38:26,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=586, Unknown=0, NotChecked=0, Total=702 [2022-02-20 23:38:26,390 INFO L87 Difference]: Start difference. First operand 365 states and 434 transitions. Second operand has 27 states, 25 states have (on average 5.28) internal successors, (132), 25 states have internal predecessors, (132), 6 states have call successors, (8), 7 states have call predecessors, (8), 5 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 23:38:27,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:38:27,032 INFO L93 Difference]: Finished difference Result 393 states and 460 transitions. [2022-02-20 23:38:27,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-20 23:38:27,032 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 25 states have (on average 5.28) internal successors, (132), 25 states have internal predecessors, (132), 6 states have call successors, (8), 7 states have call predecessors, (8), 5 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) Word has length 51 [2022-02-20 23:38:27,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:38:27,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 25 states have (on average 5.28) internal successors, (132), 25 states have internal predecessors, (132), 6 states have call successors, (8), 7 states have call predecessors, (8), 5 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 23:38:27,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 77 transitions. [2022-02-20 23:38:27,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 25 states have (on average 5.28) internal successors, (132), 25 states have internal predecessors, (132), 6 states have call successors, (8), 7 states have call predecessors, (8), 5 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 23:38:27,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 77 transitions. [2022-02-20 23:38:27,034 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 77 transitions. [2022-02-20 23:38:27,095 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:38:27,101 INFO L225 Difference]: With dead ends: 393 [2022-02-20 23:38:27,101 INFO L226 Difference]: Without dead ends: 393 [2022-02-20 23:38:27,101 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 92 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 248 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=227, Invalid=829, Unknown=0, NotChecked=0, Total=1056 [2022-02-20 23:38:27,106 INFO L933 BasicCegarLoop]: 24 mSDtfsCounter, 268 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 268 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 21 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 23:38:27,106 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [268 Valid, 117 Invalid, 310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 211 Invalid, 0 Unknown, 21 Unchecked, 0.2s Time] [2022-02-20 23:38:27,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2022-02-20 23:38:27,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 365. [2022-02-20 23:38:27,111 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:38:27,112 INFO L82 GeneralOperation]: Start isEquivalent. First operand 393 states. Second operand has 365 states, 334 states have (on average 1.2305389221556886) internal successors, (411), 348 states have internal predecessors, (411), 8 states have call successors, (8), 8 states have call predecessors, (8), 12 states have return successors, (14), 8 states have call predecessors, (14), 8 states have call successors, (14) [2022-02-20 23:38:27,112 INFO L74 IsIncluded]: Start isIncluded. First operand 393 states. Second operand has 365 states, 334 states have (on average 1.2305389221556886) internal successors, (411), 348 states have internal predecessors, (411), 8 states have call successors, (8), 8 states have call predecessors, (8), 12 states have return successors, (14), 8 states have call predecessors, (14), 8 states have call successors, (14) [2022-02-20 23:38:27,112 INFO L87 Difference]: Start difference. First operand 393 states. Second operand has 365 states, 334 states have (on average 1.2305389221556886) internal successors, (411), 348 states have internal predecessors, (411), 8 states have call successors, (8), 8 states have call predecessors, (8), 12 states have return successors, (14), 8 states have call predecessors, (14), 8 states have call successors, (14) [2022-02-20 23:38:27,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:38:27,118 INFO L93 Difference]: Finished difference Result 393 states and 460 transitions. [2022-02-20 23:38:27,118 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 460 transitions. [2022-02-20 23:38:27,118 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:38:27,119 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:38:27,119 INFO L74 IsIncluded]: Start isIncluded. First operand has 365 states, 334 states have (on average 1.2305389221556886) internal successors, (411), 348 states have internal predecessors, (411), 8 states have call successors, (8), 8 states have call predecessors, (8), 12 states have return successors, (14), 8 states have call predecessors, (14), 8 states have call successors, (14) Second operand 393 states. [2022-02-20 23:38:27,119 INFO L87 Difference]: Start difference. First operand has 365 states, 334 states have (on average 1.2305389221556886) internal successors, (411), 348 states have internal predecessors, (411), 8 states have call successors, (8), 8 states have call predecessors, (8), 12 states have return successors, (14), 8 states have call predecessors, (14), 8 states have call successors, (14) Second operand 393 states. [2022-02-20 23:38:27,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:38:27,125 INFO L93 Difference]: Finished difference Result 393 states and 460 transitions. [2022-02-20 23:38:27,125 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 460 transitions. [2022-02-20 23:38:27,126 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:38:27,126 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:38:27,126 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:38:27,126 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:38:27,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 365 states, 334 states have (on average 1.2305389221556886) internal successors, (411), 348 states have internal predecessors, (411), 8 states have call successors, (8), 8 states have call predecessors, (8), 12 states have return successors, (14), 8 states have call predecessors, (14), 8 states have call successors, (14) [2022-02-20 23:38:27,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 433 transitions. [2022-02-20 23:38:27,131 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 433 transitions. Word has length 51 [2022-02-20 23:38:27,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:38:27,131 INFO L470 AbstractCegarLoop]: Abstraction has 365 states and 433 transitions. [2022-02-20 23:38:27,131 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 25 states have (on average 5.28) internal successors, (132), 25 states have internal predecessors, (132), 6 states have call successors, (8), 7 states have call predecessors, (8), 5 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 23:38:27,131 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 433 transitions. [2022-02-20 23:38:27,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-02-20 23:38:27,132 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:38:27,132 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:38:27,151 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-02-20 23:38:27,347 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-02-20 23:38:27,347 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting parse_inputErr1REQUIRES_VIOLATION === [parse_inputErr0REQUIRES_VIOLATION, parse_inputErr1REQUIRES_VIOLATION, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2022-02-20 23:38:27,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:38:27,348 INFO L85 PathProgramCache]: Analyzing trace with hash -563187968, now seen corresponding path program 1 times [2022-02-20 23:38:27,348 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:38:27,348 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338982668] [2022-02-20 23:38:27,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:38:27,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:38:27,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:38:27,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 23:38:27,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:38:27,421 INFO L290 TraceCheckUtils]: 0: Hoare triple {47702#(and (= ~global~0.base |old(~global~0.base)|) (= |old(#length)| |#length|) (= |old(~global~0.offset)| ~global~0.offset) (= ~state~0 |old(~state~0)|) (= |old(#valid)| |#valid|))} ~input#1.base, ~input#1.offset := #in~input#1.base, #in~input#1.offset;~i~0#1 := 0; {47703#(<= |parse_input_~i~0#1| 0)} is VALID [2022-02-20 23:38:27,422 INFO L290 TraceCheckUtils]: 1: Hoare triple {47703#(<= |parse_input_~i~0#1| 0)} assume !!(~i~0#1 < 2); {47703#(<= |parse_input_~i~0#1| 0)} is VALID [2022-02-20 23:38:27,422 INFO L290 TraceCheckUtils]: 2: Hoare triple {47703#(<= |parse_input_~i~0#1| 0)} SUMMARY for call #t~mem3#1.base, #t~mem3#1.offset := read~$Pointer$(~#commands~0.base, ~#commands~0.offset + 9 * ~i~0#1, 4); srcloc: L693 {47656#(<= 0 |~#commands~0.offset|)} is VALID [2022-02-20 23:38:27,423 INFO L290 TraceCheckUtils]: 3: Hoare triple {47656#(<= 0 |~#commands~0.offset|)} assume 1 == #valid[#t~mem3#1.base]; {47656#(<= 0 |~#commands~0.offset|)} is VALID [2022-02-20 23:38:27,423 INFO L290 TraceCheckUtils]: 4: Hoare triple {47656#(<= 0 |~#commands~0.offset|)} assume #t~mem3#1.offset < #length[#t~mem3#1.base] && #t~mem3#1.offset >= 0; {47656#(<= 0 |~#commands~0.offset|)} is VALID [2022-02-20 23:38:27,423 INFO L290 TraceCheckUtils]: 5: Hoare triple {47656#(<= 0 |~#commands~0.offset|)} assume 1 == #valid[~input#1.base]; {47656#(<= 0 |~#commands~0.offset|)} is VALID [2022-02-20 23:38:27,423 INFO L290 TraceCheckUtils]: 6: Hoare triple {47656#(<= 0 |~#commands~0.offset|)} assume ~input#1.offset < #length[~input#1.base] && ~input#1.offset >= 0; {47656#(<= 0 |~#commands~0.offset|)} is VALID [2022-02-20 23:38:27,424 INFO L290 TraceCheckUtils]: 7: Hoare triple {47656#(<= 0 |~#commands~0.offset|)} assume 0 == #t~nondet4#1;havoc #t~mem3#1.base, #t~mem3#1.offset;havoc #t~nondet4#1; {47656#(<= 0 |~#commands~0.offset|)} is VALID [2022-02-20 23:38:27,424 INFO L290 TraceCheckUtils]: 8: Hoare triple {47656#(<= 0 |~#commands~0.offset|)} SUMMARY for call #t~mem5#1 := read~int(~#commands~0.base, 8 + (~#commands~0.offset + 9 * ~i~0#1), 1); srcloc: L694 {47656#(<= 0 |~#commands~0.offset|)} is VALID [2022-02-20 23:38:27,424 INFO L290 TraceCheckUtils]: 9: Hoare triple {47656#(<= 0 |~#commands~0.offset|)} assume ~state~0 >= #t~mem5#1;havoc #t~mem5#1; {47656#(<= 0 |~#commands~0.offset|)} is VALID [2022-02-20 23:38:27,424 INFO L290 TraceCheckUtils]: 10: Hoare triple {47656#(<= 0 |~#commands~0.offset|)} SUMMARY for call #t~mem6#1.base, #t~mem6#1.offset := read~$Pointer$(~#commands~0.base, 4 + (~#commands~0.offset + 9 * ~i~0#1), 4); srcloc: L695 {47656#(<= 0 |~#commands~0.offset|)} is VALID [2022-02-20 23:38:27,425 INFO L290 TraceCheckUtils]: 11: Hoare triple {47656#(<= 0 |~#commands~0.offset|)} assume { :begin_inline_##fun~~TO~VOID } true;##fun~~TO~VOID_#in~#fp#1.base, ##fun~~TO~VOID_#in~#fp#1.offset := #t~mem6#1.base, #t~mem6#1.offset; {47656#(<= 0 |~#commands~0.offset|)} is VALID [2022-02-20 23:38:27,425 INFO L290 TraceCheckUtils]: 12: Hoare triple {47656#(<= 0 |~#commands~0.offset|)} assume !(##fun~~TO~VOID_#in~#fp#1.base == #funAddr~c2.base && ##fun~~TO~VOID_#in~#fp#1.offset == #funAddr~c2.offset);assume { :begin_inline_c1 } true;havoc c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset, c1_~x~0#1.base, c1_~x~0#1.offset;call c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset := #Ultimate.allocOnHeap(1);c1_~x~0#1.base, c1_~x~0#1.offset := c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset;havoc c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset; {47656#(<= 0 |~#commands~0.offset|)} is VALID [2022-02-20 23:38:27,425 INFO L290 TraceCheckUtils]: 13: Hoare triple {47656#(<= 0 |~#commands~0.offset|)} assume !(c1_~x~0#1.base == 0 && c1_~x~0#1.offset == 0); {47656#(<= 0 |~#commands~0.offset|)} is VALID [2022-02-20 23:38:27,426 INFO L290 TraceCheckUtils]: 14: Hoare triple {47656#(<= 0 |~#commands~0.offset|)} assume !(~global~0.base != 0 || ~global~0.offset != 0); {47656#(<= 0 |~#commands~0.offset|)} is VALID [2022-02-20 23:38:27,426 INFO L290 TraceCheckUtils]: 15: Hoare triple {47656#(<= 0 |~#commands~0.offset|)} ~global~0.base, ~global~0.offset := c1_~x~0#1.base, c1_~x~0#1.offset;~state~0 := ~unnamed3~0~STATE_2; {47656#(<= 0 |~#commands~0.offset|)} is VALID [2022-02-20 23:38:27,426 INFO L290 TraceCheckUtils]: 16: Hoare triple {47656#(<= 0 |~#commands~0.offset|)} assume { :end_inline_c1 } true; {47656#(<= 0 |~#commands~0.offset|)} is VALID [2022-02-20 23:38:27,426 INFO L290 TraceCheckUtils]: 17: Hoare triple {47656#(<= 0 |~#commands~0.offset|)} assume { :end_inline_##fun~~TO~VOID } true;havoc #t~mem6#1.base, #t~mem6#1.offset; {47656#(<= 0 |~#commands~0.offset|)} is VALID [2022-02-20 23:38:27,427 INFO L290 TraceCheckUtils]: 18: Hoare triple {47656#(<= 0 |~#commands~0.offset|)} assume true; {47656#(<= 0 |~#commands~0.offset|)} is VALID [2022-02-20 23:38:27,427 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {47656#(<= 0 |~#commands~0.offset|)} {47656#(<= 0 |~#commands~0.offset|)} #101#return; {47656#(<= 0 |~#commands~0.offset|)} is VALID [2022-02-20 23:38:27,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-02-20 23:38:27,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:38:27,481 INFO L290 TraceCheckUtils]: 0: Hoare triple {47702#(and (= ~global~0.base |old(~global~0.base)|) (= |old(#length)| |#length|) (= |old(~global~0.offset)| ~global~0.offset) (= ~state~0 |old(~state~0)|) (= |old(#valid)| |#valid|))} ~input#1.base, ~input#1.offset := #in~input#1.base, #in~input#1.offset;~i~0#1 := 0; {47704#(<= 0 |parse_input_~i~0#1|)} is VALID [2022-02-20 23:38:27,481 INFO L290 TraceCheckUtils]: 1: Hoare triple {47704#(<= 0 |parse_input_~i~0#1|)} assume !!(~i~0#1 < 2); {47704#(<= 0 |parse_input_~i~0#1|)} is VALID [2022-02-20 23:38:27,482 INFO L290 TraceCheckUtils]: 2: Hoare triple {47704#(<= 0 |parse_input_~i~0#1|)} SUMMARY for call #t~mem3#1.base, #t~mem3#1.offset := read~$Pointer$(~#commands~0.base, ~#commands~0.offset + 9 * ~i~0#1, 4); srcloc: L693 {47705#(and (<= 0 |parse_input_~i~0#1|) (= (select |#valid| |~#commands~0.base|) 1))} is VALID [2022-02-20 23:38:27,482 INFO L290 TraceCheckUtils]: 3: Hoare triple {47705#(and (<= 0 |parse_input_~i~0#1|) (= (select |#valid| |~#commands~0.base|) 1))} assume 1 == #valid[#t~mem3#1.base]; {47705#(and (<= 0 |parse_input_~i~0#1|) (= (select |#valid| |~#commands~0.base|) 1))} is VALID [2022-02-20 23:38:27,482 INFO L290 TraceCheckUtils]: 4: Hoare triple {47705#(and (<= 0 |parse_input_~i~0#1|) (= (select |#valid| |~#commands~0.base|) 1))} assume #t~mem3#1.offset < #length[#t~mem3#1.base] && #t~mem3#1.offset >= 0; {47705#(and (<= 0 |parse_input_~i~0#1|) (= (select |#valid| |~#commands~0.base|) 1))} is VALID [2022-02-20 23:38:27,483 INFO L290 TraceCheckUtils]: 5: Hoare triple {47705#(and (<= 0 |parse_input_~i~0#1|) (= (select |#valid| |~#commands~0.base|) 1))} assume 1 == #valid[~input#1.base]; {47705#(and (<= 0 |parse_input_~i~0#1|) (= (select |#valid| |~#commands~0.base|) 1))} is VALID [2022-02-20 23:38:27,483 INFO L290 TraceCheckUtils]: 6: Hoare triple {47705#(and (<= 0 |parse_input_~i~0#1|) (= (select |#valid| |~#commands~0.base|) 1))} assume ~input#1.offset < #length[~input#1.base] && ~input#1.offset >= 0; {47705#(and (<= 0 |parse_input_~i~0#1|) (= (select |#valid| |~#commands~0.base|) 1))} is VALID [2022-02-20 23:38:27,484 INFO L290 TraceCheckUtils]: 7: Hoare triple {47705#(and (<= 0 |parse_input_~i~0#1|) (= (select |#valid| |~#commands~0.base|) 1))} assume 0 == #t~nondet4#1;havoc #t~mem3#1.base, #t~mem3#1.offset;havoc #t~nondet4#1; {47705#(and (<= 0 |parse_input_~i~0#1|) (= (select |#valid| |~#commands~0.base|) 1))} is VALID [2022-02-20 23:38:27,484 INFO L290 TraceCheckUtils]: 8: Hoare triple {47705#(and (<= 0 |parse_input_~i~0#1|) (= (select |#valid| |~#commands~0.base|) 1))} SUMMARY for call #t~mem5#1 := read~int(~#commands~0.base, 8 + (~#commands~0.offset + 9 * ~i~0#1), 1); srcloc: L694 {47706#(and (<= (+ |~#commands~0.offset| 9) (select |#length| |~#commands~0.base|)) (= (select |#valid| |~#commands~0.base|) 1))} is VALID [2022-02-20 23:38:27,484 INFO L290 TraceCheckUtils]: 9: Hoare triple {47706#(and (<= (+ |~#commands~0.offset| 9) (select |#length| |~#commands~0.base|)) (= (select |#valid| |~#commands~0.base|) 1))} assume ~state~0 >= #t~mem5#1;havoc #t~mem5#1; {47706#(and (<= (+ |~#commands~0.offset| 9) (select |#length| |~#commands~0.base|)) (= (select |#valid| |~#commands~0.base|) 1))} is VALID [2022-02-20 23:38:27,485 INFO L290 TraceCheckUtils]: 10: Hoare triple {47706#(and (<= (+ |~#commands~0.offset| 9) (select |#length| |~#commands~0.base|)) (= (select |#valid| |~#commands~0.base|) 1))} SUMMARY for call #t~mem6#1.base, #t~mem6#1.offset := read~$Pointer$(~#commands~0.base, 4 + (~#commands~0.offset + 9 * ~i~0#1), 4); srcloc: L695 {47706#(and (<= (+ |~#commands~0.offset| 9) (select |#length| |~#commands~0.base|)) (= (select |#valid| |~#commands~0.base|) 1))} is VALID [2022-02-20 23:38:27,485 INFO L290 TraceCheckUtils]: 11: Hoare triple {47706#(and (<= (+ |~#commands~0.offset| 9) (select |#length| |~#commands~0.base|)) (= (select |#valid| |~#commands~0.base|) 1))} assume { :begin_inline_##fun~~TO~VOID } true;##fun~~TO~VOID_#in~#fp#1.base, ##fun~~TO~VOID_#in~#fp#1.offset := #t~mem6#1.base, #t~mem6#1.offset; {47706#(and (<= (+ |~#commands~0.offset| 9) (select |#length| |~#commands~0.base|)) (= (select |#valid| |~#commands~0.base|) 1))} is VALID [2022-02-20 23:38:27,486 INFO L290 TraceCheckUtils]: 12: Hoare triple {47706#(and (<= (+ |~#commands~0.offset| 9) (select |#length| |~#commands~0.base|)) (= (select |#valid| |~#commands~0.base|) 1))} assume !(##fun~~TO~VOID_#in~#fp#1.base == #funAddr~c2.base && ##fun~~TO~VOID_#in~#fp#1.offset == #funAddr~c2.offset);assume { :begin_inline_c1 } true;havoc c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset, c1_~x~0#1.base, c1_~x~0#1.offset;call c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset := #Ultimate.allocOnHeap(1);c1_~x~0#1.base, c1_~x~0#1.offset := c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset;havoc c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset; {47707#(<= (+ |~#commands~0.offset| 9) (select |#length| |~#commands~0.base|))} is VALID [2022-02-20 23:38:27,486 INFO L290 TraceCheckUtils]: 13: Hoare triple {47707#(<= (+ |~#commands~0.offset| 9) (select |#length| |~#commands~0.base|))} assume !(c1_~x~0#1.base == 0 && c1_~x~0#1.offset == 0); {47707#(<= (+ |~#commands~0.offset| 9) (select |#length| |~#commands~0.base|))} is VALID [2022-02-20 23:38:27,487 INFO L290 TraceCheckUtils]: 14: Hoare triple {47707#(<= (+ |~#commands~0.offset| 9) (select |#length| |~#commands~0.base|))} assume ~global~0.base != 0 || ~global~0.offset != 0; {47707#(<= (+ |~#commands~0.offset| 9) (select |#length| |~#commands~0.base|))} is VALID [2022-02-20 23:38:27,487 INFO L290 TraceCheckUtils]: 15: Hoare triple {47707#(<= (+ |~#commands~0.offset| 9) (select |#length| |~#commands~0.base|))} assume 0 == ~global~0.offset; {47707#(<= (+ |~#commands~0.offset| 9) (select |#length| |~#commands~0.base|))} is VALID [2022-02-20 23:38:27,487 INFO L290 TraceCheckUtils]: 16: Hoare triple {47707#(<= (+ |~#commands~0.offset| 9) (select |#length| |~#commands~0.base|))} assume ~global~0.base < #StackHeapBarrier; {47707#(<= (+ |~#commands~0.offset| 9) (select |#length| |~#commands~0.base|))} is VALID [2022-02-20 23:38:27,488 INFO L290 TraceCheckUtils]: 17: Hoare triple {47707#(<= (+ |~#commands~0.offset| 9) (select |#length| |~#commands~0.base|))} assume 0 == ~global~0.base || 1 == #valid[~global~0.base];call ULTIMATE.dealloc(~global~0.base, ~global~0.offset); {47707#(<= (+ |~#commands~0.offset| 9) (select |#length| |~#commands~0.base|))} is VALID [2022-02-20 23:38:27,488 INFO L290 TraceCheckUtils]: 18: Hoare triple {47707#(<= (+ |~#commands~0.offset| 9) (select |#length| |~#commands~0.base|))} ~global~0.base, ~global~0.offset := c1_~x~0#1.base, c1_~x~0#1.offset;~state~0 := ~unnamed3~0~STATE_2; {47707#(<= (+ |~#commands~0.offset| 9) (select |#length| |~#commands~0.base|))} is VALID [2022-02-20 23:38:27,488 INFO L290 TraceCheckUtils]: 19: Hoare triple {47707#(<= (+ |~#commands~0.offset| 9) (select |#length| |~#commands~0.base|))} assume { :end_inline_c1 } true; {47707#(<= (+ |~#commands~0.offset| 9) (select |#length| |~#commands~0.base|))} is VALID [2022-02-20 23:38:27,489 INFO L290 TraceCheckUtils]: 20: Hoare triple {47707#(<= (+ |~#commands~0.offset| 9) (select |#length| |~#commands~0.base|))} assume { :end_inline_##fun~~TO~VOID } true;havoc #t~mem6#1.base, #t~mem6#1.offset; {47707#(<= (+ |~#commands~0.offset| 9) (select |#length| |~#commands~0.base|))} is VALID [2022-02-20 23:38:27,489 INFO L290 TraceCheckUtils]: 21: Hoare triple {47707#(<= (+ |~#commands~0.offset| 9) (select |#length| |~#commands~0.base|))} assume true; {47707#(<= (+ |~#commands~0.offset| 9) (select |#length| |~#commands~0.base|))} is VALID [2022-02-20 23:38:27,489 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {47707#(<= (+ |~#commands~0.offset| 9) (select |#length| |~#commands~0.base|))} {47656#(<= 0 |~#commands~0.offset|)} #103#return; {47700#(and (<= 0 |~#commands~0.offset|) (<= (+ |~#commands~0.offset| 9) (select |#length| |~#commands~0.base|)))} is VALID [2022-02-20 23:38:27,490 INFO L290 TraceCheckUtils]: 0: Hoare triple {47654#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(3, 1);call write~init~int(99, 1, 0, 1);call write~init~int(49, 1, 1, 1);call write~init~int(0, 1, 2, 1);call #Ultimate.allocInit(3, 2);call write~init~int(99, 2, 0, 1);call write~init~int(50, 2, 1, 1);call write~init~int(0, 2, 2, 1);call #Ultimate.allocInit(3, 3);call write~init~int(99, 3, 0, 1);call write~init~int(49, 3, 1, 1);call write~init~int(0, 3, 2, 1);call #Ultimate.allocInit(3, 4);call write~init~int(99, 4, 0, 1);call write~init~int(49, 4, 1, 1);call write~init~int(0, 4, 2, 1);call #Ultimate.allocInit(3, 5);call write~init~int(99, 5, 0, 1);call write~init~int(50, 5, 1, 1);call write~init~int(0, 5, 2, 1);~state~0 := ~unnamed3~0~STATE_1;~global~0.base, ~global~0.offset := 0, 0;~#commands~0.base, ~#commands~0.offset := 6, 0;call #Ultimate.allocInit(18, 6);call write~init~$Pointer$(1, 0, ~#commands~0.base, ~#commands~0.offset, 4);call write~init~$Pointer$(#funAddr~c1.base, #funAddr~c1.offset, ~#commands~0.base, 4 + ~#commands~0.offset, 4);call write~init~int((if ~unnamed3~0~STATE_1 % 256 <= 127 then ~unnamed3~0~STATE_1 % 256 else ~unnamed3~0~STATE_1 % 256 - 256), ~#commands~0.base, 8 + ~#commands~0.offset, 1);call write~init~$Pointer$(2, 0, ~#commands~0.base, 9 + ~#commands~0.offset, 4);call write~init~$Pointer$(#funAddr~c2.base, #funAddr~c2.offset, ~#commands~0.base, 13 + ~#commands~0.offset, 4);call write~init~int((if ~unnamed3~0~STATE_2 % 256 <= 127 then ~unnamed3~0~STATE_2 % 256 else ~unnamed3~0~STATE_2 % 256 - 256), ~#commands~0.base, 17 + ~#commands~0.offset, 1); {47656#(<= 0 |~#commands~0.offset|)} is VALID [2022-02-20 23:38:27,491 INFO L290 TraceCheckUtils]: 1: Hoare triple {47656#(<= 0 |~#commands~0.offset|)} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1; {47656#(<= 0 |~#commands~0.offset|)} is VALID [2022-02-20 23:38:27,491 INFO L272 TraceCheckUtils]: 2: Hoare triple {47656#(<= 0 |~#commands~0.offset|)} call parse_input(3, 0); {47702#(and (= ~global~0.base |old(~global~0.base)|) (= |old(#length)| |#length|) (= |old(~global~0.offset)| ~global~0.offset) (= ~state~0 |old(~state~0)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 23:38:27,492 INFO L290 TraceCheckUtils]: 3: Hoare triple {47702#(and (= ~global~0.base |old(~global~0.base)|) (= |old(#length)| |#length|) (= |old(~global~0.offset)| ~global~0.offset) (= ~state~0 |old(~state~0)|) (= |old(#valid)| |#valid|))} ~input#1.base, ~input#1.offset := #in~input#1.base, #in~input#1.offset;~i~0#1 := 0; {47703#(<= |parse_input_~i~0#1| 0)} is VALID [2022-02-20 23:38:27,492 INFO L290 TraceCheckUtils]: 4: Hoare triple {47703#(<= |parse_input_~i~0#1| 0)} assume !!(~i~0#1 < 2); {47703#(<= |parse_input_~i~0#1| 0)} is VALID [2022-02-20 23:38:27,492 INFO L290 TraceCheckUtils]: 5: Hoare triple {47703#(<= |parse_input_~i~0#1| 0)} SUMMARY for call #t~mem3#1.base, #t~mem3#1.offset := read~$Pointer$(~#commands~0.base, ~#commands~0.offset + 9 * ~i~0#1, 4); srcloc: L693 {47656#(<= 0 |~#commands~0.offset|)} is VALID [2022-02-20 23:38:27,493 INFO L290 TraceCheckUtils]: 6: Hoare triple {47656#(<= 0 |~#commands~0.offset|)} assume 1 == #valid[#t~mem3#1.base]; {47656#(<= 0 |~#commands~0.offset|)} is VALID [2022-02-20 23:38:27,493 INFO L290 TraceCheckUtils]: 7: Hoare triple {47656#(<= 0 |~#commands~0.offset|)} assume #t~mem3#1.offset < #length[#t~mem3#1.base] && #t~mem3#1.offset >= 0; {47656#(<= 0 |~#commands~0.offset|)} is VALID [2022-02-20 23:38:27,493 INFO L290 TraceCheckUtils]: 8: Hoare triple {47656#(<= 0 |~#commands~0.offset|)} assume 1 == #valid[~input#1.base]; {47656#(<= 0 |~#commands~0.offset|)} is VALID [2022-02-20 23:38:27,494 INFO L290 TraceCheckUtils]: 9: Hoare triple {47656#(<= 0 |~#commands~0.offset|)} assume ~input#1.offset < #length[~input#1.base] && ~input#1.offset >= 0; {47656#(<= 0 |~#commands~0.offset|)} is VALID [2022-02-20 23:38:27,494 INFO L290 TraceCheckUtils]: 10: Hoare triple {47656#(<= 0 |~#commands~0.offset|)} assume 0 == #t~nondet4#1;havoc #t~mem3#1.base, #t~mem3#1.offset;havoc #t~nondet4#1; {47656#(<= 0 |~#commands~0.offset|)} is VALID [2022-02-20 23:38:27,494 INFO L290 TraceCheckUtils]: 11: Hoare triple {47656#(<= 0 |~#commands~0.offset|)} SUMMARY for call #t~mem5#1 := read~int(~#commands~0.base, 8 + (~#commands~0.offset + 9 * ~i~0#1), 1); srcloc: L694 {47656#(<= 0 |~#commands~0.offset|)} is VALID [2022-02-20 23:38:27,494 INFO L290 TraceCheckUtils]: 12: Hoare triple {47656#(<= 0 |~#commands~0.offset|)} assume ~state~0 >= #t~mem5#1;havoc #t~mem5#1; {47656#(<= 0 |~#commands~0.offset|)} is VALID [2022-02-20 23:38:27,495 INFO L290 TraceCheckUtils]: 13: Hoare triple {47656#(<= 0 |~#commands~0.offset|)} SUMMARY for call #t~mem6#1.base, #t~mem6#1.offset := read~$Pointer$(~#commands~0.base, 4 + (~#commands~0.offset + 9 * ~i~0#1), 4); srcloc: L695 {47656#(<= 0 |~#commands~0.offset|)} is VALID [2022-02-20 23:38:27,495 INFO L290 TraceCheckUtils]: 14: Hoare triple {47656#(<= 0 |~#commands~0.offset|)} assume { :begin_inline_##fun~~TO~VOID } true;##fun~~TO~VOID_#in~#fp#1.base, ##fun~~TO~VOID_#in~#fp#1.offset := #t~mem6#1.base, #t~mem6#1.offset; {47656#(<= 0 |~#commands~0.offset|)} is VALID [2022-02-20 23:38:27,495 INFO L290 TraceCheckUtils]: 15: Hoare triple {47656#(<= 0 |~#commands~0.offset|)} assume !(##fun~~TO~VOID_#in~#fp#1.base == #funAddr~c2.base && ##fun~~TO~VOID_#in~#fp#1.offset == #funAddr~c2.offset);assume { :begin_inline_c1 } true;havoc c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset, c1_~x~0#1.base, c1_~x~0#1.offset;call c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset := #Ultimate.allocOnHeap(1);c1_~x~0#1.base, c1_~x~0#1.offset := c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset;havoc c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset; {47656#(<= 0 |~#commands~0.offset|)} is VALID [2022-02-20 23:38:27,495 INFO L290 TraceCheckUtils]: 16: Hoare triple {47656#(<= 0 |~#commands~0.offset|)} assume !(c1_~x~0#1.base == 0 && c1_~x~0#1.offset == 0); {47656#(<= 0 |~#commands~0.offset|)} is VALID [2022-02-20 23:38:27,496 INFO L290 TraceCheckUtils]: 17: Hoare triple {47656#(<= 0 |~#commands~0.offset|)} assume !(~global~0.base != 0 || ~global~0.offset != 0); {47656#(<= 0 |~#commands~0.offset|)} is VALID [2022-02-20 23:38:27,496 INFO L290 TraceCheckUtils]: 18: Hoare triple {47656#(<= 0 |~#commands~0.offset|)} ~global~0.base, ~global~0.offset := c1_~x~0#1.base, c1_~x~0#1.offset;~state~0 := ~unnamed3~0~STATE_2; {47656#(<= 0 |~#commands~0.offset|)} is VALID [2022-02-20 23:38:27,496 INFO L290 TraceCheckUtils]: 19: Hoare triple {47656#(<= 0 |~#commands~0.offset|)} assume { :end_inline_c1 } true; {47656#(<= 0 |~#commands~0.offset|)} is VALID [2022-02-20 23:38:27,497 INFO L290 TraceCheckUtils]: 20: Hoare triple {47656#(<= 0 |~#commands~0.offset|)} assume { :end_inline_##fun~~TO~VOID } true;havoc #t~mem6#1.base, #t~mem6#1.offset; {47656#(<= 0 |~#commands~0.offset|)} is VALID [2022-02-20 23:38:27,497 INFO L290 TraceCheckUtils]: 21: Hoare triple {47656#(<= 0 |~#commands~0.offset|)} assume true; {47656#(<= 0 |~#commands~0.offset|)} is VALID [2022-02-20 23:38:27,497 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {47656#(<= 0 |~#commands~0.offset|)} {47656#(<= 0 |~#commands~0.offset|)} #101#return; {47656#(<= 0 |~#commands~0.offset|)} is VALID [2022-02-20 23:38:27,498 INFO L272 TraceCheckUtils]: 23: Hoare triple {47656#(<= 0 |~#commands~0.offset|)} call parse_input(4, 0); {47702#(and (= ~global~0.base |old(~global~0.base)|) (= |old(#length)| |#length|) (= |old(~global~0.offset)| ~global~0.offset) (= ~state~0 |old(~state~0)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 23:38:27,498 INFO L290 TraceCheckUtils]: 24: Hoare triple {47702#(and (= ~global~0.base |old(~global~0.base)|) (= |old(#length)| |#length|) (= |old(~global~0.offset)| ~global~0.offset) (= ~state~0 |old(~state~0)|) (= |old(#valid)| |#valid|))} ~input#1.base, ~input#1.offset := #in~input#1.base, #in~input#1.offset;~i~0#1 := 0; {47704#(<= 0 |parse_input_~i~0#1|)} is VALID [2022-02-20 23:38:27,498 INFO L290 TraceCheckUtils]: 25: Hoare triple {47704#(<= 0 |parse_input_~i~0#1|)} assume !!(~i~0#1 < 2); {47704#(<= 0 |parse_input_~i~0#1|)} is VALID [2022-02-20 23:38:27,499 INFO L290 TraceCheckUtils]: 26: Hoare triple {47704#(<= 0 |parse_input_~i~0#1|)} SUMMARY for call #t~mem3#1.base, #t~mem3#1.offset := read~$Pointer$(~#commands~0.base, ~#commands~0.offset + 9 * ~i~0#1, 4); srcloc: L693 {47705#(and (<= 0 |parse_input_~i~0#1|) (= (select |#valid| |~#commands~0.base|) 1))} is VALID [2022-02-20 23:38:27,499 INFO L290 TraceCheckUtils]: 27: Hoare triple {47705#(and (<= 0 |parse_input_~i~0#1|) (= (select |#valid| |~#commands~0.base|) 1))} assume 1 == #valid[#t~mem3#1.base]; {47705#(and (<= 0 |parse_input_~i~0#1|) (= (select |#valid| |~#commands~0.base|) 1))} is VALID [2022-02-20 23:38:27,500 INFO L290 TraceCheckUtils]: 28: Hoare triple {47705#(and (<= 0 |parse_input_~i~0#1|) (= (select |#valid| |~#commands~0.base|) 1))} assume #t~mem3#1.offset < #length[#t~mem3#1.base] && #t~mem3#1.offset >= 0; {47705#(and (<= 0 |parse_input_~i~0#1|) (= (select |#valid| |~#commands~0.base|) 1))} is VALID [2022-02-20 23:38:27,500 INFO L290 TraceCheckUtils]: 29: Hoare triple {47705#(and (<= 0 |parse_input_~i~0#1|) (= (select |#valid| |~#commands~0.base|) 1))} assume 1 == #valid[~input#1.base]; {47705#(and (<= 0 |parse_input_~i~0#1|) (= (select |#valid| |~#commands~0.base|) 1))} is VALID [2022-02-20 23:38:27,500 INFO L290 TraceCheckUtils]: 30: Hoare triple {47705#(and (<= 0 |parse_input_~i~0#1|) (= (select |#valid| |~#commands~0.base|) 1))} assume ~input#1.offset < #length[~input#1.base] && ~input#1.offset >= 0; {47705#(and (<= 0 |parse_input_~i~0#1|) (= (select |#valid| |~#commands~0.base|) 1))} is VALID [2022-02-20 23:38:27,501 INFO L290 TraceCheckUtils]: 31: Hoare triple {47705#(and (<= 0 |parse_input_~i~0#1|) (= (select |#valid| |~#commands~0.base|) 1))} assume 0 == #t~nondet4#1;havoc #t~mem3#1.base, #t~mem3#1.offset;havoc #t~nondet4#1; {47705#(and (<= 0 |parse_input_~i~0#1|) (= (select |#valid| |~#commands~0.base|) 1))} is VALID [2022-02-20 23:38:27,501 INFO L290 TraceCheckUtils]: 32: Hoare triple {47705#(and (<= 0 |parse_input_~i~0#1|) (= (select |#valid| |~#commands~0.base|) 1))} SUMMARY for call #t~mem5#1 := read~int(~#commands~0.base, 8 + (~#commands~0.offset + 9 * ~i~0#1), 1); srcloc: L694 {47706#(and (<= (+ |~#commands~0.offset| 9) (select |#length| |~#commands~0.base|)) (= (select |#valid| |~#commands~0.base|) 1))} is VALID [2022-02-20 23:38:27,501 INFO L290 TraceCheckUtils]: 33: Hoare triple {47706#(and (<= (+ |~#commands~0.offset| 9) (select |#length| |~#commands~0.base|)) (= (select |#valid| |~#commands~0.base|) 1))} assume ~state~0 >= #t~mem5#1;havoc #t~mem5#1; {47706#(and (<= (+ |~#commands~0.offset| 9) (select |#length| |~#commands~0.base|)) (= (select |#valid| |~#commands~0.base|) 1))} is VALID [2022-02-20 23:38:27,502 INFO L290 TraceCheckUtils]: 34: Hoare triple {47706#(and (<= (+ |~#commands~0.offset| 9) (select |#length| |~#commands~0.base|)) (= (select |#valid| |~#commands~0.base|) 1))} SUMMARY for call #t~mem6#1.base, #t~mem6#1.offset := read~$Pointer$(~#commands~0.base, 4 + (~#commands~0.offset + 9 * ~i~0#1), 4); srcloc: L695 {47706#(and (<= (+ |~#commands~0.offset| 9) (select |#length| |~#commands~0.base|)) (= (select |#valid| |~#commands~0.base|) 1))} is VALID [2022-02-20 23:38:27,502 INFO L290 TraceCheckUtils]: 35: Hoare triple {47706#(and (<= (+ |~#commands~0.offset| 9) (select |#length| |~#commands~0.base|)) (= (select |#valid| |~#commands~0.base|) 1))} assume { :begin_inline_##fun~~TO~VOID } true;##fun~~TO~VOID_#in~#fp#1.base, ##fun~~TO~VOID_#in~#fp#1.offset := #t~mem6#1.base, #t~mem6#1.offset; {47706#(and (<= (+ |~#commands~0.offset| 9) (select |#length| |~#commands~0.base|)) (= (select |#valid| |~#commands~0.base|) 1))} is VALID [2022-02-20 23:38:27,503 INFO L290 TraceCheckUtils]: 36: Hoare triple {47706#(and (<= (+ |~#commands~0.offset| 9) (select |#length| |~#commands~0.base|)) (= (select |#valid| |~#commands~0.base|) 1))} assume !(##fun~~TO~VOID_#in~#fp#1.base == #funAddr~c2.base && ##fun~~TO~VOID_#in~#fp#1.offset == #funAddr~c2.offset);assume { :begin_inline_c1 } true;havoc c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset, c1_~x~0#1.base, c1_~x~0#1.offset;call c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset := #Ultimate.allocOnHeap(1);c1_~x~0#1.base, c1_~x~0#1.offset := c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset;havoc c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset; {47707#(<= (+ |~#commands~0.offset| 9) (select |#length| |~#commands~0.base|))} is VALID [2022-02-20 23:38:27,503 INFO L290 TraceCheckUtils]: 37: Hoare triple {47707#(<= (+ |~#commands~0.offset| 9) (select |#length| |~#commands~0.base|))} assume !(c1_~x~0#1.base == 0 && c1_~x~0#1.offset == 0); {47707#(<= (+ |~#commands~0.offset| 9) (select |#length| |~#commands~0.base|))} is VALID [2022-02-20 23:38:27,504 INFO L290 TraceCheckUtils]: 38: Hoare triple {47707#(<= (+ |~#commands~0.offset| 9) (select |#length| |~#commands~0.base|))} assume ~global~0.base != 0 || ~global~0.offset != 0; {47707#(<= (+ |~#commands~0.offset| 9) (select |#length| |~#commands~0.base|))} is VALID [2022-02-20 23:38:27,504 INFO L290 TraceCheckUtils]: 39: Hoare triple {47707#(<= (+ |~#commands~0.offset| 9) (select |#length| |~#commands~0.base|))} assume 0 == ~global~0.offset; {47707#(<= (+ |~#commands~0.offset| 9) (select |#length| |~#commands~0.base|))} is VALID [2022-02-20 23:38:27,504 INFO L290 TraceCheckUtils]: 40: Hoare triple {47707#(<= (+ |~#commands~0.offset| 9) (select |#length| |~#commands~0.base|))} assume ~global~0.base < #StackHeapBarrier; {47707#(<= (+ |~#commands~0.offset| 9) (select |#length| |~#commands~0.base|))} is VALID [2022-02-20 23:38:27,504 INFO L290 TraceCheckUtils]: 41: Hoare triple {47707#(<= (+ |~#commands~0.offset| 9) (select |#length| |~#commands~0.base|))} assume 0 == ~global~0.base || 1 == #valid[~global~0.base];call ULTIMATE.dealloc(~global~0.base, ~global~0.offset); {47707#(<= (+ |~#commands~0.offset| 9) (select |#length| |~#commands~0.base|))} is VALID [2022-02-20 23:38:27,505 INFO L290 TraceCheckUtils]: 42: Hoare triple {47707#(<= (+ |~#commands~0.offset| 9) (select |#length| |~#commands~0.base|))} ~global~0.base, ~global~0.offset := c1_~x~0#1.base, c1_~x~0#1.offset;~state~0 := ~unnamed3~0~STATE_2; {47707#(<= (+ |~#commands~0.offset| 9) (select |#length| |~#commands~0.base|))} is VALID [2022-02-20 23:38:27,505 INFO L290 TraceCheckUtils]: 43: Hoare triple {47707#(<= (+ |~#commands~0.offset| 9) (select |#length| |~#commands~0.base|))} assume { :end_inline_c1 } true; {47707#(<= (+ |~#commands~0.offset| 9) (select |#length| |~#commands~0.base|))} is VALID [2022-02-20 23:38:27,505 INFO L290 TraceCheckUtils]: 44: Hoare triple {47707#(<= (+ |~#commands~0.offset| 9) (select |#length| |~#commands~0.base|))} assume { :end_inline_##fun~~TO~VOID } true;havoc #t~mem6#1.base, #t~mem6#1.offset; {47707#(<= (+ |~#commands~0.offset| 9) (select |#length| |~#commands~0.base|))} is VALID [2022-02-20 23:38:27,506 INFO L290 TraceCheckUtils]: 45: Hoare triple {47707#(<= (+ |~#commands~0.offset| 9) (select |#length| |~#commands~0.base|))} assume true; {47707#(<= (+ |~#commands~0.offset| 9) (select |#length| |~#commands~0.base|))} is VALID [2022-02-20 23:38:27,506 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {47707#(<= (+ |~#commands~0.offset| 9) (select |#length| |~#commands~0.base|))} {47656#(<= 0 |~#commands~0.offset|)} #103#return; {47700#(and (<= 0 |~#commands~0.offset|) (<= (+ |~#commands~0.offset| 9) (select |#length| |~#commands~0.base|)))} is VALID [2022-02-20 23:38:27,507 INFO L272 TraceCheckUtils]: 47: Hoare triple {47700#(and (<= 0 |~#commands~0.offset|) (<= (+ |~#commands~0.offset| 9) (select |#length| |~#commands~0.base|)))} call parse_input(5, 0); {47700#(and (<= 0 |~#commands~0.offset|) (<= (+ |~#commands~0.offset| 9) (select |#length| |~#commands~0.base|)))} is VALID [2022-02-20 23:38:27,507 INFO L290 TraceCheckUtils]: 48: Hoare triple {47700#(and (<= 0 |~#commands~0.offset|) (<= (+ |~#commands~0.offset| 9) (select |#length| |~#commands~0.base|)))} ~input#1.base, ~input#1.offset := #in~input#1.base, #in~input#1.offset;~i~0#1 := 0; {47701#(and (<= 0 |~#commands~0.offset|) (= |parse_input_~i~0#1| 0) (<= (+ |~#commands~0.offset| 9) (select |#length| |~#commands~0.base|)))} is VALID [2022-02-20 23:38:27,507 INFO L290 TraceCheckUtils]: 49: Hoare triple {47701#(and (<= 0 |~#commands~0.offset|) (= |parse_input_~i~0#1| 0) (<= (+ |~#commands~0.offset| 9) (select |#length| |~#commands~0.base|)))} assume !!(~i~0#1 < 2); {47701#(and (<= 0 |~#commands~0.offset|) (= |parse_input_~i~0#1| 0) (<= (+ |~#commands~0.offset| 9) (select |#length| |~#commands~0.base|)))} is VALID [2022-02-20 23:38:27,508 INFO L290 TraceCheckUtils]: 50: Hoare triple {47701#(and (<= 0 |~#commands~0.offset|) (= |parse_input_~i~0#1| 0) (<= (+ |~#commands~0.offset| 9) (select |#length| |~#commands~0.base|)))} assume !(4 + (~#commands~0.offset + 9 * ~i~0#1) <= #length[~#commands~0.base] && 0 <= ~#commands~0.offset + 9 * ~i~0#1); {47655#false} is VALID [2022-02-20 23:38:27,508 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 4 proven. 21 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-20 23:38:27,508 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:38:27,508 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338982668] [2022-02-20 23:38:27,508 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1338982668] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 23:38:27,508 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [192315101] [2022-02-20 23:38:27,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:38:27,508 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:38:27,509 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:38:27,510 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 23:38:27,510 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-02-20 23:38:27,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:38:27,580 INFO L263 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 13 conjunts are in the unsatisfiable core [2022-02-20 23:38:27,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:38:27,596 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:38:27,864 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:38:27,866 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2022-02-20 23:38:27,886 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-02-20 23:38:27,886 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-02-20 23:38:27,991 INFO L290 TraceCheckUtils]: 0: Hoare triple {47654#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(3, 1);call write~init~int(99, 1, 0, 1);call write~init~int(49, 1, 1, 1);call write~init~int(0, 1, 2, 1);call #Ultimate.allocInit(3, 2);call write~init~int(99, 2, 0, 1);call write~init~int(50, 2, 1, 1);call write~init~int(0, 2, 2, 1);call #Ultimate.allocInit(3, 3);call write~init~int(99, 3, 0, 1);call write~init~int(49, 3, 1, 1);call write~init~int(0, 3, 2, 1);call #Ultimate.allocInit(3, 4);call write~init~int(99, 4, 0, 1);call write~init~int(49, 4, 1, 1);call write~init~int(0, 4, 2, 1);call #Ultimate.allocInit(3, 5);call write~init~int(99, 5, 0, 1);call write~init~int(50, 5, 1, 1);call write~init~int(0, 5, 2, 1);~state~0 := ~unnamed3~0~STATE_1;~global~0.base, ~global~0.offset := 0, 0;~#commands~0.base, ~#commands~0.offset := 6, 0;call #Ultimate.allocInit(18, 6);call write~init~$Pointer$(1, 0, ~#commands~0.base, ~#commands~0.offset, 4);call write~init~$Pointer$(#funAddr~c1.base, #funAddr~c1.offset, ~#commands~0.base, 4 + ~#commands~0.offset, 4);call write~init~int((if ~unnamed3~0~STATE_1 % 256 <= 127 then ~unnamed3~0~STATE_1 % 256 else ~unnamed3~0~STATE_1 % 256 - 256), ~#commands~0.base, 8 + ~#commands~0.offset, 1);call write~init~$Pointer$(2, 0, ~#commands~0.base, 9 + ~#commands~0.offset, 4);call write~init~$Pointer$(#funAddr~c2.base, #funAddr~c2.offset, ~#commands~0.base, 13 + ~#commands~0.offset, 4);call write~init~int((if ~unnamed3~0~STATE_2 % 256 <= 127 then ~unnamed3~0~STATE_2 % 256 else ~unnamed3~0~STATE_2 % 256 - 256), ~#commands~0.base, 17 + ~#commands~0.offset, 1); {47656#(<= 0 |~#commands~0.offset|)} is VALID [2022-02-20 23:38:27,992 INFO L290 TraceCheckUtils]: 1: Hoare triple {47656#(<= 0 |~#commands~0.offset|)} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1; {47656#(<= 0 |~#commands~0.offset|)} is VALID [2022-02-20 23:38:27,992 INFO L272 TraceCheckUtils]: 2: Hoare triple {47656#(<= 0 |~#commands~0.offset|)} call parse_input(3, 0); {47656#(<= 0 |~#commands~0.offset|)} is VALID [2022-02-20 23:38:27,993 INFO L290 TraceCheckUtils]: 3: Hoare triple {47656#(<= 0 |~#commands~0.offset|)} ~input#1.base, ~input#1.offset := #in~input#1.base, #in~input#1.offset;~i~0#1 := 0; {47656#(<= 0 |~#commands~0.offset|)} is VALID [2022-02-20 23:38:27,993 INFO L290 TraceCheckUtils]: 4: Hoare triple {47656#(<= 0 |~#commands~0.offset|)} assume !!(~i~0#1 < 2); {47656#(<= 0 |~#commands~0.offset|)} is VALID [2022-02-20 23:38:27,993 INFO L290 TraceCheckUtils]: 5: Hoare triple {47656#(<= 0 |~#commands~0.offset|)} SUMMARY for call #t~mem3#1.base, #t~mem3#1.offset := read~$Pointer$(~#commands~0.base, ~#commands~0.offset + 9 * ~i~0#1, 4); srcloc: L693 {47656#(<= 0 |~#commands~0.offset|)} is VALID [2022-02-20 23:38:27,993 INFO L290 TraceCheckUtils]: 6: Hoare triple {47656#(<= 0 |~#commands~0.offset|)} assume 1 == #valid[#t~mem3#1.base]; {47656#(<= 0 |~#commands~0.offset|)} is VALID [2022-02-20 23:38:27,994 INFO L290 TraceCheckUtils]: 7: Hoare triple {47656#(<= 0 |~#commands~0.offset|)} assume #t~mem3#1.offset < #length[#t~mem3#1.base] && #t~mem3#1.offset >= 0; {47656#(<= 0 |~#commands~0.offset|)} is VALID [2022-02-20 23:38:27,994 INFO L290 TraceCheckUtils]: 8: Hoare triple {47656#(<= 0 |~#commands~0.offset|)} assume 1 == #valid[~input#1.base]; {47656#(<= 0 |~#commands~0.offset|)} is VALID [2022-02-20 23:38:27,994 INFO L290 TraceCheckUtils]: 9: Hoare triple {47656#(<= 0 |~#commands~0.offset|)} assume ~input#1.offset < #length[~input#1.base] && ~input#1.offset >= 0; {47656#(<= 0 |~#commands~0.offset|)} is VALID [2022-02-20 23:38:27,994 INFO L290 TraceCheckUtils]: 10: Hoare triple {47656#(<= 0 |~#commands~0.offset|)} assume 0 == #t~nondet4#1;havoc #t~mem3#1.base, #t~mem3#1.offset;havoc #t~nondet4#1; {47656#(<= 0 |~#commands~0.offset|)} is VALID [2022-02-20 23:38:27,995 INFO L290 TraceCheckUtils]: 11: Hoare triple {47656#(<= 0 |~#commands~0.offset|)} SUMMARY for call #t~mem5#1 := read~int(~#commands~0.base, 8 + (~#commands~0.offset + 9 * ~i~0#1), 1); srcloc: L694 {47656#(<= 0 |~#commands~0.offset|)} is VALID [2022-02-20 23:38:27,995 INFO L290 TraceCheckUtils]: 12: Hoare triple {47656#(<= 0 |~#commands~0.offset|)} assume ~state~0 >= #t~mem5#1;havoc #t~mem5#1; {47656#(<= 0 |~#commands~0.offset|)} is VALID [2022-02-20 23:38:27,995 INFO L290 TraceCheckUtils]: 13: Hoare triple {47656#(<= 0 |~#commands~0.offset|)} SUMMARY for call #t~mem6#1.base, #t~mem6#1.offset := read~$Pointer$(~#commands~0.base, 4 + (~#commands~0.offset + 9 * ~i~0#1), 4); srcloc: L695 {47656#(<= 0 |~#commands~0.offset|)} is VALID [2022-02-20 23:38:27,995 INFO L290 TraceCheckUtils]: 14: Hoare triple {47656#(<= 0 |~#commands~0.offset|)} assume { :begin_inline_##fun~~TO~VOID } true;##fun~~TO~VOID_#in~#fp#1.base, ##fun~~TO~VOID_#in~#fp#1.offset := #t~mem6#1.base, #t~mem6#1.offset; {47656#(<= 0 |~#commands~0.offset|)} is VALID [2022-02-20 23:38:27,996 INFO L290 TraceCheckUtils]: 15: Hoare triple {47656#(<= 0 |~#commands~0.offset|)} assume !(##fun~~TO~VOID_#in~#fp#1.base == #funAddr~c2.base && ##fun~~TO~VOID_#in~#fp#1.offset == #funAddr~c2.offset);assume { :begin_inline_c1 } true;havoc c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset, c1_~x~0#1.base, c1_~x~0#1.offset;call c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset := #Ultimate.allocOnHeap(1);c1_~x~0#1.base, c1_~x~0#1.offset := c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset;havoc c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset; {47656#(<= 0 |~#commands~0.offset|)} is VALID [2022-02-20 23:38:27,996 INFO L290 TraceCheckUtils]: 16: Hoare triple {47656#(<= 0 |~#commands~0.offset|)} assume !(c1_~x~0#1.base == 0 && c1_~x~0#1.offset == 0); {47656#(<= 0 |~#commands~0.offset|)} is VALID [2022-02-20 23:38:27,996 INFO L290 TraceCheckUtils]: 17: Hoare triple {47656#(<= 0 |~#commands~0.offset|)} assume !(~global~0.base != 0 || ~global~0.offset != 0); {47656#(<= 0 |~#commands~0.offset|)} is VALID [2022-02-20 23:38:27,996 INFO L290 TraceCheckUtils]: 18: Hoare triple {47656#(<= 0 |~#commands~0.offset|)} ~global~0.base, ~global~0.offset := c1_~x~0#1.base, c1_~x~0#1.offset;~state~0 := ~unnamed3~0~STATE_2; {47656#(<= 0 |~#commands~0.offset|)} is VALID [2022-02-20 23:38:27,997 INFO L290 TraceCheckUtils]: 19: Hoare triple {47656#(<= 0 |~#commands~0.offset|)} assume { :end_inline_c1 } true; {47656#(<= 0 |~#commands~0.offset|)} is VALID [2022-02-20 23:38:27,997 INFO L290 TraceCheckUtils]: 20: Hoare triple {47656#(<= 0 |~#commands~0.offset|)} assume { :end_inline_##fun~~TO~VOID } true;havoc #t~mem6#1.base, #t~mem6#1.offset; {47656#(<= 0 |~#commands~0.offset|)} is VALID [2022-02-20 23:38:27,997 INFO L290 TraceCheckUtils]: 21: Hoare triple {47656#(<= 0 |~#commands~0.offset|)} assume true; {47656#(<= 0 |~#commands~0.offset|)} is VALID [2022-02-20 23:38:27,998 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {47656#(<= 0 |~#commands~0.offset|)} {47656#(<= 0 |~#commands~0.offset|)} #101#return; {47656#(<= 0 |~#commands~0.offset|)} is VALID [2022-02-20 23:38:27,998 INFO L272 TraceCheckUtils]: 23: Hoare triple {47656#(<= 0 |~#commands~0.offset|)} call parse_input(4, 0); {47656#(<= 0 |~#commands~0.offset|)} is VALID [2022-02-20 23:38:27,998 INFO L290 TraceCheckUtils]: 24: Hoare triple {47656#(<= 0 |~#commands~0.offset|)} ~input#1.base, ~input#1.offset := #in~input#1.base, #in~input#1.offset;~i~0#1 := 0; {47783#(and (<= 0 |~#commands~0.offset|) (<= 0 |parse_input_~i~0#1|))} is VALID [2022-02-20 23:38:27,999 INFO L290 TraceCheckUtils]: 25: Hoare triple {47783#(and (<= 0 |~#commands~0.offset|) (<= 0 |parse_input_~i~0#1|))} assume !!(~i~0#1 < 2); {47783#(and (<= 0 |~#commands~0.offset|) (<= 0 |parse_input_~i~0#1|))} is VALID [2022-02-20 23:38:27,999 INFO L290 TraceCheckUtils]: 26: Hoare triple {47783#(and (<= 0 |~#commands~0.offset|) (<= 0 |parse_input_~i~0#1|))} SUMMARY for call #t~mem3#1.base, #t~mem3#1.offset := read~$Pointer$(~#commands~0.base, ~#commands~0.offset + 9 * ~i~0#1, 4); srcloc: L693 {47790#(and (<= 0 |~#commands~0.offset|) (<= 0 |parse_input_~i~0#1|) (= (select |#valid| |~#commands~0.base|) 1))} is VALID [2022-02-20 23:38:27,999 INFO L290 TraceCheckUtils]: 27: Hoare triple {47790#(and (<= 0 |~#commands~0.offset|) (<= 0 |parse_input_~i~0#1|) (= (select |#valid| |~#commands~0.base|) 1))} assume 1 == #valid[#t~mem3#1.base]; {47790#(and (<= 0 |~#commands~0.offset|) (<= 0 |parse_input_~i~0#1|) (= (select |#valid| |~#commands~0.base|) 1))} is VALID [2022-02-20 23:38:28,000 INFO L290 TraceCheckUtils]: 28: Hoare triple {47790#(and (<= 0 |~#commands~0.offset|) (<= 0 |parse_input_~i~0#1|) (= (select |#valid| |~#commands~0.base|) 1))} assume #t~mem3#1.offset < #length[#t~mem3#1.base] && #t~mem3#1.offset >= 0; {47790#(and (<= 0 |~#commands~0.offset|) (<= 0 |parse_input_~i~0#1|) (= (select |#valid| |~#commands~0.base|) 1))} is VALID [2022-02-20 23:38:28,001 INFO L290 TraceCheckUtils]: 29: Hoare triple {47790#(and (<= 0 |~#commands~0.offset|) (<= 0 |parse_input_~i~0#1|) (= (select |#valid| |~#commands~0.base|) 1))} assume 1 == #valid[~input#1.base]; {47790#(and (<= 0 |~#commands~0.offset|) (<= 0 |parse_input_~i~0#1|) (= (select |#valid| |~#commands~0.base|) 1))} is VALID [2022-02-20 23:38:28,001 INFO L290 TraceCheckUtils]: 30: Hoare triple {47790#(and (<= 0 |~#commands~0.offset|) (<= 0 |parse_input_~i~0#1|) (= (select |#valid| |~#commands~0.base|) 1))} assume ~input#1.offset < #length[~input#1.base] && ~input#1.offset >= 0; {47790#(and (<= 0 |~#commands~0.offset|) (<= 0 |parse_input_~i~0#1|) (= (select |#valid| |~#commands~0.base|) 1))} is VALID [2022-02-20 23:38:28,002 INFO L290 TraceCheckUtils]: 31: Hoare triple {47790#(and (<= 0 |~#commands~0.offset|) (<= 0 |parse_input_~i~0#1|) (= (select |#valid| |~#commands~0.base|) 1))} assume 0 == #t~nondet4#1;havoc #t~mem3#1.base, #t~mem3#1.offset;havoc #t~nondet4#1; {47790#(and (<= 0 |~#commands~0.offset|) (<= 0 |parse_input_~i~0#1|) (= (select |#valid| |~#commands~0.base|) 1))} is VALID [2022-02-20 23:38:28,002 INFO L290 TraceCheckUtils]: 32: Hoare triple {47790#(and (<= 0 |~#commands~0.offset|) (<= 0 |parse_input_~i~0#1|) (= (select |#valid| |~#commands~0.base|) 1))} SUMMARY for call #t~mem5#1 := read~int(~#commands~0.base, 8 + (~#commands~0.offset + 9 * ~i~0#1), 1); srcloc: L694 {47809#(and (<= 0 (div (+ (- 9) (* (- 1) |~#commands~0.offset|) (select |#length| |~#commands~0.base|)) 9)) (<= 0 |~#commands~0.offset|) (= (select |#valid| |~#commands~0.base|) 1))} is VALID [2022-02-20 23:38:28,003 INFO L290 TraceCheckUtils]: 33: Hoare triple {47809#(and (<= 0 (div (+ (- 9) (* (- 1) |~#commands~0.offset|) (select |#length| |~#commands~0.base|)) 9)) (<= 0 |~#commands~0.offset|) (= (select |#valid| |~#commands~0.base|) 1))} assume ~state~0 >= #t~mem5#1;havoc #t~mem5#1; {47809#(and (<= 0 (div (+ (- 9) (* (- 1) |~#commands~0.offset|) (select |#length| |~#commands~0.base|)) 9)) (<= 0 |~#commands~0.offset|) (= (select |#valid| |~#commands~0.base|) 1))} is VALID [2022-02-20 23:38:28,003 INFO L290 TraceCheckUtils]: 34: Hoare triple {47809#(and (<= 0 (div (+ (- 9) (* (- 1) |~#commands~0.offset|) (select |#length| |~#commands~0.base|)) 9)) (<= 0 |~#commands~0.offset|) (= (select |#valid| |~#commands~0.base|) 1))} SUMMARY for call #t~mem6#1.base, #t~mem6#1.offset := read~$Pointer$(~#commands~0.base, 4 + (~#commands~0.offset + 9 * ~i~0#1), 4); srcloc: L695 {47809#(and (<= 0 (div (+ (- 9) (* (- 1) |~#commands~0.offset|) (select |#length| |~#commands~0.base|)) 9)) (<= 0 |~#commands~0.offset|) (= (select |#valid| |~#commands~0.base|) 1))} is VALID [2022-02-20 23:38:28,004 INFO L290 TraceCheckUtils]: 35: Hoare triple {47809#(and (<= 0 (div (+ (- 9) (* (- 1) |~#commands~0.offset|) (select |#length| |~#commands~0.base|)) 9)) (<= 0 |~#commands~0.offset|) (= (select |#valid| |~#commands~0.base|) 1))} assume { :begin_inline_##fun~~TO~VOID } true;##fun~~TO~VOID_#in~#fp#1.base, ##fun~~TO~VOID_#in~#fp#1.offset := #t~mem6#1.base, #t~mem6#1.offset; {47809#(and (<= 0 (div (+ (- 9) (* (- 1) |~#commands~0.offset|) (select |#length| |~#commands~0.base|)) 9)) (<= 0 |~#commands~0.offset|) (= (select |#valid| |~#commands~0.base|) 1))} is VALID [2022-02-20 23:38:28,016 INFO L290 TraceCheckUtils]: 36: Hoare triple {47809#(and (<= 0 (div (+ (- 9) (* (- 1) |~#commands~0.offset|) (select |#length| |~#commands~0.base|)) 9)) (<= 0 |~#commands~0.offset|) (= (select |#valid| |~#commands~0.base|) 1))} assume !(##fun~~TO~VOID_#in~#fp#1.base == #funAddr~c2.base && ##fun~~TO~VOID_#in~#fp#1.offset == #funAddr~c2.offset);assume { :begin_inline_c1 } true;havoc c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset, c1_~x~0#1.base, c1_~x~0#1.offset;call c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset := #Ultimate.allocOnHeap(1);c1_~x~0#1.base, c1_~x~0#1.offset := c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset;havoc c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset; {47700#(and (<= 0 |~#commands~0.offset|) (<= (+ |~#commands~0.offset| 9) (select |#length| |~#commands~0.base|)))} is VALID [2022-02-20 23:38:28,016 INFO L290 TraceCheckUtils]: 37: Hoare triple {47700#(and (<= 0 |~#commands~0.offset|) (<= (+ |~#commands~0.offset| 9) (select |#length| |~#commands~0.base|)))} assume !(c1_~x~0#1.base == 0 && c1_~x~0#1.offset == 0); {47700#(and (<= 0 |~#commands~0.offset|) (<= (+ |~#commands~0.offset| 9) (select |#length| |~#commands~0.base|)))} is VALID [2022-02-20 23:38:28,017 INFO L290 TraceCheckUtils]: 38: Hoare triple {47700#(and (<= 0 |~#commands~0.offset|) (<= (+ |~#commands~0.offset| 9) (select |#length| |~#commands~0.base|)))} assume ~global~0.base != 0 || ~global~0.offset != 0; {47700#(and (<= 0 |~#commands~0.offset|) (<= (+ |~#commands~0.offset| 9) (select |#length| |~#commands~0.base|)))} is VALID [2022-02-20 23:38:28,017 INFO L290 TraceCheckUtils]: 39: Hoare triple {47700#(and (<= 0 |~#commands~0.offset|) (<= (+ |~#commands~0.offset| 9) (select |#length| |~#commands~0.base|)))} assume 0 == ~global~0.offset; {47700#(and (<= 0 |~#commands~0.offset|) (<= (+ |~#commands~0.offset| 9) (select |#length| |~#commands~0.base|)))} is VALID [2022-02-20 23:38:28,018 INFO L290 TraceCheckUtils]: 40: Hoare triple {47700#(and (<= 0 |~#commands~0.offset|) (<= (+ |~#commands~0.offset| 9) (select |#length| |~#commands~0.base|)))} assume ~global~0.base < #StackHeapBarrier; {47700#(and (<= 0 |~#commands~0.offset|) (<= (+ |~#commands~0.offset| 9) (select |#length| |~#commands~0.base|)))} is VALID [2022-02-20 23:38:28,018 INFO L290 TraceCheckUtils]: 41: Hoare triple {47700#(and (<= 0 |~#commands~0.offset|) (<= (+ |~#commands~0.offset| 9) (select |#length| |~#commands~0.base|)))} assume 0 == ~global~0.base || 1 == #valid[~global~0.base];call ULTIMATE.dealloc(~global~0.base, ~global~0.offset); {47700#(and (<= 0 |~#commands~0.offset|) (<= (+ |~#commands~0.offset| 9) (select |#length| |~#commands~0.base|)))} is VALID [2022-02-20 23:38:28,019 INFO L290 TraceCheckUtils]: 42: Hoare triple {47700#(and (<= 0 |~#commands~0.offset|) (<= (+ |~#commands~0.offset| 9) (select |#length| |~#commands~0.base|)))} ~global~0.base, ~global~0.offset := c1_~x~0#1.base, c1_~x~0#1.offset;~state~0 := ~unnamed3~0~STATE_2; {47700#(and (<= 0 |~#commands~0.offset|) (<= (+ |~#commands~0.offset| 9) (select |#length| |~#commands~0.base|)))} is VALID [2022-02-20 23:38:28,019 INFO L290 TraceCheckUtils]: 43: Hoare triple {47700#(and (<= 0 |~#commands~0.offset|) (<= (+ |~#commands~0.offset| 9) (select |#length| |~#commands~0.base|)))} assume { :end_inline_c1 } true; {47700#(and (<= 0 |~#commands~0.offset|) (<= (+ |~#commands~0.offset| 9) (select |#length| |~#commands~0.base|)))} is VALID [2022-02-20 23:38:28,020 INFO L290 TraceCheckUtils]: 44: Hoare triple {47700#(and (<= 0 |~#commands~0.offset|) (<= (+ |~#commands~0.offset| 9) (select |#length| |~#commands~0.base|)))} assume { :end_inline_##fun~~TO~VOID } true;havoc #t~mem6#1.base, #t~mem6#1.offset; {47700#(and (<= 0 |~#commands~0.offset|) (<= (+ |~#commands~0.offset| 9) (select |#length| |~#commands~0.base|)))} is VALID [2022-02-20 23:38:28,020 INFO L290 TraceCheckUtils]: 45: Hoare triple {47700#(and (<= 0 |~#commands~0.offset|) (<= (+ |~#commands~0.offset| 9) (select |#length| |~#commands~0.base|)))} assume true; {47700#(and (<= 0 |~#commands~0.offset|) (<= (+ |~#commands~0.offset| 9) (select |#length| |~#commands~0.base|)))} is VALID [2022-02-20 23:38:28,021 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {47700#(and (<= 0 |~#commands~0.offset|) (<= (+ |~#commands~0.offset| 9) (select |#length| |~#commands~0.base|)))} {47656#(<= 0 |~#commands~0.offset|)} #103#return; {47700#(and (<= 0 |~#commands~0.offset|) (<= (+ |~#commands~0.offset| 9) (select |#length| |~#commands~0.base|)))} is VALID [2022-02-20 23:38:28,021 INFO L272 TraceCheckUtils]: 47: Hoare triple {47700#(and (<= 0 |~#commands~0.offset|) (<= (+ |~#commands~0.offset| 9) (select |#length| |~#commands~0.base|)))} call parse_input(5, 0); {47700#(and (<= 0 |~#commands~0.offset|) (<= (+ |~#commands~0.offset| 9) (select |#length| |~#commands~0.base|)))} is VALID [2022-02-20 23:38:28,022 INFO L290 TraceCheckUtils]: 48: Hoare triple {47700#(and (<= 0 |~#commands~0.offset|) (<= (+ |~#commands~0.offset| 9) (select |#length| |~#commands~0.base|)))} ~input#1.base, ~input#1.offset := #in~input#1.base, #in~input#1.offset;~i~0#1 := 0; {47701#(and (<= 0 |~#commands~0.offset|) (= |parse_input_~i~0#1| 0) (<= (+ |~#commands~0.offset| 9) (select |#length| |~#commands~0.base|)))} is VALID [2022-02-20 23:38:28,022 INFO L290 TraceCheckUtils]: 49: Hoare triple {47701#(and (<= 0 |~#commands~0.offset|) (= |parse_input_~i~0#1| 0) (<= (+ |~#commands~0.offset| 9) (select |#length| |~#commands~0.base|)))} assume !!(~i~0#1 < 2); {47701#(and (<= 0 |~#commands~0.offset|) (= |parse_input_~i~0#1| 0) (<= (+ |~#commands~0.offset| 9) (select |#length| |~#commands~0.base|)))} is VALID [2022-02-20 23:38:28,023 INFO L290 TraceCheckUtils]: 50: Hoare triple {47701#(and (<= 0 |~#commands~0.offset|) (= |parse_input_~i~0#1| 0) (<= (+ |~#commands~0.offset| 9) (select |#length| |~#commands~0.base|)))} assume !(4 + (~#commands~0.offset + 9 * ~i~0#1) <= #length[~#commands~0.base] && 0 <= ~#commands~0.offset + 9 * ~i~0#1); {47655#false} is VALID [2022-02-20 23:38:28,023 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-20 23:38:28,023 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:38:28,023 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [192315101] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:38:28,023 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-20 23:38:28,024 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9] total 12 [2022-02-20 23:38:28,024 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149413376] [2022-02-20 23:38:28,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:38:28,024 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 51 [2022-02-20 23:38:28,024 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:38:28,024 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 23:38:28,060 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:38:28,060 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 23:38:28,060 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:38:28,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 23:38:28,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2022-02-20 23:38:28,061 INFO L87 Difference]: Start difference. First operand 365 states and 433 transitions. Second operand has 8 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 23:38:28,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:38:28,403 INFO L93 Difference]: Finished difference Result 443 states and 508 transitions. [2022-02-20 23:38:28,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-20 23:38:28,403 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 51 [2022-02-20 23:38:28,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:38:28,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 23:38:28,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 113 transitions. [2022-02-20 23:38:28,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 23:38:28,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 113 transitions. [2022-02-20 23:38:28,405 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 113 transitions. [2022-02-20 23:38:28,497 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 113 edges. 113 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:38:28,503 INFO L225 Difference]: With dead ends: 443 [2022-02-20 23:38:28,503 INFO L226 Difference]: Without dead ends: 443 [2022-02-20 23:38:28,504 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2022-02-20 23:38:28,504 INFO L933 BasicCegarLoop]: 39 mSDtfsCounter, 276 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 276 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:38:28,504 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [276 Valid, 80 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:38:28,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2022-02-20 23:38:28,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 365. [2022-02-20 23:38:28,508 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:38:28,508 INFO L82 GeneralOperation]: Start isEquivalent. First operand 443 states. Second operand has 365 states, 334 states have (on average 1.221556886227545) internal successors, (408), 348 states have internal predecessors, (408), 8 states have call successors, (8), 8 states have call predecessors, (8), 12 states have return successors, (14), 8 states have call predecessors, (14), 8 states have call successors, (14) [2022-02-20 23:38:28,509 INFO L74 IsIncluded]: Start isIncluded. First operand 443 states. Second operand has 365 states, 334 states have (on average 1.221556886227545) internal successors, (408), 348 states have internal predecessors, (408), 8 states have call successors, (8), 8 states have call predecessors, (8), 12 states have return successors, (14), 8 states have call predecessors, (14), 8 states have call successors, (14) [2022-02-20 23:38:28,509 INFO L87 Difference]: Start difference. First operand 443 states. Second operand has 365 states, 334 states have (on average 1.221556886227545) internal successors, (408), 348 states have internal predecessors, (408), 8 states have call successors, (8), 8 states have call predecessors, (8), 12 states have return successors, (14), 8 states have call predecessors, (14), 8 states have call successors, (14) [2022-02-20 23:38:28,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:38:28,516 INFO L93 Difference]: Finished difference Result 443 states and 508 transitions. [2022-02-20 23:38:28,516 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 508 transitions. [2022-02-20 23:38:28,516 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:38:28,516 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:38:28,517 INFO L74 IsIncluded]: Start isIncluded. First operand has 365 states, 334 states have (on average 1.221556886227545) internal successors, (408), 348 states have internal predecessors, (408), 8 states have call successors, (8), 8 states have call predecessors, (8), 12 states have return successors, (14), 8 states have call predecessors, (14), 8 states have call successors, (14) Second operand 443 states. [2022-02-20 23:38:28,517 INFO L87 Difference]: Start difference. First operand has 365 states, 334 states have (on average 1.221556886227545) internal successors, (408), 348 states have internal predecessors, (408), 8 states have call successors, (8), 8 states have call predecessors, (8), 12 states have return successors, (14), 8 states have call predecessors, (14), 8 states have call successors, (14) Second operand 443 states. [2022-02-20 23:38:28,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:38:28,525 INFO L93 Difference]: Finished difference Result 443 states and 508 transitions. [2022-02-20 23:38:28,525 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 508 transitions. [2022-02-20 23:38:28,525 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:38:28,525 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:38:28,526 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:38:28,526 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:38:28,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 365 states, 334 states have (on average 1.221556886227545) internal successors, (408), 348 states have internal predecessors, (408), 8 states have call successors, (8), 8 states have call predecessors, (8), 12 states have return successors, (14), 8 states have call predecessors, (14), 8 states have call successors, (14) [2022-02-20 23:38:28,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 430 transitions. [2022-02-20 23:38:28,530 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 430 transitions. Word has length 51 [2022-02-20 23:38:28,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:38:28,530 INFO L470 AbstractCegarLoop]: Abstraction has 365 states and 430 transitions. [2022-02-20 23:38:28,531 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 23:38:28,531 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 430 transitions. [2022-02-20 23:38:28,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-02-20 23:38:28,531 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:38:28,531 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:38:28,548 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2022-02-20 23:38:28,748 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:38:28,748 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting parse_inputErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATION, parse_inputErr1REQUIRES_VIOLATION, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2022-02-20 23:38:28,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:38:28,749 INFO L85 PathProgramCache]: Analyzing trace with hash -167943901, now seen corresponding path program 1 times [2022-02-20 23:38:28,749 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:38:28,749 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618682095] [2022-02-20 23:38:28,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:38:28,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:38:28,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:38:28,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 23:38:28,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:38:28,810 INFO L290 TraceCheckUtils]: 0: Hoare triple {49608#(and (= ~global~0.base |old(~global~0.base)|) (= |old(#length)| |#length|) (= |old(~global~0.offset)| ~global~0.offset) (= ~state~0 |old(~state~0)|) (= |old(#valid)| |#valid|))} ~input#1.base, ~input#1.offset := #in~input#1.base, #in~input#1.offset;~i~0#1 := 0; {49609#(= |old(#length)| |#length|)} is VALID [2022-02-20 23:38:28,811 INFO L290 TraceCheckUtils]: 1: Hoare triple {49609#(= |old(#length)| |#length|)} assume !!(~i~0#1 < 2); {49609#(= |old(#length)| |#length|)} is VALID [2022-02-20 23:38:28,811 INFO L290 TraceCheckUtils]: 2: Hoare triple {49609#(= |old(#length)| |#length|)} SUMMARY for call #t~mem3#1.base, #t~mem3#1.offset := read~$Pointer$(~#commands~0.base, ~#commands~0.offset + 9 * ~i~0#1, 4); srcloc: L693 {49609#(= |old(#length)| |#length|)} is VALID [2022-02-20 23:38:28,811 INFO L290 TraceCheckUtils]: 3: Hoare triple {49609#(= |old(#length)| |#length|)} assume 1 == #valid[#t~mem3#1.base]; {49609#(= |old(#length)| |#length|)} is VALID [2022-02-20 23:38:28,812 INFO L290 TraceCheckUtils]: 4: Hoare triple {49609#(= |old(#length)| |#length|)} assume #t~mem3#1.offset < #length[#t~mem3#1.base] && #t~mem3#1.offset >= 0; {49609#(= |old(#length)| |#length|)} is VALID [2022-02-20 23:38:28,812 INFO L290 TraceCheckUtils]: 5: Hoare triple {49609#(= |old(#length)| |#length|)} assume 1 == #valid[~input#1.base]; {49609#(= |old(#length)| |#length|)} is VALID [2022-02-20 23:38:28,812 INFO L290 TraceCheckUtils]: 6: Hoare triple {49609#(= |old(#length)| |#length|)} assume ~input#1.offset < #length[~input#1.base] && ~input#1.offset >= 0; {49609#(= |old(#length)| |#length|)} is VALID [2022-02-20 23:38:28,812 INFO L290 TraceCheckUtils]: 7: Hoare triple {49609#(= |old(#length)| |#length|)} assume !(0 == #t~nondet4#1);havoc #t~mem3#1.base, #t~mem3#1.offset;havoc #t~nondet4#1; {49609#(= |old(#length)| |#length|)} is VALID [2022-02-20 23:38:28,813 INFO L290 TraceCheckUtils]: 8: Hoare triple {49609#(= |old(#length)| |#length|)} #t~post2#1 := ~i~0#1;~i~0#1 := 1 + #t~post2#1;havoc #t~post2#1; {49609#(= |old(#length)| |#length|)} is VALID [2022-02-20 23:38:28,813 INFO L290 TraceCheckUtils]: 9: Hoare triple {49609#(= |old(#length)| |#length|)} assume !!(~i~0#1 < 2); {49609#(= |old(#length)| |#length|)} is VALID [2022-02-20 23:38:28,813 INFO L290 TraceCheckUtils]: 10: Hoare triple {49609#(= |old(#length)| |#length|)} SUMMARY for call #t~mem3#1.base, #t~mem3#1.offset := read~$Pointer$(~#commands~0.base, ~#commands~0.offset + 9 * ~i~0#1, 4); srcloc: L693 {49609#(= |old(#length)| |#length|)} is VALID [2022-02-20 23:38:28,813 INFO L290 TraceCheckUtils]: 11: Hoare triple {49609#(= |old(#length)| |#length|)} assume 1 == #valid[#t~mem3#1.base]; {49609#(= |old(#length)| |#length|)} is VALID [2022-02-20 23:38:28,814 INFO L290 TraceCheckUtils]: 12: Hoare triple {49609#(= |old(#length)| |#length|)} assume #t~mem3#1.offset < #length[#t~mem3#1.base] && #t~mem3#1.offset >= 0; {49609#(= |old(#length)| |#length|)} is VALID [2022-02-20 23:38:28,814 INFO L290 TraceCheckUtils]: 13: Hoare triple {49609#(= |old(#length)| |#length|)} assume 1 == #valid[~input#1.base]; {49609#(= |old(#length)| |#length|)} is VALID [2022-02-20 23:38:28,814 INFO L290 TraceCheckUtils]: 14: Hoare triple {49609#(= |old(#length)| |#length|)} assume ~input#1.offset < #length[~input#1.base] && ~input#1.offset >= 0; {49609#(= |old(#length)| |#length|)} is VALID [2022-02-20 23:38:28,815 INFO L290 TraceCheckUtils]: 15: Hoare triple {49609#(= |old(#length)| |#length|)} assume !(0 == #t~nondet4#1);havoc #t~mem3#1.base, #t~mem3#1.offset;havoc #t~nondet4#1; {49609#(= |old(#length)| |#length|)} is VALID [2022-02-20 23:38:28,815 INFO L290 TraceCheckUtils]: 16: Hoare triple {49609#(= |old(#length)| |#length|)} #t~post2#1 := ~i~0#1;~i~0#1 := 1 + #t~post2#1;havoc #t~post2#1; {49609#(= |old(#length)| |#length|)} is VALID [2022-02-20 23:38:28,815 INFO L290 TraceCheckUtils]: 17: Hoare triple {49609#(= |old(#length)| |#length|)} assume !(~i~0#1 < 2); {49609#(= |old(#length)| |#length|)} is VALID [2022-02-20 23:38:28,815 INFO L290 TraceCheckUtils]: 18: Hoare triple {49609#(= |old(#length)| |#length|)} assume true; {49609#(= |old(#length)| |#length|)} is VALID [2022-02-20 23:38:28,816 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {49609#(= |old(#length)| |#length|)} {49565#(= 3 (select |#length| 5))} #101#return; {49565#(= 3 (select |#length| 5))} is VALID [2022-02-20 23:38:28,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-02-20 23:38:28,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:38:28,850 INFO L290 TraceCheckUtils]: 0: Hoare triple {49608#(and (= ~global~0.base |old(~global~0.base)|) (= |old(#length)| |#length|) (= |old(~global~0.offset)| ~global~0.offset) (= ~state~0 |old(~state~0)|) (= |old(#valid)| |#valid|))} ~input#1.base, ~input#1.offset := #in~input#1.base, #in~input#1.offset;~i~0#1 := 0; {49609#(= |old(#length)| |#length|)} is VALID [2022-02-20 23:38:28,850 INFO L290 TraceCheckUtils]: 1: Hoare triple {49609#(= |old(#length)| |#length|)} assume !!(~i~0#1 < 2); {49609#(= |old(#length)| |#length|)} is VALID [2022-02-20 23:38:28,850 INFO L290 TraceCheckUtils]: 2: Hoare triple {49609#(= |old(#length)| |#length|)} SUMMARY for call #t~mem3#1.base, #t~mem3#1.offset := read~$Pointer$(~#commands~0.base, ~#commands~0.offset + 9 * ~i~0#1, 4); srcloc: L693 {49609#(= |old(#length)| |#length|)} is VALID [2022-02-20 23:38:28,851 INFO L290 TraceCheckUtils]: 3: Hoare triple {49609#(= |old(#length)| |#length|)} assume 1 == #valid[#t~mem3#1.base]; {49609#(= |old(#length)| |#length|)} is VALID [2022-02-20 23:38:28,851 INFO L290 TraceCheckUtils]: 4: Hoare triple {49609#(= |old(#length)| |#length|)} assume #t~mem3#1.offset < #length[#t~mem3#1.base] && #t~mem3#1.offset >= 0; {49609#(= |old(#length)| |#length|)} is VALID [2022-02-20 23:38:28,851 INFO L290 TraceCheckUtils]: 5: Hoare triple {49609#(= |old(#length)| |#length|)} assume 1 == #valid[~input#1.base]; {49609#(= |old(#length)| |#length|)} is VALID [2022-02-20 23:38:28,851 INFO L290 TraceCheckUtils]: 6: Hoare triple {49609#(= |old(#length)| |#length|)} assume ~input#1.offset < #length[~input#1.base] && ~input#1.offset >= 0; {49609#(= |old(#length)| |#length|)} is VALID [2022-02-20 23:38:28,852 INFO L290 TraceCheckUtils]: 7: Hoare triple {49609#(= |old(#length)| |#length|)} assume !(0 == #t~nondet4#1);havoc #t~mem3#1.base, #t~mem3#1.offset;havoc #t~nondet4#1; {49609#(= |old(#length)| |#length|)} is VALID [2022-02-20 23:38:28,852 INFO L290 TraceCheckUtils]: 8: Hoare triple {49609#(= |old(#length)| |#length|)} #t~post2#1 := ~i~0#1;~i~0#1 := 1 + #t~post2#1;havoc #t~post2#1; {49609#(= |old(#length)| |#length|)} is VALID [2022-02-20 23:38:28,852 INFO L290 TraceCheckUtils]: 9: Hoare triple {49609#(= |old(#length)| |#length|)} assume !!(~i~0#1 < 2); {49609#(= |old(#length)| |#length|)} is VALID [2022-02-20 23:38:28,852 INFO L290 TraceCheckUtils]: 10: Hoare triple {49609#(= |old(#length)| |#length|)} SUMMARY for call #t~mem3#1.base, #t~mem3#1.offset := read~$Pointer$(~#commands~0.base, ~#commands~0.offset + 9 * ~i~0#1, 4); srcloc: L693 {49609#(= |old(#length)| |#length|)} is VALID [2022-02-20 23:38:28,853 INFO L290 TraceCheckUtils]: 11: Hoare triple {49609#(= |old(#length)| |#length|)} assume 1 == #valid[#t~mem3#1.base]; {49609#(= |old(#length)| |#length|)} is VALID [2022-02-20 23:38:28,853 INFO L290 TraceCheckUtils]: 12: Hoare triple {49609#(= |old(#length)| |#length|)} assume #t~mem3#1.offset < #length[#t~mem3#1.base] && #t~mem3#1.offset >= 0; {49609#(= |old(#length)| |#length|)} is VALID [2022-02-20 23:38:28,853 INFO L290 TraceCheckUtils]: 13: Hoare triple {49609#(= |old(#length)| |#length|)} assume 1 == #valid[~input#1.base]; {49609#(= |old(#length)| |#length|)} is VALID [2022-02-20 23:38:28,853 INFO L290 TraceCheckUtils]: 14: Hoare triple {49609#(= |old(#length)| |#length|)} assume ~input#1.offset < #length[~input#1.base] && ~input#1.offset >= 0; {49609#(= |old(#length)| |#length|)} is VALID [2022-02-20 23:38:28,854 INFO L290 TraceCheckUtils]: 15: Hoare triple {49609#(= |old(#length)| |#length|)} assume !(0 == #t~nondet4#1);havoc #t~mem3#1.base, #t~mem3#1.offset;havoc #t~nondet4#1; {49609#(= |old(#length)| |#length|)} is VALID [2022-02-20 23:38:28,854 INFO L290 TraceCheckUtils]: 16: Hoare triple {49609#(= |old(#length)| |#length|)} #t~post2#1 := ~i~0#1;~i~0#1 := 1 + #t~post2#1;havoc #t~post2#1; {49609#(= |old(#length)| |#length|)} is VALID [2022-02-20 23:38:28,854 INFO L290 TraceCheckUtils]: 17: Hoare triple {49609#(= |old(#length)| |#length|)} assume !(~i~0#1 < 2); {49609#(= |old(#length)| |#length|)} is VALID [2022-02-20 23:38:28,854 INFO L290 TraceCheckUtils]: 18: Hoare triple {49609#(= |old(#length)| |#length|)} assume true; {49609#(= |old(#length)| |#length|)} is VALID [2022-02-20 23:38:28,855 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {49609#(= |old(#length)| |#length|)} {49565#(= 3 (select |#length| 5))} #103#return; {49565#(= 3 (select |#length| 5))} is VALID [2022-02-20 23:38:28,856 INFO L290 TraceCheckUtils]: 0: Hoare triple {49563#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(3, 1);call write~init~int(99, 1, 0, 1);call write~init~int(49, 1, 1, 1);call write~init~int(0, 1, 2, 1);call #Ultimate.allocInit(3, 2);call write~init~int(99, 2, 0, 1);call write~init~int(50, 2, 1, 1);call write~init~int(0, 2, 2, 1);call #Ultimate.allocInit(3, 3);call write~init~int(99, 3, 0, 1);call write~init~int(49, 3, 1, 1);call write~init~int(0, 3, 2, 1);call #Ultimate.allocInit(3, 4);call write~init~int(99, 4, 0, 1);call write~init~int(49, 4, 1, 1);call write~init~int(0, 4, 2, 1);call #Ultimate.allocInit(3, 5);call write~init~int(99, 5, 0, 1);call write~init~int(50, 5, 1, 1);call write~init~int(0, 5, 2, 1);~state~0 := ~unnamed3~0~STATE_1;~global~0.base, ~global~0.offset := 0, 0;~#commands~0.base, ~#commands~0.offset := 6, 0;call #Ultimate.allocInit(18, 6);call write~init~$Pointer$(1, 0, ~#commands~0.base, ~#commands~0.offset, 4);call write~init~$Pointer$(#funAddr~c1.base, #funAddr~c1.offset, ~#commands~0.base, 4 + ~#commands~0.offset, 4);call write~init~int((if ~unnamed3~0~STATE_1 % 256 <= 127 then ~unnamed3~0~STATE_1 % 256 else ~unnamed3~0~STATE_1 % 256 - 256), ~#commands~0.base, 8 + ~#commands~0.offset, 1);call write~init~$Pointer$(2, 0, ~#commands~0.base, 9 + ~#commands~0.offset, 4);call write~init~$Pointer$(#funAddr~c2.base, #funAddr~c2.offset, ~#commands~0.base, 13 + ~#commands~0.offset, 4);call write~init~int((if ~unnamed3~0~STATE_2 % 256 <= 127 then ~unnamed3~0~STATE_2 % 256 else ~unnamed3~0~STATE_2 % 256 - 256), ~#commands~0.base, 17 + ~#commands~0.offset, 1); {49565#(= 3 (select |#length| 5))} is VALID [2022-02-20 23:38:28,856 INFO L290 TraceCheckUtils]: 1: Hoare triple {49565#(= 3 (select |#length| 5))} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1; {49565#(= 3 (select |#length| 5))} is VALID [2022-02-20 23:38:28,857 INFO L272 TraceCheckUtils]: 2: Hoare triple {49565#(= 3 (select |#length| 5))} call parse_input(3, 0); {49608#(and (= ~global~0.base |old(~global~0.base)|) (= |old(#length)| |#length|) (= |old(~global~0.offset)| ~global~0.offset) (= ~state~0 |old(~state~0)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 23:38:28,857 INFO L290 TraceCheckUtils]: 3: Hoare triple {49608#(and (= ~global~0.base |old(~global~0.base)|) (= |old(#length)| |#length|) (= |old(~global~0.offset)| ~global~0.offset) (= ~state~0 |old(~state~0)|) (= |old(#valid)| |#valid|))} ~input#1.base, ~input#1.offset := #in~input#1.base, #in~input#1.offset;~i~0#1 := 0; {49609#(= |old(#length)| |#length|)} is VALID [2022-02-20 23:38:28,857 INFO L290 TraceCheckUtils]: 4: Hoare triple {49609#(= |old(#length)| |#length|)} assume !!(~i~0#1 < 2); {49609#(= |old(#length)| |#length|)} is VALID [2022-02-20 23:38:28,858 INFO L290 TraceCheckUtils]: 5: Hoare triple {49609#(= |old(#length)| |#length|)} SUMMARY for call #t~mem3#1.base, #t~mem3#1.offset := read~$Pointer$(~#commands~0.base, ~#commands~0.offset + 9 * ~i~0#1, 4); srcloc: L693 {49609#(= |old(#length)| |#length|)} is VALID [2022-02-20 23:38:28,858 INFO L290 TraceCheckUtils]: 6: Hoare triple {49609#(= |old(#length)| |#length|)} assume 1 == #valid[#t~mem3#1.base]; {49609#(= |old(#length)| |#length|)} is VALID [2022-02-20 23:38:28,858 INFO L290 TraceCheckUtils]: 7: Hoare triple {49609#(= |old(#length)| |#length|)} assume #t~mem3#1.offset < #length[#t~mem3#1.base] && #t~mem3#1.offset >= 0; {49609#(= |old(#length)| |#length|)} is VALID [2022-02-20 23:38:28,858 INFO L290 TraceCheckUtils]: 8: Hoare triple {49609#(= |old(#length)| |#length|)} assume 1 == #valid[~input#1.base]; {49609#(= |old(#length)| |#length|)} is VALID [2022-02-20 23:38:28,859 INFO L290 TraceCheckUtils]: 9: Hoare triple {49609#(= |old(#length)| |#length|)} assume ~input#1.offset < #length[~input#1.base] && ~input#1.offset >= 0; {49609#(= |old(#length)| |#length|)} is VALID [2022-02-20 23:38:28,859 INFO L290 TraceCheckUtils]: 10: Hoare triple {49609#(= |old(#length)| |#length|)} assume !(0 == #t~nondet4#1);havoc #t~mem3#1.base, #t~mem3#1.offset;havoc #t~nondet4#1; {49609#(= |old(#length)| |#length|)} is VALID [2022-02-20 23:38:28,859 INFO L290 TraceCheckUtils]: 11: Hoare triple {49609#(= |old(#length)| |#length|)} #t~post2#1 := ~i~0#1;~i~0#1 := 1 + #t~post2#1;havoc #t~post2#1; {49609#(= |old(#length)| |#length|)} is VALID [2022-02-20 23:38:28,860 INFO L290 TraceCheckUtils]: 12: Hoare triple {49609#(= |old(#length)| |#length|)} assume !!(~i~0#1 < 2); {49609#(= |old(#length)| |#length|)} is VALID [2022-02-20 23:38:28,860 INFO L290 TraceCheckUtils]: 13: Hoare triple {49609#(= |old(#length)| |#length|)} SUMMARY for call #t~mem3#1.base, #t~mem3#1.offset := read~$Pointer$(~#commands~0.base, ~#commands~0.offset + 9 * ~i~0#1, 4); srcloc: L693 {49609#(= |old(#length)| |#length|)} is VALID [2022-02-20 23:38:28,860 INFO L290 TraceCheckUtils]: 14: Hoare triple {49609#(= |old(#length)| |#length|)} assume 1 == #valid[#t~mem3#1.base]; {49609#(= |old(#length)| |#length|)} is VALID [2022-02-20 23:38:28,860 INFO L290 TraceCheckUtils]: 15: Hoare triple {49609#(= |old(#length)| |#length|)} assume #t~mem3#1.offset < #length[#t~mem3#1.base] && #t~mem3#1.offset >= 0; {49609#(= |old(#length)| |#length|)} is VALID [2022-02-20 23:38:28,860 INFO L290 TraceCheckUtils]: 16: Hoare triple {49609#(= |old(#length)| |#length|)} assume 1 == #valid[~input#1.base]; {49609#(= |old(#length)| |#length|)} is VALID [2022-02-20 23:38:28,861 INFO L290 TraceCheckUtils]: 17: Hoare triple {49609#(= |old(#length)| |#length|)} assume ~input#1.offset < #length[~input#1.base] && ~input#1.offset >= 0; {49609#(= |old(#length)| |#length|)} is VALID [2022-02-20 23:38:28,861 INFO L290 TraceCheckUtils]: 18: Hoare triple {49609#(= |old(#length)| |#length|)} assume !(0 == #t~nondet4#1);havoc #t~mem3#1.base, #t~mem3#1.offset;havoc #t~nondet4#1; {49609#(= |old(#length)| |#length|)} is VALID [2022-02-20 23:38:28,861 INFO L290 TraceCheckUtils]: 19: Hoare triple {49609#(= |old(#length)| |#length|)} #t~post2#1 := ~i~0#1;~i~0#1 := 1 + #t~post2#1;havoc #t~post2#1; {49609#(= |old(#length)| |#length|)} is VALID [2022-02-20 23:38:28,861 INFO L290 TraceCheckUtils]: 20: Hoare triple {49609#(= |old(#length)| |#length|)} assume !(~i~0#1 < 2); {49609#(= |old(#length)| |#length|)} is VALID [2022-02-20 23:38:28,862 INFO L290 TraceCheckUtils]: 21: Hoare triple {49609#(= |old(#length)| |#length|)} assume true; {49609#(= |old(#length)| |#length|)} is VALID [2022-02-20 23:38:28,862 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {49609#(= |old(#length)| |#length|)} {49565#(= 3 (select |#length| 5))} #101#return; {49565#(= 3 (select |#length| 5))} is VALID [2022-02-20 23:38:28,863 INFO L272 TraceCheckUtils]: 23: Hoare triple {49565#(= 3 (select |#length| 5))} call parse_input(4, 0); {49608#(and (= ~global~0.base |old(~global~0.base)|) (= |old(#length)| |#length|) (= |old(~global~0.offset)| ~global~0.offset) (= ~state~0 |old(~state~0)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 23:38:28,863 INFO L290 TraceCheckUtils]: 24: Hoare triple {49608#(and (= ~global~0.base |old(~global~0.base)|) (= |old(#length)| |#length|) (= |old(~global~0.offset)| ~global~0.offset) (= ~state~0 |old(~state~0)|) (= |old(#valid)| |#valid|))} ~input#1.base, ~input#1.offset := #in~input#1.base, #in~input#1.offset;~i~0#1 := 0; {49609#(= |old(#length)| |#length|)} is VALID [2022-02-20 23:38:28,863 INFO L290 TraceCheckUtils]: 25: Hoare triple {49609#(= |old(#length)| |#length|)} assume !!(~i~0#1 < 2); {49609#(= |old(#length)| |#length|)} is VALID [2022-02-20 23:38:28,864 INFO L290 TraceCheckUtils]: 26: Hoare triple {49609#(= |old(#length)| |#length|)} SUMMARY for call #t~mem3#1.base, #t~mem3#1.offset := read~$Pointer$(~#commands~0.base, ~#commands~0.offset + 9 * ~i~0#1, 4); srcloc: L693 {49609#(= |old(#length)| |#length|)} is VALID [2022-02-20 23:38:28,864 INFO L290 TraceCheckUtils]: 27: Hoare triple {49609#(= |old(#length)| |#length|)} assume 1 == #valid[#t~mem3#1.base]; {49609#(= |old(#length)| |#length|)} is VALID [2022-02-20 23:38:28,864 INFO L290 TraceCheckUtils]: 28: Hoare triple {49609#(= |old(#length)| |#length|)} assume #t~mem3#1.offset < #length[#t~mem3#1.base] && #t~mem3#1.offset >= 0; {49609#(= |old(#length)| |#length|)} is VALID [2022-02-20 23:38:28,864 INFO L290 TraceCheckUtils]: 29: Hoare triple {49609#(= |old(#length)| |#length|)} assume 1 == #valid[~input#1.base]; {49609#(= |old(#length)| |#length|)} is VALID [2022-02-20 23:38:28,865 INFO L290 TraceCheckUtils]: 30: Hoare triple {49609#(= |old(#length)| |#length|)} assume ~input#1.offset < #length[~input#1.base] && ~input#1.offset >= 0; {49609#(= |old(#length)| |#length|)} is VALID [2022-02-20 23:38:28,865 INFO L290 TraceCheckUtils]: 31: Hoare triple {49609#(= |old(#length)| |#length|)} assume !(0 == #t~nondet4#1);havoc #t~mem3#1.base, #t~mem3#1.offset;havoc #t~nondet4#1; {49609#(= |old(#length)| |#length|)} is VALID [2022-02-20 23:38:28,865 INFO L290 TraceCheckUtils]: 32: Hoare triple {49609#(= |old(#length)| |#length|)} #t~post2#1 := ~i~0#1;~i~0#1 := 1 + #t~post2#1;havoc #t~post2#1; {49609#(= |old(#length)| |#length|)} is VALID [2022-02-20 23:38:28,865 INFO L290 TraceCheckUtils]: 33: Hoare triple {49609#(= |old(#length)| |#length|)} assume !!(~i~0#1 < 2); {49609#(= |old(#length)| |#length|)} is VALID [2022-02-20 23:38:28,866 INFO L290 TraceCheckUtils]: 34: Hoare triple {49609#(= |old(#length)| |#length|)} SUMMARY for call #t~mem3#1.base, #t~mem3#1.offset := read~$Pointer$(~#commands~0.base, ~#commands~0.offset + 9 * ~i~0#1, 4); srcloc: L693 {49609#(= |old(#length)| |#length|)} is VALID [2022-02-20 23:38:28,866 INFO L290 TraceCheckUtils]: 35: Hoare triple {49609#(= |old(#length)| |#length|)} assume 1 == #valid[#t~mem3#1.base]; {49609#(= |old(#length)| |#length|)} is VALID [2022-02-20 23:38:28,866 INFO L290 TraceCheckUtils]: 36: Hoare triple {49609#(= |old(#length)| |#length|)} assume #t~mem3#1.offset < #length[#t~mem3#1.base] && #t~mem3#1.offset >= 0; {49609#(= |old(#length)| |#length|)} is VALID [2022-02-20 23:38:28,866 INFO L290 TraceCheckUtils]: 37: Hoare triple {49609#(= |old(#length)| |#length|)} assume 1 == #valid[~input#1.base]; {49609#(= |old(#length)| |#length|)} is VALID [2022-02-20 23:38:28,867 INFO L290 TraceCheckUtils]: 38: Hoare triple {49609#(= |old(#length)| |#length|)} assume ~input#1.offset < #length[~input#1.base] && ~input#1.offset >= 0; {49609#(= |old(#length)| |#length|)} is VALID [2022-02-20 23:38:28,867 INFO L290 TraceCheckUtils]: 39: Hoare triple {49609#(= |old(#length)| |#length|)} assume !(0 == #t~nondet4#1);havoc #t~mem3#1.base, #t~mem3#1.offset;havoc #t~nondet4#1; {49609#(= |old(#length)| |#length|)} is VALID [2022-02-20 23:38:28,867 INFO L290 TraceCheckUtils]: 40: Hoare triple {49609#(= |old(#length)| |#length|)} #t~post2#1 := ~i~0#1;~i~0#1 := 1 + #t~post2#1;havoc #t~post2#1; {49609#(= |old(#length)| |#length|)} is VALID [2022-02-20 23:38:28,867 INFO L290 TraceCheckUtils]: 41: Hoare triple {49609#(= |old(#length)| |#length|)} assume !(~i~0#1 < 2); {49609#(= |old(#length)| |#length|)} is VALID [2022-02-20 23:38:28,867 INFO L290 TraceCheckUtils]: 42: Hoare triple {49609#(= |old(#length)| |#length|)} assume true; {49609#(= |old(#length)| |#length|)} is VALID [2022-02-20 23:38:28,868 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {49609#(= |old(#length)| |#length|)} {49565#(= 3 (select |#length| 5))} #103#return; {49565#(= 3 (select |#length| 5))} is VALID [2022-02-20 23:38:28,868 INFO L272 TraceCheckUtils]: 44: Hoare triple {49565#(= 3 (select |#length| 5))} call parse_input(5, 0); {49606#(and (= |parse_input_#in~input#1.base| 5) (= 3 (select |#length| 5)) (= |parse_input_#in~input#1.offset| 0))} is VALID [2022-02-20 23:38:28,869 INFO L290 TraceCheckUtils]: 45: Hoare triple {49606#(and (= |parse_input_#in~input#1.base| 5) (= 3 (select |#length| 5)) (= |parse_input_#in~input#1.offset| 0))} ~input#1.base, ~input#1.offset := #in~input#1.base, #in~input#1.offset;~i~0#1 := 0; {49607#(and (= (+ (select |#length| |parse_input_~input#1.base|) (- 3)) 0) (= |parse_input_~input#1.offset| 0))} is VALID [2022-02-20 23:38:28,869 INFO L290 TraceCheckUtils]: 46: Hoare triple {49607#(and (= (+ (select |#length| |parse_input_~input#1.base|) (- 3)) 0) (= |parse_input_~input#1.offset| 0))} assume !!(~i~0#1 < 2); {49607#(and (= (+ (select |#length| |parse_input_~input#1.base|) (- 3)) 0) (= |parse_input_~input#1.offset| 0))} is VALID [2022-02-20 23:38:28,870 INFO L290 TraceCheckUtils]: 47: Hoare triple {49607#(and (= (+ (select |#length| |parse_input_~input#1.base|) (- 3)) 0) (= |parse_input_~input#1.offset| 0))} SUMMARY for call #t~mem3#1.base, #t~mem3#1.offset := read~$Pointer$(~#commands~0.base, ~#commands~0.offset + 9 * ~i~0#1, 4); srcloc: L693 {49607#(and (= (+ (select |#length| |parse_input_~input#1.base|) (- 3)) 0) (= |parse_input_~input#1.offset| 0))} is VALID [2022-02-20 23:38:28,870 INFO L290 TraceCheckUtils]: 48: Hoare triple {49607#(and (= (+ (select |#length| |parse_input_~input#1.base|) (- 3)) 0) (= |parse_input_~input#1.offset| 0))} assume 1 == #valid[#t~mem3#1.base]; {49607#(and (= (+ (select |#length| |parse_input_~input#1.base|) (- 3)) 0) (= |parse_input_~input#1.offset| 0))} is VALID [2022-02-20 23:38:28,870 INFO L290 TraceCheckUtils]: 49: Hoare triple {49607#(and (= (+ (select |#length| |parse_input_~input#1.base|) (- 3)) 0) (= |parse_input_~input#1.offset| 0))} assume #t~mem3#1.offset < #length[#t~mem3#1.base] && #t~mem3#1.offset >= 0; {49607#(and (= (+ (select |#length| |parse_input_~input#1.base|) (- 3)) 0) (= |parse_input_~input#1.offset| 0))} is VALID [2022-02-20 23:38:28,871 INFO L290 TraceCheckUtils]: 50: Hoare triple {49607#(and (= (+ (select |#length| |parse_input_~input#1.base|) (- 3)) 0) (= |parse_input_~input#1.offset| 0))} assume 1 == #valid[~input#1.base]; {49607#(and (= (+ (select |#length| |parse_input_~input#1.base|) (- 3)) 0) (= |parse_input_~input#1.offset| 0))} is VALID [2022-02-20 23:38:28,871 INFO L290 TraceCheckUtils]: 51: Hoare triple {49607#(and (= (+ (select |#length| |parse_input_~input#1.base|) (- 3)) 0) (= |parse_input_~input#1.offset| 0))} assume !(~input#1.offset < #length[~input#1.base] && ~input#1.offset >= 0); {49564#false} is VALID [2022-02-20 23:38:28,871 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-02-20 23:38:28,871 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:38:28,871 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618682095] [2022-02-20 23:38:28,872 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1618682095] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 23:38:28,872 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1597161373] [2022-02-20 23:38:28,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:38:28,872 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:38:28,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:38:28,873 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 23:38:28,874 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-02-20 23:38:28,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:38:28,940 INFO L263 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 16 conjunts are in the unsatisfiable core [2022-02-20 23:38:28,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:38:28,948 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:38:29,131 INFO L290 TraceCheckUtils]: 0: Hoare triple {49563#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(3, 1);call write~init~int(99, 1, 0, 1);call write~init~int(49, 1, 1, 1);call write~init~int(0, 1, 2, 1);call #Ultimate.allocInit(3, 2);call write~init~int(99, 2, 0, 1);call write~init~int(50, 2, 1, 1);call write~init~int(0, 2, 2, 1);call #Ultimate.allocInit(3, 3);call write~init~int(99, 3, 0, 1);call write~init~int(49, 3, 1, 1);call write~init~int(0, 3, 2, 1);call #Ultimate.allocInit(3, 4);call write~init~int(99, 4, 0, 1);call write~init~int(49, 4, 1, 1);call write~init~int(0, 4, 2, 1);call #Ultimate.allocInit(3, 5);call write~init~int(99, 5, 0, 1);call write~init~int(50, 5, 1, 1);call write~init~int(0, 5, 2, 1);~state~0 := ~unnamed3~0~STATE_1;~global~0.base, ~global~0.offset := 0, 0;~#commands~0.base, ~#commands~0.offset := 6, 0;call #Ultimate.allocInit(18, 6);call write~init~$Pointer$(1, 0, ~#commands~0.base, ~#commands~0.offset, 4);call write~init~$Pointer$(#funAddr~c1.base, #funAddr~c1.offset, ~#commands~0.base, 4 + ~#commands~0.offset, 4);call write~init~int((if ~unnamed3~0~STATE_1 % 256 <= 127 then ~unnamed3~0~STATE_1 % 256 else ~unnamed3~0~STATE_1 % 256 - 256), ~#commands~0.base, 8 + ~#commands~0.offset, 1);call write~init~$Pointer$(2, 0, ~#commands~0.base, 9 + ~#commands~0.offset, 4);call write~init~$Pointer$(#funAddr~c2.base, #funAddr~c2.offset, ~#commands~0.base, 13 + ~#commands~0.offset, 4);call write~init~int((if ~unnamed3~0~STATE_2 % 256 <= 127 then ~unnamed3~0~STATE_2 % 256 else ~unnamed3~0~STATE_2 % 256 - 256), ~#commands~0.base, 17 + ~#commands~0.offset, 1); {49613#(<= 3 (select |#length| 5))} is VALID [2022-02-20 23:38:29,131 INFO L290 TraceCheckUtils]: 1: Hoare triple {49613#(<= 3 (select |#length| 5))} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1; {49613#(<= 3 (select |#length| 5))} is VALID [2022-02-20 23:38:29,132 INFO L272 TraceCheckUtils]: 2: Hoare triple {49613#(<= 3 (select |#length| 5))} call parse_input(3, 0); {49609#(= |old(#length)| |#length|)} is VALID [2022-02-20 23:38:29,132 INFO L290 TraceCheckUtils]: 3: Hoare triple {49609#(= |old(#length)| |#length|)} ~input#1.base, ~input#1.offset := #in~input#1.base, #in~input#1.offset;~i~0#1 := 0; {49609#(= |old(#length)| |#length|)} is VALID [2022-02-20 23:38:29,132 INFO L290 TraceCheckUtils]: 4: Hoare triple {49609#(= |old(#length)| |#length|)} assume !!(~i~0#1 < 2); {49609#(= |old(#length)| |#length|)} is VALID [2022-02-20 23:38:29,133 INFO L290 TraceCheckUtils]: 5: Hoare triple {49609#(= |old(#length)| |#length|)} SUMMARY for call #t~mem3#1.base, #t~mem3#1.offset := read~$Pointer$(~#commands~0.base, ~#commands~0.offset + 9 * ~i~0#1, 4); srcloc: L693 {49609#(= |old(#length)| |#length|)} is VALID [2022-02-20 23:38:29,133 INFO L290 TraceCheckUtils]: 6: Hoare triple {49609#(= |old(#length)| |#length|)} assume 1 == #valid[#t~mem3#1.base]; {49609#(= |old(#length)| |#length|)} is VALID [2022-02-20 23:38:29,133 INFO L290 TraceCheckUtils]: 7: Hoare triple {49609#(= |old(#length)| |#length|)} assume #t~mem3#1.offset < #length[#t~mem3#1.base] && #t~mem3#1.offset >= 0; {49609#(= |old(#length)| |#length|)} is VALID [2022-02-20 23:38:29,134 INFO L290 TraceCheckUtils]: 8: Hoare triple {49609#(= |old(#length)| |#length|)} assume 1 == #valid[~input#1.base]; {49609#(= |old(#length)| |#length|)} is VALID [2022-02-20 23:38:29,134 INFO L290 TraceCheckUtils]: 9: Hoare triple {49609#(= |old(#length)| |#length|)} assume ~input#1.offset < #length[~input#1.base] && ~input#1.offset >= 0; {49609#(= |old(#length)| |#length|)} is VALID [2022-02-20 23:38:29,134 INFO L290 TraceCheckUtils]: 10: Hoare triple {49609#(= |old(#length)| |#length|)} assume !(0 == #t~nondet4#1);havoc #t~mem3#1.base, #t~mem3#1.offset;havoc #t~nondet4#1; {49609#(= |old(#length)| |#length|)} is VALID [2022-02-20 23:38:29,134 INFO L290 TraceCheckUtils]: 11: Hoare triple {49609#(= |old(#length)| |#length|)} #t~post2#1 := ~i~0#1;~i~0#1 := 1 + #t~post2#1;havoc #t~post2#1; {49609#(= |old(#length)| |#length|)} is VALID [2022-02-20 23:38:29,135 INFO L290 TraceCheckUtils]: 12: Hoare triple {49609#(= |old(#length)| |#length|)} assume !!(~i~0#1 < 2); {49609#(= |old(#length)| |#length|)} is VALID [2022-02-20 23:38:29,135 INFO L290 TraceCheckUtils]: 13: Hoare triple {49609#(= |old(#length)| |#length|)} SUMMARY for call #t~mem3#1.base, #t~mem3#1.offset := read~$Pointer$(~#commands~0.base, ~#commands~0.offset + 9 * ~i~0#1, 4); srcloc: L693 {49609#(= |old(#length)| |#length|)} is VALID [2022-02-20 23:38:29,135 INFO L290 TraceCheckUtils]: 14: Hoare triple {49609#(= |old(#length)| |#length|)} assume 1 == #valid[#t~mem3#1.base]; {49609#(= |old(#length)| |#length|)} is VALID [2022-02-20 23:38:29,136 INFO L290 TraceCheckUtils]: 15: Hoare triple {49609#(= |old(#length)| |#length|)} assume #t~mem3#1.offset < #length[#t~mem3#1.base] && #t~mem3#1.offset >= 0; {49609#(= |old(#length)| |#length|)} is VALID [2022-02-20 23:38:29,136 INFO L290 TraceCheckUtils]: 16: Hoare triple {49609#(= |old(#length)| |#length|)} assume 1 == #valid[~input#1.base]; {49609#(= |old(#length)| |#length|)} is VALID [2022-02-20 23:38:29,136 INFO L290 TraceCheckUtils]: 17: Hoare triple {49609#(= |old(#length)| |#length|)} assume ~input#1.offset < #length[~input#1.base] && ~input#1.offset >= 0; {49609#(= |old(#length)| |#length|)} is VALID [2022-02-20 23:38:29,136 INFO L290 TraceCheckUtils]: 18: Hoare triple {49609#(= |old(#length)| |#length|)} assume !(0 == #t~nondet4#1);havoc #t~mem3#1.base, #t~mem3#1.offset;havoc #t~nondet4#1; {49609#(= |old(#length)| |#length|)} is VALID [2022-02-20 23:38:29,137 INFO L290 TraceCheckUtils]: 19: Hoare triple {49609#(= |old(#length)| |#length|)} #t~post2#1 := ~i~0#1;~i~0#1 := 1 + #t~post2#1;havoc #t~post2#1; {49609#(= |old(#length)| |#length|)} is VALID [2022-02-20 23:38:29,137 INFO L290 TraceCheckUtils]: 20: Hoare triple {49609#(= |old(#length)| |#length|)} assume !(~i~0#1 < 2); {49609#(= |old(#length)| |#length|)} is VALID [2022-02-20 23:38:29,137 INFO L290 TraceCheckUtils]: 21: Hoare triple {49609#(= |old(#length)| |#length|)} assume true; {49609#(= |old(#length)| |#length|)} is VALID [2022-02-20 23:38:29,138 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {49609#(= |old(#length)| |#length|)} {49613#(<= 3 (select |#length| 5))} #101#return; {49613#(<= 3 (select |#length| 5))} is VALID [2022-02-20 23:38:29,138 INFO L272 TraceCheckUtils]: 23: Hoare triple {49613#(<= 3 (select |#length| 5))} call parse_input(4, 0); {49609#(= |old(#length)| |#length|)} is VALID [2022-02-20 23:38:29,138 INFO L290 TraceCheckUtils]: 24: Hoare triple {49609#(= |old(#length)| |#length|)} ~input#1.base, ~input#1.offset := #in~input#1.base, #in~input#1.offset;~i~0#1 := 0; {49609#(= |old(#length)| |#length|)} is VALID [2022-02-20 23:38:29,139 INFO L290 TraceCheckUtils]: 25: Hoare triple {49609#(= |old(#length)| |#length|)} assume !!(~i~0#1 < 2); {49609#(= |old(#length)| |#length|)} is VALID [2022-02-20 23:38:29,139 INFO L290 TraceCheckUtils]: 26: Hoare triple {49609#(= |old(#length)| |#length|)} SUMMARY for call #t~mem3#1.base, #t~mem3#1.offset := read~$Pointer$(~#commands~0.base, ~#commands~0.offset + 9 * ~i~0#1, 4); srcloc: L693 {49609#(= |old(#length)| |#length|)} is VALID [2022-02-20 23:38:29,139 INFO L290 TraceCheckUtils]: 27: Hoare triple {49609#(= |old(#length)| |#length|)} assume 1 == #valid[#t~mem3#1.base]; {49609#(= |old(#length)| |#length|)} is VALID [2022-02-20 23:38:29,139 INFO L290 TraceCheckUtils]: 28: Hoare triple {49609#(= |old(#length)| |#length|)} assume #t~mem3#1.offset < #length[#t~mem3#1.base] && #t~mem3#1.offset >= 0; {49609#(= |old(#length)| |#length|)} is VALID [2022-02-20 23:38:29,140 INFO L290 TraceCheckUtils]: 29: Hoare triple {49609#(= |old(#length)| |#length|)} assume 1 == #valid[~input#1.base]; {49609#(= |old(#length)| |#length|)} is VALID [2022-02-20 23:38:29,140 INFO L290 TraceCheckUtils]: 30: Hoare triple {49609#(= |old(#length)| |#length|)} assume ~input#1.offset < #length[~input#1.base] && ~input#1.offset >= 0; {49609#(= |old(#length)| |#length|)} is VALID [2022-02-20 23:38:29,140 INFO L290 TraceCheckUtils]: 31: Hoare triple {49609#(= |old(#length)| |#length|)} assume !(0 == #t~nondet4#1);havoc #t~mem3#1.base, #t~mem3#1.offset;havoc #t~nondet4#1; {49609#(= |old(#length)| |#length|)} is VALID [2022-02-20 23:38:29,141 INFO L290 TraceCheckUtils]: 32: Hoare triple {49609#(= |old(#length)| |#length|)} #t~post2#1 := ~i~0#1;~i~0#1 := 1 + #t~post2#1;havoc #t~post2#1; {49609#(= |old(#length)| |#length|)} is VALID [2022-02-20 23:38:29,141 INFO L290 TraceCheckUtils]: 33: Hoare triple {49609#(= |old(#length)| |#length|)} assume !!(~i~0#1 < 2); {49609#(= |old(#length)| |#length|)} is VALID [2022-02-20 23:38:29,141 INFO L290 TraceCheckUtils]: 34: Hoare triple {49609#(= |old(#length)| |#length|)} SUMMARY for call #t~mem3#1.base, #t~mem3#1.offset := read~$Pointer$(~#commands~0.base, ~#commands~0.offset + 9 * ~i~0#1, 4); srcloc: L693 {49609#(= |old(#length)| |#length|)} is VALID [2022-02-20 23:38:29,141 INFO L290 TraceCheckUtils]: 35: Hoare triple {49609#(= |old(#length)| |#length|)} assume 1 == #valid[#t~mem3#1.base]; {49609#(= |old(#length)| |#length|)} is VALID [2022-02-20 23:38:29,142 INFO L290 TraceCheckUtils]: 36: Hoare triple {49609#(= |old(#length)| |#length|)} assume #t~mem3#1.offset < #length[#t~mem3#1.base] && #t~mem3#1.offset >= 0; {49609#(= |old(#length)| |#length|)} is VALID [2022-02-20 23:38:29,142 INFO L290 TraceCheckUtils]: 37: Hoare triple {49609#(= |old(#length)| |#length|)} assume 1 == #valid[~input#1.base]; {49609#(= |old(#length)| |#length|)} is VALID [2022-02-20 23:38:29,142 INFO L290 TraceCheckUtils]: 38: Hoare triple {49609#(= |old(#length)| |#length|)} assume ~input#1.offset < #length[~input#1.base] && ~input#1.offset >= 0; {49609#(= |old(#length)| |#length|)} is VALID [2022-02-20 23:38:29,142 INFO L290 TraceCheckUtils]: 39: Hoare triple {49609#(= |old(#length)| |#length|)} assume !(0 == #t~nondet4#1);havoc #t~mem3#1.base, #t~mem3#1.offset;havoc #t~nondet4#1; {49609#(= |old(#length)| |#length|)} is VALID [2022-02-20 23:38:29,143 INFO L290 TraceCheckUtils]: 40: Hoare triple {49609#(= |old(#length)| |#length|)} #t~post2#1 := ~i~0#1;~i~0#1 := 1 + #t~post2#1;havoc #t~post2#1; {49609#(= |old(#length)| |#length|)} is VALID [2022-02-20 23:38:29,143 INFO L290 TraceCheckUtils]: 41: Hoare triple {49609#(= |old(#length)| |#length|)} assume !(~i~0#1 < 2); {49609#(= |old(#length)| |#length|)} is VALID [2022-02-20 23:38:29,143 INFO L290 TraceCheckUtils]: 42: Hoare triple {49609#(= |old(#length)| |#length|)} assume true; {49609#(= |old(#length)| |#length|)} is VALID [2022-02-20 23:38:29,144 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {49609#(= |old(#length)| |#length|)} {49613#(<= 3 (select |#length| 5))} #103#return; {49613#(<= 3 (select |#length| 5))} is VALID [2022-02-20 23:38:29,144 INFO L272 TraceCheckUtils]: 44: Hoare triple {49613#(<= 3 (select |#length| 5))} call parse_input(5, 0); {49746#(and (= |parse_input_#in~input#1.base| 5) (<= 3 (select |#length| 5)) (= |parse_input_#in~input#1.offset| 0))} is VALID [2022-02-20 23:38:29,144 INFO L290 TraceCheckUtils]: 45: Hoare triple {49746#(and (= |parse_input_#in~input#1.base| 5) (<= 3 (select |#length| 5)) (= |parse_input_#in~input#1.offset| 0))} ~input#1.base, ~input#1.offset := #in~input#1.base, #in~input#1.offset;~i~0#1 := 0; {49750#(and (<= 3 (select |#length| 5)) (= |parse_input_~input#1.offset| 0) (= 5 |parse_input_~input#1.base|))} is VALID [2022-02-20 23:38:29,145 INFO L290 TraceCheckUtils]: 46: Hoare triple {49750#(and (<= 3 (select |#length| 5)) (= |parse_input_~input#1.offset| 0) (= 5 |parse_input_~input#1.base|))} assume !!(~i~0#1 < 2); {49750#(and (<= 3 (select |#length| 5)) (= |parse_input_~input#1.offset| 0) (= 5 |parse_input_~input#1.base|))} is VALID [2022-02-20 23:38:29,145 INFO L290 TraceCheckUtils]: 47: Hoare triple {49750#(and (<= 3 (select |#length| 5)) (= |parse_input_~input#1.offset| 0) (= 5 |parse_input_~input#1.base|))} SUMMARY for call #t~mem3#1.base, #t~mem3#1.offset := read~$Pointer$(~#commands~0.base, ~#commands~0.offset + 9 * ~i~0#1, 4); srcloc: L693 {49750#(and (<= 3 (select |#length| 5)) (= |parse_input_~input#1.offset| 0) (= 5 |parse_input_~input#1.base|))} is VALID [2022-02-20 23:38:29,146 INFO L290 TraceCheckUtils]: 48: Hoare triple {49750#(and (<= 3 (select |#length| 5)) (= |parse_input_~input#1.offset| 0) (= 5 |parse_input_~input#1.base|))} assume 1 == #valid[#t~mem3#1.base]; {49750#(and (<= 3 (select |#length| 5)) (= |parse_input_~input#1.offset| 0) (= 5 |parse_input_~input#1.base|))} is VALID [2022-02-20 23:38:29,146 INFO L290 TraceCheckUtils]: 49: Hoare triple {49750#(and (<= 3 (select |#length| 5)) (= |parse_input_~input#1.offset| 0) (= 5 |parse_input_~input#1.base|))} assume #t~mem3#1.offset < #length[#t~mem3#1.base] && #t~mem3#1.offset >= 0; {49750#(and (<= 3 (select |#length| 5)) (= |parse_input_~input#1.offset| 0) (= 5 |parse_input_~input#1.base|))} is VALID [2022-02-20 23:38:29,146 INFO L290 TraceCheckUtils]: 50: Hoare triple {49750#(and (<= 3 (select |#length| 5)) (= |parse_input_~input#1.offset| 0) (= 5 |parse_input_~input#1.base|))} assume 1 == #valid[~input#1.base]; {49750#(and (<= 3 (select |#length| 5)) (= |parse_input_~input#1.offset| 0) (= 5 |parse_input_~input#1.base|))} is VALID [2022-02-20 23:38:29,147 INFO L290 TraceCheckUtils]: 51: Hoare triple {49750#(and (<= 3 (select |#length| 5)) (= |parse_input_~input#1.offset| 0) (= 5 |parse_input_~input#1.base|))} assume !(~input#1.offset < #length[~input#1.base] && ~input#1.offset >= 0); {49564#false} is VALID [2022-02-20 23:38:29,147 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-02-20 23:38:29,147 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:38:29,510 INFO L290 TraceCheckUtils]: 51: Hoare triple {49769#(and (< |parse_input_~input#1.offset| (select |#length| |parse_input_~input#1.base|)) (<= 0 |parse_input_~input#1.offset|))} assume !(~input#1.offset < #length[~input#1.base] && ~input#1.offset >= 0); {49564#false} is VALID [2022-02-20 23:38:29,510 INFO L290 TraceCheckUtils]: 50: Hoare triple {49769#(and (< |parse_input_~input#1.offset| (select |#length| |parse_input_~input#1.base|)) (<= 0 |parse_input_~input#1.offset|))} assume 1 == #valid[~input#1.base]; {49769#(and (< |parse_input_~input#1.offset| (select |#length| |parse_input_~input#1.base|)) (<= 0 |parse_input_~input#1.offset|))} is VALID [2022-02-20 23:38:29,511 INFO L290 TraceCheckUtils]: 49: Hoare triple {49769#(and (< |parse_input_~input#1.offset| (select |#length| |parse_input_~input#1.base|)) (<= 0 |parse_input_~input#1.offset|))} assume #t~mem3#1.offset < #length[#t~mem3#1.base] && #t~mem3#1.offset >= 0; {49769#(and (< |parse_input_~input#1.offset| (select |#length| |parse_input_~input#1.base|)) (<= 0 |parse_input_~input#1.offset|))} is VALID [2022-02-20 23:38:29,511 INFO L290 TraceCheckUtils]: 48: Hoare triple {49769#(and (< |parse_input_~input#1.offset| (select |#length| |parse_input_~input#1.base|)) (<= 0 |parse_input_~input#1.offset|))} assume 1 == #valid[#t~mem3#1.base]; {49769#(and (< |parse_input_~input#1.offset| (select |#length| |parse_input_~input#1.base|)) (<= 0 |parse_input_~input#1.offset|))} is VALID [2022-02-20 23:38:29,511 INFO L290 TraceCheckUtils]: 47: Hoare triple {49769#(and (< |parse_input_~input#1.offset| (select |#length| |parse_input_~input#1.base|)) (<= 0 |parse_input_~input#1.offset|))} SUMMARY for call #t~mem3#1.base, #t~mem3#1.offset := read~$Pointer$(~#commands~0.base, ~#commands~0.offset + 9 * ~i~0#1, 4); srcloc: L693 {49769#(and (< |parse_input_~input#1.offset| (select |#length| |parse_input_~input#1.base|)) (<= 0 |parse_input_~input#1.offset|))} is VALID [2022-02-20 23:38:29,512 INFO L290 TraceCheckUtils]: 46: Hoare triple {49769#(and (< |parse_input_~input#1.offset| (select |#length| |parse_input_~input#1.base|)) (<= 0 |parse_input_~input#1.offset|))} assume !!(~i~0#1 < 2); {49769#(and (< |parse_input_~input#1.offset| (select |#length| |parse_input_~input#1.base|)) (<= 0 |parse_input_~input#1.offset|))} is VALID [2022-02-20 23:38:29,512 INFO L290 TraceCheckUtils]: 45: Hoare triple {49788#(and (< |parse_input_#in~input#1.offset| (select |#length| |parse_input_#in~input#1.base|)) (<= 0 |parse_input_#in~input#1.offset|))} ~input#1.base, ~input#1.offset := #in~input#1.base, #in~input#1.offset;~i~0#1 := 0; {49769#(and (< |parse_input_~input#1.offset| (select |#length| |parse_input_~input#1.base|)) (<= 0 |parse_input_~input#1.offset|))} is VALID [2022-02-20 23:38:29,513 INFO L272 TraceCheckUtils]: 44: Hoare triple {49792#(< 0 (select |#length| 5))} call parse_input(5, 0); {49788#(and (< |parse_input_#in~input#1.offset| (select |#length| |parse_input_#in~input#1.base|)) (<= 0 |parse_input_#in~input#1.offset|))} is VALID [2022-02-20 23:38:29,513 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {49799#(or (not (< 0 (select |old(#length)| 5))) (< 0 (select |#length| 5)))} {49792#(< 0 (select |#length| 5))} #103#return; {49792#(< 0 (select |#length| 5))} is VALID [2022-02-20 23:38:29,513 INFO L290 TraceCheckUtils]: 42: Hoare triple {49799#(or (not (< 0 (select |old(#length)| 5))) (< 0 (select |#length| 5)))} assume true; {49799#(or (not (< 0 (select |old(#length)| 5))) (< 0 (select |#length| 5)))} is VALID [2022-02-20 23:38:29,514 INFO L290 TraceCheckUtils]: 41: Hoare triple {49799#(or (not (< 0 (select |old(#length)| 5))) (< 0 (select |#length| 5)))} assume !(~i~0#1 < 2); {49799#(or (not (< 0 (select |old(#length)| 5))) (< 0 (select |#length| 5)))} is VALID [2022-02-20 23:38:29,514 INFO L290 TraceCheckUtils]: 40: Hoare triple {49799#(or (not (< 0 (select |old(#length)| 5))) (< 0 (select |#length| 5)))} #t~post2#1 := ~i~0#1;~i~0#1 := 1 + #t~post2#1;havoc #t~post2#1; {49799#(or (not (< 0 (select |old(#length)| 5))) (< 0 (select |#length| 5)))} is VALID [2022-02-20 23:38:29,514 INFO L290 TraceCheckUtils]: 39: Hoare triple {49799#(or (not (< 0 (select |old(#length)| 5))) (< 0 (select |#length| 5)))} assume !(0 == #t~nondet4#1);havoc #t~mem3#1.base, #t~mem3#1.offset;havoc #t~nondet4#1; {49799#(or (not (< 0 (select |old(#length)| 5))) (< 0 (select |#length| 5)))} is VALID [2022-02-20 23:38:29,515 INFO L290 TraceCheckUtils]: 38: Hoare triple {49799#(or (not (< 0 (select |old(#length)| 5))) (< 0 (select |#length| 5)))} assume ~input#1.offset < #length[~input#1.base] && ~input#1.offset >= 0; {49799#(or (not (< 0 (select |old(#length)| 5))) (< 0 (select |#length| 5)))} is VALID [2022-02-20 23:38:29,515 INFO L290 TraceCheckUtils]: 37: Hoare triple {49799#(or (not (< 0 (select |old(#length)| 5))) (< 0 (select |#length| 5)))} assume 1 == #valid[~input#1.base]; {49799#(or (not (< 0 (select |old(#length)| 5))) (< 0 (select |#length| 5)))} is VALID [2022-02-20 23:38:29,515 INFO L290 TraceCheckUtils]: 36: Hoare triple {49799#(or (not (< 0 (select |old(#length)| 5))) (< 0 (select |#length| 5)))} assume #t~mem3#1.offset < #length[#t~mem3#1.base] && #t~mem3#1.offset >= 0; {49799#(or (not (< 0 (select |old(#length)| 5))) (< 0 (select |#length| 5)))} is VALID [2022-02-20 23:38:29,516 INFO L290 TraceCheckUtils]: 35: Hoare triple {49799#(or (not (< 0 (select |old(#length)| 5))) (< 0 (select |#length| 5)))} assume 1 == #valid[#t~mem3#1.base]; {49799#(or (not (< 0 (select |old(#length)| 5))) (< 0 (select |#length| 5)))} is VALID [2022-02-20 23:38:29,516 INFO L290 TraceCheckUtils]: 34: Hoare triple {49799#(or (not (< 0 (select |old(#length)| 5))) (< 0 (select |#length| 5)))} SUMMARY for call #t~mem3#1.base, #t~mem3#1.offset := read~$Pointer$(~#commands~0.base, ~#commands~0.offset + 9 * ~i~0#1, 4); srcloc: L693 {49799#(or (not (< 0 (select |old(#length)| 5))) (< 0 (select |#length| 5)))} is VALID [2022-02-20 23:38:29,516 INFO L290 TraceCheckUtils]: 33: Hoare triple {49799#(or (not (< 0 (select |old(#length)| 5))) (< 0 (select |#length| 5)))} assume !!(~i~0#1 < 2); {49799#(or (not (< 0 (select |old(#length)| 5))) (< 0 (select |#length| 5)))} is VALID [2022-02-20 23:38:29,517 INFO L290 TraceCheckUtils]: 32: Hoare triple {49799#(or (not (< 0 (select |old(#length)| 5))) (< 0 (select |#length| 5)))} #t~post2#1 := ~i~0#1;~i~0#1 := 1 + #t~post2#1;havoc #t~post2#1; {49799#(or (not (< 0 (select |old(#length)| 5))) (< 0 (select |#length| 5)))} is VALID [2022-02-20 23:38:29,517 INFO L290 TraceCheckUtils]: 31: Hoare triple {49799#(or (not (< 0 (select |old(#length)| 5))) (< 0 (select |#length| 5)))} assume !(0 == #t~nondet4#1);havoc #t~mem3#1.base, #t~mem3#1.offset;havoc #t~nondet4#1; {49799#(or (not (< 0 (select |old(#length)| 5))) (< 0 (select |#length| 5)))} is VALID [2022-02-20 23:38:29,518 INFO L290 TraceCheckUtils]: 30: Hoare triple {49799#(or (not (< 0 (select |old(#length)| 5))) (< 0 (select |#length| 5)))} assume ~input#1.offset < #length[~input#1.base] && ~input#1.offset >= 0; {49799#(or (not (< 0 (select |old(#length)| 5))) (< 0 (select |#length| 5)))} is VALID [2022-02-20 23:38:29,518 INFO L290 TraceCheckUtils]: 29: Hoare triple {49799#(or (not (< 0 (select |old(#length)| 5))) (< 0 (select |#length| 5)))} assume 1 == #valid[~input#1.base]; {49799#(or (not (< 0 (select |old(#length)| 5))) (< 0 (select |#length| 5)))} is VALID [2022-02-20 23:38:29,518 INFO L290 TraceCheckUtils]: 28: Hoare triple {49799#(or (not (< 0 (select |old(#length)| 5))) (< 0 (select |#length| 5)))} assume #t~mem3#1.offset < #length[#t~mem3#1.base] && #t~mem3#1.offset >= 0; {49799#(or (not (< 0 (select |old(#length)| 5))) (< 0 (select |#length| 5)))} is VALID [2022-02-20 23:38:29,518 INFO L290 TraceCheckUtils]: 27: Hoare triple {49799#(or (not (< 0 (select |old(#length)| 5))) (< 0 (select |#length| 5)))} assume 1 == #valid[#t~mem3#1.base]; {49799#(or (not (< 0 (select |old(#length)| 5))) (< 0 (select |#length| 5)))} is VALID [2022-02-20 23:38:29,519 INFO L290 TraceCheckUtils]: 26: Hoare triple {49799#(or (not (< 0 (select |old(#length)| 5))) (< 0 (select |#length| 5)))} SUMMARY for call #t~mem3#1.base, #t~mem3#1.offset := read~$Pointer$(~#commands~0.base, ~#commands~0.offset + 9 * ~i~0#1, 4); srcloc: L693 {49799#(or (not (< 0 (select |old(#length)| 5))) (< 0 (select |#length| 5)))} is VALID [2022-02-20 23:38:29,519 INFO L290 TraceCheckUtils]: 25: Hoare triple {49799#(or (not (< 0 (select |old(#length)| 5))) (< 0 (select |#length| 5)))} assume !!(~i~0#1 < 2); {49799#(or (not (< 0 (select |old(#length)| 5))) (< 0 (select |#length| 5)))} is VALID [2022-02-20 23:38:29,520 INFO L290 TraceCheckUtils]: 24: Hoare triple {49799#(or (not (< 0 (select |old(#length)| 5))) (< 0 (select |#length| 5)))} ~input#1.base, ~input#1.offset := #in~input#1.base, #in~input#1.offset;~i~0#1 := 0; {49799#(or (not (< 0 (select |old(#length)| 5))) (< 0 (select |#length| 5)))} is VALID [2022-02-20 23:38:29,520 INFO L272 TraceCheckUtils]: 23: Hoare triple {49792#(< 0 (select |#length| 5))} call parse_input(4, 0); {49799#(or (not (< 0 (select |old(#length)| 5))) (< 0 (select |#length| 5)))} is VALID [2022-02-20 23:38:29,520 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {49799#(or (not (< 0 (select |old(#length)| 5))) (< 0 (select |#length| 5)))} {49792#(< 0 (select |#length| 5))} #101#return; {49792#(< 0 (select |#length| 5))} is VALID [2022-02-20 23:38:29,521 INFO L290 TraceCheckUtils]: 21: Hoare triple {49799#(or (not (< 0 (select |old(#length)| 5))) (< 0 (select |#length| 5)))} assume true; {49799#(or (not (< 0 (select |old(#length)| 5))) (< 0 (select |#length| 5)))} is VALID [2022-02-20 23:38:29,521 INFO L290 TraceCheckUtils]: 20: Hoare triple {49799#(or (not (< 0 (select |old(#length)| 5))) (< 0 (select |#length| 5)))} assume !(~i~0#1 < 2); {49799#(or (not (< 0 (select |old(#length)| 5))) (< 0 (select |#length| 5)))} is VALID [2022-02-20 23:38:29,521 INFO L290 TraceCheckUtils]: 19: Hoare triple {49799#(or (not (< 0 (select |old(#length)| 5))) (< 0 (select |#length| 5)))} #t~post2#1 := ~i~0#1;~i~0#1 := 1 + #t~post2#1;havoc #t~post2#1; {49799#(or (not (< 0 (select |old(#length)| 5))) (< 0 (select |#length| 5)))} is VALID [2022-02-20 23:38:29,522 INFO L290 TraceCheckUtils]: 18: Hoare triple {49799#(or (not (< 0 (select |old(#length)| 5))) (< 0 (select |#length| 5)))} assume !(0 == #t~nondet4#1);havoc #t~mem3#1.base, #t~mem3#1.offset;havoc #t~nondet4#1; {49799#(or (not (< 0 (select |old(#length)| 5))) (< 0 (select |#length| 5)))} is VALID [2022-02-20 23:38:29,522 INFO L290 TraceCheckUtils]: 17: Hoare triple {49799#(or (not (< 0 (select |old(#length)| 5))) (< 0 (select |#length| 5)))} assume ~input#1.offset < #length[~input#1.base] && ~input#1.offset >= 0; {49799#(or (not (< 0 (select |old(#length)| 5))) (< 0 (select |#length| 5)))} is VALID [2022-02-20 23:38:29,522 INFO L290 TraceCheckUtils]: 16: Hoare triple {49799#(or (not (< 0 (select |old(#length)| 5))) (< 0 (select |#length| 5)))} assume 1 == #valid[~input#1.base]; {49799#(or (not (< 0 (select |old(#length)| 5))) (< 0 (select |#length| 5)))} is VALID [2022-02-20 23:38:29,523 INFO L290 TraceCheckUtils]: 15: Hoare triple {49799#(or (not (< 0 (select |old(#length)| 5))) (< 0 (select |#length| 5)))} assume #t~mem3#1.offset < #length[#t~mem3#1.base] && #t~mem3#1.offset >= 0; {49799#(or (not (< 0 (select |old(#length)| 5))) (< 0 (select |#length| 5)))} is VALID [2022-02-20 23:38:29,523 INFO L290 TraceCheckUtils]: 14: Hoare triple {49799#(or (not (< 0 (select |old(#length)| 5))) (< 0 (select |#length| 5)))} assume 1 == #valid[#t~mem3#1.base]; {49799#(or (not (< 0 (select |old(#length)| 5))) (< 0 (select |#length| 5)))} is VALID [2022-02-20 23:38:29,524 INFO L290 TraceCheckUtils]: 13: Hoare triple {49799#(or (not (< 0 (select |old(#length)| 5))) (< 0 (select |#length| 5)))} SUMMARY for call #t~mem3#1.base, #t~mem3#1.offset := read~$Pointer$(~#commands~0.base, ~#commands~0.offset + 9 * ~i~0#1, 4); srcloc: L693 {49799#(or (not (< 0 (select |old(#length)| 5))) (< 0 (select |#length| 5)))} is VALID [2022-02-20 23:38:29,524 INFO L290 TraceCheckUtils]: 12: Hoare triple {49799#(or (not (< 0 (select |old(#length)| 5))) (< 0 (select |#length| 5)))} assume !!(~i~0#1 < 2); {49799#(or (not (< 0 (select |old(#length)| 5))) (< 0 (select |#length| 5)))} is VALID [2022-02-20 23:38:29,524 INFO L290 TraceCheckUtils]: 11: Hoare triple {49799#(or (not (< 0 (select |old(#length)| 5))) (< 0 (select |#length| 5)))} #t~post2#1 := ~i~0#1;~i~0#1 := 1 + #t~post2#1;havoc #t~post2#1; {49799#(or (not (< 0 (select |old(#length)| 5))) (< 0 (select |#length| 5)))} is VALID [2022-02-20 23:38:29,525 INFO L290 TraceCheckUtils]: 10: Hoare triple {49799#(or (not (< 0 (select |old(#length)| 5))) (< 0 (select |#length| 5)))} assume !(0 == #t~nondet4#1);havoc #t~mem3#1.base, #t~mem3#1.offset;havoc #t~nondet4#1; {49799#(or (not (< 0 (select |old(#length)| 5))) (< 0 (select |#length| 5)))} is VALID [2022-02-20 23:38:29,525 INFO L290 TraceCheckUtils]: 9: Hoare triple {49799#(or (not (< 0 (select |old(#length)| 5))) (< 0 (select |#length| 5)))} assume ~input#1.offset < #length[~input#1.base] && ~input#1.offset >= 0; {49799#(or (not (< 0 (select |old(#length)| 5))) (< 0 (select |#length| 5)))} is VALID [2022-02-20 23:38:29,525 INFO L290 TraceCheckUtils]: 8: Hoare triple {49799#(or (not (< 0 (select |old(#length)| 5))) (< 0 (select |#length| 5)))} assume 1 == #valid[~input#1.base]; {49799#(or (not (< 0 (select |old(#length)| 5))) (< 0 (select |#length| 5)))} is VALID [2022-02-20 23:38:29,526 INFO L290 TraceCheckUtils]: 7: Hoare triple {49799#(or (not (< 0 (select |old(#length)| 5))) (< 0 (select |#length| 5)))} assume #t~mem3#1.offset < #length[#t~mem3#1.base] && #t~mem3#1.offset >= 0; {49799#(or (not (< 0 (select |old(#length)| 5))) (< 0 (select |#length| 5)))} is VALID [2022-02-20 23:38:29,526 INFO L290 TraceCheckUtils]: 6: Hoare triple {49799#(or (not (< 0 (select |old(#length)| 5))) (< 0 (select |#length| 5)))} assume 1 == #valid[#t~mem3#1.base]; {49799#(or (not (< 0 (select |old(#length)| 5))) (< 0 (select |#length| 5)))} is VALID [2022-02-20 23:38:29,526 INFO L290 TraceCheckUtils]: 5: Hoare triple {49799#(or (not (< 0 (select |old(#length)| 5))) (< 0 (select |#length| 5)))} SUMMARY for call #t~mem3#1.base, #t~mem3#1.offset := read~$Pointer$(~#commands~0.base, ~#commands~0.offset + 9 * ~i~0#1, 4); srcloc: L693 {49799#(or (not (< 0 (select |old(#length)| 5))) (< 0 (select |#length| 5)))} is VALID [2022-02-20 23:38:29,527 INFO L290 TraceCheckUtils]: 4: Hoare triple {49799#(or (not (< 0 (select |old(#length)| 5))) (< 0 (select |#length| 5)))} assume !!(~i~0#1 < 2); {49799#(or (not (< 0 (select |old(#length)| 5))) (< 0 (select |#length| 5)))} is VALID [2022-02-20 23:38:29,527 INFO L290 TraceCheckUtils]: 3: Hoare triple {49799#(or (not (< 0 (select |old(#length)| 5))) (< 0 (select |#length| 5)))} ~input#1.base, ~input#1.offset := #in~input#1.base, #in~input#1.offset;~i~0#1 := 0; {49799#(or (not (< 0 (select |old(#length)| 5))) (< 0 (select |#length| 5)))} is VALID [2022-02-20 23:38:29,528 INFO L272 TraceCheckUtils]: 2: Hoare triple {49792#(< 0 (select |#length| 5))} call parse_input(3, 0); {49799#(or (not (< 0 (select |old(#length)| 5))) (< 0 (select |#length| 5)))} is VALID [2022-02-20 23:38:29,528 INFO L290 TraceCheckUtils]: 1: Hoare triple {49792#(< 0 (select |#length| 5))} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1; {49792#(< 0 (select |#length| 5))} is VALID [2022-02-20 23:38:29,529 INFO L290 TraceCheckUtils]: 0: Hoare triple {49563#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(3, 1);call write~init~int(99, 1, 0, 1);call write~init~int(49, 1, 1, 1);call write~init~int(0, 1, 2, 1);call #Ultimate.allocInit(3, 2);call write~init~int(99, 2, 0, 1);call write~init~int(50, 2, 1, 1);call write~init~int(0, 2, 2, 1);call #Ultimate.allocInit(3, 3);call write~init~int(99, 3, 0, 1);call write~init~int(49, 3, 1, 1);call write~init~int(0, 3, 2, 1);call #Ultimate.allocInit(3, 4);call write~init~int(99, 4, 0, 1);call write~init~int(49, 4, 1, 1);call write~init~int(0, 4, 2, 1);call #Ultimate.allocInit(3, 5);call write~init~int(99, 5, 0, 1);call write~init~int(50, 5, 1, 1);call write~init~int(0, 5, 2, 1);~state~0 := ~unnamed3~0~STATE_1;~global~0.base, ~global~0.offset := 0, 0;~#commands~0.base, ~#commands~0.offset := 6, 0;call #Ultimate.allocInit(18, 6);call write~init~$Pointer$(1, 0, ~#commands~0.base, ~#commands~0.offset, 4);call write~init~$Pointer$(#funAddr~c1.base, #funAddr~c1.offset, ~#commands~0.base, 4 + ~#commands~0.offset, 4);call write~init~int((if ~unnamed3~0~STATE_1 % 256 <= 127 then ~unnamed3~0~STATE_1 % 256 else ~unnamed3~0~STATE_1 % 256 - 256), ~#commands~0.base, 8 + ~#commands~0.offset, 1);call write~init~$Pointer$(2, 0, ~#commands~0.base, 9 + ~#commands~0.offset, 4);call write~init~$Pointer$(#funAddr~c2.base, #funAddr~c2.offset, ~#commands~0.base, 13 + ~#commands~0.offset, 4);call write~init~int((if ~unnamed3~0~STATE_2 % 256 <= 127 then ~unnamed3~0~STATE_2 % 256 else ~unnamed3~0~STATE_2 % 256 - 256), ~#commands~0.base, 17 + ~#commands~0.offset, 1); {49792#(< 0 (select |#length| 5))} is VALID [2022-02-20 23:38:29,529 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-02-20 23:38:29,529 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1597161373] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 23:38:29,529 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 23:38:29,529 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 12 [2022-02-20 23:38:29,530 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915944337] [2022-02-20 23:38:29,530 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 23:38:29,530 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.8461538461538463) internal successors, (50), 9 states have internal predecessors, (50), 3 states have call successors, (9), 6 states have call predecessors, (9), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 52 [2022-02-20 23:38:29,530 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:38:29,531 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 14 states, 13 states have (on average 3.8461538461538463) internal successors, (50), 9 states have internal predecessors, (50), 3 states have call successors, (9), 6 states have call predecessors, (9), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-02-20 23:38:29,573 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:38:29,573 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-02-20 23:38:29,573 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:38:29,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-02-20 23:38:29,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2022-02-20 23:38:29,574 INFO L87 Difference]: Start difference. First operand 365 states and 430 transitions. Second operand has 14 states, 13 states have (on average 3.8461538461538463) internal successors, (50), 9 states have internal predecessors, (50), 3 states have call successors, (9), 6 states have call predecessors, (9), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-02-20 23:38:30,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:38:30,547 INFO L93 Difference]: Finished difference Result 396 states and 455 transitions. [2022-02-20 23:38:30,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-20 23:38:30,547 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.8461538461538463) internal successors, (50), 9 states have internal predecessors, (50), 3 states have call successors, (9), 6 states have call predecessors, (9), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 52 [2022-02-20 23:38:30,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:38:30,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 3.8461538461538463) internal successors, (50), 9 states have internal predecessors, (50), 3 states have call successors, (9), 6 states have call predecessors, (9), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-02-20 23:38:30,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 171 transitions. [2022-02-20 23:38:30,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 3.8461538461538463) internal successors, (50), 9 states have internal predecessors, (50), 3 states have call successors, (9), 6 states have call predecessors, (9), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-02-20 23:38:30,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 171 transitions. [2022-02-20 23:38:30,552 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 171 transitions. [2022-02-20 23:38:30,686 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 171 edges. 171 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:38:30,691 INFO L225 Difference]: With dead ends: 396 [2022-02-20 23:38:30,691 INFO L226 Difference]: Without dead ends: 396 [2022-02-20 23:38:30,691 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=167, Invalid=433, Unknown=0, NotChecked=0, Total=600 [2022-02-20 23:38:30,692 INFO L933 BasicCegarLoop]: 60 mSDtfsCounter, 319 mSDsluCounter, 334 mSDsCounter, 0 mSdLazyCounter, 350 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 319 SdHoareTripleChecker+Valid, 394 SdHoareTripleChecker+Invalid, 377 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 350 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 23:38:30,692 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [319 Valid, 394 Invalid, 377 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 350 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-20 23:38:30,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2022-02-20 23:38:30,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 364. [2022-02-20 23:38:30,696 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:38:30,696 INFO L82 GeneralOperation]: Start isEquivalent. First operand 396 states. Second operand has 364 states, 334 states have (on average 1.2065868263473054) internal successors, (403), 347 states have internal predecessors, (403), 8 states have call successors, (8), 8 states have call predecessors, (8), 12 states have return successors, (14), 8 states have call predecessors, (14), 8 states have call successors, (14) [2022-02-20 23:38:30,696 INFO L74 IsIncluded]: Start isIncluded. First operand 396 states. Second operand has 364 states, 334 states have (on average 1.2065868263473054) internal successors, (403), 347 states have internal predecessors, (403), 8 states have call successors, (8), 8 states have call predecessors, (8), 12 states have return successors, (14), 8 states have call predecessors, (14), 8 states have call successors, (14) [2022-02-20 23:38:30,697 INFO L87 Difference]: Start difference. First operand 396 states. Second operand has 364 states, 334 states have (on average 1.2065868263473054) internal successors, (403), 347 states have internal predecessors, (403), 8 states have call successors, (8), 8 states have call predecessors, (8), 12 states have return successors, (14), 8 states have call predecessors, (14), 8 states have call successors, (14) [2022-02-20 23:38:30,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:38:30,702 INFO L93 Difference]: Finished difference Result 396 states and 455 transitions. [2022-02-20 23:38:30,702 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 455 transitions. [2022-02-20 23:38:30,702 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:38:30,703 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:38:30,703 INFO L74 IsIncluded]: Start isIncluded. First operand has 364 states, 334 states have (on average 1.2065868263473054) internal successors, (403), 347 states have internal predecessors, (403), 8 states have call successors, (8), 8 states have call predecessors, (8), 12 states have return successors, (14), 8 states have call predecessors, (14), 8 states have call successors, (14) Second operand 396 states. [2022-02-20 23:38:30,703 INFO L87 Difference]: Start difference. First operand has 364 states, 334 states have (on average 1.2065868263473054) internal successors, (403), 347 states have internal predecessors, (403), 8 states have call successors, (8), 8 states have call predecessors, (8), 12 states have return successors, (14), 8 states have call predecessors, (14), 8 states have call successors, (14) Second operand 396 states. [2022-02-20 23:38:30,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:38:30,708 INFO L93 Difference]: Finished difference Result 396 states and 455 transitions. [2022-02-20 23:38:30,709 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 455 transitions. [2022-02-20 23:38:30,709 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:38:30,709 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:38:30,709 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:38:30,709 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:38:30,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 364 states, 334 states have (on average 1.2065868263473054) internal successors, (403), 347 states have internal predecessors, (403), 8 states have call successors, (8), 8 states have call predecessors, (8), 12 states have return successors, (14), 8 states have call predecessors, (14), 8 states have call successors, (14) [2022-02-20 23:38:30,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 425 transitions. [2022-02-20 23:38:30,714 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 425 transitions. Word has length 52 [2022-02-20 23:38:30,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:38:30,714 INFO L470 AbstractCegarLoop]: Abstraction has 364 states and 425 transitions. [2022-02-20 23:38:30,714 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.8461538461538463) internal successors, (50), 9 states have internal predecessors, (50), 3 states have call successors, (9), 6 states have call predecessors, (9), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-02-20 23:38:30,714 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 425 transitions. [2022-02-20 23:38:30,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-02-20 23:38:30,715 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:38:30,715 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:38:30,733 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2022-02-20 23:38:30,919 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:38:30,920 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATION, parse_inputErr1REQUIRES_VIOLATION, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2022-02-20 23:38:30,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:38:30,920 INFO L85 PathProgramCache]: Analyzing trace with hash -278957874, now seen corresponding path program 1 times [2022-02-20 23:38:30,920 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:38:30,921 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660675460] [2022-02-20 23:38:30,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:38:30,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:38:30,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:38:31,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 23:38:31,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:38:31,161 INFO L290 TraceCheckUtils]: 0: Hoare triple {51549#(and (= ~global~0.base |old(~global~0.base)|) (= |old(#length)| |#length|) (= |old(~global~0.offset)| ~global~0.offset) (= ~state~0 |old(~state~0)|) (= |old(#valid)| |#valid|))} ~input#1.base, ~input#1.offset := #in~input#1.base, #in~input#1.offset;~i~0#1 := 0; {51550#(= |parse_input_~i~0#1| 0)} is VALID [2022-02-20 23:38:31,161 INFO L290 TraceCheckUtils]: 1: Hoare triple {51550#(= |parse_input_~i~0#1| 0)} assume !!(~i~0#1 < 2); {51550#(= |parse_input_~i~0#1| 0)} is VALID [2022-02-20 23:38:31,162 INFO L290 TraceCheckUtils]: 2: Hoare triple {51550#(= |parse_input_~i~0#1| 0)} SUMMARY for call #t~mem3#1.base, #t~mem3#1.offset := read~$Pointer$(~#commands~0.base, ~#commands~0.offset + 9 * ~i~0#1, 4); srcloc: L693 {51551#(and (or (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) |parse_input_#t~mem3#1.base|) (not (= (+ |~#commands~0.offset| (* 8 |parse_input_~i~0#1|)) 0))) (= |parse_input_~i~0#1| 0))} is VALID [2022-02-20 23:38:31,163 INFO L290 TraceCheckUtils]: 3: Hoare triple {51551#(and (or (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) |parse_input_#t~mem3#1.base|) (not (= (+ |~#commands~0.offset| (* 8 |parse_input_~i~0#1|)) 0))) (= |parse_input_~i~0#1| 0))} assume 1 == #valid[#t~mem3#1.base]; {51552#(and (= |parse_input_~i~0#1| 0) (or (and (not (= (select |#valid| |parse_input_#t~mem3#1.base|) 0)) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) |parse_input_#t~mem3#1.base|)) (not (= (+ |~#commands~0.offset| (* 8 |parse_input_~i~0#1|)) 0))))} is VALID [2022-02-20 23:38:31,163 INFO L290 TraceCheckUtils]: 4: Hoare triple {51552#(and (= |parse_input_~i~0#1| 0) (or (and (not (= (select |#valid| |parse_input_#t~mem3#1.base|) 0)) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) |parse_input_#t~mem3#1.base|)) (not (= (+ |~#commands~0.offset| (* 8 |parse_input_~i~0#1|)) 0))))} assume #t~mem3#1.offset < #length[#t~mem3#1.base] && #t~mem3#1.offset >= 0; {51553#(and (= |parse_input_~i~0#1| 0) (or (not (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0)) 0)) (not (= (+ |~#commands~0.offset| (* 8 |parse_input_~i~0#1|)) 0))))} is VALID [2022-02-20 23:38:31,164 INFO L290 TraceCheckUtils]: 5: Hoare triple {51553#(and (= |parse_input_~i~0#1| 0) (or (not (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0)) 0)) (not (= (+ |~#commands~0.offset| (* 8 |parse_input_~i~0#1|)) 0))))} assume 1 == #valid[~input#1.base]; {51553#(and (= |parse_input_~i~0#1| 0) (or (not (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0)) 0)) (not (= (+ |~#commands~0.offset| (* 8 |parse_input_~i~0#1|)) 0))))} is VALID [2022-02-20 23:38:31,164 INFO L290 TraceCheckUtils]: 6: Hoare triple {51553#(and (= |parse_input_~i~0#1| 0) (or (not (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0)) 0)) (not (= (+ |~#commands~0.offset| (* 8 |parse_input_~i~0#1|)) 0))))} assume ~input#1.offset < #length[~input#1.base] && ~input#1.offset >= 0; {51553#(and (= |parse_input_~i~0#1| 0) (or (not (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0)) 0)) (not (= (+ |~#commands~0.offset| (* 8 |parse_input_~i~0#1|)) 0))))} is VALID [2022-02-20 23:38:31,165 INFO L290 TraceCheckUtils]: 7: Hoare triple {51553#(and (= |parse_input_~i~0#1| 0) (or (not (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0)) 0)) (not (= (+ |~#commands~0.offset| (* 8 |parse_input_~i~0#1|)) 0))))} assume 0 == #t~nondet4#1;havoc #t~mem3#1.base, #t~mem3#1.offset;havoc #t~nondet4#1; {51553#(and (= |parse_input_~i~0#1| 0) (or (not (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0)) 0)) (not (= (+ |~#commands~0.offset| (* 8 |parse_input_~i~0#1|)) 0))))} is VALID [2022-02-20 23:38:31,165 INFO L290 TraceCheckUtils]: 8: Hoare triple {51553#(and (= |parse_input_~i~0#1| 0) (or (not (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0)) 0)) (not (= (+ |~#commands~0.offset| (* 8 |parse_input_~i~0#1|)) 0))))} SUMMARY for call #t~mem5#1 := read~int(~#commands~0.base, 8 + (~#commands~0.offset + 9 * ~i~0#1), 1); srcloc: L694 {51553#(and (= |parse_input_~i~0#1| 0) (or (not (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0)) 0)) (not (= (+ |~#commands~0.offset| (* 8 |parse_input_~i~0#1|)) 0))))} is VALID [2022-02-20 23:38:31,165 INFO L290 TraceCheckUtils]: 9: Hoare triple {51553#(and (= |parse_input_~i~0#1| 0) (or (not (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0)) 0)) (not (= (+ |~#commands~0.offset| (* 8 |parse_input_~i~0#1|)) 0))))} assume ~state~0 >= #t~mem5#1;havoc #t~mem5#1; {51553#(and (= |parse_input_~i~0#1| 0) (or (not (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0)) 0)) (not (= (+ |~#commands~0.offset| (* 8 |parse_input_~i~0#1|)) 0))))} is VALID [2022-02-20 23:38:31,166 INFO L290 TraceCheckUtils]: 10: Hoare triple {51553#(and (= |parse_input_~i~0#1| 0) (or (not (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0)) 0)) (not (= (+ |~#commands~0.offset| (* 8 |parse_input_~i~0#1|)) 0))))} SUMMARY for call #t~mem6#1.base, #t~mem6#1.offset := read~$Pointer$(~#commands~0.base, 4 + (~#commands~0.offset + 9 * ~i~0#1), 4); srcloc: L695 {51554#(or (not (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0)) 0)) (<= (+ |~#commands~0.offset| 1) 0) (<= 1 |~#commands~0.offset|))} is VALID [2022-02-20 23:38:31,166 INFO L290 TraceCheckUtils]: 11: Hoare triple {51554#(or (not (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0)) 0)) (<= (+ |~#commands~0.offset| 1) 0) (<= 1 |~#commands~0.offset|))} assume { :begin_inline_##fun~~TO~VOID } true;##fun~~TO~VOID_#in~#fp#1.base, ##fun~~TO~VOID_#in~#fp#1.offset := #t~mem6#1.base, #t~mem6#1.offset; {51554#(or (not (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0)) 0)) (<= (+ |~#commands~0.offset| 1) 0) (<= 1 |~#commands~0.offset|))} is VALID [2022-02-20 23:38:31,167 INFO L290 TraceCheckUtils]: 12: Hoare triple {51554#(or (not (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0)) 0)) (<= (+ |~#commands~0.offset| 1) 0) (<= 1 |~#commands~0.offset|))} assume !(##fun~~TO~VOID_#in~#fp#1.base == #funAddr~c2.base && ##fun~~TO~VOID_#in~#fp#1.offset == #funAddr~c2.offset);assume { :begin_inline_c1 } true;havoc c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset, c1_~x~0#1.base, c1_~x~0#1.offset;call c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset := #Ultimate.allocOnHeap(1);c1_~x~0#1.base, c1_~x~0#1.offset := c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset;havoc c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset; {51555#(or (<= (+ |~#commands~0.offset| 1) 0) (not (= |parse_input_c1_~x~0#1.base| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0))) (<= 1 |~#commands~0.offset|))} is VALID [2022-02-20 23:38:31,167 INFO L290 TraceCheckUtils]: 13: Hoare triple {51555#(or (<= (+ |~#commands~0.offset| 1) 0) (not (= |parse_input_c1_~x~0#1.base| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0))) (<= 1 |~#commands~0.offset|))} assume !(c1_~x~0#1.base == 0 && c1_~x~0#1.offset == 0); {51555#(or (<= (+ |~#commands~0.offset| 1) 0) (not (= |parse_input_c1_~x~0#1.base| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0))) (<= 1 |~#commands~0.offset|))} is VALID [2022-02-20 23:38:31,168 INFO L290 TraceCheckUtils]: 14: Hoare triple {51555#(or (<= (+ |~#commands~0.offset| 1) 0) (not (= |parse_input_c1_~x~0#1.base| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0))) (<= 1 |~#commands~0.offset|))} assume !(~global~0.base != 0 || ~global~0.offset != 0); {51555#(or (<= (+ |~#commands~0.offset| 1) 0) (not (= |parse_input_c1_~x~0#1.base| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0))) (<= 1 |~#commands~0.offset|))} is VALID [2022-02-20 23:38:31,168 INFO L290 TraceCheckUtils]: 15: Hoare triple {51555#(or (<= (+ |~#commands~0.offset| 1) 0) (not (= |parse_input_c1_~x~0#1.base| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0))) (<= 1 |~#commands~0.offset|))} ~global~0.base, ~global~0.offset := c1_~x~0#1.base, c1_~x~0#1.offset;~state~0 := ~unnamed3~0~STATE_2; {51556#(or (not (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) ~global~0.base)) (<= (+ |~#commands~0.offset| 1) 0) (<= 1 |~#commands~0.offset|))} is VALID [2022-02-20 23:38:31,169 INFO L290 TraceCheckUtils]: 16: Hoare triple {51556#(or (not (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) ~global~0.base)) (<= (+ |~#commands~0.offset| 1) 0) (<= 1 |~#commands~0.offset|))} assume { :end_inline_c1 } true; {51556#(or (not (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) ~global~0.base)) (<= (+ |~#commands~0.offset| 1) 0) (<= 1 |~#commands~0.offset|))} is VALID [2022-02-20 23:38:31,169 INFO L290 TraceCheckUtils]: 17: Hoare triple {51556#(or (not (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) ~global~0.base)) (<= (+ |~#commands~0.offset| 1) 0) (<= 1 |~#commands~0.offset|))} assume { :end_inline_##fun~~TO~VOID } true;havoc #t~mem6#1.base, #t~mem6#1.offset; {51556#(or (not (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) ~global~0.base)) (<= (+ |~#commands~0.offset| 1) 0) (<= 1 |~#commands~0.offset|))} is VALID [2022-02-20 23:38:31,169 INFO L290 TraceCheckUtils]: 18: Hoare triple {51556#(or (not (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) ~global~0.base)) (<= (+ |~#commands~0.offset| 1) 0) (<= 1 |~#commands~0.offset|))} assume true; {51556#(or (not (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) ~global~0.base)) (<= (+ |~#commands~0.offset| 1) 0) (<= 1 |~#commands~0.offset|))} is VALID [2022-02-20 23:38:31,170 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {51556#(or (not (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) ~global~0.base)) (<= (+ |~#commands~0.offset| 1) 0) (<= 1 |~#commands~0.offset|))} {51501#(and (<= 0 |~#commands~0.offset|) (<= |~#commands~0.offset| 0))} #101#return; {51522#(and (not (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) ~global~0.base)) (<= 0 |~#commands~0.offset|) (<= |~#commands~0.offset| 0))} is VALID [2022-02-20 23:38:31,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-02-20 23:38:31,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:38:31,387 INFO L290 TraceCheckUtils]: 0: Hoare triple {51549#(and (= ~global~0.base |old(~global~0.base)|) (= |old(#length)| |#length|) (= |old(~global~0.offset)| ~global~0.offset) (= ~state~0 |old(~state~0)|) (= |old(#valid)| |#valid|))} ~input#1.base, ~input#1.offset := #in~input#1.base, #in~input#1.offset;~i~0#1 := 0; {51557#(and (= ~global~0.base |old(~global~0.base)|) (= |parse_input_~i~0#1| 0))} is VALID [2022-02-20 23:38:31,388 INFO L290 TraceCheckUtils]: 1: Hoare triple {51557#(and (= ~global~0.base |old(~global~0.base)|) (= |parse_input_~i~0#1| 0))} assume !!(~i~0#1 < 2); {51557#(and (= ~global~0.base |old(~global~0.base)|) (= |parse_input_~i~0#1| 0))} is VALID [2022-02-20 23:38:31,388 INFO L290 TraceCheckUtils]: 2: Hoare triple {51557#(and (= ~global~0.base |old(~global~0.base)|) (= |parse_input_~i~0#1| 0))} SUMMARY for call #t~mem3#1.base, #t~mem3#1.offset := read~$Pointer$(~#commands~0.base, ~#commands~0.offset + 9 * ~i~0#1, 4); srcloc: L693 {51558#(and (or (and (or (= ~global~0.base |parse_input_#t~mem3#1.base|) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) |parse_input_#t~mem3#1.base|)) (or (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) |old(~global~0.base)|) (not (= ~global~0.base |parse_input_#t~mem3#1.base|)))) (not (= (+ |~#commands~0.offset| (* 8 |parse_input_~i~0#1|)) 0))) (= |parse_input_~i~0#1| 0))} is VALID [2022-02-20 23:38:31,389 INFO L290 TraceCheckUtils]: 3: Hoare triple {51558#(and (or (and (or (= ~global~0.base |parse_input_#t~mem3#1.base|) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) |parse_input_#t~mem3#1.base|)) (or (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) |old(~global~0.base)|) (not (= ~global~0.base |parse_input_#t~mem3#1.base|)))) (not (= (+ |~#commands~0.offset| (* 8 |parse_input_~i~0#1|)) 0))) (= |parse_input_~i~0#1| 0))} assume 1 == #valid[#t~mem3#1.base]; {51559#(and (or (and (or (= ~global~0.base |parse_input_#t~mem3#1.base|) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) |parse_input_#t~mem3#1.base|)) (= (select |#valid| |parse_input_#t~mem3#1.base|) 1) (or (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) |old(~global~0.base)|) (not (= ~global~0.base |parse_input_#t~mem3#1.base|)))) (not (= (+ |~#commands~0.offset| (* 8 |parse_input_~i~0#1|)) 0))) (= |parse_input_~i~0#1| 0))} is VALID [2022-02-20 23:38:31,390 INFO L290 TraceCheckUtils]: 4: Hoare triple {51559#(and (or (and (or (= ~global~0.base |parse_input_#t~mem3#1.base|) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) |parse_input_#t~mem3#1.base|)) (= (select |#valid| |parse_input_#t~mem3#1.base|) 1) (or (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) |old(~global~0.base)|) (not (= ~global~0.base |parse_input_#t~mem3#1.base|)))) (not (= (+ |~#commands~0.offset| (* 8 |parse_input_~i~0#1|)) 0))) (= |parse_input_~i~0#1| 0))} assume #t~mem3#1.offset < #length[#t~mem3#1.base] && #t~mem3#1.offset >= 0; {51560#(and (or (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) |old(~global~0.base)|) (not (= (+ |~#commands~0.offset| (* 8 |parse_input_~i~0#1|)) 0)) (and (not (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) ~global~0.base)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0)) 1))) (= |parse_input_~i~0#1| 0))} is VALID [2022-02-20 23:38:31,390 INFO L290 TraceCheckUtils]: 5: Hoare triple {51560#(and (or (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) |old(~global~0.base)|) (not (= (+ |~#commands~0.offset| (* 8 |parse_input_~i~0#1|)) 0)) (and (not (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) ~global~0.base)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0)) 1))) (= |parse_input_~i~0#1| 0))} assume 1 == #valid[~input#1.base]; {51560#(and (or (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) |old(~global~0.base)|) (not (= (+ |~#commands~0.offset| (* 8 |parse_input_~i~0#1|)) 0)) (and (not (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) ~global~0.base)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0)) 1))) (= |parse_input_~i~0#1| 0))} is VALID [2022-02-20 23:38:31,391 INFO L290 TraceCheckUtils]: 6: Hoare triple {51560#(and (or (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) |old(~global~0.base)|) (not (= (+ |~#commands~0.offset| (* 8 |parse_input_~i~0#1|)) 0)) (and (not (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) ~global~0.base)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0)) 1))) (= |parse_input_~i~0#1| 0))} assume ~input#1.offset < #length[~input#1.base] && ~input#1.offset >= 0; {51560#(and (or (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) |old(~global~0.base)|) (not (= (+ |~#commands~0.offset| (* 8 |parse_input_~i~0#1|)) 0)) (and (not (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) ~global~0.base)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0)) 1))) (= |parse_input_~i~0#1| 0))} is VALID [2022-02-20 23:38:31,391 INFO L290 TraceCheckUtils]: 7: Hoare triple {51560#(and (or (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) |old(~global~0.base)|) (not (= (+ |~#commands~0.offset| (* 8 |parse_input_~i~0#1|)) 0)) (and (not (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) ~global~0.base)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0)) 1))) (= |parse_input_~i~0#1| 0))} assume 0 == #t~nondet4#1;havoc #t~mem3#1.base, #t~mem3#1.offset;havoc #t~nondet4#1; {51560#(and (or (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) |old(~global~0.base)|) (not (= (+ |~#commands~0.offset| (* 8 |parse_input_~i~0#1|)) 0)) (and (not (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) ~global~0.base)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0)) 1))) (= |parse_input_~i~0#1| 0))} is VALID [2022-02-20 23:38:31,392 INFO L290 TraceCheckUtils]: 8: Hoare triple {51560#(and (or (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) |old(~global~0.base)|) (not (= (+ |~#commands~0.offset| (* 8 |parse_input_~i~0#1|)) 0)) (and (not (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) ~global~0.base)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0)) 1))) (= |parse_input_~i~0#1| 0))} SUMMARY for call #t~mem5#1 := read~int(~#commands~0.base, 8 + (~#commands~0.offset + 9 * ~i~0#1), 1); srcloc: L694 {51560#(and (or (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) |old(~global~0.base)|) (not (= (+ |~#commands~0.offset| (* 8 |parse_input_~i~0#1|)) 0)) (and (not (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) ~global~0.base)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0)) 1))) (= |parse_input_~i~0#1| 0))} is VALID [2022-02-20 23:38:31,392 INFO L290 TraceCheckUtils]: 9: Hoare triple {51560#(and (or (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) |old(~global~0.base)|) (not (= (+ |~#commands~0.offset| (* 8 |parse_input_~i~0#1|)) 0)) (and (not (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) ~global~0.base)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0)) 1))) (= |parse_input_~i~0#1| 0))} assume ~state~0 >= #t~mem5#1;havoc #t~mem5#1; {51560#(and (or (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) |old(~global~0.base)|) (not (= (+ |~#commands~0.offset| (* 8 |parse_input_~i~0#1|)) 0)) (and (not (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) ~global~0.base)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0)) 1))) (= |parse_input_~i~0#1| 0))} is VALID [2022-02-20 23:38:31,393 INFO L290 TraceCheckUtils]: 10: Hoare triple {51560#(and (or (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) |old(~global~0.base)|) (not (= (+ |~#commands~0.offset| (* 8 |parse_input_~i~0#1|)) 0)) (and (not (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) ~global~0.base)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0)) 1))) (= |parse_input_~i~0#1| 0))} SUMMARY for call #t~mem6#1.base, #t~mem6#1.offset := read~$Pointer$(~#commands~0.base, 4 + (~#commands~0.offset + 9 * ~i~0#1), 4); srcloc: L695 {51561#(or (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) |old(~global~0.base)|) (<= (+ |~#commands~0.offset| 1) 0) (<= 1 |~#commands~0.offset|) (and (not (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) ~global~0.base)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0)) 1)))} is VALID [2022-02-20 23:38:31,394 INFO L290 TraceCheckUtils]: 11: Hoare triple {51561#(or (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) |old(~global~0.base)|) (<= (+ |~#commands~0.offset| 1) 0) (<= 1 |~#commands~0.offset|) (and (not (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) ~global~0.base)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0)) 1)))} assume { :begin_inline_##fun~~TO~VOID } true;##fun~~TO~VOID_#in~#fp#1.base, ##fun~~TO~VOID_#in~#fp#1.offset := #t~mem6#1.base, #t~mem6#1.offset; {51561#(or (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) |old(~global~0.base)|) (<= (+ |~#commands~0.offset| 1) 0) (<= 1 |~#commands~0.offset|) (and (not (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) ~global~0.base)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0)) 1)))} is VALID [2022-02-20 23:38:31,394 INFO L290 TraceCheckUtils]: 12: Hoare triple {51561#(or (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) |old(~global~0.base)|) (<= (+ |~#commands~0.offset| 1) 0) (<= 1 |~#commands~0.offset|) (and (not (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) ~global~0.base)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0)) 1)))} assume !(##fun~~TO~VOID_#in~#fp#1.base == #funAddr~c2.base && ##fun~~TO~VOID_#in~#fp#1.offset == #funAddr~c2.offset);assume { :begin_inline_c1 } true;havoc c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset, c1_~x~0#1.base, c1_~x~0#1.offset;call c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset := #Ultimate.allocOnHeap(1);c1_~x~0#1.base, c1_~x~0#1.offset := c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset;havoc c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset; {51561#(or (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) |old(~global~0.base)|) (<= (+ |~#commands~0.offset| 1) 0) (<= 1 |~#commands~0.offset|) (and (not (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) ~global~0.base)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0)) 1)))} is VALID [2022-02-20 23:38:31,395 INFO L290 TraceCheckUtils]: 13: Hoare triple {51561#(or (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) |old(~global~0.base)|) (<= (+ |~#commands~0.offset| 1) 0) (<= 1 |~#commands~0.offset|) (and (not (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) ~global~0.base)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0)) 1)))} assume !(c1_~x~0#1.base == 0 && c1_~x~0#1.offset == 0); {51561#(or (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) |old(~global~0.base)|) (<= (+ |~#commands~0.offset| 1) 0) (<= 1 |~#commands~0.offset|) (and (not (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) ~global~0.base)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0)) 1)))} is VALID [2022-02-20 23:38:31,395 INFO L290 TraceCheckUtils]: 14: Hoare triple {51561#(or (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) |old(~global~0.base)|) (<= (+ |~#commands~0.offset| 1) 0) (<= 1 |~#commands~0.offset|) (and (not (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) ~global~0.base)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0)) 1)))} assume ~global~0.base != 0 || ~global~0.offset != 0; {51561#(or (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) |old(~global~0.base)|) (<= (+ |~#commands~0.offset| 1) 0) (<= 1 |~#commands~0.offset|) (and (not (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) ~global~0.base)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0)) 1)))} is VALID [2022-02-20 23:38:31,396 INFO L290 TraceCheckUtils]: 15: Hoare triple {51561#(or (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) |old(~global~0.base)|) (<= (+ |~#commands~0.offset| 1) 0) (<= 1 |~#commands~0.offset|) (and (not (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) ~global~0.base)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0)) 1)))} assume 0 == ~global~0.offset; {51561#(or (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) |old(~global~0.base)|) (<= (+ |~#commands~0.offset| 1) 0) (<= 1 |~#commands~0.offset|) (and (not (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) ~global~0.base)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0)) 1)))} is VALID [2022-02-20 23:38:31,396 INFO L290 TraceCheckUtils]: 16: Hoare triple {51561#(or (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) |old(~global~0.base)|) (<= (+ |~#commands~0.offset| 1) 0) (<= 1 |~#commands~0.offset|) (and (not (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) ~global~0.base)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0)) 1)))} assume ~global~0.base < #StackHeapBarrier; {51561#(or (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) |old(~global~0.base)|) (<= (+ |~#commands~0.offset| 1) 0) (<= 1 |~#commands~0.offset|) (and (not (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) ~global~0.base)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0)) 1)))} is VALID [2022-02-20 23:38:31,397 INFO L290 TraceCheckUtils]: 17: Hoare triple {51561#(or (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) |old(~global~0.base)|) (<= (+ |~#commands~0.offset| 1) 0) (<= 1 |~#commands~0.offset|) (and (not (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) ~global~0.base)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0)) 1)))} assume 0 == ~global~0.base || 1 == #valid[~global~0.base];call ULTIMATE.dealloc(~global~0.base, ~global~0.offset); {51562#(or (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) |old(~global~0.base)|) (<= (+ |~#commands~0.offset| 1) 0) (<= 1 |~#commands~0.offset|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0)) 1))} is VALID [2022-02-20 23:38:31,397 INFO L290 TraceCheckUtils]: 18: Hoare triple {51562#(or (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) |old(~global~0.base)|) (<= (+ |~#commands~0.offset| 1) 0) (<= 1 |~#commands~0.offset|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0)) 1))} ~global~0.base, ~global~0.offset := c1_~x~0#1.base, c1_~x~0#1.offset;~state~0 := ~unnamed3~0~STATE_2; {51562#(or (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) |old(~global~0.base)|) (<= (+ |~#commands~0.offset| 1) 0) (<= 1 |~#commands~0.offset|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0)) 1))} is VALID [2022-02-20 23:38:31,398 INFO L290 TraceCheckUtils]: 19: Hoare triple {51562#(or (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) |old(~global~0.base)|) (<= (+ |~#commands~0.offset| 1) 0) (<= 1 |~#commands~0.offset|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0)) 1))} assume { :end_inline_c1 } true; {51562#(or (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) |old(~global~0.base)|) (<= (+ |~#commands~0.offset| 1) 0) (<= 1 |~#commands~0.offset|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0)) 1))} is VALID [2022-02-20 23:38:31,398 INFO L290 TraceCheckUtils]: 20: Hoare triple {51562#(or (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) |old(~global~0.base)|) (<= (+ |~#commands~0.offset| 1) 0) (<= 1 |~#commands~0.offset|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0)) 1))} assume { :end_inline_##fun~~TO~VOID } true;havoc #t~mem6#1.base, #t~mem6#1.offset; {51562#(or (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) |old(~global~0.base)|) (<= (+ |~#commands~0.offset| 1) 0) (<= 1 |~#commands~0.offset|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0)) 1))} is VALID [2022-02-20 23:38:31,398 INFO L290 TraceCheckUtils]: 21: Hoare triple {51562#(or (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) |old(~global~0.base)|) (<= (+ |~#commands~0.offset| 1) 0) (<= 1 |~#commands~0.offset|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0)) 1))} assume true; {51562#(or (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) |old(~global~0.base)|) (<= (+ |~#commands~0.offset| 1) 0) (<= 1 |~#commands~0.offset|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0)) 1))} is VALID [2022-02-20 23:38:31,399 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {51562#(or (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) |old(~global~0.base)|) (<= (+ |~#commands~0.offset| 1) 0) (<= 1 |~#commands~0.offset|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0)) 1))} {51522#(and (not (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) ~global~0.base)) (<= 0 |~#commands~0.offset|) (<= |~#commands~0.offset| 0))} #103#return; {51546#(and (<= 0 |~#commands~0.offset|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0)) 1) (<= |~#commands~0.offset| 0))} is VALID [2022-02-20 23:38:31,400 INFO L290 TraceCheckUtils]: 0: Hoare triple {51499#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(3, 1);call write~init~int(99, 1, 0, 1);call write~init~int(49, 1, 1, 1);call write~init~int(0, 1, 2, 1);call #Ultimate.allocInit(3, 2);call write~init~int(99, 2, 0, 1);call write~init~int(50, 2, 1, 1);call write~init~int(0, 2, 2, 1);call #Ultimate.allocInit(3, 3);call write~init~int(99, 3, 0, 1);call write~init~int(49, 3, 1, 1);call write~init~int(0, 3, 2, 1);call #Ultimate.allocInit(3, 4);call write~init~int(99, 4, 0, 1);call write~init~int(49, 4, 1, 1);call write~init~int(0, 4, 2, 1);call #Ultimate.allocInit(3, 5);call write~init~int(99, 5, 0, 1);call write~init~int(50, 5, 1, 1);call write~init~int(0, 5, 2, 1);~state~0 := ~unnamed3~0~STATE_1;~global~0.base, ~global~0.offset := 0, 0;~#commands~0.base, ~#commands~0.offset := 6, 0;call #Ultimate.allocInit(18, 6);call write~init~$Pointer$(1, 0, ~#commands~0.base, ~#commands~0.offset, 4);call write~init~$Pointer$(#funAddr~c1.base, #funAddr~c1.offset, ~#commands~0.base, 4 + ~#commands~0.offset, 4);call write~init~int((if ~unnamed3~0~STATE_1 % 256 <= 127 then ~unnamed3~0~STATE_1 % 256 else ~unnamed3~0~STATE_1 % 256 - 256), ~#commands~0.base, 8 + ~#commands~0.offset, 1);call write~init~$Pointer$(2, 0, ~#commands~0.base, 9 + ~#commands~0.offset, 4);call write~init~$Pointer$(#funAddr~c2.base, #funAddr~c2.offset, ~#commands~0.base, 13 + ~#commands~0.offset, 4);call write~init~int((if ~unnamed3~0~STATE_2 % 256 <= 127 then ~unnamed3~0~STATE_2 % 256 else ~unnamed3~0~STATE_2 % 256 - 256), ~#commands~0.base, 17 + ~#commands~0.offset, 1); {51501#(and (<= 0 |~#commands~0.offset|) (<= |~#commands~0.offset| 0))} is VALID [2022-02-20 23:38:31,400 INFO L290 TraceCheckUtils]: 1: Hoare triple {51501#(and (<= 0 |~#commands~0.offset|) (<= |~#commands~0.offset| 0))} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1; {51501#(and (<= 0 |~#commands~0.offset|) (<= |~#commands~0.offset| 0))} is VALID [2022-02-20 23:38:31,401 INFO L272 TraceCheckUtils]: 2: Hoare triple {51501#(and (<= 0 |~#commands~0.offset|) (<= |~#commands~0.offset| 0))} call parse_input(3, 0); {51549#(and (= ~global~0.base |old(~global~0.base)|) (= |old(#length)| |#length|) (= |old(~global~0.offset)| ~global~0.offset) (= ~state~0 |old(~state~0)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 23:38:31,401 INFO L290 TraceCheckUtils]: 3: Hoare triple {51549#(and (= ~global~0.base |old(~global~0.base)|) (= |old(#length)| |#length|) (= |old(~global~0.offset)| ~global~0.offset) (= ~state~0 |old(~state~0)|) (= |old(#valid)| |#valid|))} ~input#1.base, ~input#1.offset := #in~input#1.base, #in~input#1.offset;~i~0#1 := 0; {51550#(= |parse_input_~i~0#1| 0)} is VALID [2022-02-20 23:38:31,402 INFO L290 TraceCheckUtils]: 4: Hoare triple {51550#(= |parse_input_~i~0#1| 0)} assume !!(~i~0#1 < 2); {51550#(= |parse_input_~i~0#1| 0)} is VALID [2022-02-20 23:38:31,402 INFO L290 TraceCheckUtils]: 5: Hoare triple {51550#(= |parse_input_~i~0#1| 0)} SUMMARY for call #t~mem3#1.base, #t~mem3#1.offset := read~$Pointer$(~#commands~0.base, ~#commands~0.offset + 9 * ~i~0#1, 4); srcloc: L693 {51551#(and (or (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) |parse_input_#t~mem3#1.base|) (not (= (+ |~#commands~0.offset| (* 8 |parse_input_~i~0#1|)) 0))) (= |parse_input_~i~0#1| 0))} is VALID [2022-02-20 23:38:31,403 INFO L290 TraceCheckUtils]: 6: Hoare triple {51551#(and (or (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) |parse_input_#t~mem3#1.base|) (not (= (+ |~#commands~0.offset| (* 8 |parse_input_~i~0#1|)) 0))) (= |parse_input_~i~0#1| 0))} assume 1 == #valid[#t~mem3#1.base]; {51552#(and (= |parse_input_~i~0#1| 0) (or (and (not (= (select |#valid| |parse_input_#t~mem3#1.base|) 0)) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) |parse_input_#t~mem3#1.base|)) (not (= (+ |~#commands~0.offset| (* 8 |parse_input_~i~0#1|)) 0))))} is VALID [2022-02-20 23:38:31,403 INFO L290 TraceCheckUtils]: 7: Hoare triple {51552#(and (= |parse_input_~i~0#1| 0) (or (and (not (= (select |#valid| |parse_input_#t~mem3#1.base|) 0)) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) |parse_input_#t~mem3#1.base|)) (not (= (+ |~#commands~0.offset| (* 8 |parse_input_~i~0#1|)) 0))))} assume #t~mem3#1.offset < #length[#t~mem3#1.base] && #t~mem3#1.offset >= 0; {51553#(and (= |parse_input_~i~0#1| 0) (or (not (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0)) 0)) (not (= (+ |~#commands~0.offset| (* 8 |parse_input_~i~0#1|)) 0))))} is VALID [2022-02-20 23:38:31,404 INFO L290 TraceCheckUtils]: 8: Hoare triple {51553#(and (= |parse_input_~i~0#1| 0) (or (not (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0)) 0)) (not (= (+ |~#commands~0.offset| (* 8 |parse_input_~i~0#1|)) 0))))} assume 1 == #valid[~input#1.base]; {51553#(and (= |parse_input_~i~0#1| 0) (or (not (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0)) 0)) (not (= (+ |~#commands~0.offset| (* 8 |parse_input_~i~0#1|)) 0))))} is VALID [2022-02-20 23:38:31,404 INFO L290 TraceCheckUtils]: 9: Hoare triple {51553#(and (= |parse_input_~i~0#1| 0) (or (not (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0)) 0)) (not (= (+ |~#commands~0.offset| (* 8 |parse_input_~i~0#1|)) 0))))} assume ~input#1.offset < #length[~input#1.base] && ~input#1.offset >= 0; {51553#(and (= |parse_input_~i~0#1| 0) (or (not (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0)) 0)) (not (= (+ |~#commands~0.offset| (* 8 |parse_input_~i~0#1|)) 0))))} is VALID [2022-02-20 23:38:31,404 INFO L290 TraceCheckUtils]: 10: Hoare triple {51553#(and (= |parse_input_~i~0#1| 0) (or (not (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0)) 0)) (not (= (+ |~#commands~0.offset| (* 8 |parse_input_~i~0#1|)) 0))))} assume 0 == #t~nondet4#1;havoc #t~mem3#1.base, #t~mem3#1.offset;havoc #t~nondet4#1; {51553#(and (= |parse_input_~i~0#1| 0) (or (not (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0)) 0)) (not (= (+ |~#commands~0.offset| (* 8 |parse_input_~i~0#1|)) 0))))} is VALID [2022-02-20 23:38:31,405 INFO L290 TraceCheckUtils]: 11: Hoare triple {51553#(and (= |parse_input_~i~0#1| 0) (or (not (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0)) 0)) (not (= (+ |~#commands~0.offset| (* 8 |parse_input_~i~0#1|)) 0))))} SUMMARY for call #t~mem5#1 := read~int(~#commands~0.base, 8 + (~#commands~0.offset + 9 * ~i~0#1), 1); srcloc: L694 {51553#(and (= |parse_input_~i~0#1| 0) (or (not (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0)) 0)) (not (= (+ |~#commands~0.offset| (* 8 |parse_input_~i~0#1|)) 0))))} is VALID [2022-02-20 23:38:31,407 INFO L290 TraceCheckUtils]: 12: Hoare triple {51553#(and (= |parse_input_~i~0#1| 0) (or (not (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0)) 0)) (not (= (+ |~#commands~0.offset| (* 8 |parse_input_~i~0#1|)) 0))))} assume ~state~0 >= #t~mem5#1;havoc #t~mem5#1; {51553#(and (= |parse_input_~i~0#1| 0) (or (not (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0)) 0)) (not (= (+ |~#commands~0.offset| (* 8 |parse_input_~i~0#1|)) 0))))} is VALID [2022-02-20 23:38:31,408 INFO L290 TraceCheckUtils]: 13: Hoare triple {51553#(and (= |parse_input_~i~0#1| 0) (or (not (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0)) 0)) (not (= (+ |~#commands~0.offset| (* 8 |parse_input_~i~0#1|)) 0))))} SUMMARY for call #t~mem6#1.base, #t~mem6#1.offset := read~$Pointer$(~#commands~0.base, 4 + (~#commands~0.offset + 9 * ~i~0#1), 4); srcloc: L695 {51554#(or (not (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0)) 0)) (<= (+ |~#commands~0.offset| 1) 0) (<= 1 |~#commands~0.offset|))} is VALID [2022-02-20 23:38:31,408 INFO L290 TraceCheckUtils]: 14: Hoare triple {51554#(or (not (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0)) 0)) (<= (+ |~#commands~0.offset| 1) 0) (<= 1 |~#commands~0.offset|))} assume { :begin_inline_##fun~~TO~VOID } true;##fun~~TO~VOID_#in~#fp#1.base, ##fun~~TO~VOID_#in~#fp#1.offset := #t~mem6#1.base, #t~mem6#1.offset; {51554#(or (not (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0)) 0)) (<= (+ |~#commands~0.offset| 1) 0) (<= 1 |~#commands~0.offset|))} is VALID [2022-02-20 23:38:31,409 INFO L290 TraceCheckUtils]: 15: Hoare triple {51554#(or (not (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0)) 0)) (<= (+ |~#commands~0.offset| 1) 0) (<= 1 |~#commands~0.offset|))} assume !(##fun~~TO~VOID_#in~#fp#1.base == #funAddr~c2.base && ##fun~~TO~VOID_#in~#fp#1.offset == #funAddr~c2.offset);assume { :begin_inline_c1 } true;havoc c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset, c1_~x~0#1.base, c1_~x~0#1.offset;call c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset := #Ultimate.allocOnHeap(1);c1_~x~0#1.base, c1_~x~0#1.offset := c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset;havoc c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset; {51555#(or (<= (+ |~#commands~0.offset| 1) 0) (not (= |parse_input_c1_~x~0#1.base| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0))) (<= 1 |~#commands~0.offset|))} is VALID [2022-02-20 23:38:31,409 INFO L290 TraceCheckUtils]: 16: Hoare triple {51555#(or (<= (+ |~#commands~0.offset| 1) 0) (not (= |parse_input_c1_~x~0#1.base| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0))) (<= 1 |~#commands~0.offset|))} assume !(c1_~x~0#1.base == 0 && c1_~x~0#1.offset == 0); {51555#(or (<= (+ |~#commands~0.offset| 1) 0) (not (= |parse_input_c1_~x~0#1.base| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0))) (<= 1 |~#commands~0.offset|))} is VALID [2022-02-20 23:38:31,409 INFO L290 TraceCheckUtils]: 17: Hoare triple {51555#(or (<= (+ |~#commands~0.offset| 1) 0) (not (= |parse_input_c1_~x~0#1.base| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0))) (<= 1 |~#commands~0.offset|))} assume !(~global~0.base != 0 || ~global~0.offset != 0); {51555#(or (<= (+ |~#commands~0.offset| 1) 0) (not (= |parse_input_c1_~x~0#1.base| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0))) (<= 1 |~#commands~0.offset|))} is VALID [2022-02-20 23:38:31,410 INFO L290 TraceCheckUtils]: 18: Hoare triple {51555#(or (<= (+ |~#commands~0.offset| 1) 0) (not (= |parse_input_c1_~x~0#1.base| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0))) (<= 1 |~#commands~0.offset|))} ~global~0.base, ~global~0.offset := c1_~x~0#1.base, c1_~x~0#1.offset;~state~0 := ~unnamed3~0~STATE_2; {51556#(or (not (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) ~global~0.base)) (<= (+ |~#commands~0.offset| 1) 0) (<= 1 |~#commands~0.offset|))} is VALID [2022-02-20 23:38:31,410 INFO L290 TraceCheckUtils]: 19: Hoare triple {51556#(or (not (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) ~global~0.base)) (<= (+ |~#commands~0.offset| 1) 0) (<= 1 |~#commands~0.offset|))} assume { :end_inline_c1 } true; {51556#(or (not (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) ~global~0.base)) (<= (+ |~#commands~0.offset| 1) 0) (<= 1 |~#commands~0.offset|))} is VALID [2022-02-20 23:38:31,411 INFO L290 TraceCheckUtils]: 20: Hoare triple {51556#(or (not (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) ~global~0.base)) (<= (+ |~#commands~0.offset| 1) 0) (<= 1 |~#commands~0.offset|))} assume { :end_inline_##fun~~TO~VOID } true;havoc #t~mem6#1.base, #t~mem6#1.offset; {51556#(or (not (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) ~global~0.base)) (<= (+ |~#commands~0.offset| 1) 0) (<= 1 |~#commands~0.offset|))} is VALID [2022-02-20 23:38:31,411 INFO L290 TraceCheckUtils]: 21: Hoare triple {51556#(or (not (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) ~global~0.base)) (<= (+ |~#commands~0.offset| 1) 0) (<= 1 |~#commands~0.offset|))} assume true; {51556#(or (not (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) ~global~0.base)) (<= (+ |~#commands~0.offset| 1) 0) (<= 1 |~#commands~0.offset|))} is VALID [2022-02-20 23:38:31,412 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {51556#(or (not (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) ~global~0.base)) (<= (+ |~#commands~0.offset| 1) 0) (<= 1 |~#commands~0.offset|))} {51501#(and (<= 0 |~#commands~0.offset|) (<= |~#commands~0.offset| 0))} #101#return; {51522#(and (not (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) ~global~0.base)) (<= 0 |~#commands~0.offset|) (<= |~#commands~0.offset| 0))} is VALID [2022-02-20 23:38:31,413 INFO L272 TraceCheckUtils]: 23: Hoare triple {51522#(and (not (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) ~global~0.base)) (<= 0 |~#commands~0.offset|) (<= |~#commands~0.offset| 0))} call parse_input(4, 0); {51549#(and (= ~global~0.base |old(~global~0.base)|) (= |old(#length)| |#length|) (= |old(~global~0.offset)| ~global~0.offset) (= ~state~0 |old(~state~0)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 23:38:31,414 INFO L290 TraceCheckUtils]: 24: Hoare triple {51549#(and (= ~global~0.base |old(~global~0.base)|) (= |old(#length)| |#length|) (= |old(~global~0.offset)| ~global~0.offset) (= ~state~0 |old(~state~0)|) (= |old(#valid)| |#valid|))} ~input#1.base, ~input#1.offset := #in~input#1.base, #in~input#1.offset;~i~0#1 := 0; {51557#(and (= ~global~0.base |old(~global~0.base)|) (= |parse_input_~i~0#1| 0))} is VALID [2022-02-20 23:38:31,414 INFO L290 TraceCheckUtils]: 25: Hoare triple {51557#(and (= ~global~0.base |old(~global~0.base)|) (= |parse_input_~i~0#1| 0))} assume !!(~i~0#1 < 2); {51557#(and (= ~global~0.base |old(~global~0.base)|) (= |parse_input_~i~0#1| 0))} is VALID [2022-02-20 23:38:31,415 INFO L290 TraceCheckUtils]: 26: Hoare triple {51557#(and (= ~global~0.base |old(~global~0.base)|) (= |parse_input_~i~0#1| 0))} SUMMARY for call #t~mem3#1.base, #t~mem3#1.offset := read~$Pointer$(~#commands~0.base, ~#commands~0.offset + 9 * ~i~0#1, 4); srcloc: L693 {51558#(and (or (and (or (= ~global~0.base |parse_input_#t~mem3#1.base|) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) |parse_input_#t~mem3#1.base|)) (or (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) |old(~global~0.base)|) (not (= ~global~0.base |parse_input_#t~mem3#1.base|)))) (not (= (+ |~#commands~0.offset| (* 8 |parse_input_~i~0#1|)) 0))) (= |parse_input_~i~0#1| 0))} is VALID [2022-02-20 23:38:31,415 INFO L290 TraceCheckUtils]: 27: Hoare triple {51558#(and (or (and (or (= ~global~0.base |parse_input_#t~mem3#1.base|) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) |parse_input_#t~mem3#1.base|)) (or (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) |old(~global~0.base)|) (not (= ~global~0.base |parse_input_#t~mem3#1.base|)))) (not (= (+ |~#commands~0.offset| (* 8 |parse_input_~i~0#1|)) 0))) (= |parse_input_~i~0#1| 0))} assume 1 == #valid[#t~mem3#1.base]; {51559#(and (or (and (or (= ~global~0.base |parse_input_#t~mem3#1.base|) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) |parse_input_#t~mem3#1.base|)) (= (select |#valid| |parse_input_#t~mem3#1.base|) 1) (or (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) |old(~global~0.base)|) (not (= ~global~0.base |parse_input_#t~mem3#1.base|)))) (not (= (+ |~#commands~0.offset| (* 8 |parse_input_~i~0#1|)) 0))) (= |parse_input_~i~0#1| 0))} is VALID [2022-02-20 23:38:31,416 INFO L290 TraceCheckUtils]: 28: Hoare triple {51559#(and (or (and (or (= ~global~0.base |parse_input_#t~mem3#1.base|) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) |parse_input_#t~mem3#1.base|)) (= (select |#valid| |parse_input_#t~mem3#1.base|) 1) (or (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) |old(~global~0.base)|) (not (= ~global~0.base |parse_input_#t~mem3#1.base|)))) (not (= (+ |~#commands~0.offset| (* 8 |parse_input_~i~0#1|)) 0))) (= |parse_input_~i~0#1| 0))} assume #t~mem3#1.offset < #length[#t~mem3#1.base] && #t~mem3#1.offset >= 0; {51560#(and (or (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) |old(~global~0.base)|) (not (= (+ |~#commands~0.offset| (* 8 |parse_input_~i~0#1|)) 0)) (and (not (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) ~global~0.base)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0)) 1))) (= |parse_input_~i~0#1| 0))} is VALID [2022-02-20 23:38:31,417 INFO L290 TraceCheckUtils]: 29: Hoare triple {51560#(and (or (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) |old(~global~0.base)|) (not (= (+ |~#commands~0.offset| (* 8 |parse_input_~i~0#1|)) 0)) (and (not (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) ~global~0.base)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0)) 1))) (= |parse_input_~i~0#1| 0))} assume 1 == #valid[~input#1.base]; {51560#(and (or (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) |old(~global~0.base)|) (not (= (+ |~#commands~0.offset| (* 8 |parse_input_~i~0#1|)) 0)) (and (not (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) ~global~0.base)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0)) 1))) (= |parse_input_~i~0#1| 0))} is VALID [2022-02-20 23:38:31,417 INFO L290 TraceCheckUtils]: 30: Hoare triple {51560#(and (or (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) |old(~global~0.base)|) (not (= (+ |~#commands~0.offset| (* 8 |parse_input_~i~0#1|)) 0)) (and (not (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) ~global~0.base)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0)) 1))) (= |parse_input_~i~0#1| 0))} assume ~input#1.offset < #length[~input#1.base] && ~input#1.offset >= 0; {51560#(and (or (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) |old(~global~0.base)|) (not (= (+ |~#commands~0.offset| (* 8 |parse_input_~i~0#1|)) 0)) (and (not (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) ~global~0.base)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0)) 1))) (= |parse_input_~i~0#1| 0))} is VALID [2022-02-20 23:38:31,418 INFO L290 TraceCheckUtils]: 31: Hoare triple {51560#(and (or (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) |old(~global~0.base)|) (not (= (+ |~#commands~0.offset| (* 8 |parse_input_~i~0#1|)) 0)) (and (not (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) ~global~0.base)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0)) 1))) (= |parse_input_~i~0#1| 0))} assume 0 == #t~nondet4#1;havoc #t~mem3#1.base, #t~mem3#1.offset;havoc #t~nondet4#1; {51560#(and (or (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) |old(~global~0.base)|) (not (= (+ |~#commands~0.offset| (* 8 |parse_input_~i~0#1|)) 0)) (and (not (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) ~global~0.base)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0)) 1))) (= |parse_input_~i~0#1| 0))} is VALID [2022-02-20 23:38:31,419 INFO L290 TraceCheckUtils]: 32: Hoare triple {51560#(and (or (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) |old(~global~0.base)|) (not (= (+ |~#commands~0.offset| (* 8 |parse_input_~i~0#1|)) 0)) (and (not (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) ~global~0.base)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0)) 1))) (= |parse_input_~i~0#1| 0))} SUMMARY for call #t~mem5#1 := read~int(~#commands~0.base, 8 + (~#commands~0.offset + 9 * ~i~0#1), 1); srcloc: L694 {51560#(and (or (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) |old(~global~0.base)|) (not (= (+ |~#commands~0.offset| (* 8 |parse_input_~i~0#1|)) 0)) (and (not (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) ~global~0.base)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0)) 1))) (= |parse_input_~i~0#1| 0))} is VALID [2022-02-20 23:38:31,419 INFO L290 TraceCheckUtils]: 33: Hoare triple {51560#(and (or (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) |old(~global~0.base)|) (not (= (+ |~#commands~0.offset| (* 8 |parse_input_~i~0#1|)) 0)) (and (not (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) ~global~0.base)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0)) 1))) (= |parse_input_~i~0#1| 0))} assume ~state~0 >= #t~mem5#1;havoc #t~mem5#1; {51560#(and (or (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) |old(~global~0.base)|) (not (= (+ |~#commands~0.offset| (* 8 |parse_input_~i~0#1|)) 0)) (and (not (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) ~global~0.base)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0)) 1))) (= |parse_input_~i~0#1| 0))} is VALID [2022-02-20 23:38:31,420 INFO L290 TraceCheckUtils]: 34: Hoare triple {51560#(and (or (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) |old(~global~0.base)|) (not (= (+ |~#commands~0.offset| (* 8 |parse_input_~i~0#1|)) 0)) (and (not (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) ~global~0.base)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0)) 1))) (= |parse_input_~i~0#1| 0))} SUMMARY for call #t~mem6#1.base, #t~mem6#1.offset := read~$Pointer$(~#commands~0.base, 4 + (~#commands~0.offset + 9 * ~i~0#1), 4); srcloc: L695 {51561#(or (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) |old(~global~0.base)|) (<= (+ |~#commands~0.offset| 1) 0) (<= 1 |~#commands~0.offset|) (and (not (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) ~global~0.base)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0)) 1)))} is VALID [2022-02-20 23:38:31,421 INFO L290 TraceCheckUtils]: 35: Hoare triple {51561#(or (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) |old(~global~0.base)|) (<= (+ |~#commands~0.offset| 1) 0) (<= 1 |~#commands~0.offset|) (and (not (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) ~global~0.base)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0)) 1)))} assume { :begin_inline_##fun~~TO~VOID } true;##fun~~TO~VOID_#in~#fp#1.base, ##fun~~TO~VOID_#in~#fp#1.offset := #t~mem6#1.base, #t~mem6#1.offset; {51561#(or (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) |old(~global~0.base)|) (<= (+ |~#commands~0.offset| 1) 0) (<= 1 |~#commands~0.offset|) (and (not (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) ~global~0.base)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0)) 1)))} is VALID [2022-02-20 23:38:31,421 INFO L290 TraceCheckUtils]: 36: Hoare triple {51561#(or (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) |old(~global~0.base)|) (<= (+ |~#commands~0.offset| 1) 0) (<= 1 |~#commands~0.offset|) (and (not (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) ~global~0.base)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0)) 1)))} assume !(##fun~~TO~VOID_#in~#fp#1.base == #funAddr~c2.base && ##fun~~TO~VOID_#in~#fp#1.offset == #funAddr~c2.offset);assume { :begin_inline_c1 } true;havoc c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset, c1_~x~0#1.base, c1_~x~0#1.offset;call c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset := #Ultimate.allocOnHeap(1);c1_~x~0#1.base, c1_~x~0#1.offset := c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset;havoc c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset; {51561#(or (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) |old(~global~0.base)|) (<= (+ |~#commands~0.offset| 1) 0) (<= 1 |~#commands~0.offset|) (and (not (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) ~global~0.base)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0)) 1)))} is VALID [2022-02-20 23:38:31,422 INFO L290 TraceCheckUtils]: 37: Hoare triple {51561#(or (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) |old(~global~0.base)|) (<= (+ |~#commands~0.offset| 1) 0) (<= 1 |~#commands~0.offset|) (and (not (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) ~global~0.base)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0)) 1)))} assume !(c1_~x~0#1.base == 0 && c1_~x~0#1.offset == 0); {51561#(or (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) |old(~global~0.base)|) (<= (+ |~#commands~0.offset| 1) 0) (<= 1 |~#commands~0.offset|) (and (not (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) ~global~0.base)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0)) 1)))} is VALID [2022-02-20 23:38:31,422 INFO L290 TraceCheckUtils]: 38: Hoare triple {51561#(or (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) |old(~global~0.base)|) (<= (+ |~#commands~0.offset| 1) 0) (<= 1 |~#commands~0.offset|) (and (not (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) ~global~0.base)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0)) 1)))} assume ~global~0.base != 0 || ~global~0.offset != 0; {51561#(or (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) |old(~global~0.base)|) (<= (+ |~#commands~0.offset| 1) 0) (<= 1 |~#commands~0.offset|) (and (not (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) ~global~0.base)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0)) 1)))} is VALID [2022-02-20 23:38:31,423 INFO L290 TraceCheckUtils]: 39: Hoare triple {51561#(or (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) |old(~global~0.base)|) (<= (+ |~#commands~0.offset| 1) 0) (<= 1 |~#commands~0.offset|) (and (not (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) ~global~0.base)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0)) 1)))} assume 0 == ~global~0.offset; {51561#(or (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) |old(~global~0.base)|) (<= (+ |~#commands~0.offset| 1) 0) (<= 1 |~#commands~0.offset|) (and (not (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) ~global~0.base)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0)) 1)))} is VALID [2022-02-20 23:38:31,424 INFO L290 TraceCheckUtils]: 40: Hoare triple {51561#(or (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) |old(~global~0.base)|) (<= (+ |~#commands~0.offset| 1) 0) (<= 1 |~#commands~0.offset|) (and (not (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) ~global~0.base)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0)) 1)))} assume ~global~0.base < #StackHeapBarrier; {51561#(or (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) |old(~global~0.base)|) (<= (+ |~#commands~0.offset| 1) 0) (<= 1 |~#commands~0.offset|) (and (not (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) ~global~0.base)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0)) 1)))} is VALID [2022-02-20 23:38:31,424 INFO L290 TraceCheckUtils]: 41: Hoare triple {51561#(or (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) |old(~global~0.base)|) (<= (+ |~#commands~0.offset| 1) 0) (<= 1 |~#commands~0.offset|) (and (not (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) ~global~0.base)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0)) 1)))} assume 0 == ~global~0.base || 1 == #valid[~global~0.base];call ULTIMATE.dealloc(~global~0.base, ~global~0.offset); {51562#(or (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) |old(~global~0.base)|) (<= (+ |~#commands~0.offset| 1) 0) (<= 1 |~#commands~0.offset|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0)) 1))} is VALID [2022-02-20 23:38:31,425 INFO L290 TraceCheckUtils]: 42: Hoare triple {51562#(or (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) |old(~global~0.base)|) (<= (+ |~#commands~0.offset| 1) 0) (<= 1 |~#commands~0.offset|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0)) 1))} ~global~0.base, ~global~0.offset := c1_~x~0#1.base, c1_~x~0#1.offset;~state~0 := ~unnamed3~0~STATE_2; {51562#(or (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) |old(~global~0.base)|) (<= (+ |~#commands~0.offset| 1) 0) (<= 1 |~#commands~0.offset|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0)) 1))} is VALID [2022-02-20 23:38:31,425 INFO L290 TraceCheckUtils]: 43: Hoare triple {51562#(or (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) |old(~global~0.base)|) (<= (+ |~#commands~0.offset| 1) 0) (<= 1 |~#commands~0.offset|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0)) 1))} assume { :end_inline_c1 } true; {51562#(or (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) |old(~global~0.base)|) (<= (+ |~#commands~0.offset| 1) 0) (<= 1 |~#commands~0.offset|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0)) 1))} is VALID [2022-02-20 23:38:31,426 INFO L290 TraceCheckUtils]: 44: Hoare triple {51562#(or (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) |old(~global~0.base)|) (<= (+ |~#commands~0.offset| 1) 0) (<= 1 |~#commands~0.offset|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0)) 1))} assume { :end_inline_##fun~~TO~VOID } true;havoc #t~mem6#1.base, #t~mem6#1.offset; {51562#(or (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) |old(~global~0.base)|) (<= (+ |~#commands~0.offset| 1) 0) (<= 1 |~#commands~0.offset|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0)) 1))} is VALID [2022-02-20 23:38:31,426 INFO L290 TraceCheckUtils]: 45: Hoare triple {51562#(or (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) |old(~global~0.base)|) (<= (+ |~#commands~0.offset| 1) 0) (<= 1 |~#commands~0.offset|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0)) 1))} assume true; {51562#(or (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) |old(~global~0.base)|) (<= (+ |~#commands~0.offset| 1) 0) (<= 1 |~#commands~0.offset|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0)) 1))} is VALID [2022-02-20 23:38:31,427 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {51562#(or (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) |old(~global~0.base)|) (<= (+ |~#commands~0.offset| 1) 0) (<= 1 |~#commands~0.offset|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0)) 1))} {51522#(and (not (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) ~global~0.base)) (<= 0 |~#commands~0.offset|) (<= |~#commands~0.offset| 0))} #103#return; {51546#(and (<= 0 |~#commands~0.offset|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0)) 1) (<= |~#commands~0.offset| 0))} is VALID [2022-02-20 23:38:31,428 INFO L272 TraceCheckUtils]: 47: Hoare triple {51546#(and (<= 0 |~#commands~0.offset|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0)) 1) (<= |~#commands~0.offset| 0))} call parse_input(5, 0); {51546#(and (<= 0 |~#commands~0.offset|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0)) 1) (<= |~#commands~0.offset| 0))} is VALID [2022-02-20 23:38:31,428 INFO L290 TraceCheckUtils]: 48: Hoare triple {51546#(and (<= 0 |~#commands~0.offset|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0)) 1) (<= |~#commands~0.offset| 0))} ~input#1.base, ~input#1.offset := #in~input#1.base, #in~input#1.offset;~i~0#1 := 0; {51547#(and (= (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset|) 0) (= |parse_input_~i~0#1| 0) (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset|))) 1))} is VALID [2022-02-20 23:38:31,429 INFO L290 TraceCheckUtils]: 49: Hoare triple {51547#(and (= (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset|) 0) (= |parse_input_~i~0#1| 0) (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset|))) 1))} assume !!(~i~0#1 < 2); {51547#(and (= (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset|) 0) (= |parse_input_~i~0#1| 0) (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset|))) 1))} is VALID [2022-02-20 23:38:31,439 INFO L290 TraceCheckUtils]: 50: Hoare triple {51547#(and (= (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset|) 0) (= |parse_input_~i~0#1| 0) (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset|))) 1))} SUMMARY for call #t~mem3#1.base, #t~mem3#1.offset := read~$Pointer$(~#commands~0.base, ~#commands~0.offset + 9 * ~i~0#1, 4); srcloc: L693 {51548#(= (select |#valid| |parse_input_#t~mem3#1.base|) 1)} is VALID [2022-02-20 23:38:31,439 INFO L290 TraceCheckUtils]: 51: Hoare triple {51548#(= (select |#valid| |parse_input_#t~mem3#1.base|) 1)} assume !(1 == #valid[#t~mem3#1.base]); {51500#false} is VALID [2022-02-20 23:38:31,439 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 4 proven. 23 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-20 23:38:31,440 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:38:31,440 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660675460] [2022-02-20 23:38:31,440 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [660675460] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 23:38:31,440 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [922347996] [2022-02-20 23:38:31,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:38:31,440 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:38:31,440 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:38:31,442 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 23:38:31,442 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-02-20 23:38:31,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:38:31,513 INFO L263 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 33 conjunts are in the unsatisfiable core [2022-02-20 23:38:31,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:38:31,523 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:38:31,782 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-02-20 23:38:31,783 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-02-20 23:38:32,053 INFO L356 Elim1Store]: treesize reduction 30, result has 37.5 percent of original size [2022-02-20 23:38:32,054 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 29 [2022-02-20 23:38:32,141 INFO L356 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-02-20 23:38:32,141 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 26 [2022-02-20 23:38:32,361 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-02-20 23:38:32,387 INFO L290 TraceCheckUtils]: 0: Hoare triple {51499#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(3, 1);call write~init~int(99, 1, 0, 1);call write~init~int(49, 1, 1, 1);call write~init~int(0, 1, 2, 1);call #Ultimate.allocInit(3, 2);call write~init~int(99, 2, 0, 1);call write~init~int(50, 2, 1, 1);call write~init~int(0, 2, 2, 1);call #Ultimate.allocInit(3, 3);call write~init~int(99, 3, 0, 1);call write~init~int(49, 3, 1, 1);call write~init~int(0, 3, 2, 1);call #Ultimate.allocInit(3, 4);call write~init~int(99, 4, 0, 1);call write~init~int(49, 4, 1, 1);call write~init~int(0, 4, 2, 1);call #Ultimate.allocInit(3, 5);call write~init~int(99, 5, 0, 1);call write~init~int(50, 5, 1, 1);call write~init~int(0, 5, 2, 1);~state~0 := ~unnamed3~0~STATE_1;~global~0.base, ~global~0.offset := 0, 0;~#commands~0.base, ~#commands~0.offset := 6, 0;call #Ultimate.allocInit(18, 6);call write~init~$Pointer$(1, 0, ~#commands~0.base, ~#commands~0.offset, 4);call write~init~$Pointer$(#funAddr~c1.base, #funAddr~c1.offset, ~#commands~0.base, 4 + ~#commands~0.offset, 4);call write~init~int((if ~unnamed3~0~STATE_1 % 256 <= 127 then ~unnamed3~0~STATE_1 % 256 else ~unnamed3~0~STATE_1 % 256 - 256), ~#commands~0.base, 8 + ~#commands~0.offset, 1);call write~init~$Pointer$(2, 0, ~#commands~0.base, 9 + ~#commands~0.offset, 4);call write~init~$Pointer$(#funAddr~c2.base, #funAddr~c2.offset, ~#commands~0.base, 13 + ~#commands~0.offset, 4);call write~init~int((if ~unnamed3~0~STATE_2 % 256 <= 127 then ~unnamed3~0~STATE_2 % 256 else ~unnamed3~0~STATE_2 % 256 - 256), ~#commands~0.base, 17 + ~#commands~0.offset, 1); {51566#(and (= (select |#valid| 1) 1) (= |~#commands~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1))} is VALID [2022-02-20 23:38:32,387 INFO L290 TraceCheckUtils]: 1: Hoare triple {51566#(and (= (select |#valid| 1) 1) (= |~#commands~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1))} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1; {51566#(and (= (select |#valid| 1) 1) (= |~#commands~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1))} is VALID [2022-02-20 23:38:32,388 INFO L272 TraceCheckUtils]: 2: Hoare triple {51566#(and (= (select |#valid| 1) 1) (= |~#commands~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1))} call parse_input(3, 0); {51573#(and (= |~#commands~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 23:38:32,388 INFO L290 TraceCheckUtils]: 3: Hoare triple {51573#(and (= |~#commands~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1) (= |old(#valid)| |#valid|))} ~input#1.base, ~input#1.offset := #in~input#1.base, #in~input#1.offset;~i~0#1 := 0; {51573#(and (= |~#commands~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 23:38:32,388 INFO L290 TraceCheckUtils]: 4: Hoare triple {51573#(and (= |~#commands~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1) (= |old(#valid)| |#valid|))} assume !!(~i~0#1 < 2); {51573#(and (= |~#commands~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 23:38:32,389 INFO L290 TraceCheckUtils]: 5: Hoare triple {51573#(and (= |~#commands~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1) (= |old(#valid)| |#valid|))} SUMMARY for call #t~mem3#1.base, #t~mem3#1.offset := read~$Pointer$(~#commands~0.base, ~#commands~0.offset + 9 * ~i~0#1, 4); srcloc: L693 {51573#(and (= |~#commands~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 23:38:32,389 INFO L290 TraceCheckUtils]: 6: Hoare triple {51573#(and (= |~#commands~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1) (= |old(#valid)| |#valid|))} assume 1 == #valid[#t~mem3#1.base]; {51573#(and (= |~#commands~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 23:38:32,390 INFO L290 TraceCheckUtils]: 7: Hoare triple {51573#(and (= |~#commands~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1) (= |old(#valid)| |#valid|))} assume #t~mem3#1.offset < #length[#t~mem3#1.base] && #t~mem3#1.offset >= 0; {51573#(and (= |~#commands~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 23:38:32,390 INFO L290 TraceCheckUtils]: 8: Hoare triple {51573#(and (= |~#commands~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1) (= |old(#valid)| |#valid|))} assume 1 == #valid[~input#1.base]; {51573#(and (= |~#commands~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 23:38:32,390 INFO L290 TraceCheckUtils]: 9: Hoare triple {51573#(and (= |~#commands~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1) (= |old(#valid)| |#valid|))} assume ~input#1.offset < #length[~input#1.base] && ~input#1.offset >= 0; {51573#(and (= |~#commands~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 23:38:32,391 INFO L290 TraceCheckUtils]: 10: Hoare triple {51573#(and (= |~#commands~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1) (= |old(#valid)| |#valid|))} assume 0 == #t~nondet4#1;havoc #t~mem3#1.base, #t~mem3#1.offset;havoc #t~nondet4#1; {51573#(and (= |~#commands~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 23:38:32,391 INFO L290 TraceCheckUtils]: 11: Hoare triple {51573#(and (= |~#commands~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1) (= |old(#valid)| |#valid|))} SUMMARY for call #t~mem5#1 := read~int(~#commands~0.base, 8 + (~#commands~0.offset + 9 * ~i~0#1), 1); srcloc: L694 {51573#(and (= |~#commands~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 23:38:32,391 INFO L290 TraceCheckUtils]: 12: Hoare triple {51573#(and (= |~#commands~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1) (= |old(#valid)| |#valid|))} assume ~state~0 >= #t~mem5#1;havoc #t~mem5#1; {51573#(and (= |~#commands~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 23:38:32,392 INFO L290 TraceCheckUtils]: 13: Hoare triple {51573#(and (= |~#commands~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1) (= |old(#valid)| |#valid|))} SUMMARY for call #t~mem6#1.base, #t~mem6#1.offset := read~$Pointer$(~#commands~0.base, 4 + (~#commands~0.offset + 9 * ~i~0#1), 4); srcloc: L695 {51573#(and (= |~#commands~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 23:38:32,392 INFO L290 TraceCheckUtils]: 14: Hoare triple {51573#(and (= |~#commands~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1) (= |old(#valid)| |#valid|))} assume { :begin_inline_##fun~~TO~VOID } true;##fun~~TO~VOID_#in~#fp#1.base, ##fun~~TO~VOID_#in~#fp#1.offset := #t~mem6#1.base, #t~mem6#1.offset; {51573#(and (= |~#commands~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 23:38:32,393 INFO L290 TraceCheckUtils]: 15: Hoare triple {51573#(and (= |~#commands~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1) (= |old(#valid)| |#valid|))} assume !(##fun~~TO~VOID_#in~#fp#1.base == #funAddr~c2.base && ##fun~~TO~VOID_#in~#fp#1.offset == #funAddr~c2.offset);assume { :begin_inline_c1 } true;havoc c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset, c1_~x~0#1.base, c1_~x~0#1.offset;call c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset := #Ultimate.allocOnHeap(1);c1_~x~0#1.base, c1_~x~0#1.offset := c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset;havoc c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset; {51613#(and (= |~#commands~0.offset| 0) (= (select |old(#valid)| |parse_input_c1_~x~0#1.base|) 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1))} is VALID [2022-02-20 23:38:32,393 INFO L290 TraceCheckUtils]: 16: Hoare triple {51613#(and (= |~#commands~0.offset| 0) (= (select |old(#valid)| |parse_input_c1_~x~0#1.base|) 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1))} assume !(c1_~x~0#1.base == 0 && c1_~x~0#1.offset == 0); {51613#(and (= |~#commands~0.offset| 0) (= (select |old(#valid)| |parse_input_c1_~x~0#1.base|) 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1))} is VALID [2022-02-20 23:38:32,393 INFO L290 TraceCheckUtils]: 17: Hoare triple {51613#(and (= |~#commands~0.offset| 0) (= (select |old(#valid)| |parse_input_c1_~x~0#1.base|) 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1))} assume !(~global~0.base != 0 || ~global~0.offset != 0); {51613#(and (= |~#commands~0.offset| 0) (= (select |old(#valid)| |parse_input_c1_~x~0#1.base|) 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1))} is VALID [2022-02-20 23:38:32,394 INFO L290 TraceCheckUtils]: 18: Hoare triple {51613#(and (= |~#commands~0.offset| 0) (= (select |old(#valid)| |parse_input_c1_~x~0#1.base|) 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1))} ~global~0.base, ~global~0.offset := c1_~x~0#1.base, c1_~x~0#1.offset;~state~0 := ~unnamed3~0~STATE_2; {51623#(and (= (select |old(#valid)| ~global~0.base) 0) (= |~#commands~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1))} is VALID [2022-02-20 23:38:32,394 INFO L290 TraceCheckUtils]: 19: Hoare triple {51623#(and (= (select |old(#valid)| ~global~0.base) 0) (= |~#commands~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1))} assume { :end_inline_c1 } true; {51623#(and (= (select |old(#valid)| ~global~0.base) 0) (= |~#commands~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1))} is VALID [2022-02-20 23:38:32,395 INFO L290 TraceCheckUtils]: 20: Hoare triple {51623#(and (= (select |old(#valid)| ~global~0.base) 0) (= |~#commands~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1))} assume { :end_inline_##fun~~TO~VOID } true;havoc #t~mem6#1.base, #t~mem6#1.offset; {51623#(and (= (select |old(#valid)| ~global~0.base) 0) (= |~#commands~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1))} is VALID [2022-02-20 23:38:32,395 INFO L290 TraceCheckUtils]: 21: Hoare triple {51623#(and (= (select |old(#valid)| ~global~0.base) 0) (= |~#commands~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1))} assume true; {51623#(and (= (select |old(#valid)| ~global~0.base) 0) (= |~#commands~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1))} is VALID [2022-02-20 23:38:32,396 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {51623#(and (= (select |old(#valid)| ~global~0.base) 0) (= |~#commands~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1))} {51566#(and (= (select |#valid| 1) 1) (= |~#commands~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1))} #101#return; {51636#(and (not (= ~global~0.base 1)) (= |~#commands~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1))} is VALID [2022-02-20 23:38:32,396 INFO L272 TraceCheckUtils]: 23: Hoare triple {51636#(and (not (= ~global~0.base 1)) (= |~#commands~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1))} call parse_input(4, 0); {51640#(and (= ~global~0.base |old(~global~0.base)|) (= |~#commands~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1))} is VALID [2022-02-20 23:38:32,397 INFO L290 TraceCheckUtils]: 24: Hoare triple {51640#(and (= ~global~0.base |old(~global~0.base)|) (= |~#commands~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1))} ~input#1.base, ~input#1.offset := #in~input#1.base, #in~input#1.offset;~i~0#1 := 0; {51644#(and (= ~global~0.base |old(~global~0.base)|) (= |~#commands~0.offset| 0) (= |parse_input_~i~0#1| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1))} is VALID [2022-02-20 23:38:32,397 INFO L290 TraceCheckUtils]: 25: Hoare triple {51644#(and (= ~global~0.base |old(~global~0.base)|) (= |~#commands~0.offset| 0) (= |parse_input_~i~0#1| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1))} assume !!(~i~0#1 < 2); {51644#(and (= ~global~0.base |old(~global~0.base)|) (= |~#commands~0.offset| 0) (= |parse_input_~i~0#1| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1))} is VALID [2022-02-20 23:38:32,397 INFO L290 TraceCheckUtils]: 26: Hoare triple {51644#(and (= ~global~0.base |old(~global~0.base)|) (= |~#commands~0.offset| 0) (= |parse_input_~i~0#1| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1))} SUMMARY for call #t~mem3#1.base, #t~mem3#1.offset := read~$Pointer$(~#commands~0.base, ~#commands~0.offset + 9 * ~i~0#1, 4); srcloc: L693 {51651#(and (= ~global~0.base |old(~global~0.base)|) (= |parse_input_#t~mem3#1.base| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|)) (= |~#commands~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1))} is VALID [2022-02-20 23:38:32,398 INFO L290 TraceCheckUtils]: 27: Hoare triple {51651#(and (= ~global~0.base |old(~global~0.base)|) (= |parse_input_#t~mem3#1.base| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|)) (= |~#commands~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1))} assume 1 == #valid[#t~mem3#1.base]; {51655#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|)) 1) (= ~global~0.base |old(~global~0.base)|) (= |~#commands~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1))} is VALID [2022-02-20 23:38:32,398 INFO L290 TraceCheckUtils]: 28: Hoare triple {51655#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|)) 1) (= ~global~0.base |old(~global~0.base)|) (= |~#commands~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1))} assume #t~mem3#1.offset < #length[#t~mem3#1.base] && #t~mem3#1.offset >= 0; {51655#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|)) 1) (= ~global~0.base |old(~global~0.base)|) (= |~#commands~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1))} is VALID [2022-02-20 23:38:32,398 INFO L290 TraceCheckUtils]: 29: Hoare triple {51655#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|)) 1) (= ~global~0.base |old(~global~0.base)|) (= |~#commands~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1))} assume 1 == #valid[~input#1.base]; {51655#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|)) 1) (= ~global~0.base |old(~global~0.base)|) (= |~#commands~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1))} is VALID [2022-02-20 23:38:32,399 INFO L290 TraceCheckUtils]: 30: Hoare triple {51655#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|)) 1) (= ~global~0.base |old(~global~0.base)|) (= |~#commands~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1))} assume ~input#1.offset < #length[~input#1.base] && ~input#1.offset >= 0; {51655#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|)) 1) (= ~global~0.base |old(~global~0.base)|) (= |~#commands~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1))} is VALID [2022-02-20 23:38:32,399 INFO L290 TraceCheckUtils]: 31: Hoare triple {51655#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|)) 1) (= ~global~0.base |old(~global~0.base)|) (= |~#commands~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1))} assume 0 == #t~nondet4#1;havoc #t~mem3#1.base, #t~mem3#1.offset;havoc #t~nondet4#1; {51655#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|)) 1) (= ~global~0.base |old(~global~0.base)|) (= |~#commands~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1))} is VALID [2022-02-20 23:38:32,400 INFO L290 TraceCheckUtils]: 32: Hoare triple {51655#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|)) 1) (= ~global~0.base |old(~global~0.base)|) (= |~#commands~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1))} SUMMARY for call #t~mem5#1 := read~int(~#commands~0.base, 8 + (~#commands~0.offset + 9 * ~i~0#1), 1); srcloc: L694 {51655#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|)) 1) (= ~global~0.base |old(~global~0.base)|) (= |~#commands~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1))} is VALID [2022-02-20 23:38:32,400 INFO L290 TraceCheckUtils]: 33: Hoare triple {51655#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|)) 1) (= ~global~0.base |old(~global~0.base)|) (= |~#commands~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1))} assume ~state~0 >= #t~mem5#1;havoc #t~mem5#1; {51655#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|)) 1) (= ~global~0.base |old(~global~0.base)|) (= |~#commands~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1))} is VALID [2022-02-20 23:38:32,401 INFO L290 TraceCheckUtils]: 34: Hoare triple {51655#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|)) 1) (= ~global~0.base |old(~global~0.base)|) (= |~#commands~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1))} SUMMARY for call #t~mem6#1.base, #t~mem6#1.offset := read~$Pointer$(~#commands~0.base, 4 + (~#commands~0.offset + 9 * ~i~0#1), 4); srcloc: L695 {51655#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|)) 1) (= ~global~0.base |old(~global~0.base)|) (= |~#commands~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1))} is VALID [2022-02-20 23:38:32,401 INFO L290 TraceCheckUtils]: 35: Hoare triple {51655#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|)) 1) (= ~global~0.base |old(~global~0.base)|) (= |~#commands~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1))} assume { :begin_inline_##fun~~TO~VOID } true;##fun~~TO~VOID_#in~#fp#1.base, ##fun~~TO~VOID_#in~#fp#1.offset := #t~mem6#1.base, #t~mem6#1.offset; {51655#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|)) 1) (= ~global~0.base |old(~global~0.base)|) (= |~#commands~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1))} is VALID [2022-02-20 23:38:32,402 INFO L290 TraceCheckUtils]: 36: Hoare triple {51655#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|)) 1) (= ~global~0.base |old(~global~0.base)|) (= |~#commands~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1))} assume !(##fun~~TO~VOID_#in~#fp#1.base == #funAddr~c2.base && ##fun~~TO~VOID_#in~#fp#1.offset == #funAddr~c2.offset);assume { :begin_inline_c1 } true;havoc c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset, c1_~x~0#1.base, c1_~x~0#1.offset;call c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset := #Ultimate.allocOnHeap(1);c1_~x~0#1.base, c1_~x~0#1.offset := c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset;havoc c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset; {51655#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|)) 1) (= ~global~0.base |old(~global~0.base)|) (= |~#commands~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1))} is VALID [2022-02-20 23:38:32,402 INFO L290 TraceCheckUtils]: 37: Hoare triple {51655#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|)) 1) (= ~global~0.base |old(~global~0.base)|) (= |~#commands~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1))} assume !(c1_~x~0#1.base == 0 && c1_~x~0#1.offset == 0); {51655#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|)) 1) (= ~global~0.base |old(~global~0.base)|) (= |~#commands~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1))} is VALID [2022-02-20 23:38:32,402 INFO L290 TraceCheckUtils]: 38: Hoare triple {51655#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|)) 1) (= ~global~0.base |old(~global~0.base)|) (= |~#commands~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1))} assume ~global~0.base != 0 || ~global~0.offset != 0; {51655#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|)) 1) (= ~global~0.base |old(~global~0.base)|) (= |~#commands~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1))} is VALID [2022-02-20 23:38:32,403 INFO L290 TraceCheckUtils]: 39: Hoare triple {51655#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|)) 1) (= ~global~0.base |old(~global~0.base)|) (= |~#commands~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1))} assume 0 == ~global~0.offset; {51655#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|)) 1) (= ~global~0.base |old(~global~0.base)|) (= |~#commands~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1))} is VALID [2022-02-20 23:38:32,403 INFO L290 TraceCheckUtils]: 40: Hoare triple {51655#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|)) 1) (= ~global~0.base |old(~global~0.base)|) (= |~#commands~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1))} assume ~global~0.base < #StackHeapBarrier; {51655#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|)) 1) (= ~global~0.base |old(~global~0.base)|) (= |~#commands~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1))} is VALID [2022-02-20 23:38:32,404 INFO L290 TraceCheckUtils]: 41: Hoare triple {51655#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|)) 1) (= ~global~0.base |old(~global~0.base)|) (= |~#commands~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1))} assume 0 == ~global~0.base || 1 == #valid[~global~0.base];call ULTIMATE.dealloc(~global~0.base, ~global~0.offset); {51698#(and (or (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|)) 1) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) |old(~global~0.base)|)) (= |~#commands~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1))} is VALID [2022-02-20 23:38:32,404 INFO L290 TraceCheckUtils]: 42: Hoare triple {51698#(and (or (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|)) 1) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) |old(~global~0.base)|)) (= |~#commands~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1))} ~global~0.base, ~global~0.offset := c1_~x~0#1.base, c1_~x~0#1.offset;~state~0 := ~unnamed3~0~STATE_2; {51698#(and (or (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|)) 1) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) |old(~global~0.base)|)) (= |~#commands~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1))} is VALID [2022-02-20 23:38:32,405 INFO L290 TraceCheckUtils]: 43: Hoare triple {51698#(and (or (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|)) 1) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) |old(~global~0.base)|)) (= |~#commands~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1))} assume { :end_inline_c1 } true; {51698#(and (or (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|)) 1) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) |old(~global~0.base)|)) (= |~#commands~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1))} is VALID [2022-02-20 23:38:32,405 INFO L290 TraceCheckUtils]: 44: Hoare triple {51698#(and (or (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|)) 1) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) |old(~global~0.base)|)) (= |~#commands~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1))} assume { :end_inline_##fun~~TO~VOID } true;havoc #t~mem6#1.base, #t~mem6#1.offset; {51698#(and (or (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|)) 1) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) |old(~global~0.base)|)) (= |~#commands~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1))} is VALID [2022-02-20 23:38:32,405 INFO L290 TraceCheckUtils]: 45: Hoare triple {51698#(and (or (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|)) 1) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) |old(~global~0.base)|)) (= |~#commands~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1))} assume true; {51698#(and (or (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|)) 1) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) |old(~global~0.base)|)) (= |~#commands~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1))} is VALID [2022-02-20 23:38:32,406 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {51698#(and (or (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|)) 1) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) |old(~global~0.base)|)) (= |~#commands~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1))} {51636#(and (not (= ~global~0.base 1)) (= |~#commands~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1))} #103#return; {51566#(and (= (select |#valid| 1) 1) (= |~#commands~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1))} is VALID [2022-02-20 23:38:32,407 INFO L272 TraceCheckUtils]: 47: Hoare triple {51566#(and (= (select |#valid| 1) 1) (= |~#commands~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1))} call parse_input(5, 0); {51566#(and (= (select |#valid| 1) 1) (= |~#commands~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1))} is VALID [2022-02-20 23:38:32,407 INFO L290 TraceCheckUtils]: 48: Hoare triple {51566#(and (= (select |#valid| 1) 1) (= |~#commands~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1))} ~input#1.base, ~input#1.offset := #in~input#1.base, #in~input#1.offset;~i~0#1 := 0; {51720#(and (= (select |#valid| 1) 1) (= |~#commands~0.offset| 0) (= |parse_input_~i~0#1| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1))} is VALID [2022-02-20 23:38:32,407 INFO L290 TraceCheckUtils]: 49: Hoare triple {51720#(and (= (select |#valid| 1) 1) (= |~#commands~0.offset| 0) (= |parse_input_~i~0#1| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1))} assume !!(~i~0#1 < 2); {51720#(and (= (select |#valid| 1) 1) (= |~#commands~0.offset| 0) (= |parse_input_~i~0#1| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1))} is VALID [2022-02-20 23:38:32,408 INFO L290 TraceCheckUtils]: 50: Hoare triple {51720#(and (= (select |#valid| 1) 1) (= |~#commands~0.offset| 0) (= |parse_input_~i~0#1| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1))} SUMMARY for call #t~mem3#1.base, #t~mem3#1.offset := read~$Pointer$(~#commands~0.base, ~#commands~0.offset + 9 * ~i~0#1, 4); srcloc: L693 {51727#(and (= (select |#valid| 1) 1) (= |parse_input_#t~mem3#1.base| 1))} is VALID [2022-02-20 23:38:32,408 INFO L290 TraceCheckUtils]: 51: Hoare triple {51727#(and (= (select |#valid| 1) 1) (= |parse_input_#t~mem3#1.base| 1))} assume !(1 == #valid[#t~mem3#1.base]); {51500#false} is VALID [2022-02-20 23:38:32,408 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:38:32,408 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:38:32,628 INFO L356 Elim1Store]: treesize reduction 5, result has 58.3 percent of original size [2022-02-20 23:38:32,628 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 178 treesize of output 165 [2022-02-20 23:38:33,587 INFO L356 Elim1Store]: treesize reduction 5, result has 84.8 percent of original size [2022-02-20 23:38:33,591 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 84 treesize of output 101 [2022-02-20 23:38:33,960 INFO L290 TraceCheckUtils]: 51: Hoare triple {51548#(= (select |#valid| |parse_input_#t~mem3#1.base|) 1)} assume !(1 == #valid[#t~mem3#1.base]); {51500#false} is VALID [2022-02-20 23:38:33,960 INFO L290 TraceCheckUtils]: 50: Hoare triple {51734#(= (select |#valid| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset|))) 1)} SUMMARY for call #t~mem3#1.base, #t~mem3#1.offset := read~$Pointer$(~#commands~0.base, ~#commands~0.offset + 9 * ~i~0#1, 4); srcloc: L693 {51548#(= (select |#valid| |parse_input_#t~mem3#1.base|) 1)} is VALID [2022-02-20 23:38:33,961 INFO L290 TraceCheckUtils]: 49: Hoare triple {51734#(= (select |#valid| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset|))) 1)} assume !!(~i~0#1 < 2); {51734#(= (select |#valid| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset|))) 1)} is VALID [2022-02-20 23:38:33,961 INFO L290 TraceCheckUtils]: 48: Hoare triple {51741#(= (select |#valid| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|)) 1)} ~input#1.base, ~input#1.offset := #in~input#1.base, #in~input#1.offset;~i~0#1 := 0; {51734#(= (select |#valid| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset|))) 1)} is VALID [2022-02-20 23:38:33,961 INFO L272 TraceCheckUtils]: 47: Hoare triple {51741#(= (select |#valid| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|)) 1)} call parse_input(5, 0); {51741#(= (select |#valid| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|)) 1)} is VALID [2022-02-20 23:38:33,962 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {51752#(or (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|)) 1) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) |old(~global~0.base)|))} {51748#(not (= ~global~0.base (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|)))} #103#return; {51741#(= (select |#valid| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|)) 1)} is VALID [2022-02-20 23:38:33,962 INFO L290 TraceCheckUtils]: 45: Hoare triple {51752#(or (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|)) 1) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) |old(~global~0.base)|))} assume true; {51752#(or (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|)) 1) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) |old(~global~0.base)|))} is VALID [2022-02-20 23:38:33,963 INFO L290 TraceCheckUtils]: 44: Hoare triple {51752#(or (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|)) 1) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) |old(~global~0.base)|))} assume { :end_inline_##fun~~TO~VOID } true;havoc #t~mem6#1.base, #t~mem6#1.offset; {51752#(or (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|)) 1) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) |old(~global~0.base)|))} is VALID [2022-02-20 23:38:33,963 INFO L290 TraceCheckUtils]: 43: Hoare triple {51752#(or (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|)) 1) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) |old(~global~0.base)|))} assume { :end_inline_c1 } true; {51752#(or (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|)) 1) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) |old(~global~0.base)|))} is VALID [2022-02-20 23:38:33,963 INFO L290 TraceCheckUtils]: 42: Hoare triple {51752#(or (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|)) 1) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) |old(~global~0.base)|))} ~global~0.base, ~global~0.offset := c1_~x~0#1.base, c1_~x~0#1.offset;~state~0 := ~unnamed3~0~STATE_2; {51752#(or (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|)) 1) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) |old(~global~0.base)|))} is VALID [2022-02-20 23:38:33,964 INFO L290 TraceCheckUtils]: 41: Hoare triple {51768#(or (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) |old(~global~0.base)|) (forall ((v_ArrVal_179 Int)) (= (select (store |#valid| ~global~0.base v_ArrVal_179) (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|)) 1)))} assume 0 == ~global~0.base || 1 == #valid[~global~0.base];call ULTIMATE.dealloc(~global~0.base, ~global~0.offset); {51752#(or (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|)) 1) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) |old(~global~0.base)|))} is VALID [2022-02-20 23:38:33,964 INFO L290 TraceCheckUtils]: 40: Hoare triple {51768#(or (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) |old(~global~0.base)|) (forall ((v_ArrVal_179 Int)) (= (select (store |#valid| ~global~0.base v_ArrVal_179) (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|)) 1)))} assume ~global~0.base < #StackHeapBarrier; {51768#(or (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) |old(~global~0.base)|) (forall ((v_ArrVal_179 Int)) (= (select (store |#valid| ~global~0.base v_ArrVal_179) (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|)) 1)))} is VALID [2022-02-20 23:38:33,965 INFO L290 TraceCheckUtils]: 39: Hoare triple {51768#(or (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) |old(~global~0.base)|) (forall ((v_ArrVal_179 Int)) (= (select (store |#valid| ~global~0.base v_ArrVal_179) (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|)) 1)))} assume 0 == ~global~0.offset; {51768#(or (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) |old(~global~0.base)|) (forall ((v_ArrVal_179 Int)) (= (select (store |#valid| ~global~0.base v_ArrVal_179) (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|)) 1)))} is VALID [2022-02-20 23:38:33,965 INFO L290 TraceCheckUtils]: 38: Hoare triple {51768#(or (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) |old(~global~0.base)|) (forall ((v_ArrVal_179 Int)) (= (select (store |#valid| ~global~0.base v_ArrVal_179) (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|)) 1)))} assume ~global~0.base != 0 || ~global~0.offset != 0; {51768#(or (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) |old(~global~0.base)|) (forall ((v_ArrVal_179 Int)) (= (select (store |#valid| ~global~0.base v_ArrVal_179) (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|)) 1)))} is VALID [2022-02-20 23:38:33,965 INFO L290 TraceCheckUtils]: 37: Hoare triple {51768#(or (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) |old(~global~0.base)|) (forall ((v_ArrVal_179 Int)) (= (select (store |#valid| ~global~0.base v_ArrVal_179) (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|)) 1)))} assume !(c1_~x~0#1.base == 0 && c1_~x~0#1.offset == 0); {51768#(or (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) |old(~global~0.base)|) (forall ((v_ArrVal_179 Int)) (= (select (store |#valid| ~global~0.base v_ArrVal_179) (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|)) 1)))} is VALID [2022-02-20 23:38:33,966 INFO L290 TraceCheckUtils]: 36: Hoare triple {51784#(or (forall ((|v_parse_input_c1_~x~0#1.base_55| Int) (v_ArrVal_179 Int) (v_ArrVal_178 Int)) (or (not (= (select |#valid| |v_parse_input_c1_~x~0#1.base_55|) 0)) (= (select (store (store |#valid| |v_parse_input_c1_~x~0#1.base_55| v_ArrVal_178) ~global~0.base v_ArrVal_179) (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|)) 1))) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) |old(~global~0.base)|))} assume !(##fun~~TO~VOID_#in~#fp#1.base == #funAddr~c2.base && ##fun~~TO~VOID_#in~#fp#1.offset == #funAddr~c2.offset);assume { :begin_inline_c1 } true;havoc c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset, c1_~x~0#1.base, c1_~x~0#1.offset;call c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset := #Ultimate.allocOnHeap(1);c1_~x~0#1.base, c1_~x~0#1.offset := c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset;havoc c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset; {51768#(or (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) |old(~global~0.base)|) (forall ((v_ArrVal_179 Int)) (= (select (store |#valid| ~global~0.base v_ArrVal_179) (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|)) 1)))} is VALID [2022-02-20 23:38:33,967 INFO L290 TraceCheckUtils]: 35: Hoare triple {51784#(or (forall ((|v_parse_input_c1_~x~0#1.base_55| Int) (v_ArrVal_179 Int) (v_ArrVal_178 Int)) (or (not (= (select |#valid| |v_parse_input_c1_~x~0#1.base_55|) 0)) (= (select (store (store |#valid| |v_parse_input_c1_~x~0#1.base_55| v_ArrVal_178) ~global~0.base v_ArrVal_179) (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|)) 1))) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) |old(~global~0.base)|))} assume { :begin_inline_##fun~~TO~VOID } true;##fun~~TO~VOID_#in~#fp#1.base, ##fun~~TO~VOID_#in~#fp#1.offset := #t~mem6#1.base, #t~mem6#1.offset; {51784#(or (forall ((|v_parse_input_c1_~x~0#1.base_55| Int) (v_ArrVal_179 Int) (v_ArrVal_178 Int)) (or (not (= (select |#valid| |v_parse_input_c1_~x~0#1.base_55|) 0)) (= (select (store (store |#valid| |v_parse_input_c1_~x~0#1.base_55| v_ArrVal_178) ~global~0.base v_ArrVal_179) (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|)) 1))) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) |old(~global~0.base)|))} is VALID [2022-02-20 23:38:33,976 INFO L290 TraceCheckUtils]: 34: Hoare triple {51784#(or (forall ((|v_parse_input_c1_~x~0#1.base_55| Int) (v_ArrVal_179 Int) (v_ArrVal_178 Int)) (or (not (= (select |#valid| |v_parse_input_c1_~x~0#1.base_55|) 0)) (= (select (store (store |#valid| |v_parse_input_c1_~x~0#1.base_55| v_ArrVal_178) ~global~0.base v_ArrVal_179) (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|)) 1))) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) |old(~global~0.base)|))} SUMMARY for call #t~mem6#1.base, #t~mem6#1.offset := read~$Pointer$(~#commands~0.base, 4 + (~#commands~0.offset + 9 * ~i~0#1), 4); srcloc: L695 {51784#(or (forall ((|v_parse_input_c1_~x~0#1.base_55| Int) (v_ArrVal_179 Int) (v_ArrVal_178 Int)) (or (not (= (select |#valid| |v_parse_input_c1_~x~0#1.base_55|) 0)) (= (select (store (store |#valid| |v_parse_input_c1_~x~0#1.base_55| v_ArrVal_178) ~global~0.base v_ArrVal_179) (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|)) 1))) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) |old(~global~0.base)|))} is VALID [2022-02-20 23:38:33,987 INFO L290 TraceCheckUtils]: 33: Hoare triple {51784#(or (forall ((|v_parse_input_c1_~x~0#1.base_55| Int) (v_ArrVal_179 Int) (v_ArrVal_178 Int)) (or (not (= (select |#valid| |v_parse_input_c1_~x~0#1.base_55|) 0)) (= (select (store (store |#valid| |v_parse_input_c1_~x~0#1.base_55| v_ArrVal_178) ~global~0.base v_ArrVal_179) (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|)) 1))) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) |old(~global~0.base)|))} assume ~state~0 >= #t~mem5#1;havoc #t~mem5#1; {51784#(or (forall ((|v_parse_input_c1_~x~0#1.base_55| Int) (v_ArrVal_179 Int) (v_ArrVal_178 Int)) (or (not (= (select |#valid| |v_parse_input_c1_~x~0#1.base_55|) 0)) (= (select (store (store |#valid| |v_parse_input_c1_~x~0#1.base_55| v_ArrVal_178) ~global~0.base v_ArrVal_179) (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|)) 1))) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) |old(~global~0.base)|))} is VALID [2022-02-20 23:38:33,988 INFO L290 TraceCheckUtils]: 32: Hoare triple {51784#(or (forall ((|v_parse_input_c1_~x~0#1.base_55| Int) (v_ArrVal_179 Int) (v_ArrVal_178 Int)) (or (not (= (select |#valid| |v_parse_input_c1_~x~0#1.base_55|) 0)) (= (select (store (store |#valid| |v_parse_input_c1_~x~0#1.base_55| v_ArrVal_178) ~global~0.base v_ArrVal_179) (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|)) 1))) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) |old(~global~0.base)|))} SUMMARY for call #t~mem5#1 := read~int(~#commands~0.base, 8 + (~#commands~0.offset + 9 * ~i~0#1), 1); srcloc: L694 {51784#(or (forall ((|v_parse_input_c1_~x~0#1.base_55| Int) (v_ArrVal_179 Int) (v_ArrVal_178 Int)) (or (not (= (select |#valid| |v_parse_input_c1_~x~0#1.base_55|) 0)) (= (select (store (store |#valid| |v_parse_input_c1_~x~0#1.base_55| v_ArrVal_178) ~global~0.base v_ArrVal_179) (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|)) 1))) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) |old(~global~0.base)|))} is VALID [2022-02-20 23:38:33,988 INFO L290 TraceCheckUtils]: 31: Hoare triple {51784#(or (forall ((|v_parse_input_c1_~x~0#1.base_55| Int) (v_ArrVal_179 Int) (v_ArrVal_178 Int)) (or (not (= (select |#valid| |v_parse_input_c1_~x~0#1.base_55|) 0)) (= (select (store (store |#valid| |v_parse_input_c1_~x~0#1.base_55| v_ArrVal_178) ~global~0.base v_ArrVal_179) (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|)) 1))) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) |old(~global~0.base)|))} assume 0 == #t~nondet4#1;havoc #t~mem3#1.base, #t~mem3#1.offset;havoc #t~nondet4#1; {51784#(or (forall ((|v_parse_input_c1_~x~0#1.base_55| Int) (v_ArrVal_179 Int) (v_ArrVal_178 Int)) (or (not (= (select |#valid| |v_parse_input_c1_~x~0#1.base_55|) 0)) (= (select (store (store |#valid| |v_parse_input_c1_~x~0#1.base_55| v_ArrVal_178) ~global~0.base v_ArrVal_179) (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|)) 1))) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) |old(~global~0.base)|))} is VALID [2022-02-20 23:38:33,989 INFO L290 TraceCheckUtils]: 30: Hoare triple {51784#(or (forall ((|v_parse_input_c1_~x~0#1.base_55| Int) (v_ArrVal_179 Int) (v_ArrVal_178 Int)) (or (not (= (select |#valid| |v_parse_input_c1_~x~0#1.base_55|) 0)) (= (select (store (store |#valid| |v_parse_input_c1_~x~0#1.base_55| v_ArrVal_178) ~global~0.base v_ArrVal_179) (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|)) 1))) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) |old(~global~0.base)|))} assume ~input#1.offset < #length[~input#1.base] && ~input#1.offset >= 0; {51784#(or (forall ((|v_parse_input_c1_~x~0#1.base_55| Int) (v_ArrVal_179 Int) (v_ArrVal_178 Int)) (or (not (= (select |#valid| |v_parse_input_c1_~x~0#1.base_55|) 0)) (= (select (store (store |#valid| |v_parse_input_c1_~x~0#1.base_55| v_ArrVal_178) ~global~0.base v_ArrVal_179) (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|)) 1))) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) |old(~global~0.base)|))} is VALID [2022-02-20 23:38:33,989 INFO L290 TraceCheckUtils]: 29: Hoare triple {51784#(or (forall ((|v_parse_input_c1_~x~0#1.base_55| Int) (v_ArrVal_179 Int) (v_ArrVal_178 Int)) (or (not (= (select |#valid| |v_parse_input_c1_~x~0#1.base_55|) 0)) (= (select (store (store |#valid| |v_parse_input_c1_~x~0#1.base_55| v_ArrVal_178) ~global~0.base v_ArrVal_179) (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|)) 1))) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) |old(~global~0.base)|))} assume 1 == #valid[~input#1.base]; {51784#(or (forall ((|v_parse_input_c1_~x~0#1.base_55| Int) (v_ArrVal_179 Int) (v_ArrVal_178 Int)) (or (not (= (select |#valid| |v_parse_input_c1_~x~0#1.base_55|) 0)) (= (select (store (store |#valid| |v_parse_input_c1_~x~0#1.base_55| v_ArrVal_178) ~global~0.base v_ArrVal_179) (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|)) 1))) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) |old(~global~0.base)|))} is VALID [2022-02-20 23:38:33,990 INFO L290 TraceCheckUtils]: 28: Hoare triple {51784#(or (forall ((|v_parse_input_c1_~x~0#1.base_55| Int) (v_ArrVal_179 Int) (v_ArrVal_178 Int)) (or (not (= (select |#valid| |v_parse_input_c1_~x~0#1.base_55|) 0)) (= (select (store (store |#valid| |v_parse_input_c1_~x~0#1.base_55| v_ArrVal_178) ~global~0.base v_ArrVal_179) (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|)) 1))) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) |old(~global~0.base)|))} assume #t~mem3#1.offset < #length[#t~mem3#1.base] && #t~mem3#1.offset >= 0; {51784#(or (forall ((|v_parse_input_c1_~x~0#1.base_55| Int) (v_ArrVal_179 Int) (v_ArrVal_178 Int)) (or (not (= (select |#valid| |v_parse_input_c1_~x~0#1.base_55|) 0)) (= (select (store (store |#valid| |v_parse_input_c1_~x~0#1.base_55| v_ArrVal_178) ~global~0.base v_ArrVal_179) (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|)) 1))) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) |old(~global~0.base)|))} is VALID [2022-02-20 23:38:33,990 INFO L290 TraceCheckUtils]: 27: Hoare triple {51812#(or (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) |old(~global~0.base)|) (and (= |parse_input_#t~mem3#1.base| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|)) (not (= ~global~0.base (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|)))))} assume 1 == #valid[#t~mem3#1.base]; {51784#(or (forall ((|v_parse_input_c1_~x~0#1.base_55| Int) (v_ArrVal_179 Int) (v_ArrVal_178 Int)) (or (not (= (select |#valid| |v_parse_input_c1_~x~0#1.base_55|) 0)) (= (select (store (store |#valid| |v_parse_input_c1_~x~0#1.base_55| v_ArrVal_178) ~global~0.base v_ArrVal_179) (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|)) 1))) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) |old(~global~0.base)|))} is VALID [2022-02-20 23:38:33,991 INFO L290 TraceCheckUtils]: 26: Hoare triple {51816#(or (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) |old(~global~0.base)|) (and (not (= ~global~0.base (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|))) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) (select (select |#memory_$Pointer$.base| |~#commands~0.base|) (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset|)))))} SUMMARY for call #t~mem3#1.base, #t~mem3#1.offset := read~$Pointer$(~#commands~0.base, ~#commands~0.offset + 9 * ~i~0#1, 4); srcloc: L693 {51812#(or (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) |old(~global~0.base)|) (and (= |parse_input_#t~mem3#1.base| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|)) (not (= ~global~0.base (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|)))))} is VALID [2022-02-20 23:38:33,992 INFO L290 TraceCheckUtils]: 25: Hoare triple {51816#(or (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) |old(~global~0.base)|) (and (not (= ~global~0.base (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|))) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) (select (select |#memory_$Pointer$.base| |~#commands~0.base|) (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset|)))))} assume !!(~i~0#1 < 2); {51816#(or (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) |old(~global~0.base)|) (and (not (= ~global~0.base (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|))) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) (select (select |#memory_$Pointer$.base| |~#commands~0.base|) (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset|)))))} is VALID [2022-02-20 23:38:33,992 INFO L290 TraceCheckUtils]: 24: Hoare triple {51823#(or (not (= ~global~0.base (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|))) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) |old(~global~0.base)|))} ~input#1.base, ~input#1.offset := #in~input#1.base, #in~input#1.offset;~i~0#1 := 0; {51816#(or (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) |old(~global~0.base)|) (and (not (= ~global~0.base (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|))) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) (select (select |#memory_$Pointer$.base| |~#commands~0.base|) (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset|)))))} is VALID [2022-02-20 23:38:33,993 INFO L272 TraceCheckUtils]: 23: Hoare triple {51748#(not (= ~global~0.base (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|)))} call parse_input(4, 0); {51823#(or (not (= ~global~0.base (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|))) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) |old(~global~0.base)|))} is VALID [2022-02-20 23:38:33,994 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {51831#(or (not (= ~global~0.base (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|))) (= (select |old(#valid)| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|)) 0))} {51827#(not (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|)) 0))} #101#return; {51748#(not (= ~global~0.base (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|)))} is VALID [2022-02-20 23:38:33,995 INFO L290 TraceCheckUtils]: 21: Hoare triple {51831#(or (not (= ~global~0.base (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|))) (= (select |old(#valid)| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|)) 0))} assume true; {51831#(or (not (= ~global~0.base (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|))) (= (select |old(#valid)| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|)) 0))} is VALID [2022-02-20 23:38:33,995 INFO L290 TraceCheckUtils]: 20: Hoare triple {51831#(or (not (= ~global~0.base (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|))) (= (select |old(#valid)| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|)) 0))} assume { :end_inline_##fun~~TO~VOID } true;havoc #t~mem6#1.base, #t~mem6#1.offset; {51831#(or (not (= ~global~0.base (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|))) (= (select |old(#valid)| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|)) 0))} is VALID [2022-02-20 23:38:33,995 INFO L290 TraceCheckUtils]: 19: Hoare triple {51831#(or (not (= ~global~0.base (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|))) (= (select |old(#valid)| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|)) 0))} assume { :end_inline_c1 } true; {51831#(or (not (= ~global~0.base (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|))) (= (select |old(#valid)| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|)) 0))} is VALID [2022-02-20 23:38:33,996 INFO L290 TraceCheckUtils]: 18: Hoare triple {51844#(or (not (= |parse_input_c1_~x~0#1.base| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|))) (= (select |old(#valid)| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|)) 0))} ~global~0.base, ~global~0.offset := c1_~x~0#1.base, c1_~x~0#1.offset;~state~0 := ~unnamed3~0~STATE_2; {51831#(or (not (= ~global~0.base (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|))) (= (select |old(#valid)| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|)) 0))} is VALID [2022-02-20 23:38:33,996 INFO L290 TraceCheckUtils]: 17: Hoare triple {51844#(or (not (= |parse_input_c1_~x~0#1.base| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|))) (= (select |old(#valid)| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|)) 0))} assume !(~global~0.base != 0 || ~global~0.offset != 0); {51844#(or (not (= |parse_input_c1_~x~0#1.base| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|))) (= (select |old(#valid)| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|)) 0))} is VALID [2022-02-20 23:38:33,997 INFO L290 TraceCheckUtils]: 16: Hoare triple {51844#(or (not (= |parse_input_c1_~x~0#1.base| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|))) (= (select |old(#valid)| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|)) 0))} assume !(c1_~x~0#1.base == 0 && c1_~x~0#1.offset == 0); {51844#(or (not (= |parse_input_c1_~x~0#1.base| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|))) (= (select |old(#valid)| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|)) 0))} is VALID [2022-02-20 23:38:33,997 INFO L290 TraceCheckUtils]: 15: Hoare triple {51854#(or (not (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|)) 0)) (= (select |old(#valid)| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|)) 0))} assume !(##fun~~TO~VOID_#in~#fp#1.base == #funAddr~c2.base && ##fun~~TO~VOID_#in~#fp#1.offset == #funAddr~c2.offset);assume { :begin_inline_c1 } true;havoc c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset, c1_~x~0#1.base, c1_~x~0#1.offset;call c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset := #Ultimate.allocOnHeap(1);c1_~x~0#1.base, c1_~x~0#1.offset := c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset;havoc c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset; {51844#(or (not (= |parse_input_c1_~x~0#1.base| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|))) (= (select |old(#valid)| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|)) 0))} is VALID [2022-02-20 23:38:33,998 INFO L290 TraceCheckUtils]: 14: Hoare triple {51854#(or (not (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|)) 0)) (= (select |old(#valid)| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|)) 0))} assume { :begin_inline_##fun~~TO~VOID } true;##fun~~TO~VOID_#in~#fp#1.base, ##fun~~TO~VOID_#in~#fp#1.offset := #t~mem6#1.base, #t~mem6#1.offset; {51854#(or (not (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|)) 0)) (= (select |old(#valid)| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|)) 0))} is VALID [2022-02-20 23:38:33,998 INFO L290 TraceCheckUtils]: 13: Hoare triple {51854#(or (not (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|)) 0)) (= (select |old(#valid)| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|)) 0))} SUMMARY for call #t~mem6#1.base, #t~mem6#1.offset := read~$Pointer$(~#commands~0.base, 4 + (~#commands~0.offset + 9 * ~i~0#1), 4); srcloc: L695 {51854#(or (not (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|)) 0)) (= (select |old(#valid)| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|)) 0))} is VALID [2022-02-20 23:38:33,999 INFO L290 TraceCheckUtils]: 12: Hoare triple {51854#(or (not (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|)) 0)) (= (select |old(#valid)| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|)) 0))} assume ~state~0 >= #t~mem5#1;havoc #t~mem5#1; {51854#(or (not (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|)) 0)) (= (select |old(#valid)| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|)) 0))} is VALID [2022-02-20 23:38:33,999 INFO L290 TraceCheckUtils]: 11: Hoare triple {51854#(or (not (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|)) 0)) (= (select |old(#valid)| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|)) 0))} SUMMARY for call #t~mem5#1 := read~int(~#commands~0.base, 8 + (~#commands~0.offset + 9 * ~i~0#1), 1); srcloc: L694 {51854#(or (not (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|)) 0)) (= (select |old(#valid)| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|)) 0))} is VALID [2022-02-20 23:38:34,000 INFO L290 TraceCheckUtils]: 10: Hoare triple {51854#(or (not (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|)) 0)) (= (select |old(#valid)| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|)) 0))} assume 0 == #t~nondet4#1;havoc #t~mem3#1.base, #t~mem3#1.offset;havoc #t~nondet4#1; {51854#(or (not (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|)) 0)) (= (select |old(#valid)| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|)) 0))} is VALID [2022-02-20 23:38:34,000 INFO L290 TraceCheckUtils]: 9: Hoare triple {51854#(or (not (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|)) 0)) (= (select |old(#valid)| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|)) 0))} assume ~input#1.offset < #length[~input#1.base] && ~input#1.offset >= 0; {51854#(or (not (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|)) 0)) (= (select |old(#valid)| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|)) 0))} is VALID [2022-02-20 23:38:34,001 INFO L290 TraceCheckUtils]: 8: Hoare triple {51854#(or (not (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|)) 0)) (= (select |old(#valid)| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|)) 0))} assume 1 == #valid[~input#1.base]; {51854#(or (not (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|)) 0)) (= (select |old(#valid)| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|)) 0))} is VALID [2022-02-20 23:38:34,001 INFO L290 TraceCheckUtils]: 7: Hoare triple {51854#(or (not (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|)) 0)) (= (select |old(#valid)| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|)) 0))} assume #t~mem3#1.offset < #length[#t~mem3#1.base] && #t~mem3#1.offset >= 0; {51854#(or (not (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|)) 0)) (= (select |old(#valid)| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|)) 0))} is VALID [2022-02-20 23:38:34,002 INFO L290 TraceCheckUtils]: 6: Hoare triple {51854#(or (not (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|)) 0)) (= (select |old(#valid)| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|)) 0))} assume 1 == #valid[#t~mem3#1.base]; {51854#(or (not (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|)) 0)) (= (select |old(#valid)| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|)) 0))} is VALID [2022-02-20 23:38:34,002 INFO L290 TraceCheckUtils]: 5: Hoare triple {51854#(or (not (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|)) 0)) (= (select |old(#valid)| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|)) 0))} SUMMARY for call #t~mem3#1.base, #t~mem3#1.offset := read~$Pointer$(~#commands~0.base, ~#commands~0.offset + 9 * ~i~0#1, 4); srcloc: L693 {51854#(or (not (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|)) 0)) (= (select |old(#valid)| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|)) 0))} is VALID [2022-02-20 23:38:34,003 INFO L290 TraceCheckUtils]: 4: Hoare triple {51854#(or (not (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|)) 0)) (= (select |old(#valid)| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|)) 0))} assume !!(~i~0#1 < 2); {51854#(or (not (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|)) 0)) (= (select |old(#valid)| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|)) 0))} is VALID [2022-02-20 23:38:34,003 INFO L290 TraceCheckUtils]: 3: Hoare triple {51854#(or (not (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|)) 0)) (= (select |old(#valid)| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|)) 0))} ~input#1.base, ~input#1.offset := #in~input#1.base, #in~input#1.offset;~i~0#1 := 0; {51854#(or (not (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|)) 0)) (= (select |old(#valid)| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|)) 0))} is VALID [2022-02-20 23:38:34,004 INFO L272 TraceCheckUtils]: 2: Hoare triple {51827#(not (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|)) 0))} call parse_input(3, 0); {51854#(or (not (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|)) 0)) (= (select |old(#valid)| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|)) 0))} is VALID [2022-02-20 23:38:34,004 INFO L290 TraceCheckUtils]: 1: Hoare triple {51827#(not (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|)) 0))} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1; {51827#(not (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|)) 0))} is VALID [2022-02-20 23:38:34,005 INFO L290 TraceCheckUtils]: 0: Hoare triple {51499#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(3, 1);call write~init~int(99, 1, 0, 1);call write~init~int(49, 1, 1, 1);call write~init~int(0, 1, 2, 1);call #Ultimate.allocInit(3, 2);call write~init~int(99, 2, 0, 1);call write~init~int(50, 2, 1, 1);call write~init~int(0, 2, 2, 1);call #Ultimate.allocInit(3, 3);call write~init~int(99, 3, 0, 1);call write~init~int(49, 3, 1, 1);call write~init~int(0, 3, 2, 1);call #Ultimate.allocInit(3, 4);call write~init~int(99, 4, 0, 1);call write~init~int(49, 4, 1, 1);call write~init~int(0, 4, 2, 1);call #Ultimate.allocInit(3, 5);call write~init~int(99, 5, 0, 1);call write~init~int(50, 5, 1, 1);call write~init~int(0, 5, 2, 1);~state~0 := ~unnamed3~0~STATE_1;~global~0.base, ~global~0.offset := 0, 0;~#commands~0.base, ~#commands~0.offset := 6, 0;call #Ultimate.allocInit(18, 6);call write~init~$Pointer$(1, 0, ~#commands~0.base, ~#commands~0.offset, 4);call write~init~$Pointer$(#funAddr~c1.base, #funAddr~c1.offset, ~#commands~0.base, 4 + ~#commands~0.offset, 4);call write~init~int((if ~unnamed3~0~STATE_1 % 256 <= 127 then ~unnamed3~0~STATE_1 % 256 else ~unnamed3~0~STATE_1 % 256 - 256), ~#commands~0.base, 8 + ~#commands~0.offset, 1);call write~init~$Pointer$(2, 0, ~#commands~0.base, 9 + ~#commands~0.offset, 4);call write~init~$Pointer$(#funAddr~c2.base, #funAddr~c2.offset, ~#commands~0.base, 13 + ~#commands~0.offset, 4);call write~init~int((if ~unnamed3~0~STATE_2 % 256 <= 127 then ~unnamed3~0~STATE_2 % 256 else ~unnamed3~0~STATE_2 % 256 - 256), ~#commands~0.base, 17 + ~#commands~0.offset, 1); {51827#(not (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|)) 0))} is VALID [2022-02-20 23:38:34,006 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 1 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:38:34,006 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [922347996] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 23:38:34,006 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 23:38:34,006 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 12, 14] total 44 [2022-02-20 23:38:34,006 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630057767] [2022-02-20 23:38:34,007 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 23:38:34,007 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 42 states have (on average 3.3333333333333335) internal successors, (140), 37 states have internal predecessors, (140), 8 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 52 [2022-02-20 23:38:34,007 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:38:34,007 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 46 states, 42 states have (on average 3.3333333333333335) internal successors, (140), 37 states have internal predecessors, (140), 8 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 23:38:34,117 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 155 edges. 155 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:38:34,117 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-02-20 23:38:34,117 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:38:34,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-02-20 23:38:34,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=218, Invalid=1852, Unknown=0, NotChecked=0, Total=2070 [2022-02-20 23:38:34,118 INFO L87 Difference]: Start difference. First operand 364 states and 425 transitions. Second operand has 46 states, 42 states have (on average 3.3333333333333335) internal successors, (140), 37 states have internal predecessors, (140), 8 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 23:38:36,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:38:36,399 INFO L93 Difference]: Finished difference Result 451 states and 511 transitions. [2022-02-20 23:38:36,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-02-20 23:38:36,399 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 42 states have (on average 3.3333333333333335) internal successors, (140), 37 states have internal predecessors, (140), 8 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 52 [2022-02-20 23:38:36,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:38:36,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 42 states have (on average 3.3333333333333335) internal successors, (140), 37 states have internal predecessors, (140), 8 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 23:38:36,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 109 transitions. [2022-02-20 23:38:36,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 42 states have (on average 3.3333333333333335) internal successors, (140), 37 states have internal predecessors, (140), 8 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 23:38:36,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 109 transitions. [2022-02-20 23:38:36,401 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 109 transitions. [2022-02-20 23:38:36,489 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 109 edges. 109 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:38:36,496 INFO L225 Difference]: With dead ends: 451 [2022-02-20 23:38:36,496 INFO L226 Difference]: Without dead ends: 451 [2022-02-20 23:38:36,496 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 82 SyntacticMatches, 4 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1082 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=579, Invalid=2843, Unknown=0, NotChecked=0, Total=3422 [2022-02-20 23:38:36,497 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 564 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 770 mSolverCounterSat, 182 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 564 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 1004 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 182 IncrementalHoareTripleChecker+Valid, 770 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 52 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-02-20 23:38:36,497 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [564 Valid, 284 Invalid, 1004 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [182 Valid, 770 Invalid, 0 Unknown, 52 Unchecked, 0.8s Time] [2022-02-20 23:38:36,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2022-02-20 23:38:36,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 364. [2022-02-20 23:38:36,501 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:38:36,501 INFO L82 GeneralOperation]: Start isEquivalent. First operand 451 states. Second operand has 364 states, 334 states have (on average 1.2035928143712575) internal successors, (402), 347 states have internal predecessors, (402), 8 states have call successors, (8), 8 states have call predecessors, (8), 12 states have return successors, (14), 8 states have call predecessors, (14), 8 states have call successors, (14) [2022-02-20 23:38:36,501 INFO L74 IsIncluded]: Start isIncluded. First operand 451 states. Second operand has 364 states, 334 states have (on average 1.2035928143712575) internal successors, (402), 347 states have internal predecessors, (402), 8 states have call successors, (8), 8 states have call predecessors, (8), 12 states have return successors, (14), 8 states have call predecessors, (14), 8 states have call successors, (14) [2022-02-20 23:38:36,502 INFO L87 Difference]: Start difference. First operand 451 states. Second operand has 364 states, 334 states have (on average 1.2035928143712575) internal successors, (402), 347 states have internal predecessors, (402), 8 states have call successors, (8), 8 states have call predecessors, (8), 12 states have return successors, (14), 8 states have call predecessors, (14), 8 states have call successors, (14) [2022-02-20 23:38:36,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:38:36,510 INFO L93 Difference]: Finished difference Result 451 states and 511 transitions. [2022-02-20 23:38:36,510 INFO L276 IsEmpty]: Start isEmpty. Operand 451 states and 511 transitions. [2022-02-20 23:38:36,510 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:38:36,510 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:38:36,511 INFO L74 IsIncluded]: Start isIncluded. First operand has 364 states, 334 states have (on average 1.2035928143712575) internal successors, (402), 347 states have internal predecessors, (402), 8 states have call successors, (8), 8 states have call predecessors, (8), 12 states have return successors, (14), 8 states have call predecessors, (14), 8 states have call successors, (14) Second operand 451 states. [2022-02-20 23:38:36,511 INFO L87 Difference]: Start difference. First operand has 364 states, 334 states have (on average 1.2035928143712575) internal successors, (402), 347 states have internal predecessors, (402), 8 states have call successors, (8), 8 states have call predecessors, (8), 12 states have return successors, (14), 8 states have call predecessors, (14), 8 states have call successors, (14) Second operand 451 states. [2022-02-20 23:38:36,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:38:36,518 INFO L93 Difference]: Finished difference Result 451 states and 511 transitions. [2022-02-20 23:38:36,518 INFO L276 IsEmpty]: Start isEmpty. Operand 451 states and 511 transitions. [2022-02-20 23:38:36,518 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:38:36,518 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:38:36,518 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:38:36,518 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:38:36,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 364 states, 334 states have (on average 1.2035928143712575) internal successors, (402), 347 states have internal predecessors, (402), 8 states have call successors, (8), 8 states have call predecessors, (8), 12 states have return successors, (14), 8 states have call predecessors, (14), 8 states have call successors, (14) [2022-02-20 23:38:36,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 424 transitions. [2022-02-20 23:38:36,523 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 424 transitions. Word has length 52 [2022-02-20 23:38:36,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:38:36,523 INFO L470 AbstractCegarLoop]: Abstraction has 364 states and 424 transitions. [2022-02-20 23:38:36,524 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 42 states have (on average 3.3333333333333335) internal successors, (140), 37 states have internal predecessors, (140), 8 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 23:38:36,524 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 424 transitions. [2022-02-20 23:38:36,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-02-20 23:38:36,524 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:38:36,524 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:38:36,541 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Ended with exit code 0 [2022-02-20 23:38:36,735 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:38:36,735 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting parse_inputErr15ASSERT_VIOLATIONMEMORY_FREE === [parse_inputErr0REQUIRES_VIOLATION, parse_inputErr1REQUIRES_VIOLATION, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2022-02-20 23:38:36,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:38:36,736 INFO L85 PathProgramCache]: Analyzing trace with hash 21635793, now seen corresponding path program 1 times [2022-02-20 23:38:36,736 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:38:36,736 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970814617] [2022-02-20 23:38:36,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:38:36,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:38:36,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:38:36,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 23:38:36,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:38:36,784 INFO L290 TraceCheckUtils]: 0: Hoare triple {53668#(and (= ~global~0.base |old(~global~0.base)|) (= |old(#length)| |#length|) (= |old(~global~0.offset)| ~global~0.offset) (= ~state~0 |old(~state~0)|) (= |old(#valid)| |#valid|))} ~input#1.base, ~input#1.offset := #in~input#1.base, #in~input#1.offset;~i~0#1 := 0; {53645#true} is VALID [2022-02-20 23:38:36,784 INFO L290 TraceCheckUtils]: 1: Hoare triple {53645#true} assume !!(~i~0#1 < 2); {53645#true} is VALID [2022-02-20 23:38:36,784 INFO L290 TraceCheckUtils]: 2: Hoare triple {53645#true} SUMMARY for call #t~mem3#1.base, #t~mem3#1.offset := read~$Pointer$(~#commands~0.base, ~#commands~0.offset + 9 * ~i~0#1, 4); srcloc: L693 {53645#true} is VALID [2022-02-20 23:38:36,785 INFO L290 TraceCheckUtils]: 3: Hoare triple {53645#true} assume 1 == #valid[#t~mem3#1.base]; {53645#true} is VALID [2022-02-20 23:38:36,785 INFO L290 TraceCheckUtils]: 4: Hoare triple {53645#true} assume #t~mem3#1.offset < #length[#t~mem3#1.base] && #t~mem3#1.offset >= 0; {53645#true} is VALID [2022-02-20 23:38:36,785 INFO L290 TraceCheckUtils]: 5: Hoare triple {53645#true} assume 1 == #valid[~input#1.base]; {53645#true} is VALID [2022-02-20 23:38:36,785 INFO L290 TraceCheckUtils]: 6: Hoare triple {53645#true} assume ~input#1.offset < #length[~input#1.base] && ~input#1.offset >= 0; {53645#true} is VALID [2022-02-20 23:38:36,785 INFO L290 TraceCheckUtils]: 7: Hoare triple {53645#true} assume 0 == #t~nondet4#1;havoc #t~mem3#1.base, #t~mem3#1.offset;havoc #t~nondet4#1; {53645#true} is VALID [2022-02-20 23:38:36,785 INFO L290 TraceCheckUtils]: 8: Hoare triple {53645#true} SUMMARY for call #t~mem5#1 := read~int(~#commands~0.base, 8 + (~#commands~0.offset + 9 * ~i~0#1), 1); srcloc: L694 {53645#true} is VALID [2022-02-20 23:38:36,785 INFO L290 TraceCheckUtils]: 9: Hoare triple {53645#true} assume ~state~0 >= #t~mem5#1;havoc #t~mem5#1; {53645#true} is VALID [2022-02-20 23:38:36,785 INFO L290 TraceCheckUtils]: 10: Hoare triple {53645#true} SUMMARY for call #t~mem6#1.base, #t~mem6#1.offset := read~$Pointer$(~#commands~0.base, 4 + (~#commands~0.offset + 9 * ~i~0#1), 4); srcloc: L695 {53645#true} is VALID [2022-02-20 23:38:36,786 INFO L290 TraceCheckUtils]: 11: Hoare triple {53645#true} assume { :begin_inline_##fun~~TO~VOID } true;##fun~~TO~VOID_#in~#fp#1.base, ##fun~~TO~VOID_#in~#fp#1.offset := #t~mem6#1.base, #t~mem6#1.offset; {53645#true} is VALID [2022-02-20 23:38:36,786 INFO L290 TraceCheckUtils]: 12: Hoare triple {53645#true} assume !(##fun~~TO~VOID_#in~#fp#1.base == #funAddr~c2.base && ##fun~~TO~VOID_#in~#fp#1.offset == #funAddr~c2.offset);assume { :begin_inline_c1 } true;havoc c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset, c1_~x~0#1.base, c1_~x~0#1.offset;call c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset := #Ultimate.allocOnHeap(1);c1_~x~0#1.base, c1_~x~0#1.offset := c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset;havoc c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset; {53645#true} is VALID [2022-02-20 23:38:36,786 INFO L290 TraceCheckUtils]: 13: Hoare triple {53645#true} assume !(c1_~x~0#1.base == 0 && c1_~x~0#1.offset == 0); {53645#true} is VALID [2022-02-20 23:38:36,786 INFO L290 TraceCheckUtils]: 14: Hoare triple {53645#true} assume !(~global~0.base != 0 || ~global~0.offset != 0); {53645#true} is VALID [2022-02-20 23:38:36,786 INFO L290 TraceCheckUtils]: 15: Hoare triple {53645#true} ~global~0.base, ~global~0.offset := c1_~x~0#1.base, c1_~x~0#1.offset;~state~0 := ~unnamed3~0~STATE_2; {53645#true} is VALID [2022-02-20 23:38:36,786 INFO L290 TraceCheckUtils]: 16: Hoare triple {53645#true} assume { :end_inline_c1 } true; {53645#true} is VALID [2022-02-20 23:38:36,786 INFO L290 TraceCheckUtils]: 17: Hoare triple {53645#true} assume { :end_inline_##fun~~TO~VOID } true;havoc #t~mem6#1.base, #t~mem6#1.offset; {53645#true} is VALID [2022-02-20 23:38:36,786 INFO L290 TraceCheckUtils]: 18: Hoare triple {53645#true} assume true; {53645#true} is VALID [2022-02-20 23:38:36,786 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {53645#true} {53645#true} #101#return; {53645#true} is VALID [2022-02-20 23:38:36,787 INFO L290 TraceCheckUtils]: 0: Hoare triple {53645#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(3, 1);call write~init~int(99, 1, 0, 1);call write~init~int(49, 1, 1, 1);call write~init~int(0, 1, 2, 1);call #Ultimate.allocInit(3, 2);call write~init~int(99, 2, 0, 1);call write~init~int(50, 2, 1, 1);call write~init~int(0, 2, 2, 1);call #Ultimate.allocInit(3, 3);call write~init~int(99, 3, 0, 1);call write~init~int(49, 3, 1, 1);call write~init~int(0, 3, 2, 1);call #Ultimate.allocInit(3, 4);call write~init~int(99, 4, 0, 1);call write~init~int(49, 4, 1, 1);call write~init~int(0, 4, 2, 1);call #Ultimate.allocInit(3, 5);call write~init~int(99, 5, 0, 1);call write~init~int(50, 5, 1, 1);call write~init~int(0, 5, 2, 1);~state~0 := ~unnamed3~0~STATE_1;~global~0.base, ~global~0.offset := 0, 0;~#commands~0.base, ~#commands~0.offset := 6, 0;call #Ultimate.allocInit(18, 6);call write~init~$Pointer$(1, 0, ~#commands~0.base, ~#commands~0.offset, 4);call write~init~$Pointer$(#funAddr~c1.base, #funAddr~c1.offset, ~#commands~0.base, 4 + ~#commands~0.offset, 4);call write~init~int((if ~unnamed3~0~STATE_1 % 256 <= 127 then ~unnamed3~0~STATE_1 % 256 else ~unnamed3~0~STATE_1 % 256 - 256), ~#commands~0.base, 8 + ~#commands~0.offset, 1);call write~init~$Pointer$(2, 0, ~#commands~0.base, 9 + ~#commands~0.offset, 4);call write~init~$Pointer$(#funAddr~c2.base, #funAddr~c2.offset, ~#commands~0.base, 13 + ~#commands~0.offset, 4);call write~init~int((if ~unnamed3~0~STATE_2 % 256 <= 127 then ~unnamed3~0~STATE_2 % 256 else ~unnamed3~0~STATE_2 % 256 - 256), ~#commands~0.base, 17 + ~#commands~0.offset, 1); {53645#true} is VALID [2022-02-20 23:38:36,787 INFO L290 TraceCheckUtils]: 1: Hoare triple {53645#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1; {53645#true} is VALID [2022-02-20 23:38:36,787 INFO L272 TraceCheckUtils]: 2: Hoare triple {53645#true} call parse_input(3, 0); {53668#(and (= ~global~0.base |old(~global~0.base)|) (= |old(#length)| |#length|) (= |old(~global~0.offset)| ~global~0.offset) (= ~state~0 |old(~state~0)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 23:38:36,787 INFO L290 TraceCheckUtils]: 3: Hoare triple {53668#(and (= ~global~0.base |old(~global~0.base)|) (= |old(#length)| |#length|) (= |old(~global~0.offset)| ~global~0.offset) (= ~state~0 |old(~state~0)|) (= |old(#valid)| |#valid|))} ~input#1.base, ~input#1.offset := #in~input#1.base, #in~input#1.offset;~i~0#1 := 0; {53645#true} is VALID [2022-02-20 23:38:36,788 INFO L290 TraceCheckUtils]: 4: Hoare triple {53645#true} assume !!(~i~0#1 < 2); {53645#true} is VALID [2022-02-20 23:38:36,788 INFO L290 TraceCheckUtils]: 5: Hoare triple {53645#true} SUMMARY for call #t~mem3#1.base, #t~mem3#1.offset := read~$Pointer$(~#commands~0.base, ~#commands~0.offset + 9 * ~i~0#1, 4); srcloc: L693 {53645#true} is VALID [2022-02-20 23:38:36,788 INFO L290 TraceCheckUtils]: 6: Hoare triple {53645#true} assume 1 == #valid[#t~mem3#1.base]; {53645#true} is VALID [2022-02-20 23:38:36,788 INFO L290 TraceCheckUtils]: 7: Hoare triple {53645#true} assume #t~mem3#1.offset < #length[#t~mem3#1.base] && #t~mem3#1.offset >= 0; {53645#true} is VALID [2022-02-20 23:38:36,788 INFO L290 TraceCheckUtils]: 8: Hoare triple {53645#true} assume 1 == #valid[~input#1.base]; {53645#true} is VALID [2022-02-20 23:38:36,788 INFO L290 TraceCheckUtils]: 9: Hoare triple {53645#true} assume ~input#1.offset < #length[~input#1.base] && ~input#1.offset >= 0; {53645#true} is VALID [2022-02-20 23:38:36,788 INFO L290 TraceCheckUtils]: 10: Hoare triple {53645#true} assume 0 == #t~nondet4#1;havoc #t~mem3#1.base, #t~mem3#1.offset;havoc #t~nondet4#1; {53645#true} is VALID [2022-02-20 23:38:36,788 INFO L290 TraceCheckUtils]: 11: Hoare triple {53645#true} SUMMARY for call #t~mem5#1 := read~int(~#commands~0.base, 8 + (~#commands~0.offset + 9 * ~i~0#1), 1); srcloc: L694 {53645#true} is VALID [2022-02-20 23:38:36,788 INFO L290 TraceCheckUtils]: 12: Hoare triple {53645#true} assume ~state~0 >= #t~mem5#1;havoc #t~mem5#1; {53645#true} is VALID [2022-02-20 23:38:36,789 INFO L290 TraceCheckUtils]: 13: Hoare triple {53645#true} SUMMARY for call #t~mem6#1.base, #t~mem6#1.offset := read~$Pointer$(~#commands~0.base, 4 + (~#commands~0.offset + 9 * ~i~0#1), 4); srcloc: L695 {53645#true} is VALID [2022-02-20 23:38:36,789 INFO L290 TraceCheckUtils]: 14: Hoare triple {53645#true} assume { :begin_inline_##fun~~TO~VOID } true;##fun~~TO~VOID_#in~#fp#1.base, ##fun~~TO~VOID_#in~#fp#1.offset := #t~mem6#1.base, #t~mem6#1.offset; {53645#true} is VALID [2022-02-20 23:38:36,789 INFO L290 TraceCheckUtils]: 15: Hoare triple {53645#true} assume !(##fun~~TO~VOID_#in~#fp#1.base == #funAddr~c2.base && ##fun~~TO~VOID_#in~#fp#1.offset == #funAddr~c2.offset);assume { :begin_inline_c1 } true;havoc c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset, c1_~x~0#1.base, c1_~x~0#1.offset;call c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset := #Ultimate.allocOnHeap(1);c1_~x~0#1.base, c1_~x~0#1.offset := c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset;havoc c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset; {53645#true} is VALID [2022-02-20 23:38:36,789 INFO L290 TraceCheckUtils]: 16: Hoare triple {53645#true} assume !(c1_~x~0#1.base == 0 && c1_~x~0#1.offset == 0); {53645#true} is VALID [2022-02-20 23:38:36,789 INFO L290 TraceCheckUtils]: 17: Hoare triple {53645#true} assume !(~global~0.base != 0 || ~global~0.offset != 0); {53645#true} is VALID [2022-02-20 23:38:36,789 INFO L290 TraceCheckUtils]: 18: Hoare triple {53645#true} ~global~0.base, ~global~0.offset := c1_~x~0#1.base, c1_~x~0#1.offset;~state~0 := ~unnamed3~0~STATE_2; {53645#true} is VALID [2022-02-20 23:38:36,789 INFO L290 TraceCheckUtils]: 19: Hoare triple {53645#true} assume { :end_inline_c1 } true; {53645#true} is VALID [2022-02-20 23:38:36,789 INFO L290 TraceCheckUtils]: 20: Hoare triple {53645#true} assume { :end_inline_##fun~~TO~VOID } true;havoc #t~mem6#1.base, #t~mem6#1.offset; {53645#true} is VALID [2022-02-20 23:38:36,790 INFO L290 TraceCheckUtils]: 21: Hoare triple {53645#true} assume true; {53645#true} is VALID [2022-02-20 23:38:36,790 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {53645#true} {53645#true} #101#return; {53645#true} is VALID [2022-02-20 23:38:36,790 INFO L272 TraceCheckUtils]: 23: Hoare triple {53645#true} call parse_input(4, 0); {53645#true} is VALID [2022-02-20 23:38:36,790 INFO L290 TraceCheckUtils]: 24: Hoare triple {53645#true} ~input#1.base, ~input#1.offset := #in~input#1.base, #in~input#1.offset;~i~0#1 := 0; {53645#true} is VALID [2022-02-20 23:38:36,790 INFO L290 TraceCheckUtils]: 25: Hoare triple {53645#true} assume !!(~i~0#1 < 2); {53645#true} is VALID [2022-02-20 23:38:36,790 INFO L290 TraceCheckUtils]: 26: Hoare triple {53645#true} SUMMARY for call #t~mem3#1.base, #t~mem3#1.offset := read~$Pointer$(~#commands~0.base, ~#commands~0.offset + 9 * ~i~0#1, 4); srcloc: L693 {53645#true} is VALID [2022-02-20 23:38:36,790 INFO L290 TraceCheckUtils]: 27: Hoare triple {53645#true} assume 1 == #valid[#t~mem3#1.base]; {53645#true} is VALID [2022-02-20 23:38:36,790 INFO L290 TraceCheckUtils]: 28: Hoare triple {53645#true} assume #t~mem3#1.offset < #length[#t~mem3#1.base] && #t~mem3#1.offset >= 0; {53645#true} is VALID [2022-02-20 23:38:36,790 INFO L290 TraceCheckUtils]: 29: Hoare triple {53645#true} assume 1 == #valid[~input#1.base]; {53645#true} is VALID [2022-02-20 23:38:36,791 INFO L290 TraceCheckUtils]: 30: Hoare triple {53645#true} assume ~input#1.offset < #length[~input#1.base] && ~input#1.offset >= 0; {53645#true} is VALID [2022-02-20 23:38:36,791 INFO L290 TraceCheckUtils]: 31: Hoare triple {53645#true} assume !(0 == #t~nondet4#1);havoc #t~mem3#1.base, #t~mem3#1.offset;havoc #t~nondet4#1; {53645#true} is VALID [2022-02-20 23:38:36,791 INFO L290 TraceCheckUtils]: 32: Hoare triple {53645#true} #t~post2#1 := ~i~0#1;~i~0#1 := 1 + #t~post2#1;havoc #t~post2#1; {53645#true} is VALID [2022-02-20 23:38:36,791 INFO L290 TraceCheckUtils]: 33: Hoare triple {53645#true} assume !!(~i~0#1 < 2); {53645#true} is VALID [2022-02-20 23:38:36,791 INFO L290 TraceCheckUtils]: 34: Hoare triple {53645#true} SUMMARY for call #t~mem3#1.base, #t~mem3#1.offset := read~$Pointer$(~#commands~0.base, ~#commands~0.offset + 9 * ~i~0#1, 4); srcloc: L693 {53645#true} is VALID [2022-02-20 23:38:36,791 INFO L290 TraceCheckUtils]: 35: Hoare triple {53645#true} assume 1 == #valid[#t~mem3#1.base]; {53645#true} is VALID [2022-02-20 23:38:36,791 INFO L290 TraceCheckUtils]: 36: Hoare triple {53645#true} assume #t~mem3#1.offset < #length[#t~mem3#1.base] && #t~mem3#1.offset >= 0; {53645#true} is VALID [2022-02-20 23:38:36,791 INFO L290 TraceCheckUtils]: 37: Hoare triple {53645#true} assume 1 == #valid[~input#1.base]; {53645#true} is VALID [2022-02-20 23:38:36,791 INFO L290 TraceCheckUtils]: 38: Hoare triple {53645#true} assume ~input#1.offset < #length[~input#1.base] && ~input#1.offset >= 0; {53645#true} is VALID [2022-02-20 23:38:36,792 INFO L290 TraceCheckUtils]: 39: Hoare triple {53645#true} assume 0 == #t~nondet4#1;havoc #t~mem3#1.base, #t~mem3#1.offset;havoc #t~nondet4#1; {53645#true} is VALID [2022-02-20 23:38:36,792 INFO L290 TraceCheckUtils]: 40: Hoare triple {53645#true} SUMMARY for call #t~mem5#1 := read~int(~#commands~0.base, 8 + (~#commands~0.offset + 9 * ~i~0#1), 1); srcloc: L694 {53645#true} is VALID [2022-02-20 23:38:36,792 INFO L290 TraceCheckUtils]: 41: Hoare triple {53645#true} assume ~state~0 >= #t~mem5#1;havoc #t~mem5#1; {53645#true} is VALID [2022-02-20 23:38:36,792 INFO L290 TraceCheckUtils]: 42: Hoare triple {53645#true} SUMMARY for call #t~mem6#1.base, #t~mem6#1.offset := read~$Pointer$(~#commands~0.base, 4 + (~#commands~0.offset + 9 * ~i~0#1), 4); srcloc: L695 {53645#true} is VALID [2022-02-20 23:38:36,792 INFO L290 TraceCheckUtils]: 43: Hoare triple {53645#true} assume { :begin_inline_##fun~~TO~VOID } true;##fun~~TO~VOID_#in~#fp#1.base, ##fun~~TO~VOID_#in~#fp#1.offset := #t~mem6#1.base, #t~mem6#1.offset; {53645#true} is VALID [2022-02-20 23:38:36,792 INFO L290 TraceCheckUtils]: 44: Hoare triple {53645#true} assume ##fun~~TO~VOID_#in~#fp#1.base == #funAddr~c2.base && ##fun~~TO~VOID_#in~#fp#1.offset == #funAddr~c2.offset;assume { :begin_inline_c2 } true;havoc c2_~y~0#1.base, c2_~y~0#1.offset;c2_~y~0#1.base, c2_~y~0#1.offset := 0, 0; {53667#(and (= |parse_input_c2_~y~0#1.base| 0) (= |parse_input_c2_~y~0#1.offset| 0))} is VALID [2022-02-20 23:38:36,793 INFO L290 TraceCheckUtils]: 45: Hoare triple {53667#(and (= |parse_input_c2_~y~0#1.base| 0) (= |parse_input_c2_~y~0#1.offset| 0))} assume !((c2_~y~0#1.base == 0 && c2_~y~0#1.offset == 0) || (~global~0.base == 0 && ~global~0.offset == 0)); {53646#false} is VALID [2022-02-20 23:38:36,793 INFO L290 TraceCheckUtils]: 46: Hoare triple {53646#false} assume 0 == c2_~y~0#1.offset; {53646#false} is VALID [2022-02-20 23:38:36,793 INFO L290 TraceCheckUtils]: 47: Hoare triple {53646#false} assume c2_~y~0#1.base < #StackHeapBarrier; {53646#false} is VALID [2022-02-20 23:38:36,793 INFO L290 TraceCheckUtils]: 48: Hoare triple {53646#false} assume 0 == c2_~y~0#1.base || 1 == #valid[c2_~y~0#1.base];call ULTIMATE.dealloc(c2_~y~0#1.base, c2_~y~0#1.offset); {53646#false} is VALID [2022-02-20 23:38:36,793 INFO L290 TraceCheckUtils]: 49: Hoare triple {53646#false} assume 0 == ~global~0.offset; {53646#false} is VALID [2022-02-20 23:38:36,793 INFO L290 TraceCheckUtils]: 50: Hoare triple {53646#false} assume ~global~0.base < #StackHeapBarrier; {53646#false} is VALID [2022-02-20 23:38:36,794 INFO L290 TraceCheckUtils]: 51: Hoare triple {53646#false} assume !(0 == ~global~0.base || 1 == #valid[~global~0.base]); {53646#false} is VALID [2022-02-20 23:38:36,794 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-02-20 23:38:36,794 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:38:36,794 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970814617] [2022-02-20 23:38:36,794 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1970814617] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 23:38:36,794 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1320565959] [2022-02-20 23:38:36,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:38:36,795 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:38:36,795 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:38:36,796 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 23:38:36,797 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2022-02-20 23:38:36,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:38:36,868 INFO L263 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-20 23:38:36,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:38:36,877 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:38:36,943 INFO L290 TraceCheckUtils]: 0: Hoare triple {53645#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(3, 1);call write~init~int(99, 1, 0, 1);call write~init~int(49, 1, 1, 1);call write~init~int(0, 1, 2, 1);call #Ultimate.allocInit(3, 2);call write~init~int(99, 2, 0, 1);call write~init~int(50, 2, 1, 1);call write~init~int(0, 2, 2, 1);call #Ultimate.allocInit(3, 3);call write~init~int(99, 3, 0, 1);call write~init~int(49, 3, 1, 1);call write~init~int(0, 3, 2, 1);call #Ultimate.allocInit(3, 4);call write~init~int(99, 4, 0, 1);call write~init~int(49, 4, 1, 1);call write~init~int(0, 4, 2, 1);call #Ultimate.allocInit(3, 5);call write~init~int(99, 5, 0, 1);call write~init~int(50, 5, 1, 1);call write~init~int(0, 5, 2, 1);~state~0 := ~unnamed3~0~STATE_1;~global~0.base, ~global~0.offset := 0, 0;~#commands~0.base, ~#commands~0.offset := 6, 0;call #Ultimate.allocInit(18, 6);call write~init~$Pointer$(1, 0, ~#commands~0.base, ~#commands~0.offset, 4);call write~init~$Pointer$(#funAddr~c1.base, #funAddr~c1.offset, ~#commands~0.base, 4 + ~#commands~0.offset, 4);call write~init~int((if ~unnamed3~0~STATE_1 % 256 <= 127 then ~unnamed3~0~STATE_1 % 256 else ~unnamed3~0~STATE_1 % 256 - 256), ~#commands~0.base, 8 + ~#commands~0.offset, 1);call write~init~$Pointer$(2, 0, ~#commands~0.base, 9 + ~#commands~0.offset, 4);call write~init~$Pointer$(#funAddr~c2.base, #funAddr~c2.offset, ~#commands~0.base, 13 + ~#commands~0.offset, 4);call write~init~int((if ~unnamed3~0~STATE_2 % 256 <= 127 then ~unnamed3~0~STATE_2 % 256 else ~unnamed3~0~STATE_2 % 256 - 256), ~#commands~0.base, 17 + ~#commands~0.offset, 1); {53645#true} is VALID [2022-02-20 23:38:36,944 INFO L290 TraceCheckUtils]: 1: Hoare triple {53645#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1; {53645#true} is VALID [2022-02-20 23:38:36,944 INFO L272 TraceCheckUtils]: 2: Hoare triple {53645#true} call parse_input(3, 0); {53645#true} is VALID [2022-02-20 23:38:36,944 INFO L290 TraceCheckUtils]: 3: Hoare triple {53645#true} ~input#1.base, ~input#1.offset := #in~input#1.base, #in~input#1.offset;~i~0#1 := 0; {53645#true} is VALID [2022-02-20 23:38:36,944 INFO L290 TraceCheckUtils]: 4: Hoare triple {53645#true} assume !!(~i~0#1 < 2); {53645#true} is VALID [2022-02-20 23:38:36,944 INFO L290 TraceCheckUtils]: 5: Hoare triple {53645#true} SUMMARY for call #t~mem3#1.base, #t~mem3#1.offset := read~$Pointer$(~#commands~0.base, ~#commands~0.offset + 9 * ~i~0#1, 4); srcloc: L693 {53645#true} is VALID [2022-02-20 23:38:36,944 INFO L290 TraceCheckUtils]: 6: Hoare triple {53645#true} assume 1 == #valid[#t~mem3#1.base]; {53645#true} is VALID [2022-02-20 23:38:36,944 INFO L290 TraceCheckUtils]: 7: Hoare triple {53645#true} assume #t~mem3#1.offset < #length[#t~mem3#1.base] && #t~mem3#1.offset >= 0; {53645#true} is VALID [2022-02-20 23:38:36,945 INFO L290 TraceCheckUtils]: 8: Hoare triple {53645#true} assume 1 == #valid[~input#1.base]; {53645#true} is VALID [2022-02-20 23:38:36,945 INFO L290 TraceCheckUtils]: 9: Hoare triple {53645#true} assume ~input#1.offset < #length[~input#1.base] && ~input#1.offset >= 0; {53645#true} is VALID [2022-02-20 23:38:36,945 INFO L290 TraceCheckUtils]: 10: Hoare triple {53645#true} assume 0 == #t~nondet4#1;havoc #t~mem3#1.base, #t~mem3#1.offset;havoc #t~nondet4#1; {53645#true} is VALID [2022-02-20 23:38:36,945 INFO L290 TraceCheckUtils]: 11: Hoare triple {53645#true} SUMMARY for call #t~mem5#1 := read~int(~#commands~0.base, 8 + (~#commands~0.offset + 9 * ~i~0#1), 1); srcloc: L694 {53645#true} is VALID [2022-02-20 23:38:36,945 INFO L290 TraceCheckUtils]: 12: Hoare triple {53645#true} assume ~state~0 >= #t~mem5#1;havoc #t~mem5#1; {53645#true} is VALID [2022-02-20 23:38:36,945 INFO L290 TraceCheckUtils]: 13: Hoare triple {53645#true} SUMMARY for call #t~mem6#1.base, #t~mem6#1.offset := read~$Pointer$(~#commands~0.base, 4 + (~#commands~0.offset + 9 * ~i~0#1), 4); srcloc: L695 {53645#true} is VALID [2022-02-20 23:38:36,945 INFO L290 TraceCheckUtils]: 14: Hoare triple {53645#true} assume { :begin_inline_##fun~~TO~VOID } true;##fun~~TO~VOID_#in~#fp#1.base, ##fun~~TO~VOID_#in~#fp#1.offset := #t~mem6#1.base, #t~mem6#1.offset; {53645#true} is VALID [2022-02-20 23:38:36,945 INFO L290 TraceCheckUtils]: 15: Hoare triple {53645#true} assume !(##fun~~TO~VOID_#in~#fp#1.base == #funAddr~c2.base && ##fun~~TO~VOID_#in~#fp#1.offset == #funAddr~c2.offset);assume { :begin_inline_c1 } true;havoc c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset, c1_~x~0#1.base, c1_~x~0#1.offset;call c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset := #Ultimate.allocOnHeap(1);c1_~x~0#1.base, c1_~x~0#1.offset := c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset;havoc c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset; {53645#true} is VALID [2022-02-20 23:38:36,945 INFO L290 TraceCheckUtils]: 16: Hoare triple {53645#true} assume !(c1_~x~0#1.base == 0 && c1_~x~0#1.offset == 0); {53645#true} is VALID [2022-02-20 23:38:36,946 INFO L290 TraceCheckUtils]: 17: Hoare triple {53645#true} assume !(~global~0.base != 0 || ~global~0.offset != 0); {53645#true} is VALID [2022-02-20 23:38:36,946 INFO L290 TraceCheckUtils]: 18: Hoare triple {53645#true} ~global~0.base, ~global~0.offset := c1_~x~0#1.base, c1_~x~0#1.offset;~state~0 := ~unnamed3~0~STATE_2; {53645#true} is VALID [2022-02-20 23:38:36,946 INFO L290 TraceCheckUtils]: 19: Hoare triple {53645#true} assume { :end_inline_c1 } true; {53645#true} is VALID [2022-02-20 23:38:36,946 INFO L290 TraceCheckUtils]: 20: Hoare triple {53645#true} assume { :end_inline_##fun~~TO~VOID } true;havoc #t~mem6#1.base, #t~mem6#1.offset; {53645#true} is VALID [2022-02-20 23:38:36,946 INFO L290 TraceCheckUtils]: 21: Hoare triple {53645#true} assume true; {53645#true} is VALID [2022-02-20 23:38:36,946 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {53645#true} {53645#true} #101#return; {53645#true} is VALID [2022-02-20 23:38:36,946 INFO L272 TraceCheckUtils]: 23: Hoare triple {53645#true} call parse_input(4, 0); {53645#true} is VALID [2022-02-20 23:38:36,946 INFO L290 TraceCheckUtils]: 24: Hoare triple {53645#true} ~input#1.base, ~input#1.offset := #in~input#1.base, #in~input#1.offset;~i~0#1 := 0; {53645#true} is VALID [2022-02-20 23:38:36,947 INFO L290 TraceCheckUtils]: 25: Hoare triple {53645#true} assume !!(~i~0#1 < 2); {53645#true} is VALID [2022-02-20 23:38:36,947 INFO L290 TraceCheckUtils]: 26: Hoare triple {53645#true} SUMMARY for call #t~mem3#1.base, #t~mem3#1.offset := read~$Pointer$(~#commands~0.base, ~#commands~0.offset + 9 * ~i~0#1, 4); srcloc: L693 {53645#true} is VALID [2022-02-20 23:38:36,947 INFO L290 TraceCheckUtils]: 27: Hoare triple {53645#true} assume 1 == #valid[#t~mem3#1.base]; {53645#true} is VALID [2022-02-20 23:38:36,947 INFO L290 TraceCheckUtils]: 28: Hoare triple {53645#true} assume #t~mem3#1.offset < #length[#t~mem3#1.base] && #t~mem3#1.offset >= 0; {53645#true} is VALID [2022-02-20 23:38:36,947 INFO L290 TraceCheckUtils]: 29: Hoare triple {53645#true} assume 1 == #valid[~input#1.base]; {53645#true} is VALID [2022-02-20 23:38:36,947 INFO L290 TraceCheckUtils]: 30: Hoare triple {53645#true} assume ~input#1.offset < #length[~input#1.base] && ~input#1.offset >= 0; {53645#true} is VALID [2022-02-20 23:38:36,947 INFO L290 TraceCheckUtils]: 31: Hoare triple {53645#true} assume !(0 == #t~nondet4#1);havoc #t~mem3#1.base, #t~mem3#1.offset;havoc #t~nondet4#1; {53645#true} is VALID [2022-02-20 23:38:36,947 INFO L290 TraceCheckUtils]: 32: Hoare triple {53645#true} #t~post2#1 := ~i~0#1;~i~0#1 := 1 + #t~post2#1;havoc #t~post2#1; {53645#true} is VALID [2022-02-20 23:38:36,947 INFO L290 TraceCheckUtils]: 33: Hoare triple {53645#true} assume !!(~i~0#1 < 2); {53645#true} is VALID [2022-02-20 23:38:36,948 INFO L290 TraceCheckUtils]: 34: Hoare triple {53645#true} SUMMARY for call #t~mem3#1.base, #t~mem3#1.offset := read~$Pointer$(~#commands~0.base, ~#commands~0.offset + 9 * ~i~0#1, 4); srcloc: L693 {53645#true} is VALID [2022-02-20 23:38:36,948 INFO L290 TraceCheckUtils]: 35: Hoare triple {53645#true} assume 1 == #valid[#t~mem3#1.base]; {53645#true} is VALID [2022-02-20 23:38:36,948 INFO L290 TraceCheckUtils]: 36: Hoare triple {53645#true} assume #t~mem3#1.offset < #length[#t~mem3#1.base] && #t~mem3#1.offset >= 0; {53645#true} is VALID [2022-02-20 23:38:36,948 INFO L290 TraceCheckUtils]: 37: Hoare triple {53645#true} assume 1 == #valid[~input#1.base]; {53645#true} is VALID [2022-02-20 23:38:36,948 INFO L290 TraceCheckUtils]: 38: Hoare triple {53645#true} assume ~input#1.offset < #length[~input#1.base] && ~input#1.offset >= 0; {53645#true} is VALID [2022-02-20 23:38:36,948 INFO L290 TraceCheckUtils]: 39: Hoare triple {53645#true} assume 0 == #t~nondet4#1;havoc #t~mem3#1.base, #t~mem3#1.offset;havoc #t~nondet4#1; {53645#true} is VALID [2022-02-20 23:38:36,948 INFO L290 TraceCheckUtils]: 40: Hoare triple {53645#true} SUMMARY for call #t~mem5#1 := read~int(~#commands~0.base, 8 + (~#commands~0.offset + 9 * ~i~0#1), 1); srcloc: L694 {53645#true} is VALID [2022-02-20 23:38:36,948 INFO L290 TraceCheckUtils]: 41: Hoare triple {53645#true} assume ~state~0 >= #t~mem5#1;havoc #t~mem5#1; {53645#true} is VALID [2022-02-20 23:38:36,949 INFO L290 TraceCheckUtils]: 42: Hoare triple {53645#true} SUMMARY for call #t~mem6#1.base, #t~mem6#1.offset := read~$Pointer$(~#commands~0.base, 4 + (~#commands~0.offset + 9 * ~i~0#1), 4); srcloc: L695 {53645#true} is VALID [2022-02-20 23:38:36,949 INFO L290 TraceCheckUtils]: 43: Hoare triple {53645#true} assume { :begin_inline_##fun~~TO~VOID } true;##fun~~TO~VOID_#in~#fp#1.base, ##fun~~TO~VOID_#in~#fp#1.offset := #t~mem6#1.base, #t~mem6#1.offset; {53645#true} is VALID [2022-02-20 23:38:36,949 INFO L290 TraceCheckUtils]: 44: Hoare triple {53645#true} assume ##fun~~TO~VOID_#in~#fp#1.base == #funAddr~c2.base && ##fun~~TO~VOID_#in~#fp#1.offset == #funAddr~c2.offset;assume { :begin_inline_c2 } true;havoc c2_~y~0#1.base, c2_~y~0#1.offset;c2_~y~0#1.base, c2_~y~0#1.offset := 0, 0; {53667#(and (= |parse_input_c2_~y~0#1.base| 0) (= |parse_input_c2_~y~0#1.offset| 0))} is VALID [2022-02-20 23:38:36,949 INFO L290 TraceCheckUtils]: 45: Hoare triple {53667#(and (= |parse_input_c2_~y~0#1.base| 0) (= |parse_input_c2_~y~0#1.offset| 0))} assume !((c2_~y~0#1.base == 0 && c2_~y~0#1.offset == 0) || (~global~0.base == 0 && ~global~0.offset == 0)); {53646#false} is VALID [2022-02-20 23:38:36,949 INFO L290 TraceCheckUtils]: 46: Hoare triple {53646#false} assume 0 == c2_~y~0#1.offset; {53646#false} is VALID [2022-02-20 23:38:36,950 INFO L290 TraceCheckUtils]: 47: Hoare triple {53646#false} assume c2_~y~0#1.base < #StackHeapBarrier; {53646#false} is VALID [2022-02-20 23:38:36,950 INFO L290 TraceCheckUtils]: 48: Hoare triple {53646#false} assume 0 == c2_~y~0#1.base || 1 == #valid[c2_~y~0#1.base];call ULTIMATE.dealloc(c2_~y~0#1.base, c2_~y~0#1.offset); {53646#false} is VALID [2022-02-20 23:38:36,950 INFO L290 TraceCheckUtils]: 49: Hoare triple {53646#false} assume 0 == ~global~0.offset; {53646#false} is VALID [2022-02-20 23:38:36,950 INFO L290 TraceCheckUtils]: 50: Hoare triple {53646#false} assume ~global~0.base < #StackHeapBarrier; {53646#false} is VALID [2022-02-20 23:38:36,950 INFO L290 TraceCheckUtils]: 51: Hoare triple {53646#false} assume !(0 == ~global~0.base || 1 == #valid[~global~0.base]); {53646#false} is VALID [2022-02-20 23:38:36,963 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-02-20 23:38:36,963 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:38:36,963 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1320565959] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:38:36,963 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-20 23:38:36,963 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 4 [2022-02-20 23:38:36,963 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356675753] [2022-02-20 23:38:36,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:38:36,964 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 52 [2022-02-20 23:38:36,964 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:38:36,964 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:38:36,981 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:38:36,981 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:38:36,981 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:38:36,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:38:36,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 23:38:36,981 INFO L87 Difference]: Start difference. First operand 364 states and 424 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:38:37,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:38:37,025 INFO L93 Difference]: Finished difference Result 306 states and 346 transitions. [2022-02-20 23:38:37,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:38:37,025 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 52 [2022-02-20 23:38:37,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:38:37,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:38:37,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 53 transitions. [2022-02-20 23:38:37,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:38:37,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 53 transitions. [2022-02-20 23:38:37,027 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 53 transitions. [2022-02-20 23:38:37,066 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:38:37,069 INFO L225 Difference]: With dead ends: 306 [2022-02-20 23:38:37,069 INFO L226 Difference]: Without dead ends: 306 [2022-02-20 23:38:37,070 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 23:38:37,070 INFO L933 BasicCegarLoop]: 51 mSDtfsCounter, 4 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:38:37,070 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 98 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:38:37,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2022-02-20 23:38:37,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 289. [2022-02-20 23:38:37,073 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:38:37,074 INFO L82 GeneralOperation]: Start isEquivalent. First operand 306 states. Second operand has 289 states, 264 states have (on average 1.178030303030303) internal successors, (311), 274 states have internal predecessors, (311), 7 states have call successors, (7), 7 states have call predecessors, (7), 10 states have return successors, (11), 7 states have call predecessors, (11), 7 states have call successors, (11) [2022-02-20 23:38:37,074 INFO L74 IsIncluded]: Start isIncluded. First operand 306 states. Second operand has 289 states, 264 states have (on average 1.178030303030303) internal successors, (311), 274 states have internal predecessors, (311), 7 states have call successors, (7), 7 states have call predecessors, (7), 10 states have return successors, (11), 7 states have call predecessors, (11), 7 states have call successors, (11) [2022-02-20 23:38:37,074 INFO L87 Difference]: Start difference. First operand 306 states. Second operand has 289 states, 264 states have (on average 1.178030303030303) internal successors, (311), 274 states have internal predecessors, (311), 7 states have call successors, (7), 7 states have call predecessors, (7), 10 states have return successors, (11), 7 states have call predecessors, (11), 7 states have call successors, (11) [2022-02-20 23:38:37,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:38:37,078 INFO L93 Difference]: Finished difference Result 306 states and 346 transitions. [2022-02-20 23:38:37,078 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 346 transitions. [2022-02-20 23:38:37,078 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:38:37,078 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:38:37,078 INFO L74 IsIncluded]: Start isIncluded. First operand has 289 states, 264 states have (on average 1.178030303030303) internal successors, (311), 274 states have internal predecessors, (311), 7 states have call successors, (7), 7 states have call predecessors, (7), 10 states have return successors, (11), 7 states have call predecessors, (11), 7 states have call successors, (11) Second operand 306 states. [2022-02-20 23:38:37,079 INFO L87 Difference]: Start difference. First operand has 289 states, 264 states have (on average 1.178030303030303) internal successors, (311), 274 states have internal predecessors, (311), 7 states have call successors, (7), 7 states have call predecessors, (7), 10 states have return successors, (11), 7 states have call predecessors, (11), 7 states have call successors, (11) Second operand 306 states. [2022-02-20 23:38:37,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:38:37,082 INFO L93 Difference]: Finished difference Result 306 states and 346 transitions. [2022-02-20 23:38:37,082 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 346 transitions. [2022-02-20 23:38:37,083 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:38:37,083 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:38:37,083 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:38:37,083 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:38:37,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 289 states, 264 states have (on average 1.178030303030303) internal successors, (311), 274 states have internal predecessors, (311), 7 states have call successors, (7), 7 states have call predecessors, (7), 10 states have return successors, (11), 7 states have call predecessors, (11), 7 states have call successors, (11) [2022-02-20 23:38:37,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 329 transitions. [2022-02-20 23:38:37,086 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 329 transitions. Word has length 52 [2022-02-20 23:38:37,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:38:37,086 INFO L470 AbstractCegarLoop]: Abstraction has 289 states and 329 transitions. [2022-02-20 23:38:37,086 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:38:37,087 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 329 transitions. [2022-02-20 23:38:37,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-02-20 23:38:37,087 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:38:37,087 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:38:37,107 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2022-02-20 23:38:37,299 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2022-02-20 23:38:37,299 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATION, parse_inputErr1REQUIRES_VIOLATION, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2022-02-20 23:38:37,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:38:37,300 INFO L85 PathProgramCache]: Analyzing trace with hash -57759457, now seen corresponding path program 1 times [2022-02-20 23:38:37,300 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:38:37,300 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408237125] [2022-02-20 23:38:37,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:38:37,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:38:37,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:38:37,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 23:38:37,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:38:37,669 INFO L290 TraceCheckUtils]: 0: Hoare triple {55082#(and (= ~global~0.base |old(~global~0.base)|) (= |old(#length)| |#length|) (= |old(~global~0.offset)| ~global~0.offset) (= ~state~0 |old(~state~0)|) (= |old(#valid)| |#valid|))} ~input#1.base, ~input#1.offset := #in~input#1.base, #in~input#1.offset;~i~0#1 := 0; {55083#(and (= (select |old(#length)| 1) (select |#length| 1)) (= |parse_input_~i~0#1| 0))} is VALID [2022-02-20 23:38:37,669 INFO L290 TraceCheckUtils]: 1: Hoare triple {55083#(and (= (select |old(#length)| 1) (select |#length| 1)) (= |parse_input_~i~0#1| 0))} assume !!(~i~0#1 < 2); {55083#(and (= (select |old(#length)| 1) (select |#length| 1)) (= |parse_input_~i~0#1| 0))} is VALID [2022-02-20 23:38:37,670 INFO L290 TraceCheckUtils]: 2: Hoare triple {55083#(and (= (select |old(#length)| 1) (select |#length| 1)) (= |parse_input_~i~0#1| 0))} SUMMARY for call #t~mem3#1.base, #t~mem3#1.offset := read~$Pointer$(~#commands~0.base, ~#commands~0.offset + 9 * ~i~0#1, 4); srcloc: L693 {55084#(and (or (not (= (+ (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) (* (- 1) |parse_input_~i~0#1|)) 0)) (and (= (select |old(#length)| 1) (select |#length| 1)) (= |parse_input_~i~0#1| 0))) (or (= |parse_input_~i~0#1| 0) (not (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|)))))} is VALID [2022-02-20 23:38:37,670 INFO L290 TraceCheckUtils]: 3: Hoare triple {55084#(and (or (not (= (+ (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) (* (- 1) |parse_input_~i~0#1|)) 0)) (and (= (select |old(#length)| 1) (select |#length| 1)) (= |parse_input_~i~0#1| 0))) (or (= |parse_input_~i~0#1| 0) (not (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|)))))} assume 1 == #valid[#t~mem3#1.base]; {55084#(and (or (not (= (+ (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) (* (- 1) |parse_input_~i~0#1|)) 0)) (and (= (select |old(#length)| 1) (select |#length| 1)) (= |parse_input_~i~0#1| 0))) (or (= |parse_input_~i~0#1| 0) (not (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|)))))} is VALID [2022-02-20 23:38:37,671 INFO L290 TraceCheckUtils]: 4: Hoare triple {55084#(and (or (not (= (+ (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) (* (- 1) |parse_input_~i~0#1|)) 0)) (and (= (select |old(#length)| 1) (select |#length| 1)) (= |parse_input_~i~0#1| 0))) (or (= |parse_input_~i~0#1| 0) (not (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|)))))} assume #t~mem3#1.offset < #length[#t~mem3#1.base] && #t~mem3#1.offset >= 0; {55084#(and (or (not (= (+ (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) (* (- 1) |parse_input_~i~0#1|)) 0)) (and (= (select |old(#length)| 1) (select |#length| 1)) (= |parse_input_~i~0#1| 0))) (or (= |parse_input_~i~0#1| 0) (not (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|)))))} is VALID [2022-02-20 23:38:37,671 INFO L290 TraceCheckUtils]: 5: Hoare triple {55084#(and (or (not (= (+ (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) (* (- 1) |parse_input_~i~0#1|)) 0)) (and (= (select |old(#length)| 1) (select |#length| 1)) (= |parse_input_~i~0#1| 0))) (or (= |parse_input_~i~0#1| 0) (not (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|)))))} assume 1 == #valid[~input#1.base]; {55084#(and (or (not (= (+ (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) (* (- 1) |parse_input_~i~0#1|)) 0)) (and (= (select |old(#length)| 1) (select |#length| 1)) (= |parse_input_~i~0#1| 0))) (or (= |parse_input_~i~0#1| 0) (not (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|)))))} is VALID [2022-02-20 23:38:37,676 INFO L290 TraceCheckUtils]: 6: Hoare triple {55084#(and (or (not (= (+ (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) (* (- 1) |parse_input_~i~0#1|)) 0)) (and (= (select |old(#length)| 1) (select |#length| 1)) (= |parse_input_~i~0#1| 0))) (or (= |parse_input_~i~0#1| 0) (not (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|)))))} assume ~input#1.offset < #length[~input#1.base] && ~input#1.offset >= 0; {55084#(and (or (not (= (+ (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) (* (- 1) |parse_input_~i~0#1|)) 0)) (and (= (select |old(#length)| 1) (select |#length| 1)) (= |parse_input_~i~0#1| 0))) (or (= |parse_input_~i~0#1| 0) (not (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|)))))} is VALID [2022-02-20 23:38:37,677 INFO L290 TraceCheckUtils]: 7: Hoare triple {55084#(and (or (not (= (+ (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) (* (- 1) |parse_input_~i~0#1|)) 0)) (and (= (select |old(#length)| 1) (select |#length| 1)) (= |parse_input_~i~0#1| 0))) (or (= |parse_input_~i~0#1| 0) (not (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|)))))} assume 0 == #t~nondet4#1;havoc #t~mem3#1.base, #t~mem3#1.offset;havoc #t~nondet4#1; {55084#(and (or (not (= (+ (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) (* (- 1) |parse_input_~i~0#1|)) 0)) (and (= (select |old(#length)| 1) (select |#length| 1)) (= |parse_input_~i~0#1| 0))) (or (= |parse_input_~i~0#1| 0) (not (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|)))))} is VALID [2022-02-20 23:38:37,677 INFO L290 TraceCheckUtils]: 8: Hoare triple {55084#(and (or (not (= (+ (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) (* (- 1) |parse_input_~i~0#1|)) 0)) (and (= (select |old(#length)| 1) (select |#length| 1)) (= |parse_input_~i~0#1| 0))) (or (= |parse_input_~i~0#1| 0) (not (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|)))))} SUMMARY for call #t~mem5#1 := read~int(~#commands~0.base, 8 + (~#commands~0.offset + 9 * ~i~0#1), 1); srcloc: L694 {55084#(and (or (not (= (+ (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) (* (- 1) |parse_input_~i~0#1|)) 0)) (and (= (select |old(#length)| 1) (select |#length| 1)) (= |parse_input_~i~0#1| 0))) (or (= |parse_input_~i~0#1| 0) (not (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|)))))} is VALID [2022-02-20 23:38:37,678 INFO L290 TraceCheckUtils]: 9: Hoare triple {55084#(and (or (not (= (+ (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) (* (- 1) |parse_input_~i~0#1|)) 0)) (and (= (select |old(#length)| 1) (select |#length| 1)) (= |parse_input_~i~0#1| 0))) (or (= |parse_input_~i~0#1| 0) (not (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|)))))} assume ~state~0 >= #t~mem5#1;havoc #t~mem5#1; {55084#(and (or (not (= (+ (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) (* (- 1) |parse_input_~i~0#1|)) 0)) (and (= (select |old(#length)| 1) (select |#length| 1)) (= |parse_input_~i~0#1| 0))) (or (= |parse_input_~i~0#1| 0) (not (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|)))))} is VALID [2022-02-20 23:38:37,679 INFO L290 TraceCheckUtils]: 10: Hoare triple {55084#(and (or (not (= (+ (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) (* (- 1) |parse_input_~i~0#1|)) 0)) (and (= (select |old(#length)| 1) (select |#length| 1)) (= |parse_input_~i~0#1| 0))) (or (= |parse_input_~i~0#1| 0) (not (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|)))))} SUMMARY for call #t~mem6#1.base, #t~mem6#1.offset := read~$Pointer$(~#commands~0.base, 4 + (~#commands~0.offset + 9 * ~i~0#1), 4); srcloc: L695 {55085#(or (= (select |old(#length)| 1) (select |#length| 1)) (not (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) 0)) (not (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|))))} is VALID [2022-02-20 23:38:37,679 INFO L290 TraceCheckUtils]: 11: Hoare triple {55085#(or (= (select |old(#length)| 1) (select |#length| 1)) (not (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) 0)) (not (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|))))} assume { :begin_inline_##fun~~TO~VOID } true;##fun~~TO~VOID_#in~#fp#1.base, ##fun~~TO~VOID_#in~#fp#1.offset := #t~mem6#1.base, #t~mem6#1.offset; {55085#(or (= (select |old(#length)| 1) (select |#length| 1)) (not (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) 0)) (not (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|))))} is VALID [2022-02-20 23:38:37,680 INFO L290 TraceCheckUtils]: 12: Hoare triple {55085#(or (= (select |old(#length)| 1) (select |#length| 1)) (not (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) 0)) (not (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|))))} assume !(##fun~~TO~VOID_#in~#fp#1.base == #funAddr~c2.base && ##fun~~TO~VOID_#in~#fp#1.offset == #funAddr~c2.offset);assume { :begin_inline_c1 } true;havoc c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset, c1_~x~0#1.base, c1_~x~0#1.offset;call c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset := #Ultimate.allocOnHeap(1);c1_~x~0#1.base, c1_~x~0#1.offset := c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset;havoc c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset; {55086#(or (= (select |old(#length)| 1) (select |#length| 1)) (= |parse_input_c1_~x~0#1.base| 1) (= (+ (- 3) (select |#length| 1)) 0) (not (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) 0)) (not (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|))))} is VALID [2022-02-20 23:38:37,680 INFO L290 TraceCheckUtils]: 13: Hoare triple {55086#(or (= (select |old(#length)| 1) (select |#length| 1)) (= |parse_input_c1_~x~0#1.base| 1) (= (+ (- 3) (select |#length| 1)) 0) (not (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) 0)) (not (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|))))} assume !(c1_~x~0#1.base == 0 && c1_~x~0#1.offset == 0); {55086#(or (= (select |old(#length)| 1) (select |#length| 1)) (= |parse_input_c1_~x~0#1.base| 1) (= (+ (- 3) (select |#length| 1)) 0) (not (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) 0)) (not (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|))))} is VALID [2022-02-20 23:38:37,680 INFO L290 TraceCheckUtils]: 14: Hoare triple {55086#(or (= (select |old(#length)| 1) (select |#length| 1)) (= |parse_input_c1_~x~0#1.base| 1) (= (+ (- 3) (select |#length| 1)) 0) (not (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) 0)) (not (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|))))} assume !(~global~0.base != 0 || ~global~0.offset != 0); {55086#(or (= (select |old(#length)| 1) (select |#length| 1)) (= |parse_input_c1_~x~0#1.base| 1) (= (+ (- 3) (select |#length| 1)) 0) (not (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) 0)) (not (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|))))} is VALID [2022-02-20 23:38:37,681 INFO L290 TraceCheckUtils]: 15: Hoare triple {55086#(or (= (select |old(#length)| 1) (select |#length| 1)) (= |parse_input_c1_~x~0#1.base| 1) (= (+ (- 3) (select |#length| 1)) 0) (not (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) 0)) (not (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|))))} ~global~0.base, ~global~0.offset := c1_~x~0#1.base, c1_~x~0#1.offset;~state~0 := ~unnamed3~0~STATE_2; {55087#(or (= (select |old(#length)| 1) (select |#length| 1)) (= (+ (- 3) (select |#length| 1)) 0) (not (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|))) (not (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) 0)) (not (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|))) (= ~global~0.base 1))} is VALID [2022-02-20 23:38:37,681 INFO L290 TraceCheckUtils]: 16: Hoare triple {55087#(or (= (select |old(#length)| 1) (select |#length| 1)) (= (+ (- 3) (select |#length| 1)) 0) (not (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|))) (not (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) 0)) (not (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|))) (= ~global~0.base 1))} assume { :end_inline_c1 } true; {55087#(or (= (select |old(#length)| 1) (select |#length| 1)) (= (+ (- 3) (select |#length| 1)) 0) (not (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|))) (not (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) 0)) (not (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|))) (= ~global~0.base 1))} is VALID [2022-02-20 23:38:37,682 INFO L290 TraceCheckUtils]: 17: Hoare triple {55087#(or (= (select |old(#length)| 1) (select |#length| 1)) (= (+ (- 3) (select |#length| 1)) 0) (not (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|))) (not (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) 0)) (not (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|))) (= ~global~0.base 1))} assume { :end_inline_##fun~~TO~VOID } true;havoc #t~mem6#1.base, #t~mem6#1.offset; {55087#(or (= (select |old(#length)| 1) (select |#length| 1)) (= (+ (- 3) (select |#length| 1)) 0) (not (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|))) (not (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) 0)) (not (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|))) (= ~global~0.base 1))} is VALID [2022-02-20 23:38:37,682 INFO L290 TraceCheckUtils]: 18: Hoare triple {55087#(or (= (select |old(#length)| 1) (select |#length| 1)) (= (+ (- 3) (select |#length| 1)) 0) (not (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|))) (not (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) 0)) (not (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|))) (= ~global~0.base 1))} assume true; {55087#(or (= (select |old(#length)| 1) (select |#length| 1)) (= (+ (- 3) (select |#length| 1)) 0) (not (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|))) (not (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) 0)) (not (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|))) (= ~global~0.base 1))} is VALID [2022-02-20 23:38:37,683 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {55087#(or (= (select |old(#length)| 1) (select |#length| 1)) (= (+ (- 3) (select |#length| 1)) 0) (not (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|))) (not (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) 0)) (not (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|))) (= ~global~0.base 1))} {55033#(and (= 3 (select |#length| 1)) (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0) (= |~#commands~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1))} #101#return; {55054#(and (or (and (<= (+ (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) 3) (select |#length| 1)) (<= 0 (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0)) (<= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1)) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) ~global~0.base)) (= |~#commands~0.offset| 0))} is VALID [2022-02-20 23:38:37,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-02-20 23:38:37,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:38:37,806 INFO L290 TraceCheckUtils]: 0: Hoare triple {55082#(and (= ~global~0.base |old(~global~0.base)|) (= |old(#length)| |#length|) (= |old(~global~0.offset)| ~global~0.offset) (= ~state~0 |old(~state~0)|) (= |old(#valid)| |#valid|))} ~input#1.base, ~input#1.offset := #in~input#1.base, #in~input#1.offset;~i~0#1 := 0; {55088#(and (= ~global~0.base |old(~global~0.base)|) (= (select |old(#length)| 1) (select |#length| 1)))} is VALID [2022-02-20 23:38:37,806 INFO L290 TraceCheckUtils]: 1: Hoare triple {55088#(and (= ~global~0.base |old(~global~0.base)|) (= (select |old(#length)| 1) (select |#length| 1)))} assume !!(~i~0#1 < 2); {55088#(and (= ~global~0.base |old(~global~0.base)|) (= (select |old(#length)| 1) (select |#length| 1)))} is VALID [2022-02-20 23:38:37,807 INFO L290 TraceCheckUtils]: 2: Hoare triple {55088#(and (= ~global~0.base |old(~global~0.base)|) (= (select |old(#length)| 1) (select |#length| 1)))} SUMMARY for call #t~mem3#1.base, #t~mem3#1.offset := read~$Pointer$(~#commands~0.base, ~#commands~0.offset + 9 * ~i~0#1, 4); srcloc: L693 {55089#(and (= (select |old(#length)| 1) (select |#length| 1)) (or (= ~global~0.base |old(~global~0.base)|) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) ~global~0.base)))} is VALID [2022-02-20 23:38:37,807 INFO L290 TraceCheckUtils]: 3: Hoare triple {55089#(and (= (select |old(#length)| 1) (select |#length| 1)) (or (= ~global~0.base |old(~global~0.base)|) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) ~global~0.base)))} assume 1 == #valid[#t~mem3#1.base]; {55089#(and (= (select |old(#length)| 1) (select |#length| 1)) (or (= ~global~0.base |old(~global~0.base)|) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) ~global~0.base)))} is VALID [2022-02-20 23:38:37,808 INFO L290 TraceCheckUtils]: 4: Hoare triple {55089#(and (= (select |old(#length)| 1) (select |#length| 1)) (or (= ~global~0.base |old(~global~0.base)|) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) ~global~0.base)))} assume #t~mem3#1.offset < #length[#t~mem3#1.base] && #t~mem3#1.offset >= 0; {55089#(and (= (select |old(#length)| 1) (select |#length| 1)) (or (= ~global~0.base |old(~global~0.base)|) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) ~global~0.base)))} is VALID [2022-02-20 23:38:37,808 INFO L290 TraceCheckUtils]: 5: Hoare triple {55089#(and (= (select |old(#length)| 1) (select |#length| 1)) (or (= ~global~0.base |old(~global~0.base)|) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) ~global~0.base)))} assume 1 == #valid[~input#1.base]; {55089#(and (= (select |old(#length)| 1) (select |#length| 1)) (or (= ~global~0.base |old(~global~0.base)|) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) ~global~0.base)))} is VALID [2022-02-20 23:38:37,808 INFO L290 TraceCheckUtils]: 6: Hoare triple {55089#(and (= (select |old(#length)| 1) (select |#length| 1)) (or (= ~global~0.base |old(~global~0.base)|) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) ~global~0.base)))} assume ~input#1.offset < #length[~input#1.base] && ~input#1.offset >= 0; {55089#(and (= (select |old(#length)| 1) (select |#length| 1)) (or (= ~global~0.base |old(~global~0.base)|) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) ~global~0.base)))} is VALID [2022-02-20 23:38:37,809 INFO L290 TraceCheckUtils]: 7: Hoare triple {55089#(and (= (select |old(#length)| 1) (select |#length| 1)) (or (= ~global~0.base |old(~global~0.base)|) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) ~global~0.base)))} assume 0 == #t~nondet4#1;havoc #t~mem3#1.base, #t~mem3#1.offset;havoc #t~nondet4#1; {55089#(and (= (select |old(#length)| 1) (select |#length| 1)) (or (= ~global~0.base |old(~global~0.base)|) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) ~global~0.base)))} is VALID [2022-02-20 23:38:37,810 INFO L290 TraceCheckUtils]: 8: Hoare triple {55089#(and (= (select |old(#length)| 1) (select |#length| 1)) (or (= ~global~0.base |old(~global~0.base)|) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) ~global~0.base)))} SUMMARY for call #t~mem5#1 := read~int(~#commands~0.base, 8 + (~#commands~0.offset + 9 * ~i~0#1), 1); srcloc: L694 {55089#(and (= (select |old(#length)| 1) (select |#length| 1)) (or (= ~global~0.base |old(~global~0.base)|) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) ~global~0.base)))} is VALID [2022-02-20 23:38:37,810 INFO L290 TraceCheckUtils]: 9: Hoare triple {55089#(and (= (select |old(#length)| 1) (select |#length| 1)) (or (= ~global~0.base |old(~global~0.base)|) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) ~global~0.base)))} assume ~state~0 >= #t~mem5#1;havoc #t~mem5#1; {55089#(and (= (select |old(#length)| 1) (select |#length| 1)) (or (= ~global~0.base |old(~global~0.base)|) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) ~global~0.base)))} is VALID [2022-02-20 23:38:37,811 INFO L290 TraceCheckUtils]: 10: Hoare triple {55089#(and (= (select |old(#length)| 1) (select |#length| 1)) (or (= ~global~0.base |old(~global~0.base)|) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) ~global~0.base)))} SUMMARY for call #t~mem6#1.base, #t~mem6#1.offset := read~$Pointer$(~#commands~0.base, 4 + (~#commands~0.offset + 9 * ~i~0#1), 4); srcloc: L695 {55089#(and (= (select |old(#length)| 1) (select |#length| 1)) (or (= ~global~0.base |old(~global~0.base)|) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) ~global~0.base)))} is VALID [2022-02-20 23:38:37,811 INFO L290 TraceCheckUtils]: 11: Hoare triple {55089#(and (= (select |old(#length)| 1) (select |#length| 1)) (or (= ~global~0.base |old(~global~0.base)|) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) ~global~0.base)))} assume { :begin_inline_##fun~~TO~VOID } true;##fun~~TO~VOID_#in~#fp#1.base, ##fun~~TO~VOID_#in~#fp#1.offset := #t~mem6#1.base, #t~mem6#1.offset; {55089#(and (= (select |old(#length)| 1) (select |#length| 1)) (or (= ~global~0.base |old(~global~0.base)|) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) ~global~0.base)))} is VALID [2022-02-20 23:38:37,812 INFO L290 TraceCheckUtils]: 12: Hoare triple {55089#(and (= (select |old(#length)| 1) (select |#length| 1)) (or (= ~global~0.base |old(~global~0.base)|) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) ~global~0.base)))} assume !(##fun~~TO~VOID_#in~#fp#1.base == #funAddr~c2.base && ##fun~~TO~VOID_#in~#fp#1.offset == #funAddr~c2.offset);assume { :begin_inline_c1 } true;havoc c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset, c1_~x~0#1.base, c1_~x~0#1.offset;call c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset := #Ultimate.allocOnHeap(1);c1_~x~0#1.base, c1_~x~0#1.offset := c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset;havoc c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset; {55090#(and (or (= (select |old(#length)| 1) (select |#length| 1)) (= |parse_input_c1_~x~0#1.base| 1)) (or (= ~global~0.base |old(~global~0.base)|) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) ~global~0.base)) (or (not (= |parse_input_c1_~x~0#1.base| 1)) (not (= |parse_input_c1_~x~0#1.base| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|))) (= (select |#length| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|)) 1)))} is VALID [2022-02-20 23:38:37,812 INFO L290 TraceCheckUtils]: 13: Hoare triple {55090#(and (or (= (select |old(#length)| 1) (select |#length| 1)) (= |parse_input_c1_~x~0#1.base| 1)) (or (= ~global~0.base |old(~global~0.base)|) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) ~global~0.base)) (or (not (= |parse_input_c1_~x~0#1.base| 1)) (not (= |parse_input_c1_~x~0#1.base| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|))) (= (select |#length| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|)) 1)))} assume !(c1_~x~0#1.base == 0 && c1_~x~0#1.offset == 0); {55090#(and (or (= (select |old(#length)| 1) (select |#length| 1)) (= |parse_input_c1_~x~0#1.base| 1)) (or (= ~global~0.base |old(~global~0.base)|) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) ~global~0.base)) (or (not (= |parse_input_c1_~x~0#1.base| 1)) (not (= |parse_input_c1_~x~0#1.base| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|))) (= (select |#length| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|)) 1)))} is VALID [2022-02-20 23:38:37,813 INFO L290 TraceCheckUtils]: 14: Hoare triple {55090#(and (or (= (select |old(#length)| 1) (select |#length| 1)) (= |parse_input_c1_~x~0#1.base| 1)) (or (= ~global~0.base |old(~global~0.base)|) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) ~global~0.base)) (or (not (= |parse_input_c1_~x~0#1.base| 1)) (not (= |parse_input_c1_~x~0#1.base| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|))) (= (select |#length| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|)) 1)))} assume ~global~0.base != 0 || ~global~0.offset != 0; {55090#(and (or (= (select |old(#length)| 1) (select |#length| 1)) (= |parse_input_c1_~x~0#1.base| 1)) (or (= ~global~0.base |old(~global~0.base)|) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) ~global~0.base)) (or (not (= |parse_input_c1_~x~0#1.base| 1)) (not (= |parse_input_c1_~x~0#1.base| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|))) (= (select |#length| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|)) 1)))} is VALID [2022-02-20 23:38:37,813 INFO L290 TraceCheckUtils]: 15: Hoare triple {55090#(and (or (= (select |old(#length)| 1) (select |#length| 1)) (= |parse_input_c1_~x~0#1.base| 1)) (or (= ~global~0.base |old(~global~0.base)|) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) ~global~0.base)) (or (not (= |parse_input_c1_~x~0#1.base| 1)) (not (= |parse_input_c1_~x~0#1.base| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|))) (= (select |#length| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|)) 1)))} assume 0 == ~global~0.offset; {55090#(and (or (= (select |old(#length)| 1) (select |#length| 1)) (= |parse_input_c1_~x~0#1.base| 1)) (or (= ~global~0.base |old(~global~0.base)|) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) ~global~0.base)) (or (not (= |parse_input_c1_~x~0#1.base| 1)) (not (= |parse_input_c1_~x~0#1.base| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|))) (= (select |#length| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|)) 1)))} is VALID [2022-02-20 23:38:37,814 INFO L290 TraceCheckUtils]: 16: Hoare triple {55090#(and (or (= (select |old(#length)| 1) (select |#length| 1)) (= |parse_input_c1_~x~0#1.base| 1)) (or (= ~global~0.base |old(~global~0.base)|) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) ~global~0.base)) (or (not (= |parse_input_c1_~x~0#1.base| 1)) (not (= |parse_input_c1_~x~0#1.base| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|))) (= (select |#length| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|)) 1)))} assume ~global~0.base < #StackHeapBarrier; {55090#(and (or (= (select |old(#length)| 1) (select |#length| 1)) (= |parse_input_c1_~x~0#1.base| 1)) (or (= ~global~0.base |old(~global~0.base)|) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) ~global~0.base)) (or (not (= |parse_input_c1_~x~0#1.base| 1)) (not (= |parse_input_c1_~x~0#1.base| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|))) (= (select |#length| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|)) 1)))} is VALID [2022-02-20 23:38:37,815 INFO L290 TraceCheckUtils]: 17: Hoare triple {55090#(and (or (= (select |old(#length)| 1) (select |#length| 1)) (= |parse_input_c1_~x~0#1.base| 1)) (or (= ~global~0.base |old(~global~0.base)|) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) ~global~0.base)) (or (not (= |parse_input_c1_~x~0#1.base| 1)) (not (= |parse_input_c1_~x~0#1.base| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|))) (= (select |#length| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|)) 1)))} assume 0 == ~global~0.base || 1 == #valid[~global~0.base];call ULTIMATE.dealloc(~global~0.base, ~global~0.offset); {55091#(and (or (= (select |old(#length)| 1) (select |#length| 1)) (= |parse_input_c1_~x~0#1.base| 1)) (or (not (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) |old(~global~0.base)|)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0)) 0)) (or (not (= |parse_input_c1_~x~0#1.base| 1)) (not (= |parse_input_c1_~x~0#1.base| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|))) (= (select |#length| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|)) 1)))} is VALID [2022-02-20 23:38:37,815 INFO L290 TraceCheckUtils]: 18: Hoare triple {55091#(and (or (= (select |old(#length)| 1) (select |#length| 1)) (= |parse_input_c1_~x~0#1.base| 1)) (or (not (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) |old(~global~0.base)|)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0)) 0)) (or (not (= |parse_input_c1_~x~0#1.base| 1)) (not (= |parse_input_c1_~x~0#1.base| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|))) (= (select |#length| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|)) 1)))} ~global~0.base, ~global~0.offset := c1_~x~0#1.base, c1_~x~0#1.offset;~state~0 := ~unnamed3~0~STATE_2; {55092#(and (or (not (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) |old(~global~0.base)|)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0)) 0)) (or (= (select |old(#length)| 1) (select |#length| 1)) (not (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1)) (= (select |#length| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|)) 1)))} is VALID [2022-02-20 23:38:37,816 INFO L290 TraceCheckUtils]: 19: Hoare triple {55092#(and (or (not (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) |old(~global~0.base)|)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0)) 0)) (or (= (select |old(#length)| 1) (select |#length| 1)) (not (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1)) (= (select |#length| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|)) 1)))} assume { :end_inline_c1 } true; {55092#(and (or (not (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) |old(~global~0.base)|)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0)) 0)) (or (= (select |old(#length)| 1) (select |#length| 1)) (not (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1)) (= (select |#length| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|)) 1)))} is VALID [2022-02-20 23:38:37,816 INFO L290 TraceCheckUtils]: 20: Hoare triple {55092#(and (or (not (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) |old(~global~0.base)|)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0)) 0)) (or (= (select |old(#length)| 1) (select |#length| 1)) (not (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1)) (= (select |#length| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|)) 1)))} assume { :end_inline_##fun~~TO~VOID } true;havoc #t~mem6#1.base, #t~mem6#1.offset; {55092#(and (or (not (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) |old(~global~0.base)|)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0)) 0)) (or (= (select |old(#length)| 1) (select |#length| 1)) (not (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1)) (= (select |#length| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|)) 1)))} is VALID [2022-02-20 23:38:37,817 INFO L290 TraceCheckUtils]: 21: Hoare triple {55092#(and (or (not (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) |old(~global~0.base)|)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0)) 0)) (or (= (select |old(#length)| 1) (select |#length| 1)) (not (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1)) (= (select |#length| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|)) 1)))} assume true; {55092#(and (or (not (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) |old(~global~0.base)|)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0)) 0)) (or (= (select |old(#length)| 1) (select |#length| 1)) (not (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1)) (= (select |#length| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|)) 1)))} is VALID [2022-02-20 23:38:37,818 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {55092#(and (or (not (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) |old(~global~0.base)|)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0)) 0)) (or (= (select |old(#length)| 1) (select |#length| 1)) (not (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1)) (= (select |#length| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|)) 1)))} {55054#(and (or (and (<= (+ (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) 3) (select |#length| 1)) (<= 0 (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0)) (<= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1)) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) ~global~0.base)) (= |~#commands~0.offset| 0))} #103#return; {55078#(and (= |~#commands~0.offset| 0) (or (and (<= 0 (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0)) (or (and (<= (+ (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) 3) (select |#length| 1)) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1)) (and (<= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) 0) (= (select |#length| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|)) 1)))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0)) 0)))} is VALID [2022-02-20 23:38:37,819 INFO L290 TraceCheckUtils]: 0: Hoare triple {55031#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(3, 1);call write~init~int(99, 1, 0, 1);call write~init~int(49, 1, 1, 1);call write~init~int(0, 1, 2, 1);call #Ultimate.allocInit(3, 2);call write~init~int(99, 2, 0, 1);call write~init~int(50, 2, 1, 1);call write~init~int(0, 2, 2, 1);call #Ultimate.allocInit(3, 3);call write~init~int(99, 3, 0, 1);call write~init~int(49, 3, 1, 1);call write~init~int(0, 3, 2, 1);call #Ultimate.allocInit(3, 4);call write~init~int(99, 4, 0, 1);call write~init~int(49, 4, 1, 1);call write~init~int(0, 4, 2, 1);call #Ultimate.allocInit(3, 5);call write~init~int(99, 5, 0, 1);call write~init~int(50, 5, 1, 1);call write~init~int(0, 5, 2, 1);~state~0 := ~unnamed3~0~STATE_1;~global~0.base, ~global~0.offset := 0, 0;~#commands~0.base, ~#commands~0.offset := 6, 0;call #Ultimate.allocInit(18, 6);call write~init~$Pointer$(1, 0, ~#commands~0.base, ~#commands~0.offset, 4);call write~init~$Pointer$(#funAddr~c1.base, #funAddr~c1.offset, ~#commands~0.base, 4 + ~#commands~0.offset, 4);call write~init~int((if ~unnamed3~0~STATE_1 % 256 <= 127 then ~unnamed3~0~STATE_1 % 256 else ~unnamed3~0~STATE_1 % 256 - 256), ~#commands~0.base, 8 + ~#commands~0.offset, 1);call write~init~$Pointer$(2, 0, ~#commands~0.base, 9 + ~#commands~0.offset, 4);call write~init~$Pointer$(#funAddr~c2.base, #funAddr~c2.offset, ~#commands~0.base, 13 + ~#commands~0.offset, 4);call write~init~int((if ~unnamed3~0~STATE_2 % 256 <= 127 then ~unnamed3~0~STATE_2 % 256 else ~unnamed3~0~STATE_2 % 256 - 256), ~#commands~0.base, 17 + ~#commands~0.offset, 1); {55033#(and (= 3 (select |#length| 1)) (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0) (= |~#commands~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1))} is VALID [2022-02-20 23:38:37,820 INFO L290 TraceCheckUtils]: 1: Hoare triple {55033#(and (= 3 (select |#length| 1)) (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0) (= |~#commands~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1))} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1; {55033#(and (= 3 (select |#length| 1)) (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0) (= |~#commands~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1))} is VALID [2022-02-20 23:38:37,820 INFO L272 TraceCheckUtils]: 2: Hoare triple {55033#(and (= 3 (select |#length| 1)) (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0) (= |~#commands~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1))} call parse_input(3, 0); {55082#(and (= ~global~0.base |old(~global~0.base)|) (= |old(#length)| |#length|) (= |old(~global~0.offset)| ~global~0.offset) (= ~state~0 |old(~state~0)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 23:38:37,821 INFO L290 TraceCheckUtils]: 3: Hoare triple {55082#(and (= ~global~0.base |old(~global~0.base)|) (= |old(#length)| |#length|) (= |old(~global~0.offset)| ~global~0.offset) (= ~state~0 |old(~state~0)|) (= |old(#valid)| |#valid|))} ~input#1.base, ~input#1.offset := #in~input#1.base, #in~input#1.offset;~i~0#1 := 0; {55083#(and (= (select |old(#length)| 1) (select |#length| 1)) (= |parse_input_~i~0#1| 0))} is VALID [2022-02-20 23:38:37,821 INFO L290 TraceCheckUtils]: 4: Hoare triple {55083#(and (= (select |old(#length)| 1) (select |#length| 1)) (= |parse_input_~i~0#1| 0))} assume !!(~i~0#1 < 2); {55083#(and (= (select |old(#length)| 1) (select |#length| 1)) (= |parse_input_~i~0#1| 0))} is VALID [2022-02-20 23:38:37,822 INFO L290 TraceCheckUtils]: 5: Hoare triple {55083#(and (= (select |old(#length)| 1) (select |#length| 1)) (= |parse_input_~i~0#1| 0))} SUMMARY for call #t~mem3#1.base, #t~mem3#1.offset := read~$Pointer$(~#commands~0.base, ~#commands~0.offset + 9 * ~i~0#1, 4); srcloc: L693 {55084#(and (or (not (= (+ (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) (* (- 1) |parse_input_~i~0#1|)) 0)) (and (= (select |old(#length)| 1) (select |#length| 1)) (= |parse_input_~i~0#1| 0))) (or (= |parse_input_~i~0#1| 0) (not (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|)))))} is VALID [2022-02-20 23:38:37,822 INFO L290 TraceCheckUtils]: 6: Hoare triple {55084#(and (or (not (= (+ (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) (* (- 1) |parse_input_~i~0#1|)) 0)) (and (= (select |old(#length)| 1) (select |#length| 1)) (= |parse_input_~i~0#1| 0))) (or (= |parse_input_~i~0#1| 0) (not (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|)))))} assume 1 == #valid[#t~mem3#1.base]; {55084#(and (or (not (= (+ (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) (* (- 1) |parse_input_~i~0#1|)) 0)) (and (= (select |old(#length)| 1) (select |#length| 1)) (= |parse_input_~i~0#1| 0))) (or (= |parse_input_~i~0#1| 0) (not (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|)))))} is VALID [2022-02-20 23:38:37,823 INFO L290 TraceCheckUtils]: 7: Hoare triple {55084#(and (or (not (= (+ (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) (* (- 1) |parse_input_~i~0#1|)) 0)) (and (= (select |old(#length)| 1) (select |#length| 1)) (= |parse_input_~i~0#1| 0))) (or (= |parse_input_~i~0#1| 0) (not (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|)))))} assume #t~mem3#1.offset < #length[#t~mem3#1.base] && #t~mem3#1.offset >= 0; {55084#(and (or (not (= (+ (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) (* (- 1) |parse_input_~i~0#1|)) 0)) (and (= (select |old(#length)| 1) (select |#length| 1)) (= |parse_input_~i~0#1| 0))) (or (= |parse_input_~i~0#1| 0) (not (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|)))))} is VALID [2022-02-20 23:38:37,823 INFO L290 TraceCheckUtils]: 8: Hoare triple {55084#(and (or (not (= (+ (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) (* (- 1) |parse_input_~i~0#1|)) 0)) (and (= (select |old(#length)| 1) (select |#length| 1)) (= |parse_input_~i~0#1| 0))) (or (= |parse_input_~i~0#1| 0) (not (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|)))))} assume 1 == #valid[~input#1.base]; {55084#(and (or (not (= (+ (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) (* (- 1) |parse_input_~i~0#1|)) 0)) (and (= (select |old(#length)| 1) (select |#length| 1)) (= |parse_input_~i~0#1| 0))) (or (= |parse_input_~i~0#1| 0) (not (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|)))))} is VALID [2022-02-20 23:38:37,824 INFO L290 TraceCheckUtils]: 9: Hoare triple {55084#(and (or (not (= (+ (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) (* (- 1) |parse_input_~i~0#1|)) 0)) (and (= (select |old(#length)| 1) (select |#length| 1)) (= |parse_input_~i~0#1| 0))) (or (= |parse_input_~i~0#1| 0) (not (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|)))))} assume ~input#1.offset < #length[~input#1.base] && ~input#1.offset >= 0; {55084#(and (or (not (= (+ (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) (* (- 1) |parse_input_~i~0#1|)) 0)) (and (= (select |old(#length)| 1) (select |#length| 1)) (= |parse_input_~i~0#1| 0))) (or (= |parse_input_~i~0#1| 0) (not (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|)))))} is VALID [2022-02-20 23:38:37,825 INFO L290 TraceCheckUtils]: 10: Hoare triple {55084#(and (or (not (= (+ (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) (* (- 1) |parse_input_~i~0#1|)) 0)) (and (= (select |old(#length)| 1) (select |#length| 1)) (= |parse_input_~i~0#1| 0))) (or (= |parse_input_~i~0#1| 0) (not (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|)))))} assume 0 == #t~nondet4#1;havoc #t~mem3#1.base, #t~mem3#1.offset;havoc #t~nondet4#1; {55084#(and (or (not (= (+ (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) (* (- 1) |parse_input_~i~0#1|)) 0)) (and (= (select |old(#length)| 1) (select |#length| 1)) (= |parse_input_~i~0#1| 0))) (or (= |parse_input_~i~0#1| 0) (not (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|)))))} is VALID [2022-02-20 23:38:37,825 INFO L290 TraceCheckUtils]: 11: Hoare triple {55084#(and (or (not (= (+ (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) (* (- 1) |parse_input_~i~0#1|)) 0)) (and (= (select |old(#length)| 1) (select |#length| 1)) (= |parse_input_~i~0#1| 0))) (or (= |parse_input_~i~0#1| 0) (not (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|)))))} SUMMARY for call #t~mem5#1 := read~int(~#commands~0.base, 8 + (~#commands~0.offset + 9 * ~i~0#1), 1); srcloc: L694 {55084#(and (or (not (= (+ (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) (* (- 1) |parse_input_~i~0#1|)) 0)) (and (= (select |old(#length)| 1) (select |#length| 1)) (= |parse_input_~i~0#1| 0))) (or (= |parse_input_~i~0#1| 0) (not (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|)))))} is VALID [2022-02-20 23:38:37,826 INFO L290 TraceCheckUtils]: 12: Hoare triple {55084#(and (or (not (= (+ (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) (* (- 1) |parse_input_~i~0#1|)) 0)) (and (= (select |old(#length)| 1) (select |#length| 1)) (= |parse_input_~i~0#1| 0))) (or (= |parse_input_~i~0#1| 0) (not (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|)))))} assume ~state~0 >= #t~mem5#1;havoc #t~mem5#1; {55084#(and (or (not (= (+ (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) (* (- 1) |parse_input_~i~0#1|)) 0)) (and (= (select |old(#length)| 1) (select |#length| 1)) (= |parse_input_~i~0#1| 0))) (or (= |parse_input_~i~0#1| 0) (not (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|)))))} is VALID [2022-02-20 23:38:37,826 INFO L290 TraceCheckUtils]: 13: Hoare triple {55084#(and (or (not (= (+ (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) (* (- 1) |parse_input_~i~0#1|)) 0)) (and (= (select |old(#length)| 1) (select |#length| 1)) (= |parse_input_~i~0#1| 0))) (or (= |parse_input_~i~0#1| 0) (not (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|)))))} SUMMARY for call #t~mem6#1.base, #t~mem6#1.offset := read~$Pointer$(~#commands~0.base, 4 + (~#commands~0.offset + 9 * ~i~0#1), 4); srcloc: L695 {55085#(or (= (select |old(#length)| 1) (select |#length| 1)) (not (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) 0)) (not (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|))))} is VALID [2022-02-20 23:38:37,827 INFO L290 TraceCheckUtils]: 14: Hoare triple {55085#(or (= (select |old(#length)| 1) (select |#length| 1)) (not (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) 0)) (not (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|))))} assume { :begin_inline_##fun~~TO~VOID } true;##fun~~TO~VOID_#in~#fp#1.base, ##fun~~TO~VOID_#in~#fp#1.offset := #t~mem6#1.base, #t~mem6#1.offset; {55085#(or (= (select |old(#length)| 1) (select |#length| 1)) (not (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) 0)) (not (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|))))} is VALID [2022-02-20 23:38:37,827 INFO L290 TraceCheckUtils]: 15: Hoare triple {55085#(or (= (select |old(#length)| 1) (select |#length| 1)) (not (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) 0)) (not (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|))))} assume !(##fun~~TO~VOID_#in~#fp#1.base == #funAddr~c2.base && ##fun~~TO~VOID_#in~#fp#1.offset == #funAddr~c2.offset);assume { :begin_inline_c1 } true;havoc c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset, c1_~x~0#1.base, c1_~x~0#1.offset;call c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset := #Ultimate.allocOnHeap(1);c1_~x~0#1.base, c1_~x~0#1.offset := c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset;havoc c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset; {55086#(or (= (select |old(#length)| 1) (select |#length| 1)) (= |parse_input_c1_~x~0#1.base| 1) (= (+ (- 3) (select |#length| 1)) 0) (not (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) 0)) (not (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|))))} is VALID [2022-02-20 23:38:37,828 INFO L290 TraceCheckUtils]: 16: Hoare triple {55086#(or (= (select |old(#length)| 1) (select |#length| 1)) (= |parse_input_c1_~x~0#1.base| 1) (= (+ (- 3) (select |#length| 1)) 0) (not (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) 0)) (not (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|))))} assume !(c1_~x~0#1.base == 0 && c1_~x~0#1.offset == 0); {55086#(or (= (select |old(#length)| 1) (select |#length| 1)) (= |parse_input_c1_~x~0#1.base| 1) (= (+ (- 3) (select |#length| 1)) 0) (not (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) 0)) (not (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|))))} is VALID [2022-02-20 23:38:37,828 INFO L290 TraceCheckUtils]: 17: Hoare triple {55086#(or (= (select |old(#length)| 1) (select |#length| 1)) (= |parse_input_c1_~x~0#1.base| 1) (= (+ (- 3) (select |#length| 1)) 0) (not (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) 0)) (not (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|))))} assume !(~global~0.base != 0 || ~global~0.offset != 0); {55086#(or (= (select |old(#length)| 1) (select |#length| 1)) (= |parse_input_c1_~x~0#1.base| 1) (= (+ (- 3) (select |#length| 1)) 0) (not (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) 0)) (not (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|))))} is VALID [2022-02-20 23:38:37,829 INFO L290 TraceCheckUtils]: 18: Hoare triple {55086#(or (= (select |old(#length)| 1) (select |#length| 1)) (= |parse_input_c1_~x~0#1.base| 1) (= (+ (- 3) (select |#length| 1)) 0) (not (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) 0)) (not (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|))))} ~global~0.base, ~global~0.offset := c1_~x~0#1.base, c1_~x~0#1.offset;~state~0 := ~unnamed3~0~STATE_2; {55087#(or (= (select |old(#length)| 1) (select |#length| 1)) (= (+ (- 3) (select |#length| 1)) 0) (not (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|))) (not (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) 0)) (not (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|))) (= ~global~0.base 1))} is VALID [2022-02-20 23:38:37,829 INFO L290 TraceCheckUtils]: 19: Hoare triple {55087#(or (= (select |old(#length)| 1) (select |#length| 1)) (= (+ (- 3) (select |#length| 1)) 0) (not (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|))) (not (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) 0)) (not (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|))) (= ~global~0.base 1))} assume { :end_inline_c1 } true; {55087#(or (= (select |old(#length)| 1) (select |#length| 1)) (= (+ (- 3) (select |#length| 1)) 0) (not (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|))) (not (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) 0)) (not (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|))) (= ~global~0.base 1))} is VALID [2022-02-20 23:38:37,830 INFO L290 TraceCheckUtils]: 20: Hoare triple {55087#(or (= (select |old(#length)| 1) (select |#length| 1)) (= (+ (- 3) (select |#length| 1)) 0) (not (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|))) (not (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) 0)) (not (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|))) (= ~global~0.base 1))} assume { :end_inline_##fun~~TO~VOID } true;havoc #t~mem6#1.base, #t~mem6#1.offset; {55087#(or (= (select |old(#length)| 1) (select |#length| 1)) (= (+ (- 3) (select |#length| 1)) 0) (not (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|))) (not (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) 0)) (not (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|))) (= ~global~0.base 1))} is VALID [2022-02-20 23:38:37,830 INFO L290 TraceCheckUtils]: 21: Hoare triple {55087#(or (= (select |old(#length)| 1) (select |#length| 1)) (= (+ (- 3) (select |#length| 1)) 0) (not (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|))) (not (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) 0)) (not (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|))) (= ~global~0.base 1))} assume true; {55087#(or (= (select |old(#length)| 1) (select |#length| 1)) (= (+ (- 3) (select |#length| 1)) 0) (not (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|))) (not (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) 0)) (not (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|))) (= ~global~0.base 1))} is VALID [2022-02-20 23:38:37,831 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {55087#(or (= (select |old(#length)| 1) (select |#length| 1)) (= (+ (- 3) (select |#length| 1)) 0) (not (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|))) (not (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) 0)) (not (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|))) (= ~global~0.base 1))} {55033#(and (= 3 (select |#length| 1)) (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0) (= |~#commands~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1))} #101#return; {55054#(and (or (and (<= (+ (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) 3) (select |#length| 1)) (<= 0 (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0)) (<= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1)) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) ~global~0.base)) (= |~#commands~0.offset| 0))} is VALID [2022-02-20 23:38:37,832 INFO L272 TraceCheckUtils]: 23: Hoare triple {55054#(and (or (and (<= (+ (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) 3) (select |#length| 1)) (<= 0 (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0)) (<= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1)) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) ~global~0.base)) (= |~#commands~0.offset| 0))} call parse_input(4, 0); {55082#(and (= ~global~0.base |old(~global~0.base)|) (= |old(#length)| |#length|) (= |old(~global~0.offset)| ~global~0.offset) (= ~state~0 |old(~state~0)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 23:38:37,833 INFO L290 TraceCheckUtils]: 24: Hoare triple {55082#(and (= ~global~0.base |old(~global~0.base)|) (= |old(#length)| |#length|) (= |old(~global~0.offset)| ~global~0.offset) (= ~state~0 |old(~state~0)|) (= |old(#valid)| |#valid|))} ~input#1.base, ~input#1.offset := #in~input#1.base, #in~input#1.offset;~i~0#1 := 0; {55088#(and (= ~global~0.base |old(~global~0.base)|) (= (select |old(#length)| 1) (select |#length| 1)))} is VALID [2022-02-20 23:38:37,833 INFO L290 TraceCheckUtils]: 25: Hoare triple {55088#(and (= ~global~0.base |old(~global~0.base)|) (= (select |old(#length)| 1) (select |#length| 1)))} assume !!(~i~0#1 < 2); {55088#(and (= ~global~0.base |old(~global~0.base)|) (= (select |old(#length)| 1) (select |#length| 1)))} is VALID [2022-02-20 23:38:37,833 INFO L290 TraceCheckUtils]: 26: Hoare triple {55088#(and (= ~global~0.base |old(~global~0.base)|) (= (select |old(#length)| 1) (select |#length| 1)))} SUMMARY for call #t~mem3#1.base, #t~mem3#1.offset := read~$Pointer$(~#commands~0.base, ~#commands~0.offset + 9 * ~i~0#1, 4); srcloc: L693 {55089#(and (= (select |old(#length)| 1) (select |#length| 1)) (or (= ~global~0.base |old(~global~0.base)|) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) ~global~0.base)))} is VALID [2022-02-20 23:38:37,834 INFO L290 TraceCheckUtils]: 27: Hoare triple {55089#(and (= (select |old(#length)| 1) (select |#length| 1)) (or (= ~global~0.base |old(~global~0.base)|) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) ~global~0.base)))} assume 1 == #valid[#t~mem3#1.base]; {55089#(and (= (select |old(#length)| 1) (select |#length| 1)) (or (= ~global~0.base |old(~global~0.base)|) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) ~global~0.base)))} is VALID [2022-02-20 23:38:37,834 INFO L290 TraceCheckUtils]: 28: Hoare triple {55089#(and (= (select |old(#length)| 1) (select |#length| 1)) (or (= ~global~0.base |old(~global~0.base)|) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) ~global~0.base)))} assume #t~mem3#1.offset < #length[#t~mem3#1.base] && #t~mem3#1.offset >= 0; {55089#(and (= (select |old(#length)| 1) (select |#length| 1)) (or (= ~global~0.base |old(~global~0.base)|) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) ~global~0.base)))} is VALID [2022-02-20 23:38:37,835 INFO L290 TraceCheckUtils]: 29: Hoare triple {55089#(and (= (select |old(#length)| 1) (select |#length| 1)) (or (= ~global~0.base |old(~global~0.base)|) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) ~global~0.base)))} assume 1 == #valid[~input#1.base]; {55089#(and (= (select |old(#length)| 1) (select |#length| 1)) (or (= ~global~0.base |old(~global~0.base)|) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) ~global~0.base)))} is VALID [2022-02-20 23:38:37,835 INFO L290 TraceCheckUtils]: 30: Hoare triple {55089#(and (= (select |old(#length)| 1) (select |#length| 1)) (or (= ~global~0.base |old(~global~0.base)|) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) ~global~0.base)))} assume ~input#1.offset < #length[~input#1.base] && ~input#1.offset >= 0; {55089#(and (= (select |old(#length)| 1) (select |#length| 1)) (or (= ~global~0.base |old(~global~0.base)|) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) ~global~0.base)))} is VALID [2022-02-20 23:38:37,838 INFO L290 TraceCheckUtils]: 31: Hoare triple {55089#(and (= (select |old(#length)| 1) (select |#length| 1)) (or (= ~global~0.base |old(~global~0.base)|) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) ~global~0.base)))} assume 0 == #t~nondet4#1;havoc #t~mem3#1.base, #t~mem3#1.offset;havoc #t~nondet4#1; {55089#(and (= (select |old(#length)| 1) (select |#length| 1)) (or (= ~global~0.base |old(~global~0.base)|) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) ~global~0.base)))} is VALID [2022-02-20 23:38:37,839 INFO L290 TraceCheckUtils]: 32: Hoare triple {55089#(and (= (select |old(#length)| 1) (select |#length| 1)) (or (= ~global~0.base |old(~global~0.base)|) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) ~global~0.base)))} SUMMARY for call #t~mem5#1 := read~int(~#commands~0.base, 8 + (~#commands~0.offset + 9 * ~i~0#1), 1); srcloc: L694 {55089#(and (= (select |old(#length)| 1) (select |#length| 1)) (or (= ~global~0.base |old(~global~0.base)|) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) ~global~0.base)))} is VALID [2022-02-20 23:38:37,839 INFO L290 TraceCheckUtils]: 33: Hoare triple {55089#(and (= (select |old(#length)| 1) (select |#length| 1)) (or (= ~global~0.base |old(~global~0.base)|) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) ~global~0.base)))} assume ~state~0 >= #t~mem5#1;havoc #t~mem5#1; {55089#(and (= (select |old(#length)| 1) (select |#length| 1)) (or (= ~global~0.base |old(~global~0.base)|) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) ~global~0.base)))} is VALID [2022-02-20 23:38:37,840 INFO L290 TraceCheckUtils]: 34: Hoare triple {55089#(and (= (select |old(#length)| 1) (select |#length| 1)) (or (= ~global~0.base |old(~global~0.base)|) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) ~global~0.base)))} SUMMARY for call #t~mem6#1.base, #t~mem6#1.offset := read~$Pointer$(~#commands~0.base, 4 + (~#commands~0.offset + 9 * ~i~0#1), 4); srcloc: L695 {55089#(and (= (select |old(#length)| 1) (select |#length| 1)) (or (= ~global~0.base |old(~global~0.base)|) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) ~global~0.base)))} is VALID [2022-02-20 23:38:37,840 INFO L290 TraceCheckUtils]: 35: Hoare triple {55089#(and (= (select |old(#length)| 1) (select |#length| 1)) (or (= ~global~0.base |old(~global~0.base)|) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) ~global~0.base)))} assume { :begin_inline_##fun~~TO~VOID } true;##fun~~TO~VOID_#in~#fp#1.base, ##fun~~TO~VOID_#in~#fp#1.offset := #t~mem6#1.base, #t~mem6#1.offset; {55089#(and (= (select |old(#length)| 1) (select |#length| 1)) (or (= ~global~0.base |old(~global~0.base)|) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) ~global~0.base)))} is VALID [2022-02-20 23:38:37,841 INFO L290 TraceCheckUtils]: 36: Hoare triple {55089#(and (= (select |old(#length)| 1) (select |#length| 1)) (or (= ~global~0.base |old(~global~0.base)|) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) ~global~0.base)))} assume !(##fun~~TO~VOID_#in~#fp#1.base == #funAddr~c2.base && ##fun~~TO~VOID_#in~#fp#1.offset == #funAddr~c2.offset);assume { :begin_inline_c1 } true;havoc c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset, c1_~x~0#1.base, c1_~x~0#1.offset;call c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset := #Ultimate.allocOnHeap(1);c1_~x~0#1.base, c1_~x~0#1.offset := c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset;havoc c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset; {55090#(and (or (= (select |old(#length)| 1) (select |#length| 1)) (= |parse_input_c1_~x~0#1.base| 1)) (or (= ~global~0.base |old(~global~0.base)|) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) ~global~0.base)) (or (not (= |parse_input_c1_~x~0#1.base| 1)) (not (= |parse_input_c1_~x~0#1.base| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|))) (= (select |#length| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|)) 1)))} is VALID [2022-02-20 23:38:37,841 INFO L290 TraceCheckUtils]: 37: Hoare triple {55090#(and (or (= (select |old(#length)| 1) (select |#length| 1)) (= |parse_input_c1_~x~0#1.base| 1)) (or (= ~global~0.base |old(~global~0.base)|) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) ~global~0.base)) (or (not (= |parse_input_c1_~x~0#1.base| 1)) (not (= |parse_input_c1_~x~0#1.base| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|))) (= (select |#length| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|)) 1)))} assume !(c1_~x~0#1.base == 0 && c1_~x~0#1.offset == 0); {55090#(and (or (= (select |old(#length)| 1) (select |#length| 1)) (= |parse_input_c1_~x~0#1.base| 1)) (or (= ~global~0.base |old(~global~0.base)|) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) ~global~0.base)) (or (not (= |parse_input_c1_~x~0#1.base| 1)) (not (= |parse_input_c1_~x~0#1.base| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|))) (= (select |#length| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|)) 1)))} is VALID [2022-02-20 23:38:37,842 INFO L290 TraceCheckUtils]: 38: Hoare triple {55090#(and (or (= (select |old(#length)| 1) (select |#length| 1)) (= |parse_input_c1_~x~0#1.base| 1)) (or (= ~global~0.base |old(~global~0.base)|) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) ~global~0.base)) (or (not (= |parse_input_c1_~x~0#1.base| 1)) (not (= |parse_input_c1_~x~0#1.base| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|))) (= (select |#length| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|)) 1)))} assume ~global~0.base != 0 || ~global~0.offset != 0; {55090#(and (or (= (select |old(#length)| 1) (select |#length| 1)) (= |parse_input_c1_~x~0#1.base| 1)) (or (= ~global~0.base |old(~global~0.base)|) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) ~global~0.base)) (or (not (= |parse_input_c1_~x~0#1.base| 1)) (not (= |parse_input_c1_~x~0#1.base| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|))) (= (select |#length| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|)) 1)))} is VALID [2022-02-20 23:38:37,842 INFO L290 TraceCheckUtils]: 39: Hoare triple {55090#(and (or (= (select |old(#length)| 1) (select |#length| 1)) (= |parse_input_c1_~x~0#1.base| 1)) (or (= ~global~0.base |old(~global~0.base)|) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) ~global~0.base)) (or (not (= |parse_input_c1_~x~0#1.base| 1)) (not (= |parse_input_c1_~x~0#1.base| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|))) (= (select |#length| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|)) 1)))} assume 0 == ~global~0.offset; {55090#(and (or (= (select |old(#length)| 1) (select |#length| 1)) (= |parse_input_c1_~x~0#1.base| 1)) (or (= ~global~0.base |old(~global~0.base)|) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) ~global~0.base)) (or (not (= |parse_input_c1_~x~0#1.base| 1)) (not (= |parse_input_c1_~x~0#1.base| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|))) (= (select |#length| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|)) 1)))} is VALID [2022-02-20 23:38:37,843 INFO L290 TraceCheckUtils]: 40: Hoare triple {55090#(and (or (= (select |old(#length)| 1) (select |#length| 1)) (= |parse_input_c1_~x~0#1.base| 1)) (or (= ~global~0.base |old(~global~0.base)|) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) ~global~0.base)) (or (not (= |parse_input_c1_~x~0#1.base| 1)) (not (= |parse_input_c1_~x~0#1.base| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|))) (= (select |#length| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|)) 1)))} assume ~global~0.base < #StackHeapBarrier; {55090#(and (or (= (select |old(#length)| 1) (select |#length| 1)) (= |parse_input_c1_~x~0#1.base| 1)) (or (= ~global~0.base |old(~global~0.base)|) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) ~global~0.base)) (or (not (= |parse_input_c1_~x~0#1.base| 1)) (not (= |parse_input_c1_~x~0#1.base| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|))) (= (select |#length| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|)) 1)))} is VALID [2022-02-20 23:38:37,843 INFO L290 TraceCheckUtils]: 41: Hoare triple {55090#(and (or (= (select |old(#length)| 1) (select |#length| 1)) (= |parse_input_c1_~x~0#1.base| 1)) (or (= ~global~0.base |old(~global~0.base)|) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) ~global~0.base)) (or (not (= |parse_input_c1_~x~0#1.base| 1)) (not (= |parse_input_c1_~x~0#1.base| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|))) (= (select |#length| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|)) 1)))} assume 0 == ~global~0.base || 1 == #valid[~global~0.base];call ULTIMATE.dealloc(~global~0.base, ~global~0.offset); {55091#(and (or (= (select |old(#length)| 1) (select |#length| 1)) (= |parse_input_c1_~x~0#1.base| 1)) (or (not (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) |old(~global~0.base)|)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0)) 0)) (or (not (= |parse_input_c1_~x~0#1.base| 1)) (not (= |parse_input_c1_~x~0#1.base| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|))) (= (select |#length| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|)) 1)))} is VALID [2022-02-20 23:38:37,844 INFO L290 TraceCheckUtils]: 42: Hoare triple {55091#(and (or (= (select |old(#length)| 1) (select |#length| 1)) (= |parse_input_c1_~x~0#1.base| 1)) (or (not (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) |old(~global~0.base)|)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0)) 0)) (or (not (= |parse_input_c1_~x~0#1.base| 1)) (not (= |parse_input_c1_~x~0#1.base| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|))) (= (select |#length| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|)) 1)))} ~global~0.base, ~global~0.offset := c1_~x~0#1.base, c1_~x~0#1.offset;~state~0 := ~unnamed3~0~STATE_2; {55092#(and (or (not (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) |old(~global~0.base)|)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0)) 0)) (or (= (select |old(#length)| 1) (select |#length| 1)) (not (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1)) (= (select |#length| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|)) 1)))} is VALID [2022-02-20 23:38:37,844 INFO L290 TraceCheckUtils]: 43: Hoare triple {55092#(and (or (not (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) |old(~global~0.base)|)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0)) 0)) (or (= (select |old(#length)| 1) (select |#length| 1)) (not (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1)) (= (select |#length| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|)) 1)))} assume { :end_inline_c1 } true; {55092#(and (or (not (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) |old(~global~0.base)|)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0)) 0)) (or (= (select |old(#length)| 1) (select |#length| 1)) (not (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1)) (= (select |#length| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|)) 1)))} is VALID [2022-02-20 23:38:37,845 INFO L290 TraceCheckUtils]: 44: Hoare triple {55092#(and (or (not (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) |old(~global~0.base)|)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0)) 0)) (or (= (select |old(#length)| 1) (select |#length| 1)) (not (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1)) (= (select |#length| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|)) 1)))} assume { :end_inline_##fun~~TO~VOID } true;havoc #t~mem6#1.base, #t~mem6#1.offset; {55092#(and (or (not (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) |old(~global~0.base)|)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0)) 0)) (or (= (select |old(#length)| 1) (select |#length| 1)) (not (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1)) (= (select |#length| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|)) 1)))} is VALID [2022-02-20 23:38:37,845 INFO L290 TraceCheckUtils]: 45: Hoare triple {55092#(and (or (not (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) |old(~global~0.base)|)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0)) 0)) (or (= (select |old(#length)| 1) (select |#length| 1)) (not (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1)) (= (select |#length| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|)) 1)))} assume true; {55092#(and (or (not (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) |old(~global~0.base)|)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0)) 0)) (or (= (select |old(#length)| 1) (select |#length| 1)) (not (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1)) (= (select |#length| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|)) 1)))} is VALID [2022-02-20 23:38:37,846 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {55092#(and (or (not (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) |old(~global~0.base)|)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0)) 0)) (or (= (select |old(#length)| 1) (select |#length| 1)) (not (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1)) (= (select |#length| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|)) 1)))} {55054#(and (or (and (<= (+ (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) 3) (select |#length| 1)) (<= 0 (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0)) (<= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) 0) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1)) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0) ~global~0.base)) (= |~#commands~0.offset| 0))} #103#return; {55078#(and (= |~#commands~0.offset| 0) (or (and (<= 0 (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0)) (or (and (<= (+ (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) 3) (select |#length| 1)) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1)) (and (<= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) 0) (= (select |#length| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|)) 1)))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0)) 0)))} is VALID [2022-02-20 23:38:37,847 INFO L272 TraceCheckUtils]: 47: Hoare triple {55078#(and (= |~#commands~0.offset| 0) (or (and (<= 0 (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0)) (or (and (<= (+ (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) 3) (select |#length| 1)) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1)) (and (<= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) 0) (= (select |#length| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|)) 1)))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0)) 0)))} call parse_input(5, 0); {55078#(and (= |~#commands~0.offset| 0) (or (and (<= 0 (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0)) (or (and (<= (+ (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) 3) (select |#length| 1)) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1)) (and (<= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) 0) (= (select |#length| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|)) 1)))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0)) 0)))} is VALID [2022-02-20 23:38:37,848 INFO L290 TraceCheckUtils]: 48: Hoare triple {55078#(and (= |~#commands~0.offset| 0) (or (and (<= 0 (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0)) (or (and (<= (+ (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) 3) (select |#length| 1)) (= (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|) 1)) (and (<= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) 0) 0) (= (select |#length| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|)) 1)))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) 0)) 0)))} ~input#1.base, ~input#1.offset := #in~input#1.base, #in~input#1.offset;~i~0#1 := 0; {55079#(and (or (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset|))) 0) (and (or (and (= (select |#length| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|)) 1) (<= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset|)) 0)) (and (= 1 (select (select |#memory_$Pointer$.base| |~#commands~0.base|) (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset|))) (<= (+ (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset|)) 3) (select |#length| 1)))) (<= 0 (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset|))))) (= (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset|) 0) (= |parse_input_~i~0#1| 0))} is VALID [2022-02-20 23:38:37,848 INFO L290 TraceCheckUtils]: 49: Hoare triple {55079#(and (or (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset|))) 0) (and (or (and (= (select |#length| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|)) 1) (<= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset|)) 0)) (and (= 1 (select (select |#memory_$Pointer$.base| |~#commands~0.base|) (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset|))) (<= (+ (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset|)) 3) (select |#length| 1)))) (<= 0 (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset|))))) (= (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset|) 0) (= |parse_input_~i~0#1| 0))} assume !!(~i~0#1 < 2); {55079#(and (or (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset|))) 0) (and (or (and (= (select |#length| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|)) 1) (<= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset|)) 0)) (and (= 1 (select (select |#memory_$Pointer$.base| |~#commands~0.base|) (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset|))) (<= (+ (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset|)) 3) (select |#length| 1)))) (<= 0 (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset|))))) (= (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset|) 0) (= |parse_input_~i~0#1| 0))} is VALID [2022-02-20 23:38:37,849 INFO L290 TraceCheckUtils]: 50: Hoare triple {55079#(and (or (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset|))) 0) (and (or (and (= (select |#length| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|)) 1) (<= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset|)) 0)) (and (= 1 (select (select |#memory_$Pointer$.base| |~#commands~0.base|) (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset|))) (<= (+ (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset|)) 3) (select |#length| 1)))) (<= 0 (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset|))))) (= (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset|) 0) (= |parse_input_~i~0#1| 0))} SUMMARY for call #t~mem3#1.base, #t~mem3#1.offset := read~$Pointer$(~#commands~0.base, ~#commands~0.offset + 9 * ~i~0#1, 4); srcloc: L693 {55080#(or (= (select |#valid| |parse_input_#t~mem3#1.base|) 0) (and (<= 0 |parse_input_#t~mem3#1.offset|) (or (and (= (select |#length| |parse_input_#t~mem3#1.base|) 1) (<= |parse_input_#t~mem3#1.offset| 0)) (<= (+ |parse_input_#t~mem3#1.offset| 3) (select |#length| |parse_input_#t~mem3#1.base|)))))} is VALID [2022-02-20 23:38:37,850 INFO L290 TraceCheckUtils]: 51: Hoare triple {55080#(or (= (select |#valid| |parse_input_#t~mem3#1.base|) 0) (and (<= 0 |parse_input_#t~mem3#1.offset|) (or (and (= (select |#length| |parse_input_#t~mem3#1.base|) 1) (<= |parse_input_#t~mem3#1.offset| 0)) (<= (+ |parse_input_#t~mem3#1.offset| 3) (select |#length| |parse_input_#t~mem3#1.base|)))))} assume 1 == #valid[#t~mem3#1.base]; {55081#(and (<= 0 |parse_input_#t~mem3#1.offset|) (or (and (= (select |#length| |parse_input_#t~mem3#1.base|) 1) (<= |parse_input_#t~mem3#1.offset| 0)) (<= (+ |parse_input_#t~mem3#1.offset| 3) (select |#length| |parse_input_#t~mem3#1.base|))))} is VALID [2022-02-20 23:38:37,850 INFO L290 TraceCheckUtils]: 52: Hoare triple {55081#(and (<= 0 |parse_input_#t~mem3#1.offset|) (or (and (= (select |#length| |parse_input_#t~mem3#1.base|) 1) (<= |parse_input_#t~mem3#1.offset| 0)) (<= (+ |parse_input_#t~mem3#1.offset| 3) (select |#length| |parse_input_#t~mem3#1.base|))))} assume !(#t~mem3#1.offset < #length[#t~mem3#1.base] && #t~mem3#1.offset >= 0); {55032#false} is VALID [2022-02-20 23:38:37,851 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 5 proven. 24 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-20 23:38:37,851 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:38:37,851 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408237125] [2022-02-20 23:38:37,851 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1408237125] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 23:38:37,851 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1040629069] [2022-02-20 23:38:37,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:38:37,851 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:38:37,851 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:38:37,852 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 23:38:37,853 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2022-02-20 23:38:37,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:38:37,922 INFO L263 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 24 conjunts are in the unsatisfiable core [2022-02-20 23:38:37,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:38:37,946 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:38:38,299 INFO L356 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-02-20 23:38:38,300 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2022-02-20 23:38:38,335 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-02-20 23:38:38,535 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-02-20 23:38:38,553 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-02-20 23:38:38,581 INFO L290 TraceCheckUtils]: 0: Hoare triple {55031#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(3, 1);call write~init~int(99, 1, 0, 1);call write~init~int(49, 1, 1, 1);call write~init~int(0, 1, 2, 1);call #Ultimate.allocInit(3, 2);call write~init~int(99, 2, 0, 1);call write~init~int(50, 2, 1, 1);call write~init~int(0, 2, 2, 1);call #Ultimate.allocInit(3, 3);call write~init~int(99, 3, 0, 1);call write~init~int(49, 3, 1, 1);call write~init~int(0, 3, 2, 1);call #Ultimate.allocInit(3, 4);call write~init~int(99, 4, 0, 1);call write~init~int(49, 4, 1, 1);call write~init~int(0, 4, 2, 1);call #Ultimate.allocInit(3, 5);call write~init~int(99, 5, 0, 1);call write~init~int(50, 5, 1, 1);call write~init~int(0, 5, 2, 1);~state~0 := ~unnamed3~0~STATE_1;~global~0.base, ~global~0.offset := 0, 0;~#commands~0.base, ~#commands~0.offset := 6, 0;call #Ultimate.allocInit(18, 6);call write~init~$Pointer$(1, 0, ~#commands~0.base, ~#commands~0.offset, 4);call write~init~$Pointer$(#funAddr~c1.base, #funAddr~c1.offset, ~#commands~0.base, 4 + ~#commands~0.offset, 4);call write~init~int((if ~unnamed3~0~STATE_1 % 256 <= 127 then ~unnamed3~0~STATE_1 % 256 else ~unnamed3~0~STATE_1 % 256 - 256), ~#commands~0.base, 8 + ~#commands~0.offset, 1);call write~init~$Pointer$(2, 0, ~#commands~0.base, 9 + ~#commands~0.offset, 4);call write~init~$Pointer$(#funAddr~c2.base, #funAddr~c2.offset, ~#commands~0.base, 13 + ~#commands~0.offset, 4);call write~init~int((if ~unnamed3~0~STATE_2 % 256 <= 127 then ~unnamed3~0~STATE_2 % 256 else ~unnamed3~0~STATE_2 % 256 - 256), ~#commands~0.base, 17 + ~#commands~0.offset, 1); {55096#(and (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0) (= |~#commands~0.offset| 0))} is VALID [2022-02-20 23:38:38,581 INFO L290 TraceCheckUtils]: 1: Hoare triple {55096#(and (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0) (= |~#commands~0.offset| 0))} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1; {55096#(and (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0) (= |~#commands~0.offset| 0))} is VALID [2022-02-20 23:38:38,582 INFO L272 TraceCheckUtils]: 2: Hoare triple {55096#(and (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0) (= |~#commands~0.offset| 0))} call parse_input(3, 0); {55096#(and (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0) (= |~#commands~0.offset| 0))} is VALID [2022-02-20 23:38:38,582 INFO L290 TraceCheckUtils]: 3: Hoare triple {55096#(and (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0) (= |~#commands~0.offset| 0))} ~input#1.base, ~input#1.offset := #in~input#1.base, #in~input#1.offset;~i~0#1 := 0; {55096#(and (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0) (= |~#commands~0.offset| 0))} is VALID [2022-02-20 23:38:38,583 INFO L290 TraceCheckUtils]: 4: Hoare triple {55096#(and (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0) (= |~#commands~0.offset| 0))} assume !!(~i~0#1 < 2); {55096#(and (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0) (= |~#commands~0.offset| 0))} is VALID [2022-02-20 23:38:38,583 INFO L290 TraceCheckUtils]: 5: Hoare triple {55096#(and (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0) (= |~#commands~0.offset| 0))} SUMMARY for call #t~mem3#1.base, #t~mem3#1.offset := read~$Pointer$(~#commands~0.base, ~#commands~0.offset + 9 * ~i~0#1, 4); srcloc: L693 {55096#(and (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0) (= |~#commands~0.offset| 0))} is VALID [2022-02-20 23:38:38,583 INFO L290 TraceCheckUtils]: 6: Hoare triple {55096#(and (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0) (= |~#commands~0.offset| 0))} assume 1 == #valid[#t~mem3#1.base]; {55096#(and (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0) (= |~#commands~0.offset| 0))} is VALID [2022-02-20 23:38:38,584 INFO L290 TraceCheckUtils]: 7: Hoare triple {55096#(and (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0) (= |~#commands~0.offset| 0))} assume #t~mem3#1.offset < #length[#t~mem3#1.base] && #t~mem3#1.offset >= 0; {55096#(and (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0) (= |~#commands~0.offset| 0))} is VALID [2022-02-20 23:38:38,584 INFO L290 TraceCheckUtils]: 8: Hoare triple {55096#(and (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0) (= |~#commands~0.offset| 0))} assume 1 == #valid[~input#1.base]; {55096#(and (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0) (= |~#commands~0.offset| 0))} is VALID [2022-02-20 23:38:38,584 INFO L290 TraceCheckUtils]: 9: Hoare triple {55096#(and (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0) (= |~#commands~0.offset| 0))} assume ~input#1.offset < #length[~input#1.base] && ~input#1.offset >= 0; {55096#(and (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0) (= |~#commands~0.offset| 0))} is VALID [2022-02-20 23:38:38,585 INFO L290 TraceCheckUtils]: 10: Hoare triple {55096#(and (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0) (= |~#commands~0.offset| 0))} assume 0 == #t~nondet4#1;havoc #t~mem3#1.base, #t~mem3#1.offset;havoc #t~nondet4#1; {55096#(and (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0) (= |~#commands~0.offset| 0))} is VALID [2022-02-20 23:38:38,585 INFO L290 TraceCheckUtils]: 11: Hoare triple {55096#(and (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0) (= |~#commands~0.offset| 0))} SUMMARY for call #t~mem5#1 := read~int(~#commands~0.base, 8 + (~#commands~0.offset + 9 * ~i~0#1), 1); srcloc: L694 {55096#(and (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0) (= |~#commands~0.offset| 0))} is VALID [2022-02-20 23:38:38,585 INFO L290 TraceCheckUtils]: 12: Hoare triple {55096#(and (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0) (= |~#commands~0.offset| 0))} assume ~state~0 >= #t~mem5#1;havoc #t~mem5#1; {55096#(and (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0) (= |~#commands~0.offset| 0))} is VALID [2022-02-20 23:38:38,586 INFO L290 TraceCheckUtils]: 13: Hoare triple {55096#(and (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0) (= |~#commands~0.offset| 0))} SUMMARY for call #t~mem6#1.base, #t~mem6#1.offset := read~$Pointer$(~#commands~0.base, 4 + (~#commands~0.offset + 9 * ~i~0#1), 4); srcloc: L695 {55096#(and (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0) (= |~#commands~0.offset| 0))} is VALID [2022-02-20 23:38:38,586 INFO L290 TraceCheckUtils]: 14: Hoare triple {55096#(and (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0) (= |~#commands~0.offset| 0))} assume { :begin_inline_##fun~~TO~VOID } true;##fun~~TO~VOID_#in~#fp#1.base, ##fun~~TO~VOID_#in~#fp#1.offset := #t~mem6#1.base, #t~mem6#1.offset; {55096#(and (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0) (= |~#commands~0.offset| 0))} is VALID [2022-02-20 23:38:38,587 INFO L290 TraceCheckUtils]: 15: Hoare triple {55096#(and (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0) (= |~#commands~0.offset| 0))} assume !(##fun~~TO~VOID_#in~#fp#1.base == #funAddr~c2.base && ##fun~~TO~VOID_#in~#fp#1.offset == #funAddr~c2.offset);assume { :begin_inline_c1 } true;havoc c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset, c1_~x~0#1.base, c1_~x~0#1.offset;call c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset := #Ultimate.allocOnHeap(1);c1_~x~0#1.base, c1_~x~0#1.offset := c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset;havoc c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset; {55096#(and (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0) (= |~#commands~0.offset| 0))} is VALID [2022-02-20 23:38:38,587 INFO L290 TraceCheckUtils]: 16: Hoare triple {55096#(and (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0) (= |~#commands~0.offset| 0))} assume !(c1_~x~0#1.base == 0 && c1_~x~0#1.offset == 0); {55096#(and (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0) (= |~#commands~0.offset| 0))} is VALID [2022-02-20 23:38:38,587 INFO L290 TraceCheckUtils]: 17: Hoare triple {55096#(and (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0) (= |~#commands~0.offset| 0))} assume !(~global~0.base != 0 || ~global~0.offset != 0); {55096#(and (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0) (= |~#commands~0.offset| 0))} is VALID [2022-02-20 23:38:38,588 INFO L290 TraceCheckUtils]: 18: Hoare triple {55096#(and (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0) (= |~#commands~0.offset| 0))} ~global~0.base, ~global~0.offset := c1_~x~0#1.base, c1_~x~0#1.offset;~state~0 := ~unnamed3~0~STATE_2; {55096#(and (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0) (= |~#commands~0.offset| 0))} is VALID [2022-02-20 23:38:38,588 INFO L290 TraceCheckUtils]: 19: Hoare triple {55096#(and (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0) (= |~#commands~0.offset| 0))} assume { :end_inline_c1 } true; {55096#(and (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0) (= |~#commands~0.offset| 0))} is VALID [2022-02-20 23:38:38,591 INFO L290 TraceCheckUtils]: 20: Hoare triple {55096#(and (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0) (= |~#commands~0.offset| 0))} assume { :end_inline_##fun~~TO~VOID } true;havoc #t~mem6#1.base, #t~mem6#1.offset; {55096#(and (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0) (= |~#commands~0.offset| 0))} is VALID [2022-02-20 23:38:38,591 INFO L290 TraceCheckUtils]: 21: Hoare triple {55096#(and (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0) (= |~#commands~0.offset| 0))} assume true; {55096#(and (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0) (= |~#commands~0.offset| 0))} is VALID [2022-02-20 23:38:38,591 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {55096#(and (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0) (= |~#commands~0.offset| 0))} {55096#(and (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0) (= |~#commands~0.offset| 0))} #101#return; {55096#(and (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0) (= |~#commands~0.offset| 0))} is VALID [2022-02-20 23:38:38,592 INFO L272 TraceCheckUtils]: 23: Hoare triple {55096#(and (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0) (= |~#commands~0.offset| 0))} call parse_input(4, 0); {55096#(and (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0) (= |~#commands~0.offset| 0))} is VALID [2022-02-20 23:38:38,592 INFO L290 TraceCheckUtils]: 24: Hoare triple {55096#(and (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0) (= |~#commands~0.offset| 0))} ~input#1.base, ~input#1.offset := #in~input#1.base, #in~input#1.offset;~i~0#1 := 0; {55169#(and (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0) (= |~#commands~0.offset| 0) (= |parse_input_~i~0#1| 0))} is VALID [2022-02-20 23:38:38,592 INFO L290 TraceCheckUtils]: 25: Hoare triple {55169#(and (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0) (= |~#commands~0.offset| 0) (= |parse_input_~i~0#1| 0))} assume !!(~i~0#1 < 2); {55169#(and (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0) (= |~#commands~0.offset| 0) (= |parse_input_~i~0#1| 0))} is VALID [2022-02-20 23:38:38,593 INFO L290 TraceCheckUtils]: 26: Hoare triple {55169#(and (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0) (= |~#commands~0.offset| 0) (= |parse_input_~i~0#1| 0))} SUMMARY for call #t~mem3#1.base, #t~mem3#1.offset := read~$Pointer$(~#commands~0.base, ~#commands~0.offset + 9 * ~i~0#1, 4); srcloc: L693 {55176#(and (= |parse_input_#t~mem3#1.base| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|)) (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0) (= |~#commands~0.offset| 0))} is VALID [2022-02-20 23:38:38,593 INFO L290 TraceCheckUtils]: 27: Hoare triple {55176#(and (= |parse_input_#t~mem3#1.base| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|)) (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0) (= |~#commands~0.offset| 0))} assume 1 == #valid[#t~mem3#1.base]; {55180#(and (= |parse_input_#t~mem3#1.base| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|)) (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0) (= (select |#valid| |parse_input_#t~mem3#1.base|) 1) (= |~#commands~0.offset| 0))} is VALID [2022-02-20 23:38:38,594 INFO L290 TraceCheckUtils]: 28: Hoare triple {55180#(and (= |parse_input_#t~mem3#1.base| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|)) (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0) (= (select |#valid| |parse_input_#t~mem3#1.base|) 1) (= |~#commands~0.offset| 0))} assume #t~mem3#1.offset < #length[#t~mem3#1.base] && #t~mem3#1.offset >= 0; {55184#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|)) 1) (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0) (= |~#commands~0.offset| 0) (< 0 (select |#length| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|))))} is VALID [2022-02-20 23:38:38,594 INFO L290 TraceCheckUtils]: 29: Hoare triple {55184#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|)) 1) (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0) (= |~#commands~0.offset| 0) (< 0 (select |#length| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|))))} assume 1 == #valid[~input#1.base]; {55184#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|)) 1) (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0) (= |~#commands~0.offset| 0) (< 0 (select |#length| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|))))} is VALID [2022-02-20 23:38:38,595 INFO L290 TraceCheckUtils]: 30: Hoare triple {55184#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|)) 1) (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0) (= |~#commands~0.offset| 0) (< 0 (select |#length| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|))))} assume ~input#1.offset < #length[~input#1.base] && ~input#1.offset >= 0; {55184#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|)) 1) (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0) (= |~#commands~0.offset| 0) (< 0 (select |#length| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|))))} is VALID [2022-02-20 23:38:38,595 INFO L290 TraceCheckUtils]: 31: Hoare triple {55184#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|)) 1) (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0) (= |~#commands~0.offset| 0) (< 0 (select |#length| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|))))} assume 0 == #t~nondet4#1;havoc #t~mem3#1.base, #t~mem3#1.offset;havoc #t~nondet4#1; {55184#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|)) 1) (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0) (= |~#commands~0.offset| 0) (< 0 (select |#length| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|))))} is VALID [2022-02-20 23:38:38,596 INFO L290 TraceCheckUtils]: 32: Hoare triple {55184#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|)) 1) (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0) (= |~#commands~0.offset| 0) (< 0 (select |#length| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|))))} SUMMARY for call #t~mem5#1 := read~int(~#commands~0.base, 8 + (~#commands~0.offset + 9 * ~i~0#1), 1); srcloc: L694 {55184#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|)) 1) (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0) (= |~#commands~0.offset| 0) (< 0 (select |#length| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|))))} is VALID [2022-02-20 23:38:38,596 INFO L290 TraceCheckUtils]: 33: Hoare triple {55184#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|)) 1) (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0) (= |~#commands~0.offset| 0) (< 0 (select |#length| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|))))} assume ~state~0 >= #t~mem5#1;havoc #t~mem5#1; {55184#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|)) 1) (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0) (= |~#commands~0.offset| 0) (< 0 (select |#length| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|))))} is VALID [2022-02-20 23:38:38,597 INFO L290 TraceCheckUtils]: 34: Hoare triple {55184#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|)) 1) (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0) (= |~#commands~0.offset| 0) (< 0 (select |#length| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|))))} SUMMARY for call #t~mem6#1.base, #t~mem6#1.offset := read~$Pointer$(~#commands~0.base, 4 + (~#commands~0.offset + 9 * ~i~0#1), 4); srcloc: L695 {55184#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|)) 1) (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0) (= |~#commands~0.offset| 0) (< 0 (select |#length| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|))))} is VALID [2022-02-20 23:38:38,597 INFO L290 TraceCheckUtils]: 35: Hoare triple {55184#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|)) 1) (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0) (= |~#commands~0.offset| 0) (< 0 (select |#length| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|))))} assume { :begin_inline_##fun~~TO~VOID } true;##fun~~TO~VOID_#in~#fp#1.base, ##fun~~TO~VOID_#in~#fp#1.offset := #t~mem6#1.base, #t~mem6#1.offset; {55184#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|)) 1) (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0) (= |~#commands~0.offset| 0) (< 0 (select |#length| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|))))} is VALID [2022-02-20 23:38:38,598 INFO L290 TraceCheckUtils]: 36: Hoare triple {55184#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|)) 1) (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0) (= |~#commands~0.offset| 0) (< 0 (select |#length| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|))))} assume !(##fun~~TO~VOID_#in~#fp#1.base == #funAddr~c2.base && ##fun~~TO~VOID_#in~#fp#1.offset == #funAddr~c2.offset);assume { :begin_inline_c1 } true;havoc c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset, c1_~x~0#1.base, c1_~x~0#1.offset;call c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset := #Ultimate.allocOnHeap(1);c1_~x~0#1.base, c1_~x~0#1.offset := c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset;havoc c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset; {55209#(and (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0) (= |~#commands~0.offset| 0) (< 0 (select |#length| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|))))} is VALID [2022-02-20 23:38:38,598 INFO L290 TraceCheckUtils]: 37: Hoare triple {55209#(and (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0) (= |~#commands~0.offset| 0) (< 0 (select |#length| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|))))} assume !(c1_~x~0#1.base == 0 && c1_~x~0#1.offset == 0); {55209#(and (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0) (= |~#commands~0.offset| 0) (< 0 (select |#length| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|))))} is VALID [2022-02-20 23:38:38,599 INFO L290 TraceCheckUtils]: 38: Hoare triple {55209#(and (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0) (= |~#commands~0.offset| 0) (< 0 (select |#length| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|))))} assume ~global~0.base != 0 || ~global~0.offset != 0; {55209#(and (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0) (= |~#commands~0.offset| 0) (< 0 (select |#length| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|))))} is VALID [2022-02-20 23:38:38,599 INFO L290 TraceCheckUtils]: 39: Hoare triple {55209#(and (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0) (= |~#commands~0.offset| 0) (< 0 (select |#length| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|))))} assume 0 == ~global~0.offset; {55209#(and (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0) (= |~#commands~0.offset| 0) (< 0 (select |#length| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|))))} is VALID [2022-02-20 23:38:38,600 INFO L290 TraceCheckUtils]: 40: Hoare triple {55209#(and (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0) (= |~#commands~0.offset| 0) (< 0 (select |#length| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|))))} assume ~global~0.base < #StackHeapBarrier; {55209#(and (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0) (= |~#commands~0.offset| 0) (< 0 (select |#length| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|))))} is VALID [2022-02-20 23:38:38,600 INFO L290 TraceCheckUtils]: 41: Hoare triple {55209#(and (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0) (= |~#commands~0.offset| 0) (< 0 (select |#length| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|))))} assume 0 == ~global~0.base || 1 == #valid[~global~0.base];call ULTIMATE.dealloc(~global~0.base, ~global~0.offset); {55209#(and (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0) (= |~#commands~0.offset| 0) (< 0 (select |#length| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|))))} is VALID [2022-02-20 23:38:38,600 INFO L290 TraceCheckUtils]: 42: Hoare triple {55209#(and (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0) (= |~#commands~0.offset| 0) (< 0 (select |#length| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|))))} ~global~0.base, ~global~0.offset := c1_~x~0#1.base, c1_~x~0#1.offset;~state~0 := ~unnamed3~0~STATE_2; {55209#(and (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0) (= |~#commands~0.offset| 0) (< 0 (select |#length| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|))))} is VALID [2022-02-20 23:38:38,603 INFO L290 TraceCheckUtils]: 43: Hoare triple {55209#(and (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0) (= |~#commands~0.offset| 0) (< 0 (select |#length| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|))))} assume { :end_inline_c1 } true; {55209#(and (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0) (= |~#commands~0.offset| 0) (< 0 (select |#length| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|))))} is VALID [2022-02-20 23:38:38,603 INFO L290 TraceCheckUtils]: 44: Hoare triple {55209#(and (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0) (= |~#commands~0.offset| 0) (< 0 (select |#length| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|))))} assume { :end_inline_##fun~~TO~VOID } true;havoc #t~mem6#1.base, #t~mem6#1.offset; {55209#(and (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0) (= |~#commands~0.offset| 0) (< 0 (select |#length| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|))))} is VALID [2022-02-20 23:38:38,603 INFO L290 TraceCheckUtils]: 45: Hoare triple {55209#(and (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0) (= |~#commands~0.offset| 0) (< 0 (select |#length| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|))))} assume true; {55209#(and (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0) (= |~#commands~0.offset| 0) (< 0 (select |#length| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|))))} is VALID [2022-02-20 23:38:38,604 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {55209#(and (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0) (= |~#commands~0.offset| 0) (< 0 (select |#length| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|))))} {55096#(and (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0) (= |~#commands~0.offset| 0))} #103#return; {55209#(and (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0) (= |~#commands~0.offset| 0) (< 0 (select |#length| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|))))} is VALID [2022-02-20 23:38:38,604 INFO L272 TraceCheckUtils]: 47: Hoare triple {55209#(and (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0) (= |~#commands~0.offset| 0) (< 0 (select |#length| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|))))} call parse_input(5, 0); {55209#(and (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0) (= |~#commands~0.offset| 0) (< 0 (select |#length| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|))))} is VALID [2022-02-20 23:38:38,605 INFO L290 TraceCheckUtils]: 48: Hoare triple {55209#(and (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0) (= |~#commands~0.offset| 0) (< 0 (select |#length| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|))))} ~input#1.base, ~input#1.offset := #in~input#1.base, #in~input#1.offset;~i~0#1 := 0; {55246#(and (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0) (= |~#commands~0.offset| 0) (= |parse_input_~i~0#1| 0) (< 0 (select |#length| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|))))} is VALID [2022-02-20 23:38:38,605 INFO L290 TraceCheckUtils]: 49: Hoare triple {55246#(and (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0) (= |~#commands~0.offset| 0) (= |parse_input_~i~0#1| 0) (< 0 (select |#length| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|))))} assume !!(~i~0#1 < 2); {55246#(and (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0) (= |~#commands~0.offset| 0) (= |parse_input_~i~0#1| 0) (< 0 (select |#length| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|))))} is VALID [2022-02-20 23:38:38,606 INFO L290 TraceCheckUtils]: 50: Hoare triple {55246#(and (= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0) (= |~#commands~0.offset| 0) (= |parse_input_~i~0#1| 0) (< 0 (select |#length| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|))))} SUMMARY for call #t~mem3#1.base, #t~mem3#1.offset := read~$Pointer$(~#commands~0.base, ~#commands~0.offset + 9 * ~i~0#1, 4); srcloc: L693 {55253#(and (< 0 (select |#length| |parse_input_#t~mem3#1.base|)) (= |parse_input_#t~mem3#1.offset| 0))} is VALID [2022-02-20 23:38:38,606 INFO L290 TraceCheckUtils]: 51: Hoare triple {55253#(and (< 0 (select |#length| |parse_input_#t~mem3#1.base|)) (= |parse_input_#t~mem3#1.offset| 0))} assume 1 == #valid[#t~mem3#1.base]; {55253#(and (< 0 (select |#length| |parse_input_#t~mem3#1.base|)) (= |parse_input_#t~mem3#1.offset| 0))} is VALID [2022-02-20 23:38:38,606 INFO L290 TraceCheckUtils]: 52: Hoare triple {55253#(and (< 0 (select |#length| |parse_input_#t~mem3#1.base|)) (= |parse_input_#t~mem3#1.offset| 0))} assume !(#t~mem3#1.offset < #length[#t~mem3#1.base] && #t~mem3#1.offset >= 0); {55032#false} is VALID [2022-02-20 23:38:38,607 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 25 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-20 23:38:38,607 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:38:38,939 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-20 23:38:38,943 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 19 [2022-02-20 23:38:38,960 INFO L356 Elim1Store]: treesize reduction 5, result has 58.3 percent of original size [2022-02-20 23:38:38,960 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 16 [2022-02-20 23:38:39,647 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-20 23:38:39,648 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 47 [2022-02-20 23:38:39,805 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-02-20 23:38:39,805 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2022-02-20 23:38:39,855 INFO L356 Elim1Store]: treesize reduction 7, result has 41.7 percent of original size [2022-02-20 23:38:39,856 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 9 [2022-02-20 23:38:39,938 INFO L290 TraceCheckUtils]: 52: Hoare triple {55260#(and (< |parse_input_#t~mem3#1.offset| (select |#length| |parse_input_#t~mem3#1.base|)) (<= 0 |parse_input_#t~mem3#1.offset|))} assume !(#t~mem3#1.offset < #length[#t~mem3#1.base] && #t~mem3#1.offset >= 0); {55032#false} is VALID [2022-02-20 23:38:39,938 INFO L290 TraceCheckUtils]: 51: Hoare triple {55260#(and (< |parse_input_#t~mem3#1.offset| (select |#length| |parse_input_#t~mem3#1.base|)) (<= 0 |parse_input_#t~mem3#1.offset|))} assume 1 == #valid[#t~mem3#1.base]; {55260#(and (< |parse_input_#t~mem3#1.offset| (select |#length| |parse_input_#t~mem3#1.base|)) (<= 0 |parse_input_#t~mem3#1.offset|))} is VALID [2022-02-20 23:38:39,939 INFO L290 TraceCheckUtils]: 50: Hoare triple {55267#(and (<= 0 (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset|))) (< (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset|)) (select |#length| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset|)))))} SUMMARY for call #t~mem3#1.base, #t~mem3#1.offset := read~$Pointer$(~#commands~0.base, ~#commands~0.offset + 9 * ~i~0#1, 4); srcloc: L693 {55260#(and (< |parse_input_#t~mem3#1.offset| (select |#length| |parse_input_#t~mem3#1.base|)) (<= 0 |parse_input_#t~mem3#1.offset|))} is VALID [2022-02-20 23:38:39,939 INFO L290 TraceCheckUtils]: 49: Hoare triple {55267#(and (<= 0 (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset|))) (< (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset|)) (select |#length| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset|)))))} assume !!(~i~0#1 < 2); {55267#(and (<= 0 (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset|))) (< (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset|)) (select |#length| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset|)))))} is VALID [2022-02-20 23:38:39,940 INFO L290 TraceCheckUtils]: 48: Hoare triple {55274#(and (<= 0 (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|)) (< (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) (select |#length| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|))))} ~input#1.base, ~input#1.offset := #in~input#1.base, #in~input#1.offset;~i~0#1 := 0; {55267#(and (<= 0 (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset|))) (< (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset|)) (select |#length| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) (+ (* 9 |parse_input_~i~0#1|) |~#commands~0.offset|)))))} is VALID [2022-02-20 23:38:39,940 INFO L272 TraceCheckUtils]: 47: Hoare triple {55274#(and (<= 0 (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|)) (< (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) (select |#length| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|))))} call parse_input(5, 0); {55274#(and (<= 0 (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|)) (< (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) (select |#length| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|))))} is VALID [2022-02-20 23:38:39,941 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {55285#(or (not (<= 0 (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|))) (not (<= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0)) (< (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) (select |#length| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|))))} {55281#(and (<= 0 (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|)) (<= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0))} #103#return; {55274#(and (<= 0 (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|)) (< (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) (select |#length| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|))))} is VALID [2022-02-20 23:38:39,941 INFO L290 TraceCheckUtils]: 45: Hoare triple {55285#(or (not (<= 0 (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|))) (not (<= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0)) (< (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) (select |#length| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|))))} assume true; {55285#(or (not (<= 0 (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|))) (not (<= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0)) (< (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) (select |#length| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|))))} is VALID [2022-02-20 23:38:39,942 INFO L290 TraceCheckUtils]: 44: Hoare triple {55285#(or (not (<= 0 (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|))) (not (<= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0)) (< (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) (select |#length| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|))))} assume { :end_inline_##fun~~TO~VOID } true;havoc #t~mem6#1.base, #t~mem6#1.offset; {55285#(or (not (<= 0 (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|))) (not (<= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0)) (< (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) (select |#length| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|))))} is VALID [2022-02-20 23:38:39,942 INFO L290 TraceCheckUtils]: 43: Hoare triple {55285#(or (not (<= 0 (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|))) (not (<= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0)) (< (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) (select |#length| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|))))} assume { :end_inline_c1 } true; {55285#(or (not (<= 0 (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|))) (not (<= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0)) (< (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) (select |#length| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|))))} is VALID [2022-02-20 23:38:39,942 INFO L290 TraceCheckUtils]: 42: Hoare triple {55285#(or (not (<= 0 (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|))) (not (<= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0)) (< (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) (select |#length| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|))))} ~global~0.base, ~global~0.offset := c1_~x~0#1.base, c1_~x~0#1.offset;~state~0 := ~unnamed3~0~STATE_2; {55285#(or (not (<= 0 (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|))) (not (<= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0)) (< (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) (select |#length| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|))))} is VALID [2022-02-20 23:38:39,947 INFO L290 TraceCheckUtils]: 41: Hoare triple {55285#(or (not (<= 0 (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|))) (not (<= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0)) (< (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) (select |#length| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|))))} assume 0 == ~global~0.base || 1 == #valid[~global~0.base];call ULTIMATE.dealloc(~global~0.base, ~global~0.offset); {55285#(or (not (<= 0 (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|))) (not (<= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0)) (< (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) (select |#length| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|))))} is VALID [2022-02-20 23:38:39,948 INFO L290 TraceCheckUtils]: 40: Hoare triple {55285#(or (not (<= 0 (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|))) (not (<= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0)) (< (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) (select |#length| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|))))} assume ~global~0.base < #StackHeapBarrier; {55285#(or (not (<= 0 (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|))) (not (<= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0)) (< (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) (select |#length| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|))))} is VALID [2022-02-20 23:38:39,948 INFO L290 TraceCheckUtils]: 39: Hoare triple {55285#(or (not (<= 0 (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|))) (not (<= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0)) (< (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) (select |#length| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|))))} assume 0 == ~global~0.offset; {55285#(or (not (<= 0 (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|))) (not (<= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0)) (< (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) (select |#length| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|))))} is VALID [2022-02-20 23:38:39,949 INFO L290 TraceCheckUtils]: 38: Hoare triple {55285#(or (not (<= 0 (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|))) (not (<= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0)) (< (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) (select |#length| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|))))} assume ~global~0.base != 0 || ~global~0.offset != 0; {55285#(or (not (<= 0 (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|))) (not (<= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0)) (< (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) (select |#length| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|))))} is VALID [2022-02-20 23:38:39,949 INFO L290 TraceCheckUtils]: 37: Hoare triple {55285#(or (not (<= 0 (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|))) (not (<= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0)) (< (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) (select |#length| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|))))} assume !(c1_~x~0#1.base == 0 && c1_~x~0#1.offset == 0); {55285#(or (not (<= 0 (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|))) (not (<= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0)) (< (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) (select |#length| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|))))} is VALID [2022-02-20 23:38:39,950 INFO L290 TraceCheckUtils]: 36: Hoare triple {55316#(or (not (<= 0 (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|))) (forall ((v_ArrVal_209 Int) (|v_parse_input_c1_~x~0#1.base_63| Int)) (or (not (= (select |#valid| |v_parse_input_c1_~x~0#1.base_63|) 0)) (< (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) (select (store |#length| |v_parse_input_c1_~x~0#1.base_63| v_ArrVal_209) (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|))))) (not (<= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0)))} assume !(##fun~~TO~VOID_#in~#fp#1.base == #funAddr~c2.base && ##fun~~TO~VOID_#in~#fp#1.offset == #funAddr~c2.offset);assume { :begin_inline_c1 } true;havoc c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset, c1_~x~0#1.base, c1_~x~0#1.offset;call c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset := #Ultimate.allocOnHeap(1);c1_~x~0#1.base, c1_~x~0#1.offset := c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset;havoc c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset; {55285#(or (not (<= 0 (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|))) (not (<= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0)) (< (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) (select |#length| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|))))} is VALID [2022-02-20 23:38:39,951 INFO L290 TraceCheckUtils]: 35: Hoare triple {55316#(or (not (<= 0 (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|))) (forall ((v_ArrVal_209 Int) (|v_parse_input_c1_~x~0#1.base_63| Int)) (or (not (= (select |#valid| |v_parse_input_c1_~x~0#1.base_63|) 0)) (< (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) (select (store |#length| |v_parse_input_c1_~x~0#1.base_63| v_ArrVal_209) (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|))))) (not (<= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0)))} assume { :begin_inline_##fun~~TO~VOID } true;##fun~~TO~VOID_#in~#fp#1.base, ##fun~~TO~VOID_#in~#fp#1.offset := #t~mem6#1.base, #t~mem6#1.offset; {55316#(or (not (<= 0 (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|))) (forall ((v_ArrVal_209 Int) (|v_parse_input_c1_~x~0#1.base_63| Int)) (or (not (= (select |#valid| |v_parse_input_c1_~x~0#1.base_63|) 0)) (< (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) (select (store |#length| |v_parse_input_c1_~x~0#1.base_63| v_ArrVal_209) (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|))))) (not (<= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0)))} is VALID [2022-02-20 23:38:39,951 INFO L290 TraceCheckUtils]: 34: Hoare triple {55316#(or (not (<= 0 (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|))) (forall ((v_ArrVal_209 Int) (|v_parse_input_c1_~x~0#1.base_63| Int)) (or (not (= (select |#valid| |v_parse_input_c1_~x~0#1.base_63|) 0)) (< (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) (select (store |#length| |v_parse_input_c1_~x~0#1.base_63| v_ArrVal_209) (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|))))) (not (<= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0)))} SUMMARY for call #t~mem6#1.base, #t~mem6#1.offset := read~$Pointer$(~#commands~0.base, 4 + (~#commands~0.offset + 9 * ~i~0#1), 4); srcloc: L695 {55316#(or (not (<= 0 (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|))) (forall ((v_ArrVal_209 Int) (|v_parse_input_c1_~x~0#1.base_63| Int)) (or (not (= (select |#valid| |v_parse_input_c1_~x~0#1.base_63|) 0)) (< (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) (select (store |#length| |v_parse_input_c1_~x~0#1.base_63| v_ArrVal_209) (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|))))) (not (<= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0)))} is VALID [2022-02-20 23:38:39,952 INFO L290 TraceCheckUtils]: 33: Hoare triple {55316#(or (not (<= 0 (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|))) (forall ((v_ArrVal_209 Int) (|v_parse_input_c1_~x~0#1.base_63| Int)) (or (not (= (select |#valid| |v_parse_input_c1_~x~0#1.base_63|) 0)) (< (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) (select (store |#length| |v_parse_input_c1_~x~0#1.base_63| v_ArrVal_209) (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|))))) (not (<= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0)))} assume ~state~0 >= #t~mem5#1;havoc #t~mem5#1; {55316#(or (not (<= 0 (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|))) (forall ((v_ArrVal_209 Int) (|v_parse_input_c1_~x~0#1.base_63| Int)) (or (not (= (select |#valid| |v_parse_input_c1_~x~0#1.base_63|) 0)) (< (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) (select (store |#length| |v_parse_input_c1_~x~0#1.base_63| v_ArrVal_209) (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|))))) (not (<= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0)))} is VALID [2022-02-20 23:38:39,953 INFO L290 TraceCheckUtils]: 32: Hoare triple {55316#(or (not (<= 0 (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|))) (forall ((v_ArrVal_209 Int) (|v_parse_input_c1_~x~0#1.base_63| Int)) (or (not (= (select |#valid| |v_parse_input_c1_~x~0#1.base_63|) 0)) (< (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) (select (store |#length| |v_parse_input_c1_~x~0#1.base_63| v_ArrVal_209) (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|))))) (not (<= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0)))} SUMMARY for call #t~mem5#1 := read~int(~#commands~0.base, 8 + (~#commands~0.offset + 9 * ~i~0#1), 1); srcloc: L694 {55316#(or (not (<= 0 (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|))) (forall ((v_ArrVal_209 Int) (|v_parse_input_c1_~x~0#1.base_63| Int)) (or (not (= (select |#valid| |v_parse_input_c1_~x~0#1.base_63|) 0)) (< (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) (select (store |#length| |v_parse_input_c1_~x~0#1.base_63| v_ArrVal_209) (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|))))) (not (<= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0)))} is VALID [2022-02-20 23:38:39,953 INFO L290 TraceCheckUtils]: 31: Hoare triple {55316#(or (not (<= 0 (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|))) (forall ((v_ArrVal_209 Int) (|v_parse_input_c1_~x~0#1.base_63| Int)) (or (not (= (select |#valid| |v_parse_input_c1_~x~0#1.base_63|) 0)) (< (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) (select (store |#length| |v_parse_input_c1_~x~0#1.base_63| v_ArrVal_209) (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|))))) (not (<= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0)))} assume 0 == #t~nondet4#1;havoc #t~mem3#1.base, #t~mem3#1.offset;havoc #t~nondet4#1; {55316#(or (not (<= 0 (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|))) (forall ((v_ArrVal_209 Int) (|v_parse_input_c1_~x~0#1.base_63| Int)) (or (not (= (select |#valid| |v_parse_input_c1_~x~0#1.base_63|) 0)) (< (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) (select (store |#length| |v_parse_input_c1_~x~0#1.base_63| v_ArrVal_209) (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|))))) (not (<= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0)))} is VALID [2022-02-20 23:38:39,954 INFO L290 TraceCheckUtils]: 30: Hoare triple {55316#(or (not (<= 0 (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|))) (forall ((v_ArrVal_209 Int) (|v_parse_input_c1_~x~0#1.base_63| Int)) (or (not (= (select |#valid| |v_parse_input_c1_~x~0#1.base_63|) 0)) (< (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) (select (store |#length| |v_parse_input_c1_~x~0#1.base_63| v_ArrVal_209) (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|))))) (not (<= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0)))} assume ~input#1.offset < #length[~input#1.base] && ~input#1.offset >= 0; {55316#(or (not (<= 0 (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|))) (forall ((v_ArrVal_209 Int) (|v_parse_input_c1_~x~0#1.base_63| Int)) (or (not (= (select |#valid| |v_parse_input_c1_~x~0#1.base_63|) 0)) (< (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) (select (store |#length| |v_parse_input_c1_~x~0#1.base_63| v_ArrVal_209) (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|))))) (not (<= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0)))} is VALID [2022-02-20 23:38:39,954 INFO L290 TraceCheckUtils]: 29: Hoare triple {55316#(or (not (<= 0 (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|))) (forall ((v_ArrVal_209 Int) (|v_parse_input_c1_~x~0#1.base_63| Int)) (or (not (= (select |#valid| |v_parse_input_c1_~x~0#1.base_63|) 0)) (< (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) (select (store |#length| |v_parse_input_c1_~x~0#1.base_63| v_ArrVal_209) (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|))))) (not (<= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0)))} assume 1 == #valid[~input#1.base]; {55316#(or (not (<= 0 (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|))) (forall ((v_ArrVal_209 Int) (|v_parse_input_c1_~x~0#1.base_63| Int)) (or (not (= (select |#valid| |v_parse_input_c1_~x~0#1.base_63|) 0)) (< (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) (select (store |#length| |v_parse_input_c1_~x~0#1.base_63| v_ArrVal_209) (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|))))) (not (<= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0)))} is VALID [2022-02-20 23:38:39,955 INFO L290 TraceCheckUtils]: 28: Hoare triple {55341#(or (not (<= 0 (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|))) (forall ((|v_parse_input_c1_~x~0#1.base_63| Int)) (or (not (= (select |#valid| |v_parse_input_c1_~x~0#1.base_63|) 0)) (and (= |parse_input_#t~mem3#1.base| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|)) (not (= |v_parse_input_c1_~x~0#1.base_63| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|)))))) (not (<= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0)))} assume #t~mem3#1.offset < #length[#t~mem3#1.base] && #t~mem3#1.offset >= 0; {55316#(or (not (<= 0 (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|))) (forall ((v_ArrVal_209 Int) (|v_parse_input_c1_~x~0#1.base_63| Int)) (or (not (= (select |#valid| |v_parse_input_c1_~x~0#1.base_63|) 0)) (< (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) (select (store |#length| |v_parse_input_c1_~x~0#1.base_63| v_ArrVal_209) (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|))))) (not (<= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0)))} is VALID [2022-02-20 23:38:39,956 INFO L290 TraceCheckUtils]: 27: Hoare triple {55345#(or (= |parse_input_#t~mem3#1.base| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|)) (not (<= 0 (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|))) (not (<= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0)))} assume 1 == #valid[#t~mem3#1.base]; {55341#(or (not (<= 0 (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|))) (forall ((|v_parse_input_c1_~x~0#1.base_63| Int)) (or (not (= (select |#valid| |v_parse_input_c1_~x~0#1.base_63|) 0)) (and (= |parse_input_#t~mem3#1.base| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|)) (not (= |v_parse_input_c1_~x~0#1.base_63| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|)))))) (not (<= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0)))} is VALID [2022-02-20 23:38:39,956 INFO L290 TraceCheckUtils]: 26: Hoare triple {55349#(or (= (* 9 |parse_input_~i~0#1|) 0) (not (<= 0 (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|))) (not (<= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0)))} SUMMARY for call #t~mem3#1.base, #t~mem3#1.offset := read~$Pointer$(~#commands~0.base, ~#commands~0.offset + 9 * ~i~0#1, 4); srcloc: L693 {55345#(or (= |parse_input_#t~mem3#1.base| (select (select |#memory_$Pointer$.base| |~#commands~0.base|) |~#commands~0.offset|)) (not (<= 0 (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|))) (not (<= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0)))} is VALID [2022-02-20 23:38:39,957 INFO L290 TraceCheckUtils]: 25: Hoare triple {55349#(or (= (* 9 |parse_input_~i~0#1|) 0) (not (<= 0 (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|))) (not (<= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0)))} assume !!(~i~0#1 < 2); {55349#(or (= (* 9 |parse_input_~i~0#1|) 0) (not (<= 0 (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|))) (not (<= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0)))} is VALID [2022-02-20 23:38:39,957 INFO L290 TraceCheckUtils]: 24: Hoare triple {55031#true} ~input#1.base, ~input#1.offset := #in~input#1.base, #in~input#1.offset;~i~0#1 := 0; {55349#(or (= (* 9 |parse_input_~i~0#1|) 0) (not (<= 0 (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|))) (not (<= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0)))} is VALID [2022-02-20 23:38:39,957 INFO L272 TraceCheckUtils]: 23: Hoare triple {55281#(and (<= 0 (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|)) (<= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0))} call parse_input(4, 0); {55031#true} is VALID [2022-02-20 23:38:39,958 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {55031#true} {55281#(and (<= 0 (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|)) (<= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0))} #101#return; {55281#(and (<= 0 (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|)) (<= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0))} is VALID [2022-02-20 23:38:39,958 INFO L290 TraceCheckUtils]: 21: Hoare triple {55031#true} assume true; {55031#true} is VALID [2022-02-20 23:38:39,958 INFO L290 TraceCheckUtils]: 20: Hoare triple {55031#true} assume { :end_inline_##fun~~TO~VOID } true;havoc #t~mem6#1.base, #t~mem6#1.offset; {55031#true} is VALID [2022-02-20 23:38:39,959 INFO L290 TraceCheckUtils]: 19: Hoare triple {55031#true} assume { :end_inline_c1 } true; {55031#true} is VALID [2022-02-20 23:38:39,959 INFO L290 TraceCheckUtils]: 18: Hoare triple {55031#true} ~global~0.base, ~global~0.offset := c1_~x~0#1.base, c1_~x~0#1.offset;~state~0 := ~unnamed3~0~STATE_2; {55031#true} is VALID [2022-02-20 23:38:39,959 INFO L290 TraceCheckUtils]: 17: Hoare triple {55031#true} assume !(~global~0.base != 0 || ~global~0.offset != 0); {55031#true} is VALID [2022-02-20 23:38:39,959 INFO L290 TraceCheckUtils]: 16: Hoare triple {55031#true} assume !(c1_~x~0#1.base == 0 && c1_~x~0#1.offset == 0); {55031#true} is VALID [2022-02-20 23:38:39,959 INFO L290 TraceCheckUtils]: 15: Hoare triple {55031#true} assume !(##fun~~TO~VOID_#in~#fp#1.base == #funAddr~c2.base && ##fun~~TO~VOID_#in~#fp#1.offset == #funAddr~c2.offset);assume { :begin_inline_c1 } true;havoc c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset, c1_~x~0#1.base, c1_~x~0#1.offset;call c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset := #Ultimate.allocOnHeap(1);c1_~x~0#1.base, c1_~x~0#1.offset := c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset;havoc c1_#t~malloc7#1.base, c1_#t~malloc7#1.offset; {55031#true} is VALID [2022-02-20 23:38:39,959 INFO L290 TraceCheckUtils]: 14: Hoare triple {55031#true} assume { :begin_inline_##fun~~TO~VOID } true;##fun~~TO~VOID_#in~#fp#1.base, ##fun~~TO~VOID_#in~#fp#1.offset := #t~mem6#1.base, #t~mem6#1.offset; {55031#true} is VALID [2022-02-20 23:38:39,959 INFO L290 TraceCheckUtils]: 13: Hoare triple {55031#true} SUMMARY for call #t~mem6#1.base, #t~mem6#1.offset := read~$Pointer$(~#commands~0.base, 4 + (~#commands~0.offset + 9 * ~i~0#1), 4); srcloc: L695 {55031#true} is VALID [2022-02-20 23:38:39,959 INFO L290 TraceCheckUtils]: 12: Hoare triple {55031#true} assume ~state~0 >= #t~mem5#1;havoc #t~mem5#1; {55031#true} is VALID [2022-02-20 23:38:39,960 INFO L290 TraceCheckUtils]: 11: Hoare triple {55031#true} SUMMARY for call #t~mem5#1 := read~int(~#commands~0.base, 8 + (~#commands~0.offset + 9 * ~i~0#1), 1); srcloc: L694 {55031#true} is VALID [2022-02-20 23:38:39,960 INFO L290 TraceCheckUtils]: 10: Hoare triple {55031#true} assume 0 == #t~nondet4#1;havoc #t~mem3#1.base, #t~mem3#1.offset;havoc #t~nondet4#1; {55031#true} is VALID [2022-02-20 23:38:39,960 INFO L290 TraceCheckUtils]: 9: Hoare triple {55031#true} assume ~input#1.offset < #length[~input#1.base] && ~input#1.offset >= 0; {55031#true} is VALID [2022-02-20 23:38:39,960 INFO L290 TraceCheckUtils]: 8: Hoare triple {55031#true} assume 1 == #valid[~input#1.base]; {55031#true} is VALID [2022-02-20 23:38:39,960 INFO L290 TraceCheckUtils]: 7: Hoare triple {55031#true} assume #t~mem3#1.offset < #length[#t~mem3#1.base] && #t~mem3#1.offset >= 0; {55031#true} is VALID [2022-02-20 23:38:39,960 INFO L290 TraceCheckUtils]: 6: Hoare triple {55031#true} assume 1 == #valid[#t~mem3#1.base]; {55031#true} is VALID [2022-02-20 23:38:39,960 INFO L290 TraceCheckUtils]: 5: Hoare triple {55031#true} SUMMARY for call #t~mem3#1.base, #t~mem3#1.offset := read~$Pointer$(~#commands~0.base, ~#commands~0.offset + 9 * ~i~0#1, 4); srcloc: L693 {55031#true} is VALID [2022-02-20 23:38:39,960 INFO L290 TraceCheckUtils]: 4: Hoare triple {55031#true} assume !!(~i~0#1 < 2); {55031#true} is VALID [2022-02-20 23:38:39,960 INFO L290 TraceCheckUtils]: 3: Hoare triple {55031#true} ~input#1.base, ~input#1.offset := #in~input#1.base, #in~input#1.offset;~i~0#1 := 0; {55031#true} is VALID [2022-02-20 23:38:39,961 INFO L272 TraceCheckUtils]: 2: Hoare triple {55281#(and (<= 0 (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|)) (<= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0))} call parse_input(3, 0); {55031#true} is VALID [2022-02-20 23:38:39,961 INFO L290 TraceCheckUtils]: 1: Hoare triple {55281#(and (<= 0 (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|)) (<= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0))} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1; {55281#(and (<= 0 (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|)) (<= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0))} is VALID [2022-02-20 23:38:39,962 INFO L290 TraceCheckUtils]: 0: Hoare triple {55031#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(3, 1);call write~init~int(99, 1, 0, 1);call write~init~int(49, 1, 1, 1);call write~init~int(0, 1, 2, 1);call #Ultimate.allocInit(3, 2);call write~init~int(99, 2, 0, 1);call write~init~int(50, 2, 1, 1);call write~init~int(0, 2, 2, 1);call #Ultimate.allocInit(3, 3);call write~init~int(99, 3, 0, 1);call write~init~int(49, 3, 1, 1);call write~init~int(0, 3, 2, 1);call #Ultimate.allocInit(3, 4);call write~init~int(99, 4, 0, 1);call write~init~int(49, 4, 1, 1);call write~init~int(0, 4, 2, 1);call #Ultimate.allocInit(3, 5);call write~init~int(99, 5, 0, 1);call write~init~int(50, 5, 1, 1);call write~init~int(0, 5, 2, 1);~state~0 := ~unnamed3~0~STATE_1;~global~0.base, ~global~0.offset := 0, 0;~#commands~0.base, ~#commands~0.offset := 6, 0;call #Ultimate.allocInit(18, 6);call write~init~$Pointer$(1, 0, ~#commands~0.base, ~#commands~0.offset, 4);call write~init~$Pointer$(#funAddr~c1.base, #funAddr~c1.offset, ~#commands~0.base, 4 + ~#commands~0.offset, 4);call write~init~int((if ~unnamed3~0~STATE_1 % 256 <= 127 then ~unnamed3~0~STATE_1 % 256 else ~unnamed3~0~STATE_1 % 256 - 256), ~#commands~0.base, 8 + ~#commands~0.offset, 1);call write~init~$Pointer$(2, 0, ~#commands~0.base, 9 + ~#commands~0.offset, 4);call write~init~$Pointer$(#funAddr~c2.base, #funAddr~c2.offset, ~#commands~0.base, 13 + ~#commands~0.offset, 4);call write~init~int((if ~unnamed3~0~STATE_2 % 256 <= 127 then ~unnamed3~0~STATE_2 % 256 else ~unnamed3~0~STATE_2 % 256 - 256), ~#commands~0.base, 17 + ~#commands~0.offset, 1); {55281#(and (<= 0 (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|)) (<= (select (select |#memory_$Pointer$.offset| |~#commands~0.base|) |~#commands~0.offset|) 0))} is VALID [2022-02-20 23:38:39,964 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 25 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-20 23:38:39,964 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1040629069] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 23:38:39,964 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 23:38:39,964 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 8, 10] total 35 [2022-02-20 23:38:39,964 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159134263] [2022-02-20 23:38:39,964 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 23:38:39,965 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 34 states have (on average 4.235294117647059) internal successors, (144), 32 states have internal predecessors, (144), 7 states have call successors, (9), 6 states have call predecessors, (9), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 53 [2022-02-20 23:38:39,965 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:38:39,966 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 36 states, 34 states have (on average 4.235294117647059) internal successors, (144), 32 states have internal predecessors, (144), 7 states have call successors, (9), 6 states have call predecessors, (9), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-02-20 23:38:40,089 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 159 edges. 159 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:38:40,089 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-02-20 23:38:40,090 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:38:40,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-02-20 23:38:40,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=1121, Unknown=0, NotChecked=0, Total=1260 [2022-02-20 23:38:40,090 INFO L87 Difference]: Start difference. First operand 289 states and 329 transitions. Second operand has 36 states, 34 states have (on average 4.235294117647059) internal successors, (144), 32 states have internal predecessors, (144), 7 states have call successors, (9), 6 states have call predecessors, (9), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6)