./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/termination-crafted/Arrays01-EquivalentConstantIndices-1.c --full-output -ea --architecture 64bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) 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/termination-crafted/Arrays01-EquivalentConstantIndices-1.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-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-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash cad2c6f6e8ebe2adcd550e4a56b83be37e52f812ae33bfb645236c6925734dbf --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 23:43:05,307 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 23:43:05,309 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 23:43:05,337 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 23:43:05,338 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 23:43:05,341 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 23:43:05,342 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 23:43:05,346 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 23:43:05,348 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 23:43:05,352 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 23:43:05,353 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 23:43:05,353 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 23:43:05,354 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 23:43:05,355 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 23:43:05,356 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 23:43:05,357 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 23:43:05,360 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 23:43:05,361 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 23:43:05,361 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 23:43:05,363 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 23:43:05,366 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 23:43:05,367 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 23:43:05,368 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 23:43:05,369 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 23:43:05,371 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 23:43:05,371 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 23:43:05,372 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 23:43:05,373 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 23:43:05,373 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 23:43:05,373 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 23:43:05,374 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 23:43:05,375 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 23:43:05,376 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 23:43:05,376 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 23:43:05,377 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 23:43:05,377 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 23:43:05,378 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 23:43:05,378 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 23:43:05,378 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 23:43:05,379 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 23:43:05,379 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 23:43:05,380 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2022-02-20 23:43:05,407 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 23:43:05,407 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 23:43:05,408 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 23:43:05,408 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 23:43:05,408 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 23:43:05,408 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 23:43:05,409 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 23:43:05,409 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 23:43:05,409 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 23:43:05,409 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 23:43:05,410 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-20 23:43:05,410 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 23:43:05,410 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 23:43:05,410 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-02-20 23:43:05,410 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-02-20 23:43:05,411 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-02-20 23:43:05,411 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 23:43:05,411 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 23:43:05,411 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 23:43:05,411 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 23:43:05,411 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 23:43:05,411 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 23:43:05,412 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 23:43:05,412 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 23:43:05,412 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 23:43:05,412 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 23:43:05,412 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 23:43:05,413 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-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> cad2c6f6e8ebe2adcd550e4a56b83be37e52f812ae33bfb645236c6925734dbf [2022-02-20 23:43:05,591 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 23:43:05,608 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 23:43:05,609 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 23:43:05,610 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 23:43:05,611 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 23:43:05,611 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-crafted/Arrays01-EquivalentConstantIndices-1.c [2022-02-20 23:43:05,659 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/042ca7d54/2172d0799a774538a24450c739cc049f/FLAG157784a63 [2022-02-20 23:43:06,014 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 23:43:06,014 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-crafted/Arrays01-EquivalentConstantIndices-1.c [2022-02-20 23:43:06,027 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/042ca7d54/2172d0799a774538a24450c739cc049f/FLAG157784a63 [2022-02-20 23:43:06,448 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/042ca7d54/2172d0799a774538a24450c739cc049f [2022-02-20 23:43:06,451 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 23:43:06,452 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 23:43:06,453 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 23:43:06,453 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 23:43:06,455 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 23:43:06,456 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:43:06" (1/1) ... [2022-02-20 23:43:06,458 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@eb9c44 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:43:06, skipping insertion in model container [2022-02-20 23:43:06,458 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:43:06" (1/1) ... [2022-02-20 23:43:06,462 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 23:43:06,470 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 23:43:06,605 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:43:06,607 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 23:43:06,628 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:43:06,642 INFO L208 MainTranslator]: Completed translation [2022-02-20 23:43:06,643 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:43:06 WrapperNode [2022-02-20 23:43:06,643 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 23:43:06,644 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 23:43:06,644 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 23:43:06,644 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 23:43:06,649 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:43:06" (1/1) ... [2022-02-20 23:43:06,654 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:43:06" (1/1) ... [2022-02-20 23:43:06,668 INFO L137 Inliner]: procedures = 8, calls = 9, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 33 [2022-02-20 23:43:06,669 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 23:43:06,670 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 23:43:06,670 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 23:43:06,670 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 23:43:06,675 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:43:06" (1/1) ... [2022-02-20 23:43:06,676 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:43:06" (1/1) ... [2022-02-20 23:43:06,682 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:43:06" (1/1) ... [2022-02-20 23:43:06,682 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:43:06" (1/1) ... [2022-02-20 23:43:06,691 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:43:06" (1/1) ... [2022-02-20 23:43:06,694 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:43:06" (1/1) ... [2022-02-20 23:43:06,697 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:43:06" (1/1) ... [2022-02-20 23:43:06,698 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 23:43:06,699 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 23:43:06,700 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 23:43:06,700 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 23:43:06,701 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:43:06" (1/1) ... [2022-02-20 23:43:06,705 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 23:43:06,714 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:43:06,753 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:43:06,781 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:43:06,791 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-20 23:43:06,792 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 23:43:06,792 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 23:43:06,793 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-20 23:43:06,793 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 23:43:06,793 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 23:43:06,834 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 23:43:06,836 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 23:43:06,956 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 23:43:06,960 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 23:43:06,960 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-02-20 23:43:06,961 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:43:06 BoogieIcfgContainer [2022-02-20 23:43:06,961 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 23:43:06,963 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 23:43:06,963 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 23:43:06,965 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 23:43:06,965 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 11:43:06" (1/3) ... [2022-02-20 23:43:06,966 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37162401 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 11:43:06, skipping insertion in model container [2022-02-20 23:43:06,966 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:43:06" (2/3) ... [2022-02-20 23:43:06,966 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37162401 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 11:43:06, skipping insertion in model container [2022-02-20 23:43:06,966 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:43:06" (3/3) ... [2022-02-20 23:43:06,967 INFO L111 eAbstractionObserver]: Analyzing ICFG Arrays01-EquivalentConstantIndices-1.c [2022-02-20 23:43:06,970 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 23:43:06,970 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2022-02-20 23:43:07,012 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 23:43:07,017 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:43:07,017 INFO L340 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2022-02-20 23:43:07,035 INFO L276 IsEmpty]: Start isEmpty. Operand has 24 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 23 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:07,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-02-20 23:43:07,039 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:43:07,039 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2022-02-20 23:43:07,040 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 5 more)] === [2022-02-20 23:43:07,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:43:07,043 INFO L85 PathProgramCache]: Analyzing trace with hash 926025, now seen corresponding path program 1 times [2022-02-20 23:43:07,049 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:43:07,050 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541167109] [2022-02-20 23:43:07,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:43:07,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:43:07,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:43:07,154 INFO L290 TraceCheckUtils]: 0: Hoare triple {27#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {27#true} is VALID [2022-02-20 23:43:07,156 INFO L290 TraceCheckUtils]: 1: Hoare triple {27#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~post0#1, main_~i~0#1, main_#t~mem3#1, main_#t~mem2#1, main_~#a~0#1.base, main_~#a~0#1.offset;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4192);main_~i~0#1 := 0; {27#true} is VALID [2022-02-20 23:43:07,157 INFO L290 TraceCheckUtils]: 2: Hoare triple {27#true} assume !true; {28#false} is VALID [2022-02-20 23:43:07,158 INFO L290 TraceCheckUtils]: 3: Hoare triple {28#false} assume !(1 == #valid[main_~#a~0#1.base]); {28#false} is VALID [2022-02-20 23:43:07,158 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:43:07,159 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:43:07,160 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541167109] [2022-02-20 23:43:07,161 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1541167109] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:43:07,161 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:43:07,161 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:43:07,164 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393221419] [2022-02-20 23:43:07,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:43:07,168 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2022-02-20 23:43:07,169 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:43:07,171 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:07,184 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 4 edges. 4 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:43:07,185 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 23:43:07,185 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:43:07,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 23:43:07,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 23:43:07,205 INFO L87 Difference]: Start difference. First operand has 24 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 23 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:07,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:43:07,244 INFO L93 Difference]: Finished difference Result 24 states and 25 transitions. [2022-02-20 23:43:07,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 23:43:07,245 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2022-02-20 23:43:07,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:43:07,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:07,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 27 transitions. [2022-02-20 23:43:07,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:07,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 27 transitions. [2022-02-20 23:43:07,256 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 27 transitions. [2022-02-20 23:43:07,288 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:43:07,294 INFO L225 Difference]: With dead ends: 24 [2022-02-20 23:43:07,294 INFO L226 Difference]: Without dead ends: 22 [2022-02-20 23:43:07,297 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 23:43:07,303 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:43:07,304 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:43:07,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-02-20 23:43:07,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2022-02-20 23:43:07,325 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:43:07,325 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand has 22 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 21 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:07,326 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand has 22 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 21 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:07,326 INFO L87 Difference]: Start difference. First operand 22 states. Second operand has 22 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 21 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:07,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:43:07,328 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2022-02-20 23:43:07,328 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2022-02-20 23:43:07,328 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:43:07,329 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:43:07,329 INFO L74 IsIncluded]: Start isIncluded. First operand has 22 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 21 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 22 states. [2022-02-20 23:43:07,329 INFO L87 Difference]: Start difference. First operand has 22 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 21 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 22 states. [2022-02-20 23:43:07,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:43:07,331 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2022-02-20 23:43:07,331 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2022-02-20 23:43:07,331 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:43:07,331 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:43:07,332 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:43:07,332 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:43:07,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 21 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:07,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 23 transitions. [2022-02-20 23:43:07,334 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 23 transitions. Word has length 4 [2022-02-20 23:43:07,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:43:07,334 INFO L470 AbstractCegarLoop]: Abstraction has 22 states and 23 transitions. [2022-02-20 23:43:07,335 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:07,335 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2022-02-20 23:43:07,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-02-20 23:43:07,335 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:43:07,335 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2022-02-20 23:43:07,336 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 23:43:07,336 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 5 more)] === [2022-02-20 23:43:07,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:43:07,337 INFO L85 PathProgramCache]: Analyzing trace with hash 925715, now seen corresponding path program 1 times [2022-02-20 23:43:07,337 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:43:07,337 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937723419] [2022-02-20 23:43:07,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:43:07,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:43:07,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:43:07,363 INFO L290 TraceCheckUtils]: 0: Hoare triple {121#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {121#true} is VALID [2022-02-20 23:43:07,364 INFO L290 TraceCheckUtils]: 1: Hoare triple {121#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~post0#1, main_~i~0#1, main_#t~mem3#1, main_#t~mem2#1, main_~#a~0#1.base, main_~#a~0#1.offset;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4192);main_~i~0#1 := 0; {123#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 23:43:07,365 INFO L290 TraceCheckUtils]: 2: Hoare triple {123#(= |ULTIMATE.start_main_~i~0#1| 0)} assume !(main_~i~0#1 < 1048); {122#false} is VALID [2022-02-20 23:43:07,365 INFO L290 TraceCheckUtils]: 3: Hoare triple {122#false} assume !(1 == #valid[main_~#a~0#1.base]); {122#false} is VALID [2022-02-20 23:43:07,365 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:43:07,365 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:43:07,366 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937723419] [2022-02-20 23:43:07,366 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1937723419] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:43:07,366 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:43:07,366 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 23:43:07,366 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647664334] [2022-02-20 23:43:07,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:43:07,367 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2022-02-20 23:43:07,368 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:43:07,368 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:07,372 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 4 edges. 4 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:43:07,372 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:43:07,372 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:43:07,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:43:07,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:43:07,373 INFO L87 Difference]: Start difference. First operand 22 states and 23 transitions. Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:07,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:43:07,406 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2022-02-20 23:43:07,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:43:07,406 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2022-02-20 23:43:07,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:43:07,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:07,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 30 transitions. [2022-02-20 23:43:07,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:07,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 30 transitions. [2022-02-20 23:43:07,408 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 30 transitions. [2022-02-20 23:43:07,431 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:43:07,432 INFO L225 Difference]: With dead ends: 28 [2022-02-20 23:43:07,432 INFO L226 Difference]: Without dead ends: 28 [2022-02-20 23:43:07,432 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:43:07,433 INFO L933 BasicCegarLoop]: 19 mSDtfsCounter, 5 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:43:07,434 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 36 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:43:07,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-02-20 23:43:07,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 23. [2022-02-20 23:43:07,436 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:43:07,436 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand has 23 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 22 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:07,436 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand has 23 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 22 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:07,437 INFO L87 Difference]: Start difference. First operand 28 states. Second operand has 23 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 22 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:07,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:43:07,438 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2022-02-20 23:43:07,438 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2022-02-20 23:43:07,438 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:43:07,438 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:43:07,439 INFO L74 IsIncluded]: Start isIncluded. First operand has 23 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 22 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 28 states. [2022-02-20 23:43:07,439 INFO L87 Difference]: Start difference. First operand has 23 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 22 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 28 states. [2022-02-20 23:43:07,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:43:07,440 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2022-02-20 23:43:07,440 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2022-02-20 23:43:07,441 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:43:07,441 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:43:07,441 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:43:07,441 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:43:07,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 22 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:07,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2022-02-20 23:43:07,442 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 4 [2022-02-20 23:43:07,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:43:07,442 INFO L470 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2022-02-20 23:43:07,443 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:07,443 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2022-02-20 23:43:07,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-02-20 23:43:07,443 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:43:07,443 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2022-02-20 23:43:07,443 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 23:43:07,443 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 5 more)] === [2022-02-20 23:43:07,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:43:07,444 INFO L85 PathProgramCache]: Analyzing trace with hash 925765, now seen corresponding path program 1 times [2022-02-20 23:43:07,445 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:43:07,445 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502981583] [2022-02-20 23:43:07,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:43:07,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:43:07,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:43:07,473 INFO L290 TraceCheckUtils]: 0: Hoare triple {233#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {233#true} is VALID [2022-02-20 23:43:07,474 INFO L290 TraceCheckUtils]: 1: Hoare triple {233#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~post0#1, main_~i~0#1, main_#t~mem3#1, main_#t~mem2#1, main_~#a~0#1.base, main_~#a~0#1.offset;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4192);main_~i~0#1 := 0; {235#(= (select |#valid| |ULTIMATE.start_main_~#a~0#1.base|) 1)} is VALID [2022-02-20 23:43:07,474 INFO L290 TraceCheckUtils]: 2: Hoare triple {235#(= (select |#valid| |ULTIMATE.start_main_~#a~0#1.base|) 1)} assume !!(main_~i~0#1 < 1048);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {235#(= (select |#valid| |ULTIMATE.start_main_~#a~0#1.base|) 1)} is VALID [2022-02-20 23:43:07,474 INFO L290 TraceCheckUtils]: 3: Hoare triple {235#(= (select |#valid| |ULTIMATE.start_main_~#a~0#1.base|) 1)} assume !(1 == #valid[main_~#a~0#1.base]); {234#false} is VALID [2022-02-20 23:43:07,475 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:43:07,475 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:43:07,475 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502981583] [2022-02-20 23:43:07,475 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1502981583] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:43:07,475 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:43:07,475 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:43:07,476 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002888694] [2022-02-20 23:43:07,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:43:07,476 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2022-02-20 23:43:07,476 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:43:07,477 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:07,480 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 4 edges. 4 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:43:07,480 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:43:07,480 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:43:07,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:43:07,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:43:07,481 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:07,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:43:07,510 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2022-02-20 23:43:07,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:43:07,510 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2022-02-20 23:43:07,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:43:07,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:07,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 23 transitions. [2022-02-20 23:43:07,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:07,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 23 transitions. [2022-02-20 23:43:07,512 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 23 transitions. [2022-02-20 23:43:07,528 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:43:07,529 INFO L225 Difference]: With dead ends: 19 [2022-02-20 23:43:07,529 INFO L226 Difference]: Without dead ends: 19 [2022-02-20 23:43:07,529 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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:43:07,530 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 14 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:43:07,531 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 10 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:43:07,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-02-20 23:43:07,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2022-02-20 23:43:07,532 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:43:07,532 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states. Second operand has 19 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 18 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:07,532 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand has 19 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 18 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:07,533 INFO L87 Difference]: Start difference. First operand 19 states. Second operand has 19 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 18 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:07,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:43:07,534 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2022-02-20 23:43:07,534 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2022-02-20 23:43:07,534 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:43:07,534 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:43:07,534 INFO L74 IsIncluded]: Start isIncluded. First operand has 19 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 18 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 19 states. [2022-02-20 23:43:07,534 INFO L87 Difference]: Start difference. First operand has 19 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 18 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 19 states. [2022-02-20 23:43:07,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:43:07,535 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2022-02-20 23:43:07,535 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2022-02-20 23:43:07,536 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:43:07,536 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:43:07,536 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:43:07,536 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:43:07,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 18 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:07,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2022-02-20 23:43:07,537 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 4 [2022-02-20 23:43:07,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:43:07,537 INFO L470 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2022-02-20 23:43:07,538 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:07,538 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2022-02-20 23:43:07,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-02-20 23:43:07,538 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:43:07,538 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2022-02-20 23:43:07,538 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 23:43:07,538 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 5 more)] === [2022-02-20 23:43:07,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:43:07,539 INFO L85 PathProgramCache]: Analyzing trace with hash 925766, now seen corresponding path program 1 times [2022-02-20 23:43:07,539 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:43:07,539 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91193602] [2022-02-20 23:43:07,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:43:07,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:43:07,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:43:07,574 INFO L290 TraceCheckUtils]: 0: Hoare triple {314#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {314#true} is VALID [2022-02-20 23:43:07,575 INFO L290 TraceCheckUtils]: 1: Hoare triple {314#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~post0#1, main_~i~0#1, main_#t~mem3#1, main_#t~mem2#1, main_~#a~0#1.base, main_~#a~0#1.offset;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4192);main_~i~0#1 := 0; {316#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= (+ (select |#length| |ULTIMATE.start_main_~#a~0#1.base|) (- 4192)) 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0))} is VALID [2022-02-20 23:43:07,575 INFO L290 TraceCheckUtils]: 2: Hoare triple {316#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= (+ (select |#length| |ULTIMATE.start_main_~#a~0#1.base|) (- 4192)) 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0))} assume !!(main_~i~0#1 < 1048);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {316#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= (+ (select |#length| |ULTIMATE.start_main_~#a~0#1.base|) (- 4192)) 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0))} is VALID [2022-02-20 23:43:07,576 INFO L290 TraceCheckUtils]: 3: Hoare triple {316#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= (+ (select |#length| |ULTIMATE.start_main_~#a~0#1.base|) (- 4192)) 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0))} assume !(4 + (main_~#a~0#1.offset + 4 * main_~i~0#1) <= #length[main_~#a~0#1.base] && 0 <= main_~#a~0#1.offset + 4 * main_~i~0#1); {315#false} is VALID [2022-02-20 23:43:07,576 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:43:07,576 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:43:07,576 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91193602] [2022-02-20 23:43:07,577 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [91193602] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:43:07,577 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:43:07,577 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:43:07,577 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320857386] [2022-02-20 23:43:07,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:43:07,578 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2022-02-20 23:43:07,578 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:43:07,578 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:07,581 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 4 edges. 4 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:43:07,582 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:43:07,582 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:43:07,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:43:07,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:43:07,582 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:07,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:43:07,613 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2022-02-20 23:43:07,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:43:07,613 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2022-02-20 23:43:07,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:43:07,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:07,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 24 transitions. [2022-02-20 23:43:07,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:07,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 24 transitions. [2022-02-20 23:43:07,615 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 24 transitions. [2022-02-20 23:43:07,637 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:43:07,638 INFO L225 Difference]: With dead ends: 22 [2022-02-20 23:43:07,638 INFO L226 Difference]: Without dead ends: 22 [2022-02-20 23:43:07,639 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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:43:07,639 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 2 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:43:07,640 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 22 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:43:07,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-02-20 23:43:07,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 20. [2022-02-20 23:43:07,641 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:43:07,641 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand has 20 states, 15 states have (on average 1.4) internal successors, (21), 19 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:07,642 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand has 20 states, 15 states have (on average 1.4) internal successors, (21), 19 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:07,642 INFO L87 Difference]: Start difference. First operand 22 states. Second operand has 20 states, 15 states have (on average 1.4) internal successors, (21), 19 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:07,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:43:07,643 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2022-02-20 23:43:07,643 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2022-02-20 23:43:07,643 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:43:07,643 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:43:07,643 INFO L74 IsIncluded]: Start isIncluded. First operand has 20 states, 15 states have (on average 1.4) internal successors, (21), 19 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 22 states. [2022-02-20 23:43:07,644 INFO L87 Difference]: Start difference. First operand has 20 states, 15 states have (on average 1.4) internal successors, (21), 19 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 22 states. [2022-02-20 23:43:07,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:43:07,644 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2022-02-20 23:43:07,644 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2022-02-20 23:43:07,645 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:43:07,645 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:43:07,645 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:43:07,645 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:43:07,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 15 states have (on average 1.4) internal successors, (21), 19 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:07,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2022-02-20 23:43:07,646 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 4 [2022-02-20 23:43:07,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:43:07,646 INFO L470 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2022-02-20 23:43:07,646 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:07,647 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2022-02-20 23:43:07,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-02-20 23:43:07,647 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:43:07,647 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:43:07,647 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 23:43:07,647 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 5 more)] === [2022-02-20 23:43:07,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:43:07,648 INFO L85 PathProgramCache]: Analyzing trace with hash 264435863, now seen corresponding path program 1 times [2022-02-20 23:43:07,648 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:43:07,648 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997681338] [2022-02-20 23:43:07,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:43:07,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:43:07,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:43:07,679 INFO L290 TraceCheckUtils]: 0: Hoare triple {405#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {405#true} is VALID [2022-02-20 23:43:07,679 INFO L290 TraceCheckUtils]: 1: Hoare triple {405#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~post0#1, main_~i~0#1, main_#t~mem3#1, main_#t~mem2#1, main_~#a~0#1.base, main_~#a~0#1.offset;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4192);main_~i~0#1 := 0; {407#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 23:43:07,680 INFO L290 TraceCheckUtils]: 2: Hoare triple {407#(= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < 1048);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {407#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 23:43:07,680 INFO L290 TraceCheckUtils]: 3: Hoare triple {407#(= |ULTIMATE.start_main_~i~0#1| 0)} SUMMARY for call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); srcloc: L14 {407#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 23:43:07,681 INFO L290 TraceCheckUtils]: 4: Hoare triple {407#(= |ULTIMATE.start_main_~i~0#1| 0)} havoc main_#t~nondet1#1; {407#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 23:43:07,681 INFO L290 TraceCheckUtils]: 5: Hoare triple {407#(= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {408#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 23:43:07,682 INFO L290 TraceCheckUtils]: 6: Hoare triple {408#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !(main_~i~0#1 < 1048); {406#false} is VALID [2022-02-20 23:43:07,682 INFO L290 TraceCheckUtils]: 7: Hoare triple {406#false} assume !(4 + (12 + main_~#a~0#1.offset) <= #length[main_~#a~0#1.base] && 0 <= 12 + main_~#a~0#1.offset); {406#false} is VALID [2022-02-20 23:43:07,682 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:43:07,682 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:43:07,682 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997681338] [2022-02-20 23:43:07,683 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1997681338] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 23:43:07,683 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [138717488] [2022-02-20 23:43:07,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:43:07,683 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:43:07,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:43:07,685 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:43:07,686 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:43:07,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:43:07,716 INFO L263 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-20 23:43:07,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:43:07,723 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:43:07,774 INFO L290 TraceCheckUtils]: 0: Hoare triple {405#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {405#true} is VALID [2022-02-20 23:43:07,775 INFO L290 TraceCheckUtils]: 1: Hoare triple {405#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~post0#1, main_~i~0#1, main_#t~mem3#1, main_#t~mem2#1, main_~#a~0#1.base, main_~#a~0#1.offset;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4192);main_~i~0#1 := 0; {415#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 23:43:07,775 INFO L290 TraceCheckUtils]: 2: Hoare triple {415#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < 1048);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {415#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 23:43:07,776 INFO L290 TraceCheckUtils]: 3: Hoare triple {415#(<= |ULTIMATE.start_main_~i~0#1| 0)} SUMMARY for call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); srcloc: L14 {415#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 23:43:07,776 INFO L290 TraceCheckUtils]: 4: Hoare triple {415#(<= |ULTIMATE.start_main_~i~0#1| 0)} havoc main_#t~nondet1#1; {415#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 23:43:07,776 INFO L290 TraceCheckUtils]: 5: Hoare triple {415#(<= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {408#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 23:43:07,777 INFO L290 TraceCheckUtils]: 6: Hoare triple {408#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !(main_~i~0#1 < 1048); {406#false} is VALID [2022-02-20 23:43:07,777 INFO L290 TraceCheckUtils]: 7: Hoare triple {406#false} assume !(4 + (12 + main_~#a~0#1.offset) <= #length[main_~#a~0#1.base] && 0 <= 12 + main_~#a~0#1.offset); {406#false} is VALID [2022-02-20 23:43:07,777 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:43:07,777 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:43:07,820 INFO L290 TraceCheckUtils]: 7: Hoare triple {406#false} assume !(4 + (12 + main_~#a~0#1.offset) <= #length[main_~#a~0#1.base] && 0 <= 12 + main_~#a~0#1.offset); {406#false} is VALID [2022-02-20 23:43:07,820 INFO L290 TraceCheckUtils]: 6: Hoare triple {437#(< |ULTIMATE.start_main_~i~0#1| 1048)} assume !(main_~i~0#1 < 1048); {406#false} is VALID [2022-02-20 23:43:07,821 INFO L290 TraceCheckUtils]: 5: Hoare triple {441#(< |ULTIMATE.start_main_~i~0#1| 1047)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {437#(< |ULTIMATE.start_main_~i~0#1| 1048)} is VALID [2022-02-20 23:43:07,821 INFO L290 TraceCheckUtils]: 4: Hoare triple {441#(< |ULTIMATE.start_main_~i~0#1| 1047)} havoc main_#t~nondet1#1; {441#(< |ULTIMATE.start_main_~i~0#1| 1047)} is VALID [2022-02-20 23:43:07,822 INFO L290 TraceCheckUtils]: 3: Hoare triple {441#(< |ULTIMATE.start_main_~i~0#1| 1047)} SUMMARY for call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); srcloc: L14 {441#(< |ULTIMATE.start_main_~i~0#1| 1047)} is VALID [2022-02-20 23:43:07,822 INFO L290 TraceCheckUtils]: 2: Hoare triple {441#(< |ULTIMATE.start_main_~i~0#1| 1047)} assume !!(main_~i~0#1 < 1048);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {441#(< |ULTIMATE.start_main_~i~0#1| 1047)} is VALID [2022-02-20 23:43:07,823 INFO L290 TraceCheckUtils]: 1: Hoare triple {405#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~post0#1, main_~i~0#1, main_#t~mem3#1, main_#t~mem2#1, main_~#a~0#1.base, main_~#a~0#1.offset;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4192);main_~i~0#1 := 0; {441#(< |ULTIMATE.start_main_~i~0#1| 1047)} is VALID [2022-02-20 23:43:07,823 INFO L290 TraceCheckUtils]: 0: Hoare triple {405#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {405#true} is VALID [2022-02-20 23:43:07,823 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:43:07,823 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [138717488] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 23:43:07,823 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 23:43:07,824 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2022-02-20 23:43:07,824 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982243108] [2022-02-20 23:43:07,824 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 23:43:07,824 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-02-20 23:43:07,825 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:43:07,825 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:07,837 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:43:07,838 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 23:43:07,838 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:43:07,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 23:43:07,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-02-20 23:43:07,839 INFO L87 Difference]: Start difference. First operand 20 states and 21 transitions. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:07,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:43:07,894 INFO L93 Difference]: Finished difference Result 33 states and 34 transitions. [2022-02-20 23:43:07,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 23:43:07,894 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-02-20 23:43:07,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:43:07,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:07,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 37 transitions. [2022-02-20 23:43:07,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:07,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 37 transitions. [2022-02-20 23:43:07,896 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 37 transitions. [2022-02-20 23:43:07,921 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:43:07,922 INFO L225 Difference]: With dead ends: 33 [2022-02-20 23:43:07,922 INFO L226 Difference]: Without dead ends: 33 [2022-02-20 23:43:07,923 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-02-20 23:43:07,923 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 16 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:43:07,924 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 43 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:43:07,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-02-20 23:43:07,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 31. [2022-02-20 23:43:07,926 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:43:07,926 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand has 31 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 30 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:07,926 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand has 31 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 30 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:07,926 INFO L87 Difference]: Start difference. First operand 33 states. Second operand has 31 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 30 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:07,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:43:07,927 INFO L93 Difference]: Finished difference Result 33 states and 34 transitions. [2022-02-20 23:43:07,927 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2022-02-20 23:43:07,928 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:43:07,928 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:43:07,928 INFO L74 IsIncluded]: Start isIncluded. First operand has 31 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 30 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 33 states. [2022-02-20 23:43:07,928 INFO L87 Difference]: Start difference. First operand has 31 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 30 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 33 states. [2022-02-20 23:43:07,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:43:07,929 INFO L93 Difference]: Finished difference Result 33 states and 34 transitions. [2022-02-20 23:43:07,929 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2022-02-20 23:43:07,929 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:43:07,929 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:43:07,930 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:43:07,930 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:43:07,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 30 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:07,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2022-02-20 23:43:07,931 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 8 [2022-02-20 23:43:07,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:43:07,931 INFO L470 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2022-02-20 23:43:07,931 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:07,931 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2022-02-20 23:43:07,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-02-20 23:43:07,932 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:43:07,932 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2022-02-20 23:43:07,949 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-02-20 23:43:08,149 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:43:08,149 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 5 more)] === [2022-02-20 23:43:08,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:43:08,150 INFO L85 PathProgramCache]: Analyzing trace with hash 264435913, now seen corresponding path program 1 times [2022-02-20 23:43:08,150 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:43:08,150 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860835233] [2022-02-20 23:43:08,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:43:08,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:43:08,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:43:08,219 INFO L290 TraceCheckUtils]: 0: Hoare triple {586#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {586#true} is VALID [2022-02-20 23:43:08,220 INFO L290 TraceCheckUtils]: 1: Hoare triple {586#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~post0#1, main_~i~0#1, main_#t~mem3#1, main_#t~mem2#1, main_~#a~0#1.base, main_~#a~0#1.offset;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4192);main_~i~0#1 := 0; {588#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= (+ (select |#length| |ULTIMATE.start_main_~#a~0#1.base|) (- 4192)) 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0))} is VALID [2022-02-20 23:43:08,220 INFO L290 TraceCheckUtils]: 2: Hoare triple {588#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= (+ (select |#length| |ULTIMATE.start_main_~#a~0#1.base|) (- 4192)) 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0))} assume !!(main_~i~0#1 < 1048);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {588#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= (+ (select |#length| |ULTIMATE.start_main_~#a~0#1.base|) (- 4192)) 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0))} is VALID [2022-02-20 23:43:08,221 INFO L290 TraceCheckUtils]: 3: Hoare triple {588#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= (+ (select |#length| |ULTIMATE.start_main_~#a~0#1.base|) (- 4192)) 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0))} SUMMARY for call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); srcloc: L14 {588#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= (+ (select |#length| |ULTIMATE.start_main_~#a~0#1.base|) (- 4192)) 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0))} is VALID [2022-02-20 23:43:08,221 INFO L290 TraceCheckUtils]: 4: Hoare triple {588#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= (+ (select |#length| |ULTIMATE.start_main_~#a~0#1.base|) (- 4192)) 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0))} havoc main_#t~nondet1#1; {588#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= (+ (select |#length| |ULTIMATE.start_main_~#a~0#1.base|) (- 4192)) 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0))} is VALID [2022-02-20 23:43:08,222 INFO L290 TraceCheckUtils]: 5: Hoare triple {588#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= (+ (select |#length| |ULTIMATE.start_main_~#a~0#1.base|) (- 4192)) 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0))} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {589#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (= (+ (select |#length| |ULTIMATE.start_main_~#a~0#1.base|) (- 4192)) 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0))} is VALID [2022-02-20 23:43:08,222 INFO L290 TraceCheckUtils]: 6: Hoare triple {589#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (= (+ (select |#length| |ULTIMATE.start_main_~#a~0#1.base|) (- 4192)) 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0))} assume !!(main_~i~0#1 < 1048);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {590#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (= (+ (select |#length| |ULTIMATE.start_main_~#a~0#1.base|) (- 4192)) 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0) (<= |ULTIMATE.start_main_~i~0#1| 1047))} is VALID [2022-02-20 23:43:08,223 INFO L290 TraceCheckUtils]: 7: Hoare triple {590#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (= (+ (select |#length| |ULTIMATE.start_main_~#a~0#1.base|) (- 4192)) 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0) (<= |ULTIMATE.start_main_~i~0#1| 1047))} assume !(4 + (main_~#a~0#1.offset + 4 * main_~i~0#1) <= #length[main_~#a~0#1.base] && 0 <= main_~#a~0#1.offset + 4 * main_~i~0#1); {587#false} is VALID [2022-02-20 23:43:08,223 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:43:08,223 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:43:08,224 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860835233] [2022-02-20 23:43:08,224 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1860835233] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 23:43:08,224 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [596710798] [2022-02-20 23:43:08,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:43:08,224 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:43:08,224 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:43:08,225 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:43:08,226 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:43:08,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:43:08,254 INFO L263 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 9 conjunts are in the unsatisfiable core [2022-02-20 23:43:08,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:43:08,259 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:43:08,310 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:43:08,387 INFO L290 TraceCheckUtils]: 0: Hoare triple {586#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {586#true} is VALID [2022-02-20 23:43:08,388 INFO L290 TraceCheckUtils]: 1: Hoare triple {586#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~post0#1, main_~i~0#1, main_#t~mem3#1, main_#t~mem2#1, main_~#a~0#1.base, main_~#a~0#1.offset;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4192);main_~i~0#1 := 0; {597#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 4192 (select |#length| |ULTIMATE.start_main_~#a~0#1.base|)) (= |ULTIMATE.start_main_~#a~0#1.offset| 0))} is VALID [2022-02-20 23:43:08,389 INFO L290 TraceCheckUtils]: 2: Hoare triple {597#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 4192 (select |#length| |ULTIMATE.start_main_~#a~0#1.base|)) (= |ULTIMATE.start_main_~#a~0#1.offset| 0))} assume !!(main_~i~0#1 < 1048);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {597#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 4192 (select |#length| |ULTIMATE.start_main_~#a~0#1.base|)) (= |ULTIMATE.start_main_~#a~0#1.offset| 0))} is VALID [2022-02-20 23:43:08,389 INFO L290 TraceCheckUtils]: 3: Hoare triple {597#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 4192 (select |#length| |ULTIMATE.start_main_~#a~0#1.base|)) (= |ULTIMATE.start_main_~#a~0#1.offset| 0))} SUMMARY for call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); srcloc: L14 {597#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 4192 (select |#length| |ULTIMATE.start_main_~#a~0#1.base|)) (= |ULTIMATE.start_main_~#a~0#1.offset| 0))} is VALID [2022-02-20 23:43:08,390 INFO L290 TraceCheckUtils]: 4: Hoare triple {597#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 4192 (select |#length| |ULTIMATE.start_main_~#a~0#1.base|)) (= |ULTIMATE.start_main_~#a~0#1.offset| 0))} havoc main_#t~nondet1#1; {597#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 4192 (select |#length| |ULTIMATE.start_main_~#a~0#1.base|)) (= |ULTIMATE.start_main_~#a~0#1.offset| 0))} is VALID [2022-02-20 23:43:08,390 INFO L290 TraceCheckUtils]: 5: Hoare triple {597#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 4192 (select |#length| |ULTIMATE.start_main_~#a~0#1.base|)) (= |ULTIMATE.start_main_~#a~0#1.offset| 0))} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {610#(and (= 0 (+ (- 1) |ULTIMATE.start_main_~i~0#1|)) (<= 4192 (select |#length| |ULTIMATE.start_main_~#a~0#1.base|)) (= |ULTIMATE.start_main_~#a~0#1.offset| 0))} is VALID [2022-02-20 23:43:08,391 INFO L290 TraceCheckUtils]: 6: Hoare triple {610#(and (= 0 (+ (- 1) |ULTIMATE.start_main_~i~0#1|)) (<= 4192 (select |#length| |ULTIMATE.start_main_~#a~0#1.base|)) (= |ULTIMATE.start_main_~#a~0#1.offset| 0))} assume !!(main_~i~0#1 < 1048);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {610#(and (= 0 (+ (- 1) |ULTIMATE.start_main_~i~0#1|)) (<= 4192 (select |#length| |ULTIMATE.start_main_~#a~0#1.base|)) (= |ULTIMATE.start_main_~#a~0#1.offset| 0))} is VALID [2022-02-20 23:43:08,392 INFO L290 TraceCheckUtils]: 7: Hoare triple {610#(and (= 0 (+ (- 1) |ULTIMATE.start_main_~i~0#1|)) (<= 4192 (select |#length| |ULTIMATE.start_main_~#a~0#1.base|)) (= |ULTIMATE.start_main_~#a~0#1.offset| 0))} assume !(4 + (main_~#a~0#1.offset + 4 * main_~i~0#1) <= #length[main_~#a~0#1.base] && 0 <= main_~#a~0#1.offset + 4 * main_~i~0#1); {587#false} is VALID [2022-02-20 23:43:08,392 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:43:08,392 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:43:08,479 INFO L290 TraceCheckUtils]: 7: Hoare triple {617#(and (<= (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 4) (select |#length| |ULTIMATE.start_main_~#a~0#1.base|)) (<= 0 (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))))} assume !(4 + (main_~#a~0#1.offset + 4 * main_~i~0#1) <= #length[main_~#a~0#1.base] && 0 <= main_~#a~0#1.offset + 4 * main_~i~0#1); {587#false} is VALID [2022-02-20 23:43:08,479 INFO L290 TraceCheckUtils]: 6: Hoare triple {617#(and (<= (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 4) (select |#length| |ULTIMATE.start_main_~#a~0#1.base|)) (<= 0 (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))))} assume !!(main_~i~0#1 < 1048);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {617#(and (<= (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 4) (select |#length| |ULTIMATE.start_main_~#a~0#1.base|)) (<= 0 (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))))} is VALID [2022-02-20 23:43:08,480 INFO L290 TraceCheckUtils]: 5: Hoare triple {624#(and (<= (+ |ULTIMATE.start_main_~#a~0#1.offset| 8 (* |ULTIMATE.start_main_~i~0#1| 4)) (select |#length| |ULTIMATE.start_main_~#a~0#1.base|)) (<= 0 (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 4)))} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {617#(and (<= (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 4) (select |#length| |ULTIMATE.start_main_~#a~0#1.base|)) (<= 0 (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))))} is VALID [2022-02-20 23:43:08,481 INFO L290 TraceCheckUtils]: 4: Hoare triple {624#(and (<= (+ |ULTIMATE.start_main_~#a~0#1.offset| 8 (* |ULTIMATE.start_main_~i~0#1| 4)) (select |#length| |ULTIMATE.start_main_~#a~0#1.base|)) (<= 0 (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 4)))} havoc main_#t~nondet1#1; {624#(and (<= (+ |ULTIMATE.start_main_~#a~0#1.offset| 8 (* |ULTIMATE.start_main_~i~0#1| 4)) (select |#length| |ULTIMATE.start_main_~#a~0#1.base|)) (<= 0 (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 4)))} is VALID [2022-02-20 23:43:08,481 INFO L290 TraceCheckUtils]: 3: Hoare triple {624#(and (<= (+ |ULTIMATE.start_main_~#a~0#1.offset| 8 (* |ULTIMATE.start_main_~i~0#1| 4)) (select |#length| |ULTIMATE.start_main_~#a~0#1.base|)) (<= 0 (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 4)))} SUMMARY for call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); srcloc: L14 {624#(and (<= (+ |ULTIMATE.start_main_~#a~0#1.offset| 8 (* |ULTIMATE.start_main_~i~0#1| 4)) (select |#length| |ULTIMATE.start_main_~#a~0#1.base|)) (<= 0 (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 4)))} is VALID [2022-02-20 23:43:08,482 INFO L290 TraceCheckUtils]: 2: Hoare triple {624#(and (<= (+ |ULTIMATE.start_main_~#a~0#1.offset| 8 (* |ULTIMATE.start_main_~i~0#1| 4)) (select |#length| |ULTIMATE.start_main_~#a~0#1.base|)) (<= 0 (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 4)))} assume !!(main_~i~0#1 < 1048);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {624#(and (<= (+ |ULTIMATE.start_main_~#a~0#1.offset| 8 (* |ULTIMATE.start_main_~i~0#1| 4)) (select |#length| |ULTIMATE.start_main_~#a~0#1.base|)) (<= 0 (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 4)))} is VALID [2022-02-20 23:43:08,482 INFO L290 TraceCheckUtils]: 1: Hoare triple {586#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~post0#1, main_~i~0#1, main_#t~mem3#1, main_#t~mem2#1, main_~#a~0#1.base, main_~#a~0#1.offset;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4192);main_~i~0#1 := 0; {624#(and (<= (+ |ULTIMATE.start_main_~#a~0#1.offset| 8 (* |ULTIMATE.start_main_~i~0#1| 4)) (select |#length| |ULTIMATE.start_main_~#a~0#1.base|)) (<= 0 (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 4)))} is VALID [2022-02-20 23:43:08,483 INFO L290 TraceCheckUtils]: 0: Hoare triple {586#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {586#true} is VALID [2022-02-20 23:43:08,483 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:43:08,483 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [596710798] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 23:43:08,483 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 23:43:08,483 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 8 [2022-02-20 23:43:08,483 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247879080] [2022-02-20 23:43:08,484 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 23:43:08,484 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.75) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-02-20 23:43:08,484 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:43:08,484 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 8 states have (on average 2.75) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:08,500 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:43:08,500 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 23:43:08,500 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:43:08,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 23:43:08,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2022-02-20 23:43:08,501 INFO L87 Difference]: Start difference. First operand 31 states and 34 transitions. Second operand has 9 states, 8 states have (on average 2.75) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:08,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:43:08,663 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2022-02-20 23:43:08,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 23:43:08,663 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.75) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-02-20 23:43:08,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:43:08,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 2.75) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:08,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 34 transitions. [2022-02-20 23:43:08,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 2.75) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:08,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 34 transitions. [2022-02-20 23:43:08,665 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 34 transitions. [2022-02-20 23:43:08,691 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:43:08,692 INFO L225 Difference]: With dead ends: 27 [2022-02-20 23:43:08,692 INFO L226 Difference]: Without dead ends: 27 [2022-02-20 23:43:08,692 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2022-02-20 23:43:08,693 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 25 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:43:08,693 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [25 Valid, 37 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:43:08,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-02-20 23:43:08,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-02-20 23:43:08,695 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:43:08,695 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand has 27 states, 26 states have (on average 1.0769230769230769) internal successors, (28), 26 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:08,695 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand has 27 states, 26 states have (on average 1.0769230769230769) internal successors, (28), 26 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:08,695 INFO L87 Difference]: Start difference. First operand 27 states. Second operand has 27 states, 26 states have (on average 1.0769230769230769) internal successors, (28), 26 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:08,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:43:08,696 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2022-02-20 23:43:08,696 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2022-02-20 23:43:08,696 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:43:08,697 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:43:08,697 INFO L74 IsIncluded]: Start isIncluded. First operand has 27 states, 26 states have (on average 1.0769230769230769) internal successors, (28), 26 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 27 states. [2022-02-20 23:43:08,697 INFO L87 Difference]: Start difference. First operand has 27 states, 26 states have (on average 1.0769230769230769) internal successors, (28), 26 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 27 states. [2022-02-20 23:43:08,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:43:08,698 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2022-02-20 23:43:08,698 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2022-02-20 23:43:08,698 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:43:08,698 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:43:08,698 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:43:08,698 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:43:08,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.0769230769230769) internal successors, (28), 26 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:08,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2022-02-20 23:43:08,699 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 8 [2022-02-20 23:43:08,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:43:08,699 INFO L470 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2022-02-20 23:43:08,699 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.75) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:08,700 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2022-02-20 23:43:08,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-02-20 23:43:08,700 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:43:08,700 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:43:08,717 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:43:08,916 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,SelfDestructingSolverStorable5 [2022-02-20 23:43:08,916 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 5 more)] === [2022-02-20 23:43:08,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:43:08,917 INFO L85 PathProgramCache]: Analyzing trace with hash 868272224, now seen corresponding path program 1 times [2022-02-20 23:43:08,917 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:43:08,917 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503706989] [2022-02-20 23:43:08,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:43:08,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:43:08,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:43:09,019 INFO L290 TraceCheckUtils]: 0: Hoare triple {751#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {751#true} is VALID [2022-02-20 23:43:09,019 INFO L290 TraceCheckUtils]: 1: Hoare triple {751#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~post0#1, main_~i~0#1, main_#t~mem3#1, main_#t~mem2#1, main_~#a~0#1.base, main_~#a~0#1.offset;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4192);main_~i~0#1 := 0; {753#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 23:43:09,020 INFO L290 TraceCheckUtils]: 2: Hoare triple {753#(= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < 1048);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {753#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 23:43:09,020 INFO L290 TraceCheckUtils]: 3: Hoare triple {753#(= |ULTIMATE.start_main_~i~0#1| 0)} SUMMARY for call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); srcloc: L14 {753#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 23:43:09,020 INFO L290 TraceCheckUtils]: 4: Hoare triple {753#(= |ULTIMATE.start_main_~i~0#1| 0)} havoc main_#t~nondet1#1; {753#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 23:43:09,021 INFO L290 TraceCheckUtils]: 5: Hoare triple {753#(= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {754#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 23:43:09,021 INFO L290 TraceCheckUtils]: 6: Hoare triple {754#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !!(main_~i~0#1 < 1048);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {754#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 23:43:09,021 INFO L290 TraceCheckUtils]: 7: Hoare triple {754#(<= |ULTIMATE.start_main_~i~0#1| 1)} SUMMARY for call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); srcloc: L14 {754#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 23:43:09,022 INFO L290 TraceCheckUtils]: 8: Hoare triple {754#(<= |ULTIMATE.start_main_~i~0#1| 1)} havoc main_#t~nondet1#1; {754#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 23:43:09,022 INFO L290 TraceCheckUtils]: 9: Hoare triple {754#(<= |ULTIMATE.start_main_~i~0#1| 1)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {755#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-20 23:43:09,023 INFO L290 TraceCheckUtils]: 10: Hoare triple {755#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !!(main_~i~0#1 < 1048);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {755#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-20 23:43:09,023 INFO L290 TraceCheckUtils]: 11: Hoare triple {755#(<= |ULTIMATE.start_main_~i~0#1| 2)} SUMMARY for call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); srcloc: L14 {755#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-20 23:43:09,023 INFO L290 TraceCheckUtils]: 12: Hoare triple {755#(<= |ULTIMATE.start_main_~i~0#1| 2)} havoc main_#t~nondet1#1; {755#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-20 23:43:09,024 INFO L290 TraceCheckUtils]: 13: Hoare triple {755#(<= |ULTIMATE.start_main_~i~0#1| 2)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {756#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-20 23:43:09,024 INFO L290 TraceCheckUtils]: 14: Hoare triple {756#(<= |ULTIMATE.start_main_~i~0#1| 3)} assume !!(main_~i~0#1 < 1048);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {756#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-20 23:43:09,024 INFO L290 TraceCheckUtils]: 15: Hoare triple {756#(<= |ULTIMATE.start_main_~i~0#1| 3)} SUMMARY for call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); srcloc: L14 {756#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-20 23:43:09,025 INFO L290 TraceCheckUtils]: 16: Hoare triple {756#(<= |ULTIMATE.start_main_~i~0#1| 3)} havoc main_#t~nondet1#1; {756#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-20 23:43:09,025 INFO L290 TraceCheckUtils]: 17: Hoare triple {756#(<= |ULTIMATE.start_main_~i~0#1| 3)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {757#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-20 23:43:09,026 INFO L290 TraceCheckUtils]: 18: Hoare triple {757#(<= |ULTIMATE.start_main_~i~0#1| 4)} assume !(main_~i~0#1 < 1048); {752#false} is VALID [2022-02-20 23:43:09,026 INFO L290 TraceCheckUtils]: 19: Hoare triple {752#false} SUMMARY for call main_#t~mem2#1 := read~int(main_~#a~0#1.base, 12 + main_~#a~0#1.offset, 4); srcloc: L17-2 {752#false} is VALID [2022-02-20 23:43:09,026 INFO L290 TraceCheckUtils]: 20: Hoare triple {752#false} assume !(main_#t~mem2#1 >= 0);havoc main_#t~mem2#1; {752#false} is VALID [2022-02-20 23:43:09,026 INFO L290 TraceCheckUtils]: 21: Hoare triple {752#false} main_#res#1 := 0;call ULTIMATE.dealloc(main_~#a~0#1.base, main_~#a~0#1.offset);havoc main_~#a~0#1.base, main_~#a~0#1.offset; {752#false} is VALID [2022-02-20 23:43:09,026 INFO L290 TraceCheckUtils]: 22: Hoare triple {752#false} assume !(#valid == main_old_#valid#1); {752#false} is VALID [2022-02-20 23:43:09,027 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:43:09,027 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:43:09,027 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503706989] [2022-02-20 23:43:09,027 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [503706989] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 23:43:09,027 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1097503442] [2022-02-20 23:43:09,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:43:09,028 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:43:09,028 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:43:09,029 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:43:09,030 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:43:09,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:43:09,070 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-20 23:43:09,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:43:09,077 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:43:09,165 INFO L290 TraceCheckUtils]: 0: Hoare triple {751#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {751#true} is VALID [2022-02-20 23:43:09,165 INFO L290 TraceCheckUtils]: 1: Hoare triple {751#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~post0#1, main_~i~0#1, main_#t~mem3#1, main_#t~mem2#1, main_~#a~0#1.base, main_~#a~0#1.offset;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4192);main_~i~0#1 := 0; {764#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 23:43:09,166 INFO L290 TraceCheckUtils]: 2: Hoare triple {764#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < 1048);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {764#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 23:43:09,166 INFO L290 TraceCheckUtils]: 3: Hoare triple {764#(<= |ULTIMATE.start_main_~i~0#1| 0)} SUMMARY for call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); srcloc: L14 {764#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 23:43:09,166 INFO L290 TraceCheckUtils]: 4: Hoare triple {764#(<= |ULTIMATE.start_main_~i~0#1| 0)} havoc main_#t~nondet1#1; {764#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 23:43:09,167 INFO L290 TraceCheckUtils]: 5: Hoare triple {764#(<= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {754#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 23:43:09,167 INFO L290 TraceCheckUtils]: 6: Hoare triple {754#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !!(main_~i~0#1 < 1048);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {754#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 23:43:09,167 INFO L290 TraceCheckUtils]: 7: Hoare triple {754#(<= |ULTIMATE.start_main_~i~0#1| 1)} SUMMARY for call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); srcloc: L14 {754#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 23:43:09,168 INFO L290 TraceCheckUtils]: 8: Hoare triple {754#(<= |ULTIMATE.start_main_~i~0#1| 1)} havoc main_#t~nondet1#1; {754#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 23:43:09,168 INFO L290 TraceCheckUtils]: 9: Hoare triple {754#(<= |ULTIMATE.start_main_~i~0#1| 1)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {755#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-20 23:43:09,169 INFO L290 TraceCheckUtils]: 10: Hoare triple {755#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !!(main_~i~0#1 < 1048);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {755#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-20 23:43:09,169 INFO L290 TraceCheckUtils]: 11: Hoare triple {755#(<= |ULTIMATE.start_main_~i~0#1| 2)} SUMMARY for call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); srcloc: L14 {755#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-20 23:43:09,169 INFO L290 TraceCheckUtils]: 12: Hoare triple {755#(<= |ULTIMATE.start_main_~i~0#1| 2)} havoc main_#t~nondet1#1; {755#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-20 23:43:09,170 INFO L290 TraceCheckUtils]: 13: Hoare triple {755#(<= |ULTIMATE.start_main_~i~0#1| 2)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {756#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-20 23:43:09,170 INFO L290 TraceCheckUtils]: 14: Hoare triple {756#(<= |ULTIMATE.start_main_~i~0#1| 3)} assume !!(main_~i~0#1 < 1048);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {756#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-20 23:43:09,170 INFO L290 TraceCheckUtils]: 15: Hoare triple {756#(<= |ULTIMATE.start_main_~i~0#1| 3)} SUMMARY for call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); srcloc: L14 {756#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-20 23:43:09,171 INFO L290 TraceCheckUtils]: 16: Hoare triple {756#(<= |ULTIMATE.start_main_~i~0#1| 3)} havoc main_#t~nondet1#1; {756#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-20 23:43:09,171 INFO L290 TraceCheckUtils]: 17: Hoare triple {756#(<= |ULTIMATE.start_main_~i~0#1| 3)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {757#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-20 23:43:09,172 INFO L290 TraceCheckUtils]: 18: Hoare triple {757#(<= |ULTIMATE.start_main_~i~0#1| 4)} assume !(main_~i~0#1 < 1048); {752#false} is VALID [2022-02-20 23:43:09,172 INFO L290 TraceCheckUtils]: 19: Hoare triple {752#false} SUMMARY for call main_#t~mem2#1 := read~int(main_~#a~0#1.base, 12 + main_~#a~0#1.offset, 4); srcloc: L17-2 {752#false} is VALID [2022-02-20 23:43:09,172 INFO L290 TraceCheckUtils]: 20: Hoare triple {752#false} assume !(main_#t~mem2#1 >= 0);havoc main_#t~mem2#1; {752#false} is VALID [2022-02-20 23:43:09,172 INFO L290 TraceCheckUtils]: 21: Hoare triple {752#false} main_#res#1 := 0;call ULTIMATE.dealloc(main_~#a~0#1.base, main_~#a~0#1.offset);havoc main_~#a~0#1.base, main_~#a~0#1.offset; {752#false} is VALID [2022-02-20 23:43:09,172 INFO L290 TraceCheckUtils]: 22: Hoare triple {752#false} assume !(#valid == main_old_#valid#1); {752#false} is VALID [2022-02-20 23:43:09,172 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:43:09,173 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:43:09,295 INFO L290 TraceCheckUtils]: 22: Hoare triple {752#false} assume !(#valid == main_old_#valid#1); {752#false} is VALID [2022-02-20 23:43:09,295 INFO L290 TraceCheckUtils]: 21: Hoare triple {752#false} main_#res#1 := 0;call ULTIMATE.dealloc(main_~#a~0#1.base, main_~#a~0#1.offset);havoc main_~#a~0#1.base, main_~#a~0#1.offset; {752#false} is VALID [2022-02-20 23:43:09,295 INFO L290 TraceCheckUtils]: 20: Hoare triple {752#false} assume !(main_#t~mem2#1 >= 0);havoc main_#t~mem2#1; {752#false} is VALID [2022-02-20 23:43:09,295 INFO L290 TraceCheckUtils]: 19: Hoare triple {752#false} SUMMARY for call main_#t~mem2#1 := read~int(main_~#a~0#1.base, 12 + main_~#a~0#1.offset, 4); srcloc: L17-2 {752#false} is VALID [2022-02-20 23:43:09,296 INFO L290 TraceCheckUtils]: 18: Hoare triple {840#(< |ULTIMATE.start_main_~i~0#1| 1048)} assume !(main_~i~0#1 < 1048); {752#false} is VALID [2022-02-20 23:43:09,296 INFO L290 TraceCheckUtils]: 17: Hoare triple {844#(< |ULTIMATE.start_main_~i~0#1| 1047)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {840#(< |ULTIMATE.start_main_~i~0#1| 1048)} is VALID [2022-02-20 23:43:09,297 INFO L290 TraceCheckUtils]: 16: Hoare triple {844#(< |ULTIMATE.start_main_~i~0#1| 1047)} havoc main_#t~nondet1#1; {844#(< |ULTIMATE.start_main_~i~0#1| 1047)} is VALID [2022-02-20 23:43:09,297 INFO L290 TraceCheckUtils]: 15: Hoare triple {844#(< |ULTIMATE.start_main_~i~0#1| 1047)} SUMMARY for call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); srcloc: L14 {844#(< |ULTIMATE.start_main_~i~0#1| 1047)} is VALID [2022-02-20 23:43:09,297 INFO L290 TraceCheckUtils]: 14: Hoare triple {844#(< |ULTIMATE.start_main_~i~0#1| 1047)} assume !!(main_~i~0#1 < 1048);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {844#(< |ULTIMATE.start_main_~i~0#1| 1047)} is VALID [2022-02-20 23:43:09,298 INFO L290 TraceCheckUtils]: 13: Hoare triple {857#(< |ULTIMATE.start_main_~i~0#1| 1046)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {844#(< |ULTIMATE.start_main_~i~0#1| 1047)} is VALID [2022-02-20 23:43:09,298 INFO L290 TraceCheckUtils]: 12: Hoare triple {857#(< |ULTIMATE.start_main_~i~0#1| 1046)} havoc main_#t~nondet1#1; {857#(< |ULTIMATE.start_main_~i~0#1| 1046)} is VALID [2022-02-20 23:43:09,299 INFO L290 TraceCheckUtils]: 11: Hoare triple {857#(< |ULTIMATE.start_main_~i~0#1| 1046)} SUMMARY for call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); srcloc: L14 {857#(< |ULTIMATE.start_main_~i~0#1| 1046)} is VALID [2022-02-20 23:43:09,299 INFO L290 TraceCheckUtils]: 10: Hoare triple {857#(< |ULTIMATE.start_main_~i~0#1| 1046)} assume !!(main_~i~0#1 < 1048);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {857#(< |ULTIMATE.start_main_~i~0#1| 1046)} is VALID [2022-02-20 23:43:09,300 INFO L290 TraceCheckUtils]: 9: Hoare triple {870#(< |ULTIMATE.start_main_~i~0#1| 1045)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {857#(< |ULTIMATE.start_main_~i~0#1| 1046)} is VALID [2022-02-20 23:43:09,300 INFO L290 TraceCheckUtils]: 8: Hoare triple {870#(< |ULTIMATE.start_main_~i~0#1| 1045)} havoc main_#t~nondet1#1; {870#(< |ULTIMATE.start_main_~i~0#1| 1045)} is VALID [2022-02-20 23:43:09,300 INFO L290 TraceCheckUtils]: 7: Hoare triple {870#(< |ULTIMATE.start_main_~i~0#1| 1045)} SUMMARY for call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); srcloc: L14 {870#(< |ULTIMATE.start_main_~i~0#1| 1045)} is VALID [2022-02-20 23:43:09,301 INFO L290 TraceCheckUtils]: 6: Hoare triple {870#(< |ULTIMATE.start_main_~i~0#1| 1045)} assume !!(main_~i~0#1 < 1048);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {870#(< |ULTIMATE.start_main_~i~0#1| 1045)} is VALID [2022-02-20 23:43:09,301 INFO L290 TraceCheckUtils]: 5: Hoare triple {883#(< |ULTIMATE.start_main_~i~0#1| 1044)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {870#(< |ULTIMATE.start_main_~i~0#1| 1045)} is VALID [2022-02-20 23:43:09,302 INFO L290 TraceCheckUtils]: 4: Hoare triple {883#(< |ULTIMATE.start_main_~i~0#1| 1044)} havoc main_#t~nondet1#1; {883#(< |ULTIMATE.start_main_~i~0#1| 1044)} is VALID [2022-02-20 23:43:09,302 INFO L290 TraceCheckUtils]: 3: Hoare triple {883#(< |ULTIMATE.start_main_~i~0#1| 1044)} SUMMARY for call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); srcloc: L14 {883#(< |ULTIMATE.start_main_~i~0#1| 1044)} is VALID [2022-02-20 23:43:09,302 INFO L290 TraceCheckUtils]: 2: Hoare triple {883#(< |ULTIMATE.start_main_~i~0#1| 1044)} assume !!(main_~i~0#1 < 1048);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {883#(< |ULTIMATE.start_main_~i~0#1| 1044)} is VALID [2022-02-20 23:43:09,303 INFO L290 TraceCheckUtils]: 1: Hoare triple {751#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~post0#1, main_~i~0#1, main_#t~mem3#1, main_#t~mem2#1, main_~#a~0#1.base, main_~#a~0#1.offset;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4192);main_~i~0#1 := 0; {883#(< |ULTIMATE.start_main_~i~0#1| 1044)} is VALID [2022-02-20 23:43:09,303 INFO L290 TraceCheckUtils]: 0: Hoare triple {751#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {751#true} is VALID [2022-02-20 23:43:09,303 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:43:09,303 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1097503442] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 23:43:09,304 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 23:43:09,304 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2022-02-20 23:43:09,304 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509895953] [2022-02-20 23:43:09,304 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 23:43:09,304 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 13 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-02-20 23:43:09,305 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:43:09,305 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 13 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:09,336 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:43:09,336 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-02-20 23:43:09,336 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:43:09,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-02-20 23:43:09,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2022-02-20 23:43:09,337 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand has 13 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 13 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:09,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:43:09,413 INFO L93 Difference]: Finished difference Result 51 states and 52 transitions. [2022-02-20 23:43:09,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-20 23:43:09,414 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 13 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-02-20 23:43:09,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:43:09,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 13 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:09,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 58 transitions. [2022-02-20 23:43:09,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 13 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:09,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 58 transitions. [2022-02-20 23:43:09,416 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 58 transitions. [2022-02-20 23:43:09,462 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:43:09,463 INFO L225 Difference]: With dead ends: 51 [2022-02-20 23:43:09,463 INFO L226 Difference]: Without dead ends: 51 [2022-02-20 23:43:09,463 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2022-02-20 23:43:09,464 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 30 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:43:09,464 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 39 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:43:09,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-02-20 23:43:09,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2022-02-20 23:43:09,466 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:43:09,466 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand has 51 states, 50 states have (on average 1.04) internal successors, (52), 50 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:09,467 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand has 51 states, 50 states have (on average 1.04) internal successors, (52), 50 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:09,467 INFO L87 Difference]: Start difference. First operand 51 states. Second operand has 51 states, 50 states have (on average 1.04) internal successors, (52), 50 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:09,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:43:09,468 INFO L93 Difference]: Finished difference Result 51 states and 52 transitions. [2022-02-20 23:43:09,468 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 52 transitions. [2022-02-20 23:43:09,469 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:43:09,469 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:43:09,469 INFO L74 IsIncluded]: Start isIncluded. First operand has 51 states, 50 states have (on average 1.04) internal successors, (52), 50 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 51 states. [2022-02-20 23:43:09,469 INFO L87 Difference]: Start difference. First operand has 51 states, 50 states have (on average 1.04) internal successors, (52), 50 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 51 states. [2022-02-20 23:43:09,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:43:09,470 INFO L93 Difference]: Finished difference Result 51 states and 52 transitions. [2022-02-20 23:43:09,470 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 52 transitions. [2022-02-20 23:43:09,471 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:43:09,471 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:43:09,471 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:43:09,471 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:43:09,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 50 states have (on average 1.04) internal successors, (52), 50 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:09,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 52 transitions. [2022-02-20 23:43:09,472 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 52 transitions. Word has length 23 [2022-02-20 23:43:09,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:43:09,472 INFO L470 AbstractCegarLoop]: Abstraction has 51 states and 52 transitions. [2022-02-20 23:43:09,473 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 13 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:09,473 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 52 transitions. [2022-02-20 23:43:09,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-02-20 23:43:09,473 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:43:09,474 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:43:09,494 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:43:09,694 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:43:09,694 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 5 more)] === [2022-02-20 23:43:09,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:43:09,695 INFO L85 PathProgramCache]: Analyzing trace with hash 1708005006, now seen corresponding path program 2 times [2022-02-20 23:43:09,695 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:43:09,695 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515399945] [2022-02-20 23:43:09,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:43:09,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:43:09,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:43:09,851 INFO L290 TraceCheckUtils]: 0: Hoare triple {1102#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {1102#true} is VALID [2022-02-20 23:43:09,851 INFO L290 TraceCheckUtils]: 1: Hoare triple {1102#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~post0#1, main_~i~0#1, main_#t~mem3#1, main_#t~mem2#1, main_~#a~0#1.base, main_~#a~0#1.offset;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4192);main_~i~0#1 := 0; {1104#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 23:43:09,852 INFO L290 TraceCheckUtils]: 2: Hoare triple {1104#(= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < 1048);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {1104#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 23:43:09,852 INFO L290 TraceCheckUtils]: 3: Hoare triple {1104#(= |ULTIMATE.start_main_~i~0#1| 0)} SUMMARY for call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); srcloc: L14 {1104#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 23:43:09,852 INFO L290 TraceCheckUtils]: 4: Hoare triple {1104#(= |ULTIMATE.start_main_~i~0#1| 0)} havoc main_#t~nondet1#1; {1104#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 23:43:09,853 INFO L290 TraceCheckUtils]: 5: Hoare triple {1104#(= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {1105#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 23:43:09,853 INFO L290 TraceCheckUtils]: 6: Hoare triple {1105#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !!(main_~i~0#1 < 1048);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {1105#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 23:43:09,854 INFO L290 TraceCheckUtils]: 7: Hoare triple {1105#(<= |ULTIMATE.start_main_~i~0#1| 1)} SUMMARY for call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); srcloc: L14 {1105#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 23:43:09,854 INFO L290 TraceCheckUtils]: 8: Hoare triple {1105#(<= |ULTIMATE.start_main_~i~0#1| 1)} havoc main_#t~nondet1#1; {1105#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 23:43:09,854 INFO L290 TraceCheckUtils]: 9: Hoare triple {1105#(<= |ULTIMATE.start_main_~i~0#1| 1)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {1106#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-20 23:43:09,855 INFO L290 TraceCheckUtils]: 10: Hoare triple {1106#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !!(main_~i~0#1 < 1048);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {1106#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-20 23:43:09,855 INFO L290 TraceCheckUtils]: 11: Hoare triple {1106#(<= |ULTIMATE.start_main_~i~0#1| 2)} SUMMARY for call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); srcloc: L14 {1106#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-20 23:43:09,856 INFO L290 TraceCheckUtils]: 12: Hoare triple {1106#(<= |ULTIMATE.start_main_~i~0#1| 2)} havoc main_#t~nondet1#1; {1106#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-20 23:43:09,856 INFO L290 TraceCheckUtils]: 13: Hoare triple {1106#(<= |ULTIMATE.start_main_~i~0#1| 2)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {1107#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-20 23:43:09,856 INFO L290 TraceCheckUtils]: 14: Hoare triple {1107#(<= |ULTIMATE.start_main_~i~0#1| 3)} assume !!(main_~i~0#1 < 1048);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {1107#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-20 23:43:09,857 INFO L290 TraceCheckUtils]: 15: Hoare triple {1107#(<= |ULTIMATE.start_main_~i~0#1| 3)} SUMMARY for call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); srcloc: L14 {1107#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-20 23:43:09,857 INFO L290 TraceCheckUtils]: 16: Hoare triple {1107#(<= |ULTIMATE.start_main_~i~0#1| 3)} havoc main_#t~nondet1#1; {1107#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-20 23:43:09,858 INFO L290 TraceCheckUtils]: 17: Hoare triple {1107#(<= |ULTIMATE.start_main_~i~0#1| 3)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {1108#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-20 23:43:09,858 INFO L290 TraceCheckUtils]: 18: Hoare triple {1108#(<= |ULTIMATE.start_main_~i~0#1| 4)} assume !!(main_~i~0#1 < 1048);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {1108#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-20 23:43:09,858 INFO L290 TraceCheckUtils]: 19: Hoare triple {1108#(<= |ULTIMATE.start_main_~i~0#1| 4)} SUMMARY for call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); srcloc: L14 {1108#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-20 23:43:09,859 INFO L290 TraceCheckUtils]: 20: Hoare triple {1108#(<= |ULTIMATE.start_main_~i~0#1| 4)} havoc main_#t~nondet1#1; {1108#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-20 23:43:09,859 INFO L290 TraceCheckUtils]: 21: Hoare triple {1108#(<= |ULTIMATE.start_main_~i~0#1| 4)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {1109#(<= |ULTIMATE.start_main_~i~0#1| 5)} is VALID [2022-02-20 23:43:09,860 INFO L290 TraceCheckUtils]: 22: Hoare triple {1109#(<= |ULTIMATE.start_main_~i~0#1| 5)} assume !!(main_~i~0#1 < 1048);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {1109#(<= |ULTIMATE.start_main_~i~0#1| 5)} is VALID [2022-02-20 23:43:09,860 INFO L290 TraceCheckUtils]: 23: Hoare triple {1109#(<= |ULTIMATE.start_main_~i~0#1| 5)} SUMMARY for call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); srcloc: L14 {1109#(<= |ULTIMATE.start_main_~i~0#1| 5)} is VALID [2022-02-20 23:43:09,860 INFO L290 TraceCheckUtils]: 24: Hoare triple {1109#(<= |ULTIMATE.start_main_~i~0#1| 5)} havoc main_#t~nondet1#1; {1109#(<= |ULTIMATE.start_main_~i~0#1| 5)} is VALID [2022-02-20 23:43:09,861 INFO L290 TraceCheckUtils]: 25: Hoare triple {1109#(<= |ULTIMATE.start_main_~i~0#1| 5)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {1110#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-20 23:43:09,861 INFO L290 TraceCheckUtils]: 26: Hoare triple {1110#(<= |ULTIMATE.start_main_~i~0#1| 6)} assume !!(main_~i~0#1 < 1048);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {1110#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-20 23:43:09,862 INFO L290 TraceCheckUtils]: 27: Hoare triple {1110#(<= |ULTIMATE.start_main_~i~0#1| 6)} SUMMARY for call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); srcloc: L14 {1110#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-20 23:43:09,862 INFO L290 TraceCheckUtils]: 28: Hoare triple {1110#(<= |ULTIMATE.start_main_~i~0#1| 6)} havoc main_#t~nondet1#1; {1110#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-20 23:43:09,863 INFO L290 TraceCheckUtils]: 29: Hoare triple {1110#(<= |ULTIMATE.start_main_~i~0#1| 6)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {1111#(<= |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-20 23:43:09,863 INFO L290 TraceCheckUtils]: 30: Hoare triple {1111#(<= |ULTIMATE.start_main_~i~0#1| 7)} assume !!(main_~i~0#1 < 1048);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {1111#(<= |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-20 23:43:09,863 INFO L290 TraceCheckUtils]: 31: Hoare triple {1111#(<= |ULTIMATE.start_main_~i~0#1| 7)} SUMMARY for call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); srcloc: L14 {1111#(<= |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-20 23:43:09,864 INFO L290 TraceCheckUtils]: 32: Hoare triple {1111#(<= |ULTIMATE.start_main_~i~0#1| 7)} havoc main_#t~nondet1#1; {1111#(<= |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-20 23:43:09,864 INFO L290 TraceCheckUtils]: 33: Hoare triple {1111#(<= |ULTIMATE.start_main_~i~0#1| 7)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {1112#(<= |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-20 23:43:09,865 INFO L290 TraceCheckUtils]: 34: Hoare triple {1112#(<= |ULTIMATE.start_main_~i~0#1| 8)} assume !!(main_~i~0#1 < 1048);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {1112#(<= |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-20 23:43:09,865 INFO L290 TraceCheckUtils]: 35: Hoare triple {1112#(<= |ULTIMATE.start_main_~i~0#1| 8)} SUMMARY for call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); srcloc: L14 {1112#(<= |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-20 23:43:09,865 INFO L290 TraceCheckUtils]: 36: Hoare triple {1112#(<= |ULTIMATE.start_main_~i~0#1| 8)} havoc main_#t~nondet1#1; {1112#(<= |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-20 23:43:09,866 INFO L290 TraceCheckUtils]: 37: Hoare triple {1112#(<= |ULTIMATE.start_main_~i~0#1| 8)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {1113#(<= |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-20 23:43:09,866 INFO L290 TraceCheckUtils]: 38: Hoare triple {1113#(<= |ULTIMATE.start_main_~i~0#1| 9)} assume !!(main_~i~0#1 < 1048);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {1113#(<= |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-20 23:43:09,867 INFO L290 TraceCheckUtils]: 39: Hoare triple {1113#(<= |ULTIMATE.start_main_~i~0#1| 9)} SUMMARY for call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); srcloc: L14 {1113#(<= |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-20 23:43:09,867 INFO L290 TraceCheckUtils]: 40: Hoare triple {1113#(<= |ULTIMATE.start_main_~i~0#1| 9)} havoc main_#t~nondet1#1; {1113#(<= |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-20 23:43:09,867 INFO L290 TraceCheckUtils]: 41: Hoare triple {1113#(<= |ULTIMATE.start_main_~i~0#1| 9)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {1114#(<= |ULTIMATE.start_main_~i~0#1| 10)} is VALID [2022-02-20 23:43:09,868 INFO L290 TraceCheckUtils]: 42: Hoare triple {1114#(<= |ULTIMATE.start_main_~i~0#1| 10)} assume !(main_~i~0#1 < 1048); {1103#false} is VALID [2022-02-20 23:43:09,868 INFO L290 TraceCheckUtils]: 43: Hoare triple {1103#false} SUMMARY for call main_#t~mem2#1 := read~int(main_~#a~0#1.base, 12 + main_~#a~0#1.offset, 4); srcloc: L17-2 {1103#false} is VALID [2022-02-20 23:43:09,868 INFO L290 TraceCheckUtils]: 44: Hoare triple {1103#false} assume !(main_#t~mem2#1 >= 0);havoc main_#t~mem2#1; {1103#false} is VALID [2022-02-20 23:43:09,868 INFO L290 TraceCheckUtils]: 45: Hoare triple {1103#false} main_#res#1 := 0;call ULTIMATE.dealloc(main_~#a~0#1.base, main_~#a~0#1.offset);havoc main_~#a~0#1.base, main_~#a~0#1.offset; {1103#false} is VALID [2022-02-20 23:43:09,868 INFO L290 TraceCheckUtils]: 46: Hoare triple {1103#false} assume !(#valid == main_old_#valid#1); {1103#false} is VALID [2022-02-20 23:43:09,869 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:43:09,869 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:43:09,869 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515399945] [2022-02-20 23:43:09,869 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1515399945] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 23:43:09,870 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [892190770] [2022-02-20 23:43:09,870 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-20 23:43:09,870 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:43:09,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:43:09,871 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:43:09,872 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:43:09,967 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-02-20 23:43:09,967 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 23:43:09,968 INFO L263 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 8 conjunts are in the unsatisfiable core [2022-02-20 23:43:09,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:43:09,977 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:43:10,273 INFO L290 TraceCheckUtils]: 0: Hoare triple {1102#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {1102#true} is VALID [2022-02-20 23:43:10,274 INFO L290 TraceCheckUtils]: 1: Hoare triple {1102#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~post0#1, main_~i~0#1, main_#t~mem3#1, main_#t~mem2#1, main_~#a~0#1.base, main_~#a~0#1.offset;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4192);main_~i~0#1 := 0; {1121#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base|) 0) (exists ((v_ArrVal_94 Int)) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base| v_ArrVal_94) |#valid|)))} is VALID [2022-02-20 23:43:10,274 INFO L290 TraceCheckUtils]: 2: Hoare triple {1121#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base|) 0) (exists ((v_ArrVal_94 Int)) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base| v_ArrVal_94) |#valid|)))} assume !!(main_~i~0#1 < 1048);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {1121#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base|) 0) (exists ((v_ArrVal_94 Int)) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base| v_ArrVal_94) |#valid|)))} is VALID [2022-02-20 23:43:10,275 INFO L290 TraceCheckUtils]: 3: Hoare triple {1121#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base|) 0) (exists ((v_ArrVal_94 Int)) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base| v_ArrVal_94) |#valid|)))} SUMMARY for call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); srcloc: L14 {1121#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base|) 0) (exists ((v_ArrVal_94 Int)) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base| v_ArrVal_94) |#valid|)))} is VALID [2022-02-20 23:43:10,275 INFO L290 TraceCheckUtils]: 4: Hoare triple {1121#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base|) 0) (exists ((v_ArrVal_94 Int)) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base| v_ArrVal_94) |#valid|)))} havoc main_#t~nondet1#1; {1121#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base|) 0) (exists ((v_ArrVal_94 Int)) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base| v_ArrVal_94) |#valid|)))} is VALID [2022-02-20 23:43:10,276 INFO L290 TraceCheckUtils]: 5: Hoare triple {1121#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base|) 0) (exists ((v_ArrVal_94 Int)) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base| v_ArrVal_94) |#valid|)))} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {1121#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base|) 0) (exists ((v_ArrVal_94 Int)) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base| v_ArrVal_94) |#valid|)))} is VALID [2022-02-20 23:43:10,277 INFO L290 TraceCheckUtils]: 6: Hoare triple {1121#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base|) 0) (exists ((v_ArrVal_94 Int)) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base| v_ArrVal_94) |#valid|)))} assume !!(main_~i~0#1 < 1048);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {1121#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base|) 0) (exists ((v_ArrVal_94 Int)) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base| v_ArrVal_94) |#valid|)))} is VALID [2022-02-20 23:43:10,277 INFO L290 TraceCheckUtils]: 7: Hoare triple {1121#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base|) 0) (exists ((v_ArrVal_94 Int)) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base| v_ArrVal_94) |#valid|)))} SUMMARY for call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); srcloc: L14 {1121#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base|) 0) (exists ((v_ArrVal_94 Int)) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base| v_ArrVal_94) |#valid|)))} is VALID [2022-02-20 23:43:10,278 INFO L290 TraceCheckUtils]: 8: Hoare triple {1121#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base|) 0) (exists ((v_ArrVal_94 Int)) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base| v_ArrVal_94) |#valid|)))} havoc main_#t~nondet1#1; {1121#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base|) 0) (exists ((v_ArrVal_94 Int)) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base| v_ArrVal_94) |#valid|)))} is VALID [2022-02-20 23:43:10,278 INFO L290 TraceCheckUtils]: 9: Hoare triple {1121#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base|) 0) (exists ((v_ArrVal_94 Int)) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base| v_ArrVal_94) |#valid|)))} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {1121#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base|) 0) (exists ((v_ArrVal_94 Int)) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base| v_ArrVal_94) |#valid|)))} is VALID [2022-02-20 23:43:10,279 INFO L290 TraceCheckUtils]: 10: Hoare triple {1121#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base|) 0) (exists ((v_ArrVal_94 Int)) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base| v_ArrVal_94) |#valid|)))} assume !!(main_~i~0#1 < 1048);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {1121#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base|) 0) (exists ((v_ArrVal_94 Int)) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base| v_ArrVal_94) |#valid|)))} is VALID [2022-02-20 23:43:10,280 INFO L290 TraceCheckUtils]: 11: Hoare triple {1121#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base|) 0) (exists ((v_ArrVal_94 Int)) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base| v_ArrVal_94) |#valid|)))} SUMMARY for call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); srcloc: L14 {1121#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base|) 0) (exists ((v_ArrVal_94 Int)) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base| v_ArrVal_94) |#valid|)))} is VALID [2022-02-20 23:43:10,280 INFO L290 TraceCheckUtils]: 12: Hoare triple {1121#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base|) 0) (exists ((v_ArrVal_94 Int)) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base| v_ArrVal_94) |#valid|)))} havoc main_#t~nondet1#1; {1121#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base|) 0) (exists ((v_ArrVal_94 Int)) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base| v_ArrVal_94) |#valid|)))} is VALID [2022-02-20 23:43:10,281 INFO L290 TraceCheckUtils]: 13: Hoare triple {1121#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base|) 0) (exists ((v_ArrVal_94 Int)) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base| v_ArrVal_94) |#valid|)))} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {1121#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base|) 0) (exists ((v_ArrVal_94 Int)) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base| v_ArrVal_94) |#valid|)))} is VALID [2022-02-20 23:43:10,281 INFO L290 TraceCheckUtils]: 14: Hoare triple {1121#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base|) 0) (exists ((v_ArrVal_94 Int)) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base| v_ArrVal_94) |#valid|)))} assume !!(main_~i~0#1 < 1048);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {1121#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base|) 0) (exists ((v_ArrVal_94 Int)) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base| v_ArrVal_94) |#valid|)))} is VALID [2022-02-20 23:43:10,282 INFO L290 TraceCheckUtils]: 15: Hoare triple {1121#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base|) 0) (exists ((v_ArrVal_94 Int)) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base| v_ArrVal_94) |#valid|)))} SUMMARY for call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); srcloc: L14 {1121#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base|) 0) (exists ((v_ArrVal_94 Int)) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base| v_ArrVal_94) |#valid|)))} is VALID [2022-02-20 23:43:10,282 INFO L290 TraceCheckUtils]: 16: Hoare triple {1121#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base|) 0) (exists ((v_ArrVal_94 Int)) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base| v_ArrVal_94) |#valid|)))} havoc main_#t~nondet1#1; {1121#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base|) 0) (exists ((v_ArrVal_94 Int)) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base| v_ArrVal_94) |#valid|)))} is VALID [2022-02-20 23:43:10,283 INFO L290 TraceCheckUtils]: 17: Hoare triple {1121#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base|) 0) (exists ((v_ArrVal_94 Int)) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base| v_ArrVal_94) |#valid|)))} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {1121#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base|) 0) (exists ((v_ArrVal_94 Int)) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base| v_ArrVal_94) |#valid|)))} is VALID [2022-02-20 23:43:10,284 INFO L290 TraceCheckUtils]: 18: Hoare triple {1121#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base|) 0) (exists ((v_ArrVal_94 Int)) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base| v_ArrVal_94) |#valid|)))} assume !!(main_~i~0#1 < 1048);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {1121#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base|) 0) (exists ((v_ArrVal_94 Int)) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base| v_ArrVal_94) |#valid|)))} is VALID [2022-02-20 23:43:10,284 INFO L290 TraceCheckUtils]: 19: Hoare triple {1121#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base|) 0) (exists ((v_ArrVal_94 Int)) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base| v_ArrVal_94) |#valid|)))} SUMMARY for call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); srcloc: L14 {1121#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base|) 0) (exists ((v_ArrVal_94 Int)) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base| v_ArrVal_94) |#valid|)))} is VALID [2022-02-20 23:43:10,285 INFO L290 TraceCheckUtils]: 20: Hoare triple {1121#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base|) 0) (exists ((v_ArrVal_94 Int)) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base| v_ArrVal_94) |#valid|)))} havoc main_#t~nondet1#1; {1121#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base|) 0) (exists ((v_ArrVal_94 Int)) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base| v_ArrVal_94) |#valid|)))} is VALID [2022-02-20 23:43:10,285 INFO L290 TraceCheckUtils]: 21: Hoare triple {1121#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base|) 0) (exists ((v_ArrVal_94 Int)) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base| v_ArrVal_94) |#valid|)))} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {1121#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base|) 0) (exists ((v_ArrVal_94 Int)) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base| v_ArrVal_94) |#valid|)))} is VALID [2022-02-20 23:43:10,286 INFO L290 TraceCheckUtils]: 22: Hoare triple {1121#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base|) 0) (exists ((v_ArrVal_94 Int)) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base| v_ArrVal_94) |#valid|)))} assume !!(main_~i~0#1 < 1048);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {1121#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base|) 0) (exists ((v_ArrVal_94 Int)) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base| v_ArrVal_94) |#valid|)))} is VALID [2022-02-20 23:43:10,286 INFO L290 TraceCheckUtils]: 23: Hoare triple {1121#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base|) 0) (exists ((v_ArrVal_94 Int)) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base| v_ArrVal_94) |#valid|)))} SUMMARY for call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); srcloc: L14 {1121#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base|) 0) (exists ((v_ArrVal_94 Int)) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base| v_ArrVal_94) |#valid|)))} is VALID [2022-02-20 23:43:10,287 INFO L290 TraceCheckUtils]: 24: Hoare triple {1121#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base|) 0) (exists ((v_ArrVal_94 Int)) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base| v_ArrVal_94) |#valid|)))} havoc main_#t~nondet1#1; {1121#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base|) 0) (exists ((v_ArrVal_94 Int)) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base| v_ArrVal_94) |#valid|)))} is VALID [2022-02-20 23:43:10,288 INFO L290 TraceCheckUtils]: 25: Hoare triple {1121#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base|) 0) (exists ((v_ArrVal_94 Int)) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base| v_ArrVal_94) |#valid|)))} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {1121#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base|) 0) (exists ((v_ArrVal_94 Int)) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base| v_ArrVal_94) |#valid|)))} is VALID [2022-02-20 23:43:10,288 INFO L290 TraceCheckUtils]: 26: Hoare triple {1121#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base|) 0) (exists ((v_ArrVal_94 Int)) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base| v_ArrVal_94) |#valid|)))} assume !!(main_~i~0#1 < 1048);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {1121#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base|) 0) (exists ((v_ArrVal_94 Int)) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base| v_ArrVal_94) |#valid|)))} is VALID [2022-02-20 23:43:10,289 INFO L290 TraceCheckUtils]: 27: Hoare triple {1121#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base|) 0) (exists ((v_ArrVal_94 Int)) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base| v_ArrVal_94) |#valid|)))} SUMMARY for call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); srcloc: L14 {1121#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base|) 0) (exists ((v_ArrVal_94 Int)) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base| v_ArrVal_94) |#valid|)))} is VALID [2022-02-20 23:43:10,289 INFO L290 TraceCheckUtils]: 28: Hoare triple {1121#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base|) 0) (exists ((v_ArrVal_94 Int)) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base| v_ArrVal_94) |#valid|)))} havoc main_#t~nondet1#1; {1121#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base|) 0) (exists ((v_ArrVal_94 Int)) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base| v_ArrVal_94) |#valid|)))} is VALID [2022-02-20 23:43:10,290 INFO L290 TraceCheckUtils]: 29: Hoare triple {1121#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base|) 0) (exists ((v_ArrVal_94 Int)) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base| v_ArrVal_94) |#valid|)))} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {1121#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base|) 0) (exists ((v_ArrVal_94 Int)) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base| v_ArrVal_94) |#valid|)))} is VALID [2022-02-20 23:43:10,290 INFO L290 TraceCheckUtils]: 30: Hoare triple {1121#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base|) 0) (exists ((v_ArrVal_94 Int)) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base| v_ArrVal_94) |#valid|)))} assume !!(main_~i~0#1 < 1048);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {1121#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base|) 0) (exists ((v_ArrVal_94 Int)) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base| v_ArrVal_94) |#valid|)))} is VALID [2022-02-20 23:43:10,291 INFO L290 TraceCheckUtils]: 31: Hoare triple {1121#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base|) 0) (exists ((v_ArrVal_94 Int)) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base| v_ArrVal_94) |#valid|)))} SUMMARY for call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); srcloc: L14 {1121#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base|) 0) (exists ((v_ArrVal_94 Int)) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base| v_ArrVal_94) |#valid|)))} is VALID [2022-02-20 23:43:10,292 INFO L290 TraceCheckUtils]: 32: Hoare triple {1121#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base|) 0) (exists ((v_ArrVal_94 Int)) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base| v_ArrVal_94) |#valid|)))} havoc main_#t~nondet1#1; {1121#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base|) 0) (exists ((v_ArrVal_94 Int)) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base| v_ArrVal_94) |#valid|)))} is VALID [2022-02-20 23:43:10,292 INFO L290 TraceCheckUtils]: 33: Hoare triple {1121#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base|) 0) (exists ((v_ArrVal_94 Int)) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base| v_ArrVal_94) |#valid|)))} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {1121#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base|) 0) (exists ((v_ArrVal_94 Int)) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base| v_ArrVal_94) |#valid|)))} is VALID [2022-02-20 23:43:10,293 INFO L290 TraceCheckUtils]: 34: Hoare triple {1121#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base|) 0) (exists ((v_ArrVal_94 Int)) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base| v_ArrVal_94) |#valid|)))} assume !!(main_~i~0#1 < 1048);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {1121#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base|) 0) (exists ((v_ArrVal_94 Int)) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base| v_ArrVal_94) |#valid|)))} is VALID [2022-02-20 23:43:10,293 INFO L290 TraceCheckUtils]: 35: Hoare triple {1121#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base|) 0) (exists ((v_ArrVal_94 Int)) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base| v_ArrVal_94) |#valid|)))} SUMMARY for call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); srcloc: L14 {1121#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base|) 0) (exists ((v_ArrVal_94 Int)) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base| v_ArrVal_94) |#valid|)))} is VALID [2022-02-20 23:43:10,294 INFO L290 TraceCheckUtils]: 36: Hoare triple {1121#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base|) 0) (exists ((v_ArrVal_94 Int)) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base| v_ArrVal_94) |#valid|)))} havoc main_#t~nondet1#1; {1121#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base|) 0) (exists ((v_ArrVal_94 Int)) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base| v_ArrVal_94) |#valid|)))} is VALID [2022-02-20 23:43:10,294 INFO L290 TraceCheckUtils]: 37: Hoare triple {1121#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base|) 0) (exists ((v_ArrVal_94 Int)) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base| v_ArrVal_94) |#valid|)))} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {1121#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base|) 0) (exists ((v_ArrVal_94 Int)) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base| v_ArrVal_94) |#valid|)))} is VALID [2022-02-20 23:43:10,295 INFO L290 TraceCheckUtils]: 38: Hoare triple {1121#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base|) 0) (exists ((v_ArrVal_94 Int)) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base| v_ArrVal_94) |#valid|)))} assume !!(main_~i~0#1 < 1048);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {1121#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base|) 0) (exists ((v_ArrVal_94 Int)) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base| v_ArrVal_94) |#valid|)))} is VALID [2022-02-20 23:43:10,296 INFO L290 TraceCheckUtils]: 39: Hoare triple {1121#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base|) 0) (exists ((v_ArrVal_94 Int)) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base| v_ArrVal_94) |#valid|)))} SUMMARY for call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); srcloc: L14 {1121#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base|) 0) (exists ((v_ArrVal_94 Int)) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base| v_ArrVal_94) |#valid|)))} is VALID [2022-02-20 23:43:10,296 INFO L290 TraceCheckUtils]: 40: Hoare triple {1121#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base|) 0) (exists ((v_ArrVal_94 Int)) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base| v_ArrVal_94) |#valid|)))} havoc main_#t~nondet1#1; {1121#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base|) 0) (exists ((v_ArrVal_94 Int)) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base| v_ArrVal_94) |#valid|)))} is VALID [2022-02-20 23:43:10,297 INFO L290 TraceCheckUtils]: 41: Hoare triple {1121#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base|) 0) (exists ((v_ArrVal_94 Int)) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base| v_ArrVal_94) |#valid|)))} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {1121#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base|) 0) (exists ((v_ArrVal_94 Int)) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base| v_ArrVal_94) |#valid|)))} is VALID [2022-02-20 23:43:10,297 INFO L290 TraceCheckUtils]: 42: Hoare triple {1121#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base|) 0) (exists ((v_ArrVal_94 Int)) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base| v_ArrVal_94) |#valid|)))} assume !(main_~i~0#1 < 1048); {1121#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base|) 0) (exists ((v_ArrVal_94 Int)) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base| v_ArrVal_94) |#valid|)))} is VALID [2022-02-20 23:43:10,298 INFO L290 TraceCheckUtils]: 43: Hoare triple {1121#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base|) 0) (exists ((v_ArrVal_94 Int)) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base| v_ArrVal_94) |#valid|)))} SUMMARY for call main_#t~mem2#1 := read~int(main_~#a~0#1.base, 12 + main_~#a~0#1.offset, 4); srcloc: L17-2 {1121#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base|) 0) (exists ((v_ArrVal_94 Int)) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base| v_ArrVal_94) |#valid|)))} is VALID [2022-02-20 23:43:10,298 INFO L290 TraceCheckUtils]: 44: Hoare triple {1121#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base|) 0) (exists ((v_ArrVal_94 Int)) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base| v_ArrVal_94) |#valid|)))} assume !(main_#t~mem2#1 >= 0);havoc main_#t~mem2#1; {1121#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base|) 0) (exists ((v_ArrVal_94 Int)) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base| v_ArrVal_94) |#valid|)))} is VALID [2022-02-20 23:43:10,299 INFO L290 TraceCheckUtils]: 45: Hoare triple {1121#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base|) 0) (exists ((v_ArrVal_94 Int)) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base| v_ArrVal_94) |#valid|)))} main_#res#1 := 0;call ULTIMATE.dealloc(main_~#a~0#1.base, main_~#a~0#1.offset);havoc main_~#a~0#1.base, main_~#a~0#1.offset; {1254#(exists ((|v_ULTIMATE.start_main_~#a~0#1.base_21| Int)) (and (= (select |ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#a~0#1.base_21|) 0) (= (store |ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#a~0#1.base_21| 0) |#valid|)))} is VALID [2022-02-20 23:43:10,299 INFO L290 TraceCheckUtils]: 46: Hoare triple {1254#(exists ((|v_ULTIMATE.start_main_~#a~0#1.base_21| Int)) (and (= (select |ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#a~0#1.base_21|) 0) (= (store |ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#a~0#1.base_21| 0) |#valid|)))} assume !(#valid == main_old_#valid#1); {1103#false} is VALID [2022-02-20 23:43:10,300 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2022-02-20 23:43:10,300 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:43:10,300 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [892190770] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:43:10,300 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-20 23:43:10,300 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [13] total 15 [2022-02-20 23:43:10,301 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002453298] [2022-02-20 23:43:10,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:43:10,301 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2022-02-20 23:43:10,301 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:43:10,301 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:10,309 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:43:10,310 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 23:43:10,310 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:43:10,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 23:43:10,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=128, Unknown=0, NotChecked=0, Total=210 [2022-02-20 23:43:10,310 INFO L87 Difference]: Start difference. First operand 51 states and 52 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:10,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:43:10,322 INFO L93 Difference]: Finished difference Result 56 states and 57 transitions. [2022-02-20 23:43:10,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 23:43:10,322 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2022-02-20 23:43:10,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:43:10,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:10,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 21 transitions. [2022-02-20 23:43:10,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:10,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 21 transitions. [2022-02-20 23:43:10,323 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 21 transitions. [2022-02-20 23:43:10,338 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:43:10,339 INFO L225 Difference]: With dead ends: 56 [2022-02-20 23:43:10,339 INFO L226 Difference]: Without dead ends: 54 [2022-02-20 23:43:10,339 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=82, Invalid=128, Unknown=0, NotChecked=0, Total=210 [2022-02-20 23:43:10,339 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 1 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 11 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:43:10,340 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 21 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 11 Unchecked, 0.0s Time] [2022-02-20 23:43:10,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-02-20 23:43:10,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 53. [2022-02-20 23:43:10,341 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:43:10,342 INFO L82 GeneralOperation]: Start isEquivalent. First operand 54 states. Second operand has 53 states, 52 states have (on average 1.0384615384615385) internal successors, (54), 52 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:10,342 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand has 53 states, 52 states have (on average 1.0384615384615385) internal successors, (54), 52 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:10,342 INFO L87 Difference]: Start difference. First operand 54 states. Second operand has 53 states, 52 states have (on average 1.0384615384615385) internal successors, (54), 52 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:10,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:43:10,343 INFO L93 Difference]: Finished difference Result 54 states and 55 transitions. [2022-02-20 23:43:10,343 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 55 transitions. [2022-02-20 23:43:10,343 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:43:10,344 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:43:10,344 INFO L74 IsIncluded]: Start isIncluded. First operand has 53 states, 52 states have (on average 1.0384615384615385) internal successors, (54), 52 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 54 states. [2022-02-20 23:43:10,344 INFO L87 Difference]: Start difference. First operand has 53 states, 52 states have (on average 1.0384615384615385) internal successors, (54), 52 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 54 states. [2022-02-20 23:43:10,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:43:10,345 INFO L93 Difference]: Finished difference Result 54 states and 55 transitions. [2022-02-20 23:43:10,345 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 55 transitions. [2022-02-20 23:43:10,345 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:43:10,345 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:43:10,345 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:43:10,346 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:43:10,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 52 states have (on average 1.0384615384615385) internal successors, (54), 52 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:10,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 54 transitions. [2022-02-20 23:43:10,347 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 54 transitions. Word has length 47 [2022-02-20 23:43:10,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:43:10,347 INFO L470 AbstractCegarLoop]: Abstraction has 53 states and 54 transitions. [2022-02-20 23:43:10,347 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:10,347 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 54 transitions. [2022-02-20 23:43:10,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-02-20 23:43:10,348 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:43:10,348 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:43:10,364 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:43:10,553 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:43:10,553 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 5 more)] === [2022-02-20 23:43:10,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:43:10,554 INFO L85 PathProgramCache]: Analyzing trace with hash 962364987, now seen corresponding path program 1 times [2022-02-20 23:43:10,554 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:43:10,554 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820333249] [2022-02-20 23:43:10,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:43:10,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:43:10,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:43:10,761 INFO L290 TraceCheckUtils]: 0: Hoare triple {1474#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {1474#true} is VALID [2022-02-20 23:43:10,762 INFO L290 TraceCheckUtils]: 1: Hoare triple {1474#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~post0#1, main_~i~0#1, main_#t~mem3#1, main_#t~mem2#1, main_~#a~0#1.base, main_~#a~0#1.offset;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4192);main_~i~0#1 := 0; {1476#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 23:43:10,762 INFO L290 TraceCheckUtils]: 2: Hoare triple {1476#(= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < 1048);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {1476#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 23:43:10,762 INFO L290 TraceCheckUtils]: 3: Hoare triple {1476#(= |ULTIMATE.start_main_~i~0#1| 0)} SUMMARY for call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); srcloc: L14 {1476#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 23:43:10,763 INFO L290 TraceCheckUtils]: 4: Hoare triple {1476#(= |ULTIMATE.start_main_~i~0#1| 0)} havoc main_#t~nondet1#1; {1476#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 23:43:10,763 INFO L290 TraceCheckUtils]: 5: Hoare triple {1476#(= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {1477#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 23:43:10,763 INFO L290 TraceCheckUtils]: 6: Hoare triple {1477#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !!(main_~i~0#1 < 1048);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {1477#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 23:43:10,764 INFO L290 TraceCheckUtils]: 7: Hoare triple {1477#(<= |ULTIMATE.start_main_~i~0#1| 1)} SUMMARY for call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); srcloc: L14 {1477#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 23:43:10,764 INFO L290 TraceCheckUtils]: 8: Hoare triple {1477#(<= |ULTIMATE.start_main_~i~0#1| 1)} havoc main_#t~nondet1#1; {1477#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 23:43:10,764 INFO L290 TraceCheckUtils]: 9: Hoare triple {1477#(<= |ULTIMATE.start_main_~i~0#1| 1)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {1478#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-20 23:43:10,765 INFO L290 TraceCheckUtils]: 10: Hoare triple {1478#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !!(main_~i~0#1 < 1048);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {1478#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-20 23:43:10,765 INFO L290 TraceCheckUtils]: 11: Hoare triple {1478#(<= |ULTIMATE.start_main_~i~0#1| 2)} SUMMARY for call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); srcloc: L14 {1478#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-20 23:43:10,765 INFO L290 TraceCheckUtils]: 12: Hoare triple {1478#(<= |ULTIMATE.start_main_~i~0#1| 2)} havoc main_#t~nondet1#1; {1478#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-20 23:43:10,766 INFO L290 TraceCheckUtils]: 13: Hoare triple {1478#(<= |ULTIMATE.start_main_~i~0#1| 2)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {1479#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-20 23:43:10,766 INFO L290 TraceCheckUtils]: 14: Hoare triple {1479#(<= |ULTIMATE.start_main_~i~0#1| 3)} assume !!(main_~i~0#1 < 1048);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {1479#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-20 23:43:10,766 INFO L290 TraceCheckUtils]: 15: Hoare triple {1479#(<= |ULTIMATE.start_main_~i~0#1| 3)} SUMMARY for call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); srcloc: L14 {1479#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-20 23:43:10,767 INFO L290 TraceCheckUtils]: 16: Hoare triple {1479#(<= |ULTIMATE.start_main_~i~0#1| 3)} havoc main_#t~nondet1#1; {1479#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-20 23:43:10,767 INFO L290 TraceCheckUtils]: 17: Hoare triple {1479#(<= |ULTIMATE.start_main_~i~0#1| 3)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {1480#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-20 23:43:10,767 INFO L290 TraceCheckUtils]: 18: Hoare triple {1480#(<= |ULTIMATE.start_main_~i~0#1| 4)} assume !!(main_~i~0#1 < 1048);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {1480#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-20 23:43:10,768 INFO L290 TraceCheckUtils]: 19: Hoare triple {1480#(<= |ULTIMATE.start_main_~i~0#1| 4)} SUMMARY for call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); srcloc: L14 {1480#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-20 23:43:10,768 INFO L290 TraceCheckUtils]: 20: Hoare triple {1480#(<= |ULTIMATE.start_main_~i~0#1| 4)} havoc main_#t~nondet1#1; {1480#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-20 23:43:10,768 INFO L290 TraceCheckUtils]: 21: Hoare triple {1480#(<= |ULTIMATE.start_main_~i~0#1| 4)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {1481#(<= |ULTIMATE.start_main_~i~0#1| 5)} is VALID [2022-02-20 23:43:10,769 INFO L290 TraceCheckUtils]: 22: Hoare triple {1481#(<= |ULTIMATE.start_main_~i~0#1| 5)} assume !!(main_~i~0#1 < 1048);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {1481#(<= |ULTIMATE.start_main_~i~0#1| 5)} is VALID [2022-02-20 23:43:10,770 INFO L290 TraceCheckUtils]: 23: Hoare triple {1481#(<= |ULTIMATE.start_main_~i~0#1| 5)} SUMMARY for call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); srcloc: L14 {1481#(<= |ULTIMATE.start_main_~i~0#1| 5)} is VALID [2022-02-20 23:43:10,771 INFO L290 TraceCheckUtils]: 24: Hoare triple {1481#(<= |ULTIMATE.start_main_~i~0#1| 5)} havoc main_#t~nondet1#1; {1481#(<= |ULTIMATE.start_main_~i~0#1| 5)} is VALID [2022-02-20 23:43:10,772 INFO L290 TraceCheckUtils]: 25: Hoare triple {1481#(<= |ULTIMATE.start_main_~i~0#1| 5)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {1482#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-20 23:43:10,773 INFO L290 TraceCheckUtils]: 26: Hoare triple {1482#(<= |ULTIMATE.start_main_~i~0#1| 6)} assume !!(main_~i~0#1 < 1048);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {1482#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-20 23:43:10,773 INFO L290 TraceCheckUtils]: 27: Hoare triple {1482#(<= |ULTIMATE.start_main_~i~0#1| 6)} SUMMARY for call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); srcloc: L14 {1482#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-20 23:43:10,776 INFO L290 TraceCheckUtils]: 28: Hoare triple {1482#(<= |ULTIMATE.start_main_~i~0#1| 6)} havoc main_#t~nondet1#1; {1482#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-20 23:43:10,776 INFO L290 TraceCheckUtils]: 29: Hoare triple {1482#(<= |ULTIMATE.start_main_~i~0#1| 6)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {1483#(<= |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-20 23:43:10,776 INFO L290 TraceCheckUtils]: 30: Hoare triple {1483#(<= |ULTIMATE.start_main_~i~0#1| 7)} assume !!(main_~i~0#1 < 1048);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {1483#(<= |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-20 23:43:10,777 INFO L290 TraceCheckUtils]: 31: Hoare triple {1483#(<= |ULTIMATE.start_main_~i~0#1| 7)} SUMMARY for call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); srcloc: L14 {1483#(<= |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-20 23:43:10,777 INFO L290 TraceCheckUtils]: 32: Hoare triple {1483#(<= |ULTIMATE.start_main_~i~0#1| 7)} havoc main_#t~nondet1#1; {1483#(<= |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-20 23:43:10,777 INFO L290 TraceCheckUtils]: 33: Hoare triple {1483#(<= |ULTIMATE.start_main_~i~0#1| 7)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {1484#(<= |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-20 23:43:10,778 INFO L290 TraceCheckUtils]: 34: Hoare triple {1484#(<= |ULTIMATE.start_main_~i~0#1| 8)} assume !!(main_~i~0#1 < 1048);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {1484#(<= |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-20 23:43:10,778 INFO L290 TraceCheckUtils]: 35: Hoare triple {1484#(<= |ULTIMATE.start_main_~i~0#1| 8)} SUMMARY for call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); srcloc: L14 {1484#(<= |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-20 23:43:10,778 INFO L290 TraceCheckUtils]: 36: Hoare triple {1484#(<= |ULTIMATE.start_main_~i~0#1| 8)} havoc main_#t~nondet1#1; {1484#(<= |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-20 23:43:10,779 INFO L290 TraceCheckUtils]: 37: Hoare triple {1484#(<= |ULTIMATE.start_main_~i~0#1| 8)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {1485#(<= |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-20 23:43:10,779 INFO L290 TraceCheckUtils]: 38: Hoare triple {1485#(<= |ULTIMATE.start_main_~i~0#1| 9)} assume !!(main_~i~0#1 < 1048);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {1485#(<= |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-20 23:43:10,779 INFO L290 TraceCheckUtils]: 39: Hoare triple {1485#(<= |ULTIMATE.start_main_~i~0#1| 9)} SUMMARY for call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); srcloc: L14 {1485#(<= |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-20 23:43:10,780 INFO L290 TraceCheckUtils]: 40: Hoare triple {1485#(<= |ULTIMATE.start_main_~i~0#1| 9)} havoc main_#t~nondet1#1; {1485#(<= |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-20 23:43:10,780 INFO L290 TraceCheckUtils]: 41: Hoare triple {1485#(<= |ULTIMATE.start_main_~i~0#1| 9)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {1486#(<= |ULTIMATE.start_main_~i~0#1| 10)} is VALID [2022-02-20 23:43:10,781 INFO L290 TraceCheckUtils]: 42: Hoare triple {1486#(<= |ULTIMATE.start_main_~i~0#1| 10)} assume !(main_~i~0#1 < 1048); {1475#false} is VALID [2022-02-20 23:43:10,781 INFO L290 TraceCheckUtils]: 43: Hoare triple {1475#false} SUMMARY for call main_#t~mem2#1 := read~int(main_~#a~0#1.base, 12 + main_~#a~0#1.offset, 4); srcloc: L17-2 {1475#false} is VALID [2022-02-20 23:43:10,781 INFO L290 TraceCheckUtils]: 44: Hoare triple {1475#false} assume !!(main_#t~mem2#1 >= 0);havoc main_#t~mem2#1; {1475#false} is VALID [2022-02-20 23:43:10,781 INFO L290 TraceCheckUtils]: 45: Hoare triple {1475#false} SUMMARY for call main_#t~mem3#1 := read~int(main_~#a~0#1.base, 12 + main_~#a~0#1.offset, 4); srcloc: L18 {1475#false} is VALID [2022-02-20 23:43:10,781 INFO L290 TraceCheckUtils]: 46: Hoare triple {1475#false} SUMMARY for call write~int(main_#t~mem3#1 - 1, main_~#a~0#1.base, 12 + main_~#a~0#1.offset, 4); srcloc: L18-1 {1475#false} is VALID [2022-02-20 23:43:10,781 INFO L290 TraceCheckUtils]: 47: Hoare triple {1475#false} havoc main_#t~mem3#1; {1475#false} is VALID [2022-02-20 23:43:10,781 INFO L290 TraceCheckUtils]: 48: Hoare triple {1475#false} SUMMARY for call main_#t~mem2#1 := read~int(main_~#a~0#1.base, 12 + main_~#a~0#1.offset, 4); srcloc: L17-2 {1475#false} is VALID [2022-02-20 23:43:10,781 INFO L290 TraceCheckUtils]: 49: Hoare triple {1475#false} assume !(main_#t~mem2#1 >= 0);havoc main_#t~mem2#1; {1475#false} is VALID [2022-02-20 23:43:10,781 INFO L290 TraceCheckUtils]: 50: Hoare triple {1475#false} main_#res#1 := 0;call ULTIMATE.dealloc(main_~#a~0#1.base, main_~#a~0#1.offset);havoc main_~#a~0#1.base, main_~#a~0#1.offset; {1475#false} is VALID [2022-02-20 23:43:10,781 INFO L290 TraceCheckUtils]: 51: Hoare triple {1475#false} assume !(#valid == main_old_#valid#1); {1475#false} is VALID [2022-02-20 23:43:10,782 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-20 23:43:10,782 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:43:10,782 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820333249] [2022-02-20 23:43:10,782 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [820333249] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 23:43:10,782 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [247659452] [2022-02-20 23:43:10,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:43:10,782 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:43:10,782 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:43:10,808 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:43:10,821 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:43:10,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:43:10,890 INFO L263 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 12 conjunts are in the unsatisfiable core [2022-02-20 23:43:10,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:43:10,905 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:43:11,151 INFO L290 TraceCheckUtils]: 0: Hoare triple {1474#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {1474#true} is VALID [2022-02-20 23:43:11,152 INFO L290 TraceCheckUtils]: 1: Hoare triple {1474#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~post0#1, main_~i~0#1, main_#t~mem3#1, main_#t~mem2#1, main_~#a~0#1.base, main_~#a~0#1.offset;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4192);main_~i~0#1 := 0; {1493#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 23:43:11,152 INFO L290 TraceCheckUtils]: 2: Hoare triple {1493#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < 1048);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {1493#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 23:43:11,152 INFO L290 TraceCheckUtils]: 3: Hoare triple {1493#(<= |ULTIMATE.start_main_~i~0#1| 0)} SUMMARY for call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); srcloc: L14 {1493#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 23:43:11,153 INFO L290 TraceCheckUtils]: 4: Hoare triple {1493#(<= |ULTIMATE.start_main_~i~0#1| 0)} havoc main_#t~nondet1#1; {1493#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 23:43:11,153 INFO L290 TraceCheckUtils]: 5: Hoare triple {1493#(<= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {1477#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 23:43:11,154 INFO L290 TraceCheckUtils]: 6: Hoare triple {1477#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !!(main_~i~0#1 < 1048);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {1477#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 23:43:11,154 INFO L290 TraceCheckUtils]: 7: Hoare triple {1477#(<= |ULTIMATE.start_main_~i~0#1| 1)} SUMMARY for call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); srcloc: L14 {1477#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 23:43:11,155 INFO L290 TraceCheckUtils]: 8: Hoare triple {1477#(<= |ULTIMATE.start_main_~i~0#1| 1)} havoc main_#t~nondet1#1; {1477#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 23:43:11,155 INFO L290 TraceCheckUtils]: 9: Hoare triple {1477#(<= |ULTIMATE.start_main_~i~0#1| 1)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {1478#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-20 23:43:11,155 INFO L290 TraceCheckUtils]: 10: Hoare triple {1478#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !!(main_~i~0#1 < 1048);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {1478#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-20 23:43:11,156 INFO L290 TraceCheckUtils]: 11: Hoare triple {1478#(<= |ULTIMATE.start_main_~i~0#1| 2)} SUMMARY for call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); srcloc: L14 {1478#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-20 23:43:11,156 INFO L290 TraceCheckUtils]: 12: Hoare triple {1478#(<= |ULTIMATE.start_main_~i~0#1| 2)} havoc main_#t~nondet1#1; {1478#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-20 23:43:11,156 INFO L290 TraceCheckUtils]: 13: Hoare triple {1478#(<= |ULTIMATE.start_main_~i~0#1| 2)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {1479#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-20 23:43:11,157 INFO L290 TraceCheckUtils]: 14: Hoare triple {1479#(<= |ULTIMATE.start_main_~i~0#1| 3)} assume !!(main_~i~0#1 < 1048);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {1479#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-20 23:43:11,157 INFO L290 TraceCheckUtils]: 15: Hoare triple {1479#(<= |ULTIMATE.start_main_~i~0#1| 3)} SUMMARY for call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); srcloc: L14 {1479#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-20 23:43:11,157 INFO L290 TraceCheckUtils]: 16: Hoare triple {1479#(<= |ULTIMATE.start_main_~i~0#1| 3)} havoc main_#t~nondet1#1; {1479#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-20 23:43:11,158 INFO L290 TraceCheckUtils]: 17: Hoare triple {1479#(<= |ULTIMATE.start_main_~i~0#1| 3)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {1480#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-20 23:43:11,158 INFO L290 TraceCheckUtils]: 18: Hoare triple {1480#(<= |ULTIMATE.start_main_~i~0#1| 4)} assume !!(main_~i~0#1 < 1048);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {1480#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-20 23:43:11,158 INFO L290 TraceCheckUtils]: 19: Hoare triple {1480#(<= |ULTIMATE.start_main_~i~0#1| 4)} SUMMARY for call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); srcloc: L14 {1480#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-20 23:43:11,159 INFO L290 TraceCheckUtils]: 20: Hoare triple {1480#(<= |ULTIMATE.start_main_~i~0#1| 4)} havoc main_#t~nondet1#1; {1480#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-20 23:43:11,159 INFO L290 TraceCheckUtils]: 21: Hoare triple {1480#(<= |ULTIMATE.start_main_~i~0#1| 4)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {1481#(<= |ULTIMATE.start_main_~i~0#1| 5)} is VALID [2022-02-20 23:43:11,159 INFO L290 TraceCheckUtils]: 22: Hoare triple {1481#(<= |ULTIMATE.start_main_~i~0#1| 5)} assume !!(main_~i~0#1 < 1048);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {1481#(<= |ULTIMATE.start_main_~i~0#1| 5)} is VALID [2022-02-20 23:43:11,160 INFO L290 TraceCheckUtils]: 23: Hoare triple {1481#(<= |ULTIMATE.start_main_~i~0#1| 5)} SUMMARY for call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); srcloc: L14 {1481#(<= |ULTIMATE.start_main_~i~0#1| 5)} is VALID [2022-02-20 23:43:11,160 INFO L290 TraceCheckUtils]: 24: Hoare triple {1481#(<= |ULTIMATE.start_main_~i~0#1| 5)} havoc main_#t~nondet1#1; {1481#(<= |ULTIMATE.start_main_~i~0#1| 5)} is VALID [2022-02-20 23:43:11,161 INFO L290 TraceCheckUtils]: 25: Hoare triple {1481#(<= |ULTIMATE.start_main_~i~0#1| 5)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {1482#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-20 23:43:11,161 INFO L290 TraceCheckUtils]: 26: Hoare triple {1482#(<= |ULTIMATE.start_main_~i~0#1| 6)} assume !!(main_~i~0#1 < 1048);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {1482#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-20 23:43:11,161 INFO L290 TraceCheckUtils]: 27: Hoare triple {1482#(<= |ULTIMATE.start_main_~i~0#1| 6)} SUMMARY for call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); srcloc: L14 {1482#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-20 23:43:11,163 INFO L290 TraceCheckUtils]: 28: Hoare triple {1482#(<= |ULTIMATE.start_main_~i~0#1| 6)} havoc main_#t~nondet1#1; {1482#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-20 23:43:11,163 INFO L290 TraceCheckUtils]: 29: Hoare triple {1482#(<= |ULTIMATE.start_main_~i~0#1| 6)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {1483#(<= |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-20 23:43:11,164 INFO L290 TraceCheckUtils]: 30: Hoare triple {1483#(<= |ULTIMATE.start_main_~i~0#1| 7)} assume !!(main_~i~0#1 < 1048);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {1483#(<= |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-20 23:43:11,164 INFO L290 TraceCheckUtils]: 31: Hoare triple {1483#(<= |ULTIMATE.start_main_~i~0#1| 7)} SUMMARY for call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); srcloc: L14 {1483#(<= |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-20 23:43:11,164 INFO L290 TraceCheckUtils]: 32: Hoare triple {1483#(<= |ULTIMATE.start_main_~i~0#1| 7)} havoc main_#t~nondet1#1; {1483#(<= |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-20 23:43:11,165 INFO L290 TraceCheckUtils]: 33: Hoare triple {1483#(<= |ULTIMATE.start_main_~i~0#1| 7)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {1484#(<= |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-20 23:43:11,165 INFO L290 TraceCheckUtils]: 34: Hoare triple {1484#(<= |ULTIMATE.start_main_~i~0#1| 8)} assume !!(main_~i~0#1 < 1048);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {1484#(<= |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-20 23:43:11,165 INFO L290 TraceCheckUtils]: 35: Hoare triple {1484#(<= |ULTIMATE.start_main_~i~0#1| 8)} SUMMARY for call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); srcloc: L14 {1484#(<= |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-20 23:43:11,166 INFO L290 TraceCheckUtils]: 36: Hoare triple {1484#(<= |ULTIMATE.start_main_~i~0#1| 8)} havoc main_#t~nondet1#1; {1484#(<= |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-20 23:43:11,166 INFO L290 TraceCheckUtils]: 37: Hoare triple {1484#(<= |ULTIMATE.start_main_~i~0#1| 8)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {1485#(<= |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-20 23:43:11,167 INFO L290 TraceCheckUtils]: 38: Hoare triple {1485#(<= |ULTIMATE.start_main_~i~0#1| 9)} assume !!(main_~i~0#1 < 1048);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {1485#(<= |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-20 23:43:11,167 INFO L290 TraceCheckUtils]: 39: Hoare triple {1485#(<= |ULTIMATE.start_main_~i~0#1| 9)} SUMMARY for call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); srcloc: L14 {1485#(<= |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-20 23:43:11,167 INFO L290 TraceCheckUtils]: 40: Hoare triple {1485#(<= |ULTIMATE.start_main_~i~0#1| 9)} havoc main_#t~nondet1#1; {1485#(<= |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-20 23:43:11,168 INFO L290 TraceCheckUtils]: 41: Hoare triple {1485#(<= |ULTIMATE.start_main_~i~0#1| 9)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {1486#(<= |ULTIMATE.start_main_~i~0#1| 10)} is VALID [2022-02-20 23:43:11,168 INFO L290 TraceCheckUtils]: 42: Hoare triple {1486#(<= |ULTIMATE.start_main_~i~0#1| 10)} assume !(main_~i~0#1 < 1048); {1475#false} is VALID [2022-02-20 23:43:11,168 INFO L290 TraceCheckUtils]: 43: Hoare triple {1475#false} SUMMARY for call main_#t~mem2#1 := read~int(main_~#a~0#1.base, 12 + main_~#a~0#1.offset, 4); srcloc: L17-2 {1475#false} is VALID [2022-02-20 23:43:11,168 INFO L290 TraceCheckUtils]: 44: Hoare triple {1475#false} assume !!(main_#t~mem2#1 >= 0);havoc main_#t~mem2#1; {1475#false} is VALID [2022-02-20 23:43:11,168 INFO L290 TraceCheckUtils]: 45: Hoare triple {1475#false} SUMMARY for call main_#t~mem3#1 := read~int(main_~#a~0#1.base, 12 + main_~#a~0#1.offset, 4); srcloc: L18 {1475#false} is VALID [2022-02-20 23:43:11,169 INFO L290 TraceCheckUtils]: 46: Hoare triple {1475#false} SUMMARY for call write~int(main_#t~mem3#1 - 1, main_~#a~0#1.base, 12 + main_~#a~0#1.offset, 4); srcloc: L18-1 {1475#false} is VALID [2022-02-20 23:43:11,169 INFO L290 TraceCheckUtils]: 47: Hoare triple {1475#false} havoc main_#t~mem3#1; {1475#false} is VALID [2022-02-20 23:43:11,169 INFO L290 TraceCheckUtils]: 48: Hoare triple {1475#false} SUMMARY for call main_#t~mem2#1 := read~int(main_~#a~0#1.base, 12 + main_~#a~0#1.offset, 4); srcloc: L17-2 {1475#false} is VALID [2022-02-20 23:43:11,169 INFO L290 TraceCheckUtils]: 49: Hoare triple {1475#false} assume !(main_#t~mem2#1 >= 0);havoc main_#t~mem2#1; {1475#false} is VALID [2022-02-20 23:43:11,169 INFO L290 TraceCheckUtils]: 50: Hoare triple {1475#false} main_#res#1 := 0;call ULTIMATE.dealloc(main_~#a~0#1.base, main_~#a~0#1.offset);havoc main_~#a~0#1.base, main_~#a~0#1.offset; {1475#false} is VALID [2022-02-20 23:43:11,169 INFO L290 TraceCheckUtils]: 51: Hoare triple {1475#false} assume !(#valid == main_old_#valid#1); {1475#false} is VALID [2022-02-20 23:43:11,170 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-20 23:43:11,170 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:43:11,499 INFO L290 TraceCheckUtils]: 51: Hoare triple {1475#false} assume !(#valid == main_old_#valid#1); {1475#false} is VALID [2022-02-20 23:43:11,499 INFO L290 TraceCheckUtils]: 50: Hoare triple {1475#false} main_#res#1 := 0;call ULTIMATE.dealloc(main_~#a~0#1.base, main_~#a~0#1.offset);havoc main_~#a~0#1.base, main_~#a~0#1.offset; {1475#false} is VALID [2022-02-20 23:43:11,499 INFO L290 TraceCheckUtils]: 49: Hoare triple {1475#false} assume !(main_#t~mem2#1 >= 0);havoc main_#t~mem2#1; {1475#false} is VALID [2022-02-20 23:43:11,499 INFO L290 TraceCheckUtils]: 48: Hoare triple {1475#false} SUMMARY for call main_#t~mem2#1 := read~int(main_~#a~0#1.base, 12 + main_~#a~0#1.offset, 4); srcloc: L17-2 {1475#false} is VALID [2022-02-20 23:43:11,500 INFO L290 TraceCheckUtils]: 47: Hoare triple {1475#false} havoc main_#t~mem3#1; {1475#false} is VALID [2022-02-20 23:43:11,500 INFO L290 TraceCheckUtils]: 46: Hoare triple {1475#false} SUMMARY for call write~int(main_#t~mem3#1 - 1, main_~#a~0#1.base, 12 + main_~#a~0#1.offset, 4); srcloc: L18-1 {1475#false} is VALID [2022-02-20 23:43:11,500 INFO L290 TraceCheckUtils]: 45: Hoare triple {1475#false} SUMMARY for call main_#t~mem3#1 := read~int(main_~#a~0#1.base, 12 + main_~#a~0#1.offset, 4); srcloc: L18 {1475#false} is VALID [2022-02-20 23:43:11,500 INFO L290 TraceCheckUtils]: 44: Hoare triple {1475#false} assume !!(main_#t~mem2#1 >= 0);havoc main_#t~mem2#1; {1475#false} is VALID [2022-02-20 23:43:11,500 INFO L290 TraceCheckUtils]: 43: Hoare triple {1475#false} SUMMARY for call main_#t~mem2#1 := read~int(main_~#a~0#1.base, 12 + main_~#a~0#1.offset, 4); srcloc: L17-2 {1475#false} is VALID [2022-02-20 23:43:11,500 INFO L290 TraceCheckUtils]: 42: Hoare triple {1671#(< |ULTIMATE.start_main_~i~0#1| 1048)} assume !(main_~i~0#1 < 1048); {1475#false} is VALID [2022-02-20 23:43:11,501 INFO L290 TraceCheckUtils]: 41: Hoare triple {1675#(< |ULTIMATE.start_main_~i~0#1| 1047)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {1671#(< |ULTIMATE.start_main_~i~0#1| 1048)} is VALID [2022-02-20 23:43:11,501 INFO L290 TraceCheckUtils]: 40: Hoare triple {1675#(< |ULTIMATE.start_main_~i~0#1| 1047)} havoc main_#t~nondet1#1; {1675#(< |ULTIMATE.start_main_~i~0#1| 1047)} is VALID [2022-02-20 23:43:11,502 INFO L290 TraceCheckUtils]: 39: Hoare triple {1675#(< |ULTIMATE.start_main_~i~0#1| 1047)} SUMMARY for call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); srcloc: L14 {1675#(< |ULTIMATE.start_main_~i~0#1| 1047)} is VALID [2022-02-20 23:43:11,502 INFO L290 TraceCheckUtils]: 38: Hoare triple {1675#(< |ULTIMATE.start_main_~i~0#1| 1047)} assume !!(main_~i~0#1 < 1048);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {1675#(< |ULTIMATE.start_main_~i~0#1| 1047)} is VALID [2022-02-20 23:43:11,502 INFO L290 TraceCheckUtils]: 37: Hoare triple {1688#(< |ULTIMATE.start_main_~i~0#1| 1046)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {1675#(< |ULTIMATE.start_main_~i~0#1| 1047)} is VALID [2022-02-20 23:43:11,503 INFO L290 TraceCheckUtils]: 36: Hoare triple {1688#(< |ULTIMATE.start_main_~i~0#1| 1046)} havoc main_#t~nondet1#1; {1688#(< |ULTIMATE.start_main_~i~0#1| 1046)} is VALID [2022-02-20 23:43:11,503 INFO L290 TraceCheckUtils]: 35: Hoare triple {1688#(< |ULTIMATE.start_main_~i~0#1| 1046)} SUMMARY for call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); srcloc: L14 {1688#(< |ULTIMATE.start_main_~i~0#1| 1046)} is VALID [2022-02-20 23:43:11,503 INFO L290 TraceCheckUtils]: 34: Hoare triple {1688#(< |ULTIMATE.start_main_~i~0#1| 1046)} assume !!(main_~i~0#1 < 1048);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {1688#(< |ULTIMATE.start_main_~i~0#1| 1046)} is VALID [2022-02-20 23:43:11,504 INFO L290 TraceCheckUtils]: 33: Hoare triple {1701#(< |ULTIMATE.start_main_~i~0#1| 1045)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {1688#(< |ULTIMATE.start_main_~i~0#1| 1046)} is VALID [2022-02-20 23:43:11,504 INFO L290 TraceCheckUtils]: 32: Hoare triple {1701#(< |ULTIMATE.start_main_~i~0#1| 1045)} havoc main_#t~nondet1#1; {1701#(< |ULTIMATE.start_main_~i~0#1| 1045)} is VALID [2022-02-20 23:43:11,504 INFO L290 TraceCheckUtils]: 31: Hoare triple {1701#(< |ULTIMATE.start_main_~i~0#1| 1045)} SUMMARY for call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); srcloc: L14 {1701#(< |ULTIMATE.start_main_~i~0#1| 1045)} is VALID [2022-02-20 23:43:11,504 INFO L290 TraceCheckUtils]: 30: Hoare triple {1701#(< |ULTIMATE.start_main_~i~0#1| 1045)} assume !!(main_~i~0#1 < 1048);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {1701#(< |ULTIMATE.start_main_~i~0#1| 1045)} is VALID [2022-02-20 23:43:11,505 INFO L290 TraceCheckUtils]: 29: Hoare triple {1714#(< |ULTIMATE.start_main_~i~0#1| 1044)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {1701#(< |ULTIMATE.start_main_~i~0#1| 1045)} is VALID [2022-02-20 23:43:11,505 INFO L290 TraceCheckUtils]: 28: Hoare triple {1714#(< |ULTIMATE.start_main_~i~0#1| 1044)} havoc main_#t~nondet1#1; {1714#(< |ULTIMATE.start_main_~i~0#1| 1044)} is VALID [2022-02-20 23:43:11,506 INFO L290 TraceCheckUtils]: 27: Hoare triple {1714#(< |ULTIMATE.start_main_~i~0#1| 1044)} SUMMARY for call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); srcloc: L14 {1714#(< |ULTIMATE.start_main_~i~0#1| 1044)} is VALID [2022-02-20 23:43:11,506 INFO L290 TraceCheckUtils]: 26: Hoare triple {1714#(< |ULTIMATE.start_main_~i~0#1| 1044)} assume !!(main_~i~0#1 < 1048);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {1714#(< |ULTIMATE.start_main_~i~0#1| 1044)} is VALID [2022-02-20 23:43:11,507 INFO L290 TraceCheckUtils]: 25: Hoare triple {1727#(< |ULTIMATE.start_main_~i~0#1| 1043)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {1714#(< |ULTIMATE.start_main_~i~0#1| 1044)} is VALID [2022-02-20 23:43:11,507 INFO L290 TraceCheckUtils]: 24: Hoare triple {1727#(< |ULTIMATE.start_main_~i~0#1| 1043)} havoc main_#t~nondet1#1; {1727#(< |ULTIMATE.start_main_~i~0#1| 1043)} is VALID [2022-02-20 23:43:11,507 INFO L290 TraceCheckUtils]: 23: Hoare triple {1727#(< |ULTIMATE.start_main_~i~0#1| 1043)} SUMMARY for call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); srcloc: L14 {1727#(< |ULTIMATE.start_main_~i~0#1| 1043)} is VALID [2022-02-20 23:43:11,508 INFO L290 TraceCheckUtils]: 22: Hoare triple {1727#(< |ULTIMATE.start_main_~i~0#1| 1043)} assume !!(main_~i~0#1 < 1048);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {1727#(< |ULTIMATE.start_main_~i~0#1| 1043)} is VALID [2022-02-20 23:43:11,508 INFO L290 TraceCheckUtils]: 21: Hoare triple {1740#(< |ULTIMATE.start_main_~i~0#1| 1042)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {1727#(< |ULTIMATE.start_main_~i~0#1| 1043)} is VALID [2022-02-20 23:43:11,508 INFO L290 TraceCheckUtils]: 20: Hoare triple {1740#(< |ULTIMATE.start_main_~i~0#1| 1042)} havoc main_#t~nondet1#1; {1740#(< |ULTIMATE.start_main_~i~0#1| 1042)} is VALID [2022-02-20 23:43:11,509 INFO L290 TraceCheckUtils]: 19: Hoare triple {1740#(< |ULTIMATE.start_main_~i~0#1| 1042)} SUMMARY for call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); srcloc: L14 {1740#(< |ULTIMATE.start_main_~i~0#1| 1042)} is VALID [2022-02-20 23:43:11,509 INFO L290 TraceCheckUtils]: 18: Hoare triple {1740#(< |ULTIMATE.start_main_~i~0#1| 1042)} assume !!(main_~i~0#1 < 1048);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {1740#(< |ULTIMATE.start_main_~i~0#1| 1042)} is VALID [2022-02-20 23:43:11,509 INFO L290 TraceCheckUtils]: 17: Hoare triple {1753#(< |ULTIMATE.start_main_~i~0#1| 1041)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {1740#(< |ULTIMATE.start_main_~i~0#1| 1042)} is VALID [2022-02-20 23:43:11,510 INFO L290 TraceCheckUtils]: 16: Hoare triple {1753#(< |ULTIMATE.start_main_~i~0#1| 1041)} havoc main_#t~nondet1#1; {1753#(< |ULTIMATE.start_main_~i~0#1| 1041)} is VALID [2022-02-20 23:43:11,510 INFO L290 TraceCheckUtils]: 15: Hoare triple {1753#(< |ULTIMATE.start_main_~i~0#1| 1041)} SUMMARY for call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); srcloc: L14 {1753#(< |ULTIMATE.start_main_~i~0#1| 1041)} is VALID [2022-02-20 23:43:11,510 INFO L290 TraceCheckUtils]: 14: Hoare triple {1753#(< |ULTIMATE.start_main_~i~0#1| 1041)} assume !!(main_~i~0#1 < 1048);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {1753#(< |ULTIMATE.start_main_~i~0#1| 1041)} is VALID [2022-02-20 23:43:11,511 INFO L290 TraceCheckUtils]: 13: Hoare triple {1766#(< |ULTIMATE.start_main_~i~0#1| 1040)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {1753#(< |ULTIMATE.start_main_~i~0#1| 1041)} is VALID [2022-02-20 23:43:11,511 INFO L290 TraceCheckUtils]: 12: Hoare triple {1766#(< |ULTIMATE.start_main_~i~0#1| 1040)} havoc main_#t~nondet1#1; {1766#(< |ULTIMATE.start_main_~i~0#1| 1040)} is VALID [2022-02-20 23:43:11,511 INFO L290 TraceCheckUtils]: 11: Hoare triple {1766#(< |ULTIMATE.start_main_~i~0#1| 1040)} SUMMARY for call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); srcloc: L14 {1766#(< |ULTIMATE.start_main_~i~0#1| 1040)} is VALID [2022-02-20 23:43:11,511 INFO L290 TraceCheckUtils]: 10: Hoare triple {1766#(< |ULTIMATE.start_main_~i~0#1| 1040)} assume !!(main_~i~0#1 < 1048);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {1766#(< |ULTIMATE.start_main_~i~0#1| 1040)} is VALID [2022-02-20 23:43:11,512 INFO L290 TraceCheckUtils]: 9: Hoare triple {1779#(< |ULTIMATE.start_main_~i~0#1| 1039)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {1766#(< |ULTIMATE.start_main_~i~0#1| 1040)} is VALID [2022-02-20 23:43:11,512 INFO L290 TraceCheckUtils]: 8: Hoare triple {1779#(< |ULTIMATE.start_main_~i~0#1| 1039)} havoc main_#t~nondet1#1; {1779#(< |ULTIMATE.start_main_~i~0#1| 1039)} is VALID [2022-02-20 23:43:11,512 INFO L290 TraceCheckUtils]: 7: Hoare triple {1779#(< |ULTIMATE.start_main_~i~0#1| 1039)} SUMMARY for call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); srcloc: L14 {1779#(< |ULTIMATE.start_main_~i~0#1| 1039)} is VALID [2022-02-20 23:43:11,513 INFO L290 TraceCheckUtils]: 6: Hoare triple {1779#(< |ULTIMATE.start_main_~i~0#1| 1039)} assume !!(main_~i~0#1 < 1048);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {1779#(< |ULTIMATE.start_main_~i~0#1| 1039)} is VALID [2022-02-20 23:43:11,513 INFO L290 TraceCheckUtils]: 5: Hoare triple {1792#(< |ULTIMATE.start_main_~i~0#1| 1038)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {1779#(< |ULTIMATE.start_main_~i~0#1| 1039)} is VALID [2022-02-20 23:43:11,517 INFO L290 TraceCheckUtils]: 4: Hoare triple {1792#(< |ULTIMATE.start_main_~i~0#1| 1038)} havoc main_#t~nondet1#1; {1792#(< |ULTIMATE.start_main_~i~0#1| 1038)} is VALID [2022-02-20 23:43:11,517 INFO L290 TraceCheckUtils]: 3: Hoare triple {1792#(< |ULTIMATE.start_main_~i~0#1| 1038)} SUMMARY for call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); srcloc: L14 {1792#(< |ULTIMATE.start_main_~i~0#1| 1038)} is VALID [2022-02-20 23:43:11,517 INFO L290 TraceCheckUtils]: 2: Hoare triple {1792#(< |ULTIMATE.start_main_~i~0#1| 1038)} assume !!(main_~i~0#1 < 1048);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {1792#(< |ULTIMATE.start_main_~i~0#1| 1038)} is VALID [2022-02-20 23:43:11,523 INFO L290 TraceCheckUtils]: 1: Hoare triple {1474#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~post0#1, main_~i~0#1, main_#t~mem3#1, main_#t~mem2#1, main_~#a~0#1.base, main_~#a~0#1.offset;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4192);main_~i~0#1 := 0; {1792#(< |ULTIMATE.start_main_~i~0#1| 1038)} is VALID [2022-02-20 23:43:11,523 INFO L290 TraceCheckUtils]: 0: Hoare triple {1474#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {1474#true} is VALID [2022-02-20 23:43:11,524 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-20 23:43:11,524 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [247659452] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 23:43:11,524 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 23:43:11,524 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2022-02-20 23:43:11,524 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902890123] [2022-02-20 23:43:11,524 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 23:43:11,525 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 3.92) internal successors, (98), 25 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2022-02-20 23:43:11,525 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:43:11,525 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 25 states, 25 states have (on average 3.92) internal successors, (98), 25 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:11,587 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 98 edges. 98 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:43:11,587 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-02-20 23:43:11,588 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:43:11,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-02-20 23:43:11,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2022-02-20 23:43:11,589 INFO L87 Difference]: Start difference. First operand 53 states and 54 transitions. Second operand has 25 states, 25 states have (on average 3.92) internal successors, (98), 25 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:11,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:43:11,775 INFO L93 Difference]: Finished difference Result 101 states and 102 transitions. [2022-02-20 23:43:11,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-02-20 23:43:11,775 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 3.92) internal successors, (98), 25 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2022-02-20 23:43:11,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:43:11,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 3.92) internal successors, (98), 25 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:11,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 112 transitions. [2022-02-20 23:43:11,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 3.92) internal successors, (98), 25 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:11,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 112 transitions. [2022-02-20 23:43:11,779 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states and 112 transitions. [2022-02-20 23:43:11,853 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 112 edges. 112 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:43:11,855 INFO L225 Difference]: With dead ends: 101 [2022-02-20 23:43:11,855 INFO L226 Difference]: Without dead ends: 101 [2022-02-20 23:43:11,855 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2022-02-20 23:43:11,855 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 66 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:43:11,855 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [66 Valid, 88 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:43:11,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2022-02-20 23:43:11,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2022-02-20 23:43:11,858 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:43:11,858 INFO L82 GeneralOperation]: Start isEquivalent. First operand 101 states. Second operand has 101 states, 100 states have (on average 1.02) internal successors, (102), 100 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:11,859 INFO L74 IsIncluded]: Start isIncluded. First operand 101 states. Second operand has 101 states, 100 states have (on average 1.02) internal successors, (102), 100 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:11,859 INFO L87 Difference]: Start difference. First operand 101 states. Second operand has 101 states, 100 states have (on average 1.02) internal successors, (102), 100 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:11,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:43:11,860 INFO L93 Difference]: Finished difference Result 101 states and 102 transitions. [2022-02-20 23:43:11,860 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 102 transitions. [2022-02-20 23:43:11,860 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:43:11,860 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:43:11,861 INFO L74 IsIncluded]: Start isIncluded. First operand has 101 states, 100 states have (on average 1.02) internal successors, (102), 100 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 101 states. [2022-02-20 23:43:11,861 INFO L87 Difference]: Start difference. First operand has 101 states, 100 states have (on average 1.02) internal successors, (102), 100 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 101 states. [2022-02-20 23:43:11,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:43:11,862 INFO L93 Difference]: Finished difference Result 101 states and 102 transitions. [2022-02-20 23:43:11,863 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 102 transitions. [2022-02-20 23:43:11,863 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:43:11,863 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:43:11,863 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:43:11,863 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:43:11,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 100 states have (on average 1.02) internal successors, (102), 100 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:11,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 102 transitions. [2022-02-20 23:43:11,865 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 102 transitions. Word has length 52 [2022-02-20 23:43:11,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:43:11,865 INFO L470 AbstractCegarLoop]: Abstraction has 101 states and 102 transitions. [2022-02-20 23:43:11,865 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 3.92) internal successors, (98), 25 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:11,865 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 102 transitions. [2022-02-20 23:43:11,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-02-20 23:43:11,866 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:43:11,866 INFO L514 BasicCegarLoop]: trace histogram [22, 22, 22, 22, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:43:11,904 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-02-20 23:43:12,105 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:43:12,105 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 5 more)] === [2022-02-20 23:43:12,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:43:12,105 INFO L85 PathProgramCache]: Analyzing trace with hash 1197015391, now seen corresponding path program 2 times [2022-02-20 23:43:12,106 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:43:12,106 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203950859] [2022-02-20 23:43:12,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:43:12,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:43:12,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:43:12,426 INFO L290 TraceCheckUtils]: 0: Hoare triple {2211#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {2211#true} is VALID [2022-02-20 23:43:12,427 INFO L290 TraceCheckUtils]: 1: Hoare triple {2211#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~post0#1, main_~i~0#1, main_#t~mem3#1, main_#t~mem2#1, main_~#a~0#1.base, main_~#a~0#1.offset;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4192);main_~i~0#1 := 0; {2213#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 23:43:12,427 INFO L290 TraceCheckUtils]: 2: Hoare triple {2213#(= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < 1048);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {2213#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 23:43:12,427 INFO L290 TraceCheckUtils]: 3: Hoare triple {2213#(= |ULTIMATE.start_main_~i~0#1| 0)} SUMMARY for call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); srcloc: L14 {2213#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 23:43:12,428 INFO L290 TraceCheckUtils]: 4: Hoare triple {2213#(= |ULTIMATE.start_main_~i~0#1| 0)} havoc main_#t~nondet1#1; {2213#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 23:43:12,428 INFO L290 TraceCheckUtils]: 5: Hoare triple {2213#(= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {2214#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 23:43:12,428 INFO L290 TraceCheckUtils]: 6: Hoare triple {2214#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !!(main_~i~0#1 < 1048);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {2214#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 23:43:12,429 INFO L290 TraceCheckUtils]: 7: Hoare triple {2214#(<= |ULTIMATE.start_main_~i~0#1| 1)} SUMMARY for call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); srcloc: L14 {2214#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 23:43:12,429 INFO L290 TraceCheckUtils]: 8: Hoare triple {2214#(<= |ULTIMATE.start_main_~i~0#1| 1)} havoc main_#t~nondet1#1; {2214#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 23:43:12,429 INFO L290 TraceCheckUtils]: 9: Hoare triple {2214#(<= |ULTIMATE.start_main_~i~0#1| 1)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {2215#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-20 23:43:12,430 INFO L290 TraceCheckUtils]: 10: Hoare triple {2215#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !!(main_~i~0#1 < 1048);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {2215#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-20 23:43:12,430 INFO L290 TraceCheckUtils]: 11: Hoare triple {2215#(<= |ULTIMATE.start_main_~i~0#1| 2)} SUMMARY for call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); srcloc: L14 {2215#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-20 23:43:12,430 INFO L290 TraceCheckUtils]: 12: Hoare triple {2215#(<= |ULTIMATE.start_main_~i~0#1| 2)} havoc main_#t~nondet1#1; {2215#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-20 23:43:12,431 INFO L290 TraceCheckUtils]: 13: Hoare triple {2215#(<= |ULTIMATE.start_main_~i~0#1| 2)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {2216#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-20 23:43:12,431 INFO L290 TraceCheckUtils]: 14: Hoare triple {2216#(<= |ULTIMATE.start_main_~i~0#1| 3)} assume !!(main_~i~0#1 < 1048);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {2216#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-20 23:43:12,431 INFO L290 TraceCheckUtils]: 15: Hoare triple {2216#(<= |ULTIMATE.start_main_~i~0#1| 3)} SUMMARY for call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); srcloc: L14 {2216#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-20 23:43:12,432 INFO L290 TraceCheckUtils]: 16: Hoare triple {2216#(<= |ULTIMATE.start_main_~i~0#1| 3)} havoc main_#t~nondet1#1; {2216#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-20 23:43:12,432 INFO L290 TraceCheckUtils]: 17: Hoare triple {2216#(<= |ULTIMATE.start_main_~i~0#1| 3)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {2217#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-20 23:43:12,432 INFO L290 TraceCheckUtils]: 18: Hoare triple {2217#(<= |ULTIMATE.start_main_~i~0#1| 4)} assume !!(main_~i~0#1 < 1048);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {2217#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-20 23:43:12,433 INFO L290 TraceCheckUtils]: 19: Hoare triple {2217#(<= |ULTIMATE.start_main_~i~0#1| 4)} SUMMARY for call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); srcloc: L14 {2217#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-20 23:43:12,433 INFO L290 TraceCheckUtils]: 20: Hoare triple {2217#(<= |ULTIMATE.start_main_~i~0#1| 4)} havoc main_#t~nondet1#1; {2217#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-20 23:43:12,434 INFO L290 TraceCheckUtils]: 21: Hoare triple {2217#(<= |ULTIMATE.start_main_~i~0#1| 4)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {2218#(<= |ULTIMATE.start_main_~i~0#1| 5)} is VALID [2022-02-20 23:43:12,434 INFO L290 TraceCheckUtils]: 22: Hoare triple {2218#(<= |ULTIMATE.start_main_~i~0#1| 5)} assume !!(main_~i~0#1 < 1048);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {2218#(<= |ULTIMATE.start_main_~i~0#1| 5)} is VALID [2022-02-20 23:43:12,434 INFO L290 TraceCheckUtils]: 23: Hoare triple {2218#(<= |ULTIMATE.start_main_~i~0#1| 5)} SUMMARY for call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); srcloc: L14 {2218#(<= |ULTIMATE.start_main_~i~0#1| 5)} is VALID [2022-02-20 23:43:12,435 INFO L290 TraceCheckUtils]: 24: Hoare triple {2218#(<= |ULTIMATE.start_main_~i~0#1| 5)} havoc main_#t~nondet1#1; {2218#(<= |ULTIMATE.start_main_~i~0#1| 5)} is VALID [2022-02-20 23:43:12,435 INFO L290 TraceCheckUtils]: 25: Hoare triple {2218#(<= |ULTIMATE.start_main_~i~0#1| 5)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {2219#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-20 23:43:12,435 INFO L290 TraceCheckUtils]: 26: Hoare triple {2219#(<= |ULTIMATE.start_main_~i~0#1| 6)} assume !!(main_~i~0#1 < 1048);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {2219#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-20 23:43:12,436 INFO L290 TraceCheckUtils]: 27: Hoare triple {2219#(<= |ULTIMATE.start_main_~i~0#1| 6)} SUMMARY for call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); srcloc: L14 {2219#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-20 23:43:12,436 INFO L290 TraceCheckUtils]: 28: Hoare triple {2219#(<= |ULTIMATE.start_main_~i~0#1| 6)} havoc main_#t~nondet1#1; {2219#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-20 23:43:12,436 INFO L290 TraceCheckUtils]: 29: Hoare triple {2219#(<= |ULTIMATE.start_main_~i~0#1| 6)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {2220#(<= |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-20 23:43:12,437 INFO L290 TraceCheckUtils]: 30: Hoare triple {2220#(<= |ULTIMATE.start_main_~i~0#1| 7)} assume !!(main_~i~0#1 < 1048);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {2220#(<= |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-20 23:43:12,437 INFO L290 TraceCheckUtils]: 31: Hoare triple {2220#(<= |ULTIMATE.start_main_~i~0#1| 7)} SUMMARY for call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); srcloc: L14 {2220#(<= |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-20 23:43:12,437 INFO L290 TraceCheckUtils]: 32: Hoare triple {2220#(<= |ULTIMATE.start_main_~i~0#1| 7)} havoc main_#t~nondet1#1; {2220#(<= |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-20 23:43:12,438 INFO L290 TraceCheckUtils]: 33: Hoare triple {2220#(<= |ULTIMATE.start_main_~i~0#1| 7)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {2221#(<= |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-20 23:43:12,438 INFO L290 TraceCheckUtils]: 34: Hoare triple {2221#(<= |ULTIMATE.start_main_~i~0#1| 8)} assume !!(main_~i~0#1 < 1048);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {2221#(<= |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-20 23:43:12,439 INFO L290 TraceCheckUtils]: 35: Hoare triple {2221#(<= |ULTIMATE.start_main_~i~0#1| 8)} SUMMARY for call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); srcloc: L14 {2221#(<= |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-20 23:43:12,439 INFO L290 TraceCheckUtils]: 36: Hoare triple {2221#(<= |ULTIMATE.start_main_~i~0#1| 8)} havoc main_#t~nondet1#1; {2221#(<= |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-20 23:43:12,439 INFO L290 TraceCheckUtils]: 37: Hoare triple {2221#(<= |ULTIMATE.start_main_~i~0#1| 8)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {2222#(<= |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-20 23:43:12,440 INFO L290 TraceCheckUtils]: 38: Hoare triple {2222#(<= |ULTIMATE.start_main_~i~0#1| 9)} assume !!(main_~i~0#1 < 1048);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {2222#(<= |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-20 23:43:12,440 INFO L290 TraceCheckUtils]: 39: Hoare triple {2222#(<= |ULTIMATE.start_main_~i~0#1| 9)} SUMMARY for call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); srcloc: L14 {2222#(<= |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-20 23:43:12,440 INFO L290 TraceCheckUtils]: 40: Hoare triple {2222#(<= |ULTIMATE.start_main_~i~0#1| 9)} havoc main_#t~nondet1#1; {2222#(<= |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-20 23:43:12,441 INFO L290 TraceCheckUtils]: 41: Hoare triple {2222#(<= |ULTIMATE.start_main_~i~0#1| 9)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {2223#(<= |ULTIMATE.start_main_~i~0#1| 10)} is VALID [2022-02-20 23:43:12,441 INFO L290 TraceCheckUtils]: 42: Hoare triple {2223#(<= |ULTIMATE.start_main_~i~0#1| 10)} assume !!(main_~i~0#1 < 1048);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {2223#(<= |ULTIMATE.start_main_~i~0#1| 10)} is VALID [2022-02-20 23:43:12,441 INFO L290 TraceCheckUtils]: 43: Hoare triple {2223#(<= |ULTIMATE.start_main_~i~0#1| 10)} SUMMARY for call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); srcloc: L14 {2223#(<= |ULTIMATE.start_main_~i~0#1| 10)} is VALID [2022-02-20 23:43:12,441 INFO L290 TraceCheckUtils]: 44: Hoare triple {2223#(<= |ULTIMATE.start_main_~i~0#1| 10)} havoc main_#t~nondet1#1; {2223#(<= |ULTIMATE.start_main_~i~0#1| 10)} is VALID [2022-02-20 23:43:12,442 INFO L290 TraceCheckUtils]: 45: Hoare triple {2223#(<= |ULTIMATE.start_main_~i~0#1| 10)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {2224#(<= |ULTIMATE.start_main_~i~0#1| 11)} is VALID [2022-02-20 23:43:12,442 INFO L290 TraceCheckUtils]: 46: Hoare triple {2224#(<= |ULTIMATE.start_main_~i~0#1| 11)} assume !!(main_~i~0#1 < 1048);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {2224#(<= |ULTIMATE.start_main_~i~0#1| 11)} is VALID [2022-02-20 23:43:12,442 INFO L290 TraceCheckUtils]: 47: Hoare triple {2224#(<= |ULTIMATE.start_main_~i~0#1| 11)} SUMMARY for call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); srcloc: L14 {2224#(<= |ULTIMATE.start_main_~i~0#1| 11)} is VALID [2022-02-20 23:43:12,443 INFO L290 TraceCheckUtils]: 48: Hoare triple {2224#(<= |ULTIMATE.start_main_~i~0#1| 11)} havoc main_#t~nondet1#1; {2224#(<= |ULTIMATE.start_main_~i~0#1| 11)} is VALID [2022-02-20 23:43:12,443 INFO L290 TraceCheckUtils]: 49: Hoare triple {2224#(<= |ULTIMATE.start_main_~i~0#1| 11)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {2225#(<= |ULTIMATE.start_main_~i~0#1| 12)} is VALID [2022-02-20 23:43:12,443 INFO L290 TraceCheckUtils]: 50: Hoare triple {2225#(<= |ULTIMATE.start_main_~i~0#1| 12)} assume !!(main_~i~0#1 < 1048);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {2225#(<= |ULTIMATE.start_main_~i~0#1| 12)} is VALID [2022-02-20 23:43:12,444 INFO L290 TraceCheckUtils]: 51: Hoare triple {2225#(<= |ULTIMATE.start_main_~i~0#1| 12)} SUMMARY for call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); srcloc: L14 {2225#(<= |ULTIMATE.start_main_~i~0#1| 12)} is VALID [2022-02-20 23:43:12,444 INFO L290 TraceCheckUtils]: 52: Hoare triple {2225#(<= |ULTIMATE.start_main_~i~0#1| 12)} havoc main_#t~nondet1#1; {2225#(<= |ULTIMATE.start_main_~i~0#1| 12)} is VALID [2022-02-20 23:43:12,445 INFO L290 TraceCheckUtils]: 53: Hoare triple {2225#(<= |ULTIMATE.start_main_~i~0#1| 12)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {2226#(<= |ULTIMATE.start_main_~i~0#1| 13)} is VALID [2022-02-20 23:43:12,445 INFO L290 TraceCheckUtils]: 54: Hoare triple {2226#(<= |ULTIMATE.start_main_~i~0#1| 13)} assume !!(main_~i~0#1 < 1048);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {2226#(<= |ULTIMATE.start_main_~i~0#1| 13)} is VALID [2022-02-20 23:43:12,445 INFO L290 TraceCheckUtils]: 55: Hoare triple {2226#(<= |ULTIMATE.start_main_~i~0#1| 13)} SUMMARY for call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); srcloc: L14 {2226#(<= |ULTIMATE.start_main_~i~0#1| 13)} is VALID [2022-02-20 23:43:12,446 INFO L290 TraceCheckUtils]: 56: Hoare triple {2226#(<= |ULTIMATE.start_main_~i~0#1| 13)} havoc main_#t~nondet1#1; {2226#(<= |ULTIMATE.start_main_~i~0#1| 13)} is VALID [2022-02-20 23:43:12,446 INFO L290 TraceCheckUtils]: 57: Hoare triple {2226#(<= |ULTIMATE.start_main_~i~0#1| 13)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {2227#(<= |ULTIMATE.start_main_~i~0#1| 14)} is VALID [2022-02-20 23:43:12,446 INFO L290 TraceCheckUtils]: 58: Hoare triple {2227#(<= |ULTIMATE.start_main_~i~0#1| 14)} assume !!(main_~i~0#1 < 1048);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {2227#(<= |ULTIMATE.start_main_~i~0#1| 14)} is VALID [2022-02-20 23:43:12,447 INFO L290 TraceCheckUtils]: 59: Hoare triple {2227#(<= |ULTIMATE.start_main_~i~0#1| 14)} SUMMARY for call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); srcloc: L14 {2227#(<= |ULTIMATE.start_main_~i~0#1| 14)} is VALID [2022-02-20 23:43:12,447 INFO L290 TraceCheckUtils]: 60: Hoare triple {2227#(<= |ULTIMATE.start_main_~i~0#1| 14)} havoc main_#t~nondet1#1; {2227#(<= |ULTIMATE.start_main_~i~0#1| 14)} is VALID [2022-02-20 23:43:12,447 INFO L290 TraceCheckUtils]: 61: Hoare triple {2227#(<= |ULTIMATE.start_main_~i~0#1| 14)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {2228#(<= |ULTIMATE.start_main_~i~0#1| 15)} is VALID [2022-02-20 23:43:12,448 INFO L290 TraceCheckUtils]: 62: Hoare triple {2228#(<= |ULTIMATE.start_main_~i~0#1| 15)} assume !!(main_~i~0#1 < 1048);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {2228#(<= |ULTIMATE.start_main_~i~0#1| 15)} is VALID [2022-02-20 23:43:12,448 INFO L290 TraceCheckUtils]: 63: Hoare triple {2228#(<= |ULTIMATE.start_main_~i~0#1| 15)} SUMMARY for call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); srcloc: L14 {2228#(<= |ULTIMATE.start_main_~i~0#1| 15)} is VALID [2022-02-20 23:43:12,448 INFO L290 TraceCheckUtils]: 64: Hoare triple {2228#(<= |ULTIMATE.start_main_~i~0#1| 15)} havoc main_#t~nondet1#1; {2228#(<= |ULTIMATE.start_main_~i~0#1| 15)} is VALID [2022-02-20 23:43:12,448 INFO L290 TraceCheckUtils]: 65: Hoare triple {2228#(<= |ULTIMATE.start_main_~i~0#1| 15)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {2229#(<= |ULTIMATE.start_main_~i~0#1| 16)} is VALID [2022-02-20 23:43:12,449 INFO L290 TraceCheckUtils]: 66: Hoare triple {2229#(<= |ULTIMATE.start_main_~i~0#1| 16)} assume !!(main_~i~0#1 < 1048);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {2229#(<= |ULTIMATE.start_main_~i~0#1| 16)} is VALID [2022-02-20 23:43:12,449 INFO L290 TraceCheckUtils]: 67: Hoare triple {2229#(<= |ULTIMATE.start_main_~i~0#1| 16)} SUMMARY for call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); srcloc: L14 {2229#(<= |ULTIMATE.start_main_~i~0#1| 16)} is VALID [2022-02-20 23:43:12,449 INFO L290 TraceCheckUtils]: 68: Hoare triple {2229#(<= |ULTIMATE.start_main_~i~0#1| 16)} havoc main_#t~nondet1#1; {2229#(<= |ULTIMATE.start_main_~i~0#1| 16)} is VALID [2022-02-20 23:43:12,450 INFO L290 TraceCheckUtils]: 69: Hoare triple {2229#(<= |ULTIMATE.start_main_~i~0#1| 16)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {2230#(<= |ULTIMATE.start_main_~i~0#1| 17)} is VALID [2022-02-20 23:43:12,450 INFO L290 TraceCheckUtils]: 70: Hoare triple {2230#(<= |ULTIMATE.start_main_~i~0#1| 17)} assume !!(main_~i~0#1 < 1048);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {2230#(<= |ULTIMATE.start_main_~i~0#1| 17)} is VALID [2022-02-20 23:43:12,450 INFO L290 TraceCheckUtils]: 71: Hoare triple {2230#(<= |ULTIMATE.start_main_~i~0#1| 17)} SUMMARY for call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); srcloc: L14 {2230#(<= |ULTIMATE.start_main_~i~0#1| 17)} is VALID [2022-02-20 23:43:12,451 INFO L290 TraceCheckUtils]: 72: Hoare triple {2230#(<= |ULTIMATE.start_main_~i~0#1| 17)} havoc main_#t~nondet1#1; {2230#(<= |ULTIMATE.start_main_~i~0#1| 17)} is VALID [2022-02-20 23:43:12,451 INFO L290 TraceCheckUtils]: 73: Hoare triple {2230#(<= |ULTIMATE.start_main_~i~0#1| 17)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {2231#(<= |ULTIMATE.start_main_~i~0#1| 18)} is VALID [2022-02-20 23:43:12,451 INFO L290 TraceCheckUtils]: 74: Hoare triple {2231#(<= |ULTIMATE.start_main_~i~0#1| 18)} assume !!(main_~i~0#1 < 1048);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {2231#(<= |ULTIMATE.start_main_~i~0#1| 18)} is VALID [2022-02-20 23:43:12,452 INFO L290 TraceCheckUtils]: 75: Hoare triple {2231#(<= |ULTIMATE.start_main_~i~0#1| 18)} SUMMARY for call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); srcloc: L14 {2231#(<= |ULTIMATE.start_main_~i~0#1| 18)} is VALID [2022-02-20 23:43:12,452 INFO L290 TraceCheckUtils]: 76: Hoare triple {2231#(<= |ULTIMATE.start_main_~i~0#1| 18)} havoc main_#t~nondet1#1; {2231#(<= |ULTIMATE.start_main_~i~0#1| 18)} is VALID [2022-02-20 23:43:12,452 INFO L290 TraceCheckUtils]: 77: Hoare triple {2231#(<= |ULTIMATE.start_main_~i~0#1| 18)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {2232#(<= |ULTIMATE.start_main_~i~0#1| 19)} is VALID [2022-02-20 23:43:12,452 INFO L290 TraceCheckUtils]: 78: Hoare triple {2232#(<= |ULTIMATE.start_main_~i~0#1| 19)} assume !!(main_~i~0#1 < 1048);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {2232#(<= |ULTIMATE.start_main_~i~0#1| 19)} is VALID [2022-02-20 23:43:12,453 INFO L290 TraceCheckUtils]: 79: Hoare triple {2232#(<= |ULTIMATE.start_main_~i~0#1| 19)} SUMMARY for call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); srcloc: L14 {2232#(<= |ULTIMATE.start_main_~i~0#1| 19)} is VALID [2022-02-20 23:43:12,453 INFO L290 TraceCheckUtils]: 80: Hoare triple {2232#(<= |ULTIMATE.start_main_~i~0#1| 19)} havoc main_#t~nondet1#1; {2232#(<= |ULTIMATE.start_main_~i~0#1| 19)} is VALID [2022-02-20 23:43:12,453 INFO L290 TraceCheckUtils]: 81: Hoare triple {2232#(<= |ULTIMATE.start_main_~i~0#1| 19)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {2233#(<= |ULTIMATE.start_main_~i~0#1| 20)} is VALID [2022-02-20 23:43:12,454 INFO L290 TraceCheckUtils]: 82: Hoare triple {2233#(<= |ULTIMATE.start_main_~i~0#1| 20)} assume !!(main_~i~0#1 < 1048);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {2233#(<= |ULTIMATE.start_main_~i~0#1| 20)} is VALID [2022-02-20 23:43:12,454 INFO L290 TraceCheckUtils]: 83: Hoare triple {2233#(<= |ULTIMATE.start_main_~i~0#1| 20)} SUMMARY for call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); srcloc: L14 {2233#(<= |ULTIMATE.start_main_~i~0#1| 20)} is VALID [2022-02-20 23:43:12,454 INFO L290 TraceCheckUtils]: 84: Hoare triple {2233#(<= |ULTIMATE.start_main_~i~0#1| 20)} havoc main_#t~nondet1#1; {2233#(<= |ULTIMATE.start_main_~i~0#1| 20)} is VALID [2022-02-20 23:43:12,455 INFO L290 TraceCheckUtils]: 85: Hoare triple {2233#(<= |ULTIMATE.start_main_~i~0#1| 20)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {2234#(<= |ULTIMATE.start_main_~i~0#1| 21)} is VALID [2022-02-20 23:43:12,455 INFO L290 TraceCheckUtils]: 86: Hoare triple {2234#(<= |ULTIMATE.start_main_~i~0#1| 21)} assume !!(main_~i~0#1 < 1048);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {2234#(<= |ULTIMATE.start_main_~i~0#1| 21)} is VALID [2022-02-20 23:43:12,455 INFO L290 TraceCheckUtils]: 87: Hoare triple {2234#(<= |ULTIMATE.start_main_~i~0#1| 21)} SUMMARY for call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); srcloc: L14 {2234#(<= |ULTIMATE.start_main_~i~0#1| 21)} is VALID [2022-02-20 23:43:12,456 INFO L290 TraceCheckUtils]: 88: Hoare triple {2234#(<= |ULTIMATE.start_main_~i~0#1| 21)} havoc main_#t~nondet1#1; {2234#(<= |ULTIMATE.start_main_~i~0#1| 21)} is VALID [2022-02-20 23:43:12,456 INFO L290 TraceCheckUtils]: 89: Hoare triple {2234#(<= |ULTIMATE.start_main_~i~0#1| 21)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {2235#(<= |ULTIMATE.start_main_~i~0#1| 22)} is VALID [2022-02-20 23:43:12,456 INFO L290 TraceCheckUtils]: 90: Hoare triple {2235#(<= |ULTIMATE.start_main_~i~0#1| 22)} assume !(main_~i~0#1 < 1048); {2212#false} is VALID [2022-02-20 23:43:12,456 INFO L290 TraceCheckUtils]: 91: Hoare triple {2212#false} SUMMARY for call main_#t~mem2#1 := read~int(main_~#a~0#1.base, 12 + main_~#a~0#1.offset, 4); srcloc: L17-2 {2212#false} is VALID [2022-02-20 23:43:12,457 INFO L290 TraceCheckUtils]: 92: Hoare triple {2212#false} assume !!(main_#t~mem2#1 >= 0);havoc main_#t~mem2#1; {2212#false} is VALID [2022-02-20 23:43:12,457 INFO L290 TraceCheckUtils]: 93: Hoare triple {2212#false} SUMMARY for call main_#t~mem3#1 := read~int(main_~#a~0#1.base, 12 + main_~#a~0#1.offset, 4); srcloc: L18 {2212#false} is VALID [2022-02-20 23:43:12,457 INFO L290 TraceCheckUtils]: 94: Hoare triple {2212#false} SUMMARY for call write~int(main_#t~mem3#1 - 1, main_~#a~0#1.base, 12 + main_~#a~0#1.offset, 4); srcloc: L18-1 {2212#false} is VALID [2022-02-20 23:43:12,457 INFO L290 TraceCheckUtils]: 95: Hoare triple {2212#false} havoc main_#t~mem3#1; {2212#false} is VALID [2022-02-20 23:43:12,457 INFO L290 TraceCheckUtils]: 96: Hoare triple {2212#false} SUMMARY for call main_#t~mem2#1 := read~int(main_~#a~0#1.base, 12 + main_~#a~0#1.offset, 4); srcloc: L17-2 {2212#false} is VALID [2022-02-20 23:43:12,457 INFO L290 TraceCheckUtils]: 97: Hoare triple {2212#false} assume !(main_#t~mem2#1 >= 0);havoc main_#t~mem2#1; {2212#false} is VALID [2022-02-20 23:43:12,457 INFO L290 TraceCheckUtils]: 98: Hoare triple {2212#false} main_#res#1 := 0;call ULTIMATE.dealloc(main_~#a~0#1.base, main_~#a~0#1.offset);havoc main_~#a~0#1.base, main_~#a~0#1.offset; {2212#false} is VALID [2022-02-20 23:43:12,457 INFO L290 TraceCheckUtils]: 99: Hoare triple {2212#false} assume !(#valid == main_old_#valid#1); {2212#false} is VALID [2022-02-20 23:43:12,458 INFO L134 CoverageAnalysis]: Checked inductivity of 948 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-20 23:43:12,458 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:43:12,458 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203950859] [2022-02-20 23:43:12,458 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [203950859] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 23:43:12,459 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2029696798] [2022-02-20 23:43:12,459 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-20 23:43:12,459 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:43:12,459 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:43:12,476 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:43:12,477 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:43:12,545 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-02-20 23:43:12,546 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 23:43:12,546 INFO L263 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 8 conjunts are in the unsatisfiable core [2022-02-20 23:43:12,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:43:12,561 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:43:13,241 INFO L290 TraceCheckUtils]: 0: Hoare triple {2211#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {2211#true} is VALID [2022-02-20 23:43:13,242 INFO L290 TraceCheckUtils]: 1: Hoare triple {2211#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~post0#1, main_~i~0#1, main_#t~mem3#1, main_#t~mem2#1, main_~#a~0#1.base, main_~#a~0#1.offset;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4192);main_~i~0#1 := 0; {2242#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base|) 0) (exists ((v_ArrVal_244 Int)) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base| v_ArrVal_244) |#valid|)))} is VALID [2022-02-20 23:43:13,242 INFO L290 TraceCheckUtils]: 2: Hoare triple {2242#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base|) 0) (exists ((v_ArrVal_244 Int)) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base| v_ArrVal_244) |#valid|)))} assume !!(main_~i~0#1 < 1048);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {2242#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base|) 0) (exists ((v_ArrVal_244 Int)) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base| v_ArrVal_244) |#valid|)))} is VALID [2022-02-20 23:43:13,243 INFO L290 TraceCheckUtils]: 3: Hoare triple {2242#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base|) 0) (exists ((v_ArrVal_244 Int)) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base| v_ArrVal_244) |#valid|)))} SUMMARY for call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); srcloc: L14 {2242#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base|) 0) (exists ((v_ArrVal_244 Int)) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base| v_ArrVal_244) |#valid|)))} is VALID [2022-02-20 23:43:13,244 INFO L290 TraceCheckUtils]: 4: Hoare triple {2242#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base|) 0) (exists ((v_ArrVal_244 Int)) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base| v_ArrVal_244) |#valid|)))} havoc main_#t~nondet1#1; {2242#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base|) 0) (exists ((v_ArrVal_244 Int)) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base| v_ArrVal_244) |#valid|)))} is VALID [2022-02-20 23:43:13,244 INFO L290 TraceCheckUtils]: 5: Hoare triple {2242#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base|) 0) (exists ((v_ArrVal_244 Int)) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base| v_ArrVal_244) |#valid|)))} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {2242#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base|) 0) (exists ((v_ArrVal_244 Int)) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base| v_ArrVal_244) |#valid|)))} is VALID [2022-02-20 23:43:13,245 INFO L290 TraceCheckUtils]: 6: Hoare triple {2242#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base|) 0) (exists ((v_ArrVal_244 Int)) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base| v_ArrVal_244) |#valid|)))} assume !!(main_~i~0#1 < 1048);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {2242#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base|) 0) (exists ((v_ArrVal_244 Int)) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base| v_ArrVal_244) |#valid|)))} is VALID [2022-02-20 23:43:13,245 INFO L290 TraceCheckUtils]: 7: Hoare triple {2242#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base|) 0) (exists ((v_ArrVal_244 Int)) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base| v_ArrVal_244) |#valid|)))} SUMMARY for call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); srcloc: L14 {2242#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base|) 0) (exists ((v_ArrVal_244 Int)) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base| v_ArrVal_244) |#valid|)))} is VALID [2022-02-20 23:43:13,246 INFO L290 TraceCheckUtils]: 8: Hoare triple {2242#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base|) 0) (exists ((v_ArrVal_244 Int)) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base| v_ArrVal_244) |#valid|)))} havoc main_#t~nondet1#1; {2242#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base|) 0) (exists ((v_ArrVal_244 Int)) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base| v_ArrVal_244) |#valid|)))} is VALID [2022-02-20 23:43:13,246 INFO L290 TraceCheckUtils]: 9: Hoare triple {2242#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base|) 0) (exists ((v_ArrVal_244 Int)) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base| v_ArrVal_244) |#valid|)))} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {2242#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base|) 0) (exists ((v_ArrVal_244 Int)) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base| v_ArrVal_244) |#valid|)))} is VALID [2022-02-20 23:43:13,247 INFO L290 TraceCheckUtils]: 10: Hoare triple {2242#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base|) 0) (exists ((v_ArrVal_244 Int)) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base| v_ArrVal_244) |#valid|)))} assume !!(main_~i~0#1 < 1048);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {2242#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base|) 0) (exists ((v_ArrVal_244 Int)) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base| v_ArrVal_244) |#valid|)))} is VALID [2022-02-20 23:43:13,248 INFO L290 TraceCheckUtils]: 11: Hoare triple {2242#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base|) 0) (exists ((v_ArrVal_244 Int)) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base| v_ArrVal_244) |#valid|)))} SUMMARY for call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); srcloc: L14 {2242#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base|) 0) (exists ((v_ArrVal_244 Int)) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base| v_ArrVal_244) |#valid|)))} is VALID [2022-02-20 23:43:13,248 INFO L290 TraceCheckUtils]: 12: Hoare triple {2242#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base|) 0) (exists ((v_ArrVal_244 Int)) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base| v_ArrVal_244) |#valid|)))} havoc main_#t~nondet1#1; {2242#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base|) 0) (exists ((v_ArrVal_244 Int)) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base| v_ArrVal_244) |#valid|)))} is VALID [2022-02-20 23:43:13,249 INFO L290 TraceCheckUtils]: 13: Hoare triple {2242#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base|) 0) (exists ((v_ArrVal_244 Int)) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base| v_ArrVal_244) |#valid|)))} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {2242#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base|) 0) (exists ((v_ArrVal_244 Int)) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base| v_ArrVal_244) |#valid|)))} is VALID [2022-02-20 23:43:13,249 INFO L290 TraceCheckUtils]: 14: Hoare triple {2242#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base|) 0) (exists ((v_ArrVal_244 Int)) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base| v_ArrVal_244) |#valid|)))} assume !!(main_~i~0#1 < 1048);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {2242#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base|) 0) (exists ((v_ArrVal_244 Int)) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base| v_ArrVal_244) |#valid|)))} is VALID [2022-02-20 23:43:13,250 INFO L290 TraceCheckUtils]: 15: Hoare triple {2242#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base|) 0) (exists ((v_ArrVal_244 Int)) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base| v_ArrVal_244) |#valid|)))} SUMMARY for call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); srcloc: L14 {2242#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base|) 0) (exists ((v_ArrVal_244 Int)) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base| v_ArrVal_244) |#valid|)))} is VALID [2022-02-20 23:43:13,250 INFO L290 TraceCheckUtils]: 16: Hoare triple {2242#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base|) 0) (exists ((v_ArrVal_244 Int)) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base| v_ArrVal_244) |#valid|)))} havoc main_#t~nondet1#1; {2242#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base|) 0) (exists ((v_ArrVal_244 Int)) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base| v_ArrVal_244) |#valid|)))} is VALID [2022-02-20 23:43:13,251 INFO L290 TraceCheckUtils]: 17: Hoare triple {2242#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base|) 0) (exists ((v_ArrVal_244 Int)) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base| v_ArrVal_244) |#valid|)))} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {2242#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base|) 0) (exists ((v_ArrVal_244 Int)) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base| v_ArrVal_244) |#valid|)))} is VALID [2022-02-20 23:43:13,251 INFO L290 TraceCheckUtils]: 18: Hoare triple {2242#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base|) 0) (exists ((v_ArrVal_244 Int)) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base| v_ArrVal_244) |#valid|)))} assume !!(main_~i~0#1 < 1048);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {2242#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base|) 0) (exists ((v_ArrVal_244 Int)) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base| v_ArrVal_244) |#valid|)))} is VALID [2022-02-20 23:43:13,252 INFO L290 TraceCheckUtils]: 19: Hoare triple {2242#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base|) 0) (exists ((v_ArrVal_244 Int)) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base| v_ArrVal_244) |#valid|)))} SUMMARY for call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); srcloc: L14 {2242#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base|) 0) (exists ((v_ArrVal_244 Int)) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base| v_ArrVal_244) |#valid|)))} is VALID [2022-02-20 23:43:13,252 INFO L290 TraceCheckUtils]: 20: Hoare triple {2242#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base|) 0) (exists ((v_ArrVal_244 Int)) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base| v_ArrVal_244) |#valid|)))} havoc main_#t~nondet1#1; {2242#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base|) 0) (exists ((v_ArrVal_244 Int)) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base| v_ArrVal_244) |#valid|)))} is VALID [2022-02-20 23:43:13,253 INFO L290 TraceCheckUtils]: 21: Hoare triple {2242#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base|) 0) (exists ((v_ArrVal_244 Int)) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base| v_ArrVal_244) |#valid|)))} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {2242#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base|) 0) (exists ((v_ArrVal_244 Int)) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base| v_ArrVal_244) |#valid|)))} is VALID [2022-02-20 23:43:13,254 INFO L290 TraceCheckUtils]: 22: Hoare triple {2242#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base|) 0) (exists ((v_ArrVal_244 Int)) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base| v_ArrVal_244) |#valid|)))} assume !!(main_~i~0#1 < 1048);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {2242#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base|) 0) (exists ((v_ArrVal_244 Int)) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base| v_ArrVal_244) |#valid|)))} is VALID [2022-02-20 23:43:13,254 INFO L290 TraceCheckUtils]: 23: Hoare triple {2242#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base|) 0) (exists ((v_ArrVal_244 Int)) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base| v_ArrVal_244) |#valid|)))} SUMMARY for call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); srcloc: L14 {2242#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base|) 0) (exists ((v_ArrVal_244 Int)) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base| v_ArrVal_244) |#valid|)))} is VALID [2022-02-20 23:43:13,255 INFO L290 TraceCheckUtils]: 24: Hoare triple {2242#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base|) 0) (exists ((v_ArrVal_244 Int)) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base| v_ArrVal_244) |#valid|)))} havoc main_#t~nondet1#1; {2242#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base|) 0) (exists ((v_ArrVal_244 Int)) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base| v_ArrVal_244) |#valid|)))} is VALID [2022-02-20 23:43:13,256 INFO L290 TraceCheckUtils]: 25: Hoare triple {2242#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base|) 0) (exists ((v_ArrVal_244 Int)) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base| v_ArrVal_244) |#valid|)))} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {2242#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base|) 0) (exists ((v_ArrVal_244 Int)) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base| v_ArrVal_244) |#valid|)))} is VALID [2022-02-20 23:43:13,257 INFO L290 TraceCheckUtils]: 26: Hoare triple {2242#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base|) 0) (exists ((v_ArrVal_244 Int)) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base| v_ArrVal_244) |#valid|)))} assume !!(main_~i~0#1 < 1048);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {2242#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base|) 0) (exists ((v_ArrVal_244 Int)) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base| v_ArrVal_244) |#valid|)))} is VALID [2022-02-20 23:43:13,258 INFO L290 TraceCheckUtils]: 27: Hoare triple {2242#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base|) 0) (exists ((v_ArrVal_244 Int)) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base| v_ArrVal_244) |#valid|)))} SUMMARY for call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); srcloc: L14 {2242#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base|) 0) (exists ((v_ArrVal_244 Int)) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base| v_ArrVal_244) |#valid|)))} is VALID [2022-02-20 23:43:13,258 INFO L290 TraceCheckUtils]: 28: Hoare triple {2242#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base|) 0) (exists ((v_ArrVal_244 Int)) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base| v_ArrVal_244) |#valid|)))} havoc main_#t~nondet1#1; {2242#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base|) 0) (exists ((v_ArrVal_244 Int)) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base| v_ArrVal_244) |#valid|)))} is VALID [2022-02-20 23:43:13,259 INFO L290 TraceCheckUtils]: 29: Hoare triple {2242#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base|) 0) (exists ((v_ArrVal_244 Int)) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base| v_ArrVal_244) |#valid|)))} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {2242#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base|) 0) (exists ((v_ArrVal_244 Int)) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base| v_ArrVal_244) |#valid|)))} is VALID [2022-02-20 23:43:13,259 INFO L290 TraceCheckUtils]: 30: Hoare triple {2242#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base|) 0) (exists ((v_ArrVal_244 Int)) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base| v_ArrVal_244) |#valid|)))} assume !!(main_~i~0#1 < 1048);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {2242#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base|) 0) (exists ((v_ArrVal_244 Int)) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base| v_ArrVal_244) |#valid|)))} is VALID [2022-02-20 23:43:13,260 INFO L290 TraceCheckUtils]: 31: Hoare triple {2242#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base|) 0) (exists ((v_ArrVal_244 Int)) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base| v_ArrVal_244) |#valid|)))} SUMMARY for call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); srcloc: L14 {2242#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base|) 0) (exists ((v_ArrVal_244 Int)) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base| v_ArrVal_244) |#valid|)))} is VALID [2022-02-20 23:43:13,260 INFO L290 TraceCheckUtils]: 32: Hoare triple {2242#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base|) 0) (exists ((v_ArrVal_244 Int)) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base| v_ArrVal_244) |#valid|)))} havoc main_#t~nondet1#1; {2242#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base|) 0) (exists ((v_ArrVal_244 Int)) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base| v_ArrVal_244) |#valid|)))} is VALID [2022-02-20 23:43:13,261 INFO L290 TraceCheckUtils]: 33: Hoare triple {2242#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base|) 0) (exists ((v_ArrVal_244 Int)) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base| v_ArrVal_244) |#valid|)))} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {2242#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base|) 0) (exists ((v_ArrVal_244 Int)) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base| v_ArrVal_244) |#valid|)))} is VALID [2022-02-20 23:43:13,261 INFO L290 TraceCheckUtils]: 34: Hoare triple {2242#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base|) 0) (exists ((v_ArrVal_244 Int)) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base| v_ArrVal_244) |#valid|)))} assume !!(main_~i~0#1 < 1048);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {2242#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base|) 0) (exists ((v_ArrVal_244 Int)) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base| v_ArrVal_244) |#valid|)))} is VALID [2022-02-20 23:43:13,262 INFO L290 TraceCheckUtils]: 35: Hoare triple {2242#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base|) 0) (exists ((v_ArrVal_244 Int)) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base| v_ArrVal_244) |#valid|)))} SUMMARY for call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); srcloc: L14 {2242#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base|) 0) (exists ((v_ArrVal_244 Int)) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base| v_ArrVal_244) |#valid|)))} is VALID [2022-02-20 23:43:13,263 INFO L290 TraceCheckUtils]: 36: Hoare triple {2242#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base|) 0) (exists ((v_ArrVal_244 Int)) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base| v_ArrVal_244) |#valid|)))} havoc main_#t~nondet1#1; {2242#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base|) 0) (exists ((v_ArrVal_244 Int)) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base| v_ArrVal_244) |#valid|)))} is VALID [2022-02-20 23:43:13,263 INFO L290 TraceCheckUtils]: 37: Hoare triple {2242#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base|) 0) (exists ((v_ArrVal_244 Int)) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base| v_ArrVal_244) |#valid|)))} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {2242#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base|) 0) (exists ((v_ArrVal_244 Int)) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base| v_ArrVal_244) |#valid|)))} is VALID [2022-02-20 23:43:13,264 INFO L290 TraceCheckUtils]: 38: Hoare triple {2242#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base|) 0) (exists ((v_ArrVal_244 Int)) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base| v_ArrVal_244) |#valid|)))} assume !!(main_~i~0#1 < 1048);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {2242#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base|) 0) (exists ((v_ArrVal_244 Int)) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base| v_ArrVal_244) |#valid|)))} is VALID [2022-02-20 23:43:13,264 INFO L290 TraceCheckUtils]: 39: Hoare triple {2242#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base|) 0) (exists ((v_ArrVal_244 Int)) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base| v_ArrVal_244) |#valid|)))} SUMMARY for call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); srcloc: L14 {2242#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base|) 0) (exists ((v_ArrVal_244 Int)) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base| v_ArrVal_244) |#valid|)))} is VALID [2022-02-20 23:43:13,265 INFO L290 TraceCheckUtils]: 40: Hoare triple {2242#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base|) 0) (exists ((v_ArrVal_244 Int)) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base| v_ArrVal_244) |#valid|)))} havoc main_#t~nondet1#1; {2242#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base|) 0) (exists ((v_ArrVal_244 Int)) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base| v_ArrVal_244) |#valid|)))} is VALID [2022-02-20 23:43:13,265 INFO L290 TraceCheckUtils]: 41: Hoare triple {2242#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base|) 0) (exists ((v_ArrVal_244 Int)) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base| v_ArrVal_244) |#valid|)))} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {2242#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base|) 0) (exists ((v_ArrVal_244 Int)) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base| v_ArrVal_244) |#valid|)))} is VALID [2022-02-20 23:43:13,266 INFO L290 TraceCheckUtils]: 42: Hoare triple {2242#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base|) 0) (exists ((v_ArrVal_244 Int)) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base| v_ArrVal_244) |#valid|)))} assume !!(main_~i~0#1 < 1048);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {2242#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base|) 0) (exists ((v_ArrVal_244 Int)) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base| v_ArrVal_244) |#valid|)))} is VALID [2022-02-20 23:43:13,266 INFO L290 TraceCheckUtils]: 43: Hoare triple {2242#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base|) 0) (exists ((v_ArrVal_244 Int)) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base| v_ArrVal_244) |#valid|)))} SUMMARY for call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); srcloc: L14 {2242#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base|) 0) (exists ((v_ArrVal_244 Int)) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base| v_ArrVal_244) |#valid|)))} is VALID [2022-02-20 23:43:13,267 INFO L290 TraceCheckUtils]: 44: Hoare triple {2242#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base|) 0) (exists ((v_ArrVal_244 Int)) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base| v_ArrVal_244) |#valid|)))} havoc main_#t~nondet1#1; {2242#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base|) 0) (exists ((v_ArrVal_244 Int)) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base| v_ArrVal_244) |#valid|)))} is VALID [2022-02-20 23:43:13,267 INFO L290 TraceCheckUtils]: 45: Hoare triple {2242#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base|) 0) (exists ((v_ArrVal_244 Int)) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base| v_ArrVal_244) |#valid|)))} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {2242#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base|) 0) (exists ((v_ArrVal_244 Int)) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base| v_ArrVal_244) |#valid|)))} is VALID [2022-02-20 23:43:13,268 INFO L290 TraceCheckUtils]: 46: Hoare triple {2242#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base|) 0) (exists ((v_ArrVal_244 Int)) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base| v_ArrVal_244) |#valid|)))} assume !!(main_~i~0#1 < 1048);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {2242#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base|) 0) (exists ((v_ArrVal_244 Int)) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base| v_ArrVal_244) |#valid|)))} is VALID [2022-02-20 23:43:13,268 INFO L290 TraceCheckUtils]: 47: Hoare triple {2242#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base|) 0) (exists ((v_ArrVal_244 Int)) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base| v_ArrVal_244) |#valid|)))} SUMMARY for call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); srcloc: L14 {2242#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base|) 0) (exists ((v_ArrVal_244 Int)) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base| v_ArrVal_244) |#valid|)))} is VALID [2022-02-20 23:43:13,269 INFO L290 TraceCheckUtils]: 48: Hoare triple {2242#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base|) 0) (exists ((v_ArrVal_244 Int)) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base| v_ArrVal_244) |#valid|)))} havoc main_#t~nondet1#1; {2242#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base|) 0) (exists ((v_ArrVal_244 Int)) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base| v_ArrVal_244) |#valid|)))} is VALID [2022-02-20 23:43:13,269 INFO L290 TraceCheckUtils]: 49: Hoare triple {2242#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base|) 0) (exists ((v_ArrVal_244 Int)) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base| v_ArrVal_244) |#valid|)))} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {2242#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base|) 0) (exists ((v_ArrVal_244 Int)) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base| v_ArrVal_244) |#valid|)))} is VALID [2022-02-20 23:43:13,270 INFO L290 TraceCheckUtils]: 50: Hoare triple {2242#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base|) 0) (exists ((v_ArrVal_244 Int)) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base| v_ArrVal_244) |#valid|)))} assume !!(main_~i~0#1 < 1048);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {2242#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base|) 0) (exists ((v_ArrVal_244 Int)) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base| v_ArrVal_244) |#valid|)))} is VALID [2022-02-20 23:43:13,271 INFO L290 TraceCheckUtils]: 51: Hoare triple {2242#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base|) 0) (exists ((v_ArrVal_244 Int)) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base| v_ArrVal_244) |#valid|)))} SUMMARY for call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); srcloc: L14 {2242#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base|) 0) (exists ((v_ArrVal_244 Int)) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base| v_ArrVal_244) |#valid|)))} is VALID [2022-02-20 23:43:13,271 INFO L290 TraceCheckUtils]: 52: Hoare triple {2242#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base|) 0) (exists ((v_ArrVal_244 Int)) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base| v_ArrVal_244) |#valid|)))} havoc main_#t~nondet1#1; {2242#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base|) 0) (exists ((v_ArrVal_244 Int)) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base| v_ArrVal_244) |#valid|)))} is VALID [2022-02-20 23:43:13,272 INFO L290 TraceCheckUtils]: 53: Hoare triple {2242#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base|) 0) (exists ((v_ArrVal_244 Int)) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base| v_ArrVal_244) |#valid|)))} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {2242#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base|) 0) (exists ((v_ArrVal_244 Int)) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base| v_ArrVal_244) |#valid|)))} is VALID [2022-02-20 23:43:13,272 INFO L290 TraceCheckUtils]: 54: Hoare triple {2242#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base|) 0) (exists ((v_ArrVal_244 Int)) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base| v_ArrVal_244) |#valid|)))} assume !!(main_~i~0#1 < 1048);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {2242#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base|) 0) (exists ((v_ArrVal_244 Int)) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base| v_ArrVal_244) |#valid|)))} is VALID [2022-02-20 23:43:13,273 INFO L290 TraceCheckUtils]: 55: Hoare triple {2242#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base|) 0) (exists ((v_ArrVal_244 Int)) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base| v_ArrVal_244) |#valid|)))} SUMMARY for call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); srcloc: L14 {2242#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base|) 0) (exists ((v_ArrVal_244 Int)) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base| v_ArrVal_244) |#valid|)))} is VALID [2022-02-20 23:43:13,273 INFO L290 TraceCheckUtils]: 56: Hoare triple {2242#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base|) 0) (exists ((v_ArrVal_244 Int)) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base| v_ArrVal_244) |#valid|)))} havoc main_#t~nondet1#1; {2242#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base|) 0) (exists ((v_ArrVal_244 Int)) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base| v_ArrVal_244) |#valid|)))} is VALID [2022-02-20 23:43:13,274 INFO L290 TraceCheckUtils]: 57: Hoare triple {2242#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base|) 0) (exists ((v_ArrVal_244 Int)) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base| v_ArrVal_244) |#valid|)))} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {2242#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base|) 0) (exists ((v_ArrVal_244 Int)) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base| v_ArrVal_244) |#valid|)))} is VALID [2022-02-20 23:43:13,274 INFO L290 TraceCheckUtils]: 58: Hoare triple {2242#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base|) 0) (exists ((v_ArrVal_244 Int)) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base| v_ArrVal_244) |#valid|)))} assume !!(main_~i~0#1 < 1048);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {2242#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base|) 0) (exists ((v_ArrVal_244 Int)) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base| v_ArrVal_244) |#valid|)))} is VALID [2022-02-20 23:43:13,275 INFO L290 TraceCheckUtils]: 59: Hoare triple {2242#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base|) 0) (exists ((v_ArrVal_244 Int)) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base| v_ArrVal_244) |#valid|)))} SUMMARY for call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); srcloc: L14 {2242#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base|) 0) (exists ((v_ArrVal_244 Int)) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base| v_ArrVal_244) |#valid|)))} is VALID [2022-02-20 23:43:13,275 INFO L290 TraceCheckUtils]: 60: Hoare triple {2242#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base|) 0) (exists ((v_ArrVal_244 Int)) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base| v_ArrVal_244) |#valid|)))} havoc main_#t~nondet1#1; {2242#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base|) 0) (exists ((v_ArrVal_244 Int)) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base| v_ArrVal_244) |#valid|)))} is VALID [2022-02-20 23:43:13,276 INFO L290 TraceCheckUtils]: 61: Hoare triple {2242#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base|) 0) (exists ((v_ArrVal_244 Int)) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base| v_ArrVal_244) |#valid|)))} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {2242#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base|) 0) (exists ((v_ArrVal_244 Int)) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base| v_ArrVal_244) |#valid|)))} is VALID [2022-02-20 23:43:13,276 INFO L290 TraceCheckUtils]: 62: Hoare triple {2242#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base|) 0) (exists ((v_ArrVal_244 Int)) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base| v_ArrVal_244) |#valid|)))} assume !!(main_~i~0#1 < 1048);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {2242#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base|) 0) (exists ((v_ArrVal_244 Int)) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base| v_ArrVal_244) |#valid|)))} is VALID [2022-02-20 23:43:13,277 INFO L290 TraceCheckUtils]: 63: Hoare triple {2242#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base|) 0) (exists ((v_ArrVal_244 Int)) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base| v_ArrVal_244) |#valid|)))} SUMMARY for call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); srcloc: L14 {2242#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base|) 0) (exists ((v_ArrVal_244 Int)) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base| v_ArrVal_244) |#valid|)))} is VALID [2022-02-20 23:43:13,277 INFO L290 TraceCheckUtils]: 64: Hoare triple {2242#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base|) 0) (exists ((v_ArrVal_244 Int)) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base| v_ArrVal_244) |#valid|)))} havoc main_#t~nondet1#1; {2242#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base|) 0) (exists ((v_ArrVal_244 Int)) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base| v_ArrVal_244) |#valid|)))} is VALID [2022-02-20 23:43:13,278 INFO L290 TraceCheckUtils]: 65: Hoare triple {2242#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base|) 0) (exists ((v_ArrVal_244 Int)) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base| v_ArrVal_244) |#valid|)))} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {2242#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base|) 0) (exists ((v_ArrVal_244 Int)) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base| v_ArrVal_244) |#valid|)))} is VALID [2022-02-20 23:43:13,278 INFO L290 TraceCheckUtils]: 66: Hoare triple {2242#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base|) 0) (exists ((v_ArrVal_244 Int)) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base| v_ArrVal_244) |#valid|)))} assume !!(main_~i~0#1 < 1048);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {2242#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base|) 0) (exists ((v_ArrVal_244 Int)) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base| v_ArrVal_244) |#valid|)))} is VALID [2022-02-20 23:43:13,279 INFO L290 TraceCheckUtils]: 67: Hoare triple {2242#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base|) 0) (exists ((v_ArrVal_244 Int)) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base| v_ArrVal_244) |#valid|)))} SUMMARY for call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); srcloc: L14 {2242#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base|) 0) (exists ((v_ArrVal_244 Int)) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base| v_ArrVal_244) |#valid|)))} is VALID [2022-02-20 23:43:13,279 INFO L290 TraceCheckUtils]: 68: Hoare triple {2242#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base|) 0) (exists ((v_ArrVal_244 Int)) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base| v_ArrVal_244) |#valid|)))} havoc main_#t~nondet1#1; {2242#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base|) 0) (exists ((v_ArrVal_244 Int)) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base| v_ArrVal_244) |#valid|)))} is VALID [2022-02-20 23:43:13,280 INFO L290 TraceCheckUtils]: 69: Hoare triple {2242#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base|) 0) (exists ((v_ArrVal_244 Int)) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base| v_ArrVal_244) |#valid|)))} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {2242#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base|) 0) (exists ((v_ArrVal_244 Int)) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base| v_ArrVal_244) |#valid|)))} is VALID [2022-02-20 23:43:13,280 INFO L290 TraceCheckUtils]: 70: Hoare triple {2242#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base|) 0) (exists ((v_ArrVal_244 Int)) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base| v_ArrVal_244) |#valid|)))} assume !!(main_~i~0#1 < 1048);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {2242#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base|) 0) (exists ((v_ArrVal_244 Int)) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base| v_ArrVal_244) |#valid|)))} is VALID [2022-02-20 23:43:13,281 INFO L290 TraceCheckUtils]: 71: Hoare triple {2242#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base|) 0) (exists ((v_ArrVal_244 Int)) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base| v_ArrVal_244) |#valid|)))} SUMMARY for call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); srcloc: L14 {2242#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base|) 0) (exists ((v_ArrVal_244 Int)) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base| v_ArrVal_244) |#valid|)))} is VALID [2022-02-20 23:43:13,282 INFO L290 TraceCheckUtils]: 72: Hoare triple {2242#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base|) 0) (exists ((v_ArrVal_244 Int)) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base| v_ArrVal_244) |#valid|)))} havoc main_#t~nondet1#1; {2242#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base|) 0) (exists ((v_ArrVal_244 Int)) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base| v_ArrVal_244) |#valid|)))} is VALID [2022-02-20 23:43:13,282 INFO L290 TraceCheckUtils]: 73: Hoare triple {2242#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base|) 0) (exists ((v_ArrVal_244 Int)) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base| v_ArrVal_244) |#valid|)))} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {2242#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base|) 0) (exists ((v_ArrVal_244 Int)) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base| v_ArrVal_244) |#valid|)))} is VALID [2022-02-20 23:43:13,283 INFO L290 TraceCheckUtils]: 74: Hoare triple {2242#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base|) 0) (exists ((v_ArrVal_244 Int)) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base| v_ArrVal_244) |#valid|)))} assume !!(main_~i~0#1 < 1048);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {2242#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base|) 0) (exists ((v_ArrVal_244 Int)) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base| v_ArrVal_244) |#valid|)))} is VALID [2022-02-20 23:43:13,283 INFO L290 TraceCheckUtils]: 75: Hoare triple {2242#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base|) 0) (exists ((v_ArrVal_244 Int)) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base| v_ArrVal_244) |#valid|)))} SUMMARY for call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); srcloc: L14 {2242#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base|) 0) (exists ((v_ArrVal_244 Int)) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base| v_ArrVal_244) |#valid|)))} is VALID [2022-02-20 23:43:13,284 INFO L290 TraceCheckUtils]: 76: Hoare triple {2242#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base|) 0) (exists ((v_ArrVal_244 Int)) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base| v_ArrVal_244) |#valid|)))} havoc main_#t~nondet1#1; {2242#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base|) 0) (exists ((v_ArrVal_244 Int)) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base| v_ArrVal_244) |#valid|)))} is VALID [2022-02-20 23:43:13,284 INFO L290 TraceCheckUtils]: 77: Hoare triple {2242#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base|) 0) (exists ((v_ArrVal_244 Int)) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base| v_ArrVal_244) |#valid|)))} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {2242#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base|) 0) (exists ((v_ArrVal_244 Int)) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base| v_ArrVal_244) |#valid|)))} is VALID [2022-02-20 23:43:13,285 INFO L290 TraceCheckUtils]: 78: Hoare triple {2242#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base|) 0) (exists ((v_ArrVal_244 Int)) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base| v_ArrVal_244) |#valid|)))} assume !!(main_~i~0#1 < 1048);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {2242#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base|) 0) (exists ((v_ArrVal_244 Int)) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base| v_ArrVal_244) |#valid|)))} is VALID [2022-02-20 23:43:13,285 INFO L290 TraceCheckUtils]: 79: Hoare triple {2242#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base|) 0) (exists ((v_ArrVal_244 Int)) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base| v_ArrVal_244) |#valid|)))} SUMMARY for call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); srcloc: L14 {2242#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base|) 0) (exists ((v_ArrVal_244 Int)) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base| v_ArrVal_244) |#valid|)))} is VALID [2022-02-20 23:43:13,286 INFO L290 TraceCheckUtils]: 80: Hoare triple {2242#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base|) 0) (exists ((v_ArrVal_244 Int)) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base| v_ArrVal_244) |#valid|)))} havoc main_#t~nondet1#1; {2242#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base|) 0) (exists ((v_ArrVal_244 Int)) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base| v_ArrVal_244) |#valid|)))} is VALID [2022-02-20 23:43:13,286 INFO L290 TraceCheckUtils]: 81: Hoare triple {2242#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base|) 0) (exists ((v_ArrVal_244 Int)) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base| v_ArrVal_244) |#valid|)))} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {2242#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base|) 0) (exists ((v_ArrVal_244 Int)) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base| v_ArrVal_244) |#valid|)))} is VALID [2022-02-20 23:43:13,287 INFO L290 TraceCheckUtils]: 82: Hoare triple {2242#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base|) 0) (exists ((v_ArrVal_244 Int)) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base| v_ArrVal_244) |#valid|)))} assume !!(main_~i~0#1 < 1048);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {2242#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base|) 0) (exists ((v_ArrVal_244 Int)) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base| v_ArrVal_244) |#valid|)))} is VALID [2022-02-20 23:43:13,287 INFO L290 TraceCheckUtils]: 83: Hoare triple {2242#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base|) 0) (exists ((v_ArrVal_244 Int)) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base| v_ArrVal_244) |#valid|)))} SUMMARY for call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); srcloc: L14 {2242#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base|) 0) (exists ((v_ArrVal_244 Int)) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base| v_ArrVal_244) |#valid|)))} is VALID [2022-02-20 23:43:13,288 INFO L290 TraceCheckUtils]: 84: Hoare triple {2242#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base|) 0) (exists ((v_ArrVal_244 Int)) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base| v_ArrVal_244) |#valid|)))} havoc main_#t~nondet1#1; {2242#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base|) 0) (exists ((v_ArrVal_244 Int)) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base| v_ArrVal_244) |#valid|)))} is VALID [2022-02-20 23:43:13,289 INFO L290 TraceCheckUtils]: 85: Hoare triple {2242#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base|) 0) (exists ((v_ArrVal_244 Int)) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base| v_ArrVal_244) |#valid|)))} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {2242#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base|) 0) (exists ((v_ArrVal_244 Int)) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base| v_ArrVal_244) |#valid|)))} is VALID [2022-02-20 23:43:13,289 INFO L290 TraceCheckUtils]: 86: Hoare triple {2242#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base|) 0) (exists ((v_ArrVal_244 Int)) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base| v_ArrVal_244) |#valid|)))} assume !!(main_~i~0#1 < 1048);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {2242#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base|) 0) (exists ((v_ArrVal_244 Int)) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base| v_ArrVal_244) |#valid|)))} is VALID [2022-02-20 23:43:13,290 INFO L290 TraceCheckUtils]: 87: Hoare triple {2242#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base|) 0) (exists ((v_ArrVal_244 Int)) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base| v_ArrVal_244) |#valid|)))} SUMMARY for call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); srcloc: L14 {2242#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base|) 0) (exists ((v_ArrVal_244 Int)) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base| v_ArrVal_244) |#valid|)))} is VALID [2022-02-20 23:43:13,290 INFO L290 TraceCheckUtils]: 88: Hoare triple {2242#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base|) 0) (exists ((v_ArrVal_244 Int)) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base| v_ArrVal_244) |#valid|)))} havoc main_#t~nondet1#1; {2242#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base|) 0) (exists ((v_ArrVal_244 Int)) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base| v_ArrVal_244) |#valid|)))} is VALID [2022-02-20 23:43:13,291 INFO L290 TraceCheckUtils]: 89: Hoare triple {2242#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base|) 0) (exists ((v_ArrVal_244 Int)) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base| v_ArrVal_244) |#valid|)))} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {2242#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base|) 0) (exists ((v_ArrVal_244 Int)) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base| v_ArrVal_244) |#valid|)))} is VALID [2022-02-20 23:43:13,291 INFO L290 TraceCheckUtils]: 90: Hoare triple {2242#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base|) 0) (exists ((v_ArrVal_244 Int)) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base| v_ArrVal_244) |#valid|)))} assume !(main_~i~0#1 < 1048); {2242#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base|) 0) (exists ((v_ArrVal_244 Int)) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base| v_ArrVal_244) |#valid|)))} is VALID [2022-02-20 23:43:13,292 INFO L290 TraceCheckUtils]: 91: Hoare triple {2242#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base|) 0) (exists ((v_ArrVal_244 Int)) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base| v_ArrVal_244) |#valid|)))} SUMMARY for call main_#t~mem2#1 := read~int(main_~#a~0#1.base, 12 + main_~#a~0#1.offset, 4); srcloc: L17-2 {2242#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base|) 0) (exists ((v_ArrVal_244 Int)) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base| v_ArrVal_244) |#valid|)))} is VALID [2022-02-20 23:43:13,292 INFO L290 TraceCheckUtils]: 92: Hoare triple {2242#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base|) 0) (exists ((v_ArrVal_244 Int)) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base| v_ArrVal_244) |#valid|)))} assume !!(main_#t~mem2#1 >= 0);havoc main_#t~mem2#1; {2242#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base|) 0) (exists ((v_ArrVal_244 Int)) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base| v_ArrVal_244) |#valid|)))} is VALID [2022-02-20 23:43:13,293 INFO L290 TraceCheckUtils]: 93: Hoare triple {2242#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base|) 0) (exists ((v_ArrVal_244 Int)) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base| v_ArrVal_244) |#valid|)))} SUMMARY for call main_#t~mem3#1 := read~int(main_~#a~0#1.base, 12 + main_~#a~0#1.offset, 4); srcloc: L18 {2242#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base|) 0) (exists ((v_ArrVal_244 Int)) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base| v_ArrVal_244) |#valid|)))} is VALID [2022-02-20 23:43:13,294 INFO L290 TraceCheckUtils]: 94: Hoare triple {2242#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base|) 0) (exists ((v_ArrVal_244 Int)) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base| v_ArrVal_244) |#valid|)))} SUMMARY for call write~int(main_#t~mem3#1 - 1, main_~#a~0#1.base, 12 + main_~#a~0#1.offset, 4); srcloc: L18-1 {2242#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base|) 0) (exists ((v_ArrVal_244 Int)) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base| v_ArrVal_244) |#valid|)))} is VALID [2022-02-20 23:43:13,294 INFO L290 TraceCheckUtils]: 95: Hoare triple {2242#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base|) 0) (exists ((v_ArrVal_244 Int)) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base| v_ArrVal_244) |#valid|)))} havoc main_#t~mem3#1; {2242#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base|) 0) (exists ((v_ArrVal_244 Int)) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base| v_ArrVal_244) |#valid|)))} is VALID [2022-02-20 23:43:13,295 INFO L290 TraceCheckUtils]: 96: Hoare triple {2242#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base|) 0) (exists ((v_ArrVal_244 Int)) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base| v_ArrVal_244) |#valid|)))} SUMMARY for call main_#t~mem2#1 := read~int(main_~#a~0#1.base, 12 + main_~#a~0#1.offset, 4); srcloc: L17-2 {2242#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base|) 0) (exists ((v_ArrVal_244 Int)) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base| v_ArrVal_244) |#valid|)))} is VALID [2022-02-20 23:43:13,295 INFO L290 TraceCheckUtils]: 97: Hoare triple {2242#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base|) 0) (exists ((v_ArrVal_244 Int)) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base| v_ArrVal_244) |#valid|)))} assume !(main_#t~mem2#1 >= 0);havoc main_#t~mem2#1; {2242#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base|) 0) (exists ((v_ArrVal_244 Int)) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base| v_ArrVal_244) |#valid|)))} is VALID [2022-02-20 23:43:13,296 INFO L290 TraceCheckUtils]: 98: Hoare triple {2242#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base|) 0) (exists ((v_ArrVal_244 Int)) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#a~0#1.base| v_ArrVal_244) |#valid|)))} main_#res#1 := 0;call ULTIMATE.dealloc(main_~#a~0#1.base, main_~#a~0#1.offset);havoc main_~#a~0#1.base, main_~#a~0#1.offset; {2534#(exists ((|v_ULTIMATE.start_main_~#a~0#1.base_24| Int)) (and (= (select |ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#a~0#1.base_24|) 0) (= (store |ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#a~0#1.base_24| 0) |#valid|)))} is VALID [2022-02-20 23:43:13,296 INFO L290 TraceCheckUtils]: 99: Hoare triple {2534#(exists ((|v_ULTIMATE.start_main_~#a~0#1.base_24| Int)) (and (= (select |ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#a~0#1.base_24|) 0) (= (store |ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#a~0#1.base_24| 0) |#valid|)))} assume !(#valid == main_old_#valid#1); {2212#false} is VALID [2022-02-20 23:43:13,297 INFO L134 CoverageAnalysis]: Checked inductivity of 948 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 948 trivial. 0 not checked. [2022-02-20 23:43:13,297 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:43:13,297 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2029696798] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:43:13,297 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-20 23:43:13,297 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [25] total 27 [2022-02-20 23:43:13,298 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198486649] [2022-02-20 23:43:13,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:43:13,298 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 100 [2022-02-20 23:43:13,298 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:43:13,298 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:13,310 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:43:13,310 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 23:43:13,311 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:43:13,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 23:43:13,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=304, Invalid=398, Unknown=0, NotChecked=0, Total=702 [2022-02-20 23:43:13,311 INFO L87 Difference]: Start difference. First operand 101 states and 102 transitions. Second operand has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:13,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:43:13,320 INFO L93 Difference]: Finished difference Result 100 states and 101 transitions. [2022-02-20 23:43:13,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 23:43:13,321 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 100 [2022-02-20 23:43:13,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:43:13,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:13,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2022-02-20 23:43:13,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:13,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2022-02-20 23:43:13,322 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 15 transitions. [2022-02-20 23:43:13,333 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:43:13,333 INFO L225 Difference]: With dead ends: 100 [2022-02-20 23:43:13,333 INFO L226 Difference]: Without dead ends: 0 [2022-02-20 23:43:13,334 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=304, Invalid=398, Unknown=0, NotChecked=0, Total=702 [2022-02-20 23:43:13,334 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 0 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 8 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:43:13,334 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 16 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 8 Unchecked, 0.0s Time] [2022-02-20 23:43:13,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-02-20 23:43:13,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-02-20 23:43:13,335 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:43:13,335 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:13,335 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:13,335 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:13,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:43:13,336 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-20 23:43:13,336 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 23:43:13,336 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:43:13,336 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:43:13,336 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-02-20 23:43:13,336 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-02-20 23:43:13,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:43:13,336 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-20 23:43:13,336 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 23:43:13,337 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:43:13,337 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:43:13,337 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:43:13,337 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:43:13,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:13,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-02-20 23:43:13,337 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 100 [2022-02-20 23:43:13,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:43:13,337 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-20 23:43:13,338 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:13,338 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 23:43:13,338 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:43:13,340 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0REQUIRES_VIOLATION (8 of 9 remaining) [2022-02-20 23:43:13,340 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATION (7 of 9 remaining) [2022-02-20 23:43:13,340 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATION (6 of 9 remaining) [2022-02-20 23:43:13,340 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATION (5 of 9 remaining) [2022-02-20 23:43:13,340 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATION (4 of 9 remaining) [2022-02-20 23:43:13,340 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATION (3 of 9 remaining) [2022-02-20 23:43:13,341 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6REQUIRES_VIOLATION (2 of 9 remaining) [2022-02-20 23:43:13,341 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7REQUIRES_VIOLATION (1 of 9 remaining) [2022-02-20 23:43:13,341 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (0 of 9 remaining) [2022-02-20 23:43:13,368 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:43:13,556 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:43:13,559 INFO L732 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1] [2022-02-20 23:43:13,560 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 23:43:13,561 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.02 11:43:13 BoogieIcfgContainer [2022-02-20 23:43:13,561 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-20 23:43:13,562 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-20 23:43:13,562 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-20 23:43:13,562 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-20 23:43:13,563 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:43:06" (3/4) ... [2022-02-20 23:43:13,564 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-02-20 23:43:13,569 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2022-02-20 23:43:13,570 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2022-02-20 23:43:13,570 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-02-20 23:43:13,570 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-02-20 23:43:13,602 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-02-20 23:43:13,602 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-20 23:43:13,603 INFO L158 Benchmark]: Toolchain (without parser) took 7150.64ms. Allocated memory was 138.4MB in the beginning and 174.1MB in the end (delta: 35.7MB). Free memory was 105.4MB in the beginning and 62.5MB in the end (delta: 42.9MB). Peak memory consumption was 77.3MB. Max. memory is 16.1GB. [2022-02-20 23:43:13,603 INFO L158 Benchmark]: CDTParser took 0.57ms. Allocated memory is still 86.0MB. Free memory was 58.8MB in the beginning and 58.8MB in the end (delta: 30.3kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 23:43:13,603 INFO L158 Benchmark]: CACSL2BoogieTranslator took 190.46ms. Allocated memory is still 138.4MB. Free memory was 105.1MB in the beginning and 115.6MB in the end (delta: -10.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-20 23:43:13,603 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.37ms. Allocated memory is still 138.4MB. Free memory was 115.6MB in the beginning and 113.7MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 23:43:13,603 INFO L158 Benchmark]: Boogie Preprocessor took 28.75ms. Allocated memory is still 138.4MB. Free memory was 113.7MB in the beginning and 112.4MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 23:43:13,604 INFO L158 Benchmark]: RCFGBuilder took 262.10ms. Allocated memory is still 138.4MB. Free memory was 112.4MB in the beginning and 101.1MB in the end (delta: 11.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-02-20 23:43:13,604 INFO L158 Benchmark]: TraceAbstraction took 6599.07ms. Allocated memory was 138.4MB in the beginning and 174.1MB in the end (delta: 35.7MB). Free memory was 100.6MB in the beginning and 65.3MB in the end (delta: 35.2MB). Peak memory consumption was 71.6MB. Max. memory is 16.1GB. [2022-02-20 23:43:13,604 INFO L158 Benchmark]: Witness Printer took 39.91ms. Allocated memory is still 174.1MB. Free memory was 65.3MB in the beginning and 62.5MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 23:43:13,605 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.57ms. Allocated memory is still 86.0MB. Free memory was 58.8MB in the beginning and 58.8MB in the end (delta: 30.3kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 190.46ms. Allocated memory is still 138.4MB. Free memory was 105.1MB in the beginning and 115.6MB in the end (delta: -10.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 25.37ms. Allocated memory is still 138.4MB. Free memory was 115.6MB in the beginning and 113.7MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 28.75ms. Allocated memory is still 138.4MB. Free memory was 113.7MB in the beginning and 112.4MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 262.10ms. Allocated memory is still 138.4MB. Free memory was 112.4MB in the beginning and 101.1MB in the end (delta: 11.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 6599.07ms. Allocated memory was 138.4MB in the beginning and 174.1MB in the end (delta: 35.7MB). Free memory was 100.6MB in the beginning and 65.3MB in the end (delta: 35.2MB). Peak memory consumption was 71.6MB. Max. memory is 16.1GB. * Witness Printer took 39.91ms. Allocated memory is still 174.1MB. Free memory was 65.3MB in the beginning and 62.5MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 14]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 14]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 17]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 17]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 18]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 18]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 18]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 18]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 10]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 24 locations, 9 error locations. Started 1 CEGAR loops. OverallTime: 6.6s, OverallIterations: 10, TraceHistogramMax: 22, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 159 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 159 mSDsluCounter, 337 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 19 IncrementalHoareTripleChecker+Unchecked, 200 mSDsCounter, 43 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 224 IncrementalHoareTripleChecker+Invalid, 286 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 43 mSolverCounterUnsat, 137 mSDtfsCounter, 224 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 396 GetRequests, 307 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=101occurred in iteration=9, InterpolantAutomatonStates: 68, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 10 MinimizatonAttempts, 10 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 3.1s InterpolantComputationTime, 492 NumberOfCodeBlocks, 359 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 563 ConstructedInterpolants, 143 QuantifiedInterpolants, 3210 SizeOfPredicates, 0 NumberOfNonLiveVariables, 452 ConjunctsInSsa, 46 ConjunctsInUnsatCore, 20 InterpolantComputations, 6 PerfectInterpolantSequences, 1146/2945 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 9 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-02-20 23:43:13,635 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE