./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety-ext3/getNumbers1-1.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 8bd4bc60 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/memsafety-ext3/getNumbers1-1.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1b1751fe95f9cf655681429038c1cde9e9c074e8 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-deref) --- Real Ultimate output --- This is Ultimate 0.1.25-8bd4bc6 [2020-07-29 01:17:18,263 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-29 01:17:18,266 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-29 01:17:18,278 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-29 01:17:18,279 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-29 01:17:18,280 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-29 01:17:18,281 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-29 01:17:18,283 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-29 01:17:18,285 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-29 01:17:18,286 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-29 01:17:18,287 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-29 01:17:18,288 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-29 01:17:18,289 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-29 01:17:18,290 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-29 01:17:18,291 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-29 01:17:18,292 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-29 01:17:18,293 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-29 01:17:18,294 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-29 01:17:18,296 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-29 01:17:18,298 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-29 01:17:18,300 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-29 01:17:18,302 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-29 01:17:18,303 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-29 01:17:18,304 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-29 01:17:18,308 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-29 01:17:18,308 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-29 01:17:18,308 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-29 01:17:18,309 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-29 01:17:18,310 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-29 01:17:18,311 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-29 01:17:18,311 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-29 01:17:18,312 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-29 01:17:18,313 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-29 01:17:18,314 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-29 01:17:18,316 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-29 01:17:18,316 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-29 01:17:18,317 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-29 01:17:18,317 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-29 01:17:18,317 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-29 01:17:18,318 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-29 01:17:18,319 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-29 01:17:18,320 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2020-07-29 01:17:18,336 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-29 01:17:18,337 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-29 01:17:18,338 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-29 01:17:18,338 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-29 01:17:18,338 INFO L138 SettingsManager]: * Use SBE=true [2020-07-29 01:17:18,339 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-29 01:17:18,339 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-29 01:17:18,339 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-29 01:17:18,339 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-29 01:17:18,339 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-29 01:17:18,340 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-29 01:17:18,340 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2020-07-29 01:17:18,340 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2020-07-29 01:17:18,340 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2020-07-29 01:17:18,340 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-29 01:17:18,341 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2020-07-29 01:17:18,341 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-29 01:17:18,341 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-29 01:17:18,341 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-29 01:17:18,342 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-29 01:17:18,342 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-29 01:17:18,342 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-29 01:17:18,342 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-29 01:17:18,343 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-29 01:17:18,343 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-29 01:17:18,343 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-29 01:17:18,343 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-29 01:17:18,343 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-29 01:17:18,344 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1b1751fe95f9cf655681429038c1cde9e9c074e8 [2020-07-29 01:17:18,705 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-29 01:17:18,718 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-29 01:17:18,721 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-29 01:17:18,722 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-29 01:17:18,722 INFO L275 PluginConnector]: CDTParser initialized [2020-07-29 01:17:18,723 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety-ext3/getNumbers1-1.c [2020-07-29 01:17:18,778 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/77b46384f/697725f048034b7682fd41a0c3ea9b9a/FLAGb65901a33 [2020-07-29 01:17:19,192 INFO L306 CDTParser]: Found 1 translation units. [2020-07-29 01:17:19,193 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext3/getNumbers1-1.c [2020-07-29 01:17:19,200 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/77b46384f/697725f048034b7682fd41a0c3ea9b9a/FLAGb65901a33 [2020-07-29 01:17:19,625 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/77b46384f/697725f048034b7682fd41a0c3ea9b9a [2020-07-29 01:17:19,629 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-29 01:17:19,633 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-07-29 01:17:19,634 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-29 01:17:19,634 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-29 01:17:19,638 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-29 01:17:19,640 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 01:17:19" (1/1) ... [2020-07-29 01:17:19,643 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f71a05d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:17:19, skipping insertion in model container [2020-07-29 01:17:19,643 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 01:17:19" (1/1) ... [2020-07-29 01:17:19,651 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-29 01:17:19,670 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-29 01:17:19,845 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 01:17:19,859 INFO L203 MainTranslator]: Completed pre-run [2020-07-29 01:17:19,879 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 01:17:19,898 INFO L208 MainTranslator]: Completed translation [2020-07-29 01:17:19,898 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:17:19 WrapperNode [2020-07-29 01:17:19,898 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-29 01:17:19,899 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-29 01:17:19,899 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-29 01:17:19,899 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-29 01:17:19,976 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:17:19" (1/1) ... [2020-07-29 01:17:19,976 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:17:19" (1/1) ... [2020-07-29 01:17:19,986 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:17:19" (1/1) ... [2020-07-29 01:17:19,988 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:17:19" (1/1) ... [2020-07-29 01:17:20,015 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:17:19" (1/1) ... [2020-07-29 01:17:20,025 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:17:19" (1/1) ... [2020-07-29 01:17:20,028 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:17:19" (1/1) ... [2020-07-29 01:17:20,038 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-29 01:17:20,038 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-29 01:17:20,039 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-29 01:17:20,039 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-29 01:17:20,040 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:17:19" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-29 01:17:20,134 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-29 01:17:20,134 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-29 01:17:20,135 INFO L138 BoogieDeclarations]: Found implementation of procedure getNumbers [2020-07-29 01:17:20,135 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-29 01:17:20,135 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2020-07-29 01:17:20,135 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2020-07-29 01:17:20,136 INFO L130 BoogieDeclarations]: Found specification of procedure getNumbers [2020-07-29 01:17:20,136 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-29 01:17:20,136 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-29 01:17:20,136 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-29 01:17:20,136 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-29 01:17:20,137 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-29 01:17:20,137 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-29 01:17:20,137 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-07-29 01:17:20,137 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-29 01:17:20,583 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-29 01:17:20,584 INFO L295 CfgBuilder]: Removed 2 assume(true) statements. [2020-07-29 01:17:20,587 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:17:20 BoogieIcfgContainer [2020-07-29 01:17:20,588 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-29 01:17:20,592 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-29 01:17:20,593 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-29 01:17:20,596 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-29 01:17:20,596 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.07 01:17:19" (1/3) ... [2020-07-29 01:17:20,597 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77a1582 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.07 01:17:20, skipping insertion in model container [2020-07-29 01:17:20,598 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:17:19" (2/3) ... [2020-07-29 01:17:20,598 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77a1582 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.07 01:17:20, skipping insertion in model container [2020-07-29 01:17:20,599 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:17:20" (3/3) ... [2020-07-29 01:17:20,601 INFO L109 eAbstractionObserver]: Analyzing ICFG getNumbers1-1.c [2020-07-29 01:17:20,611 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-29 01:17:20,619 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2020-07-29 01:17:20,634 INFO L251 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2020-07-29 01:17:20,655 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-29 01:17:20,656 INFO L376 AbstractCegarLoop]: Hoare is false [2020-07-29 01:17:20,656 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-29 01:17:20,656 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-29 01:17:20,656 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-29 01:17:20,656 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-29 01:17:20,657 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-29 01:17:20,657 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-29 01:17:20,673 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states. [2020-07-29 01:17:20,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-07-29 01:17:20,683 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:17:20,684 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:17:20,685 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2020-07-29 01:17:20,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:17:20,692 INFO L82 PathProgramCache]: Analyzing trace with hash 543879226, now seen corresponding path program 1 times [2020-07-29 01:17:20,704 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:17:20,704 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589093129] [2020-07-29 01:17:20,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:17:20,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:17:20,963 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-07-29 01:17:20,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:17:20,986 INFO L280 TraceCheckUtils]: 0: Hoare triple {37#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |#t~string5.offset| |old(#t~string5.offset)|) (= |old(#length)| |#length|) (= |#t~string5.base| |old(#t~string5.base)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(4);call write~init~int(37, #t~string5.base, #t~string5.offset, 1);call write~init~int(100, #t~string5.base, 1 + #t~string5.offset, 1);call write~init~int(10, #t~string5.base, 2 + #t~string5.offset, 1);call write~init~int(0, #t~string5.base, 3 + #t~string5.offset, 1); {31#true} is VALID [2020-07-29 01:17:20,987 INFO L280 TraceCheckUtils]: 1: Hoare triple {31#true} assume true; {31#true} is VALID [2020-07-29 01:17:20,987 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {31#true} {31#true} #47#return; {31#true} is VALID [2020-07-29 01:17:20,991 INFO L263 TraceCheckUtils]: 0: Hoare triple {31#true} call ULTIMATE.init(); {37#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |#t~string5.offset| |old(#t~string5.offset)|) (= |old(#length)| |#length|) (= |#t~string5.base| |old(#t~string5.base)|))} is VALID [2020-07-29 01:17:20,992 INFO L280 TraceCheckUtils]: 1: Hoare triple {37#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |#t~string5.offset| |old(#t~string5.offset)|) (= |old(#length)| |#length|) (= |#t~string5.base| |old(#t~string5.base)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(4);call write~init~int(37, #t~string5.base, #t~string5.offset, 1);call write~init~int(100, #t~string5.base, 1 + #t~string5.offset, 1);call write~init~int(10, #t~string5.base, 2 + #t~string5.offset, 1);call write~init~int(0, #t~string5.base, 3 + #t~string5.offset, 1); {31#true} is VALID [2020-07-29 01:17:20,992 INFO L280 TraceCheckUtils]: 2: Hoare triple {31#true} assume true; {31#true} is VALID [2020-07-29 01:17:20,993 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {31#true} {31#true} #47#return; {31#true} is VALID [2020-07-29 01:17:20,993 INFO L263 TraceCheckUtils]: 4: Hoare triple {31#true} call #t~ret7 := main(); {31#true} is VALID [2020-07-29 01:17:20,993 INFO L263 TraceCheckUtils]: 5: Hoare triple {31#true} call #t~ret2.base, #t~ret2.offset := getNumbers(); {31#true} is VALID [2020-07-29 01:17:20,996 INFO L280 TraceCheckUtils]: 6: Hoare triple {31#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnStack(40);~array~0.base, ~array~0.offset := #t~malloc0.base, #t~malloc0.offset;~i~0 := 0; {36#(= 1 (select |#valid| getNumbers_~array~0.base))} is VALID [2020-07-29 01:17:20,997 INFO L280 TraceCheckUtils]: 7: Hoare triple {36#(= 1 (select |#valid| getNumbers_~array~0.base))} assume !!(~i~0 < 10); {36#(= 1 (select |#valid| getNumbers_~array~0.base))} is VALID [2020-07-29 01:17:20,999 INFO L280 TraceCheckUtils]: 8: Hoare triple {36#(= 1 (select |#valid| getNumbers_~array~0.base))} assume !(1 == #valid[~array~0.base]); {32#false} is VALID [2020-07-29 01:17:21,000 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:17:21,002 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589093129] [2020-07-29 01:17:21,003 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:17:21,003 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-29 01:17:21,005 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015509366] [2020-07-29 01:17:21,012 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2020-07-29 01:17:21,015 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:17:21,019 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 01:17:21,042 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:17:21,042 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-29 01:17:21,043 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:17:21,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-29 01:17:21,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-29 01:17:21,057 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 4 states. [2020-07-29 01:17:21,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:17:21,260 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2020-07-29 01:17:21,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-29 01:17:21,260 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2020-07-29 01:17:21,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:17:21,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 01:17:21,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 31 transitions. [2020-07-29 01:17:21,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 01:17:21,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 31 transitions. [2020-07-29 01:17:21,280 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 31 transitions. [2020-07-29 01:17:21,336 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:17:21,348 INFO L225 Difference]: With dead ends: 27 [2020-07-29 01:17:21,348 INFO L226 Difference]: Without dead ends: 24 [2020-07-29 01:17:21,350 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-29 01:17:21,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2020-07-29 01:17:21,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2020-07-29 01:17:21,383 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:17:21,384 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand 24 states. [2020-07-29 01:17:21,385 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 24 states. [2020-07-29 01:17:21,385 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 24 states. [2020-07-29 01:17:21,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:17:21,389 INFO L93 Difference]: Finished difference Result 24 states and 25 transitions. [2020-07-29 01:17:21,390 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2020-07-29 01:17:21,390 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:17:21,390 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:17:21,390 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 24 states. [2020-07-29 01:17:21,391 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 24 states. [2020-07-29 01:17:21,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:17:21,395 INFO L93 Difference]: Finished difference Result 24 states and 25 transitions. [2020-07-29 01:17:21,395 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2020-07-29 01:17:21,396 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:17:21,396 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:17:21,396 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:17:21,396 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:17:21,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2020-07-29 01:17:21,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2020-07-29 01:17:21,401 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 9 [2020-07-29 01:17:21,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:17:21,401 INFO L479 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2020-07-29 01:17:21,402 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-29 01:17:21,402 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2020-07-29 01:17:21,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-07-29 01:17:21,402 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:17:21,403 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:17:21,403 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-29 01:17:21,403 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2020-07-29 01:17:21,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:17:21,404 INFO L82 PathProgramCache]: Analyzing trace with hash 543879227, now seen corresponding path program 1 times [2020-07-29 01:17:21,404 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:17:21,404 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115606644] [2020-07-29 01:17:21,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:17:21,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:17:21,516 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-07-29 01:17:21,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:17:21,534 INFO L280 TraceCheckUtils]: 0: Hoare triple {145#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |#t~string5.offset| |old(#t~string5.offset)|) (= |old(#length)| |#length|) (= |#t~string5.base| |old(#t~string5.base)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(4);call write~init~int(37, #t~string5.base, #t~string5.offset, 1);call write~init~int(100, #t~string5.base, 1 + #t~string5.offset, 1);call write~init~int(10, #t~string5.base, 2 + #t~string5.offset, 1);call write~init~int(0, #t~string5.base, 3 + #t~string5.offset, 1); {139#true} is VALID [2020-07-29 01:17:21,534 INFO L280 TraceCheckUtils]: 1: Hoare triple {139#true} assume true; {139#true} is VALID [2020-07-29 01:17:21,535 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {139#true} {139#true} #47#return; {139#true} is VALID [2020-07-29 01:17:21,537 INFO L263 TraceCheckUtils]: 0: Hoare triple {139#true} call ULTIMATE.init(); {145#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |#t~string5.offset| |old(#t~string5.offset)|) (= |old(#length)| |#length|) (= |#t~string5.base| |old(#t~string5.base)|))} is VALID [2020-07-29 01:17:21,537 INFO L280 TraceCheckUtils]: 1: Hoare triple {145#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |#t~string5.offset| |old(#t~string5.offset)|) (= |old(#length)| |#length|) (= |#t~string5.base| |old(#t~string5.base)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(4);call write~init~int(37, #t~string5.base, #t~string5.offset, 1);call write~init~int(100, #t~string5.base, 1 + #t~string5.offset, 1);call write~init~int(10, #t~string5.base, 2 + #t~string5.offset, 1);call write~init~int(0, #t~string5.base, 3 + #t~string5.offset, 1); {139#true} is VALID [2020-07-29 01:17:21,538 INFO L280 TraceCheckUtils]: 2: Hoare triple {139#true} assume true; {139#true} is VALID [2020-07-29 01:17:21,538 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {139#true} {139#true} #47#return; {139#true} is VALID [2020-07-29 01:17:21,538 INFO L263 TraceCheckUtils]: 4: Hoare triple {139#true} call #t~ret7 := main(); {139#true} is VALID [2020-07-29 01:17:21,539 INFO L263 TraceCheckUtils]: 5: Hoare triple {139#true} call #t~ret2.base, #t~ret2.offset := getNumbers(); {139#true} is VALID [2020-07-29 01:17:21,541 INFO L280 TraceCheckUtils]: 6: Hoare triple {139#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnStack(40);~array~0.base, ~array~0.offset := #t~malloc0.base, #t~malloc0.offset;~i~0 := 0; {144#(and (= 40 (select |#length| getNumbers_~array~0.base)) (= 0 getNumbers_~array~0.offset) (= 0 getNumbers_~i~0))} is VALID [2020-07-29 01:17:21,542 INFO L280 TraceCheckUtils]: 7: Hoare triple {144#(and (= 40 (select |#length| getNumbers_~array~0.base)) (= 0 getNumbers_~array~0.offset) (= 0 getNumbers_~i~0))} assume !!(~i~0 < 10); {144#(and (= 40 (select |#length| getNumbers_~array~0.base)) (= 0 getNumbers_~array~0.offset) (= 0 getNumbers_~i~0))} is VALID [2020-07-29 01:17:21,544 INFO L280 TraceCheckUtils]: 8: Hoare triple {144#(and (= 40 (select |#length| getNumbers_~array~0.base)) (= 0 getNumbers_~array~0.offset) (= 0 getNumbers_~i~0))} assume !(4 + (~array~0.offset + 4 * ~i~0) <= #length[~array~0.base] && 0 <= ~array~0.offset + 4 * ~i~0); {140#false} is VALID [2020-07-29 01:17:21,545 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:17:21,546 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115606644] [2020-07-29 01:17:21,546 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:17:21,546 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-29 01:17:21,547 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934804479] [2020-07-29 01:17:21,548 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2020-07-29 01:17:21,549 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:17:21,549 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 01:17:21,568 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:17:21,568 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-29 01:17:21,569 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:17:21,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-29 01:17:21,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-29 01:17:21,570 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand 4 states. [2020-07-29 01:17:21,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:17:21,744 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2020-07-29 01:17:21,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-29 01:17:21,744 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2020-07-29 01:17:21,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:17:21,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 01:17:21,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 30 transitions. [2020-07-29 01:17:21,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 01:17:21,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 30 transitions. [2020-07-29 01:17:21,751 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 30 transitions. [2020-07-29 01:17:21,801 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:17:21,803 INFO L225 Difference]: With dead ends: 27 [2020-07-29 01:17:21,803 INFO L226 Difference]: Without dead ends: 27 [2020-07-29 01:17:21,804 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-29 01:17:21,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2020-07-29 01:17:21,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2020-07-29 01:17:21,808 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:17:21,808 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand 26 states. [2020-07-29 01:17:21,808 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 26 states. [2020-07-29 01:17:21,809 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 26 states. [2020-07-29 01:17:21,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:17:21,812 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2020-07-29 01:17:21,812 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2020-07-29 01:17:21,813 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:17:21,813 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:17:21,813 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 27 states. [2020-07-29 01:17:21,813 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 27 states. [2020-07-29 01:17:21,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:17:21,816 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2020-07-29 01:17:21,817 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2020-07-29 01:17:21,817 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:17:21,817 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:17:21,818 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:17:21,818 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:17:21,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2020-07-29 01:17:21,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2020-07-29 01:17:21,821 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 27 transitions. Word has length 9 [2020-07-29 01:17:21,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:17:21,821 INFO L479 AbstractCegarLoop]: Abstraction has 26 states and 27 transitions. [2020-07-29 01:17:21,821 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-29 01:17:21,821 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2020-07-29 01:17:21,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-07-29 01:17:21,822 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:17:21,822 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:17:21,823 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-29 01:17:21,823 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2020-07-29 01:17:21,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:17:21,823 INFO L82 PathProgramCache]: Analyzing trace with hash 2089391026, now seen corresponding path program 1 times [2020-07-29 01:17:21,824 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:17:21,824 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282851212] [2020-07-29 01:17:21,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:17:21,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:17:21,968 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-07-29 01:17:21,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:17:21,995 INFO L280 TraceCheckUtils]: 0: Hoare triple {262#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |#t~string5.offset| |old(#t~string5.offset)|) (= |old(#length)| |#length|) (= |#t~string5.base| |old(#t~string5.base)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(4);call write~init~int(37, #t~string5.base, #t~string5.offset, 1);call write~init~int(100, #t~string5.base, 1 + #t~string5.offset, 1);call write~init~int(10, #t~string5.base, 2 + #t~string5.offset, 1);call write~init~int(0, #t~string5.base, 3 + #t~string5.offset, 1); {255#true} is VALID [2020-07-29 01:17:21,996 INFO L280 TraceCheckUtils]: 1: Hoare triple {255#true} assume true; {255#true} is VALID [2020-07-29 01:17:21,996 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {255#true} {255#true} #47#return; {255#true} is VALID [2020-07-29 01:17:21,998 INFO L263 TraceCheckUtils]: 0: Hoare triple {255#true} call ULTIMATE.init(); {262#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |#t~string5.offset| |old(#t~string5.offset)|) (= |old(#length)| |#length|) (= |#t~string5.base| |old(#t~string5.base)|))} is VALID [2020-07-29 01:17:21,998 INFO L280 TraceCheckUtils]: 1: Hoare triple {262#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |#t~string5.offset| |old(#t~string5.offset)|) (= |old(#length)| |#length|) (= |#t~string5.base| |old(#t~string5.base)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(4);call write~init~int(37, #t~string5.base, #t~string5.offset, 1);call write~init~int(100, #t~string5.base, 1 + #t~string5.offset, 1);call write~init~int(10, #t~string5.base, 2 + #t~string5.offset, 1);call write~init~int(0, #t~string5.base, 3 + #t~string5.offset, 1); {255#true} is VALID [2020-07-29 01:17:21,998 INFO L280 TraceCheckUtils]: 2: Hoare triple {255#true} assume true; {255#true} is VALID [2020-07-29 01:17:21,999 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {255#true} {255#true} #47#return; {255#true} is VALID [2020-07-29 01:17:21,999 INFO L263 TraceCheckUtils]: 4: Hoare triple {255#true} call #t~ret7 := main(); {255#true} is VALID [2020-07-29 01:17:21,999 INFO L263 TraceCheckUtils]: 5: Hoare triple {255#true} call #t~ret2.base, #t~ret2.offset := getNumbers(); {255#true} is VALID [2020-07-29 01:17:22,002 INFO L280 TraceCheckUtils]: 6: Hoare triple {255#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnStack(40);~array~0.base, ~array~0.offset := #t~malloc0.base, #t~malloc0.offset;~i~0 := 0; {260#(and (= 40 (select |#length| getNumbers_~array~0.base)) (= 0 getNumbers_~array~0.offset) (= 0 getNumbers_~i~0))} is VALID [2020-07-29 01:17:22,004 INFO L280 TraceCheckUtils]: 7: Hoare triple {260#(and (= 40 (select |#length| getNumbers_~array~0.base)) (= 0 getNumbers_~array~0.offset) (= 0 getNumbers_~i~0))} assume !!(~i~0 < 10); {260#(and (= 40 (select |#length| getNumbers_~array~0.base)) (= 0 getNumbers_~array~0.offset) (= 0 getNumbers_~i~0))} is VALID [2020-07-29 01:17:22,005 INFO L280 TraceCheckUtils]: 8: Hoare triple {260#(and (= 40 (select |#length| getNumbers_~array~0.base)) (= 0 getNumbers_~array~0.offset) (= 0 getNumbers_~i~0))} SUMMARY for call write~int(~i~0, ~array~0.base, ~array~0.offset + 4 * ~i~0, 4); srcloc: L11 {260#(and (= 40 (select |#length| getNumbers_~array~0.base)) (= 0 getNumbers_~array~0.offset) (= 0 getNumbers_~i~0))} is VALID [2020-07-29 01:17:22,006 INFO L280 TraceCheckUtils]: 9: Hoare triple {260#(and (= 40 (select |#length| getNumbers_~array~0.base)) (= 0 getNumbers_~array~0.offset) (= 0 getNumbers_~i~0))} #t~pre1 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre1; {261#(and (<= 1 getNumbers_~i~0) (= 40 (select |#length| getNumbers_~array~0.base)) (<= getNumbers_~i~0 1) (= 0 getNumbers_~array~0.offset))} is VALID [2020-07-29 01:17:22,008 INFO L280 TraceCheckUtils]: 10: Hoare triple {261#(and (<= 1 getNumbers_~i~0) (= 40 (select |#length| getNumbers_~array~0.base)) (<= getNumbers_~i~0 1) (= 0 getNumbers_~array~0.offset))} assume !!(~i~0 < 10); {261#(and (<= 1 getNumbers_~i~0) (= 40 (select |#length| getNumbers_~array~0.base)) (<= getNumbers_~i~0 1) (= 0 getNumbers_~array~0.offset))} is VALID [2020-07-29 01:17:22,009 INFO L280 TraceCheckUtils]: 11: Hoare triple {261#(and (<= 1 getNumbers_~i~0) (= 40 (select |#length| getNumbers_~array~0.base)) (<= getNumbers_~i~0 1) (= 0 getNumbers_~array~0.offset))} assume !(4 + (~array~0.offset + 4 * ~i~0) <= #length[~array~0.base] && 0 <= ~array~0.offset + 4 * ~i~0); {256#false} is VALID [2020-07-29 01:17:22,011 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:17:22,011 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282851212] [2020-07-29 01:17:22,012 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2115541905] [2020-07-29 01:17:22,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-29 01:17:22,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:17:22,073 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 12 conjunts are in the unsatisfiable core [2020-07-29 01:17:22,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:17:22,092 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:17:22,189 INFO L384 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 [2020-07-29 01:17:22,190 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-29 01:17:22,201 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 01:17:22,201 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-29 01:17:22,202 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2020-07-29 01:17:22,206 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-29 01:17:22,206 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#length_15|]. (and (= |#length| (store |v_#length_15| getNumbers_~array~0.base 40)) (= 0 getNumbers_~array~0.offset) (= 0 getNumbers_~i~0)) [2020-07-29 01:17:22,207 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= 40 (select |#length| getNumbers_~array~0.base)) (= 0 getNumbers_~array~0.offset) (= 0 getNumbers_~i~0)) [2020-07-29 01:17:22,243 INFO L263 TraceCheckUtils]: 0: Hoare triple {255#true} call ULTIMATE.init(); {255#true} is VALID [2020-07-29 01:17:22,244 INFO L280 TraceCheckUtils]: 1: Hoare triple {255#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(4);call write~init~int(37, #t~string5.base, #t~string5.offset, 1);call write~init~int(100, #t~string5.base, 1 + #t~string5.offset, 1);call write~init~int(10, #t~string5.base, 2 + #t~string5.offset, 1);call write~init~int(0, #t~string5.base, 3 + #t~string5.offset, 1); {255#true} is VALID [2020-07-29 01:17:22,244 INFO L280 TraceCheckUtils]: 2: Hoare triple {255#true} assume true; {255#true} is VALID [2020-07-29 01:17:22,245 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {255#true} {255#true} #47#return; {255#true} is VALID [2020-07-29 01:17:22,245 INFO L263 TraceCheckUtils]: 4: Hoare triple {255#true} call #t~ret7 := main(); {255#true} is VALID [2020-07-29 01:17:22,245 INFO L263 TraceCheckUtils]: 5: Hoare triple {255#true} call #t~ret2.base, #t~ret2.offset := getNumbers(); {255#true} is VALID [2020-07-29 01:17:22,247 INFO L280 TraceCheckUtils]: 6: Hoare triple {255#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnStack(40);~array~0.base, ~array~0.offset := #t~malloc0.base, #t~malloc0.offset;~i~0 := 0; {260#(and (= 40 (select |#length| getNumbers_~array~0.base)) (= 0 getNumbers_~array~0.offset) (= 0 getNumbers_~i~0))} is VALID [2020-07-29 01:17:22,248 INFO L280 TraceCheckUtils]: 7: Hoare triple {260#(and (= 40 (select |#length| getNumbers_~array~0.base)) (= 0 getNumbers_~array~0.offset) (= 0 getNumbers_~i~0))} assume !!(~i~0 < 10); {260#(and (= 40 (select |#length| getNumbers_~array~0.base)) (= 0 getNumbers_~array~0.offset) (= 0 getNumbers_~i~0))} is VALID [2020-07-29 01:17:22,249 INFO L280 TraceCheckUtils]: 8: Hoare triple {260#(and (= 40 (select |#length| getNumbers_~array~0.base)) (= 0 getNumbers_~array~0.offset) (= 0 getNumbers_~i~0))} SUMMARY for call write~int(~i~0, ~array~0.base, ~array~0.offset + 4 * ~i~0, 4); srcloc: L11 {260#(and (= 40 (select |#length| getNumbers_~array~0.base)) (= 0 getNumbers_~array~0.offset) (= 0 getNumbers_~i~0))} is VALID [2020-07-29 01:17:22,251 INFO L280 TraceCheckUtils]: 9: Hoare triple {260#(and (= 40 (select |#length| getNumbers_~array~0.base)) (= 0 getNumbers_~array~0.offset) (= 0 getNumbers_~i~0))} #t~pre1 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre1; {261#(and (<= 1 getNumbers_~i~0) (= 40 (select |#length| getNumbers_~array~0.base)) (<= getNumbers_~i~0 1) (= 0 getNumbers_~array~0.offset))} is VALID [2020-07-29 01:17:22,252 INFO L280 TraceCheckUtils]: 10: Hoare triple {261#(and (<= 1 getNumbers_~i~0) (= 40 (select |#length| getNumbers_~array~0.base)) (<= getNumbers_~i~0 1) (= 0 getNumbers_~array~0.offset))} assume !!(~i~0 < 10); {261#(and (<= 1 getNumbers_~i~0) (= 40 (select |#length| getNumbers_~array~0.base)) (<= getNumbers_~i~0 1) (= 0 getNumbers_~array~0.offset))} is VALID [2020-07-29 01:17:22,257 INFO L280 TraceCheckUtils]: 11: Hoare triple {261#(and (<= 1 getNumbers_~i~0) (= 40 (select |#length| getNumbers_~array~0.base)) (<= getNumbers_~i~0 1) (= 0 getNumbers_~array~0.offset))} assume !(4 + (~array~0.offset + 4 * ~i~0) <= #length[~array~0.base] && 0 <= ~array~0.offset + 4 * ~i~0); {256#false} is VALID [2020-07-29 01:17:22,258 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:17:22,258 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-29 01:17:22,259 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3] total 4 [2020-07-29 01:17:22,259 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357858073] [2020-07-29 01:17:22,259 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2020-07-29 01:17:22,260 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:17:22,260 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-29 01:17:22,282 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:17:22,283 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-29 01:17:22,283 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:17:22,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-29 01:17:22,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-29 01:17:22,284 INFO L87 Difference]: Start difference. First operand 26 states and 27 transitions. Second operand 5 states. [2020-07-29 01:17:22,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:17:22,529 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2020-07-29 01:17:22,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-29 01:17:22,529 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2020-07-29 01:17:22,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:17:22,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-29 01:17:22,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 33 transitions. [2020-07-29 01:17:22,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-29 01:17:22,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 33 transitions. [2020-07-29 01:17:22,535 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 33 transitions. [2020-07-29 01:17:22,585 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:17:22,587 INFO L225 Difference]: With dead ends: 30 [2020-07-29 01:17:22,587 INFO L226 Difference]: Without dead ends: 30 [2020-07-29 01:17:22,588 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-29 01:17:22,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2020-07-29 01:17:22,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2020-07-29 01:17:22,592 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:17:22,592 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand 29 states. [2020-07-29 01:17:22,593 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 29 states. [2020-07-29 01:17:22,593 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 29 states. [2020-07-29 01:17:22,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:17:22,596 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2020-07-29 01:17:22,596 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2020-07-29 01:17:22,597 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:17:22,597 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:17:22,597 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 30 states. [2020-07-29 01:17:22,598 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 30 states. [2020-07-29 01:17:22,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:17:22,601 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2020-07-29 01:17:22,601 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2020-07-29 01:17:22,602 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:17:22,602 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:17:22,602 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:17:22,603 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:17:22,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2020-07-29 01:17:22,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2020-07-29 01:17:22,606 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 12 [2020-07-29 01:17:22,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:17:22,606 INFO L479 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2020-07-29 01:17:22,606 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-29 01:17:22,607 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2020-07-29 01:17:22,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-07-29 01:17:22,608 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:17:22,608 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:17:22,821 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2020-07-29 01:17:22,822 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2020-07-29 01:17:22,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:17:22,822 INFO L82 PathProgramCache]: Analyzing trace with hash -1912985381, now seen corresponding path program 2 times [2020-07-29 01:17:22,823 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:17:22,823 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522174174] [2020-07-29 01:17:22,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:17:22,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:17:23,007 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-07-29 01:17:23,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:17:23,017 INFO L280 TraceCheckUtils]: 0: Hoare triple {425#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |#t~string5.offset| |old(#t~string5.offset)|) (= |old(#length)| |#length|) (= |#t~string5.base| |old(#t~string5.base)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(4);call write~init~int(37, #t~string5.base, #t~string5.offset, 1);call write~init~int(100, #t~string5.base, 1 + #t~string5.offset, 1);call write~init~int(10, #t~string5.base, 2 + #t~string5.offset, 1);call write~init~int(0, #t~string5.base, 3 + #t~string5.offset, 1); {417#true} is VALID [2020-07-29 01:17:23,018 INFO L280 TraceCheckUtils]: 1: Hoare triple {417#true} assume true; {417#true} is VALID [2020-07-29 01:17:23,018 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {417#true} {417#true} #47#return; {417#true} is VALID [2020-07-29 01:17:23,020 INFO L263 TraceCheckUtils]: 0: Hoare triple {417#true} call ULTIMATE.init(); {425#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |#t~string5.offset| |old(#t~string5.offset)|) (= |old(#length)| |#length|) (= |#t~string5.base| |old(#t~string5.base)|))} is VALID [2020-07-29 01:17:23,021 INFO L280 TraceCheckUtils]: 1: Hoare triple {425#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |#t~string5.offset| |old(#t~string5.offset)|) (= |old(#length)| |#length|) (= |#t~string5.base| |old(#t~string5.base)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(4);call write~init~int(37, #t~string5.base, #t~string5.offset, 1);call write~init~int(100, #t~string5.base, 1 + #t~string5.offset, 1);call write~init~int(10, #t~string5.base, 2 + #t~string5.offset, 1);call write~init~int(0, #t~string5.base, 3 + #t~string5.offset, 1); {417#true} is VALID [2020-07-29 01:17:23,021 INFO L280 TraceCheckUtils]: 2: Hoare triple {417#true} assume true; {417#true} is VALID [2020-07-29 01:17:23,021 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {417#true} {417#true} #47#return; {417#true} is VALID [2020-07-29 01:17:23,022 INFO L263 TraceCheckUtils]: 4: Hoare triple {417#true} call #t~ret7 := main(); {417#true} is VALID [2020-07-29 01:17:23,022 INFO L263 TraceCheckUtils]: 5: Hoare triple {417#true} call #t~ret2.base, #t~ret2.offset := getNumbers(); {417#true} is VALID [2020-07-29 01:17:23,024 INFO L280 TraceCheckUtils]: 6: Hoare triple {417#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnStack(40);~array~0.base, ~array~0.offset := #t~malloc0.base, #t~malloc0.offset;~i~0 := 0; {422#(and (= 40 (select |#length| getNumbers_~array~0.base)) (= 0 getNumbers_~array~0.offset) (= 0 getNumbers_~i~0))} is VALID [2020-07-29 01:17:23,025 INFO L280 TraceCheckUtils]: 7: Hoare triple {422#(and (= 40 (select |#length| getNumbers_~array~0.base)) (= 0 getNumbers_~array~0.offset) (= 0 getNumbers_~i~0))} assume !!(~i~0 < 10); {422#(and (= 40 (select |#length| getNumbers_~array~0.base)) (= 0 getNumbers_~array~0.offset) (= 0 getNumbers_~i~0))} is VALID [2020-07-29 01:17:23,027 INFO L280 TraceCheckUtils]: 8: Hoare triple {422#(and (= 40 (select |#length| getNumbers_~array~0.base)) (= 0 getNumbers_~array~0.offset) (= 0 getNumbers_~i~0))} SUMMARY for call write~int(~i~0, ~array~0.base, ~array~0.offset + 4 * ~i~0, 4); srcloc: L11 {422#(and (= 40 (select |#length| getNumbers_~array~0.base)) (= 0 getNumbers_~array~0.offset) (= 0 getNumbers_~i~0))} is VALID [2020-07-29 01:17:23,028 INFO L280 TraceCheckUtils]: 9: Hoare triple {422#(and (= 40 (select |#length| getNumbers_~array~0.base)) (= 0 getNumbers_~array~0.offset) (= 0 getNumbers_~i~0))} #t~pre1 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre1; {423#(and (<= 1 getNumbers_~i~0) (= 40 (select |#length| getNumbers_~array~0.base)) (<= getNumbers_~i~0 1) (= 0 getNumbers_~array~0.offset))} is VALID [2020-07-29 01:17:23,029 INFO L280 TraceCheckUtils]: 10: Hoare triple {423#(and (<= 1 getNumbers_~i~0) (= 40 (select |#length| getNumbers_~array~0.base)) (<= getNumbers_~i~0 1) (= 0 getNumbers_~array~0.offset))} assume !!(~i~0 < 10); {423#(and (<= 1 getNumbers_~i~0) (= 40 (select |#length| getNumbers_~array~0.base)) (<= getNumbers_~i~0 1) (= 0 getNumbers_~array~0.offset))} is VALID [2020-07-29 01:17:23,031 INFO L280 TraceCheckUtils]: 11: Hoare triple {423#(and (<= 1 getNumbers_~i~0) (= 40 (select |#length| getNumbers_~array~0.base)) (<= getNumbers_~i~0 1) (= 0 getNumbers_~array~0.offset))} SUMMARY for call write~int(~i~0, ~array~0.base, ~array~0.offset + 4 * ~i~0, 4); srcloc: L11 {423#(and (<= 1 getNumbers_~i~0) (= 40 (select |#length| getNumbers_~array~0.base)) (<= getNumbers_~i~0 1) (= 0 getNumbers_~array~0.offset))} is VALID [2020-07-29 01:17:23,033 INFO L280 TraceCheckUtils]: 12: Hoare triple {423#(and (<= 1 getNumbers_~i~0) (= 40 (select |#length| getNumbers_~array~0.base)) (<= getNumbers_~i~0 1) (= 0 getNumbers_~array~0.offset))} #t~pre1 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre1; {424#(and (<= getNumbers_~i~0 2) (= 40 (select |#length| getNumbers_~array~0.base)) (<= 2 getNumbers_~i~0) (= 0 getNumbers_~array~0.offset))} is VALID [2020-07-29 01:17:23,034 INFO L280 TraceCheckUtils]: 13: Hoare triple {424#(and (<= getNumbers_~i~0 2) (= 40 (select |#length| getNumbers_~array~0.base)) (<= 2 getNumbers_~i~0) (= 0 getNumbers_~array~0.offset))} assume !!(~i~0 < 10); {424#(and (<= getNumbers_~i~0 2) (= 40 (select |#length| getNumbers_~array~0.base)) (<= 2 getNumbers_~i~0) (= 0 getNumbers_~array~0.offset))} is VALID [2020-07-29 01:17:23,036 INFO L280 TraceCheckUtils]: 14: Hoare triple {424#(and (<= getNumbers_~i~0 2) (= 40 (select |#length| getNumbers_~array~0.base)) (<= 2 getNumbers_~i~0) (= 0 getNumbers_~array~0.offset))} assume !(4 + (~array~0.offset + 4 * ~i~0) <= #length[~array~0.base] && 0 <= ~array~0.offset + 4 * ~i~0); {418#false} is VALID [2020-07-29 01:17:23,038 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:17:23,038 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522174174] [2020-07-29 01:17:23,039 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1130049031] [2020-07-29 01:17:23,039 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-29 01:17:23,086 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-29 01:17:23,086 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-29 01:17:23,087 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 12 conjunts are in the unsatisfiable core [2020-07-29 01:17:23,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:17:23,106 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:17:23,149 INFO L384 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 [2020-07-29 01:17:23,150 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-29 01:17:23,157 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 01:17:23,157 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-29 01:17:23,157 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2020-07-29 01:17:23,161 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-29 01:17:23,161 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#length_16|]. (and (<= 0 getNumbers_~i~0) (= (store |v_#length_16| getNumbers_~array~0.base 40) |#length|) (= 0 getNumbers_~array~0.offset)) [2020-07-29 01:17:23,162 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (and (<= 0 getNumbers_~i~0) (= 40 (select |#length| getNumbers_~array~0.base)) (= 0 getNumbers_~array~0.offset)) [2020-07-29 01:17:23,378 INFO L263 TraceCheckUtils]: 0: Hoare triple {417#true} call ULTIMATE.init(); {417#true} is VALID [2020-07-29 01:17:23,378 INFO L280 TraceCheckUtils]: 1: Hoare triple {417#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(4);call write~init~int(37, #t~string5.base, #t~string5.offset, 1);call write~init~int(100, #t~string5.base, 1 + #t~string5.offset, 1);call write~init~int(10, #t~string5.base, 2 + #t~string5.offset, 1);call write~init~int(0, #t~string5.base, 3 + #t~string5.offset, 1); {417#true} is VALID [2020-07-29 01:17:23,379 INFO L280 TraceCheckUtils]: 2: Hoare triple {417#true} assume true; {417#true} is VALID [2020-07-29 01:17:23,379 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {417#true} {417#true} #47#return; {417#true} is VALID [2020-07-29 01:17:23,379 INFO L263 TraceCheckUtils]: 4: Hoare triple {417#true} call #t~ret7 := main(); {417#true} is VALID [2020-07-29 01:17:23,380 INFO L263 TraceCheckUtils]: 5: Hoare triple {417#true} call #t~ret2.base, #t~ret2.offset := getNumbers(); {417#true} is VALID [2020-07-29 01:17:23,381 INFO L280 TraceCheckUtils]: 6: Hoare triple {417#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnStack(40);~array~0.base, ~array~0.offset := #t~malloc0.base, #t~malloc0.offset;~i~0 := 0; {447#(and (<= 0 getNumbers_~i~0) (= 40 (select |#length| getNumbers_~array~0.base)) (= 0 getNumbers_~array~0.offset))} is VALID [2020-07-29 01:17:23,382 INFO L280 TraceCheckUtils]: 7: Hoare triple {447#(and (<= 0 getNumbers_~i~0) (= 40 (select |#length| getNumbers_~array~0.base)) (= 0 getNumbers_~array~0.offset))} assume !!(~i~0 < 10); {447#(and (<= 0 getNumbers_~i~0) (= 40 (select |#length| getNumbers_~array~0.base)) (= 0 getNumbers_~array~0.offset))} is VALID [2020-07-29 01:17:23,384 INFO L280 TraceCheckUtils]: 8: Hoare triple {447#(and (<= 0 getNumbers_~i~0) (= 40 (select |#length| getNumbers_~array~0.base)) (= 0 getNumbers_~array~0.offset))} SUMMARY for call write~int(~i~0, ~array~0.base, ~array~0.offset + 4 * ~i~0, 4); srcloc: L11 {447#(and (<= 0 getNumbers_~i~0) (= 40 (select |#length| getNumbers_~array~0.base)) (= 0 getNumbers_~array~0.offset))} is VALID [2020-07-29 01:17:23,385 INFO L280 TraceCheckUtils]: 9: Hoare triple {447#(and (<= 0 getNumbers_~i~0) (= 40 (select |#length| getNumbers_~array~0.base)) (= 0 getNumbers_~array~0.offset))} #t~pre1 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre1; {457#(and (<= 1 getNumbers_~i~0) (= 40 (select |#length| getNumbers_~array~0.base)) (= 0 getNumbers_~array~0.offset))} is VALID [2020-07-29 01:17:23,385 INFO L280 TraceCheckUtils]: 10: Hoare triple {457#(and (<= 1 getNumbers_~i~0) (= 40 (select |#length| getNumbers_~array~0.base)) (= 0 getNumbers_~array~0.offset))} assume !!(~i~0 < 10); {457#(and (<= 1 getNumbers_~i~0) (= 40 (select |#length| getNumbers_~array~0.base)) (= 0 getNumbers_~array~0.offset))} is VALID [2020-07-29 01:17:23,386 INFO L280 TraceCheckUtils]: 11: Hoare triple {457#(and (<= 1 getNumbers_~i~0) (= 40 (select |#length| getNumbers_~array~0.base)) (= 0 getNumbers_~array~0.offset))} SUMMARY for call write~int(~i~0, ~array~0.base, ~array~0.offset + 4 * ~i~0, 4); srcloc: L11 {457#(and (<= 1 getNumbers_~i~0) (= 40 (select |#length| getNumbers_~array~0.base)) (= 0 getNumbers_~array~0.offset))} is VALID [2020-07-29 01:17:23,387 INFO L280 TraceCheckUtils]: 12: Hoare triple {457#(and (<= 1 getNumbers_~i~0) (= 40 (select |#length| getNumbers_~array~0.base)) (= 0 getNumbers_~array~0.offset))} #t~pre1 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre1; {467#(and (= 40 (select |#length| getNumbers_~array~0.base)) (<= 2 getNumbers_~i~0) (= 0 getNumbers_~array~0.offset))} is VALID [2020-07-29 01:17:23,391 INFO L280 TraceCheckUtils]: 13: Hoare triple {467#(and (= 40 (select |#length| getNumbers_~array~0.base)) (<= 2 getNumbers_~i~0) (= 0 getNumbers_~array~0.offset))} assume !!(~i~0 < 10); {471#(and (= 40 (select |#length| getNumbers_~array~0.base)) (<= 2 getNumbers_~i~0) (< getNumbers_~i~0 10) (= 0 getNumbers_~array~0.offset))} is VALID [2020-07-29 01:17:23,392 INFO L280 TraceCheckUtils]: 14: Hoare triple {471#(and (= 40 (select |#length| getNumbers_~array~0.base)) (<= 2 getNumbers_~i~0) (< getNumbers_~i~0 10) (= 0 getNumbers_~array~0.offset))} assume !(4 + (~array~0.offset + 4 * ~i~0) <= #length[~array~0.base] && 0 <= ~array~0.offset + 4 * ~i~0); {418#false} is VALID [2020-07-29 01:17:23,393 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:17:23,394 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-29 01:17:23,394 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 9 [2020-07-29 01:17:23,394 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698119601] [2020-07-29 01:17:23,395 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2020-07-29 01:17:23,395 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:17:23,396 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-29 01:17:23,430 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:17:23,430 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-29 01:17:23,430 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:17:23,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-29 01:17:23,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2020-07-29 01:17:23,432 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand 6 states. [2020-07-29 01:17:23,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:17:23,630 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2020-07-29 01:17:23,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-29 01:17:23,630 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2020-07-29 01:17:23,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:17:23,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-29 01:17:23,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 31 transitions. [2020-07-29 01:17:23,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-29 01:17:23,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 31 transitions. [2020-07-29 01:17:23,635 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 31 transitions. [2020-07-29 01:17:23,679 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:17:23,681 INFO L225 Difference]: With dead ends: 29 [2020-07-29 01:17:23,681 INFO L226 Difference]: Without dead ends: 29 [2020-07-29 01:17:23,682 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2020-07-29 01:17:23,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2020-07-29 01:17:23,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2020-07-29 01:17:23,685 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:17:23,685 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand 27 states. [2020-07-29 01:17:23,686 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 27 states. [2020-07-29 01:17:23,686 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 27 states. [2020-07-29 01:17:23,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:17:23,689 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2020-07-29 01:17:23,689 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2020-07-29 01:17:23,690 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:17:23,690 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:17:23,690 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 29 states. [2020-07-29 01:17:23,691 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 29 states. [2020-07-29 01:17:23,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:17:23,714 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2020-07-29 01:17:23,714 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2020-07-29 01:17:23,715 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:17:23,715 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:17:23,715 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:17:23,715 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:17:23,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-07-29 01:17:23,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2020-07-29 01:17:23,720 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 15 [2020-07-29 01:17:23,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:17:23,720 INFO L479 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2020-07-29 01:17:23,720 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-29 01:17:23,720 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2020-07-29 01:17:23,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-07-29 01:17:23,721 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:17:23,721 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:17:23,927 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-29 01:17:23,928 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2020-07-29 01:17:23,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:17:23,931 INFO L82 PathProgramCache]: Analyzing trace with hash 2027302431, now seen corresponding path program 1 times [2020-07-29 01:17:23,931 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:17:23,931 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888871424] [2020-07-29 01:17:23,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:17:23,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:17:23,985 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-07-29 01:17:23,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:17:24,004 INFO L280 TraceCheckUtils]: 0: Hoare triple {604#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |#t~string5.offset| |old(#t~string5.offset)|) (= |old(#length)| |#length|) (= |#t~string5.base| |old(#t~string5.base)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(4);call write~init~int(37, #t~string5.base, #t~string5.offset, 1);call write~init~int(100, #t~string5.base, 1 + #t~string5.offset, 1);call write~init~int(10, #t~string5.base, 2 + #t~string5.offset, 1);call write~init~int(0, #t~string5.base, 3 + #t~string5.offset, 1); {588#true} is VALID [2020-07-29 01:17:24,004 INFO L280 TraceCheckUtils]: 1: Hoare triple {588#true} assume true; {588#true} is VALID [2020-07-29 01:17:24,004 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {588#true} {588#true} #47#return; {588#true} is VALID [2020-07-29 01:17:24,024 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-07-29 01:17:24,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:17:24,088 INFO L280 TraceCheckUtils]: 0: Hoare triple {605#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnStack(40);~array~0.base, ~array~0.offset := #t~malloc0.base, #t~malloc0.offset;~i~0 := 0; {606#(= 0 getNumbers_~i~0)} is VALID [2020-07-29 01:17:24,089 INFO L280 TraceCheckUtils]: 1: Hoare triple {606#(= 0 getNumbers_~i~0)} assume !!(~i~0 < 10); {606#(= 0 getNumbers_~i~0)} is VALID [2020-07-29 01:17:24,090 INFO L280 TraceCheckUtils]: 2: Hoare triple {606#(= 0 getNumbers_~i~0)} SUMMARY for call write~int(~i~0, ~array~0.base, ~array~0.offset + 4 * ~i~0, 4); srcloc: L11 {606#(= 0 getNumbers_~i~0)} is VALID [2020-07-29 01:17:24,091 INFO L280 TraceCheckUtils]: 3: Hoare triple {606#(= 0 getNumbers_~i~0)} #t~pre1 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre1; {607#(<= getNumbers_~i~0 1)} is VALID [2020-07-29 01:17:24,092 INFO L280 TraceCheckUtils]: 4: Hoare triple {607#(<= getNumbers_~i~0 1)} assume !!(~i~0 < 10); {607#(<= getNumbers_~i~0 1)} is VALID [2020-07-29 01:17:24,094 INFO L280 TraceCheckUtils]: 5: Hoare triple {607#(<= getNumbers_~i~0 1)} SUMMARY for call write~int(~i~0, ~array~0.base, ~array~0.offset + 4 * ~i~0, 4); srcloc: L11 {607#(<= getNumbers_~i~0 1)} is VALID [2020-07-29 01:17:24,095 INFO L280 TraceCheckUtils]: 6: Hoare triple {607#(<= getNumbers_~i~0 1)} #t~pre1 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre1; {608#(<= getNumbers_~i~0 2)} is VALID [2020-07-29 01:17:24,095 INFO L280 TraceCheckUtils]: 7: Hoare triple {608#(<= getNumbers_~i~0 2)} assume !(~i~0 < 10); {589#false} is VALID [2020-07-29 01:17:24,096 INFO L280 TraceCheckUtils]: 8: Hoare triple {589#false} #res.base, #res.offset := ~array~0.base, ~array~0.offset;call ULTIMATE.dealloc(#t~malloc0.base, #t~malloc0.offset);havoc #t~malloc0.base, #t~malloc0.offset; {589#false} is VALID [2020-07-29 01:17:24,096 INFO L280 TraceCheckUtils]: 9: Hoare triple {589#false} assume true; {589#false} is VALID [2020-07-29 01:17:24,096 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {589#false} {588#true} #51#return; {589#false} is VALID [2020-07-29 01:17:24,098 INFO L263 TraceCheckUtils]: 0: Hoare triple {588#true} call ULTIMATE.init(); {604#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |#t~string5.offset| |old(#t~string5.offset)|) (= |old(#length)| |#length|) (= |#t~string5.base| |old(#t~string5.base)|))} is VALID [2020-07-29 01:17:24,098 INFO L280 TraceCheckUtils]: 1: Hoare triple {604#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |#t~string5.offset| |old(#t~string5.offset)|) (= |old(#length)| |#length|) (= |#t~string5.base| |old(#t~string5.base)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(4);call write~init~int(37, #t~string5.base, #t~string5.offset, 1);call write~init~int(100, #t~string5.base, 1 + #t~string5.offset, 1);call write~init~int(10, #t~string5.base, 2 + #t~string5.offset, 1);call write~init~int(0, #t~string5.base, 3 + #t~string5.offset, 1); {588#true} is VALID [2020-07-29 01:17:24,099 INFO L280 TraceCheckUtils]: 2: Hoare triple {588#true} assume true; {588#true} is VALID [2020-07-29 01:17:24,099 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {588#true} {588#true} #47#return; {588#true} is VALID [2020-07-29 01:17:24,099 INFO L263 TraceCheckUtils]: 4: Hoare triple {588#true} call #t~ret7 := main(); {588#true} is VALID [2020-07-29 01:17:24,100 INFO L263 TraceCheckUtils]: 5: Hoare triple {588#true} call #t~ret2.base, #t~ret2.offset := getNumbers(); {605#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-29 01:17:24,102 INFO L280 TraceCheckUtils]: 6: Hoare triple {605#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnStack(40);~array~0.base, ~array~0.offset := #t~malloc0.base, #t~malloc0.offset;~i~0 := 0; {606#(= 0 getNumbers_~i~0)} is VALID [2020-07-29 01:17:24,103 INFO L280 TraceCheckUtils]: 7: Hoare triple {606#(= 0 getNumbers_~i~0)} assume !!(~i~0 < 10); {606#(= 0 getNumbers_~i~0)} is VALID [2020-07-29 01:17:24,107 INFO L280 TraceCheckUtils]: 8: Hoare triple {606#(= 0 getNumbers_~i~0)} SUMMARY for call write~int(~i~0, ~array~0.base, ~array~0.offset + 4 * ~i~0, 4); srcloc: L11 {606#(= 0 getNumbers_~i~0)} is VALID [2020-07-29 01:17:24,108 INFO L280 TraceCheckUtils]: 9: Hoare triple {606#(= 0 getNumbers_~i~0)} #t~pre1 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre1; {607#(<= getNumbers_~i~0 1)} is VALID [2020-07-29 01:17:24,109 INFO L280 TraceCheckUtils]: 10: Hoare triple {607#(<= getNumbers_~i~0 1)} assume !!(~i~0 < 10); {607#(<= getNumbers_~i~0 1)} is VALID [2020-07-29 01:17:24,110 INFO L280 TraceCheckUtils]: 11: Hoare triple {607#(<= getNumbers_~i~0 1)} SUMMARY for call write~int(~i~0, ~array~0.base, ~array~0.offset + 4 * ~i~0, 4); srcloc: L11 {607#(<= getNumbers_~i~0 1)} is VALID [2020-07-29 01:17:24,112 INFO L280 TraceCheckUtils]: 12: Hoare triple {607#(<= getNumbers_~i~0 1)} #t~pre1 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre1; {608#(<= getNumbers_~i~0 2)} is VALID [2020-07-29 01:17:24,114 INFO L280 TraceCheckUtils]: 13: Hoare triple {608#(<= getNumbers_~i~0 2)} assume !(~i~0 < 10); {589#false} is VALID [2020-07-29 01:17:24,114 INFO L280 TraceCheckUtils]: 14: Hoare triple {589#false} #res.base, #res.offset := ~array~0.base, ~array~0.offset;call ULTIMATE.dealloc(#t~malloc0.base, #t~malloc0.offset);havoc #t~malloc0.base, #t~malloc0.offset; {589#false} is VALID [2020-07-29 01:17:24,114 INFO L280 TraceCheckUtils]: 15: Hoare triple {589#false} assume true; {589#false} is VALID [2020-07-29 01:17:24,115 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {589#false} {588#true} #51#return; {589#false} is VALID [2020-07-29 01:17:24,115 INFO L280 TraceCheckUtils]: 17: Hoare triple {589#false} ~numbers~0.base, ~numbers~0.offset := #t~ret2.base, #t~ret2.offset;havoc #t~ret2.base, #t~ret2.offset;~i~1 := 0; {589#false} is VALID [2020-07-29 01:17:24,115 INFO L280 TraceCheckUtils]: 18: Hoare triple {589#false} assume !!(~i~1 < 10);havoc #t~nondet4; {589#false} is VALID [2020-07-29 01:17:24,115 INFO L280 TraceCheckUtils]: 19: Hoare triple {589#false} assume !(1 == #valid[~numbers~0.base]); {589#false} is VALID [2020-07-29 01:17:24,116 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:17:24,116 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888871424] [2020-07-29 01:17:24,116 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [382869347] [2020-07-29 01:17:24,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-29 01:17:24,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:17:24,158 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 01:17:24,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:17:24,169 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:17:24,284 INFO L263 TraceCheckUtils]: 0: Hoare triple {588#true} call ULTIMATE.init(); {588#true} is VALID [2020-07-29 01:17:24,285 INFO L280 TraceCheckUtils]: 1: Hoare triple {588#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(4);call write~init~int(37, #t~string5.base, #t~string5.offset, 1);call write~init~int(100, #t~string5.base, 1 + #t~string5.offset, 1);call write~init~int(10, #t~string5.base, 2 + #t~string5.offset, 1);call write~init~int(0, #t~string5.base, 3 + #t~string5.offset, 1); {588#true} is VALID [2020-07-29 01:17:24,285 INFO L280 TraceCheckUtils]: 2: Hoare triple {588#true} assume true; {588#true} is VALID [2020-07-29 01:17:24,285 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {588#true} {588#true} #47#return; {588#true} is VALID [2020-07-29 01:17:24,285 INFO L263 TraceCheckUtils]: 4: Hoare triple {588#true} call #t~ret7 := main(); {588#true} is VALID [2020-07-29 01:17:24,286 INFO L263 TraceCheckUtils]: 5: Hoare triple {588#true} call #t~ret2.base, #t~ret2.offset := getNumbers(); {588#true} is VALID [2020-07-29 01:17:24,307 INFO L280 TraceCheckUtils]: 6: Hoare triple {588#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnStack(40);~array~0.base, ~array~0.offset := #t~malloc0.base, #t~malloc0.offset;~i~0 := 0; {630#(<= getNumbers_~i~0 0)} is VALID [2020-07-29 01:17:24,308 INFO L280 TraceCheckUtils]: 7: Hoare triple {630#(<= getNumbers_~i~0 0)} assume !!(~i~0 < 10); {630#(<= getNumbers_~i~0 0)} is VALID [2020-07-29 01:17:24,309 INFO L280 TraceCheckUtils]: 8: Hoare triple {630#(<= getNumbers_~i~0 0)} SUMMARY for call write~int(~i~0, ~array~0.base, ~array~0.offset + 4 * ~i~0, 4); srcloc: L11 {630#(<= getNumbers_~i~0 0)} is VALID [2020-07-29 01:17:24,315 INFO L280 TraceCheckUtils]: 9: Hoare triple {630#(<= getNumbers_~i~0 0)} #t~pre1 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre1; {607#(<= getNumbers_~i~0 1)} is VALID [2020-07-29 01:17:24,321 INFO L280 TraceCheckUtils]: 10: Hoare triple {607#(<= getNumbers_~i~0 1)} assume !!(~i~0 < 10); {607#(<= getNumbers_~i~0 1)} is VALID [2020-07-29 01:17:24,322 INFO L280 TraceCheckUtils]: 11: Hoare triple {607#(<= getNumbers_~i~0 1)} SUMMARY for call write~int(~i~0, ~array~0.base, ~array~0.offset + 4 * ~i~0, 4); srcloc: L11 {607#(<= getNumbers_~i~0 1)} is VALID [2020-07-29 01:17:24,324 INFO L280 TraceCheckUtils]: 12: Hoare triple {607#(<= getNumbers_~i~0 1)} #t~pre1 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre1; {608#(<= getNumbers_~i~0 2)} is VALID [2020-07-29 01:17:24,325 INFO L280 TraceCheckUtils]: 13: Hoare triple {608#(<= getNumbers_~i~0 2)} assume !(~i~0 < 10); {589#false} is VALID [2020-07-29 01:17:24,326 INFO L280 TraceCheckUtils]: 14: Hoare triple {589#false} #res.base, #res.offset := ~array~0.base, ~array~0.offset;call ULTIMATE.dealloc(#t~malloc0.base, #t~malloc0.offset);havoc #t~malloc0.base, #t~malloc0.offset; {589#false} is VALID [2020-07-29 01:17:24,326 INFO L280 TraceCheckUtils]: 15: Hoare triple {589#false} assume true; {589#false} is VALID [2020-07-29 01:17:24,326 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {589#false} {588#true} #51#return; {589#false} is VALID [2020-07-29 01:17:24,327 INFO L280 TraceCheckUtils]: 17: Hoare triple {589#false} ~numbers~0.base, ~numbers~0.offset := #t~ret2.base, #t~ret2.offset;havoc #t~ret2.base, #t~ret2.offset;~i~1 := 0; {589#false} is VALID [2020-07-29 01:17:24,327 INFO L280 TraceCheckUtils]: 18: Hoare triple {589#false} assume !!(~i~1 < 10);havoc #t~nondet4; {589#false} is VALID [2020-07-29 01:17:24,327 INFO L280 TraceCheckUtils]: 19: Hoare triple {589#false} assume !(1 == #valid[~numbers~0.base]); {589#false} is VALID [2020-07-29 01:17:24,328 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:17:24,329 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-29 01:17:24,329 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5] total 8 [2020-07-29 01:17:24,329 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165842167] [2020-07-29 01:17:24,330 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 20 [2020-07-29 01:17:24,330 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:17:24,330 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-29 01:17:24,377 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:17:24,377 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-29 01:17:24,378 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:17:24,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-29 01:17:24,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-07-29 01:17:24,378 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand 8 states. [2020-07-29 01:17:24,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:17:24,602 INFO L93 Difference]: Finished difference Result 32 states and 33 transitions. [2020-07-29 01:17:24,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-29 01:17:24,603 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 20 [2020-07-29 01:17:24,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:17:24,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-29 01:17:24,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 34 transitions. [2020-07-29 01:17:24,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-29 01:17:24,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 34 transitions. [2020-07-29 01:17:24,608 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 34 transitions. [2020-07-29 01:17:24,662 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:17:24,664 INFO L225 Difference]: With dead ends: 32 [2020-07-29 01:17:24,664 INFO L226 Difference]: Without dead ends: 32 [2020-07-29 01:17:24,665 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2020-07-29 01:17:24,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2020-07-29 01:17:24,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2020-07-29 01:17:24,672 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:17:24,672 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand 30 states. [2020-07-29 01:17:24,673 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 30 states. [2020-07-29 01:17:24,673 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 30 states. [2020-07-29 01:17:24,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:17:24,679 INFO L93 Difference]: Finished difference Result 32 states and 33 transitions. [2020-07-29 01:17:24,679 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2020-07-29 01:17:24,680 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:17:24,681 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:17:24,681 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 32 states. [2020-07-29 01:17:24,682 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 32 states. [2020-07-29 01:17:24,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:17:24,685 INFO L93 Difference]: Finished difference Result 32 states and 33 transitions. [2020-07-29 01:17:24,685 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2020-07-29 01:17:24,686 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:17:24,686 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:17:24,686 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:17:24,686 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:17:24,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-07-29 01:17:24,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2020-07-29 01:17:24,694 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 20 [2020-07-29 01:17:24,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:17:24,694 INFO L479 AbstractCegarLoop]: Abstraction has 30 states and 31 transitions. [2020-07-29 01:17:24,694 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-29 01:17:24,694 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2020-07-29 01:17:24,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-07-29 01:17:24,699 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:17:24,700 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:17:24,913 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-29 01:17:24,914 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2020-07-29 01:17:24,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:17:24,914 INFO L82 PathProgramCache]: Analyzing trace with hash -1378383288, now seen corresponding path program 2 times [2020-07-29 01:17:24,914 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:17:24,915 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131127943] [2020-07-29 01:17:24,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:17:24,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:17:24,994 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-07-29 01:17:24,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:17:25,003 INFO L280 TraceCheckUtils]: 0: Hoare triple {816#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |#t~string5.offset| |old(#t~string5.offset)|) (= |old(#length)| |#length|) (= |#t~string5.base| |old(#t~string5.base)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(4);call write~init~int(37, #t~string5.base, #t~string5.offset, 1);call write~init~int(100, #t~string5.base, 1 + #t~string5.offset, 1);call write~init~int(10, #t~string5.base, 2 + #t~string5.offset, 1);call write~init~int(0, #t~string5.base, 3 + #t~string5.offset, 1); {797#true} is VALID [2020-07-29 01:17:25,004 INFO L280 TraceCheckUtils]: 1: Hoare triple {797#true} assume true; {797#true} is VALID [2020-07-29 01:17:25,004 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {797#true} {797#true} #47#return; {797#true} is VALID [2020-07-29 01:17:25,015 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-07-29 01:17:25,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:17:25,077 INFO L280 TraceCheckUtils]: 0: Hoare triple {817#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnStack(40);~array~0.base, ~array~0.offset := #t~malloc0.base, #t~malloc0.offset;~i~0 := 0; {818#(= 0 getNumbers_~i~0)} is VALID [2020-07-29 01:17:25,077 INFO L280 TraceCheckUtils]: 1: Hoare triple {818#(= 0 getNumbers_~i~0)} assume !!(~i~0 < 10); {818#(= 0 getNumbers_~i~0)} is VALID [2020-07-29 01:17:25,078 INFO L280 TraceCheckUtils]: 2: Hoare triple {818#(= 0 getNumbers_~i~0)} SUMMARY for call write~int(~i~0, ~array~0.base, ~array~0.offset + 4 * ~i~0, 4); srcloc: L11 {818#(= 0 getNumbers_~i~0)} is VALID [2020-07-29 01:17:25,079 INFO L280 TraceCheckUtils]: 3: Hoare triple {818#(= 0 getNumbers_~i~0)} #t~pre1 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre1; {819#(<= getNumbers_~i~0 1)} is VALID [2020-07-29 01:17:25,080 INFO L280 TraceCheckUtils]: 4: Hoare triple {819#(<= getNumbers_~i~0 1)} assume !!(~i~0 < 10); {819#(<= getNumbers_~i~0 1)} is VALID [2020-07-29 01:17:25,080 INFO L280 TraceCheckUtils]: 5: Hoare triple {819#(<= getNumbers_~i~0 1)} SUMMARY for call write~int(~i~0, ~array~0.base, ~array~0.offset + 4 * ~i~0, 4); srcloc: L11 {819#(<= getNumbers_~i~0 1)} is VALID [2020-07-29 01:17:25,081 INFO L280 TraceCheckUtils]: 6: Hoare triple {819#(<= getNumbers_~i~0 1)} #t~pre1 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre1; {820#(<= getNumbers_~i~0 2)} is VALID [2020-07-29 01:17:25,081 INFO L280 TraceCheckUtils]: 7: Hoare triple {820#(<= getNumbers_~i~0 2)} assume !!(~i~0 < 10); {820#(<= getNumbers_~i~0 2)} is VALID [2020-07-29 01:17:25,082 INFO L280 TraceCheckUtils]: 8: Hoare triple {820#(<= getNumbers_~i~0 2)} SUMMARY for call write~int(~i~0, ~array~0.base, ~array~0.offset + 4 * ~i~0, 4); srcloc: L11 {820#(<= getNumbers_~i~0 2)} is VALID [2020-07-29 01:17:25,082 INFO L280 TraceCheckUtils]: 9: Hoare triple {820#(<= getNumbers_~i~0 2)} #t~pre1 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre1; {821#(<= getNumbers_~i~0 3)} is VALID [2020-07-29 01:17:25,083 INFO L280 TraceCheckUtils]: 10: Hoare triple {821#(<= getNumbers_~i~0 3)} assume !(~i~0 < 10); {798#false} is VALID [2020-07-29 01:17:25,083 INFO L280 TraceCheckUtils]: 11: Hoare triple {798#false} #res.base, #res.offset := ~array~0.base, ~array~0.offset;call ULTIMATE.dealloc(#t~malloc0.base, #t~malloc0.offset);havoc #t~malloc0.base, #t~malloc0.offset; {798#false} is VALID [2020-07-29 01:17:25,083 INFO L280 TraceCheckUtils]: 12: Hoare triple {798#false} assume true; {798#false} is VALID [2020-07-29 01:17:25,084 INFO L275 TraceCheckUtils]: 13: Hoare quadruple {798#false} {797#true} #51#return; {798#false} is VALID [2020-07-29 01:17:25,086 INFO L263 TraceCheckUtils]: 0: Hoare triple {797#true} call ULTIMATE.init(); {816#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |#t~string5.offset| |old(#t~string5.offset)|) (= |old(#length)| |#length|) (= |#t~string5.base| |old(#t~string5.base)|))} is VALID [2020-07-29 01:17:25,086 INFO L280 TraceCheckUtils]: 1: Hoare triple {816#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |#t~string5.offset| |old(#t~string5.offset)|) (= |old(#length)| |#length|) (= |#t~string5.base| |old(#t~string5.base)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(4);call write~init~int(37, #t~string5.base, #t~string5.offset, 1);call write~init~int(100, #t~string5.base, 1 + #t~string5.offset, 1);call write~init~int(10, #t~string5.base, 2 + #t~string5.offset, 1);call write~init~int(0, #t~string5.base, 3 + #t~string5.offset, 1); {797#true} is VALID [2020-07-29 01:17:25,086 INFO L280 TraceCheckUtils]: 2: Hoare triple {797#true} assume true; {797#true} is VALID [2020-07-29 01:17:25,086 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {797#true} {797#true} #47#return; {797#true} is VALID [2020-07-29 01:17:25,087 INFO L263 TraceCheckUtils]: 4: Hoare triple {797#true} call #t~ret7 := main(); {797#true} is VALID [2020-07-29 01:17:25,088 INFO L263 TraceCheckUtils]: 5: Hoare triple {797#true} call #t~ret2.base, #t~ret2.offset := getNumbers(); {817#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-29 01:17:25,090 INFO L280 TraceCheckUtils]: 6: Hoare triple {817#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnStack(40);~array~0.base, ~array~0.offset := #t~malloc0.base, #t~malloc0.offset;~i~0 := 0; {818#(= 0 getNumbers_~i~0)} is VALID [2020-07-29 01:17:25,091 INFO L280 TraceCheckUtils]: 7: Hoare triple {818#(= 0 getNumbers_~i~0)} assume !!(~i~0 < 10); {818#(= 0 getNumbers_~i~0)} is VALID [2020-07-29 01:17:25,091 INFO L280 TraceCheckUtils]: 8: Hoare triple {818#(= 0 getNumbers_~i~0)} SUMMARY for call write~int(~i~0, ~array~0.base, ~array~0.offset + 4 * ~i~0, 4); srcloc: L11 {818#(= 0 getNumbers_~i~0)} is VALID [2020-07-29 01:17:25,092 INFO L280 TraceCheckUtils]: 9: Hoare triple {818#(= 0 getNumbers_~i~0)} #t~pre1 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre1; {819#(<= getNumbers_~i~0 1)} is VALID [2020-07-29 01:17:25,092 INFO L280 TraceCheckUtils]: 10: Hoare triple {819#(<= getNumbers_~i~0 1)} assume !!(~i~0 < 10); {819#(<= getNumbers_~i~0 1)} is VALID [2020-07-29 01:17:25,093 INFO L280 TraceCheckUtils]: 11: Hoare triple {819#(<= getNumbers_~i~0 1)} SUMMARY for call write~int(~i~0, ~array~0.base, ~array~0.offset + 4 * ~i~0, 4); srcloc: L11 {819#(<= getNumbers_~i~0 1)} is VALID [2020-07-29 01:17:25,093 INFO L280 TraceCheckUtils]: 12: Hoare triple {819#(<= getNumbers_~i~0 1)} #t~pre1 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre1; {820#(<= getNumbers_~i~0 2)} is VALID [2020-07-29 01:17:25,094 INFO L280 TraceCheckUtils]: 13: Hoare triple {820#(<= getNumbers_~i~0 2)} assume !!(~i~0 < 10); {820#(<= getNumbers_~i~0 2)} is VALID [2020-07-29 01:17:25,094 INFO L280 TraceCheckUtils]: 14: Hoare triple {820#(<= getNumbers_~i~0 2)} SUMMARY for call write~int(~i~0, ~array~0.base, ~array~0.offset + 4 * ~i~0, 4); srcloc: L11 {820#(<= getNumbers_~i~0 2)} is VALID [2020-07-29 01:17:25,095 INFO L280 TraceCheckUtils]: 15: Hoare triple {820#(<= getNumbers_~i~0 2)} #t~pre1 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre1; {821#(<= getNumbers_~i~0 3)} is VALID [2020-07-29 01:17:25,096 INFO L280 TraceCheckUtils]: 16: Hoare triple {821#(<= getNumbers_~i~0 3)} assume !(~i~0 < 10); {798#false} is VALID [2020-07-29 01:17:25,096 INFO L280 TraceCheckUtils]: 17: Hoare triple {798#false} #res.base, #res.offset := ~array~0.base, ~array~0.offset;call ULTIMATE.dealloc(#t~malloc0.base, #t~malloc0.offset);havoc #t~malloc0.base, #t~malloc0.offset; {798#false} is VALID [2020-07-29 01:17:25,096 INFO L280 TraceCheckUtils]: 18: Hoare triple {798#false} assume true; {798#false} is VALID [2020-07-29 01:17:25,096 INFO L275 TraceCheckUtils]: 19: Hoare quadruple {798#false} {797#true} #51#return; {798#false} is VALID [2020-07-29 01:17:25,096 INFO L280 TraceCheckUtils]: 20: Hoare triple {798#false} ~numbers~0.base, ~numbers~0.offset := #t~ret2.base, #t~ret2.offset;havoc #t~ret2.base, #t~ret2.offset;~i~1 := 0; {798#false} is VALID [2020-07-29 01:17:25,097 INFO L280 TraceCheckUtils]: 21: Hoare triple {798#false} assume !!(~i~1 < 10);havoc #t~nondet4; {798#false} is VALID [2020-07-29 01:17:25,097 INFO L280 TraceCheckUtils]: 22: Hoare triple {798#false} assume !(1 == #valid[~numbers~0.base]); {798#false} is VALID [2020-07-29 01:17:25,098 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:17:25,098 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131127943] [2020-07-29 01:17:25,098 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1989130409] [2020-07-29 01:17:25,099 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-29 01:17:25,139 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-29 01:17:25,139 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-29 01:17:25,140 INFO L263 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-29 01:17:25,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:17:25,156 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:17:25,319 INFO L263 TraceCheckUtils]: 0: Hoare triple {797#true} call ULTIMATE.init(); {797#true} is VALID [2020-07-29 01:17:25,319 INFO L280 TraceCheckUtils]: 1: Hoare triple {797#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(4);call write~init~int(37, #t~string5.base, #t~string5.offset, 1);call write~init~int(100, #t~string5.base, 1 + #t~string5.offset, 1);call write~init~int(10, #t~string5.base, 2 + #t~string5.offset, 1);call write~init~int(0, #t~string5.base, 3 + #t~string5.offset, 1); {797#true} is VALID [2020-07-29 01:17:25,319 INFO L280 TraceCheckUtils]: 2: Hoare triple {797#true} assume true; {797#true} is VALID [2020-07-29 01:17:25,319 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {797#true} {797#true} #47#return; {797#true} is VALID [2020-07-29 01:17:25,320 INFO L263 TraceCheckUtils]: 4: Hoare triple {797#true} call #t~ret7 := main(); {797#true} is VALID [2020-07-29 01:17:25,320 INFO L263 TraceCheckUtils]: 5: Hoare triple {797#true} call #t~ret2.base, #t~ret2.offset := getNumbers(); {797#true} is VALID [2020-07-29 01:17:25,321 INFO L280 TraceCheckUtils]: 6: Hoare triple {797#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnStack(40);~array~0.base, ~array~0.offset := #t~malloc0.base, #t~malloc0.offset;~i~0 := 0; {843#(<= getNumbers_~i~0 0)} is VALID [2020-07-29 01:17:25,322 INFO L280 TraceCheckUtils]: 7: Hoare triple {843#(<= getNumbers_~i~0 0)} assume !!(~i~0 < 10); {843#(<= getNumbers_~i~0 0)} is VALID [2020-07-29 01:17:25,323 INFO L280 TraceCheckUtils]: 8: Hoare triple {843#(<= getNumbers_~i~0 0)} SUMMARY for call write~int(~i~0, ~array~0.base, ~array~0.offset + 4 * ~i~0, 4); srcloc: L11 {843#(<= getNumbers_~i~0 0)} is VALID [2020-07-29 01:17:25,325 INFO L280 TraceCheckUtils]: 9: Hoare triple {843#(<= getNumbers_~i~0 0)} #t~pre1 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre1; {819#(<= getNumbers_~i~0 1)} is VALID [2020-07-29 01:17:25,326 INFO L280 TraceCheckUtils]: 10: Hoare triple {819#(<= getNumbers_~i~0 1)} assume !!(~i~0 < 10); {819#(<= getNumbers_~i~0 1)} is VALID [2020-07-29 01:17:25,326 INFO L280 TraceCheckUtils]: 11: Hoare triple {819#(<= getNumbers_~i~0 1)} SUMMARY for call write~int(~i~0, ~array~0.base, ~array~0.offset + 4 * ~i~0, 4); srcloc: L11 {819#(<= getNumbers_~i~0 1)} is VALID [2020-07-29 01:17:25,327 INFO L280 TraceCheckUtils]: 12: Hoare triple {819#(<= getNumbers_~i~0 1)} #t~pre1 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre1; {820#(<= getNumbers_~i~0 2)} is VALID [2020-07-29 01:17:25,328 INFO L280 TraceCheckUtils]: 13: Hoare triple {820#(<= getNumbers_~i~0 2)} assume !!(~i~0 < 10); {820#(<= getNumbers_~i~0 2)} is VALID [2020-07-29 01:17:25,330 INFO L280 TraceCheckUtils]: 14: Hoare triple {820#(<= getNumbers_~i~0 2)} SUMMARY for call write~int(~i~0, ~array~0.base, ~array~0.offset + 4 * ~i~0, 4); srcloc: L11 {820#(<= getNumbers_~i~0 2)} is VALID [2020-07-29 01:17:25,331 INFO L280 TraceCheckUtils]: 15: Hoare triple {820#(<= getNumbers_~i~0 2)} #t~pre1 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre1; {821#(<= getNumbers_~i~0 3)} is VALID [2020-07-29 01:17:25,332 INFO L280 TraceCheckUtils]: 16: Hoare triple {821#(<= getNumbers_~i~0 3)} assume !(~i~0 < 10); {798#false} is VALID [2020-07-29 01:17:25,333 INFO L280 TraceCheckUtils]: 17: Hoare triple {798#false} #res.base, #res.offset := ~array~0.base, ~array~0.offset;call ULTIMATE.dealloc(#t~malloc0.base, #t~malloc0.offset);havoc #t~malloc0.base, #t~malloc0.offset; {798#false} is VALID [2020-07-29 01:17:25,333 INFO L280 TraceCheckUtils]: 18: Hoare triple {798#false} assume true; {798#false} is VALID [2020-07-29 01:17:25,333 INFO L275 TraceCheckUtils]: 19: Hoare quadruple {798#false} {797#true} #51#return; {798#false} is VALID [2020-07-29 01:17:25,333 INFO L280 TraceCheckUtils]: 20: Hoare triple {798#false} ~numbers~0.base, ~numbers~0.offset := #t~ret2.base, #t~ret2.offset;havoc #t~ret2.base, #t~ret2.offset;~i~1 := 0; {798#false} is VALID [2020-07-29 01:17:25,334 INFO L280 TraceCheckUtils]: 21: Hoare triple {798#false} assume !!(~i~1 < 10);havoc #t~nondet4; {798#false} is VALID [2020-07-29 01:17:25,334 INFO L280 TraceCheckUtils]: 22: Hoare triple {798#false} assume !(1 == #valid[~numbers~0.base]); {798#false} is VALID [2020-07-29 01:17:25,335 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:17:25,336 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-29 01:17:25,336 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 9 [2020-07-29 01:17:25,341 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030496068] [2020-07-29 01:17:25,344 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 23 [2020-07-29 01:17:25,347 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:17:25,349 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2020-07-29 01:17:25,427 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:17:25,427 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-29 01:17:25,428 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:17:25,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-29 01:17:25,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2020-07-29 01:17:25,429 INFO L87 Difference]: Start difference. First operand 30 states and 31 transitions. Second operand 9 states. [2020-07-29 01:17:25,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:17:25,684 INFO L93 Difference]: Finished difference Result 35 states and 36 transitions. [2020-07-29 01:17:25,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-29 01:17:25,684 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 23 [2020-07-29 01:17:25,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:17:25,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-29 01:17:25,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 37 transitions. [2020-07-29 01:17:25,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-29 01:17:25,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 37 transitions. [2020-07-29 01:17:25,689 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 37 transitions. [2020-07-29 01:17:25,738 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:17:25,741 INFO L225 Difference]: With dead ends: 35 [2020-07-29 01:17:25,741 INFO L226 Difference]: Without dead ends: 35 [2020-07-29 01:17:25,742 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2020-07-29 01:17:25,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2020-07-29 01:17:25,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 33. [2020-07-29 01:17:25,745 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:17:25,745 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand 33 states. [2020-07-29 01:17:25,745 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 33 states. [2020-07-29 01:17:25,745 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 33 states. [2020-07-29 01:17:25,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:17:25,747 INFO L93 Difference]: Finished difference Result 35 states and 36 transitions. [2020-07-29 01:17:25,747 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2020-07-29 01:17:25,748 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:17:25,748 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:17:25,748 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 35 states. [2020-07-29 01:17:25,748 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 35 states. [2020-07-29 01:17:25,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:17:25,750 INFO L93 Difference]: Finished difference Result 35 states and 36 transitions. [2020-07-29 01:17:25,750 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2020-07-29 01:17:25,750 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:17:25,750 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:17:25,750 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:17:25,750 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:17:25,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2020-07-29 01:17:25,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2020-07-29 01:17:25,752 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 23 [2020-07-29 01:17:25,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:17:25,752 INFO L479 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2020-07-29 01:17:25,752 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-29 01:17:25,753 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2020-07-29 01:17:25,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-07-29 01:17:25,753 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:17:25,753 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:17:25,967 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-29 01:17:25,968 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2020-07-29 01:17:25,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:17:25,969 INFO L82 PathProgramCache]: Analyzing trace with hash -149204609, now seen corresponding path program 3 times [2020-07-29 01:17:25,969 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:17:25,970 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116357068] [2020-07-29 01:17:25,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:17:25,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:17:26,017 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-07-29 01:17:26,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:17:26,022 INFO L280 TraceCheckUtils]: 0: Hoare triple {1053#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |#t~string5.offset| |old(#t~string5.offset)|) (= |old(#length)| |#length|) (= |#t~string5.base| |old(#t~string5.base)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(4);call write~init~int(37, #t~string5.base, #t~string5.offset, 1);call write~init~int(100, #t~string5.base, 1 + #t~string5.offset, 1);call write~init~int(10, #t~string5.base, 2 + #t~string5.offset, 1);call write~init~int(0, #t~string5.base, 3 + #t~string5.offset, 1); {1031#true} is VALID [2020-07-29 01:17:26,022 INFO L280 TraceCheckUtils]: 1: Hoare triple {1031#true} assume true; {1031#true} is VALID [2020-07-29 01:17:26,022 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1031#true} {1031#true} #47#return; {1031#true} is VALID [2020-07-29 01:17:26,033 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-07-29 01:17:26,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:17:26,113 INFO L280 TraceCheckUtils]: 0: Hoare triple {1054#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnStack(40);~array~0.base, ~array~0.offset := #t~malloc0.base, #t~malloc0.offset;~i~0 := 0; {1055#(= 0 getNumbers_~i~0)} is VALID [2020-07-29 01:17:26,116 INFO L280 TraceCheckUtils]: 1: Hoare triple {1055#(= 0 getNumbers_~i~0)} assume !!(~i~0 < 10); {1055#(= 0 getNumbers_~i~0)} is VALID [2020-07-29 01:17:26,120 INFO L280 TraceCheckUtils]: 2: Hoare triple {1055#(= 0 getNumbers_~i~0)} SUMMARY for call write~int(~i~0, ~array~0.base, ~array~0.offset + 4 * ~i~0, 4); srcloc: L11 {1055#(= 0 getNumbers_~i~0)} is VALID [2020-07-29 01:17:26,121 INFO L280 TraceCheckUtils]: 3: Hoare triple {1055#(= 0 getNumbers_~i~0)} #t~pre1 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre1; {1056#(<= getNumbers_~i~0 1)} is VALID [2020-07-29 01:17:26,122 INFO L280 TraceCheckUtils]: 4: Hoare triple {1056#(<= getNumbers_~i~0 1)} assume !!(~i~0 < 10); {1056#(<= getNumbers_~i~0 1)} is VALID [2020-07-29 01:17:26,123 INFO L280 TraceCheckUtils]: 5: Hoare triple {1056#(<= getNumbers_~i~0 1)} SUMMARY for call write~int(~i~0, ~array~0.base, ~array~0.offset + 4 * ~i~0, 4); srcloc: L11 {1056#(<= getNumbers_~i~0 1)} is VALID [2020-07-29 01:17:26,124 INFO L280 TraceCheckUtils]: 6: Hoare triple {1056#(<= getNumbers_~i~0 1)} #t~pre1 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre1; {1057#(<= getNumbers_~i~0 2)} is VALID [2020-07-29 01:17:26,125 INFO L280 TraceCheckUtils]: 7: Hoare triple {1057#(<= getNumbers_~i~0 2)} assume !!(~i~0 < 10); {1057#(<= getNumbers_~i~0 2)} is VALID [2020-07-29 01:17:26,125 INFO L280 TraceCheckUtils]: 8: Hoare triple {1057#(<= getNumbers_~i~0 2)} SUMMARY for call write~int(~i~0, ~array~0.base, ~array~0.offset + 4 * ~i~0, 4); srcloc: L11 {1057#(<= getNumbers_~i~0 2)} is VALID [2020-07-29 01:17:26,126 INFO L280 TraceCheckUtils]: 9: Hoare triple {1057#(<= getNumbers_~i~0 2)} #t~pre1 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre1; {1058#(<= getNumbers_~i~0 3)} is VALID [2020-07-29 01:17:26,127 INFO L280 TraceCheckUtils]: 10: Hoare triple {1058#(<= getNumbers_~i~0 3)} assume !!(~i~0 < 10); {1058#(<= getNumbers_~i~0 3)} is VALID [2020-07-29 01:17:26,128 INFO L280 TraceCheckUtils]: 11: Hoare triple {1058#(<= getNumbers_~i~0 3)} SUMMARY for call write~int(~i~0, ~array~0.base, ~array~0.offset + 4 * ~i~0, 4); srcloc: L11 {1058#(<= getNumbers_~i~0 3)} is VALID [2020-07-29 01:17:26,129 INFO L280 TraceCheckUtils]: 12: Hoare triple {1058#(<= getNumbers_~i~0 3)} #t~pre1 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre1; {1059#(<= getNumbers_~i~0 4)} is VALID [2020-07-29 01:17:26,129 INFO L280 TraceCheckUtils]: 13: Hoare triple {1059#(<= getNumbers_~i~0 4)} assume !(~i~0 < 10); {1032#false} is VALID [2020-07-29 01:17:26,130 INFO L280 TraceCheckUtils]: 14: Hoare triple {1032#false} #res.base, #res.offset := ~array~0.base, ~array~0.offset;call ULTIMATE.dealloc(#t~malloc0.base, #t~malloc0.offset);havoc #t~malloc0.base, #t~malloc0.offset; {1032#false} is VALID [2020-07-29 01:17:26,130 INFO L280 TraceCheckUtils]: 15: Hoare triple {1032#false} assume true; {1032#false} is VALID [2020-07-29 01:17:26,130 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {1032#false} {1031#true} #51#return; {1032#false} is VALID [2020-07-29 01:17:26,132 INFO L263 TraceCheckUtils]: 0: Hoare triple {1031#true} call ULTIMATE.init(); {1053#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |#t~string5.offset| |old(#t~string5.offset)|) (= |old(#length)| |#length|) (= |#t~string5.base| |old(#t~string5.base)|))} is VALID [2020-07-29 01:17:26,133 INFO L280 TraceCheckUtils]: 1: Hoare triple {1053#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |#t~string5.offset| |old(#t~string5.offset)|) (= |old(#length)| |#length|) (= |#t~string5.base| |old(#t~string5.base)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(4);call write~init~int(37, #t~string5.base, #t~string5.offset, 1);call write~init~int(100, #t~string5.base, 1 + #t~string5.offset, 1);call write~init~int(10, #t~string5.base, 2 + #t~string5.offset, 1);call write~init~int(0, #t~string5.base, 3 + #t~string5.offset, 1); {1031#true} is VALID [2020-07-29 01:17:26,133 INFO L280 TraceCheckUtils]: 2: Hoare triple {1031#true} assume true; {1031#true} is VALID [2020-07-29 01:17:26,133 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1031#true} {1031#true} #47#return; {1031#true} is VALID [2020-07-29 01:17:26,133 INFO L263 TraceCheckUtils]: 4: Hoare triple {1031#true} call #t~ret7 := main(); {1031#true} is VALID [2020-07-29 01:17:26,134 INFO L263 TraceCheckUtils]: 5: Hoare triple {1031#true} call #t~ret2.base, #t~ret2.offset := getNumbers(); {1054#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-29 01:17:26,135 INFO L280 TraceCheckUtils]: 6: Hoare triple {1054#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnStack(40);~array~0.base, ~array~0.offset := #t~malloc0.base, #t~malloc0.offset;~i~0 := 0; {1055#(= 0 getNumbers_~i~0)} is VALID [2020-07-29 01:17:26,136 INFO L280 TraceCheckUtils]: 7: Hoare triple {1055#(= 0 getNumbers_~i~0)} assume !!(~i~0 < 10); {1055#(= 0 getNumbers_~i~0)} is VALID [2020-07-29 01:17:26,137 INFO L280 TraceCheckUtils]: 8: Hoare triple {1055#(= 0 getNumbers_~i~0)} SUMMARY for call write~int(~i~0, ~array~0.base, ~array~0.offset + 4 * ~i~0, 4); srcloc: L11 {1055#(= 0 getNumbers_~i~0)} is VALID [2020-07-29 01:17:26,137 INFO L280 TraceCheckUtils]: 9: Hoare triple {1055#(= 0 getNumbers_~i~0)} #t~pre1 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre1; {1056#(<= getNumbers_~i~0 1)} is VALID [2020-07-29 01:17:26,138 INFO L280 TraceCheckUtils]: 10: Hoare triple {1056#(<= getNumbers_~i~0 1)} assume !!(~i~0 < 10); {1056#(<= getNumbers_~i~0 1)} is VALID [2020-07-29 01:17:26,139 INFO L280 TraceCheckUtils]: 11: Hoare triple {1056#(<= getNumbers_~i~0 1)} SUMMARY for call write~int(~i~0, ~array~0.base, ~array~0.offset + 4 * ~i~0, 4); srcloc: L11 {1056#(<= getNumbers_~i~0 1)} is VALID [2020-07-29 01:17:26,140 INFO L280 TraceCheckUtils]: 12: Hoare triple {1056#(<= getNumbers_~i~0 1)} #t~pre1 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre1; {1057#(<= getNumbers_~i~0 2)} is VALID [2020-07-29 01:17:26,140 INFO L280 TraceCheckUtils]: 13: Hoare triple {1057#(<= getNumbers_~i~0 2)} assume !!(~i~0 < 10); {1057#(<= getNumbers_~i~0 2)} is VALID [2020-07-29 01:17:26,141 INFO L280 TraceCheckUtils]: 14: Hoare triple {1057#(<= getNumbers_~i~0 2)} SUMMARY for call write~int(~i~0, ~array~0.base, ~array~0.offset + 4 * ~i~0, 4); srcloc: L11 {1057#(<= getNumbers_~i~0 2)} is VALID [2020-07-29 01:17:26,142 INFO L280 TraceCheckUtils]: 15: Hoare triple {1057#(<= getNumbers_~i~0 2)} #t~pre1 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre1; {1058#(<= getNumbers_~i~0 3)} is VALID [2020-07-29 01:17:26,143 INFO L280 TraceCheckUtils]: 16: Hoare triple {1058#(<= getNumbers_~i~0 3)} assume !!(~i~0 < 10); {1058#(<= getNumbers_~i~0 3)} is VALID [2020-07-29 01:17:26,143 INFO L280 TraceCheckUtils]: 17: Hoare triple {1058#(<= getNumbers_~i~0 3)} SUMMARY for call write~int(~i~0, ~array~0.base, ~array~0.offset + 4 * ~i~0, 4); srcloc: L11 {1058#(<= getNumbers_~i~0 3)} is VALID [2020-07-29 01:17:26,144 INFO L280 TraceCheckUtils]: 18: Hoare triple {1058#(<= getNumbers_~i~0 3)} #t~pre1 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre1; {1059#(<= getNumbers_~i~0 4)} is VALID [2020-07-29 01:17:26,145 INFO L280 TraceCheckUtils]: 19: Hoare triple {1059#(<= getNumbers_~i~0 4)} assume !(~i~0 < 10); {1032#false} is VALID [2020-07-29 01:17:26,145 INFO L280 TraceCheckUtils]: 20: Hoare triple {1032#false} #res.base, #res.offset := ~array~0.base, ~array~0.offset;call ULTIMATE.dealloc(#t~malloc0.base, #t~malloc0.offset);havoc #t~malloc0.base, #t~malloc0.offset; {1032#false} is VALID [2020-07-29 01:17:26,145 INFO L280 TraceCheckUtils]: 21: Hoare triple {1032#false} assume true; {1032#false} is VALID [2020-07-29 01:17:26,146 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {1032#false} {1031#true} #51#return; {1032#false} is VALID [2020-07-29 01:17:26,146 INFO L280 TraceCheckUtils]: 23: Hoare triple {1032#false} ~numbers~0.base, ~numbers~0.offset := #t~ret2.base, #t~ret2.offset;havoc #t~ret2.base, #t~ret2.offset;~i~1 := 0; {1032#false} is VALID [2020-07-29 01:17:26,146 INFO L280 TraceCheckUtils]: 24: Hoare triple {1032#false} assume !!(~i~1 < 10);havoc #t~nondet4; {1032#false} is VALID [2020-07-29 01:17:26,146 INFO L280 TraceCheckUtils]: 25: Hoare triple {1032#false} assume !(1 == #valid[~numbers~0.base]); {1032#false} is VALID [2020-07-29 01:17:26,148 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:17:26,148 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116357068] [2020-07-29 01:17:26,148 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1085366112] [2020-07-29 01:17:26,149 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-29 01:17:26,200 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2020-07-29 01:17:26,201 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-29 01:17:26,202 INFO L263 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-29 01:17:26,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:17:26,212 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:17:26,356 INFO L263 TraceCheckUtils]: 0: Hoare triple {1031#true} call ULTIMATE.init(); {1031#true} is VALID [2020-07-29 01:17:26,356 INFO L280 TraceCheckUtils]: 1: Hoare triple {1031#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(4);call write~init~int(37, #t~string5.base, #t~string5.offset, 1);call write~init~int(100, #t~string5.base, 1 + #t~string5.offset, 1);call write~init~int(10, #t~string5.base, 2 + #t~string5.offset, 1);call write~init~int(0, #t~string5.base, 3 + #t~string5.offset, 1); {1031#true} is VALID [2020-07-29 01:17:26,356 INFO L280 TraceCheckUtils]: 2: Hoare triple {1031#true} assume true; {1031#true} is VALID [2020-07-29 01:17:26,357 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1031#true} {1031#true} #47#return; {1031#true} is VALID [2020-07-29 01:17:26,357 INFO L263 TraceCheckUtils]: 4: Hoare triple {1031#true} call #t~ret7 := main(); {1031#true} is VALID [2020-07-29 01:17:26,357 INFO L263 TraceCheckUtils]: 5: Hoare triple {1031#true} call #t~ret2.base, #t~ret2.offset := getNumbers(); {1031#true} is VALID [2020-07-29 01:17:26,359 INFO L280 TraceCheckUtils]: 6: Hoare triple {1031#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnStack(40);~array~0.base, ~array~0.offset := #t~malloc0.base, #t~malloc0.offset;~i~0 := 0; {1081#(<= getNumbers_~i~0 0)} is VALID [2020-07-29 01:17:26,359 INFO L280 TraceCheckUtils]: 7: Hoare triple {1081#(<= getNumbers_~i~0 0)} assume !!(~i~0 < 10); {1081#(<= getNumbers_~i~0 0)} is VALID [2020-07-29 01:17:26,364 INFO L280 TraceCheckUtils]: 8: Hoare triple {1081#(<= getNumbers_~i~0 0)} SUMMARY for call write~int(~i~0, ~array~0.base, ~array~0.offset + 4 * ~i~0, 4); srcloc: L11 {1081#(<= getNumbers_~i~0 0)} is VALID [2020-07-29 01:17:26,366 INFO L280 TraceCheckUtils]: 9: Hoare triple {1081#(<= getNumbers_~i~0 0)} #t~pre1 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre1; {1056#(<= getNumbers_~i~0 1)} is VALID [2020-07-29 01:17:26,367 INFO L280 TraceCheckUtils]: 10: Hoare triple {1056#(<= getNumbers_~i~0 1)} assume !!(~i~0 < 10); {1056#(<= getNumbers_~i~0 1)} is VALID [2020-07-29 01:17:26,368 INFO L280 TraceCheckUtils]: 11: Hoare triple {1056#(<= getNumbers_~i~0 1)} SUMMARY for call write~int(~i~0, ~array~0.base, ~array~0.offset + 4 * ~i~0, 4); srcloc: L11 {1056#(<= getNumbers_~i~0 1)} is VALID [2020-07-29 01:17:26,368 INFO L280 TraceCheckUtils]: 12: Hoare triple {1056#(<= getNumbers_~i~0 1)} #t~pre1 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre1; {1057#(<= getNumbers_~i~0 2)} is VALID [2020-07-29 01:17:26,369 INFO L280 TraceCheckUtils]: 13: Hoare triple {1057#(<= getNumbers_~i~0 2)} assume !!(~i~0 < 10); {1057#(<= getNumbers_~i~0 2)} is VALID [2020-07-29 01:17:26,369 INFO L280 TraceCheckUtils]: 14: Hoare triple {1057#(<= getNumbers_~i~0 2)} SUMMARY for call write~int(~i~0, ~array~0.base, ~array~0.offset + 4 * ~i~0, 4); srcloc: L11 {1057#(<= getNumbers_~i~0 2)} is VALID [2020-07-29 01:17:26,370 INFO L280 TraceCheckUtils]: 15: Hoare triple {1057#(<= getNumbers_~i~0 2)} #t~pre1 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre1; {1058#(<= getNumbers_~i~0 3)} is VALID [2020-07-29 01:17:26,371 INFO L280 TraceCheckUtils]: 16: Hoare triple {1058#(<= getNumbers_~i~0 3)} assume !!(~i~0 < 10); {1058#(<= getNumbers_~i~0 3)} is VALID [2020-07-29 01:17:26,371 INFO L280 TraceCheckUtils]: 17: Hoare triple {1058#(<= getNumbers_~i~0 3)} SUMMARY for call write~int(~i~0, ~array~0.base, ~array~0.offset + 4 * ~i~0, 4); srcloc: L11 {1058#(<= getNumbers_~i~0 3)} is VALID [2020-07-29 01:17:26,372 INFO L280 TraceCheckUtils]: 18: Hoare triple {1058#(<= getNumbers_~i~0 3)} #t~pre1 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre1; {1059#(<= getNumbers_~i~0 4)} is VALID [2020-07-29 01:17:26,373 INFO L280 TraceCheckUtils]: 19: Hoare triple {1059#(<= getNumbers_~i~0 4)} assume !(~i~0 < 10); {1032#false} is VALID [2020-07-29 01:17:26,373 INFO L280 TraceCheckUtils]: 20: Hoare triple {1032#false} #res.base, #res.offset := ~array~0.base, ~array~0.offset;call ULTIMATE.dealloc(#t~malloc0.base, #t~malloc0.offset);havoc #t~malloc0.base, #t~malloc0.offset; {1032#false} is VALID [2020-07-29 01:17:26,373 INFO L280 TraceCheckUtils]: 21: Hoare triple {1032#false} assume true; {1032#false} is VALID [2020-07-29 01:17:26,374 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {1032#false} {1031#true} #51#return; {1032#false} is VALID [2020-07-29 01:17:26,374 INFO L280 TraceCheckUtils]: 23: Hoare triple {1032#false} ~numbers~0.base, ~numbers~0.offset := #t~ret2.base, #t~ret2.offset;havoc #t~ret2.base, #t~ret2.offset;~i~1 := 0; {1032#false} is VALID [2020-07-29 01:17:26,374 INFO L280 TraceCheckUtils]: 24: Hoare triple {1032#false} assume !!(~i~1 < 10);havoc #t~nondet4; {1032#false} is VALID [2020-07-29 01:17:26,374 INFO L280 TraceCheckUtils]: 25: Hoare triple {1032#false} assume !(1 == #valid[~numbers~0.base]); {1032#false} is VALID [2020-07-29 01:17:26,380 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:17:26,381 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-29 01:17:26,381 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 10 [2020-07-29 01:17:26,381 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63424530] [2020-07-29 01:17:26,382 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 26 [2020-07-29 01:17:26,382 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:17:26,383 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2020-07-29 01:17:26,431 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:17:26,431 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-29 01:17:26,431 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:17:26,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-29 01:17:26,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2020-07-29 01:17:26,432 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand 10 states. [2020-07-29 01:17:26,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:17:26,725 INFO L93 Difference]: Finished difference Result 38 states and 39 transitions. [2020-07-29 01:17:26,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-29 01:17:26,726 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 26 [2020-07-29 01:17:26,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:17:26,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-29 01:17:26,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 40 transitions. [2020-07-29 01:17:26,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-29 01:17:26,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 40 transitions. [2020-07-29 01:17:26,730 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 40 transitions. [2020-07-29 01:17:26,795 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:17:26,797 INFO L225 Difference]: With dead ends: 38 [2020-07-29 01:17:26,797 INFO L226 Difference]: Without dead ends: 38 [2020-07-29 01:17:26,797 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2020-07-29 01:17:26,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2020-07-29 01:17:26,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 36. [2020-07-29 01:17:26,802 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:17:26,802 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand 36 states. [2020-07-29 01:17:26,802 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 36 states. [2020-07-29 01:17:26,802 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 36 states. [2020-07-29 01:17:26,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:17:26,804 INFO L93 Difference]: Finished difference Result 38 states and 39 transitions. [2020-07-29 01:17:26,804 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 39 transitions. [2020-07-29 01:17:26,807 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:17:26,807 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:17:26,807 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 38 states. [2020-07-29 01:17:26,807 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 38 states. [2020-07-29 01:17:26,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:17:26,811 INFO L93 Difference]: Finished difference Result 38 states and 39 transitions. [2020-07-29 01:17:26,811 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 39 transitions. [2020-07-29 01:17:26,813 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:17:26,813 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:17:26,813 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:17:26,813 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:17:26,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2020-07-29 01:17:26,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 37 transitions. [2020-07-29 01:17:26,815 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 37 transitions. Word has length 26 [2020-07-29 01:17:26,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:17:26,815 INFO L479 AbstractCegarLoop]: Abstraction has 36 states and 37 transitions. [2020-07-29 01:17:26,815 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-29 01:17:26,816 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 37 transitions. [2020-07-29 01:17:26,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-07-29 01:17:26,816 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:17:26,816 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:17:27,019 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2020-07-29 01:17:27,020 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2020-07-29 01:17:27,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:17:27,021 INFO L82 PathProgramCache]: Analyzing trace with hash -578344216, now seen corresponding path program 4 times [2020-07-29 01:17:27,022 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:17:27,022 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040513828] [2020-07-29 01:17:27,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:17:27,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:17:27,075 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-07-29 01:17:27,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:17:27,093 INFO L280 TraceCheckUtils]: 0: Hoare triple {1315#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |#t~string5.offset| |old(#t~string5.offset)|) (= |old(#length)| |#length|) (= |#t~string5.base| |old(#t~string5.base)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(4);call write~init~int(37, #t~string5.base, #t~string5.offset, 1);call write~init~int(100, #t~string5.base, 1 + #t~string5.offset, 1);call write~init~int(10, #t~string5.base, 2 + #t~string5.offset, 1);call write~init~int(0, #t~string5.base, 3 + #t~string5.offset, 1); {1290#true} is VALID [2020-07-29 01:17:27,094 INFO L280 TraceCheckUtils]: 1: Hoare triple {1290#true} assume true; {1290#true} is VALID [2020-07-29 01:17:27,094 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1290#true} {1290#true} #47#return; {1290#true} is VALID [2020-07-29 01:17:27,106 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-07-29 01:17:27,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:17:27,226 INFO L280 TraceCheckUtils]: 0: Hoare triple {1316#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnStack(40);~array~0.base, ~array~0.offset := #t~malloc0.base, #t~malloc0.offset;~i~0 := 0; {1317#(= 0 getNumbers_~i~0)} is VALID [2020-07-29 01:17:27,227 INFO L280 TraceCheckUtils]: 1: Hoare triple {1317#(= 0 getNumbers_~i~0)} assume !!(~i~0 < 10); {1317#(= 0 getNumbers_~i~0)} is VALID [2020-07-29 01:17:27,228 INFO L280 TraceCheckUtils]: 2: Hoare triple {1317#(= 0 getNumbers_~i~0)} SUMMARY for call write~int(~i~0, ~array~0.base, ~array~0.offset + 4 * ~i~0, 4); srcloc: L11 {1317#(= 0 getNumbers_~i~0)} is VALID [2020-07-29 01:17:27,229 INFO L280 TraceCheckUtils]: 3: Hoare triple {1317#(= 0 getNumbers_~i~0)} #t~pre1 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre1; {1318#(<= getNumbers_~i~0 1)} is VALID [2020-07-29 01:17:27,230 INFO L280 TraceCheckUtils]: 4: Hoare triple {1318#(<= getNumbers_~i~0 1)} assume !!(~i~0 < 10); {1318#(<= getNumbers_~i~0 1)} is VALID [2020-07-29 01:17:27,230 INFO L280 TraceCheckUtils]: 5: Hoare triple {1318#(<= getNumbers_~i~0 1)} SUMMARY for call write~int(~i~0, ~array~0.base, ~array~0.offset + 4 * ~i~0, 4); srcloc: L11 {1318#(<= getNumbers_~i~0 1)} is VALID [2020-07-29 01:17:27,232 INFO L280 TraceCheckUtils]: 6: Hoare triple {1318#(<= getNumbers_~i~0 1)} #t~pre1 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre1; {1319#(<= getNumbers_~i~0 2)} is VALID [2020-07-29 01:17:27,232 INFO L280 TraceCheckUtils]: 7: Hoare triple {1319#(<= getNumbers_~i~0 2)} assume !!(~i~0 < 10); {1319#(<= getNumbers_~i~0 2)} is VALID [2020-07-29 01:17:27,233 INFO L280 TraceCheckUtils]: 8: Hoare triple {1319#(<= getNumbers_~i~0 2)} SUMMARY for call write~int(~i~0, ~array~0.base, ~array~0.offset + 4 * ~i~0, 4); srcloc: L11 {1319#(<= getNumbers_~i~0 2)} is VALID [2020-07-29 01:17:27,234 INFO L280 TraceCheckUtils]: 9: Hoare triple {1319#(<= getNumbers_~i~0 2)} #t~pre1 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre1; {1320#(<= getNumbers_~i~0 3)} is VALID [2020-07-29 01:17:27,235 INFO L280 TraceCheckUtils]: 10: Hoare triple {1320#(<= getNumbers_~i~0 3)} assume !!(~i~0 < 10); {1320#(<= getNumbers_~i~0 3)} is VALID [2020-07-29 01:17:27,236 INFO L280 TraceCheckUtils]: 11: Hoare triple {1320#(<= getNumbers_~i~0 3)} SUMMARY for call write~int(~i~0, ~array~0.base, ~array~0.offset + 4 * ~i~0, 4); srcloc: L11 {1320#(<= getNumbers_~i~0 3)} is VALID [2020-07-29 01:17:27,237 INFO L280 TraceCheckUtils]: 12: Hoare triple {1320#(<= getNumbers_~i~0 3)} #t~pre1 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre1; {1321#(<= getNumbers_~i~0 4)} is VALID [2020-07-29 01:17:27,238 INFO L280 TraceCheckUtils]: 13: Hoare triple {1321#(<= getNumbers_~i~0 4)} assume !!(~i~0 < 10); {1321#(<= getNumbers_~i~0 4)} is VALID [2020-07-29 01:17:27,239 INFO L280 TraceCheckUtils]: 14: Hoare triple {1321#(<= getNumbers_~i~0 4)} SUMMARY for call write~int(~i~0, ~array~0.base, ~array~0.offset + 4 * ~i~0, 4); srcloc: L11 {1321#(<= getNumbers_~i~0 4)} is VALID [2020-07-29 01:17:27,240 INFO L280 TraceCheckUtils]: 15: Hoare triple {1321#(<= getNumbers_~i~0 4)} #t~pre1 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre1; {1322#(<= getNumbers_~i~0 5)} is VALID [2020-07-29 01:17:27,241 INFO L280 TraceCheckUtils]: 16: Hoare triple {1322#(<= getNumbers_~i~0 5)} assume !(~i~0 < 10); {1291#false} is VALID [2020-07-29 01:17:27,241 INFO L280 TraceCheckUtils]: 17: Hoare triple {1291#false} #res.base, #res.offset := ~array~0.base, ~array~0.offset;call ULTIMATE.dealloc(#t~malloc0.base, #t~malloc0.offset);havoc #t~malloc0.base, #t~malloc0.offset; {1291#false} is VALID [2020-07-29 01:17:27,241 INFO L280 TraceCheckUtils]: 18: Hoare triple {1291#false} assume true; {1291#false} is VALID [2020-07-29 01:17:27,242 INFO L275 TraceCheckUtils]: 19: Hoare quadruple {1291#false} {1290#true} #51#return; {1291#false} is VALID [2020-07-29 01:17:27,245 INFO L263 TraceCheckUtils]: 0: Hoare triple {1290#true} call ULTIMATE.init(); {1315#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |#t~string5.offset| |old(#t~string5.offset)|) (= |old(#length)| |#length|) (= |#t~string5.base| |old(#t~string5.base)|))} is VALID [2020-07-29 01:17:27,246 INFO L280 TraceCheckUtils]: 1: Hoare triple {1315#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |#t~string5.offset| |old(#t~string5.offset)|) (= |old(#length)| |#length|) (= |#t~string5.base| |old(#t~string5.base)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(4);call write~init~int(37, #t~string5.base, #t~string5.offset, 1);call write~init~int(100, #t~string5.base, 1 + #t~string5.offset, 1);call write~init~int(10, #t~string5.base, 2 + #t~string5.offset, 1);call write~init~int(0, #t~string5.base, 3 + #t~string5.offset, 1); {1290#true} is VALID [2020-07-29 01:17:27,246 INFO L280 TraceCheckUtils]: 2: Hoare triple {1290#true} assume true; {1290#true} is VALID [2020-07-29 01:17:27,247 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1290#true} {1290#true} #47#return; {1290#true} is VALID [2020-07-29 01:17:27,247 INFO L263 TraceCheckUtils]: 4: Hoare triple {1290#true} call #t~ret7 := main(); {1290#true} is VALID [2020-07-29 01:17:27,249 INFO L263 TraceCheckUtils]: 5: Hoare triple {1290#true} call #t~ret2.base, #t~ret2.offset := getNumbers(); {1316#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-29 01:17:27,251 INFO L280 TraceCheckUtils]: 6: Hoare triple {1316#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnStack(40);~array~0.base, ~array~0.offset := #t~malloc0.base, #t~malloc0.offset;~i~0 := 0; {1317#(= 0 getNumbers_~i~0)} is VALID [2020-07-29 01:17:27,252 INFO L280 TraceCheckUtils]: 7: Hoare triple {1317#(= 0 getNumbers_~i~0)} assume !!(~i~0 < 10); {1317#(= 0 getNumbers_~i~0)} is VALID [2020-07-29 01:17:27,253 INFO L280 TraceCheckUtils]: 8: Hoare triple {1317#(= 0 getNumbers_~i~0)} SUMMARY for call write~int(~i~0, ~array~0.base, ~array~0.offset + 4 * ~i~0, 4); srcloc: L11 {1317#(= 0 getNumbers_~i~0)} is VALID [2020-07-29 01:17:27,253 INFO L280 TraceCheckUtils]: 9: Hoare triple {1317#(= 0 getNumbers_~i~0)} #t~pre1 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre1; {1318#(<= getNumbers_~i~0 1)} is VALID [2020-07-29 01:17:27,256 INFO L280 TraceCheckUtils]: 10: Hoare triple {1318#(<= getNumbers_~i~0 1)} assume !!(~i~0 < 10); {1318#(<= getNumbers_~i~0 1)} is VALID [2020-07-29 01:17:27,256 INFO L280 TraceCheckUtils]: 11: Hoare triple {1318#(<= getNumbers_~i~0 1)} SUMMARY for call write~int(~i~0, ~array~0.base, ~array~0.offset + 4 * ~i~0, 4); srcloc: L11 {1318#(<= getNumbers_~i~0 1)} is VALID [2020-07-29 01:17:27,257 INFO L280 TraceCheckUtils]: 12: Hoare triple {1318#(<= getNumbers_~i~0 1)} #t~pre1 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre1; {1319#(<= getNumbers_~i~0 2)} is VALID [2020-07-29 01:17:27,258 INFO L280 TraceCheckUtils]: 13: Hoare triple {1319#(<= getNumbers_~i~0 2)} assume !!(~i~0 < 10); {1319#(<= getNumbers_~i~0 2)} is VALID [2020-07-29 01:17:27,259 INFO L280 TraceCheckUtils]: 14: Hoare triple {1319#(<= getNumbers_~i~0 2)} SUMMARY for call write~int(~i~0, ~array~0.base, ~array~0.offset + 4 * ~i~0, 4); srcloc: L11 {1319#(<= getNumbers_~i~0 2)} is VALID [2020-07-29 01:17:27,260 INFO L280 TraceCheckUtils]: 15: Hoare triple {1319#(<= getNumbers_~i~0 2)} #t~pre1 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre1; {1320#(<= getNumbers_~i~0 3)} is VALID [2020-07-29 01:17:27,261 INFO L280 TraceCheckUtils]: 16: Hoare triple {1320#(<= getNumbers_~i~0 3)} assume !!(~i~0 < 10); {1320#(<= getNumbers_~i~0 3)} is VALID [2020-07-29 01:17:27,262 INFO L280 TraceCheckUtils]: 17: Hoare triple {1320#(<= getNumbers_~i~0 3)} SUMMARY for call write~int(~i~0, ~array~0.base, ~array~0.offset + 4 * ~i~0, 4); srcloc: L11 {1320#(<= getNumbers_~i~0 3)} is VALID [2020-07-29 01:17:27,262 INFO L280 TraceCheckUtils]: 18: Hoare triple {1320#(<= getNumbers_~i~0 3)} #t~pre1 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre1; {1321#(<= getNumbers_~i~0 4)} is VALID [2020-07-29 01:17:27,263 INFO L280 TraceCheckUtils]: 19: Hoare triple {1321#(<= getNumbers_~i~0 4)} assume !!(~i~0 < 10); {1321#(<= getNumbers_~i~0 4)} is VALID [2020-07-29 01:17:27,264 INFO L280 TraceCheckUtils]: 20: Hoare triple {1321#(<= getNumbers_~i~0 4)} SUMMARY for call write~int(~i~0, ~array~0.base, ~array~0.offset + 4 * ~i~0, 4); srcloc: L11 {1321#(<= getNumbers_~i~0 4)} is VALID [2020-07-29 01:17:27,265 INFO L280 TraceCheckUtils]: 21: Hoare triple {1321#(<= getNumbers_~i~0 4)} #t~pre1 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre1; {1322#(<= getNumbers_~i~0 5)} is VALID [2020-07-29 01:17:27,266 INFO L280 TraceCheckUtils]: 22: Hoare triple {1322#(<= getNumbers_~i~0 5)} assume !(~i~0 < 10); {1291#false} is VALID [2020-07-29 01:17:27,266 INFO L280 TraceCheckUtils]: 23: Hoare triple {1291#false} #res.base, #res.offset := ~array~0.base, ~array~0.offset;call ULTIMATE.dealloc(#t~malloc0.base, #t~malloc0.offset);havoc #t~malloc0.base, #t~malloc0.offset; {1291#false} is VALID [2020-07-29 01:17:27,267 INFO L280 TraceCheckUtils]: 24: Hoare triple {1291#false} assume true; {1291#false} is VALID [2020-07-29 01:17:27,267 INFO L275 TraceCheckUtils]: 25: Hoare quadruple {1291#false} {1290#true} #51#return; {1291#false} is VALID [2020-07-29 01:17:27,267 INFO L280 TraceCheckUtils]: 26: Hoare triple {1291#false} ~numbers~0.base, ~numbers~0.offset := #t~ret2.base, #t~ret2.offset;havoc #t~ret2.base, #t~ret2.offset;~i~1 := 0; {1291#false} is VALID [2020-07-29 01:17:27,267 INFO L280 TraceCheckUtils]: 27: Hoare triple {1291#false} assume !!(~i~1 < 10);havoc #t~nondet4; {1291#false} is VALID [2020-07-29 01:17:27,268 INFO L280 TraceCheckUtils]: 28: Hoare triple {1291#false} assume !(1 == #valid[~numbers~0.base]); {1291#false} is VALID [2020-07-29 01:17:27,288 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:17:27,289 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040513828] [2020-07-29 01:17:27,290 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1719613067] [2020-07-29 01:17:27,290 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-29 01:17:27,361 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-07-29 01:17:27,362 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-29 01:17:27,363 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-29 01:17:27,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:17:27,378 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:17:27,565 INFO L263 TraceCheckUtils]: 0: Hoare triple {1290#true} call ULTIMATE.init(); {1290#true} is VALID [2020-07-29 01:17:27,566 INFO L280 TraceCheckUtils]: 1: Hoare triple {1290#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(4);call write~init~int(37, #t~string5.base, #t~string5.offset, 1);call write~init~int(100, #t~string5.base, 1 + #t~string5.offset, 1);call write~init~int(10, #t~string5.base, 2 + #t~string5.offset, 1);call write~init~int(0, #t~string5.base, 3 + #t~string5.offset, 1); {1290#true} is VALID [2020-07-29 01:17:27,566 INFO L280 TraceCheckUtils]: 2: Hoare triple {1290#true} assume true; {1290#true} is VALID [2020-07-29 01:17:27,566 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1290#true} {1290#true} #47#return; {1290#true} is VALID [2020-07-29 01:17:27,566 INFO L263 TraceCheckUtils]: 4: Hoare triple {1290#true} call #t~ret7 := main(); {1290#true} is VALID [2020-07-29 01:17:27,566 INFO L263 TraceCheckUtils]: 5: Hoare triple {1290#true} call #t~ret2.base, #t~ret2.offset := getNumbers(); {1290#true} is VALID [2020-07-29 01:17:27,568 INFO L280 TraceCheckUtils]: 6: Hoare triple {1290#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnStack(40);~array~0.base, ~array~0.offset := #t~malloc0.base, #t~malloc0.offset;~i~0 := 0; {1344#(<= getNumbers_~i~0 0)} is VALID [2020-07-29 01:17:27,569 INFO L280 TraceCheckUtils]: 7: Hoare triple {1344#(<= getNumbers_~i~0 0)} assume !!(~i~0 < 10); {1344#(<= getNumbers_~i~0 0)} is VALID [2020-07-29 01:17:27,569 INFO L280 TraceCheckUtils]: 8: Hoare triple {1344#(<= getNumbers_~i~0 0)} SUMMARY for call write~int(~i~0, ~array~0.base, ~array~0.offset + 4 * ~i~0, 4); srcloc: L11 {1344#(<= getNumbers_~i~0 0)} is VALID [2020-07-29 01:17:27,570 INFO L280 TraceCheckUtils]: 9: Hoare triple {1344#(<= getNumbers_~i~0 0)} #t~pre1 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre1; {1318#(<= getNumbers_~i~0 1)} is VALID [2020-07-29 01:17:27,571 INFO L280 TraceCheckUtils]: 10: Hoare triple {1318#(<= getNumbers_~i~0 1)} assume !!(~i~0 < 10); {1318#(<= getNumbers_~i~0 1)} is VALID [2020-07-29 01:17:27,572 INFO L280 TraceCheckUtils]: 11: Hoare triple {1318#(<= getNumbers_~i~0 1)} SUMMARY for call write~int(~i~0, ~array~0.base, ~array~0.offset + 4 * ~i~0, 4); srcloc: L11 {1318#(<= getNumbers_~i~0 1)} is VALID [2020-07-29 01:17:27,573 INFO L280 TraceCheckUtils]: 12: Hoare triple {1318#(<= getNumbers_~i~0 1)} #t~pre1 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre1; {1319#(<= getNumbers_~i~0 2)} is VALID [2020-07-29 01:17:27,574 INFO L280 TraceCheckUtils]: 13: Hoare triple {1319#(<= getNumbers_~i~0 2)} assume !!(~i~0 < 10); {1319#(<= getNumbers_~i~0 2)} is VALID [2020-07-29 01:17:27,575 INFO L280 TraceCheckUtils]: 14: Hoare triple {1319#(<= getNumbers_~i~0 2)} SUMMARY for call write~int(~i~0, ~array~0.base, ~array~0.offset + 4 * ~i~0, 4); srcloc: L11 {1319#(<= getNumbers_~i~0 2)} is VALID [2020-07-29 01:17:27,577 INFO L280 TraceCheckUtils]: 15: Hoare triple {1319#(<= getNumbers_~i~0 2)} #t~pre1 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre1; {1320#(<= getNumbers_~i~0 3)} is VALID [2020-07-29 01:17:27,578 INFO L280 TraceCheckUtils]: 16: Hoare triple {1320#(<= getNumbers_~i~0 3)} assume !!(~i~0 < 10); {1320#(<= getNumbers_~i~0 3)} is VALID [2020-07-29 01:17:27,580 INFO L280 TraceCheckUtils]: 17: Hoare triple {1320#(<= getNumbers_~i~0 3)} SUMMARY for call write~int(~i~0, ~array~0.base, ~array~0.offset + 4 * ~i~0, 4); srcloc: L11 {1320#(<= getNumbers_~i~0 3)} is VALID [2020-07-29 01:17:27,581 INFO L280 TraceCheckUtils]: 18: Hoare triple {1320#(<= getNumbers_~i~0 3)} #t~pre1 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre1; {1321#(<= getNumbers_~i~0 4)} is VALID [2020-07-29 01:17:27,582 INFO L280 TraceCheckUtils]: 19: Hoare triple {1321#(<= getNumbers_~i~0 4)} assume !!(~i~0 < 10); {1321#(<= getNumbers_~i~0 4)} is VALID [2020-07-29 01:17:27,582 INFO L280 TraceCheckUtils]: 20: Hoare triple {1321#(<= getNumbers_~i~0 4)} SUMMARY for call write~int(~i~0, ~array~0.base, ~array~0.offset + 4 * ~i~0, 4); srcloc: L11 {1321#(<= getNumbers_~i~0 4)} is VALID [2020-07-29 01:17:27,584 INFO L280 TraceCheckUtils]: 21: Hoare triple {1321#(<= getNumbers_~i~0 4)} #t~pre1 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre1; {1322#(<= getNumbers_~i~0 5)} is VALID [2020-07-29 01:17:27,584 INFO L280 TraceCheckUtils]: 22: Hoare triple {1322#(<= getNumbers_~i~0 5)} assume !(~i~0 < 10); {1291#false} is VALID [2020-07-29 01:17:27,585 INFO L280 TraceCheckUtils]: 23: Hoare triple {1291#false} #res.base, #res.offset := ~array~0.base, ~array~0.offset;call ULTIMATE.dealloc(#t~malloc0.base, #t~malloc0.offset);havoc #t~malloc0.base, #t~malloc0.offset; {1291#false} is VALID [2020-07-29 01:17:27,585 INFO L280 TraceCheckUtils]: 24: Hoare triple {1291#false} assume true; {1291#false} is VALID [2020-07-29 01:17:27,585 INFO L275 TraceCheckUtils]: 25: Hoare quadruple {1291#false} {1290#true} #51#return; {1291#false} is VALID [2020-07-29 01:17:27,586 INFO L280 TraceCheckUtils]: 26: Hoare triple {1291#false} ~numbers~0.base, ~numbers~0.offset := #t~ret2.base, #t~ret2.offset;havoc #t~ret2.base, #t~ret2.offset;~i~1 := 0; {1291#false} is VALID [2020-07-29 01:17:27,586 INFO L280 TraceCheckUtils]: 27: Hoare triple {1291#false} assume !!(~i~1 < 10);havoc #t~nondet4; {1291#false} is VALID [2020-07-29 01:17:27,586 INFO L280 TraceCheckUtils]: 28: Hoare triple {1291#false} assume !(1 == #valid[~numbers~0.base]); {1291#false} is VALID [2020-07-29 01:17:27,587 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:17:27,587 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-29 01:17:27,588 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 11 [2020-07-29 01:17:27,588 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166753689] [2020-07-29 01:17:27,589 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 29 [2020-07-29 01:17:27,589 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:17:27,590 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2020-07-29 01:17:27,631 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:17:27,632 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-07-29 01:17:27,632 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:17:27,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-29 01:17:27,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2020-07-29 01:17:27,633 INFO L87 Difference]: Start difference. First operand 36 states and 37 transitions. Second operand 11 states. [2020-07-29 01:17:27,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:17:27,958 INFO L93 Difference]: Finished difference Result 41 states and 42 transitions. [2020-07-29 01:17:27,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-29 01:17:27,959 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 29 [2020-07-29 01:17:27,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:17:27,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-29 01:17:27,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 43 transitions. [2020-07-29 01:17:27,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-29 01:17:27,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 43 transitions. [2020-07-29 01:17:27,963 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 43 transitions. [2020-07-29 01:17:28,014 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:17:28,015 INFO L225 Difference]: With dead ends: 41 [2020-07-29 01:17:28,015 INFO L226 Difference]: Without dead ends: 41 [2020-07-29 01:17:28,016 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2020-07-29 01:17:28,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2020-07-29 01:17:28,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 39. [2020-07-29 01:17:28,021 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:17:28,021 INFO L82 GeneralOperation]: Start isEquivalent. First operand 41 states. Second operand 39 states. [2020-07-29 01:17:28,021 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand 39 states. [2020-07-29 01:17:28,021 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 39 states. [2020-07-29 01:17:28,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:17:28,023 INFO L93 Difference]: Finished difference Result 41 states and 42 transitions. [2020-07-29 01:17:28,023 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 42 transitions. [2020-07-29 01:17:28,023 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:17:28,024 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:17:28,024 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 41 states. [2020-07-29 01:17:28,024 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 41 states. [2020-07-29 01:17:28,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:17:28,026 INFO L93 Difference]: Finished difference Result 41 states and 42 transitions. [2020-07-29 01:17:28,026 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 42 transitions. [2020-07-29 01:17:28,027 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:17:28,027 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:17:28,027 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:17:28,027 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:17:28,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2020-07-29 01:17:28,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2020-07-29 01:17:28,029 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 29 [2020-07-29 01:17:28,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:17:28,030 INFO L479 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2020-07-29 01:17:28,031 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-07-29 01:17:28,031 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2020-07-29 01:17:28,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2020-07-29 01:17:28,031 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:17:28,032 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:17:28,238 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-29 01:17:28,239 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2020-07-29 01:17:28,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:17:28,240 INFO L82 PathProgramCache]: Analyzing trace with hash 1041263839, now seen corresponding path program 5 times [2020-07-29 01:17:28,240 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:17:28,241 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808666197] [2020-07-29 01:17:28,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:17:28,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:17:28,323 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-07-29 01:17:28,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:17:28,332 INFO L280 TraceCheckUtils]: 0: Hoare triple {1602#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |#t~string5.offset| |old(#t~string5.offset)|) (= |old(#length)| |#length|) (= |#t~string5.base| |old(#t~string5.base)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(4);call write~init~int(37, #t~string5.base, #t~string5.offset, 1);call write~init~int(100, #t~string5.base, 1 + #t~string5.offset, 1);call write~init~int(10, #t~string5.base, 2 + #t~string5.offset, 1);call write~init~int(0, #t~string5.base, 3 + #t~string5.offset, 1); {1574#true} is VALID [2020-07-29 01:17:28,332 INFO L280 TraceCheckUtils]: 1: Hoare triple {1574#true} assume true; {1574#true} is VALID [2020-07-29 01:17:28,332 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1574#true} {1574#true} #47#return; {1574#true} is VALID [2020-07-29 01:17:28,342 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-07-29 01:17:28,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:17:28,454 INFO L280 TraceCheckUtils]: 0: Hoare triple {1603#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnStack(40);~array~0.base, ~array~0.offset := #t~malloc0.base, #t~malloc0.offset;~i~0 := 0; {1604#(= 0 getNumbers_~i~0)} is VALID [2020-07-29 01:17:28,455 INFO L280 TraceCheckUtils]: 1: Hoare triple {1604#(= 0 getNumbers_~i~0)} assume !!(~i~0 < 10); {1604#(= 0 getNumbers_~i~0)} is VALID [2020-07-29 01:17:28,456 INFO L280 TraceCheckUtils]: 2: Hoare triple {1604#(= 0 getNumbers_~i~0)} SUMMARY for call write~int(~i~0, ~array~0.base, ~array~0.offset + 4 * ~i~0, 4); srcloc: L11 {1604#(= 0 getNumbers_~i~0)} is VALID [2020-07-29 01:17:28,456 INFO L280 TraceCheckUtils]: 3: Hoare triple {1604#(= 0 getNumbers_~i~0)} #t~pre1 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre1; {1605#(<= getNumbers_~i~0 1)} is VALID [2020-07-29 01:17:28,457 INFO L280 TraceCheckUtils]: 4: Hoare triple {1605#(<= getNumbers_~i~0 1)} assume !!(~i~0 < 10); {1605#(<= getNumbers_~i~0 1)} is VALID [2020-07-29 01:17:28,458 INFO L280 TraceCheckUtils]: 5: Hoare triple {1605#(<= getNumbers_~i~0 1)} SUMMARY for call write~int(~i~0, ~array~0.base, ~array~0.offset + 4 * ~i~0, 4); srcloc: L11 {1605#(<= getNumbers_~i~0 1)} is VALID [2020-07-29 01:17:28,459 INFO L280 TraceCheckUtils]: 6: Hoare triple {1605#(<= getNumbers_~i~0 1)} #t~pre1 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre1; {1606#(<= getNumbers_~i~0 2)} is VALID [2020-07-29 01:17:28,459 INFO L280 TraceCheckUtils]: 7: Hoare triple {1606#(<= getNumbers_~i~0 2)} assume !!(~i~0 < 10); {1606#(<= getNumbers_~i~0 2)} is VALID [2020-07-29 01:17:28,460 INFO L280 TraceCheckUtils]: 8: Hoare triple {1606#(<= getNumbers_~i~0 2)} SUMMARY for call write~int(~i~0, ~array~0.base, ~array~0.offset + 4 * ~i~0, 4); srcloc: L11 {1606#(<= getNumbers_~i~0 2)} is VALID [2020-07-29 01:17:28,461 INFO L280 TraceCheckUtils]: 9: Hoare triple {1606#(<= getNumbers_~i~0 2)} #t~pre1 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre1; {1607#(<= getNumbers_~i~0 3)} is VALID [2020-07-29 01:17:28,462 INFO L280 TraceCheckUtils]: 10: Hoare triple {1607#(<= getNumbers_~i~0 3)} assume !!(~i~0 < 10); {1607#(<= getNumbers_~i~0 3)} is VALID [2020-07-29 01:17:28,462 INFO L280 TraceCheckUtils]: 11: Hoare triple {1607#(<= getNumbers_~i~0 3)} SUMMARY for call write~int(~i~0, ~array~0.base, ~array~0.offset + 4 * ~i~0, 4); srcloc: L11 {1607#(<= getNumbers_~i~0 3)} is VALID [2020-07-29 01:17:28,463 INFO L280 TraceCheckUtils]: 12: Hoare triple {1607#(<= getNumbers_~i~0 3)} #t~pre1 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre1; {1608#(<= getNumbers_~i~0 4)} is VALID [2020-07-29 01:17:28,464 INFO L280 TraceCheckUtils]: 13: Hoare triple {1608#(<= getNumbers_~i~0 4)} assume !!(~i~0 < 10); {1608#(<= getNumbers_~i~0 4)} is VALID [2020-07-29 01:17:28,464 INFO L280 TraceCheckUtils]: 14: Hoare triple {1608#(<= getNumbers_~i~0 4)} SUMMARY for call write~int(~i~0, ~array~0.base, ~array~0.offset + 4 * ~i~0, 4); srcloc: L11 {1608#(<= getNumbers_~i~0 4)} is VALID [2020-07-29 01:17:28,465 INFO L280 TraceCheckUtils]: 15: Hoare triple {1608#(<= getNumbers_~i~0 4)} #t~pre1 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre1; {1609#(<= getNumbers_~i~0 5)} is VALID [2020-07-29 01:17:28,466 INFO L280 TraceCheckUtils]: 16: Hoare triple {1609#(<= getNumbers_~i~0 5)} assume !!(~i~0 < 10); {1609#(<= getNumbers_~i~0 5)} is VALID [2020-07-29 01:17:28,467 INFO L280 TraceCheckUtils]: 17: Hoare triple {1609#(<= getNumbers_~i~0 5)} SUMMARY for call write~int(~i~0, ~array~0.base, ~array~0.offset + 4 * ~i~0, 4); srcloc: L11 {1609#(<= getNumbers_~i~0 5)} is VALID [2020-07-29 01:17:28,468 INFO L280 TraceCheckUtils]: 18: Hoare triple {1609#(<= getNumbers_~i~0 5)} #t~pre1 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre1; {1610#(<= getNumbers_~i~0 6)} is VALID [2020-07-29 01:17:28,468 INFO L280 TraceCheckUtils]: 19: Hoare triple {1610#(<= getNumbers_~i~0 6)} assume !(~i~0 < 10); {1575#false} is VALID [2020-07-29 01:17:28,469 INFO L280 TraceCheckUtils]: 20: Hoare triple {1575#false} #res.base, #res.offset := ~array~0.base, ~array~0.offset;call ULTIMATE.dealloc(#t~malloc0.base, #t~malloc0.offset);havoc #t~malloc0.base, #t~malloc0.offset; {1575#false} is VALID [2020-07-29 01:17:28,469 INFO L280 TraceCheckUtils]: 21: Hoare triple {1575#false} assume true; {1575#false} is VALID [2020-07-29 01:17:28,469 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {1575#false} {1574#true} #51#return; {1575#false} is VALID [2020-07-29 01:17:28,474 INFO L263 TraceCheckUtils]: 0: Hoare triple {1574#true} call ULTIMATE.init(); {1602#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |#t~string5.offset| |old(#t~string5.offset)|) (= |old(#length)| |#length|) (= |#t~string5.base| |old(#t~string5.base)|))} is VALID [2020-07-29 01:17:28,477 INFO L280 TraceCheckUtils]: 1: Hoare triple {1602#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |#t~string5.offset| |old(#t~string5.offset)|) (= |old(#length)| |#length|) (= |#t~string5.base| |old(#t~string5.base)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(4);call write~init~int(37, #t~string5.base, #t~string5.offset, 1);call write~init~int(100, #t~string5.base, 1 + #t~string5.offset, 1);call write~init~int(10, #t~string5.base, 2 + #t~string5.offset, 1);call write~init~int(0, #t~string5.base, 3 + #t~string5.offset, 1); {1574#true} is VALID [2020-07-29 01:17:28,477 INFO L280 TraceCheckUtils]: 2: Hoare triple {1574#true} assume true; {1574#true} is VALID [2020-07-29 01:17:28,477 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1574#true} {1574#true} #47#return; {1574#true} is VALID [2020-07-29 01:17:28,477 INFO L263 TraceCheckUtils]: 4: Hoare triple {1574#true} call #t~ret7 := main(); {1574#true} is VALID [2020-07-29 01:17:28,481 INFO L263 TraceCheckUtils]: 5: Hoare triple {1574#true} call #t~ret2.base, #t~ret2.offset := getNumbers(); {1603#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-29 01:17:28,482 INFO L280 TraceCheckUtils]: 6: Hoare triple {1603#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnStack(40);~array~0.base, ~array~0.offset := #t~malloc0.base, #t~malloc0.offset;~i~0 := 0; {1604#(= 0 getNumbers_~i~0)} is VALID [2020-07-29 01:17:28,483 INFO L280 TraceCheckUtils]: 7: Hoare triple {1604#(= 0 getNumbers_~i~0)} assume !!(~i~0 < 10); {1604#(= 0 getNumbers_~i~0)} is VALID [2020-07-29 01:17:28,483 INFO L280 TraceCheckUtils]: 8: Hoare triple {1604#(= 0 getNumbers_~i~0)} SUMMARY for call write~int(~i~0, ~array~0.base, ~array~0.offset + 4 * ~i~0, 4); srcloc: L11 {1604#(= 0 getNumbers_~i~0)} is VALID [2020-07-29 01:17:28,484 INFO L280 TraceCheckUtils]: 9: Hoare triple {1604#(= 0 getNumbers_~i~0)} #t~pre1 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre1; {1605#(<= getNumbers_~i~0 1)} is VALID [2020-07-29 01:17:28,485 INFO L280 TraceCheckUtils]: 10: Hoare triple {1605#(<= getNumbers_~i~0 1)} assume !!(~i~0 < 10); {1605#(<= getNumbers_~i~0 1)} is VALID [2020-07-29 01:17:28,485 INFO L280 TraceCheckUtils]: 11: Hoare triple {1605#(<= getNumbers_~i~0 1)} SUMMARY for call write~int(~i~0, ~array~0.base, ~array~0.offset + 4 * ~i~0, 4); srcloc: L11 {1605#(<= getNumbers_~i~0 1)} is VALID [2020-07-29 01:17:28,486 INFO L280 TraceCheckUtils]: 12: Hoare triple {1605#(<= getNumbers_~i~0 1)} #t~pre1 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre1; {1606#(<= getNumbers_~i~0 2)} is VALID [2020-07-29 01:17:28,487 INFO L280 TraceCheckUtils]: 13: Hoare triple {1606#(<= getNumbers_~i~0 2)} assume !!(~i~0 < 10); {1606#(<= getNumbers_~i~0 2)} is VALID [2020-07-29 01:17:28,490 INFO L280 TraceCheckUtils]: 14: Hoare triple {1606#(<= getNumbers_~i~0 2)} SUMMARY for call write~int(~i~0, ~array~0.base, ~array~0.offset + 4 * ~i~0, 4); srcloc: L11 {1606#(<= getNumbers_~i~0 2)} is VALID [2020-07-29 01:17:28,491 INFO L280 TraceCheckUtils]: 15: Hoare triple {1606#(<= getNumbers_~i~0 2)} #t~pre1 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre1; {1607#(<= getNumbers_~i~0 3)} is VALID [2020-07-29 01:17:28,491 INFO L280 TraceCheckUtils]: 16: Hoare triple {1607#(<= getNumbers_~i~0 3)} assume !!(~i~0 < 10); {1607#(<= getNumbers_~i~0 3)} is VALID [2020-07-29 01:17:28,492 INFO L280 TraceCheckUtils]: 17: Hoare triple {1607#(<= getNumbers_~i~0 3)} SUMMARY for call write~int(~i~0, ~array~0.base, ~array~0.offset + 4 * ~i~0, 4); srcloc: L11 {1607#(<= getNumbers_~i~0 3)} is VALID [2020-07-29 01:17:28,493 INFO L280 TraceCheckUtils]: 18: Hoare triple {1607#(<= getNumbers_~i~0 3)} #t~pre1 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre1; {1608#(<= getNumbers_~i~0 4)} is VALID [2020-07-29 01:17:28,493 INFO L280 TraceCheckUtils]: 19: Hoare triple {1608#(<= getNumbers_~i~0 4)} assume !!(~i~0 < 10); {1608#(<= getNumbers_~i~0 4)} is VALID [2020-07-29 01:17:28,494 INFO L280 TraceCheckUtils]: 20: Hoare triple {1608#(<= getNumbers_~i~0 4)} SUMMARY for call write~int(~i~0, ~array~0.base, ~array~0.offset + 4 * ~i~0, 4); srcloc: L11 {1608#(<= getNumbers_~i~0 4)} is VALID [2020-07-29 01:17:28,495 INFO L280 TraceCheckUtils]: 21: Hoare triple {1608#(<= getNumbers_~i~0 4)} #t~pre1 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre1; {1609#(<= getNumbers_~i~0 5)} is VALID [2020-07-29 01:17:28,496 INFO L280 TraceCheckUtils]: 22: Hoare triple {1609#(<= getNumbers_~i~0 5)} assume !!(~i~0 < 10); {1609#(<= getNumbers_~i~0 5)} is VALID [2020-07-29 01:17:28,500 INFO L280 TraceCheckUtils]: 23: Hoare triple {1609#(<= getNumbers_~i~0 5)} SUMMARY for call write~int(~i~0, ~array~0.base, ~array~0.offset + 4 * ~i~0, 4); srcloc: L11 {1609#(<= getNumbers_~i~0 5)} is VALID [2020-07-29 01:17:28,502 INFO L280 TraceCheckUtils]: 24: Hoare triple {1609#(<= getNumbers_~i~0 5)} #t~pre1 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre1; {1610#(<= getNumbers_~i~0 6)} is VALID [2020-07-29 01:17:28,503 INFO L280 TraceCheckUtils]: 25: Hoare triple {1610#(<= getNumbers_~i~0 6)} assume !(~i~0 < 10); {1575#false} is VALID [2020-07-29 01:17:28,503 INFO L280 TraceCheckUtils]: 26: Hoare triple {1575#false} #res.base, #res.offset := ~array~0.base, ~array~0.offset;call ULTIMATE.dealloc(#t~malloc0.base, #t~malloc0.offset);havoc #t~malloc0.base, #t~malloc0.offset; {1575#false} is VALID [2020-07-29 01:17:28,504 INFO L280 TraceCheckUtils]: 27: Hoare triple {1575#false} assume true; {1575#false} is VALID [2020-07-29 01:17:28,504 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {1575#false} {1574#true} #51#return; {1575#false} is VALID [2020-07-29 01:17:28,504 INFO L280 TraceCheckUtils]: 29: Hoare triple {1575#false} ~numbers~0.base, ~numbers~0.offset := #t~ret2.base, #t~ret2.offset;havoc #t~ret2.base, #t~ret2.offset;~i~1 := 0; {1575#false} is VALID [2020-07-29 01:17:28,504 INFO L280 TraceCheckUtils]: 30: Hoare triple {1575#false} assume !!(~i~1 < 10);havoc #t~nondet4; {1575#false} is VALID [2020-07-29 01:17:28,504 INFO L280 TraceCheckUtils]: 31: Hoare triple {1575#false} assume !(1 == #valid[~numbers~0.base]); {1575#false} is VALID [2020-07-29 01:17:28,506 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:17:28,506 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808666197] [2020-07-29 01:17:28,507 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2128722211] [2020-07-29 01:17:28,507 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-29 01:17:28,567 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2020-07-29 01:17:28,567 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-29 01:17:28,568 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-29 01:17:28,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:17:28,578 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:17:28,795 INFO L263 TraceCheckUtils]: 0: Hoare triple {1574#true} call ULTIMATE.init(); {1574#true} is VALID [2020-07-29 01:17:28,795 INFO L280 TraceCheckUtils]: 1: Hoare triple {1574#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(4);call write~init~int(37, #t~string5.base, #t~string5.offset, 1);call write~init~int(100, #t~string5.base, 1 + #t~string5.offset, 1);call write~init~int(10, #t~string5.base, 2 + #t~string5.offset, 1);call write~init~int(0, #t~string5.base, 3 + #t~string5.offset, 1); {1574#true} is VALID [2020-07-29 01:17:28,795 INFO L280 TraceCheckUtils]: 2: Hoare triple {1574#true} assume true; {1574#true} is VALID [2020-07-29 01:17:28,795 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1574#true} {1574#true} #47#return; {1574#true} is VALID [2020-07-29 01:17:28,795 INFO L263 TraceCheckUtils]: 4: Hoare triple {1574#true} call #t~ret7 := main(); {1574#true} is VALID [2020-07-29 01:17:28,796 INFO L263 TraceCheckUtils]: 5: Hoare triple {1574#true} call #t~ret2.base, #t~ret2.offset := getNumbers(); {1574#true} is VALID [2020-07-29 01:17:28,796 INFO L280 TraceCheckUtils]: 6: Hoare triple {1574#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnStack(40);~array~0.base, ~array~0.offset := #t~malloc0.base, #t~malloc0.offset;~i~0 := 0; {1632#(<= getNumbers_~i~0 0)} is VALID [2020-07-29 01:17:28,797 INFO L280 TraceCheckUtils]: 7: Hoare triple {1632#(<= getNumbers_~i~0 0)} assume !!(~i~0 < 10); {1632#(<= getNumbers_~i~0 0)} is VALID [2020-07-29 01:17:28,797 INFO L280 TraceCheckUtils]: 8: Hoare triple {1632#(<= getNumbers_~i~0 0)} SUMMARY for call write~int(~i~0, ~array~0.base, ~array~0.offset + 4 * ~i~0, 4); srcloc: L11 {1632#(<= getNumbers_~i~0 0)} is VALID [2020-07-29 01:17:28,798 INFO L280 TraceCheckUtils]: 9: Hoare triple {1632#(<= getNumbers_~i~0 0)} #t~pre1 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre1; {1605#(<= getNumbers_~i~0 1)} is VALID [2020-07-29 01:17:28,798 INFO L280 TraceCheckUtils]: 10: Hoare triple {1605#(<= getNumbers_~i~0 1)} assume !!(~i~0 < 10); {1605#(<= getNumbers_~i~0 1)} is VALID [2020-07-29 01:17:28,799 INFO L280 TraceCheckUtils]: 11: Hoare triple {1605#(<= getNumbers_~i~0 1)} SUMMARY for call write~int(~i~0, ~array~0.base, ~array~0.offset + 4 * ~i~0, 4); srcloc: L11 {1605#(<= getNumbers_~i~0 1)} is VALID [2020-07-29 01:17:28,800 INFO L280 TraceCheckUtils]: 12: Hoare triple {1605#(<= getNumbers_~i~0 1)} #t~pre1 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre1; {1606#(<= getNumbers_~i~0 2)} is VALID [2020-07-29 01:17:28,800 INFO L280 TraceCheckUtils]: 13: Hoare triple {1606#(<= getNumbers_~i~0 2)} assume !!(~i~0 < 10); {1606#(<= getNumbers_~i~0 2)} is VALID [2020-07-29 01:17:28,801 INFO L280 TraceCheckUtils]: 14: Hoare triple {1606#(<= getNumbers_~i~0 2)} SUMMARY for call write~int(~i~0, ~array~0.base, ~array~0.offset + 4 * ~i~0, 4); srcloc: L11 {1606#(<= getNumbers_~i~0 2)} is VALID [2020-07-29 01:17:28,801 INFO L280 TraceCheckUtils]: 15: Hoare triple {1606#(<= getNumbers_~i~0 2)} #t~pre1 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre1; {1607#(<= getNumbers_~i~0 3)} is VALID [2020-07-29 01:17:28,802 INFO L280 TraceCheckUtils]: 16: Hoare triple {1607#(<= getNumbers_~i~0 3)} assume !!(~i~0 < 10); {1607#(<= getNumbers_~i~0 3)} is VALID [2020-07-29 01:17:28,802 INFO L280 TraceCheckUtils]: 17: Hoare triple {1607#(<= getNumbers_~i~0 3)} SUMMARY for call write~int(~i~0, ~array~0.base, ~array~0.offset + 4 * ~i~0, 4); srcloc: L11 {1607#(<= getNumbers_~i~0 3)} is VALID [2020-07-29 01:17:28,803 INFO L280 TraceCheckUtils]: 18: Hoare triple {1607#(<= getNumbers_~i~0 3)} #t~pre1 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre1; {1608#(<= getNumbers_~i~0 4)} is VALID [2020-07-29 01:17:28,804 INFO L280 TraceCheckUtils]: 19: Hoare triple {1608#(<= getNumbers_~i~0 4)} assume !!(~i~0 < 10); {1608#(<= getNumbers_~i~0 4)} is VALID [2020-07-29 01:17:28,804 INFO L280 TraceCheckUtils]: 20: Hoare triple {1608#(<= getNumbers_~i~0 4)} SUMMARY for call write~int(~i~0, ~array~0.base, ~array~0.offset + 4 * ~i~0, 4); srcloc: L11 {1608#(<= getNumbers_~i~0 4)} is VALID [2020-07-29 01:17:28,806 INFO L280 TraceCheckUtils]: 21: Hoare triple {1608#(<= getNumbers_~i~0 4)} #t~pre1 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre1; {1609#(<= getNumbers_~i~0 5)} is VALID [2020-07-29 01:17:28,814 INFO L280 TraceCheckUtils]: 22: Hoare triple {1609#(<= getNumbers_~i~0 5)} assume !!(~i~0 < 10); {1609#(<= getNumbers_~i~0 5)} is VALID [2020-07-29 01:17:28,815 INFO L280 TraceCheckUtils]: 23: Hoare triple {1609#(<= getNumbers_~i~0 5)} SUMMARY for call write~int(~i~0, ~array~0.base, ~array~0.offset + 4 * ~i~0, 4); srcloc: L11 {1609#(<= getNumbers_~i~0 5)} is VALID [2020-07-29 01:17:28,815 INFO L280 TraceCheckUtils]: 24: Hoare triple {1609#(<= getNumbers_~i~0 5)} #t~pre1 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre1; {1610#(<= getNumbers_~i~0 6)} is VALID [2020-07-29 01:17:28,816 INFO L280 TraceCheckUtils]: 25: Hoare triple {1610#(<= getNumbers_~i~0 6)} assume !(~i~0 < 10); {1575#false} is VALID [2020-07-29 01:17:28,816 INFO L280 TraceCheckUtils]: 26: Hoare triple {1575#false} #res.base, #res.offset := ~array~0.base, ~array~0.offset;call ULTIMATE.dealloc(#t~malloc0.base, #t~malloc0.offset);havoc #t~malloc0.base, #t~malloc0.offset; {1575#false} is VALID [2020-07-29 01:17:28,817 INFO L280 TraceCheckUtils]: 27: Hoare triple {1575#false} assume true; {1575#false} is VALID [2020-07-29 01:17:28,817 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {1575#false} {1574#true} #51#return; {1575#false} is VALID [2020-07-29 01:17:28,817 INFO L280 TraceCheckUtils]: 29: Hoare triple {1575#false} ~numbers~0.base, ~numbers~0.offset := #t~ret2.base, #t~ret2.offset;havoc #t~ret2.base, #t~ret2.offset;~i~1 := 0; {1575#false} is VALID [2020-07-29 01:17:28,817 INFO L280 TraceCheckUtils]: 30: Hoare triple {1575#false} assume !!(~i~1 < 10);havoc #t~nondet4; {1575#false} is VALID [2020-07-29 01:17:28,817 INFO L280 TraceCheckUtils]: 31: Hoare triple {1575#false} assume !(1 == #valid[~numbers~0.base]); {1575#false} is VALID [2020-07-29 01:17:28,819 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:17:28,819 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-29 01:17:28,819 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 12 [2020-07-29 01:17:28,819 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740323040] [2020-07-29 01:17:28,820 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 32 [2020-07-29 01:17:28,822 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:17:28,823 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2020-07-29 01:17:28,870 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:17:28,870 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-07-29 01:17:28,870 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:17:28,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-07-29 01:17:28,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2020-07-29 01:17:28,871 INFO L87 Difference]: Start difference. First operand 39 states and 40 transitions. Second operand 12 states. [2020-07-29 01:17:29,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:17:29,196 INFO L93 Difference]: Finished difference Result 44 states and 45 transitions. [2020-07-29 01:17:29,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-29 01:17:29,197 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 32 [2020-07-29 01:17:29,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:17:29,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-07-29 01:17:29,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 46 transitions. [2020-07-29 01:17:29,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-07-29 01:17:29,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 46 transitions. [2020-07-29 01:17:29,202 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 46 transitions. [2020-07-29 01:17:29,250 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:17:29,251 INFO L225 Difference]: With dead ends: 44 [2020-07-29 01:17:29,251 INFO L226 Difference]: Without dead ends: 44 [2020-07-29 01:17:29,252 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2020-07-29 01:17:29,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2020-07-29 01:17:29,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 42. [2020-07-29 01:17:29,259 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:17:29,260 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand 42 states. [2020-07-29 01:17:29,260 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 42 states. [2020-07-29 01:17:29,260 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 42 states. [2020-07-29 01:17:29,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:17:29,262 INFO L93 Difference]: Finished difference Result 44 states and 45 transitions. [2020-07-29 01:17:29,262 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 45 transitions. [2020-07-29 01:17:29,262 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:17:29,262 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:17:29,262 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 44 states. [2020-07-29 01:17:29,263 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 44 states. [2020-07-29 01:17:29,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:17:29,264 INFO L93 Difference]: Finished difference Result 44 states and 45 transitions. [2020-07-29 01:17:29,264 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 45 transitions. [2020-07-29 01:17:29,265 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:17:29,265 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:17:29,265 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:17:29,265 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:17:29,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2020-07-29 01:17:29,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 43 transitions. [2020-07-29 01:17:29,267 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 43 transitions. Word has length 32 [2020-07-29 01:17:29,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:17:29,267 INFO L479 AbstractCegarLoop]: Abstraction has 42 states and 43 transitions. [2020-07-29 01:17:29,267 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-07-29 01:17:29,267 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 43 transitions. [2020-07-29 01:17:29,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2020-07-29 01:17:29,268 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:17:29,268 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:17:29,483 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-29 01:17:29,484 INFO L427 AbstractCegarLoop]: === Iteration 10 === [mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2020-07-29 01:17:29,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:17:29,485 INFO L82 PathProgramCache]: Analyzing trace with hash 1122227080, now seen corresponding path program 6 times [2020-07-29 01:17:29,485 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:17:29,486 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469088089] [2020-07-29 01:17:29,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:17:29,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:17:29,553 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-07-29 01:17:29,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:17:29,558 INFO L280 TraceCheckUtils]: 0: Hoare triple {1914#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |#t~string5.offset| |old(#t~string5.offset)|) (= |old(#length)| |#length|) (= |#t~string5.base| |old(#t~string5.base)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(4);call write~init~int(37, #t~string5.base, #t~string5.offset, 1);call write~init~int(100, #t~string5.base, 1 + #t~string5.offset, 1);call write~init~int(10, #t~string5.base, 2 + #t~string5.offset, 1);call write~init~int(0, #t~string5.base, 3 + #t~string5.offset, 1); {1883#true} is VALID [2020-07-29 01:17:29,558 INFO L280 TraceCheckUtils]: 1: Hoare triple {1883#true} assume true; {1883#true} is VALID [2020-07-29 01:17:29,558 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1883#true} {1883#true} #47#return; {1883#true} is VALID [2020-07-29 01:17:29,571 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-07-29 01:17:29,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:17:29,694 INFO L280 TraceCheckUtils]: 0: Hoare triple {1915#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnStack(40);~array~0.base, ~array~0.offset := #t~malloc0.base, #t~malloc0.offset;~i~0 := 0; {1916#(= 0 getNumbers_~i~0)} is VALID [2020-07-29 01:17:29,694 INFO L280 TraceCheckUtils]: 1: Hoare triple {1916#(= 0 getNumbers_~i~0)} assume !!(~i~0 < 10); {1916#(= 0 getNumbers_~i~0)} is VALID [2020-07-29 01:17:29,695 INFO L280 TraceCheckUtils]: 2: Hoare triple {1916#(= 0 getNumbers_~i~0)} SUMMARY for call write~int(~i~0, ~array~0.base, ~array~0.offset + 4 * ~i~0, 4); srcloc: L11 {1916#(= 0 getNumbers_~i~0)} is VALID [2020-07-29 01:17:29,696 INFO L280 TraceCheckUtils]: 3: Hoare triple {1916#(= 0 getNumbers_~i~0)} #t~pre1 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre1; {1917#(<= getNumbers_~i~0 1)} is VALID [2020-07-29 01:17:29,696 INFO L280 TraceCheckUtils]: 4: Hoare triple {1917#(<= getNumbers_~i~0 1)} assume !!(~i~0 < 10); {1917#(<= getNumbers_~i~0 1)} is VALID [2020-07-29 01:17:29,697 INFO L280 TraceCheckUtils]: 5: Hoare triple {1917#(<= getNumbers_~i~0 1)} SUMMARY for call write~int(~i~0, ~array~0.base, ~array~0.offset + 4 * ~i~0, 4); srcloc: L11 {1917#(<= getNumbers_~i~0 1)} is VALID [2020-07-29 01:17:29,698 INFO L280 TraceCheckUtils]: 6: Hoare triple {1917#(<= getNumbers_~i~0 1)} #t~pre1 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre1; {1918#(<= getNumbers_~i~0 2)} is VALID [2020-07-29 01:17:29,698 INFO L280 TraceCheckUtils]: 7: Hoare triple {1918#(<= getNumbers_~i~0 2)} assume !!(~i~0 < 10); {1918#(<= getNumbers_~i~0 2)} is VALID [2020-07-29 01:17:29,699 INFO L280 TraceCheckUtils]: 8: Hoare triple {1918#(<= getNumbers_~i~0 2)} SUMMARY for call write~int(~i~0, ~array~0.base, ~array~0.offset + 4 * ~i~0, 4); srcloc: L11 {1918#(<= getNumbers_~i~0 2)} is VALID [2020-07-29 01:17:29,700 INFO L280 TraceCheckUtils]: 9: Hoare triple {1918#(<= getNumbers_~i~0 2)} #t~pre1 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre1; {1919#(<= getNumbers_~i~0 3)} is VALID [2020-07-29 01:17:29,700 INFO L280 TraceCheckUtils]: 10: Hoare triple {1919#(<= getNumbers_~i~0 3)} assume !!(~i~0 < 10); {1919#(<= getNumbers_~i~0 3)} is VALID [2020-07-29 01:17:29,701 INFO L280 TraceCheckUtils]: 11: Hoare triple {1919#(<= getNumbers_~i~0 3)} SUMMARY for call write~int(~i~0, ~array~0.base, ~array~0.offset + 4 * ~i~0, 4); srcloc: L11 {1919#(<= getNumbers_~i~0 3)} is VALID [2020-07-29 01:17:29,702 INFO L280 TraceCheckUtils]: 12: Hoare triple {1919#(<= getNumbers_~i~0 3)} #t~pre1 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre1; {1920#(<= getNumbers_~i~0 4)} is VALID [2020-07-29 01:17:29,702 INFO L280 TraceCheckUtils]: 13: Hoare triple {1920#(<= getNumbers_~i~0 4)} assume !!(~i~0 < 10); {1920#(<= getNumbers_~i~0 4)} is VALID [2020-07-29 01:17:29,703 INFO L280 TraceCheckUtils]: 14: Hoare triple {1920#(<= getNumbers_~i~0 4)} SUMMARY for call write~int(~i~0, ~array~0.base, ~array~0.offset + 4 * ~i~0, 4); srcloc: L11 {1920#(<= getNumbers_~i~0 4)} is VALID [2020-07-29 01:17:29,703 INFO L280 TraceCheckUtils]: 15: Hoare triple {1920#(<= getNumbers_~i~0 4)} #t~pre1 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre1; {1921#(<= getNumbers_~i~0 5)} is VALID [2020-07-29 01:17:29,704 INFO L280 TraceCheckUtils]: 16: Hoare triple {1921#(<= getNumbers_~i~0 5)} assume !!(~i~0 < 10); {1921#(<= getNumbers_~i~0 5)} is VALID [2020-07-29 01:17:29,705 INFO L280 TraceCheckUtils]: 17: Hoare triple {1921#(<= getNumbers_~i~0 5)} SUMMARY for call write~int(~i~0, ~array~0.base, ~array~0.offset + 4 * ~i~0, 4); srcloc: L11 {1921#(<= getNumbers_~i~0 5)} is VALID [2020-07-29 01:17:29,705 INFO L280 TraceCheckUtils]: 18: Hoare triple {1921#(<= getNumbers_~i~0 5)} #t~pre1 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre1; {1922#(<= getNumbers_~i~0 6)} is VALID [2020-07-29 01:17:29,706 INFO L280 TraceCheckUtils]: 19: Hoare triple {1922#(<= getNumbers_~i~0 6)} assume !!(~i~0 < 10); {1922#(<= getNumbers_~i~0 6)} is VALID [2020-07-29 01:17:29,707 INFO L280 TraceCheckUtils]: 20: Hoare triple {1922#(<= getNumbers_~i~0 6)} SUMMARY for call write~int(~i~0, ~array~0.base, ~array~0.offset + 4 * ~i~0, 4); srcloc: L11 {1922#(<= getNumbers_~i~0 6)} is VALID [2020-07-29 01:17:29,708 INFO L280 TraceCheckUtils]: 21: Hoare triple {1922#(<= getNumbers_~i~0 6)} #t~pre1 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre1; {1923#(<= getNumbers_~i~0 7)} is VALID [2020-07-29 01:17:29,708 INFO L280 TraceCheckUtils]: 22: Hoare triple {1923#(<= getNumbers_~i~0 7)} assume !(~i~0 < 10); {1884#false} is VALID [2020-07-29 01:17:29,708 INFO L280 TraceCheckUtils]: 23: Hoare triple {1884#false} #res.base, #res.offset := ~array~0.base, ~array~0.offset;call ULTIMATE.dealloc(#t~malloc0.base, #t~malloc0.offset);havoc #t~malloc0.base, #t~malloc0.offset; {1884#false} is VALID [2020-07-29 01:17:29,709 INFO L280 TraceCheckUtils]: 24: Hoare triple {1884#false} assume true; {1884#false} is VALID [2020-07-29 01:17:29,709 INFO L275 TraceCheckUtils]: 25: Hoare quadruple {1884#false} {1883#true} #51#return; {1884#false} is VALID [2020-07-29 01:17:29,711 INFO L263 TraceCheckUtils]: 0: Hoare triple {1883#true} call ULTIMATE.init(); {1914#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |#t~string5.offset| |old(#t~string5.offset)|) (= |old(#length)| |#length|) (= |#t~string5.base| |old(#t~string5.base)|))} is VALID [2020-07-29 01:17:29,711 INFO L280 TraceCheckUtils]: 1: Hoare triple {1914#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |#t~string5.offset| |old(#t~string5.offset)|) (= |old(#length)| |#length|) (= |#t~string5.base| |old(#t~string5.base)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(4);call write~init~int(37, #t~string5.base, #t~string5.offset, 1);call write~init~int(100, #t~string5.base, 1 + #t~string5.offset, 1);call write~init~int(10, #t~string5.base, 2 + #t~string5.offset, 1);call write~init~int(0, #t~string5.base, 3 + #t~string5.offset, 1); {1883#true} is VALID [2020-07-29 01:17:29,711 INFO L280 TraceCheckUtils]: 2: Hoare triple {1883#true} assume true; {1883#true} is VALID [2020-07-29 01:17:29,711 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1883#true} {1883#true} #47#return; {1883#true} is VALID [2020-07-29 01:17:29,711 INFO L263 TraceCheckUtils]: 4: Hoare triple {1883#true} call #t~ret7 := main(); {1883#true} is VALID [2020-07-29 01:17:29,712 INFO L263 TraceCheckUtils]: 5: Hoare triple {1883#true} call #t~ret2.base, #t~ret2.offset := getNumbers(); {1915#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-29 01:17:29,713 INFO L280 TraceCheckUtils]: 6: Hoare triple {1915#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnStack(40);~array~0.base, ~array~0.offset := #t~malloc0.base, #t~malloc0.offset;~i~0 := 0; {1916#(= 0 getNumbers_~i~0)} is VALID [2020-07-29 01:17:29,714 INFO L280 TraceCheckUtils]: 7: Hoare triple {1916#(= 0 getNumbers_~i~0)} assume !!(~i~0 < 10); {1916#(= 0 getNumbers_~i~0)} is VALID [2020-07-29 01:17:29,714 INFO L280 TraceCheckUtils]: 8: Hoare triple {1916#(= 0 getNumbers_~i~0)} SUMMARY for call write~int(~i~0, ~array~0.base, ~array~0.offset + 4 * ~i~0, 4); srcloc: L11 {1916#(= 0 getNumbers_~i~0)} is VALID [2020-07-29 01:17:29,715 INFO L280 TraceCheckUtils]: 9: Hoare triple {1916#(= 0 getNumbers_~i~0)} #t~pre1 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre1; {1917#(<= getNumbers_~i~0 1)} is VALID [2020-07-29 01:17:29,715 INFO L280 TraceCheckUtils]: 10: Hoare triple {1917#(<= getNumbers_~i~0 1)} assume !!(~i~0 < 10); {1917#(<= getNumbers_~i~0 1)} is VALID [2020-07-29 01:17:29,716 INFO L280 TraceCheckUtils]: 11: Hoare triple {1917#(<= getNumbers_~i~0 1)} SUMMARY for call write~int(~i~0, ~array~0.base, ~array~0.offset + 4 * ~i~0, 4); srcloc: L11 {1917#(<= getNumbers_~i~0 1)} is VALID [2020-07-29 01:17:29,716 INFO L280 TraceCheckUtils]: 12: Hoare triple {1917#(<= getNumbers_~i~0 1)} #t~pre1 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre1; {1918#(<= getNumbers_~i~0 2)} is VALID [2020-07-29 01:17:29,717 INFO L280 TraceCheckUtils]: 13: Hoare triple {1918#(<= getNumbers_~i~0 2)} assume !!(~i~0 < 10); {1918#(<= getNumbers_~i~0 2)} is VALID [2020-07-29 01:17:29,717 INFO L280 TraceCheckUtils]: 14: Hoare triple {1918#(<= getNumbers_~i~0 2)} SUMMARY for call write~int(~i~0, ~array~0.base, ~array~0.offset + 4 * ~i~0, 4); srcloc: L11 {1918#(<= getNumbers_~i~0 2)} is VALID [2020-07-29 01:17:29,718 INFO L280 TraceCheckUtils]: 15: Hoare triple {1918#(<= getNumbers_~i~0 2)} #t~pre1 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre1; {1919#(<= getNumbers_~i~0 3)} is VALID [2020-07-29 01:17:29,719 INFO L280 TraceCheckUtils]: 16: Hoare triple {1919#(<= getNumbers_~i~0 3)} assume !!(~i~0 < 10); {1919#(<= getNumbers_~i~0 3)} is VALID [2020-07-29 01:17:29,719 INFO L280 TraceCheckUtils]: 17: Hoare triple {1919#(<= getNumbers_~i~0 3)} SUMMARY for call write~int(~i~0, ~array~0.base, ~array~0.offset + 4 * ~i~0, 4); srcloc: L11 {1919#(<= getNumbers_~i~0 3)} is VALID [2020-07-29 01:17:29,720 INFO L280 TraceCheckUtils]: 18: Hoare triple {1919#(<= getNumbers_~i~0 3)} #t~pre1 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre1; {1920#(<= getNumbers_~i~0 4)} is VALID [2020-07-29 01:17:29,721 INFO L280 TraceCheckUtils]: 19: Hoare triple {1920#(<= getNumbers_~i~0 4)} assume !!(~i~0 < 10); {1920#(<= getNumbers_~i~0 4)} is VALID [2020-07-29 01:17:29,721 INFO L280 TraceCheckUtils]: 20: Hoare triple {1920#(<= getNumbers_~i~0 4)} SUMMARY for call write~int(~i~0, ~array~0.base, ~array~0.offset + 4 * ~i~0, 4); srcloc: L11 {1920#(<= getNumbers_~i~0 4)} is VALID [2020-07-29 01:17:29,722 INFO L280 TraceCheckUtils]: 21: Hoare triple {1920#(<= getNumbers_~i~0 4)} #t~pre1 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre1; {1921#(<= getNumbers_~i~0 5)} is VALID [2020-07-29 01:17:29,722 INFO L280 TraceCheckUtils]: 22: Hoare triple {1921#(<= getNumbers_~i~0 5)} assume !!(~i~0 < 10); {1921#(<= getNumbers_~i~0 5)} is VALID [2020-07-29 01:17:29,723 INFO L280 TraceCheckUtils]: 23: Hoare triple {1921#(<= getNumbers_~i~0 5)} SUMMARY for call write~int(~i~0, ~array~0.base, ~array~0.offset + 4 * ~i~0, 4); srcloc: L11 {1921#(<= getNumbers_~i~0 5)} is VALID [2020-07-29 01:17:29,724 INFO L280 TraceCheckUtils]: 24: Hoare triple {1921#(<= getNumbers_~i~0 5)} #t~pre1 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre1; {1922#(<= getNumbers_~i~0 6)} is VALID [2020-07-29 01:17:29,724 INFO L280 TraceCheckUtils]: 25: Hoare triple {1922#(<= getNumbers_~i~0 6)} assume !!(~i~0 < 10); {1922#(<= getNumbers_~i~0 6)} is VALID [2020-07-29 01:17:29,725 INFO L280 TraceCheckUtils]: 26: Hoare triple {1922#(<= getNumbers_~i~0 6)} SUMMARY for call write~int(~i~0, ~array~0.base, ~array~0.offset + 4 * ~i~0, 4); srcloc: L11 {1922#(<= getNumbers_~i~0 6)} is VALID [2020-07-29 01:17:29,725 INFO L280 TraceCheckUtils]: 27: Hoare triple {1922#(<= getNumbers_~i~0 6)} #t~pre1 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre1; {1923#(<= getNumbers_~i~0 7)} is VALID [2020-07-29 01:17:29,726 INFO L280 TraceCheckUtils]: 28: Hoare triple {1923#(<= getNumbers_~i~0 7)} assume !(~i~0 < 10); {1884#false} is VALID [2020-07-29 01:17:29,726 INFO L280 TraceCheckUtils]: 29: Hoare triple {1884#false} #res.base, #res.offset := ~array~0.base, ~array~0.offset;call ULTIMATE.dealloc(#t~malloc0.base, #t~malloc0.offset);havoc #t~malloc0.base, #t~malloc0.offset; {1884#false} is VALID [2020-07-29 01:17:29,726 INFO L280 TraceCheckUtils]: 30: Hoare triple {1884#false} assume true; {1884#false} is VALID [2020-07-29 01:17:29,727 INFO L275 TraceCheckUtils]: 31: Hoare quadruple {1884#false} {1883#true} #51#return; {1884#false} is VALID [2020-07-29 01:17:29,727 INFO L280 TraceCheckUtils]: 32: Hoare triple {1884#false} ~numbers~0.base, ~numbers~0.offset := #t~ret2.base, #t~ret2.offset;havoc #t~ret2.base, #t~ret2.offset;~i~1 := 0; {1884#false} is VALID [2020-07-29 01:17:29,727 INFO L280 TraceCheckUtils]: 33: Hoare triple {1884#false} assume !!(~i~1 < 10);havoc #t~nondet4; {1884#false} is VALID [2020-07-29 01:17:29,727 INFO L280 TraceCheckUtils]: 34: Hoare triple {1884#false} assume !(1 == #valid[~numbers~0.base]); {1884#false} is VALID [2020-07-29 01:17:29,729 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:17:29,729 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469088089] [2020-07-29 01:17:29,729 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1083337671] [2020-07-29 01:17:29,729 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-29 01:17:29,788 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2020-07-29 01:17:29,788 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-29 01:17:29,789 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 9 conjunts are in the unsatisfiable core [2020-07-29 01:17:29,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:17:29,800 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:17:30,026 INFO L263 TraceCheckUtils]: 0: Hoare triple {1883#true} call ULTIMATE.init(); {1883#true} is VALID [2020-07-29 01:17:30,027 INFO L280 TraceCheckUtils]: 1: Hoare triple {1883#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(4);call write~init~int(37, #t~string5.base, #t~string5.offset, 1);call write~init~int(100, #t~string5.base, 1 + #t~string5.offset, 1);call write~init~int(10, #t~string5.base, 2 + #t~string5.offset, 1);call write~init~int(0, #t~string5.base, 3 + #t~string5.offset, 1); {1883#true} is VALID [2020-07-29 01:17:30,027 INFO L280 TraceCheckUtils]: 2: Hoare triple {1883#true} assume true; {1883#true} is VALID [2020-07-29 01:17:30,027 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1883#true} {1883#true} #47#return; {1883#true} is VALID [2020-07-29 01:17:30,027 INFO L263 TraceCheckUtils]: 4: Hoare triple {1883#true} call #t~ret7 := main(); {1883#true} is VALID [2020-07-29 01:17:30,027 INFO L263 TraceCheckUtils]: 5: Hoare triple {1883#true} call #t~ret2.base, #t~ret2.offset := getNumbers(); {1883#true} is VALID [2020-07-29 01:17:30,029 INFO L280 TraceCheckUtils]: 6: Hoare triple {1883#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnStack(40);~array~0.base, ~array~0.offset := #t~malloc0.base, #t~malloc0.offset;~i~0 := 0; {1945#(<= getNumbers_~i~0 0)} is VALID [2020-07-29 01:17:30,032 INFO L280 TraceCheckUtils]: 7: Hoare triple {1945#(<= getNumbers_~i~0 0)} assume !!(~i~0 < 10); {1945#(<= getNumbers_~i~0 0)} is VALID [2020-07-29 01:17:30,033 INFO L280 TraceCheckUtils]: 8: Hoare triple {1945#(<= getNumbers_~i~0 0)} SUMMARY for call write~int(~i~0, ~array~0.base, ~array~0.offset + 4 * ~i~0, 4); srcloc: L11 {1945#(<= getNumbers_~i~0 0)} is VALID [2020-07-29 01:17:30,034 INFO L280 TraceCheckUtils]: 9: Hoare triple {1945#(<= getNumbers_~i~0 0)} #t~pre1 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre1; {1917#(<= getNumbers_~i~0 1)} is VALID [2020-07-29 01:17:30,035 INFO L280 TraceCheckUtils]: 10: Hoare triple {1917#(<= getNumbers_~i~0 1)} assume !!(~i~0 < 10); {1917#(<= getNumbers_~i~0 1)} is VALID [2020-07-29 01:17:30,035 INFO L280 TraceCheckUtils]: 11: Hoare triple {1917#(<= getNumbers_~i~0 1)} SUMMARY for call write~int(~i~0, ~array~0.base, ~array~0.offset + 4 * ~i~0, 4); srcloc: L11 {1917#(<= getNumbers_~i~0 1)} is VALID [2020-07-29 01:17:30,036 INFO L280 TraceCheckUtils]: 12: Hoare triple {1917#(<= getNumbers_~i~0 1)} #t~pre1 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre1; {1918#(<= getNumbers_~i~0 2)} is VALID [2020-07-29 01:17:30,037 INFO L280 TraceCheckUtils]: 13: Hoare triple {1918#(<= getNumbers_~i~0 2)} assume !!(~i~0 < 10); {1918#(<= getNumbers_~i~0 2)} is VALID [2020-07-29 01:17:30,037 INFO L280 TraceCheckUtils]: 14: Hoare triple {1918#(<= getNumbers_~i~0 2)} SUMMARY for call write~int(~i~0, ~array~0.base, ~array~0.offset + 4 * ~i~0, 4); srcloc: L11 {1918#(<= getNumbers_~i~0 2)} is VALID [2020-07-29 01:17:30,038 INFO L280 TraceCheckUtils]: 15: Hoare triple {1918#(<= getNumbers_~i~0 2)} #t~pre1 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre1; {1919#(<= getNumbers_~i~0 3)} is VALID [2020-07-29 01:17:30,039 INFO L280 TraceCheckUtils]: 16: Hoare triple {1919#(<= getNumbers_~i~0 3)} assume !!(~i~0 < 10); {1919#(<= getNumbers_~i~0 3)} is VALID [2020-07-29 01:17:30,040 INFO L280 TraceCheckUtils]: 17: Hoare triple {1919#(<= getNumbers_~i~0 3)} SUMMARY for call write~int(~i~0, ~array~0.base, ~array~0.offset + 4 * ~i~0, 4); srcloc: L11 {1919#(<= getNumbers_~i~0 3)} is VALID [2020-07-29 01:17:30,040 INFO L280 TraceCheckUtils]: 18: Hoare triple {1919#(<= getNumbers_~i~0 3)} #t~pre1 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre1; {1920#(<= getNumbers_~i~0 4)} is VALID [2020-07-29 01:17:30,041 INFO L280 TraceCheckUtils]: 19: Hoare triple {1920#(<= getNumbers_~i~0 4)} assume !!(~i~0 < 10); {1920#(<= getNumbers_~i~0 4)} is VALID [2020-07-29 01:17:30,042 INFO L280 TraceCheckUtils]: 20: Hoare triple {1920#(<= getNumbers_~i~0 4)} SUMMARY for call write~int(~i~0, ~array~0.base, ~array~0.offset + 4 * ~i~0, 4); srcloc: L11 {1920#(<= getNumbers_~i~0 4)} is VALID [2020-07-29 01:17:30,043 INFO L280 TraceCheckUtils]: 21: Hoare triple {1920#(<= getNumbers_~i~0 4)} #t~pre1 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre1; {1921#(<= getNumbers_~i~0 5)} is VALID [2020-07-29 01:17:30,043 INFO L280 TraceCheckUtils]: 22: Hoare triple {1921#(<= getNumbers_~i~0 5)} assume !!(~i~0 < 10); {1921#(<= getNumbers_~i~0 5)} is VALID [2020-07-29 01:17:30,044 INFO L280 TraceCheckUtils]: 23: Hoare triple {1921#(<= getNumbers_~i~0 5)} SUMMARY for call write~int(~i~0, ~array~0.base, ~array~0.offset + 4 * ~i~0, 4); srcloc: L11 {1921#(<= getNumbers_~i~0 5)} is VALID [2020-07-29 01:17:30,044 INFO L280 TraceCheckUtils]: 24: Hoare triple {1921#(<= getNumbers_~i~0 5)} #t~pre1 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre1; {1922#(<= getNumbers_~i~0 6)} is VALID [2020-07-29 01:17:30,045 INFO L280 TraceCheckUtils]: 25: Hoare triple {1922#(<= getNumbers_~i~0 6)} assume !!(~i~0 < 10); {1922#(<= getNumbers_~i~0 6)} is VALID [2020-07-29 01:17:30,045 INFO L280 TraceCheckUtils]: 26: Hoare triple {1922#(<= getNumbers_~i~0 6)} SUMMARY for call write~int(~i~0, ~array~0.base, ~array~0.offset + 4 * ~i~0, 4); srcloc: L11 {1922#(<= getNumbers_~i~0 6)} is VALID [2020-07-29 01:17:30,046 INFO L280 TraceCheckUtils]: 27: Hoare triple {1922#(<= getNumbers_~i~0 6)} #t~pre1 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre1; {1923#(<= getNumbers_~i~0 7)} is VALID [2020-07-29 01:17:30,046 INFO L280 TraceCheckUtils]: 28: Hoare triple {1923#(<= getNumbers_~i~0 7)} assume !(~i~0 < 10); {1884#false} is VALID [2020-07-29 01:17:30,047 INFO L280 TraceCheckUtils]: 29: Hoare triple {1884#false} #res.base, #res.offset := ~array~0.base, ~array~0.offset;call ULTIMATE.dealloc(#t~malloc0.base, #t~malloc0.offset);havoc #t~malloc0.base, #t~malloc0.offset; {1884#false} is VALID [2020-07-29 01:17:30,047 INFO L280 TraceCheckUtils]: 30: Hoare triple {1884#false} assume true; {1884#false} is VALID [2020-07-29 01:17:30,047 INFO L275 TraceCheckUtils]: 31: Hoare quadruple {1884#false} {1883#true} #51#return; {1884#false} is VALID [2020-07-29 01:17:30,047 INFO L280 TraceCheckUtils]: 32: Hoare triple {1884#false} ~numbers~0.base, ~numbers~0.offset := #t~ret2.base, #t~ret2.offset;havoc #t~ret2.base, #t~ret2.offset;~i~1 := 0; {1884#false} is VALID [2020-07-29 01:17:30,047 INFO L280 TraceCheckUtils]: 33: Hoare triple {1884#false} assume !!(~i~1 < 10);havoc #t~nondet4; {1884#false} is VALID [2020-07-29 01:17:30,047 INFO L280 TraceCheckUtils]: 34: Hoare triple {1884#false} assume !(1 == #valid[~numbers~0.base]); {1884#false} is VALID [2020-07-29 01:17:30,048 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:17:30,049 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-29 01:17:30,049 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 13 [2020-07-29 01:17:30,049 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502466033] [2020-07-29 01:17:30,049 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 35 [2020-07-29 01:17:30,050 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:17:30,050 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2020-07-29 01:17:30,102 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:17:30,103 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-07-29 01:17:30,103 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:17:30,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-07-29 01:17:30,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2020-07-29 01:17:30,104 INFO L87 Difference]: Start difference. First operand 42 states and 43 transitions. Second operand 13 states. [2020-07-29 01:17:30,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:17:30,425 INFO L93 Difference]: Finished difference Result 47 states and 48 transitions. [2020-07-29 01:17:30,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-07-29 01:17:30,425 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 35 [2020-07-29 01:17:30,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:17:30,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-29 01:17:30,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 49 transitions. [2020-07-29 01:17:30,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-29 01:17:30,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 49 transitions. [2020-07-29 01:17:30,429 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 49 transitions. [2020-07-29 01:17:30,512 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:17:30,514 INFO L225 Difference]: With dead ends: 47 [2020-07-29 01:17:30,514 INFO L226 Difference]: Without dead ends: 47 [2020-07-29 01:17:30,515 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2020-07-29 01:17:30,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2020-07-29 01:17:30,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 45. [2020-07-29 01:17:30,519 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:17:30,519 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states. Second operand 45 states. [2020-07-29 01:17:30,519 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 45 states. [2020-07-29 01:17:30,519 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 45 states. [2020-07-29 01:17:30,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:17:30,521 INFO L93 Difference]: Finished difference Result 47 states and 48 transitions. [2020-07-29 01:17:30,521 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 48 transitions. [2020-07-29 01:17:30,521 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:17:30,521 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:17:30,522 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand 47 states. [2020-07-29 01:17:30,522 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 47 states. [2020-07-29 01:17:30,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:17:30,523 INFO L93 Difference]: Finished difference Result 47 states and 48 transitions. [2020-07-29 01:17:30,524 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 48 transitions. [2020-07-29 01:17:30,524 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:17:30,524 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:17:30,524 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:17:30,525 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:17:30,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2020-07-29 01:17:30,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2020-07-29 01:17:30,526 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 35 [2020-07-29 01:17:30,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:17:30,526 INFO L479 AbstractCegarLoop]: Abstraction has 45 states and 46 transitions. [2020-07-29 01:17:30,527 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-07-29 01:17:30,527 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2020-07-29 01:17:30,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2020-07-29 01:17:30,527 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:17:30,528 INFO L422 BasicCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:17:30,740 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2020-07-29 01:17:30,741 INFO L427 AbstractCegarLoop]: === Iteration 11 === [mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2020-07-29 01:17:30,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:17:30,742 INFO L82 PathProgramCache]: Analyzing trace with hash -673480641, now seen corresponding path program 7 times [2020-07-29 01:17:30,745 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:17:30,746 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743436045] [2020-07-29 01:17:30,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:17:30,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:17:30,795 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-07-29 01:17:30,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:17:30,803 INFO L280 TraceCheckUtils]: 0: Hoare triple {2251#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |#t~string5.offset| |old(#t~string5.offset)|) (= |old(#length)| |#length|) (= |#t~string5.base| |old(#t~string5.base)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(4);call write~init~int(37, #t~string5.base, #t~string5.offset, 1);call write~init~int(100, #t~string5.base, 1 + #t~string5.offset, 1);call write~init~int(10, #t~string5.base, 2 + #t~string5.offset, 1);call write~init~int(0, #t~string5.base, 3 + #t~string5.offset, 1); {2217#true} is VALID [2020-07-29 01:17:30,803 INFO L280 TraceCheckUtils]: 1: Hoare triple {2217#true} assume true; {2217#true} is VALID [2020-07-29 01:17:30,804 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2217#true} {2217#true} #47#return; {2217#true} is VALID [2020-07-29 01:17:30,816 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-07-29 01:17:30,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:17:30,987 INFO L280 TraceCheckUtils]: 0: Hoare triple {2252#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnStack(40);~array~0.base, ~array~0.offset := #t~malloc0.base, #t~malloc0.offset;~i~0 := 0; {2253#(= 0 getNumbers_~i~0)} is VALID [2020-07-29 01:17:30,988 INFO L280 TraceCheckUtils]: 1: Hoare triple {2253#(= 0 getNumbers_~i~0)} assume !!(~i~0 < 10); {2253#(= 0 getNumbers_~i~0)} is VALID [2020-07-29 01:17:30,989 INFO L280 TraceCheckUtils]: 2: Hoare triple {2253#(= 0 getNumbers_~i~0)} SUMMARY for call write~int(~i~0, ~array~0.base, ~array~0.offset + 4 * ~i~0, 4); srcloc: L11 {2253#(= 0 getNumbers_~i~0)} is VALID [2020-07-29 01:17:30,990 INFO L280 TraceCheckUtils]: 3: Hoare triple {2253#(= 0 getNumbers_~i~0)} #t~pre1 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre1; {2254#(<= getNumbers_~i~0 1)} is VALID [2020-07-29 01:17:30,991 INFO L280 TraceCheckUtils]: 4: Hoare triple {2254#(<= getNumbers_~i~0 1)} assume !!(~i~0 < 10); {2254#(<= getNumbers_~i~0 1)} is VALID [2020-07-29 01:17:30,991 INFO L280 TraceCheckUtils]: 5: Hoare triple {2254#(<= getNumbers_~i~0 1)} SUMMARY for call write~int(~i~0, ~array~0.base, ~array~0.offset + 4 * ~i~0, 4); srcloc: L11 {2254#(<= getNumbers_~i~0 1)} is VALID [2020-07-29 01:17:30,992 INFO L280 TraceCheckUtils]: 6: Hoare triple {2254#(<= getNumbers_~i~0 1)} #t~pre1 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre1; {2255#(<= getNumbers_~i~0 2)} is VALID [2020-07-29 01:17:30,993 INFO L280 TraceCheckUtils]: 7: Hoare triple {2255#(<= getNumbers_~i~0 2)} assume !!(~i~0 < 10); {2255#(<= getNumbers_~i~0 2)} is VALID [2020-07-29 01:17:30,994 INFO L280 TraceCheckUtils]: 8: Hoare triple {2255#(<= getNumbers_~i~0 2)} SUMMARY for call write~int(~i~0, ~array~0.base, ~array~0.offset + 4 * ~i~0, 4); srcloc: L11 {2255#(<= getNumbers_~i~0 2)} is VALID [2020-07-29 01:17:30,995 INFO L280 TraceCheckUtils]: 9: Hoare triple {2255#(<= getNumbers_~i~0 2)} #t~pre1 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre1; {2256#(<= getNumbers_~i~0 3)} is VALID [2020-07-29 01:17:30,996 INFO L280 TraceCheckUtils]: 10: Hoare triple {2256#(<= getNumbers_~i~0 3)} assume !!(~i~0 < 10); {2256#(<= getNumbers_~i~0 3)} is VALID [2020-07-29 01:17:30,997 INFO L280 TraceCheckUtils]: 11: Hoare triple {2256#(<= getNumbers_~i~0 3)} SUMMARY for call write~int(~i~0, ~array~0.base, ~array~0.offset + 4 * ~i~0, 4); srcloc: L11 {2256#(<= getNumbers_~i~0 3)} is VALID [2020-07-29 01:17:30,998 INFO L280 TraceCheckUtils]: 12: Hoare triple {2256#(<= getNumbers_~i~0 3)} #t~pre1 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre1; {2257#(<= getNumbers_~i~0 4)} is VALID [2020-07-29 01:17:30,999 INFO L280 TraceCheckUtils]: 13: Hoare triple {2257#(<= getNumbers_~i~0 4)} assume !!(~i~0 < 10); {2257#(<= getNumbers_~i~0 4)} is VALID [2020-07-29 01:17:30,999 INFO L280 TraceCheckUtils]: 14: Hoare triple {2257#(<= getNumbers_~i~0 4)} SUMMARY for call write~int(~i~0, ~array~0.base, ~array~0.offset + 4 * ~i~0, 4); srcloc: L11 {2257#(<= getNumbers_~i~0 4)} is VALID [2020-07-29 01:17:31,000 INFO L280 TraceCheckUtils]: 15: Hoare triple {2257#(<= getNumbers_~i~0 4)} #t~pre1 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre1; {2258#(<= getNumbers_~i~0 5)} is VALID [2020-07-29 01:17:31,001 INFO L280 TraceCheckUtils]: 16: Hoare triple {2258#(<= getNumbers_~i~0 5)} assume !!(~i~0 < 10); {2258#(<= getNumbers_~i~0 5)} is VALID [2020-07-29 01:17:31,002 INFO L280 TraceCheckUtils]: 17: Hoare triple {2258#(<= getNumbers_~i~0 5)} SUMMARY for call write~int(~i~0, ~array~0.base, ~array~0.offset + 4 * ~i~0, 4); srcloc: L11 {2258#(<= getNumbers_~i~0 5)} is VALID [2020-07-29 01:17:31,003 INFO L280 TraceCheckUtils]: 18: Hoare triple {2258#(<= getNumbers_~i~0 5)} #t~pre1 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre1; {2259#(<= getNumbers_~i~0 6)} is VALID [2020-07-29 01:17:31,004 INFO L280 TraceCheckUtils]: 19: Hoare triple {2259#(<= getNumbers_~i~0 6)} assume !!(~i~0 < 10); {2259#(<= getNumbers_~i~0 6)} is VALID [2020-07-29 01:17:31,004 INFO L280 TraceCheckUtils]: 20: Hoare triple {2259#(<= getNumbers_~i~0 6)} SUMMARY for call write~int(~i~0, ~array~0.base, ~array~0.offset + 4 * ~i~0, 4); srcloc: L11 {2259#(<= getNumbers_~i~0 6)} is VALID [2020-07-29 01:17:31,005 INFO L280 TraceCheckUtils]: 21: Hoare triple {2259#(<= getNumbers_~i~0 6)} #t~pre1 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre1; {2260#(<= getNumbers_~i~0 7)} is VALID [2020-07-29 01:17:31,006 INFO L280 TraceCheckUtils]: 22: Hoare triple {2260#(<= getNumbers_~i~0 7)} assume !!(~i~0 < 10); {2260#(<= getNumbers_~i~0 7)} is VALID [2020-07-29 01:17:31,007 INFO L280 TraceCheckUtils]: 23: Hoare triple {2260#(<= getNumbers_~i~0 7)} SUMMARY for call write~int(~i~0, ~array~0.base, ~array~0.offset + 4 * ~i~0, 4); srcloc: L11 {2260#(<= getNumbers_~i~0 7)} is VALID [2020-07-29 01:17:31,008 INFO L280 TraceCheckUtils]: 24: Hoare triple {2260#(<= getNumbers_~i~0 7)} #t~pre1 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre1; {2261#(<= getNumbers_~i~0 8)} is VALID [2020-07-29 01:17:31,009 INFO L280 TraceCheckUtils]: 25: Hoare triple {2261#(<= getNumbers_~i~0 8)} assume !(~i~0 < 10); {2218#false} is VALID [2020-07-29 01:17:31,009 INFO L280 TraceCheckUtils]: 26: Hoare triple {2218#false} #res.base, #res.offset := ~array~0.base, ~array~0.offset;call ULTIMATE.dealloc(#t~malloc0.base, #t~malloc0.offset);havoc #t~malloc0.base, #t~malloc0.offset; {2218#false} is VALID [2020-07-29 01:17:31,009 INFO L280 TraceCheckUtils]: 27: Hoare triple {2218#false} assume true; {2218#false} is VALID [2020-07-29 01:17:31,009 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {2218#false} {2217#true} #51#return; {2218#false} is VALID [2020-07-29 01:17:31,011 INFO L263 TraceCheckUtils]: 0: Hoare triple {2217#true} call ULTIMATE.init(); {2251#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |#t~string5.offset| |old(#t~string5.offset)|) (= |old(#length)| |#length|) (= |#t~string5.base| |old(#t~string5.base)|))} is VALID [2020-07-29 01:17:31,012 INFO L280 TraceCheckUtils]: 1: Hoare triple {2251#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |#t~string5.offset| |old(#t~string5.offset)|) (= |old(#length)| |#length|) (= |#t~string5.base| |old(#t~string5.base)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(4);call write~init~int(37, #t~string5.base, #t~string5.offset, 1);call write~init~int(100, #t~string5.base, 1 + #t~string5.offset, 1);call write~init~int(10, #t~string5.base, 2 + #t~string5.offset, 1);call write~init~int(0, #t~string5.base, 3 + #t~string5.offset, 1); {2217#true} is VALID [2020-07-29 01:17:31,012 INFO L280 TraceCheckUtils]: 2: Hoare triple {2217#true} assume true; {2217#true} is VALID [2020-07-29 01:17:31,012 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2217#true} {2217#true} #47#return; {2217#true} is VALID [2020-07-29 01:17:31,012 INFO L263 TraceCheckUtils]: 4: Hoare triple {2217#true} call #t~ret7 := main(); {2217#true} is VALID [2020-07-29 01:17:31,013 INFO L263 TraceCheckUtils]: 5: Hoare triple {2217#true} call #t~ret2.base, #t~ret2.offset := getNumbers(); {2252#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-29 01:17:31,014 INFO L280 TraceCheckUtils]: 6: Hoare triple {2252#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnStack(40);~array~0.base, ~array~0.offset := #t~malloc0.base, #t~malloc0.offset;~i~0 := 0; {2253#(= 0 getNumbers_~i~0)} is VALID [2020-07-29 01:17:31,015 INFO L280 TraceCheckUtils]: 7: Hoare triple {2253#(= 0 getNumbers_~i~0)} assume !!(~i~0 < 10); {2253#(= 0 getNumbers_~i~0)} is VALID [2020-07-29 01:17:31,016 INFO L280 TraceCheckUtils]: 8: Hoare triple {2253#(= 0 getNumbers_~i~0)} SUMMARY for call write~int(~i~0, ~array~0.base, ~array~0.offset + 4 * ~i~0, 4); srcloc: L11 {2253#(= 0 getNumbers_~i~0)} is VALID [2020-07-29 01:17:31,017 INFO L280 TraceCheckUtils]: 9: Hoare triple {2253#(= 0 getNumbers_~i~0)} #t~pre1 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre1; {2254#(<= getNumbers_~i~0 1)} is VALID [2020-07-29 01:17:31,017 INFO L280 TraceCheckUtils]: 10: Hoare triple {2254#(<= getNumbers_~i~0 1)} assume !!(~i~0 < 10); {2254#(<= getNumbers_~i~0 1)} is VALID [2020-07-29 01:17:31,018 INFO L280 TraceCheckUtils]: 11: Hoare triple {2254#(<= getNumbers_~i~0 1)} SUMMARY for call write~int(~i~0, ~array~0.base, ~array~0.offset + 4 * ~i~0, 4); srcloc: L11 {2254#(<= getNumbers_~i~0 1)} is VALID [2020-07-29 01:17:31,019 INFO L280 TraceCheckUtils]: 12: Hoare triple {2254#(<= getNumbers_~i~0 1)} #t~pre1 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre1; {2255#(<= getNumbers_~i~0 2)} is VALID [2020-07-29 01:17:31,020 INFO L280 TraceCheckUtils]: 13: Hoare triple {2255#(<= getNumbers_~i~0 2)} assume !!(~i~0 < 10); {2255#(<= getNumbers_~i~0 2)} is VALID [2020-07-29 01:17:31,020 INFO L280 TraceCheckUtils]: 14: Hoare triple {2255#(<= getNumbers_~i~0 2)} SUMMARY for call write~int(~i~0, ~array~0.base, ~array~0.offset + 4 * ~i~0, 4); srcloc: L11 {2255#(<= getNumbers_~i~0 2)} is VALID [2020-07-29 01:17:31,021 INFO L280 TraceCheckUtils]: 15: Hoare triple {2255#(<= getNumbers_~i~0 2)} #t~pre1 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre1; {2256#(<= getNumbers_~i~0 3)} is VALID [2020-07-29 01:17:31,022 INFO L280 TraceCheckUtils]: 16: Hoare triple {2256#(<= getNumbers_~i~0 3)} assume !!(~i~0 < 10); {2256#(<= getNumbers_~i~0 3)} is VALID [2020-07-29 01:17:31,023 INFO L280 TraceCheckUtils]: 17: Hoare triple {2256#(<= getNumbers_~i~0 3)} SUMMARY for call write~int(~i~0, ~array~0.base, ~array~0.offset + 4 * ~i~0, 4); srcloc: L11 {2256#(<= getNumbers_~i~0 3)} is VALID [2020-07-29 01:17:31,024 INFO L280 TraceCheckUtils]: 18: Hoare triple {2256#(<= getNumbers_~i~0 3)} #t~pre1 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre1; {2257#(<= getNumbers_~i~0 4)} is VALID [2020-07-29 01:17:31,025 INFO L280 TraceCheckUtils]: 19: Hoare triple {2257#(<= getNumbers_~i~0 4)} assume !!(~i~0 < 10); {2257#(<= getNumbers_~i~0 4)} is VALID [2020-07-29 01:17:31,025 INFO L280 TraceCheckUtils]: 20: Hoare triple {2257#(<= getNumbers_~i~0 4)} SUMMARY for call write~int(~i~0, ~array~0.base, ~array~0.offset + 4 * ~i~0, 4); srcloc: L11 {2257#(<= getNumbers_~i~0 4)} is VALID [2020-07-29 01:17:31,026 INFO L280 TraceCheckUtils]: 21: Hoare triple {2257#(<= getNumbers_~i~0 4)} #t~pre1 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre1; {2258#(<= getNumbers_~i~0 5)} is VALID [2020-07-29 01:17:31,027 INFO L280 TraceCheckUtils]: 22: Hoare triple {2258#(<= getNumbers_~i~0 5)} assume !!(~i~0 < 10); {2258#(<= getNumbers_~i~0 5)} is VALID [2020-07-29 01:17:31,028 INFO L280 TraceCheckUtils]: 23: Hoare triple {2258#(<= getNumbers_~i~0 5)} SUMMARY for call write~int(~i~0, ~array~0.base, ~array~0.offset + 4 * ~i~0, 4); srcloc: L11 {2258#(<= getNumbers_~i~0 5)} is VALID [2020-07-29 01:17:31,029 INFO L280 TraceCheckUtils]: 24: Hoare triple {2258#(<= getNumbers_~i~0 5)} #t~pre1 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre1; {2259#(<= getNumbers_~i~0 6)} is VALID [2020-07-29 01:17:31,030 INFO L280 TraceCheckUtils]: 25: Hoare triple {2259#(<= getNumbers_~i~0 6)} assume !!(~i~0 < 10); {2259#(<= getNumbers_~i~0 6)} is VALID [2020-07-29 01:17:31,031 INFO L280 TraceCheckUtils]: 26: Hoare triple {2259#(<= getNumbers_~i~0 6)} SUMMARY for call write~int(~i~0, ~array~0.base, ~array~0.offset + 4 * ~i~0, 4); srcloc: L11 {2259#(<= getNumbers_~i~0 6)} is VALID [2020-07-29 01:17:31,032 INFO L280 TraceCheckUtils]: 27: Hoare triple {2259#(<= getNumbers_~i~0 6)} #t~pre1 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre1; {2260#(<= getNumbers_~i~0 7)} is VALID [2020-07-29 01:17:31,033 INFO L280 TraceCheckUtils]: 28: Hoare triple {2260#(<= getNumbers_~i~0 7)} assume !!(~i~0 < 10); {2260#(<= getNumbers_~i~0 7)} is VALID [2020-07-29 01:17:31,034 INFO L280 TraceCheckUtils]: 29: Hoare triple {2260#(<= getNumbers_~i~0 7)} SUMMARY for call write~int(~i~0, ~array~0.base, ~array~0.offset + 4 * ~i~0, 4); srcloc: L11 {2260#(<= getNumbers_~i~0 7)} is VALID [2020-07-29 01:17:31,035 INFO L280 TraceCheckUtils]: 30: Hoare triple {2260#(<= getNumbers_~i~0 7)} #t~pre1 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre1; {2261#(<= getNumbers_~i~0 8)} is VALID [2020-07-29 01:17:31,036 INFO L280 TraceCheckUtils]: 31: Hoare triple {2261#(<= getNumbers_~i~0 8)} assume !(~i~0 < 10); {2218#false} is VALID [2020-07-29 01:17:31,036 INFO L280 TraceCheckUtils]: 32: Hoare triple {2218#false} #res.base, #res.offset := ~array~0.base, ~array~0.offset;call ULTIMATE.dealloc(#t~malloc0.base, #t~malloc0.offset);havoc #t~malloc0.base, #t~malloc0.offset; {2218#false} is VALID [2020-07-29 01:17:31,037 INFO L280 TraceCheckUtils]: 33: Hoare triple {2218#false} assume true; {2218#false} is VALID [2020-07-29 01:17:31,037 INFO L275 TraceCheckUtils]: 34: Hoare quadruple {2218#false} {2217#true} #51#return; {2218#false} is VALID [2020-07-29 01:17:31,037 INFO L280 TraceCheckUtils]: 35: Hoare triple {2218#false} ~numbers~0.base, ~numbers~0.offset := #t~ret2.base, #t~ret2.offset;havoc #t~ret2.base, #t~ret2.offset;~i~1 := 0; {2218#false} is VALID [2020-07-29 01:17:31,038 INFO L280 TraceCheckUtils]: 36: Hoare triple {2218#false} assume !!(~i~1 < 10);havoc #t~nondet4; {2218#false} is VALID [2020-07-29 01:17:31,038 INFO L280 TraceCheckUtils]: 37: Hoare triple {2218#false} assume !(1 == #valid[~numbers~0.base]); {2218#false} is VALID [2020-07-29 01:17:31,041 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:17:31,042 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743436045] [2020-07-29 01:17:31,042 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [312141230] [2020-07-29 01:17:31,043 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-29 01:17:31,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:17:31,109 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-29 01:17:31,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:17:31,122 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:17:31,400 INFO L263 TraceCheckUtils]: 0: Hoare triple {2217#true} call ULTIMATE.init(); {2217#true} is VALID [2020-07-29 01:17:31,401 INFO L280 TraceCheckUtils]: 1: Hoare triple {2217#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(4);call write~init~int(37, #t~string5.base, #t~string5.offset, 1);call write~init~int(100, #t~string5.base, 1 + #t~string5.offset, 1);call write~init~int(10, #t~string5.base, 2 + #t~string5.offset, 1);call write~init~int(0, #t~string5.base, 3 + #t~string5.offset, 1); {2217#true} is VALID [2020-07-29 01:17:31,401 INFO L280 TraceCheckUtils]: 2: Hoare triple {2217#true} assume true; {2217#true} is VALID [2020-07-29 01:17:31,401 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2217#true} {2217#true} #47#return; {2217#true} is VALID [2020-07-29 01:17:31,403 INFO L263 TraceCheckUtils]: 4: Hoare triple {2217#true} call #t~ret7 := main(); {2217#true} is VALID [2020-07-29 01:17:31,403 INFO L263 TraceCheckUtils]: 5: Hoare triple {2217#true} call #t~ret2.base, #t~ret2.offset := getNumbers(); {2217#true} is VALID [2020-07-29 01:17:31,404 INFO L280 TraceCheckUtils]: 6: Hoare triple {2217#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnStack(40);~array~0.base, ~array~0.offset := #t~malloc0.base, #t~malloc0.offset;~i~0 := 0; {2283#(<= getNumbers_~i~0 0)} is VALID [2020-07-29 01:17:31,405 INFO L280 TraceCheckUtils]: 7: Hoare triple {2283#(<= getNumbers_~i~0 0)} assume !!(~i~0 < 10); {2283#(<= getNumbers_~i~0 0)} is VALID [2020-07-29 01:17:31,405 INFO L280 TraceCheckUtils]: 8: Hoare triple {2283#(<= getNumbers_~i~0 0)} SUMMARY for call write~int(~i~0, ~array~0.base, ~array~0.offset + 4 * ~i~0, 4); srcloc: L11 {2283#(<= getNumbers_~i~0 0)} is VALID [2020-07-29 01:17:31,406 INFO L280 TraceCheckUtils]: 9: Hoare triple {2283#(<= getNumbers_~i~0 0)} #t~pre1 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre1; {2254#(<= getNumbers_~i~0 1)} is VALID [2020-07-29 01:17:31,407 INFO L280 TraceCheckUtils]: 10: Hoare triple {2254#(<= getNumbers_~i~0 1)} assume !!(~i~0 < 10); {2254#(<= getNumbers_~i~0 1)} is VALID [2020-07-29 01:17:31,408 INFO L280 TraceCheckUtils]: 11: Hoare triple {2254#(<= getNumbers_~i~0 1)} SUMMARY for call write~int(~i~0, ~array~0.base, ~array~0.offset + 4 * ~i~0, 4); srcloc: L11 {2254#(<= getNumbers_~i~0 1)} is VALID [2020-07-29 01:17:31,409 INFO L280 TraceCheckUtils]: 12: Hoare triple {2254#(<= getNumbers_~i~0 1)} #t~pre1 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre1; {2255#(<= getNumbers_~i~0 2)} is VALID [2020-07-29 01:17:31,410 INFO L280 TraceCheckUtils]: 13: Hoare triple {2255#(<= getNumbers_~i~0 2)} assume !!(~i~0 < 10); {2255#(<= getNumbers_~i~0 2)} is VALID [2020-07-29 01:17:31,411 INFO L280 TraceCheckUtils]: 14: Hoare triple {2255#(<= getNumbers_~i~0 2)} SUMMARY for call write~int(~i~0, ~array~0.base, ~array~0.offset + 4 * ~i~0, 4); srcloc: L11 {2255#(<= getNumbers_~i~0 2)} is VALID [2020-07-29 01:17:31,411 INFO L280 TraceCheckUtils]: 15: Hoare triple {2255#(<= getNumbers_~i~0 2)} #t~pre1 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre1; {2256#(<= getNumbers_~i~0 3)} is VALID [2020-07-29 01:17:31,412 INFO L280 TraceCheckUtils]: 16: Hoare triple {2256#(<= getNumbers_~i~0 3)} assume !!(~i~0 < 10); {2256#(<= getNumbers_~i~0 3)} is VALID [2020-07-29 01:17:31,413 INFO L280 TraceCheckUtils]: 17: Hoare triple {2256#(<= getNumbers_~i~0 3)} SUMMARY for call write~int(~i~0, ~array~0.base, ~array~0.offset + 4 * ~i~0, 4); srcloc: L11 {2256#(<= getNumbers_~i~0 3)} is VALID [2020-07-29 01:17:31,414 INFO L280 TraceCheckUtils]: 18: Hoare triple {2256#(<= getNumbers_~i~0 3)} #t~pre1 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre1; {2257#(<= getNumbers_~i~0 4)} is VALID [2020-07-29 01:17:31,414 INFO L280 TraceCheckUtils]: 19: Hoare triple {2257#(<= getNumbers_~i~0 4)} assume !!(~i~0 < 10); {2257#(<= getNumbers_~i~0 4)} is VALID [2020-07-29 01:17:31,415 INFO L280 TraceCheckUtils]: 20: Hoare triple {2257#(<= getNumbers_~i~0 4)} SUMMARY for call write~int(~i~0, ~array~0.base, ~array~0.offset + 4 * ~i~0, 4); srcloc: L11 {2257#(<= getNumbers_~i~0 4)} is VALID [2020-07-29 01:17:31,416 INFO L280 TraceCheckUtils]: 21: Hoare triple {2257#(<= getNumbers_~i~0 4)} #t~pre1 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre1; {2258#(<= getNumbers_~i~0 5)} is VALID [2020-07-29 01:17:31,417 INFO L280 TraceCheckUtils]: 22: Hoare triple {2258#(<= getNumbers_~i~0 5)} assume !!(~i~0 < 10); {2258#(<= getNumbers_~i~0 5)} is VALID [2020-07-29 01:17:31,417 INFO L280 TraceCheckUtils]: 23: Hoare triple {2258#(<= getNumbers_~i~0 5)} SUMMARY for call write~int(~i~0, ~array~0.base, ~array~0.offset + 4 * ~i~0, 4); srcloc: L11 {2258#(<= getNumbers_~i~0 5)} is VALID [2020-07-29 01:17:31,418 INFO L280 TraceCheckUtils]: 24: Hoare triple {2258#(<= getNumbers_~i~0 5)} #t~pre1 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre1; {2259#(<= getNumbers_~i~0 6)} is VALID [2020-07-29 01:17:31,419 INFO L280 TraceCheckUtils]: 25: Hoare triple {2259#(<= getNumbers_~i~0 6)} assume !!(~i~0 < 10); {2259#(<= getNumbers_~i~0 6)} is VALID [2020-07-29 01:17:31,419 INFO L280 TraceCheckUtils]: 26: Hoare triple {2259#(<= getNumbers_~i~0 6)} SUMMARY for call write~int(~i~0, ~array~0.base, ~array~0.offset + 4 * ~i~0, 4); srcloc: L11 {2259#(<= getNumbers_~i~0 6)} is VALID [2020-07-29 01:17:31,420 INFO L280 TraceCheckUtils]: 27: Hoare triple {2259#(<= getNumbers_~i~0 6)} #t~pre1 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre1; {2260#(<= getNumbers_~i~0 7)} is VALID [2020-07-29 01:17:31,421 INFO L280 TraceCheckUtils]: 28: Hoare triple {2260#(<= getNumbers_~i~0 7)} assume !!(~i~0 < 10); {2260#(<= getNumbers_~i~0 7)} is VALID [2020-07-29 01:17:31,422 INFO L280 TraceCheckUtils]: 29: Hoare triple {2260#(<= getNumbers_~i~0 7)} SUMMARY for call write~int(~i~0, ~array~0.base, ~array~0.offset + 4 * ~i~0, 4); srcloc: L11 {2260#(<= getNumbers_~i~0 7)} is VALID [2020-07-29 01:17:31,423 INFO L280 TraceCheckUtils]: 30: Hoare triple {2260#(<= getNumbers_~i~0 7)} #t~pre1 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre1; {2261#(<= getNumbers_~i~0 8)} is VALID [2020-07-29 01:17:31,424 INFO L280 TraceCheckUtils]: 31: Hoare triple {2261#(<= getNumbers_~i~0 8)} assume !(~i~0 < 10); {2218#false} is VALID [2020-07-29 01:17:31,424 INFO L280 TraceCheckUtils]: 32: Hoare triple {2218#false} #res.base, #res.offset := ~array~0.base, ~array~0.offset;call ULTIMATE.dealloc(#t~malloc0.base, #t~malloc0.offset);havoc #t~malloc0.base, #t~malloc0.offset; {2218#false} is VALID [2020-07-29 01:17:31,424 INFO L280 TraceCheckUtils]: 33: Hoare triple {2218#false} assume true; {2218#false} is VALID [2020-07-29 01:17:31,424 INFO L275 TraceCheckUtils]: 34: Hoare quadruple {2218#false} {2217#true} #51#return; {2218#false} is VALID [2020-07-29 01:17:31,425 INFO L280 TraceCheckUtils]: 35: Hoare triple {2218#false} ~numbers~0.base, ~numbers~0.offset := #t~ret2.base, #t~ret2.offset;havoc #t~ret2.base, #t~ret2.offset;~i~1 := 0; {2218#false} is VALID [2020-07-29 01:17:31,425 INFO L280 TraceCheckUtils]: 36: Hoare triple {2218#false} assume !!(~i~1 < 10);havoc #t~nondet4; {2218#false} is VALID [2020-07-29 01:17:31,425 INFO L280 TraceCheckUtils]: 37: Hoare triple {2218#false} assume !(1 == #valid[~numbers~0.base]); {2218#false} is VALID [2020-07-29 01:17:31,427 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:17:31,427 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-29 01:17:31,427 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 14 [2020-07-29 01:17:31,428 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957648279] [2020-07-29 01:17:31,428 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 38 [2020-07-29 01:17:31,429 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:17:31,429 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2020-07-29 01:17:31,484 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:17:31,485 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-07-29 01:17:31,485 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:17:31,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-07-29 01:17:31,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2020-07-29 01:17:31,486 INFO L87 Difference]: Start difference. First operand 45 states and 46 transitions. Second operand 14 states. [2020-07-29 01:17:31,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:17:31,790 INFO L93 Difference]: Finished difference Result 50 states and 51 transitions. [2020-07-29 01:17:31,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-07-29 01:17:31,790 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 38 [2020-07-29 01:17:31,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:17:31,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-07-29 01:17:31,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 52 transitions. [2020-07-29 01:17:31,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-07-29 01:17:31,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 52 transitions. [2020-07-29 01:17:31,793 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 52 transitions. [2020-07-29 01:17:31,859 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:17:31,860 INFO L225 Difference]: With dead ends: 50 [2020-07-29 01:17:31,861 INFO L226 Difference]: Without dead ends: 50 [2020-07-29 01:17:31,861 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2020-07-29 01:17:31,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2020-07-29 01:17:31,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 48. [2020-07-29 01:17:31,865 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:17:31,865 INFO L82 GeneralOperation]: Start isEquivalent. First operand 50 states. Second operand 48 states. [2020-07-29 01:17:31,865 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand 48 states. [2020-07-29 01:17:31,866 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 48 states. [2020-07-29 01:17:31,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:17:31,867 INFO L93 Difference]: Finished difference Result 50 states and 51 transitions. [2020-07-29 01:17:31,868 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 51 transitions. [2020-07-29 01:17:31,868 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:17:31,868 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:17:31,868 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand 50 states. [2020-07-29 01:17:31,869 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 50 states. [2020-07-29 01:17:31,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:17:31,870 INFO L93 Difference]: Finished difference Result 50 states and 51 transitions. [2020-07-29 01:17:31,870 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 51 transitions. [2020-07-29 01:17:31,871 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:17:31,871 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:17:31,871 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:17:31,871 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:17:31,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2020-07-29 01:17:31,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 49 transitions. [2020-07-29 01:17:31,873 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 49 transitions. Word has length 38 [2020-07-29 01:17:31,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:17:31,873 INFO L479 AbstractCegarLoop]: Abstraction has 48 states and 49 transitions. [2020-07-29 01:17:31,874 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-07-29 01:17:31,874 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 49 transitions. [2020-07-29 01:17:31,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-07-29 01:17:31,874 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:17:31,875 INFO L422 BasicCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:17:32,077 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-29 01:17:32,078 INFO L427 AbstractCegarLoop]: === Iteration 12 === [mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2020-07-29 01:17:32,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:17:32,079 INFO L82 PathProgramCache]: Analyzing trace with hash 1510442024, now seen corresponding path program 8 times [2020-07-29 01:17:32,079 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:17:32,079 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383647532] [2020-07-29 01:17:32,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:17:32,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:17:32,139 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-07-29 01:17:32,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:17:32,143 INFO L280 TraceCheckUtils]: 0: Hoare triple {2613#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |#t~string5.offset| |old(#t~string5.offset)|) (= |old(#length)| |#length|) (= |#t~string5.base| |old(#t~string5.base)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(4);call write~init~int(37, #t~string5.base, #t~string5.offset, 1);call write~init~int(100, #t~string5.base, 1 + #t~string5.offset, 1);call write~init~int(10, #t~string5.base, 2 + #t~string5.offset, 1);call write~init~int(0, #t~string5.base, 3 + #t~string5.offset, 1); {2576#true} is VALID [2020-07-29 01:17:32,144 INFO L280 TraceCheckUtils]: 1: Hoare triple {2576#true} assume true; {2576#true} is VALID [2020-07-29 01:17:32,144 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2576#true} {2576#true} #47#return; {2576#true} is VALID [2020-07-29 01:17:32,154 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-07-29 01:17:32,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:17:32,308 INFO L280 TraceCheckUtils]: 0: Hoare triple {2614#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnStack(40);~array~0.base, ~array~0.offset := #t~malloc0.base, #t~malloc0.offset;~i~0 := 0; {2615#(= 0 getNumbers_~i~0)} is VALID [2020-07-29 01:17:32,309 INFO L280 TraceCheckUtils]: 1: Hoare triple {2615#(= 0 getNumbers_~i~0)} assume !!(~i~0 < 10); {2615#(= 0 getNumbers_~i~0)} is VALID [2020-07-29 01:17:32,310 INFO L280 TraceCheckUtils]: 2: Hoare triple {2615#(= 0 getNumbers_~i~0)} SUMMARY for call write~int(~i~0, ~array~0.base, ~array~0.offset + 4 * ~i~0, 4); srcloc: L11 {2615#(= 0 getNumbers_~i~0)} is VALID [2020-07-29 01:17:32,310 INFO L280 TraceCheckUtils]: 3: Hoare triple {2615#(= 0 getNumbers_~i~0)} #t~pre1 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre1; {2616#(<= getNumbers_~i~0 1)} is VALID [2020-07-29 01:17:32,311 INFO L280 TraceCheckUtils]: 4: Hoare triple {2616#(<= getNumbers_~i~0 1)} assume !!(~i~0 < 10); {2616#(<= getNumbers_~i~0 1)} is VALID [2020-07-29 01:17:32,312 INFO L280 TraceCheckUtils]: 5: Hoare triple {2616#(<= getNumbers_~i~0 1)} SUMMARY for call write~int(~i~0, ~array~0.base, ~array~0.offset + 4 * ~i~0, 4); srcloc: L11 {2616#(<= getNumbers_~i~0 1)} is VALID [2020-07-29 01:17:32,313 INFO L280 TraceCheckUtils]: 6: Hoare triple {2616#(<= getNumbers_~i~0 1)} #t~pre1 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre1; {2617#(<= getNumbers_~i~0 2)} is VALID [2020-07-29 01:17:32,314 INFO L280 TraceCheckUtils]: 7: Hoare triple {2617#(<= getNumbers_~i~0 2)} assume !!(~i~0 < 10); {2617#(<= getNumbers_~i~0 2)} is VALID [2020-07-29 01:17:32,314 INFO L280 TraceCheckUtils]: 8: Hoare triple {2617#(<= getNumbers_~i~0 2)} SUMMARY for call write~int(~i~0, ~array~0.base, ~array~0.offset + 4 * ~i~0, 4); srcloc: L11 {2617#(<= getNumbers_~i~0 2)} is VALID [2020-07-29 01:17:32,315 INFO L280 TraceCheckUtils]: 9: Hoare triple {2617#(<= getNumbers_~i~0 2)} #t~pre1 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre1; {2618#(<= getNumbers_~i~0 3)} is VALID [2020-07-29 01:17:32,316 INFO L280 TraceCheckUtils]: 10: Hoare triple {2618#(<= getNumbers_~i~0 3)} assume !!(~i~0 < 10); {2618#(<= getNumbers_~i~0 3)} is VALID [2020-07-29 01:17:32,316 INFO L280 TraceCheckUtils]: 11: Hoare triple {2618#(<= getNumbers_~i~0 3)} SUMMARY for call write~int(~i~0, ~array~0.base, ~array~0.offset + 4 * ~i~0, 4); srcloc: L11 {2618#(<= getNumbers_~i~0 3)} is VALID [2020-07-29 01:17:32,317 INFO L280 TraceCheckUtils]: 12: Hoare triple {2618#(<= getNumbers_~i~0 3)} #t~pre1 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre1; {2619#(<= getNumbers_~i~0 4)} is VALID [2020-07-29 01:17:32,318 INFO L280 TraceCheckUtils]: 13: Hoare triple {2619#(<= getNumbers_~i~0 4)} assume !!(~i~0 < 10); {2619#(<= getNumbers_~i~0 4)} is VALID [2020-07-29 01:17:32,319 INFO L280 TraceCheckUtils]: 14: Hoare triple {2619#(<= getNumbers_~i~0 4)} SUMMARY for call write~int(~i~0, ~array~0.base, ~array~0.offset + 4 * ~i~0, 4); srcloc: L11 {2619#(<= getNumbers_~i~0 4)} is VALID [2020-07-29 01:17:32,319 INFO L280 TraceCheckUtils]: 15: Hoare triple {2619#(<= getNumbers_~i~0 4)} #t~pre1 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre1; {2620#(<= getNumbers_~i~0 5)} is VALID [2020-07-29 01:17:32,320 INFO L280 TraceCheckUtils]: 16: Hoare triple {2620#(<= getNumbers_~i~0 5)} assume !!(~i~0 < 10); {2620#(<= getNumbers_~i~0 5)} is VALID [2020-07-29 01:17:32,321 INFO L280 TraceCheckUtils]: 17: Hoare triple {2620#(<= getNumbers_~i~0 5)} SUMMARY for call write~int(~i~0, ~array~0.base, ~array~0.offset + 4 * ~i~0, 4); srcloc: L11 {2620#(<= getNumbers_~i~0 5)} is VALID [2020-07-29 01:17:32,322 INFO L280 TraceCheckUtils]: 18: Hoare triple {2620#(<= getNumbers_~i~0 5)} #t~pre1 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre1; {2621#(<= getNumbers_~i~0 6)} is VALID [2020-07-29 01:17:32,322 INFO L280 TraceCheckUtils]: 19: Hoare triple {2621#(<= getNumbers_~i~0 6)} assume !!(~i~0 < 10); {2621#(<= getNumbers_~i~0 6)} is VALID [2020-07-29 01:17:32,323 INFO L280 TraceCheckUtils]: 20: Hoare triple {2621#(<= getNumbers_~i~0 6)} SUMMARY for call write~int(~i~0, ~array~0.base, ~array~0.offset + 4 * ~i~0, 4); srcloc: L11 {2621#(<= getNumbers_~i~0 6)} is VALID [2020-07-29 01:17:32,324 INFO L280 TraceCheckUtils]: 21: Hoare triple {2621#(<= getNumbers_~i~0 6)} #t~pre1 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre1; {2622#(<= getNumbers_~i~0 7)} is VALID [2020-07-29 01:17:32,324 INFO L280 TraceCheckUtils]: 22: Hoare triple {2622#(<= getNumbers_~i~0 7)} assume !!(~i~0 < 10); {2622#(<= getNumbers_~i~0 7)} is VALID [2020-07-29 01:17:32,325 INFO L280 TraceCheckUtils]: 23: Hoare triple {2622#(<= getNumbers_~i~0 7)} SUMMARY for call write~int(~i~0, ~array~0.base, ~array~0.offset + 4 * ~i~0, 4); srcloc: L11 {2622#(<= getNumbers_~i~0 7)} is VALID [2020-07-29 01:17:32,326 INFO L280 TraceCheckUtils]: 24: Hoare triple {2622#(<= getNumbers_~i~0 7)} #t~pre1 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre1; {2623#(<= getNumbers_~i~0 8)} is VALID [2020-07-29 01:17:32,326 INFO L280 TraceCheckUtils]: 25: Hoare triple {2623#(<= getNumbers_~i~0 8)} assume !!(~i~0 < 10); {2623#(<= getNumbers_~i~0 8)} is VALID [2020-07-29 01:17:32,327 INFO L280 TraceCheckUtils]: 26: Hoare triple {2623#(<= getNumbers_~i~0 8)} SUMMARY for call write~int(~i~0, ~array~0.base, ~array~0.offset + 4 * ~i~0, 4); srcloc: L11 {2623#(<= getNumbers_~i~0 8)} is VALID [2020-07-29 01:17:32,328 INFO L280 TraceCheckUtils]: 27: Hoare triple {2623#(<= getNumbers_~i~0 8)} #t~pre1 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre1; {2624#(<= getNumbers_~i~0 9)} is VALID [2020-07-29 01:17:32,329 INFO L280 TraceCheckUtils]: 28: Hoare triple {2624#(<= getNumbers_~i~0 9)} assume !(~i~0 < 10); {2577#false} is VALID [2020-07-29 01:17:32,329 INFO L280 TraceCheckUtils]: 29: Hoare triple {2577#false} #res.base, #res.offset := ~array~0.base, ~array~0.offset;call ULTIMATE.dealloc(#t~malloc0.base, #t~malloc0.offset);havoc #t~malloc0.base, #t~malloc0.offset; {2577#false} is VALID [2020-07-29 01:17:32,329 INFO L280 TraceCheckUtils]: 30: Hoare triple {2577#false} assume true; {2577#false} is VALID [2020-07-29 01:17:32,330 INFO L275 TraceCheckUtils]: 31: Hoare quadruple {2577#false} {2576#true} #51#return; {2577#false} is VALID [2020-07-29 01:17:32,332 INFO L263 TraceCheckUtils]: 0: Hoare triple {2576#true} call ULTIMATE.init(); {2613#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |#t~string5.offset| |old(#t~string5.offset)|) (= |old(#length)| |#length|) (= |#t~string5.base| |old(#t~string5.base)|))} is VALID [2020-07-29 01:17:32,332 INFO L280 TraceCheckUtils]: 1: Hoare triple {2613#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |#t~string5.offset| |old(#t~string5.offset)|) (= |old(#length)| |#length|) (= |#t~string5.base| |old(#t~string5.base)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(4);call write~init~int(37, #t~string5.base, #t~string5.offset, 1);call write~init~int(100, #t~string5.base, 1 + #t~string5.offset, 1);call write~init~int(10, #t~string5.base, 2 + #t~string5.offset, 1);call write~init~int(0, #t~string5.base, 3 + #t~string5.offset, 1); {2576#true} is VALID [2020-07-29 01:17:32,332 INFO L280 TraceCheckUtils]: 2: Hoare triple {2576#true} assume true; {2576#true} is VALID [2020-07-29 01:17:32,332 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2576#true} {2576#true} #47#return; {2576#true} is VALID [2020-07-29 01:17:32,332 INFO L263 TraceCheckUtils]: 4: Hoare triple {2576#true} call #t~ret7 := main(); {2576#true} is VALID [2020-07-29 01:17:32,333 INFO L263 TraceCheckUtils]: 5: Hoare triple {2576#true} call #t~ret2.base, #t~ret2.offset := getNumbers(); {2614#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-29 01:17:32,334 INFO L280 TraceCheckUtils]: 6: Hoare triple {2614#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnStack(40);~array~0.base, ~array~0.offset := #t~malloc0.base, #t~malloc0.offset;~i~0 := 0; {2615#(= 0 getNumbers_~i~0)} is VALID [2020-07-29 01:17:32,335 INFO L280 TraceCheckUtils]: 7: Hoare triple {2615#(= 0 getNumbers_~i~0)} assume !!(~i~0 < 10); {2615#(= 0 getNumbers_~i~0)} is VALID [2020-07-29 01:17:32,336 INFO L280 TraceCheckUtils]: 8: Hoare triple {2615#(= 0 getNumbers_~i~0)} SUMMARY for call write~int(~i~0, ~array~0.base, ~array~0.offset + 4 * ~i~0, 4); srcloc: L11 {2615#(= 0 getNumbers_~i~0)} is VALID [2020-07-29 01:17:32,336 INFO L280 TraceCheckUtils]: 9: Hoare triple {2615#(= 0 getNumbers_~i~0)} #t~pre1 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre1; {2616#(<= getNumbers_~i~0 1)} is VALID [2020-07-29 01:17:32,337 INFO L280 TraceCheckUtils]: 10: Hoare triple {2616#(<= getNumbers_~i~0 1)} assume !!(~i~0 < 10); {2616#(<= getNumbers_~i~0 1)} is VALID [2020-07-29 01:17:32,338 INFO L280 TraceCheckUtils]: 11: Hoare triple {2616#(<= getNumbers_~i~0 1)} SUMMARY for call write~int(~i~0, ~array~0.base, ~array~0.offset + 4 * ~i~0, 4); srcloc: L11 {2616#(<= getNumbers_~i~0 1)} is VALID [2020-07-29 01:17:32,338 INFO L280 TraceCheckUtils]: 12: Hoare triple {2616#(<= getNumbers_~i~0 1)} #t~pre1 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre1; {2617#(<= getNumbers_~i~0 2)} is VALID [2020-07-29 01:17:32,339 INFO L280 TraceCheckUtils]: 13: Hoare triple {2617#(<= getNumbers_~i~0 2)} assume !!(~i~0 < 10); {2617#(<= getNumbers_~i~0 2)} is VALID [2020-07-29 01:17:32,340 INFO L280 TraceCheckUtils]: 14: Hoare triple {2617#(<= getNumbers_~i~0 2)} SUMMARY for call write~int(~i~0, ~array~0.base, ~array~0.offset + 4 * ~i~0, 4); srcloc: L11 {2617#(<= getNumbers_~i~0 2)} is VALID [2020-07-29 01:17:32,340 INFO L280 TraceCheckUtils]: 15: Hoare triple {2617#(<= getNumbers_~i~0 2)} #t~pre1 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre1; {2618#(<= getNumbers_~i~0 3)} is VALID [2020-07-29 01:17:32,341 INFO L280 TraceCheckUtils]: 16: Hoare triple {2618#(<= getNumbers_~i~0 3)} assume !!(~i~0 < 10); {2618#(<= getNumbers_~i~0 3)} is VALID [2020-07-29 01:17:32,342 INFO L280 TraceCheckUtils]: 17: Hoare triple {2618#(<= getNumbers_~i~0 3)} SUMMARY for call write~int(~i~0, ~array~0.base, ~array~0.offset + 4 * ~i~0, 4); srcloc: L11 {2618#(<= getNumbers_~i~0 3)} is VALID [2020-07-29 01:17:32,342 INFO L280 TraceCheckUtils]: 18: Hoare triple {2618#(<= getNumbers_~i~0 3)} #t~pre1 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre1; {2619#(<= getNumbers_~i~0 4)} is VALID [2020-07-29 01:17:32,343 INFO L280 TraceCheckUtils]: 19: Hoare triple {2619#(<= getNumbers_~i~0 4)} assume !!(~i~0 < 10); {2619#(<= getNumbers_~i~0 4)} is VALID [2020-07-29 01:17:32,344 INFO L280 TraceCheckUtils]: 20: Hoare triple {2619#(<= getNumbers_~i~0 4)} SUMMARY for call write~int(~i~0, ~array~0.base, ~array~0.offset + 4 * ~i~0, 4); srcloc: L11 {2619#(<= getNumbers_~i~0 4)} is VALID [2020-07-29 01:17:32,344 INFO L280 TraceCheckUtils]: 21: Hoare triple {2619#(<= getNumbers_~i~0 4)} #t~pre1 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre1; {2620#(<= getNumbers_~i~0 5)} is VALID [2020-07-29 01:17:32,345 INFO L280 TraceCheckUtils]: 22: Hoare triple {2620#(<= getNumbers_~i~0 5)} assume !!(~i~0 < 10); {2620#(<= getNumbers_~i~0 5)} is VALID [2020-07-29 01:17:32,346 INFO L280 TraceCheckUtils]: 23: Hoare triple {2620#(<= getNumbers_~i~0 5)} SUMMARY for call write~int(~i~0, ~array~0.base, ~array~0.offset + 4 * ~i~0, 4); srcloc: L11 {2620#(<= getNumbers_~i~0 5)} is VALID [2020-07-29 01:17:32,346 INFO L280 TraceCheckUtils]: 24: Hoare triple {2620#(<= getNumbers_~i~0 5)} #t~pre1 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre1; {2621#(<= getNumbers_~i~0 6)} is VALID [2020-07-29 01:17:32,347 INFO L280 TraceCheckUtils]: 25: Hoare triple {2621#(<= getNumbers_~i~0 6)} assume !!(~i~0 < 10); {2621#(<= getNumbers_~i~0 6)} is VALID [2020-07-29 01:17:32,348 INFO L280 TraceCheckUtils]: 26: Hoare triple {2621#(<= getNumbers_~i~0 6)} SUMMARY for call write~int(~i~0, ~array~0.base, ~array~0.offset + 4 * ~i~0, 4); srcloc: L11 {2621#(<= getNumbers_~i~0 6)} is VALID [2020-07-29 01:17:32,348 INFO L280 TraceCheckUtils]: 27: Hoare triple {2621#(<= getNumbers_~i~0 6)} #t~pre1 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre1; {2622#(<= getNumbers_~i~0 7)} is VALID [2020-07-29 01:17:32,349 INFO L280 TraceCheckUtils]: 28: Hoare triple {2622#(<= getNumbers_~i~0 7)} assume !!(~i~0 < 10); {2622#(<= getNumbers_~i~0 7)} is VALID [2020-07-29 01:17:32,350 INFO L280 TraceCheckUtils]: 29: Hoare triple {2622#(<= getNumbers_~i~0 7)} SUMMARY for call write~int(~i~0, ~array~0.base, ~array~0.offset + 4 * ~i~0, 4); srcloc: L11 {2622#(<= getNumbers_~i~0 7)} is VALID [2020-07-29 01:17:32,351 INFO L280 TraceCheckUtils]: 30: Hoare triple {2622#(<= getNumbers_~i~0 7)} #t~pre1 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre1; {2623#(<= getNumbers_~i~0 8)} is VALID [2020-07-29 01:17:32,351 INFO L280 TraceCheckUtils]: 31: Hoare triple {2623#(<= getNumbers_~i~0 8)} assume !!(~i~0 < 10); {2623#(<= getNumbers_~i~0 8)} is VALID [2020-07-29 01:17:32,352 INFO L280 TraceCheckUtils]: 32: Hoare triple {2623#(<= getNumbers_~i~0 8)} SUMMARY for call write~int(~i~0, ~array~0.base, ~array~0.offset + 4 * ~i~0, 4); srcloc: L11 {2623#(<= getNumbers_~i~0 8)} is VALID [2020-07-29 01:17:32,353 INFO L280 TraceCheckUtils]: 33: Hoare triple {2623#(<= getNumbers_~i~0 8)} #t~pre1 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre1; {2624#(<= getNumbers_~i~0 9)} is VALID [2020-07-29 01:17:32,354 INFO L280 TraceCheckUtils]: 34: Hoare triple {2624#(<= getNumbers_~i~0 9)} assume !(~i~0 < 10); {2577#false} is VALID [2020-07-29 01:17:32,354 INFO L280 TraceCheckUtils]: 35: Hoare triple {2577#false} #res.base, #res.offset := ~array~0.base, ~array~0.offset;call ULTIMATE.dealloc(#t~malloc0.base, #t~malloc0.offset);havoc #t~malloc0.base, #t~malloc0.offset; {2577#false} is VALID [2020-07-29 01:17:32,354 INFO L280 TraceCheckUtils]: 36: Hoare triple {2577#false} assume true; {2577#false} is VALID [2020-07-29 01:17:32,354 INFO L275 TraceCheckUtils]: 37: Hoare quadruple {2577#false} {2576#true} #51#return; {2577#false} is VALID [2020-07-29 01:17:32,355 INFO L280 TraceCheckUtils]: 38: Hoare triple {2577#false} ~numbers~0.base, ~numbers~0.offset := #t~ret2.base, #t~ret2.offset;havoc #t~ret2.base, #t~ret2.offset;~i~1 := 0; {2577#false} is VALID [2020-07-29 01:17:32,355 INFO L280 TraceCheckUtils]: 39: Hoare triple {2577#false} assume !!(~i~1 < 10);havoc #t~nondet4; {2577#false} is VALID [2020-07-29 01:17:32,355 INFO L280 TraceCheckUtils]: 40: Hoare triple {2577#false} assume !(1 == #valid[~numbers~0.base]); {2577#false} is VALID [2020-07-29 01:17:32,357 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 0 proven. 117 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:17:32,357 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383647532] [2020-07-29 01:17:32,358 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1944265539] [2020-07-29 01:17:32,358 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-29 01:17:32,404 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-29 01:17:32,404 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-29 01:17:32,405 INFO L263 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 11 conjunts are in the unsatisfiable core [2020-07-29 01:17:32,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:17:32,416 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:17:32,682 INFO L263 TraceCheckUtils]: 0: Hoare triple {2576#true} call ULTIMATE.init(); {2576#true} is VALID [2020-07-29 01:17:32,682 INFO L280 TraceCheckUtils]: 1: Hoare triple {2576#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(4);call write~init~int(37, #t~string5.base, #t~string5.offset, 1);call write~init~int(100, #t~string5.base, 1 + #t~string5.offset, 1);call write~init~int(10, #t~string5.base, 2 + #t~string5.offset, 1);call write~init~int(0, #t~string5.base, 3 + #t~string5.offset, 1); {2576#true} is VALID [2020-07-29 01:17:32,682 INFO L280 TraceCheckUtils]: 2: Hoare triple {2576#true} assume true; {2576#true} is VALID [2020-07-29 01:17:32,682 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2576#true} {2576#true} #47#return; {2576#true} is VALID [2020-07-29 01:17:32,682 INFO L263 TraceCheckUtils]: 4: Hoare triple {2576#true} call #t~ret7 := main(); {2576#true} is VALID [2020-07-29 01:17:32,683 INFO L263 TraceCheckUtils]: 5: Hoare triple {2576#true} call #t~ret2.base, #t~ret2.offset := getNumbers(); {2576#true} is VALID [2020-07-29 01:17:32,683 INFO L280 TraceCheckUtils]: 6: Hoare triple {2576#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnStack(40);~array~0.base, ~array~0.offset := #t~malloc0.base, #t~malloc0.offset;~i~0 := 0; {2646#(<= getNumbers_~i~0 0)} is VALID [2020-07-29 01:17:32,684 INFO L280 TraceCheckUtils]: 7: Hoare triple {2646#(<= getNumbers_~i~0 0)} assume !!(~i~0 < 10); {2646#(<= getNumbers_~i~0 0)} is VALID [2020-07-29 01:17:32,684 INFO L280 TraceCheckUtils]: 8: Hoare triple {2646#(<= getNumbers_~i~0 0)} SUMMARY for call write~int(~i~0, ~array~0.base, ~array~0.offset + 4 * ~i~0, 4); srcloc: L11 {2646#(<= getNumbers_~i~0 0)} is VALID [2020-07-29 01:17:32,685 INFO L280 TraceCheckUtils]: 9: Hoare triple {2646#(<= getNumbers_~i~0 0)} #t~pre1 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre1; {2616#(<= getNumbers_~i~0 1)} is VALID [2020-07-29 01:17:32,685 INFO L280 TraceCheckUtils]: 10: Hoare triple {2616#(<= getNumbers_~i~0 1)} assume !!(~i~0 < 10); {2616#(<= getNumbers_~i~0 1)} is VALID [2020-07-29 01:17:32,685 INFO L280 TraceCheckUtils]: 11: Hoare triple {2616#(<= getNumbers_~i~0 1)} SUMMARY for call write~int(~i~0, ~array~0.base, ~array~0.offset + 4 * ~i~0, 4); srcloc: L11 {2616#(<= getNumbers_~i~0 1)} is VALID [2020-07-29 01:17:32,686 INFO L280 TraceCheckUtils]: 12: Hoare triple {2616#(<= getNumbers_~i~0 1)} #t~pre1 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre1; {2617#(<= getNumbers_~i~0 2)} is VALID [2020-07-29 01:17:32,686 INFO L280 TraceCheckUtils]: 13: Hoare triple {2617#(<= getNumbers_~i~0 2)} assume !!(~i~0 < 10); {2617#(<= getNumbers_~i~0 2)} is VALID [2020-07-29 01:17:32,687 INFO L280 TraceCheckUtils]: 14: Hoare triple {2617#(<= getNumbers_~i~0 2)} SUMMARY for call write~int(~i~0, ~array~0.base, ~array~0.offset + 4 * ~i~0, 4); srcloc: L11 {2617#(<= getNumbers_~i~0 2)} is VALID [2020-07-29 01:17:32,688 INFO L280 TraceCheckUtils]: 15: Hoare triple {2617#(<= getNumbers_~i~0 2)} #t~pre1 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre1; {2618#(<= getNumbers_~i~0 3)} is VALID [2020-07-29 01:17:32,689 INFO L280 TraceCheckUtils]: 16: Hoare triple {2618#(<= getNumbers_~i~0 3)} assume !!(~i~0 < 10); {2618#(<= getNumbers_~i~0 3)} is VALID [2020-07-29 01:17:32,689 INFO L280 TraceCheckUtils]: 17: Hoare triple {2618#(<= getNumbers_~i~0 3)} SUMMARY for call write~int(~i~0, ~array~0.base, ~array~0.offset + 4 * ~i~0, 4); srcloc: L11 {2618#(<= getNumbers_~i~0 3)} is VALID [2020-07-29 01:17:32,690 INFO L280 TraceCheckUtils]: 18: Hoare triple {2618#(<= getNumbers_~i~0 3)} #t~pre1 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre1; {2619#(<= getNumbers_~i~0 4)} is VALID [2020-07-29 01:17:32,690 INFO L280 TraceCheckUtils]: 19: Hoare triple {2619#(<= getNumbers_~i~0 4)} assume !!(~i~0 < 10); {2619#(<= getNumbers_~i~0 4)} is VALID [2020-07-29 01:17:32,691 INFO L280 TraceCheckUtils]: 20: Hoare triple {2619#(<= getNumbers_~i~0 4)} SUMMARY for call write~int(~i~0, ~array~0.base, ~array~0.offset + 4 * ~i~0, 4); srcloc: L11 {2619#(<= getNumbers_~i~0 4)} is VALID [2020-07-29 01:17:32,691 INFO L280 TraceCheckUtils]: 21: Hoare triple {2619#(<= getNumbers_~i~0 4)} #t~pre1 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre1; {2620#(<= getNumbers_~i~0 5)} is VALID [2020-07-29 01:17:32,692 INFO L280 TraceCheckUtils]: 22: Hoare triple {2620#(<= getNumbers_~i~0 5)} assume !!(~i~0 < 10); {2620#(<= getNumbers_~i~0 5)} is VALID [2020-07-29 01:17:32,692 INFO L280 TraceCheckUtils]: 23: Hoare triple {2620#(<= getNumbers_~i~0 5)} SUMMARY for call write~int(~i~0, ~array~0.base, ~array~0.offset + 4 * ~i~0, 4); srcloc: L11 {2620#(<= getNumbers_~i~0 5)} is VALID [2020-07-29 01:17:32,693 INFO L280 TraceCheckUtils]: 24: Hoare triple {2620#(<= getNumbers_~i~0 5)} #t~pre1 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre1; {2621#(<= getNumbers_~i~0 6)} is VALID [2020-07-29 01:17:32,694 INFO L280 TraceCheckUtils]: 25: Hoare triple {2621#(<= getNumbers_~i~0 6)} assume !!(~i~0 < 10); {2621#(<= getNumbers_~i~0 6)} is VALID [2020-07-29 01:17:32,694 INFO L280 TraceCheckUtils]: 26: Hoare triple {2621#(<= getNumbers_~i~0 6)} SUMMARY for call write~int(~i~0, ~array~0.base, ~array~0.offset + 4 * ~i~0, 4); srcloc: L11 {2621#(<= getNumbers_~i~0 6)} is VALID [2020-07-29 01:17:32,695 INFO L280 TraceCheckUtils]: 27: Hoare triple {2621#(<= getNumbers_~i~0 6)} #t~pre1 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre1; {2622#(<= getNumbers_~i~0 7)} is VALID [2020-07-29 01:17:32,696 INFO L280 TraceCheckUtils]: 28: Hoare triple {2622#(<= getNumbers_~i~0 7)} assume !!(~i~0 < 10); {2622#(<= getNumbers_~i~0 7)} is VALID [2020-07-29 01:17:32,697 INFO L280 TraceCheckUtils]: 29: Hoare triple {2622#(<= getNumbers_~i~0 7)} SUMMARY for call write~int(~i~0, ~array~0.base, ~array~0.offset + 4 * ~i~0, 4); srcloc: L11 {2622#(<= getNumbers_~i~0 7)} is VALID [2020-07-29 01:17:32,697 INFO L280 TraceCheckUtils]: 30: Hoare triple {2622#(<= getNumbers_~i~0 7)} #t~pre1 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre1; {2623#(<= getNumbers_~i~0 8)} is VALID [2020-07-29 01:17:32,698 INFO L280 TraceCheckUtils]: 31: Hoare triple {2623#(<= getNumbers_~i~0 8)} assume !!(~i~0 < 10); {2623#(<= getNumbers_~i~0 8)} is VALID [2020-07-29 01:17:32,698 INFO L280 TraceCheckUtils]: 32: Hoare triple {2623#(<= getNumbers_~i~0 8)} SUMMARY for call write~int(~i~0, ~array~0.base, ~array~0.offset + 4 * ~i~0, 4); srcloc: L11 {2623#(<= getNumbers_~i~0 8)} is VALID [2020-07-29 01:17:32,699 INFO L280 TraceCheckUtils]: 33: Hoare triple {2623#(<= getNumbers_~i~0 8)} #t~pre1 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre1; {2624#(<= getNumbers_~i~0 9)} is VALID [2020-07-29 01:17:32,699 INFO L280 TraceCheckUtils]: 34: Hoare triple {2624#(<= getNumbers_~i~0 9)} assume !(~i~0 < 10); {2577#false} is VALID [2020-07-29 01:17:32,699 INFO L280 TraceCheckUtils]: 35: Hoare triple {2577#false} #res.base, #res.offset := ~array~0.base, ~array~0.offset;call ULTIMATE.dealloc(#t~malloc0.base, #t~malloc0.offset);havoc #t~malloc0.base, #t~malloc0.offset; {2577#false} is VALID [2020-07-29 01:17:32,699 INFO L280 TraceCheckUtils]: 36: Hoare triple {2577#false} assume true; {2577#false} is VALID [2020-07-29 01:17:32,700 INFO L275 TraceCheckUtils]: 37: Hoare quadruple {2577#false} {2576#true} #51#return; {2577#false} is VALID [2020-07-29 01:17:32,700 INFO L280 TraceCheckUtils]: 38: Hoare triple {2577#false} ~numbers~0.base, ~numbers~0.offset := #t~ret2.base, #t~ret2.offset;havoc #t~ret2.base, #t~ret2.offset;~i~1 := 0; {2577#false} is VALID [2020-07-29 01:17:32,700 INFO L280 TraceCheckUtils]: 39: Hoare triple {2577#false} assume !!(~i~1 < 10);havoc #t~nondet4; {2577#false} is VALID [2020-07-29 01:17:32,700 INFO L280 TraceCheckUtils]: 40: Hoare triple {2577#false} assume !(1 == #valid[~numbers~0.base]); {2577#false} is VALID [2020-07-29 01:17:32,701 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 0 proven. 117 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:17:32,701 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-29 01:17:32,701 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 15 [2020-07-29 01:17:32,702 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217117735] [2020-07-29 01:17:32,702 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 41 [2020-07-29 01:17:32,702 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:17:32,703 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states. [2020-07-29 01:17:32,762 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:17:32,762 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-07-29 01:17:32,762 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:17:32,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-07-29 01:17:32,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=128, Unknown=0, NotChecked=0, Total=210 [2020-07-29 01:17:32,763 INFO L87 Difference]: Start difference. First operand 48 states and 49 transitions. Second operand 15 states. [2020-07-29 01:17:33,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:17:33,009 INFO L93 Difference]: Finished difference Result 51 states and 52 transitions. [2020-07-29 01:17:33,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-07-29 01:17:33,009 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 41 [2020-07-29 01:17:33,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:17:33,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-07-29 01:17:33,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 53 transitions. [2020-07-29 01:17:33,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-07-29 01:17:33,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 53 transitions. [2020-07-29 01:17:33,014 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 53 transitions. [2020-07-29 01:17:33,089 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:17:33,090 INFO L225 Difference]: With dead ends: 51 [2020-07-29 01:17:33,091 INFO L226 Difference]: Without dead ends: 51 [2020-07-29 01:17:33,091 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=154, Unknown=0, NotChecked=0, Total=240 [2020-07-29 01:17:33,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2020-07-29 01:17:33,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2020-07-29 01:17:33,094 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:17:33,094 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand 51 states. [2020-07-29 01:17:33,094 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand 51 states. [2020-07-29 01:17:33,094 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 51 states. [2020-07-29 01:17:33,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:17:33,096 INFO L93 Difference]: Finished difference Result 51 states and 52 transitions. [2020-07-29 01:17:33,096 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 52 transitions. [2020-07-29 01:17:33,096 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:17:33,096 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:17:33,097 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand 51 states. [2020-07-29 01:17:33,097 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 51 states. [2020-07-29 01:17:33,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:17:33,098 INFO L93 Difference]: Finished difference Result 51 states and 52 transitions. [2020-07-29 01:17:33,098 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 52 transitions. [2020-07-29 01:17:33,099 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:17:33,099 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:17:33,099 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:17:33,099 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:17:33,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2020-07-29 01:17:33,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 52 transitions. [2020-07-29 01:17:33,100 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 52 transitions. Word has length 41 [2020-07-29 01:17:33,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:17:33,101 INFO L479 AbstractCegarLoop]: Abstraction has 51 states and 52 transitions. [2020-07-29 01:17:33,101 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-07-29 01:17:33,101 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 52 transitions. [2020-07-29 01:17:33,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2020-07-29 01:17:33,101 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:17:33,102 INFO L422 BasicCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:17:33,314 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-29 01:17:33,315 INFO L427 AbstractCegarLoop]: === Iteration 13 === [mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2020-07-29 01:17:33,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:17:33,316 INFO L82 PathProgramCache]: Analyzing trace with hash -1709012065, now seen corresponding path program 9 times [2020-07-29 01:17:33,316 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:17:33,316 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349816303] [2020-07-29 01:17:33,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:17:33,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:17:33,340 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:17:33,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:17:33,357 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:17:33,384 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:17:33,385 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-29 01:17:33,385 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-07-29 01:17:33,434 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.07 01:17:33 BoogieIcfgContainer [2020-07-29 01:17:33,434 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-29 01:17:33,434 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-07-29 01:17:33,435 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-07-29 01:17:33,435 INFO L275 PluginConnector]: Witness Printer initialized [2020-07-29 01:17:33,436 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:17:20" (3/4) ... [2020-07-29 01:17:33,438 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-07-29 01:17:33,529 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-07-29 01:17:33,529 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-07-29 01:17:33,532 INFO L168 Benchmark]: Toolchain (without parser) took 13901.32 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 321.9 MB). Free memory was 953.5 MB in the beginning and 936.0 MB in the end (delta: 17.5 MB). Peak memory consumption was 339.5 MB. Max. memory is 11.5 GB. [2020-07-29 01:17:33,532 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 981.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 01:17:33,533 INFO L168 Benchmark]: CACSL2BoogieTranslator took 264.88 ms. Allocated memory is still 1.0 GB. Free memory was 953.5 MB in the beginning and 941.4 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 11.5 GB. [2020-07-29 01:17:33,533 INFO L168 Benchmark]: Boogie Preprocessor took 138.90 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.0 MB). Free memory was 941.4 MB in the beginning and 1.1 GB in the end (delta: -178.2 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. [2020-07-29 01:17:33,534 INFO L168 Benchmark]: RCFGBuilder took 549.56 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 26.3 MB). Peak memory consumption was 26.3 MB. Max. memory is 11.5 GB. [2020-07-29 01:17:33,534 INFO L168 Benchmark]: TraceAbstraction took 12841.80 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 191.9 MB). Free memory was 1.1 GB in the beginning and 936.0 MB in the end (delta: 157.3 MB). Peak memory consumption was 349.2 MB. Max. memory is 11.5 GB. [2020-07-29 01:17:33,535 INFO L168 Benchmark]: Witness Printer took 95.14 ms. Allocated memory is still 1.4 GB. Free memory is still 936.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 01:17:33,536 INFO L336 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.18 ms. Allocated memory is still 1.0 GB. Free memory is still 981.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 264.88 ms. Allocated memory is still 1.0 GB. Free memory was 953.5 MB in the beginning and 941.4 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 138.90 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.0 MB). Free memory was 941.4 MB in the beginning and 1.1 GB in the end (delta: -178.2 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 549.56 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 26.3 MB). Peak memory consumption was 26.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 12841.80 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 191.9 MB). Free memory was 1.1 GB in the beginning and 936.0 MB in the end (delta: 157.3 MB). Peak memory consumption was 349.2 MB. Max. memory is 11.5 GB. * Witness Printer took 95.14 ms. Allocated memory is still 1.4 GB. Free memory is still 936.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 22]: pointer dereference may fail pointer dereference may fail We found a FailurePath: [L19] CALL, EXPR getNumbers() [L8] int *array = alloca(10 * sizeof(int)); [L10] int i = 0; VAL [alloca(10 * sizeof(int))={11:0}, array={11:0}, i=0] [L10] COND TRUE i < 10 VAL [alloca(10 * sizeof(int))={11:0}, array={11:0}, i=0] [L11] array[i] = i VAL [alloca(10 * sizeof(int))={11:0}, array={11:0}, i=0] [L10] ++i VAL [alloca(10 * sizeof(int))={11:0}, array={11:0}, i=1] [L10] COND TRUE i < 10 VAL [alloca(10 * sizeof(int))={11:0}, array={11:0}, i=1] [L11] array[i] = i VAL [alloca(10 * sizeof(int))={11:0}, array={11:0}, i=1] [L10] ++i VAL [alloca(10 * sizeof(int))={11:0}, array={11:0}, i=2] [L10] COND TRUE i < 10 VAL [alloca(10 * sizeof(int))={11:0}, array={11:0}, i=2] [L11] array[i] = i VAL [alloca(10 * sizeof(int))={11:0}, array={11:0}, i=2] [L10] ++i VAL [alloca(10 * sizeof(int))={11:0}, array={11:0}, i=3] [L10] COND TRUE i < 10 VAL [alloca(10 * sizeof(int))={11:0}, array={11:0}, i=3] [L11] array[i] = i VAL [alloca(10 * sizeof(int))={11:0}, array={11:0}, i=3] [L10] ++i VAL [alloca(10 * sizeof(int))={11:0}, array={11:0}, i=4] [L10] COND TRUE i < 10 VAL [alloca(10 * sizeof(int))={11:0}, array={11:0}, i=4] [L11] array[i] = i VAL [alloca(10 * sizeof(int))={11:0}, array={11:0}, i=4] [L10] ++i VAL [alloca(10 * sizeof(int))={11:0}, array={11:0}, i=5] [L10] COND TRUE i < 10 VAL [alloca(10 * sizeof(int))={11:0}, array={11:0}, i=5] [L11] array[i] = i VAL [alloca(10 * sizeof(int))={11:0}, array={11:0}, i=5] [L10] ++i VAL [alloca(10 * sizeof(int))={11:0}, array={11:0}, i=6] [L10] COND TRUE i < 10 VAL [alloca(10 * sizeof(int))={11:0}, array={11:0}, i=6] [L11] array[i] = i VAL [alloca(10 * sizeof(int))={11:0}, array={11:0}, i=6] [L10] ++i VAL [alloca(10 * sizeof(int))={11:0}, array={11:0}, i=7] [L10] COND TRUE i < 10 VAL [alloca(10 * sizeof(int))={11:0}, array={11:0}, i=7] [L11] array[i] = i VAL [alloca(10 * sizeof(int))={11:0}, array={11:0}, i=7] [L10] ++i VAL [alloca(10 * sizeof(int))={11:0}, array={11:0}, i=8] [L10] COND TRUE i < 10 VAL [alloca(10 * sizeof(int))={11:0}, array={11:0}, i=8] [L11] array[i] = i VAL [alloca(10 * sizeof(int))={11:0}, array={11:0}, i=8] [L10] ++i VAL [alloca(10 * sizeof(int))={11:0}, array={11:0}, i=9] [L10] COND TRUE i < 10 VAL [alloca(10 * sizeof(int))={11:0}, array={11:0}, i=9] [L11] array[i] = i VAL [alloca(10 * sizeof(int))={11:0}, array={11:0}, i=9] [L10] ++i VAL [alloca(10 * sizeof(int))={11:0}, array={11:0}, i=10] [L10] COND FALSE !(i < 10) VAL [alloca(10 * sizeof(int))={11:0}, array={11:0}, i=10] [L14] return array; [L19] RET, EXPR getNumbers() VAL [getNumbers()={11:0}] [L19] int *numbers = getNumbers(); [L21] int i = 0; VAL [i=0, numbers={11:0}] [L21] COND TRUE i < 10 [L22] numbers + i - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 28 locations, 5 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 12.7s, OverallIterations: 13, TraceHistogramMax: 10, AutomataDifference: 3.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 234 SDtfs, 116 SDslu, 787 SDs, 0 SdLazy, 668 SolverSat, 54 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 388 GetRequests, 288 SyntacticMatches, 1 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=51occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 12 MinimizatonAttempts, 18 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 4.7s InterpolantComputationTime, 604 NumberOfCodeBlocks, 604 NumberOfCodeBlocksAsserted, 44 NumberOfCheckSat, 538 ConstructedInterpolants, 0 QuantifiedInterpolants, 44882 SizeOfPredicates, 12 NumberOfNonLiveVariables, 1272 ConjunctsInSsa, 84 ConjunctsInUnsatCore, 22 InterpolantComputations, 3 PerfectInterpolantSequences, 7/826 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 RESULT: Ultimate proved your program to be incorrect! Received shutdown request...