./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/termination-crafted/NonTermination3-1.c --full-output -ea --architecture 64bit -------------------------------------------------------------------------------- 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/termination-crafted/NonTermination3-1.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 76e89a58b9c6f7059fcf416ee7a1666558a3d440 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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:18:11,736 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-29 01:18:11,738 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-29 01:18:11,751 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-29 01:18:11,751 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-29 01:18:11,753 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-29 01:18:11,754 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-29 01:18:11,756 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-29 01:18:11,758 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-29 01:18:11,759 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-29 01:18:11,760 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-29 01:18:11,761 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-29 01:18:11,762 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-29 01:18:11,763 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-29 01:18:11,764 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-29 01:18:11,765 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-29 01:18:11,766 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-29 01:18:11,767 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-29 01:18:11,769 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-29 01:18:11,772 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-29 01:18:11,773 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-29 01:18:11,775 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-29 01:18:11,776 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-29 01:18:11,777 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-29 01:18:11,780 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-29 01:18:11,780 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-29 01:18:11,780 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-29 01:18:11,781 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-29 01:18:11,782 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-29 01:18:11,783 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-29 01:18:11,783 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-29 01:18:11,784 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-29 01:18:11,785 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-29 01:18:11,786 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-29 01:18:11,787 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-29 01:18:11,787 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-29 01:18:11,788 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-29 01:18:11,788 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-29 01:18:11,789 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-29 01:18:11,790 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-29 01:18:11,790 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-29 01:18:11,791 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2020-07-29 01:18:11,806 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-29 01:18:11,807 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-29 01:18:11,808 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-29 01:18:11,808 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-29 01:18:11,809 INFO L138 SettingsManager]: * Use SBE=true [2020-07-29 01:18:11,809 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-29 01:18:11,809 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-29 01:18:11,810 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-29 01:18:11,810 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-29 01:18:11,810 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2020-07-29 01:18:11,810 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2020-07-29 01:18:11,811 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2020-07-29 01:18:11,811 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-29 01:18:11,811 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2020-07-29 01:18:11,811 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-29 01:18:11,812 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-29 01:18:11,812 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-29 01:18:11,812 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-29 01:18:11,813 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-29 01:18:11,813 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-29 01:18:11,813 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-29 01:18:11,814 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-29 01:18:11,814 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-29 01:18:11,814 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-29 01:18:11,814 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-29 01:18:11,815 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 76e89a58b9c6f7059fcf416ee7a1666558a3d440 [2020-07-29 01:18:12,127 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-29 01:18:12,139 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-29 01:18:12,142 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-29 01:18:12,144 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-29 01:18:12,144 INFO L275 PluginConnector]: CDTParser initialized [2020-07-29 01:18:12,145 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-crafted/NonTermination3-1.c [2020-07-29 01:18:12,205 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b73f8c764/edfd0e1f938241c18df23dbf31d0c3c8/FLAG169f1702b [2020-07-29 01:18:12,646 INFO L306 CDTParser]: Found 1 translation units. [2020-07-29 01:18:12,648 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-crafted/NonTermination3-1.c [2020-07-29 01:18:12,655 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b73f8c764/edfd0e1f938241c18df23dbf31d0c3c8/FLAG169f1702b [2020-07-29 01:18:13,037 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b73f8c764/edfd0e1f938241c18df23dbf31d0c3c8 [2020-07-29 01:18:13,041 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-29 01:18:13,044 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-07-29 01:18:13,045 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-29 01:18:13,045 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-29 01:18:13,049 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-29 01:18:13,050 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 01:18:13" (1/1) ... [2020-07-29 01:18:13,053 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2170deb5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:18:13, skipping insertion in model container [2020-07-29 01:18:13,054 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 01:18:13" (1/1) ... [2020-07-29 01:18:13,062 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-29 01:18:13,079 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-29 01:18:13,259 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 01:18:13,272 INFO L203 MainTranslator]: Completed pre-run [2020-07-29 01:18:13,301 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 01:18:13,326 INFO L208 MainTranslator]: Completed translation [2020-07-29 01:18:13,327 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:18:13 WrapperNode [2020-07-29 01:18:13,327 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-29 01:18:13,328 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-29 01:18:13,328 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-29 01:18:13,328 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-29 01:18:13,405 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:18:13" (1/1) ... [2020-07-29 01:18:13,405 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:18:13" (1/1) ... [2020-07-29 01:18:13,414 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:18:13" (1/1) ... [2020-07-29 01:18:13,415 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:18:13" (1/1) ... [2020-07-29 01:18:13,435 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:18:13" (1/1) ... [2020-07-29 01:18:13,445 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:18:13" (1/1) ... [2020-07-29 01:18:13,447 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:18:13" (1/1) ... [2020-07-29 01:18:13,454 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-29 01:18:13,455 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-29 01:18:13,455 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-29 01:18:13,455 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-29 01:18:13,456 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:18:13" (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:18:13,516 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-29 01:18:13,516 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-29 01:18:13,517 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-29 01:18:13,517 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-29 01:18:13,517 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-29 01:18:13,517 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-29 01:18:13,518 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-29 01:18:13,518 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-29 01:18:13,519 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-29 01:18:13,519 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-29 01:18:13,519 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-29 01:18:13,885 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-29 01:18:13,885 INFO L295 CfgBuilder]: Removed 2 assume(true) statements. [2020-07-29 01:18:13,890 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:18:13 BoogieIcfgContainer [2020-07-29 01:18:13,890 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-29 01:18:13,892 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-29 01:18:13,892 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-29 01:18:13,896 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-29 01:18:13,896 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.07 01:18:13" (1/3) ... [2020-07-29 01:18:13,897 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50b1e65e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.07 01:18:13, skipping insertion in model container [2020-07-29 01:18:13,898 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:18:13" (2/3) ... [2020-07-29 01:18:13,898 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50b1e65e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.07 01:18:13, skipping insertion in model container [2020-07-29 01:18:13,899 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:18:13" (3/3) ... [2020-07-29 01:18:13,901 INFO L109 eAbstractionObserver]: Analyzing ICFG NonTermination3-1.c [2020-07-29 01:18:13,912 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-29 01:18:13,920 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 7 error locations. [2020-07-29 01:18:13,935 INFO L251 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2020-07-29 01:18:13,958 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-29 01:18:13,958 INFO L376 AbstractCegarLoop]: Hoare is false [2020-07-29 01:18:13,958 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-29 01:18:13,959 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-29 01:18:13,959 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-29 01:18:13,959 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-29 01:18:13,959 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-29 01:18:13,959 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-29 01:18:13,974 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states. [2020-07-29 01:18:13,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-07-29 01:18:13,984 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:18:13,985 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:18:13,986 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr6ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION]=== [2020-07-29 01:18:13,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:18:13,993 INFO L82 PathProgramCache]: Analyzing trace with hash 1254763092, now seen corresponding path program 1 times [2020-07-29 01:18:14,017 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:18:14,020 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84130005] [2020-07-29 01:18:14,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:18:14,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:18:14,284 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-07-29 01:18:14,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:18:14,303 INFO L280 TraceCheckUtils]: 0: Hoare triple {37#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {31#true} is VALID [2020-07-29 01:18:14,304 INFO L280 TraceCheckUtils]: 1: Hoare triple {31#true} assume true; {31#true} is VALID [2020-07-29 01:18:14,304 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {31#true} {31#true} #52#return; {31#true} is VALID [2020-07-29 01:18:14,308 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)|))} is VALID [2020-07-29 01:18:14,308 INFO L280 TraceCheckUtils]: 1: Hoare triple {37#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {31#true} is VALID [2020-07-29 01:18:14,309 INFO L280 TraceCheckUtils]: 2: Hoare triple {31#true} assume true; {31#true} is VALID [2020-07-29 01:18:14,309 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {31#true} {31#true} #52#return; {31#true} is VALID [2020-07-29 01:18:14,310 INFO L263 TraceCheckUtils]: 4: Hoare triple {31#true} call #t~ret6 := main(); {31#true} is VALID [2020-07-29 01:18:14,312 INFO L280 TraceCheckUtils]: 5: Hoare triple {31#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~i~0 := #t~nondet0;havoc #t~nondet0;call ~#a~0.base, ~#a~0.offset := #Ultimate.allocOnStack(40);~n~0 := 0; {36#(and (= 0 main_~n~0) (= 40 (select |#length| |main_~#a~0.base|)) (= 0 |main_~#a~0.offset|))} is VALID [2020-07-29 01:18:14,314 INFO L280 TraceCheckUtils]: 6: Hoare triple {36#(and (= 0 main_~n~0) (= 40 (select |#length| |main_~#a~0.base|)) (= 0 |main_~#a~0.offset|))} assume !!(~n~0 < 10);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {36#(and (= 0 main_~n~0) (= 40 (select |#length| |main_~#a~0.base|)) (= 0 |main_~#a~0.offset|))} is VALID [2020-07-29 01:18:14,315 INFO L280 TraceCheckUtils]: 7: Hoare triple {36#(and (= 0 main_~n~0) (= 40 (select |#length| |main_~#a~0.base|)) (= 0 |main_~#a~0.offset|))} assume !(4 + (~#a~0.offset + 4 * ~n~0) <= #length[~#a~0.base] && 0 <= ~#a~0.offset + 4 * ~n~0); {32#false} is VALID [2020-07-29 01:18:14,317 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:18:14,317 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84130005] [2020-07-29 01:18:14,319 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:18:14,319 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-29 01:18:14,320 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389073300] [2020-07-29 01:18:14,327 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2020-07-29 01:18:14,330 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:18:14,335 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 01:18:14,360 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:18:14,360 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-29 01:18:14,361 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:18:14,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-29 01:18:14,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-29 01:18:14,376 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 4 states. [2020-07-29 01:18:14,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:18:14,613 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2020-07-29 01:18:14,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-29 01:18:14,613 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2020-07-29 01:18:14,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:18:14,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 01:18:14,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2020-07-29 01:18:14,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 01:18:14,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2020-07-29 01:18:14,633 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 40 transitions. [2020-07-29 01:18:14,702 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:18:14,714 INFO L225 Difference]: With dead ends: 33 [2020-07-29 01:18:14,715 INFO L226 Difference]: Without dead ends: 30 [2020-07-29 01:18:14,717 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:18:14,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2020-07-29 01:18:14,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 27. [2020-07-29 01:18:14,753 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:18:14,754 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand 27 states. [2020-07-29 01:18:14,754 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 27 states. [2020-07-29 01:18:14,755 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 27 states. [2020-07-29 01:18:14,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:18:14,760 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2020-07-29 01:18:14,760 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2020-07-29 01:18:14,761 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:18:14,761 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:18:14,762 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 30 states. [2020-07-29 01:18:14,762 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 30 states. [2020-07-29 01:18:14,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:18:14,766 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2020-07-29 01:18:14,766 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2020-07-29 01:18:14,767 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:18:14,767 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:18:14,768 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:18:14,768 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:18:14,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-07-29 01:18:14,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2020-07-29 01:18:14,772 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 8 [2020-07-29 01:18:14,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:18:14,773 INFO L479 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2020-07-29 01:18:14,773 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-29 01:18:14,773 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2020-07-29 01:18:14,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-07-29 01:18:14,774 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:18:14,774 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:18:14,774 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-29 01:18:14,775 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr6ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION]=== [2020-07-29 01:18:14,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:18:14,775 INFO L82 PathProgramCache]: Analyzing trace with hash 1254763091, now seen corresponding path program 1 times [2020-07-29 01:18:14,776 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:18:14,776 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995013378] [2020-07-29 01:18:14,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:18:14,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:18:14,882 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-07-29 01:18:14,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:18:14,896 INFO L280 TraceCheckUtils]: 0: Hoare triple {166#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {160#true} is VALID [2020-07-29 01:18:14,897 INFO L280 TraceCheckUtils]: 1: Hoare triple {160#true} assume true; {160#true} is VALID [2020-07-29 01:18:14,898 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {160#true} {160#true} #52#return; {160#true} is VALID [2020-07-29 01:18:14,901 INFO L263 TraceCheckUtils]: 0: Hoare triple {160#true} call ULTIMATE.init(); {166#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-29 01:18:14,901 INFO L280 TraceCheckUtils]: 1: Hoare triple {166#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {160#true} is VALID [2020-07-29 01:18:14,902 INFO L280 TraceCheckUtils]: 2: Hoare triple {160#true} assume true; {160#true} is VALID [2020-07-29 01:18:14,902 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {160#true} {160#true} #52#return; {160#true} is VALID [2020-07-29 01:18:14,903 INFO L263 TraceCheckUtils]: 4: Hoare triple {160#true} call #t~ret6 := main(); {160#true} is VALID [2020-07-29 01:18:14,906 INFO L280 TraceCheckUtils]: 5: Hoare triple {160#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~i~0 := #t~nondet0;havoc #t~nondet0;call ~#a~0.base, ~#a~0.offset := #Ultimate.allocOnStack(40);~n~0 := 0; {165#(= 1 (select |#valid| |main_~#a~0.base|))} is VALID [2020-07-29 01:18:14,907 INFO L280 TraceCheckUtils]: 6: Hoare triple {165#(= 1 (select |#valid| |main_~#a~0.base|))} assume !!(~n~0 < 10);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {165#(= 1 (select |#valid| |main_~#a~0.base|))} is VALID [2020-07-29 01:18:14,908 INFO L280 TraceCheckUtils]: 7: Hoare triple {165#(= 1 (select |#valid| |main_~#a~0.base|))} assume !(1 == #valid[~#a~0.base]); {161#false} is VALID [2020-07-29 01:18:14,909 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:18:14,909 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995013378] [2020-07-29 01:18:14,910 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:18:14,910 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-29 01:18:14,910 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494254809] [2020-07-29 01:18:14,914 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2020-07-29 01:18:14,916 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:18:14,917 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 01:18:14,932 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:18:14,933 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-29 01:18:14,933 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:18:14,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-29 01:18:14,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-29 01:18:14,934 INFO L87 Difference]: Start difference. First operand 27 states and 30 transitions. Second operand 4 states. [2020-07-29 01:18:15,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:18:15,071 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2020-07-29 01:18:15,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-29 01:18:15,071 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2020-07-29 01:18:15,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:18:15,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 01:18:15,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 27 transitions. [2020-07-29 01:18:15,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 01:18:15,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 27 transitions. [2020-07-29 01:18:15,081 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 27 transitions. [2020-07-29 01:18:15,125 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:18:15,127 INFO L225 Difference]: With dead ends: 24 [2020-07-29 01:18:15,127 INFO L226 Difference]: Without dead ends: 24 [2020-07-29 01:18:15,129 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:18:15,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2020-07-29 01:18:15,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2020-07-29 01:18:15,134 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:18:15,134 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand 24 states. [2020-07-29 01:18:15,135 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 24 states. [2020-07-29 01:18:15,135 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 24 states. [2020-07-29 01:18:15,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:18:15,138 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2020-07-29 01:18:15,138 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2020-07-29 01:18:15,139 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:18:15,140 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:18:15,140 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 24 states. [2020-07-29 01:18:15,140 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 24 states. [2020-07-29 01:18:15,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:18:15,145 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2020-07-29 01:18:15,146 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2020-07-29 01:18:15,146 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:18:15,147 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:18:15,147 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:18:15,147 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:18:15,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2020-07-29 01:18:15,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2020-07-29 01:18:15,150 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 8 [2020-07-29 01:18:15,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:18:15,151 INFO L479 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2020-07-29 01:18:15,151 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-29 01:18:15,151 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2020-07-29 01:18:15,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-07-29 01:18:15,152 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:18:15,153 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:18:15,153 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-29 01:18:15,153 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr6ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION]=== [2020-07-29 01:18:15,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:18:15,154 INFO L82 PathProgramCache]: Analyzing trace with hash 707835031, now seen corresponding path program 1 times [2020-07-29 01:18:15,155 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:18:15,155 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600632571] [2020-07-29 01:18:15,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:18:15,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:18:15,334 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-07-29 01:18:15,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:18:15,342 INFO L280 TraceCheckUtils]: 0: Hoare triple {272#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {265#true} is VALID [2020-07-29 01:18:15,343 INFO L280 TraceCheckUtils]: 1: Hoare triple {265#true} assume true; {265#true} is VALID [2020-07-29 01:18:15,343 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {265#true} {265#true} #52#return; {265#true} is VALID [2020-07-29 01:18:15,345 INFO L263 TraceCheckUtils]: 0: Hoare triple {265#true} call ULTIMATE.init(); {272#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-29 01:18:15,345 INFO L280 TraceCheckUtils]: 1: Hoare triple {272#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {265#true} is VALID [2020-07-29 01:18:15,346 INFO L280 TraceCheckUtils]: 2: Hoare triple {265#true} assume true; {265#true} is VALID [2020-07-29 01:18:15,346 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {265#true} {265#true} #52#return; {265#true} is VALID [2020-07-29 01:18:15,346 INFO L263 TraceCheckUtils]: 4: Hoare triple {265#true} call #t~ret6 := main(); {265#true} is VALID [2020-07-29 01:18:15,348 INFO L280 TraceCheckUtils]: 5: Hoare triple {265#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~i~0 := #t~nondet0;havoc #t~nondet0;call ~#a~0.base, ~#a~0.offset := #Ultimate.allocOnStack(40);~n~0 := 0; {270#(and (= 0 main_~n~0) (= 40 (select |#length| |main_~#a~0.base|)) (= 0 |main_~#a~0.offset|))} is VALID [2020-07-29 01:18:15,350 INFO L280 TraceCheckUtils]: 6: Hoare triple {270#(and (= 0 main_~n~0) (= 40 (select |#length| |main_~#a~0.base|)) (= 0 |main_~#a~0.offset|))} assume !!(~n~0 < 10);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {270#(and (= 0 main_~n~0) (= 40 (select |#length| |main_~#a~0.base|)) (= 0 |main_~#a~0.offset|))} is VALID [2020-07-29 01:18:15,352 INFO L280 TraceCheckUtils]: 7: Hoare triple {270#(and (= 0 main_~n~0) (= 40 (select |#length| |main_~#a~0.base|)) (= 0 |main_~#a~0.offset|))} SUMMARY for call write~int(#t~nondet2, ~#a~0.base, ~#a~0.offset + 4 * ~n~0, 4); srcloc: L14 {270#(and (= 0 main_~n~0) (= 40 (select |#length| |main_~#a~0.base|)) (= 0 |main_~#a~0.offset|))} is VALID [2020-07-29 01:18:15,353 INFO L280 TraceCheckUtils]: 8: Hoare triple {270#(and (= 0 main_~n~0) (= 40 (select |#length| |main_~#a~0.base|)) (= 0 |main_~#a~0.offset|))} havoc #t~nondet2; {270#(and (= 0 main_~n~0) (= 40 (select |#length| |main_~#a~0.base|)) (= 0 |main_~#a~0.offset|))} is VALID [2020-07-29 01:18:15,354 INFO L280 TraceCheckUtils]: 9: Hoare triple {270#(and (= 0 main_~n~0) (= 40 (select |#length| |main_~#a~0.base|)) (= 0 |main_~#a~0.offset|))} #t~pre1 := 1 + ~n~0;~n~0 := 1 + ~n~0;havoc #t~pre1; {271#(and (<= 1 main_~n~0) (= 40 (select |#length| |main_~#a~0.base|)) (<= main_~n~0 1) (= 0 |main_~#a~0.offset|))} is VALID [2020-07-29 01:18:15,356 INFO L280 TraceCheckUtils]: 10: Hoare triple {271#(and (<= 1 main_~n~0) (= 40 (select |#length| |main_~#a~0.base|)) (<= main_~n~0 1) (= 0 |main_~#a~0.offset|))} assume !!(~n~0 < 10);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {271#(and (<= 1 main_~n~0) (= 40 (select |#length| |main_~#a~0.base|)) (<= main_~n~0 1) (= 0 |main_~#a~0.offset|))} is VALID [2020-07-29 01:18:15,357 INFO L280 TraceCheckUtils]: 11: Hoare triple {271#(and (<= 1 main_~n~0) (= 40 (select |#length| |main_~#a~0.base|)) (<= main_~n~0 1) (= 0 |main_~#a~0.offset|))} assume !(4 + (~#a~0.offset + 4 * ~n~0) <= #length[~#a~0.base] && 0 <= ~#a~0.offset + 4 * ~n~0); {266#false} is VALID [2020-07-29 01:18:15,359 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:18:15,360 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600632571] [2020-07-29 01:18:15,360 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1347423913] [2020-07-29 01:18:15,361 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:18:15,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:18:15,410 INFO L263 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-29 01:18:15,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:18:15,427 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:18:15,518 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:18:15,519 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-29 01:18:15,532 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 01:18:15,532 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-29 01:18:15,533 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2020-07-29 01:18:15,538 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-29 01:18:15,538 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#length_11|]. (and (= 0 main_~n~0) (= |#length| (store |v_#length_11| |main_~#a~0.base| 40)) (= 0 |main_~#a~0.offset|)) [2020-07-29 01:18:15,539 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= 0 main_~n~0) (= 40 (select |#length| |main_~#a~0.base|)) (= 0 |main_~#a~0.offset|)) [2020-07-29 01:18:15,589 INFO L263 TraceCheckUtils]: 0: Hoare triple {265#true} call ULTIMATE.init(); {265#true} is VALID [2020-07-29 01:18:15,590 INFO L280 TraceCheckUtils]: 1: Hoare triple {265#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {265#true} is VALID [2020-07-29 01:18:15,592 INFO L280 TraceCheckUtils]: 2: Hoare triple {265#true} assume true; {265#true} is VALID [2020-07-29 01:18:15,592 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {265#true} {265#true} #52#return; {265#true} is VALID [2020-07-29 01:18:15,593 INFO L263 TraceCheckUtils]: 4: Hoare triple {265#true} call #t~ret6 := main(); {265#true} is VALID [2020-07-29 01:18:15,596 INFO L280 TraceCheckUtils]: 5: Hoare triple {265#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~i~0 := #t~nondet0;havoc #t~nondet0;call ~#a~0.base, ~#a~0.offset := #Ultimate.allocOnStack(40);~n~0 := 0; {270#(and (= 0 main_~n~0) (= 40 (select |#length| |main_~#a~0.base|)) (= 0 |main_~#a~0.offset|))} is VALID [2020-07-29 01:18:15,598 INFO L280 TraceCheckUtils]: 6: Hoare triple {270#(and (= 0 main_~n~0) (= 40 (select |#length| |main_~#a~0.base|)) (= 0 |main_~#a~0.offset|))} assume !!(~n~0 < 10);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {270#(and (= 0 main_~n~0) (= 40 (select |#length| |main_~#a~0.base|)) (= 0 |main_~#a~0.offset|))} is VALID [2020-07-29 01:18:15,599 INFO L280 TraceCheckUtils]: 7: Hoare triple {270#(and (= 0 main_~n~0) (= 40 (select |#length| |main_~#a~0.base|)) (= 0 |main_~#a~0.offset|))} SUMMARY for call write~int(#t~nondet2, ~#a~0.base, ~#a~0.offset + 4 * ~n~0, 4); srcloc: L14 {270#(and (= 0 main_~n~0) (= 40 (select |#length| |main_~#a~0.base|)) (= 0 |main_~#a~0.offset|))} is VALID [2020-07-29 01:18:15,604 INFO L280 TraceCheckUtils]: 8: Hoare triple {270#(and (= 0 main_~n~0) (= 40 (select |#length| |main_~#a~0.base|)) (= 0 |main_~#a~0.offset|))} havoc #t~nondet2; {270#(and (= 0 main_~n~0) (= 40 (select |#length| |main_~#a~0.base|)) (= 0 |main_~#a~0.offset|))} is VALID [2020-07-29 01:18:15,606 INFO L280 TraceCheckUtils]: 9: Hoare triple {270#(and (= 0 main_~n~0) (= 40 (select |#length| |main_~#a~0.base|)) (= 0 |main_~#a~0.offset|))} #t~pre1 := 1 + ~n~0;~n~0 := 1 + ~n~0;havoc #t~pre1; {271#(and (<= 1 main_~n~0) (= 40 (select |#length| |main_~#a~0.base|)) (<= main_~n~0 1) (= 0 |main_~#a~0.offset|))} is VALID [2020-07-29 01:18:15,608 INFO L280 TraceCheckUtils]: 10: Hoare triple {271#(and (<= 1 main_~n~0) (= 40 (select |#length| |main_~#a~0.base|)) (<= main_~n~0 1) (= 0 |main_~#a~0.offset|))} assume !!(~n~0 < 10);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {271#(and (<= 1 main_~n~0) (= 40 (select |#length| |main_~#a~0.base|)) (<= main_~n~0 1) (= 0 |main_~#a~0.offset|))} is VALID [2020-07-29 01:18:15,609 INFO L280 TraceCheckUtils]: 11: Hoare triple {271#(and (<= 1 main_~n~0) (= 40 (select |#length| |main_~#a~0.base|)) (<= main_~n~0 1) (= 0 |main_~#a~0.offset|))} assume !(4 + (~#a~0.offset + 4 * ~n~0) <= #length[~#a~0.base] && 0 <= ~#a~0.offset + 4 * ~n~0); {266#false} is VALID [2020-07-29 01:18:15,611 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:18:15,613 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-29 01:18:15,613 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3] total 4 [2020-07-29 01:18:15,614 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028845169] [2020-07-29 01:18:15,615 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2020-07-29 01:18:15,615 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:18:15,615 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-29 01:18:15,664 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:18:15,664 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-29 01:18:15,664 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:18:15,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-29 01:18:15,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-29 01:18:15,666 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand 5 states. [2020-07-29 01:18:15,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:18:15,909 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2020-07-29 01:18:15,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-29 01:18:15,909 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2020-07-29 01:18:15,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:18:15,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-29 01:18:15,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 34 transitions. [2020-07-29 01:18:15,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-29 01:18:15,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 34 transitions. [2020-07-29 01:18:15,914 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 34 transitions. [2020-07-29 01:18:15,963 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:18:15,965 INFO L225 Difference]: With dead ends: 30 [2020-07-29 01:18:15,965 INFO L226 Difference]: Without dead ends: 30 [2020-07-29 01:18:15,966 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:18:15,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2020-07-29 01:18:15,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 28. [2020-07-29 01:18:15,970 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:18:15,970 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand 28 states. [2020-07-29 01:18:15,970 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 28 states. [2020-07-29 01:18:15,970 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 28 states. [2020-07-29 01:18:15,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:18:15,973 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2020-07-29 01:18:15,973 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2020-07-29 01:18:15,974 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:18:15,974 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:18:15,975 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 30 states. [2020-07-29 01:18:15,975 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 30 states. [2020-07-29 01:18:15,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:18:15,978 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2020-07-29 01:18:15,978 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2020-07-29 01:18:15,979 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:18:15,979 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:18:15,979 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:18:15,980 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:18:15,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-07-29 01:18:15,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2020-07-29 01:18:15,982 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 12 [2020-07-29 01:18:15,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:18:15,983 INFO L479 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions. [2020-07-29 01:18:15,983 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-29 01:18:15,984 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2020-07-29 01:18:15,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-07-29 01:18:15,984 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:18:15,985 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:18:16,199 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2020-07-29 01:18:16,200 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr6ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION]=== [2020-07-29 01:18:16,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:18:16,200 INFO L82 PathProgramCache]: Analyzing trace with hash -2098043558, now seen corresponding path program 2 times [2020-07-29 01:18:16,201 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:18:16,201 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979466481] [2020-07-29 01:18:16,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:18:16,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:18:16,390 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-07-29 01:18:16,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:18:16,398 INFO L280 TraceCheckUtils]: 0: Hoare triple {435#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {426#true} is VALID [2020-07-29 01:18:16,398 INFO L280 TraceCheckUtils]: 1: Hoare triple {426#true} assume true; {426#true} is VALID [2020-07-29 01:18:16,399 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {426#true} {426#true} #52#return; {426#true} is VALID [2020-07-29 01:18:16,400 INFO L263 TraceCheckUtils]: 0: Hoare triple {426#true} call ULTIMATE.init(); {435#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-29 01:18:16,401 INFO L280 TraceCheckUtils]: 1: Hoare triple {435#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {426#true} is VALID [2020-07-29 01:18:16,401 INFO L280 TraceCheckUtils]: 2: Hoare triple {426#true} assume true; {426#true} is VALID [2020-07-29 01:18:16,402 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {426#true} {426#true} #52#return; {426#true} is VALID [2020-07-29 01:18:16,402 INFO L263 TraceCheckUtils]: 4: Hoare triple {426#true} call #t~ret6 := main(); {426#true} is VALID [2020-07-29 01:18:16,404 INFO L280 TraceCheckUtils]: 5: Hoare triple {426#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~i~0 := #t~nondet0;havoc #t~nondet0;call ~#a~0.base, ~#a~0.offset := #Ultimate.allocOnStack(40);~n~0 := 0; {431#(and (= 0 main_~n~0) (= 40 (select |#length| |main_~#a~0.base|)) (= 0 |main_~#a~0.offset|))} is VALID [2020-07-29 01:18:16,406 INFO L280 TraceCheckUtils]: 6: Hoare triple {431#(and (= 0 main_~n~0) (= 40 (select |#length| |main_~#a~0.base|)) (= 0 |main_~#a~0.offset|))} assume !!(~n~0 < 10);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {431#(and (= 0 main_~n~0) (= 40 (select |#length| |main_~#a~0.base|)) (= 0 |main_~#a~0.offset|))} is VALID [2020-07-29 01:18:16,407 INFO L280 TraceCheckUtils]: 7: Hoare triple {431#(and (= 0 main_~n~0) (= 40 (select |#length| |main_~#a~0.base|)) (= 0 |main_~#a~0.offset|))} SUMMARY for call write~int(#t~nondet2, ~#a~0.base, ~#a~0.offset + 4 * ~n~0, 4); srcloc: L14 {431#(and (= 0 main_~n~0) (= 40 (select |#length| |main_~#a~0.base|)) (= 0 |main_~#a~0.offset|))} is VALID [2020-07-29 01:18:16,408 INFO L280 TraceCheckUtils]: 8: Hoare triple {431#(and (= 0 main_~n~0) (= 40 (select |#length| |main_~#a~0.base|)) (= 0 |main_~#a~0.offset|))} havoc #t~nondet2; {431#(and (= 0 main_~n~0) (= 40 (select |#length| |main_~#a~0.base|)) (= 0 |main_~#a~0.offset|))} is VALID [2020-07-29 01:18:16,409 INFO L280 TraceCheckUtils]: 9: Hoare triple {431#(and (= 0 main_~n~0) (= 40 (select |#length| |main_~#a~0.base|)) (= 0 |main_~#a~0.offset|))} #t~pre1 := 1 + ~n~0;~n~0 := 1 + ~n~0;havoc #t~pre1; {432#(and (<= 1 main_~n~0) (= 40 (select |#length| |main_~#a~0.base|)) (= 0 |main_~#a~0.offset|))} is VALID [2020-07-29 01:18:16,411 INFO L280 TraceCheckUtils]: 10: Hoare triple {432#(and (<= 1 main_~n~0) (= 40 (select |#length| |main_~#a~0.base|)) (= 0 |main_~#a~0.offset|))} assume !!(~n~0 < 10);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {432#(and (<= 1 main_~n~0) (= 40 (select |#length| |main_~#a~0.base|)) (= 0 |main_~#a~0.offset|))} is VALID [2020-07-29 01:18:16,412 INFO L280 TraceCheckUtils]: 11: Hoare triple {432#(and (<= 1 main_~n~0) (= 40 (select |#length| |main_~#a~0.base|)) (= 0 |main_~#a~0.offset|))} SUMMARY for call write~int(#t~nondet2, ~#a~0.base, ~#a~0.offset + 4 * ~n~0, 4); srcloc: L14 {432#(and (<= 1 main_~n~0) (= 40 (select |#length| |main_~#a~0.base|)) (= 0 |main_~#a~0.offset|))} is VALID [2020-07-29 01:18:16,413 INFO L280 TraceCheckUtils]: 12: Hoare triple {432#(and (<= 1 main_~n~0) (= 40 (select |#length| |main_~#a~0.base|)) (= 0 |main_~#a~0.offset|))} havoc #t~nondet2; {432#(and (<= 1 main_~n~0) (= 40 (select |#length| |main_~#a~0.base|)) (= 0 |main_~#a~0.offset|))} is VALID [2020-07-29 01:18:16,415 INFO L280 TraceCheckUtils]: 13: Hoare triple {432#(and (<= 1 main_~n~0) (= 40 (select |#length| |main_~#a~0.base|)) (= 0 |main_~#a~0.offset|))} #t~pre1 := 1 + ~n~0;~n~0 := 1 + ~n~0;havoc #t~pre1; {433#(and (<= 2 main_~n~0) (= 40 (select |#length| |main_~#a~0.base|)) (= 0 |main_~#a~0.offset|))} is VALID [2020-07-29 01:18:16,416 INFO L280 TraceCheckUtils]: 14: Hoare triple {433#(and (<= 2 main_~n~0) (= 40 (select |#length| |main_~#a~0.base|)) (= 0 |main_~#a~0.offset|))} assume !!(~n~0 < 10);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {434#(and (<= main_~n~0 9) (<= 2 main_~n~0) (= 40 (select |#length| |main_~#a~0.base|)) (= 0 |main_~#a~0.offset|))} is VALID [2020-07-29 01:18:16,418 INFO L280 TraceCheckUtils]: 15: Hoare triple {434#(and (<= main_~n~0 9) (<= 2 main_~n~0) (= 40 (select |#length| |main_~#a~0.base|)) (= 0 |main_~#a~0.offset|))} assume !(4 + (~#a~0.offset + 4 * ~n~0) <= #length[~#a~0.base] && 0 <= ~#a~0.offset + 4 * ~n~0); {427#false} is VALID [2020-07-29 01:18:16,419 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:18:16,420 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979466481] [2020-07-29 01:18:16,420 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1567508190] [2020-07-29 01:18:16,421 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:18:16,456 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-29 01:18:16,456 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-29 01:18:16,457 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-29 01:18:16,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:18:16,467 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:18:16,487 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:18:16,487 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-29 01:18:16,495 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 01:18:16,496 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-29 01:18:16,496 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2020-07-29 01:18:16,499 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-29 01:18:16,500 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#length_12|]. (and (<= 0 main_~n~0) (= (store |v_#length_12| |main_~#a~0.base| 40) |#length|) (= 0 |main_~#a~0.offset|)) [2020-07-29 01:18:16,500 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (and (<= 0 main_~n~0) (= 40 (select |#length| |main_~#a~0.base|)) (= 0 |main_~#a~0.offset|)) [2020-07-29 01:18:16,629 INFO L263 TraceCheckUtils]: 0: Hoare triple {426#true} call ULTIMATE.init(); {426#true} is VALID [2020-07-29 01:18:16,629 INFO L280 TraceCheckUtils]: 1: Hoare triple {426#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {426#true} is VALID [2020-07-29 01:18:16,629 INFO L280 TraceCheckUtils]: 2: Hoare triple {426#true} assume true; {426#true} is VALID [2020-07-29 01:18:16,630 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {426#true} {426#true} #52#return; {426#true} is VALID [2020-07-29 01:18:16,630 INFO L263 TraceCheckUtils]: 4: Hoare triple {426#true} call #t~ret6 := main(); {426#true} is VALID [2020-07-29 01:18:16,632 INFO L280 TraceCheckUtils]: 5: Hoare triple {426#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~i~0 := #t~nondet0;havoc #t~nondet0;call ~#a~0.base, ~#a~0.offset := #Ultimate.allocOnStack(40);~n~0 := 0; {454#(and (<= 0 main_~n~0) (= 40 (select |#length| |main_~#a~0.base|)) (= 0 |main_~#a~0.offset|))} is VALID [2020-07-29 01:18:16,633 INFO L280 TraceCheckUtils]: 6: Hoare triple {454#(and (<= 0 main_~n~0) (= 40 (select |#length| |main_~#a~0.base|)) (= 0 |main_~#a~0.offset|))} assume !!(~n~0 < 10);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {454#(and (<= 0 main_~n~0) (= 40 (select |#length| |main_~#a~0.base|)) (= 0 |main_~#a~0.offset|))} is VALID [2020-07-29 01:18:16,634 INFO L280 TraceCheckUtils]: 7: Hoare triple {454#(and (<= 0 main_~n~0) (= 40 (select |#length| |main_~#a~0.base|)) (= 0 |main_~#a~0.offset|))} SUMMARY for call write~int(#t~nondet2, ~#a~0.base, ~#a~0.offset + 4 * ~n~0, 4); srcloc: L14 {454#(and (<= 0 main_~n~0) (= 40 (select |#length| |main_~#a~0.base|)) (= 0 |main_~#a~0.offset|))} is VALID [2020-07-29 01:18:16,635 INFO L280 TraceCheckUtils]: 8: Hoare triple {454#(and (<= 0 main_~n~0) (= 40 (select |#length| |main_~#a~0.base|)) (= 0 |main_~#a~0.offset|))} havoc #t~nondet2; {454#(and (<= 0 main_~n~0) (= 40 (select |#length| |main_~#a~0.base|)) (= 0 |main_~#a~0.offset|))} is VALID [2020-07-29 01:18:16,637 INFO L280 TraceCheckUtils]: 9: Hoare triple {454#(and (<= 0 main_~n~0) (= 40 (select |#length| |main_~#a~0.base|)) (= 0 |main_~#a~0.offset|))} #t~pre1 := 1 + ~n~0;~n~0 := 1 + ~n~0;havoc #t~pre1; {432#(and (<= 1 main_~n~0) (= 40 (select |#length| |main_~#a~0.base|)) (= 0 |main_~#a~0.offset|))} is VALID [2020-07-29 01:18:16,639 INFO L280 TraceCheckUtils]: 10: Hoare triple {432#(and (<= 1 main_~n~0) (= 40 (select |#length| |main_~#a~0.base|)) (= 0 |main_~#a~0.offset|))} assume !!(~n~0 < 10);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {432#(and (<= 1 main_~n~0) (= 40 (select |#length| |main_~#a~0.base|)) (= 0 |main_~#a~0.offset|))} is VALID [2020-07-29 01:18:16,645 INFO L280 TraceCheckUtils]: 11: Hoare triple {432#(and (<= 1 main_~n~0) (= 40 (select |#length| |main_~#a~0.base|)) (= 0 |main_~#a~0.offset|))} SUMMARY for call write~int(#t~nondet2, ~#a~0.base, ~#a~0.offset + 4 * ~n~0, 4); srcloc: L14 {432#(and (<= 1 main_~n~0) (= 40 (select |#length| |main_~#a~0.base|)) (= 0 |main_~#a~0.offset|))} is VALID [2020-07-29 01:18:16,647 INFO L280 TraceCheckUtils]: 12: Hoare triple {432#(and (<= 1 main_~n~0) (= 40 (select |#length| |main_~#a~0.base|)) (= 0 |main_~#a~0.offset|))} havoc #t~nondet2; {432#(and (<= 1 main_~n~0) (= 40 (select |#length| |main_~#a~0.base|)) (= 0 |main_~#a~0.offset|))} is VALID [2020-07-29 01:18:16,649 INFO L280 TraceCheckUtils]: 13: Hoare triple {432#(and (<= 1 main_~n~0) (= 40 (select |#length| |main_~#a~0.base|)) (= 0 |main_~#a~0.offset|))} #t~pre1 := 1 + ~n~0;~n~0 := 1 + ~n~0;havoc #t~pre1; {433#(and (<= 2 main_~n~0) (= 40 (select |#length| |main_~#a~0.base|)) (= 0 |main_~#a~0.offset|))} is VALID [2020-07-29 01:18:16,651 INFO L280 TraceCheckUtils]: 14: Hoare triple {433#(and (<= 2 main_~n~0) (= 40 (select |#length| |main_~#a~0.base|)) (= 0 |main_~#a~0.offset|))} assume !!(~n~0 < 10);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {434#(and (<= main_~n~0 9) (<= 2 main_~n~0) (= 40 (select |#length| |main_~#a~0.base|)) (= 0 |main_~#a~0.offset|))} is VALID [2020-07-29 01:18:16,653 INFO L280 TraceCheckUtils]: 15: Hoare triple {434#(and (<= main_~n~0 9) (<= 2 main_~n~0) (= 40 (select |#length| |main_~#a~0.base|)) (= 0 |main_~#a~0.offset|))} assume !(4 + (~#a~0.offset + 4 * ~n~0) <= #length[~#a~0.base] && 0 <= ~#a~0.offset + 4 * ~n~0); {427#false} is VALID [2020-07-29 01:18:16,655 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:18:16,655 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-29 01:18:16,655 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2020-07-29 01:18:16,656 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520266919] [2020-07-29 01:18:16,657 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2020-07-29 01:18:16,657 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:18:16,657 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-29 01:18:16,697 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:18:16,697 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-29 01:18:16,697 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:18:16,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-29 01:18:16,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2020-07-29 01:18:16,698 INFO L87 Difference]: Start difference. First operand 28 states and 30 transitions. Second operand 6 states. [2020-07-29 01:18:16,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:18:16,880 INFO L93 Difference]: Finished difference Result 29 states and 31 transitions. [2020-07-29 01:18:16,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-29 01:18:16,880 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2020-07-29 01:18:16,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:18:16,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-29 01:18:16,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 32 transitions. [2020-07-29 01:18:16,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-29 01:18:16,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 32 transitions. [2020-07-29 01:18:16,892 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 32 transitions. [2020-07-29 01:18:16,941 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:18:16,943 INFO L225 Difference]: With dead ends: 29 [2020-07-29 01:18:16,943 INFO L226 Difference]: Without dead ends: 29 [2020-07-29 01:18:16,943 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2020-07-29 01:18:16,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2020-07-29 01:18:16,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 26. [2020-07-29 01:18:16,946 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:18:16,946 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand 26 states. [2020-07-29 01:18:16,947 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 26 states. [2020-07-29 01:18:16,947 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 26 states. [2020-07-29 01:18:16,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:18:16,949 INFO L93 Difference]: Finished difference Result 29 states and 31 transitions. [2020-07-29 01:18:16,949 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2020-07-29 01:18:16,950 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:18:16,950 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:18:16,950 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 29 states. [2020-07-29 01:18:16,950 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 29 states. [2020-07-29 01:18:16,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:18:16,952 INFO L93 Difference]: Finished difference Result 29 states and 31 transitions. [2020-07-29 01:18:16,953 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2020-07-29 01:18:16,953 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:18:16,953 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:18:16,954 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:18:16,954 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:18:16,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2020-07-29 01:18:16,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2020-07-29 01:18:16,956 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 16 [2020-07-29 01:18:16,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:18:16,956 INFO L479 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2020-07-29 01:18:16,956 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-29 01:18:16,956 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2020-07-29 01:18:16,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-07-29 01:18:16,957 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:18:16,957 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:18:17,171 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-29 01:18:17,172 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr6ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION]=== [2020-07-29 01:18:17,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:18:17,173 INFO L82 PathProgramCache]: Analyzing trace with hash -1880246455, now seen corresponding path program 1 times [2020-07-29 01:18:17,174 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:18:17,174 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172181471] [2020-07-29 01:18:17,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:18:17,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:18:17,274 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-07-29 01:18:17,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:18:17,280 INFO L280 TraceCheckUtils]: 0: Hoare triple {605#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {597#true} is VALID [2020-07-29 01:18:17,280 INFO L280 TraceCheckUtils]: 1: Hoare triple {597#true} assume true; {597#true} is VALID [2020-07-29 01:18:17,281 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {597#true} {597#true} #52#return; {597#true} is VALID [2020-07-29 01:18:17,282 INFO L263 TraceCheckUtils]: 0: Hoare triple {597#true} call ULTIMATE.init(); {605#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-29 01:18:17,282 INFO L280 TraceCheckUtils]: 1: Hoare triple {605#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {597#true} is VALID [2020-07-29 01:18:17,283 INFO L280 TraceCheckUtils]: 2: Hoare triple {597#true} assume true; {597#true} is VALID [2020-07-29 01:18:17,283 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {597#true} {597#true} #52#return; {597#true} is VALID [2020-07-29 01:18:17,283 INFO L263 TraceCheckUtils]: 4: Hoare triple {597#true} call #t~ret6 := main(); {597#true} is VALID [2020-07-29 01:18:17,284 INFO L280 TraceCheckUtils]: 5: Hoare triple {597#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~i~0 := #t~nondet0;havoc #t~nondet0;call ~#a~0.base, ~#a~0.offset := #Ultimate.allocOnStack(40);~n~0 := 0; {602#(= 0 main_~n~0)} is VALID [2020-07-29 01:18:17,285 INFO L280 TraceCheckUtils]: 6: Hoare triple {602#(= 0 main_~n~0)} assume !!(~n~0 < 10);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {602#(= 0 main_~n~0)} is VALID [2020-07-29 01:18:17,286 INFO L280 TraceCheckUtils]: 7: Hoare triple {602#(= 0 main_~n~0)} SUMMARY for call write~int(#t~nondet2, ~#a~0.base, ~#a~0.offset + 4 * ~n~0, 4); srcloc: L14 {602#(= 0 main_~n~0)} is VALID [2020-07-29 01:18:17,287 INFO L280 TraceCheckUtils]: 8: Hoare triple {602#(= 0 main_~n~0)} havoc #t~nondet2; {602#(= 0 main_~n~0)} is VALID [2020-07-29 01:18:17,288 INFO L280 TraceCheckUtils]: 9: Hoare triple {602#(= 0 main_~n~0)} #t~pre1 := 1 + ~n~0;~n~0 := 1 + ~n~0;havoc #t~pre1; {603#(<= main_~n~0 1)} is VALID [2020-07-29 01:18:17,306 INFO L280 TraceCheckUtils]: 10: Hoare triple {603#(<= main_~n~0 1)} assume !!(~n~0 < 10);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {603#(<= main_~n~0 1)} is VALID [2020-07-29 01:18:17,309 INFO L280 TraceCheckUtils]: 11: Hoare triple {603#(<= main_~n~0 1)} SUMMARY for call write~int(#t~nondet2, ~#a~0.base, ~#a~0.offset + 4 * ~n~0, 4); srcloc: L14 {603#(<= main_~n~0 1)} is VALID [2020-07-29 01:18:17,309 INFO L280 TraceCheckUtils]: 12: Hoare triple {603#(<= main_~n~0 1)} havoc #t~nondet2; {603#(<= main_~n~0 1)} is VALID [2020-07-29 01:18:17,310 INFO L280 TraceCheckUtils]: 13: Hoare triple {603#(<= main_~n~0 1)} #t~pre1 := 1 + ~n~0;~n~0 := 1 + ~n~0;havoc #t~pre1; {604#(<= main_~n~0 2)} is VALID [2020-07-29 01:18:17,312 INFO L280 TraceCheckUtils]: 14: Hoare triple {604#(<= main_~n~0 2)} assume !(~n~0 < 10); {598#false} is VALID [2020-07-29 01:18:17,312 INFO L280 TraceCheckUtils]: 15: Hoare triple {598#false} #t~short4 := 0 <= ~i~0 && ~i~0 < 10; {598#false} is VALID [2020-07-29 01:18:17,312 INFO L280 TraceCheckUtils]: 16: Hoare triple {598#false} assume #t~short4; {598#false} is VALID [2020-07-29 01:18:17,313 INFO L280 TraceCheckUtils]: 17: Hoare triple {598#false} assume !(4 + (~#a~0.offset + 4 * ~i~0) <= #length[~#a~0.base] && 0 <= ~#a~0.offset + 4 * ~i~0); {598#false} is VALID [2020-07-29 01:18:17,313 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:18:17,314 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172181471] [2020-07-29 01:18:17,314 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [80824375] [2020-07-29 01:18:17,314 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:18:17,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:18:17,347 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 01:18:17,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:18:17,356 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:18:17,453 INFO L263 TraceCheckUtils]: 0: Hoare triple {597#true} call ULTIMATE.init(); {597#true} is VALID [2020-07-29 01:18:17,454 INFO L280 TraceCheckUtils]: 1: Hoare triple {597#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {597#true} is VALID [2020-07-29 01:18:17,454 INFO L280 TraceCheckUtils]: 2: Hoare triple {597#true} assume true; {597#true} is VALID [2020-07-29 01:18:17,455 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {597#true} {597#true} #52#return; {597#true} is VALID [2020-07-29 01:18:17,455 INFO L263 TraceCheckUtils]: 4: Hoare triple {597#true} call #t~ret6 := main(); {597#true} is VALID [2020-07-29 01:18:17,456 INFO L280 TraceCheckUtils]: 5: Hoare triple {597#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~i~0 := #t~nondet0;havoc #t~nondet0;call ~#a~0.base, ~#a~0.offset := #Ultimate.allocOnStack(40);~n~0 := 0; {624#(<= main_~n~0 0)} is VALID [2020-07-29 01:18:17,457 INFO L280 TraceCheckUtils]: 6: Hoare triple {624#(<= main_~n~0 0)} assume !!(~n~0 < 10);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {624#(<= main_~n~0 0)} is VALID [2020-07-29 01:18:17,457 INFO L280 TraceCheckUtils]: 7: Hoare triple {624#(<= main_~n~0 0)} SUMMARY for call write~int(#t~nondet2, ~#a~0.base, ~#a~0.offset + 4 * ~n~0, 4); srcloc: L14 {624#(<= main_~n~0 0)} is VALID [2020-07-29 01:18:17,458 INFO L280 TraceCheckUtils]: 8: Hoare triple {624#(<= main_~n~0 0)} havoc #t~nondet2; {624#(<= main_~n~0 0)} is VALID [2020-07-29 01:18:17,459 INFO L280 TraceCheckUtils]: 9: Hoare triple {624#(<= main_~n~0 0)} #t~pre1 := 1 + ~n~0;~n~0 := 1 + ~n~0;havoc #t~pre1; {603#(<= main_~n~0 1)} is VALID [2020-07-29 01:18:17,460 INFO L280 TraceCheckUtils]: 10: Hoare triple {603#(<= main_~n~0 1)} assume !!(~n~0 < 10);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {603#(<= main_~n~0 1)} is VALID [2020-07-29 01:18:17,461 INFO L280 TraceCheckUtils]: 11: Hoare triple {603#(<= main_~n~0 1)} SUMMARY for call write~int(#t~nondet2, ~#a~0.base, ~#a~0.offset + 4 * ~n~0, 4); srcloc: L14 {603#(<= main_~n~0 1)} is VALID [2020-07-29 01:18:17,462 INFO L280 TraceCheckUtils]: 12: Hoare triple {603#(<= main_~n~0 1)} havoc #t~nondet2; {603#(<= main_~n~0 1)} is VALID [2020-07-29 01:18:17,463 INFO L280 TraceCheckUtils]: 13: Hoare triple {603#(<= main_~n~0 1)} #t~pre1 := 1 + ~n~0;~n~0 := 1 + ~n~0;havoc #t~pre1; {604#(<= main_~n~0 2)} is VALID [2020-07-29 01:18:17,464 INFO L280 TraceCheckUtils]: 14: Hoare triple {604#(<= main_~n~0 2)} assume !(~n~0 < 10); {598#false} is VALID [2020-07-29 01:18:17,464 INFO L280 TraceCheckUtils]: 15: Hoare triple {598#false} #t~short4 := 0 <= ~i~0 && ~i~0 < 10; {598#false} is VALID [2020-07-29 01:18:17,464 INFO L280 TraceCheckUtils]: 16: Hoare triple {598#false} assume #t~short4; {598#false} is VALID [2020-07-29 01:18:17,464 INFO L280 TraceCheckUtils]: 17: Hoare triple {598#false} assume !(4 + (~#a~0.offset + 4 * ~i~0) <= #length[~#a~0.base] && 0 <= ~#a~0.offset + 4 * ~i~0); {598#false} is VALID [2020-07-29 01:18:17,465 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:18:17,466 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-29 01:18:17,466 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 7 [2020-07-29 01:18:17,466 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498893515] [2020-07-29 01:18:17,466 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2020-07-29 01:18:17,467 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:18:17,467 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-29 01:18:17,496 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:18:17,496 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-29 01:18:17,496 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:18:17,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-29 01:18:17,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-07-29 01:18:17,497 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. Second operand 7 states. [2020-07-29 01:18:17,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:18:17,653 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2020-07-29 01:18:17,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-29 01:18:17,654 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2020-07-29 01:18:17,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:18:17,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-29 01:18:17,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 36 transitions. [2020-07-29 01:18:17,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-29 01:18:17,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 36 transitions. [2020-07-29 01:18:17,658 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 36 transitions. [2020-07-29 01:18:17,698 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:18:17,699 INFO L225 Difference]: With dead ends: 33 [2020-07-29 01:18:17,699 INFO L226 Difference]: Without dead ends: 33 [2020-07-29 01:18:17,699 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-07-29 01:18:17,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2020-07-29 01:18:17,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 30. [2020-07-29 01:18:17,703 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:18:17,703 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand 30 states. [2020-07-29 01:18:17,703 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 30 states. [2020-07-29 01:18:17,704 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 30 states. [2020-07-29 01:18:17,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:18:17,706 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2020-07-29 01:18:17,706 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2020-07-29 01:18:17,707 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:18:17,707 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:18:17,707 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 33 states. [2020-07-29 01:18:17,707 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 33 states. [2020-07-29 01:18:17,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:18:17,709 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2020-07-29 01:18:17,710 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2020-07-29 01:18:17,710 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:18:17,710 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:18:17,711 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:18:17,711 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:18:17,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-07-29 01:18:17,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2020-07-29 01:18:17,713 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 32 transitions. Word has length 18 [2020-07-29 01:18:17,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:18:17,713 INFO L479 AbstractCegarLoop]: Abstraction has 30 states and 32 transitions. [2020-07-29 01:18:17,714 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-29 01:18:17,714 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2020-07-29 01:18:17,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-07-29 01:18:17,715 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:18:17,715 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:18:17,928 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-29 01:18:17,929 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr6ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION]=== [2020-07-29 01:18:17,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:18:17,930 INFO L82 PathProgramCache]: Analyzing trace with hash 671779276, now seen corresponding path program 2 times [2020-07-29 01:18:17,930 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:18:17,931 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049198430] [2020-07-29 01:18:17,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:18:17,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:18:18,042 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-07-29 01:18:18,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:18:18,047 INFO L280 TraceCheckUtils]: 0: Hoare triple {797#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {789#true} is VALID [2020-07-29 01:18:18,047 INFO L280 TraceCheckUtils]: 1: Hoare triple {789#true} assume true; {789#true} is VALID [2020-07-29 01:18:18,047 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {789#true} {789#true} #52#return; {789#true} is VALID [2020-07-29 01:18:18,048 INFO L263 TraceCheckUtils]: 0: Hoare triple {789#true} call ULTIMATE.init(); {797#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-29 01:18:18,049 INFO L280 TraceCheckUtils]: 1: Hoare triple {797#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {789#true} is VALID [2020-07-29 01:18:18,049 INFO L280 TraceCheckUtils]: 2: Hoare triple {789#true} assume true; {789#true} is VALID [2020-07-29 01:18:18,049 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {789#true} {789#true} #52#return; {789#true} is VALID [2020-07-29 01:18:18,049 INFO L263 TraceCheckUtils]: 4: Hoare triple {789#true} call #t~ret6 := main(); {789#true} is VALID [2020-07-29 01:18:18,051 INFO L280 TraceCheckUtils]: 5: Hoare triple {789#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~i~0 := #t~nondet0;havoc #t~nondet0;call ~#a~0.base, ~#a~0.offset := #Ultimate.allocOnStack(40);~n~0 := 0; {794#(and (= 40 (select |#length| |main_~#a~0.base|)) (= 0 |main_~#a~0.offset|))} is VALID [2020-07-29 01:18:18,052 INFO L280 TraceCheckUtils]: 6: Hoare triple {794#(and (= 40 (select |#length| |main_~#a~0.base|)) (= 0 |main_~#a~0.offset|))} assume !!(~n~0 < 10);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {794#(and (= 40 (select |#length| |main_~#a~0.base|)) (= 0 |main_~#a~0.offset|))} is VALID [2020-07-29 01:18:18,053 INFO L280 TraceCheckUtils]: 7: Hoare triple {794#(and (= 40 (select |#length| |main_~#a~0.base|)) (= 0 |main_~#a~0.offset|))} SUMMARY for call write~int(#t~nondet2, ~#a~0.base, ~#a~0.offset + 4 * ~n~0, 4); srcloc: L14 {794#(and (= 40 (select |#length| |main_~#a~0.base|)) (= 0 |main_~#a~0.offset|))} is VALID [2020-07-29 01:18:18,053 INFO L280 TraceCheckUtils]: 8: Hoare triple {794#(and (= 40 (select |#length| |main_~#a~0.base|)) (= 0 |main_~#a~0.offset|))} havoc #t~nondet2; {794#(and (= 40 (select |#length| |main_~#a~0.base|)) (= 0 |main_~#a~0.offset|))} is VALID [2020-07-29 01:18:18,054 INFO L280 TraceCheckUtils]: 9: Hoare triple {794#(and (= 40 (select |#length| |main_~#a~0.base|)) (= 0 |main_~#a~0.offset|))} #t~pre1 := 1 + ~n~0;~n~0 := 1 + ~n~0;havoc #t~pre1; {794#(and (= 40 (select |#length| |main_~#a~0.base|)) (= 0 |main_~#a~0.offset|))} is VALID [2020-07-29 01:18:18,055 INFO L280 TraceCheckUtils]: 10: Hoare triple {794#(and (= 40 (select |#length| |main_~#a~0.base|)) (= 0 |main_~#a~0.offset|))} assume !!(~n~0 < 10);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {794#(and (= 40 (select |#length| |main_~#a~0.base|)) (= 0 |main_~#a~0.offset|))} is VALID [2020-07-29 01:18:18,056 INFO L280 TraceCheckUtils]: 11: Hoare triple {794#(and (= 40 (select |#length| |main_~#a~0.base|)) (= 0 |main_~#a~0.offset|))} SUMMARY for call write~int(#t~nondet2, ~#a~0.base, ~#a~0.offset + 4 * ~n~0, 4); srcloc: L14 {794#(and (= 40 (select |#length| |main_~#a~0.base|)) (= 0 |main_~#a~0.offset|))} is VALID [2020-07-29 01:18:18,056 INFO L280 TraceCheckUtils]: 12: Hoare triple {794#(and (= 40 (select |#length| |main_~#a~0.base|)) (= 0 |main_~#a~0.offset|))} havoc #t~nondet2; {794#(and (= 40 (select |#length| |main_~#a~0.base|)) (= 0 |main_~#a~0.offset|))} is VALID [2020-07-29 01:18:18,057 INFO L280 TraceCheckUtils]: 13: Hoare triple {794#(and (= 40 (select |#length| |main_~#a~0.base|)) (= 0 |main_~#a~0.offset|))} #t~pre1 := 1 + ~n~0;~n~0 := 1 + ~n~0;havoc #t~pre1; {794#(and (= 40 (select |#length| |main_~#a~0.base|)) (= 0 |main_~#a~0.offset|))} is VALID [2020-07-29 01:18:18,058 INFO L280 TraceCheckUtils]: 14: Hoare triple {794#(and (= 40 (select |#length| |main_~#a~0.base|)) (= 0 |main_~#a~0.offset|))} assume !!(~n~0 < 10);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {794#(and (= 40 (select |#length| |main_~#a~0.base|)) (= 0 |main_~#a~0.offset|))} is VALID [2020-07-29 01:18:18,059 INFO L280 TraceCheckUtils]: 15: Hoare triple {794#(and (= 40 (select |#length| |main_~#a~0.base|)) (= 0 |main_~#a~0.offset|))} SUMMARY for call write~int(#t~nondet2, ~#a~0.base, ~#a~0.offset + 4 * ~n~0, 4); srcloc: L14 {794#(and (= 40 (select |#length| |main_~#a~0.base|)) (= 0 |main_~#a~0.offset|))} is VALID [2020-07-29 01:18:18,060 INFO L280 TraceCheckUtils]: 16: Hoare triple {794#(and (= 40 (select |#length| |main_~#a~0.base|)) (= 0 |main_~#a~0.offset|))} havoc #t~nondet2; {794#(and (= 40 (select |#length| |main_~#a~0.base|)) (= 0 |main_~#a~0.offset|))} is VALID [2020-07-29 01:18:18,060 INFO L280 TraceCheckUtils]: 17: Hoare triple {794#(and (= 40 (select |#length| |main_~#a~0.base|)) (= 0 |main_~#a~0.offset|))} #t~pre1 := 1 + ~n~0;~n~0 := 1 + ~n~0;havoc #t~pre1; {794#(and (= 40 (select |#length| |main_~#a~0.base|)) (= 0 |main_~#a~0.offset|))} is VALID [2020-07-29 01:18:18,061 INFO L280 TraceCheckUtils]: 18: Hoare triple {794#(and (= 40 (select |#length| |main_~#a~0.base|)) (= 0 |main_~#a~0.offset|))} assume !(~n~0 < 10); {794#(and (= 40 (select |#length| |main_~#a~0.base|)) (= 0 |main_~#a~0.offset|))} is VALID [2020-07-29 01:18:18,062 INFO L280 TraceCheckUtils]: 19: Hoare triple {794#(and (= 40 (select |#length| |main_~#a~0.base|)) (= 0 |main_~#a~0.offset|))} #t~short4 := 0 <= ~i~0 && ~i~0 < 10; {795#(or (and (<= 0 main_~i~0) (= 40 (select |#length| |main_~#a~0.base|)) (<= main_~i~0 9) (= 0 |main_~#a~0.offset|)) (not |main_#t~short4|))} is VALID [2020-07-29 01:18:18,063 INFO L280 TraceCheckUtils]: 20: Hoare triple {795#(or (and (<= 0 main_~i~0) (= 40 (select |#length| |main_~#a~0.base|)) (<= main_~i~0 9) (= 0 |main_~#a~0.offset|)) (not |main_#t~short4|))} assume #t~short4; {796#(and (<= 0 main_~i~0) (= 40 (select |#length| |main_~#a~0.base|)) (<= main_~i~0 9) (= 0 |main_~#a~0.offset|))} is VALID [2020-07-29 01:18:18,064 INFO L280 TraceCheckUtils]: 21: Hoare triple {796#(and (<= 0 main_~i~0) (= 40 (select |#length| |main_~#a~0.base|)) (<= main_~i~0 9) (= 0 |main_~#a~0.offset|))} assume !(4 + (~#a~0.offset + 4 * ~i~0) <= #length[~#a~0.base] && 0 <= ~#a~0.offset + 4 * ~i~0); {790#false} is VALID [2020-07-29 01:18:18,066 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2020-07-29 01:18:18,066 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049198430] [2020-07-29 01:18:18,066 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:18:18,066 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-29 01:18:18,066 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241091874] [2020-07-29 01:18:18,067 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2020-07-29 01:18:18,067 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:18:18,067 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-29 01:18:18,085 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:18:18,086 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-29 01:18:18,086 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:18:18,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-29 01:18:18,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-29 01:18:18,087 INFO L87 Difference]: Start difference. First operand 30 states and 32 transitions. Second operand 6 states. [2020-07-29 01:18:18,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:18:18,312 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2020-07-29 01:18:18,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-29 01:18:18,313 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2020-07-29 01:18:18,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:18:18,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-29 01:18:18,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 29 transitions. [2020-07-29 01:18:18,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-29 01:18:18,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 29 transitions. [2020-07-29 01:18:18,319 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 29 transitions. [2020-07-29 01:18:18,358 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:18:18,359 INFO L225 Difference]: With dead ends: 33 [2020-07-29 01:18:18,359 INFO L226 Difference]: Without dead ends: 33 [2020-07-29 01:18:18,360 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2020-07-29 01:18:18,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2020-07-29 01:18:18,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 29. [2020-07-29 01:18:18,362 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:18:18,362 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand 29 states. [2020-07-29 01:18:18,363 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 29 states. [2020-07-29 01:18:18,363 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 29 states. [2020-07-29 01:18:18,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:18:18,364 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2020-07-29 01:18:18,365 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2020-07-29 01:18:18,365 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:18:18,365 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:18:18,365 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 33 states. [2020-07-29 01:18:18,365 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 33 states. [2020-07-29 01:18:18,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:18:18,367 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2020-07-29 01:18:18,367 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2020-07-29 01:18:18,368 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:18:18,368 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:18:18,368 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:18:18,368 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:18:18,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2020-07-29 01:18:18,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2020-07-29 01:18:18,370 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 22 [2020-07-29 01:18:18,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:18:18,370 INFO L479 AbstractCegarLoop]: Abstraction has 29 states and 31 transitions. [2020-07-29 01:18:18,370 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-29 01:18:18,370 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2020-07-29 01:18:18,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-07-29 01:18:18,371 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:18:18,371 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:18:18,371 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-29 01:18:18,371 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr6ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION]=== [2020-07-29 01:18:18,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:18:18,372 INFO L82 PathProgramCache]: Analyzing trace with hash -649672835, now seen corresponding path program 1 times [2020-07-29 01:18:18,372 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:18:18,372 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088419989] [2020-07-29 01:18:18,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:18:18,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:18:18,417 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-07-29 01:18:18,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:18:18,421 INFO L280 TraceCheckUtils]: 0: Hoare triple {936#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {930#true} is VALID [2020-07-29 01:18:18,421 INFO L280 TraceCheckUtils]: 1: Hoare triple {930#true} assume true; {930#true} is VALID [2020-07-29 01:18:18,422 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {930#true} {930#true} #52#return; {930#true} is VALID [2020-07-29 01:18:18,423 INFO L263 TraceCheckUtils]: 0: Hoare triple {930#true} call ULTIMATE.init(); {936#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-29 01:18:18,423 INFO L280 TraceCheckUtils]: 1: Hoare triple {936#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {930#true} is VALID [2020-07-29 01:18:18,423 INFO L280 TraceCheckUtils]: 2: Hoare triple {930#true} assume true; {930#true} is VALID [2020-07-29 01:18:18,423 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {930#true} {930#true} #52#return; {930#true} is VALID [2020-07-29 01:18:18,424 INFO L263 TraceCheckUtils]: 4: Hoare triple {930#true} call #t~ret6 := main(); {930#true} is VALID [2020-07-29 01:18:18,424 INFO L280 TraceCheckUtils]: 5: Hoare triple {930#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~i~0 := #t~nondet0;havoc #t~nondet0;call ~#a~0.base, ~#a~0.offset := #Ultimate.allocOnStack(40);~n~0 := 0; {930#true} is VALID [2020-07-29 01:18:18,424 INFO L280 TraceCheckUtils]: 6: Hoare triple {930#true} assume !!(~n~0 < 10);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {930#true} is VALID [2020-07-29 01:18:18,424 INFO L280 TraceCheckUtils]: 7: Hoare triple {930#true} SUMMARY for call write~int(#t~nondet2, ~#a~0.base, ~#a~0.offset + 4 * ~n~0, 4); srcloc: L14 {930#true} is VALID [2020-07-29 01:18:18,424 INFO L280 TraceCheckUtils]: 8: Hoare triple {930#true} havoc #t~nondet2; {930#true} is VALID [2020-07-29 01:18:18,425 INFO L280 TraceCheckUtils]: 9: Hoare triple {930#true} #t~pre1 := 1 + ~n~0;~n~0 := 1 + ~n~0;havoc #t~pre1; {930#true} is VALID [2020-07-29 01:18:18,425 INFO L280 TraceCheckUtils]: 10: Hoare triple {930#true} assume !!(~n~0 < 10);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {930#true} is VALID [2020-07-29 01:18:18,425 INFO L280 TraceCheckUtils]: 11: Hoare triple {930#true} SUMMARY for call write~int(#t~nondet2, ~#a~0.base, ~#a~0.offset + 4 * ~n~0, 4); srcloc: L14 {930#true} is VALID [2020-07-29 01:18:18,425 INFO L280 TraceCheckUtils]: 12: Hoare triple {930#true} havoc #t~nondet2; {930#true} is VALID [2020-07-29 01:18:18,426 INFO L280 TraceCheckUtils]: 13: Hoare triple {930#true} #t~pre1 := 1 + ~n~0;~n~0 := 1 + ~n~0;havoc #t~pre1; {930#true} is VALID [2020-07-29 01:18:18,426 INFO L280 TraceCheckUtils]: 14: Hoare triple {930#true} assume !!(~n~0 < 10);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {930#true} is VALID [2020-07-29 01:18:18,426 INFO L280 TraceCheckUtils]: 15: Hoare triple {930#true} SUMMARY for call write~int(#t~nondet2, ~#a~0.base, ~#a~0.offset + 4 * ~n~0, 4); srcloc: L14 {930#true} is VALID [2020-07-29 01:18:18,426 INFO L280 TraceCheckUtils]: 16: Hoare triple {930#true} havoc #t~nondet2; {930#true} is VALID [2020-07-29 01:18:18,426 INFO L280 TraceCheckUtils]: 17: Hoare triple {930#true} #t~pre1 := 1 + ~n~0;~n~0 := 1 + ~n~0;havoc #t~pre1; {930#true} is VALID [2020-07-29 01:18:18,427 INFO L280 TraceCheckUtils]: 18: Hoare triple {930#true} assume !(~n~0 < 10); {930#true} is VALID [2020-07-29 01:18:18,427 INFO L280 TraceCheckUtils]: 19: Hoare triple {930#true} #t~short4 := 0 <= ~i~0 && ~i~0 < 10; {930#true} is VALID [2020-07-29 01:18:18,428 INFO L280 TraceCheckUtils]: 20: Hoare triple {930#true} assume !#t~short4; {935#(not |main_#t~short4|)} is VALID [2020-07-29 01:18:18,429 INFO L280 TraceCheckUtils]: 21: Hoare triple {935#(not |main_#t~short4|)} assume !!#t~short4;havoc #t~mem3;havoc #t~short4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~i~0 := #t~nondet5;havoc #t~nondet5; {931#false} is VALID [2020-07-29 01:18:18,429 INFO L280 TraceCheckUtils]: 22: Hoare triple {931#false} assume !(4 + (~#a~0.offset + 4 * ~i~0) <= #length[~#a~0.base] && 0 <= ~#a~0.offset + 4 * ~i~0); {931#false} is VALID [2020-07-29 01:18:18,430 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2020-07-29 01:18:18,430 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088419989] [2020-07-29 01:18:18,431 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:18:18,431 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-29 01:18:18,431 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774354411] [2020-07-29 01:18:18,431 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2020-07-29 01:18:18,432 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:18:18,432 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 01:18:18,447 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:18:18,447 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-29 01:18:18,447 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:18:18,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-29 01:18:18,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-29 01:18:18,448 INFO L87 Difference]: Start difference. First operand 29 states and 31 transitions. Second operand 4 states. [2020-07-29 01:18:18,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:18:18,530 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2020-07-29 01:18:18,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-29 01:18:18,530 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2020-07-29 01:18:18,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:18:18,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 01:18:18,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 24 transitions. [2020-07-29 01:18:18,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 01:18:18,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 24 transitions. [2020-07-29 01:18:18,533 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 24 transitions. [2020-07-29 01:18:18,571 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:18:18,572 INFO L225 Difference]: With dead ends: 30 [2020-07-29 01:18:18,572 INFO L226 Difference]: Without dead ends: 30 [2020-07-29 01:18:18,574 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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:18:18,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2020-07-29 01:18:18,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2020-07-29 01:18:18,579 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:18:18,579 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand 30 states. [2020-07-29 01:18:18,579 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 30 states. [2020-07-29 01:18:18,579 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 30 states. [2020-07-29 01:18:18,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:18:18,583 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2020-07-29 01:18:18,583 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2020-07-29 01:18:18,583 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:18:18,584 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:18:18,584 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 30 states. [2020-07-29 01:18:18,584 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 30 states. [2020-07-29 01:18:18,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:18:18,589 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2020-07-29 01:18:18,589 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2020-07-29 01:18:18,589 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:18:18,589 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:18:18,590 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:18:18,590 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:18:18,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-07-29 01:18:18,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2020-07-29 01:18:18,594 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 32 transitions. Word has length 23 [2020-07-29 01:18:18,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:18:18,595 INFO L479 AbstractCegarLoop]: Abstraction has 30 states and 32 transitions. [2020-07-29 01:18:18,595 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-29 01:18:18,596 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2020-07-29 01:18:18,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-07-29 01:18:18,597 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:18:18,597 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:18:18,598 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-29 01:18:18,598 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr6ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION]=== [2020-07-29 01:18:18,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:18:18,598 INFO L82 PathProgramCache]: Analyzing trace with hash 1334976847, now seen corresponding path program 1 times [2020-07-29 01:18:18,598 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:18:18,599 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103471210] [2020-07-29 01:18:18,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:18:18,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:18:18,715 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-07-29 01:18:18,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:18:18,720 INFO L280 TraceCheckUtils]: 0: Hoare triple {1068#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1059#true} is VALID [2020-07-29 01:18:18,721 INFO L280 TraceCheckUtils]: 1: Hoare triple {1059#true} assume true; {1059#true} is VALID [2020-07-29 01:18:18,721 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1059#true} {1059#true} #52#return; {1059#true} is VALID [2020-07-29 01:18:18,722 INFO L263 TraceCheckUtils]: 0: Hoare triple {1059#true} call ULTIMATE.init(); {1068#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-29 01:18:18,722 INFO L280 TraceCheckUtils]: 1: Hoare triple {1068#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1059#true} is VALID [2020-07-29 01:18:18,723 INFO L280 TraceCheckUtils]: 2: Hoare triple {1059#true} assume true; {1059#true} is VALID [2020-07-29 01:18:18,723 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1059#true} {1059#true} #52#return; {1059#true} is VALID [2020-07-29 01:18:18,723 INFO L263 TraceCheckUtils]: 4: Hoare triple {1059#true} call #t~ret6 := main(); {1059#true} is VALID [2020-07-29 01:18:18,724 INFO L280 TraceCheckUtils]: 5: Hoare triple {1059#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~i~0 := #t~nondet0;havoc #t~nondet0;call ~#a~0.base, ~#a~0.offset := #Ultimate.allocOnStack(40);~n~0 := 0; {1064#(= 0 main_~n~0)} is VALID [2020-07-29 01:18:18,725 INFO L280 TraceCheckUtils]: 6: Hoare triple {1064#(= 0 main_~n~0)} assume !!(~n~0 < 10);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {1064#(= 0 main_~n~0)} is VALID [2020-07-29 01:18:18,726 INFO L280 TraceCheckUtils]: 7: Hoare triple {1064#(= 0 main_~n~0)} SUMMARY for call write~int(#t~nondet2, ~#a~0.base, ~#a~0.offset + 4 * ~n~0, 4); srcloc: L14 {1064#(= 0 main_~n~0)} is VALID [2020-07-29 01:18:18,727 INFO L280 TraceCheckUtils]: 8: Hoare triple {1064#(= 0 main_~n~0)} havoc #t~nondet2; {1064#(= 0 main_~n~0)} is VALID [2020-07-29 01:18:18,728 INFO L280 TraceCheckUtils]: 9: Hoare triple {1064#(= 0 main_~n~0)} #t~pre1 := 1 + ~n~0;~n~0 := 1 + ~n~0;havoc #t~pre1; {1065#(<= main_~n~0 1)} is VALID [2020-07-29 01:18:18,729 INFO L280 TraceCheckUtils]: 10: Hoare triple {1065#(<= main_~n~0 1)} assume !!(~n~0 < 10);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {1065#(<= main_~n~0 1)} is VALID [2020-07-29 01:18:18,730 INFO L280 TraceCheckUtils]: 11: Hoare triple {1065#(<= main_~n~0 1)} SUMMARY for call write~int(#t~nondet2, ~#a~0.base, ~#a~0.offset + 4 * ~n~0, 4); srcloc: L14 {1065#(<= main_~n~0 1)} is VALID [2020-07-29 01:18:18,731 INFO L280 TraceCheckUtils]: 12: Hoare triple {1065#(<= main_~n~0 1)} havoc #t~nondet2; {1065#(<= main_~n~0 1)} is VALID [2020-07-29 01:18:18,732 INFO L280 TraceCheckUtils]: 13: Hoare triple {1065#(<= main_~n~0 1)} #t~pre1 := 1 + ~n~0;~n~0 := 1 + ~n~0;havoc #t~pre1; {1066#(<= main_~n~0 2)} is VALID [2020-07-29 01:18:18,733 INFO L280 TraceCheckUtils]: 14: Hoare triple {1066#(<= main_~n~0 2)} assume !!(~n~0 < 10);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {1066#(<= main_~n~0 2)} is VALID [2020-07-29 01:18:18,734 INFO L280 TraceCheckUtils]: 15: Hoare triple {1066#(<= main_~n~0 2)} SUMMARY for call write~int(#t~nondet2, ~#a~0.base, ~#a~0.offset + 4 * ~n~0, 4); srcloc: L14 {1066#(<= main_~n~0 2)} is VALID [2020-07-29 01:18:18,735 INFO L280 TraceCheckUtils]: 16: Hoare triple {1066#(<= main_~n~0 2)} havoc #t~nondet2; {1066#(<= main_~n~0 2)} is VALID [2020-07-29 01:18:18,737 INFO L280 TraceCheckUtils]: 17: Hoare triple {1066#(<= main_~n~0 2)} #t~pre1 := 1 + ~n~0;~n~0 := 1 + ~n~0;havoc #t~pre1; {1067#(<= main_~n~0 3)} is VALID [2020-07-29 01:18:18,738 INFO L280 TraceCheckUtils]: 18: Hoare triple {1067#(<= main_~n~0 3)} assume !(~n~0 < 10); {1060#false} is VALID [2020-07-29 01:18:18,739 INFO L280 TraceCheckUtils]: 19: Hoare triple {1060#false} #t~short4 := 0 <= ~i~0 && ~i~0 < 10; {1060#false} is VALID [2020-07-29 01:18:18,739 INFO L280 TraceCheckUtils]: 20: Hoare triple {1060#false} assume !#t~short4; {1060#false} is VALID [2020-07-29 01:18:18,739 INFO L280 TraceCheckUtils]: 21: Hoare triple {1060#false} assume !#t~short4;havoc #t~mem3;havoc #t~short4; {1060#false} is VALID [2020-07-29 01:18:18,740 INFO L280 TraceCheckUtils]: 22: Hoare triple {1060#false} #res := 0;call ULTIMATE.dealloc(~#a~0.base, ~#a~0.offset);havoc ~#a~0.base, ~#a~0.offset; {1060#false} is VALID [2020-07-29 01:18:18,740 INFO L280 TraceCheckUtils]: 23: Hoare triple {1060#false} assume !(#valid == old(#valid)); {1060#false} is VALID [2020-07-29 01:18:18,741 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:18:18,741 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103471210] [2020-07-29 01:18:18,741 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [66252184] [2020-07-29 01:18:18,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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:18:18,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:18:18,775 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-29 01:18:18,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:18:18,784 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:18:18,897 INFO L263 TraceCheckUtils]: 0: Hoare triple {1059#true} call ULTIMATE.init(); {1059#true} is VALID [2020-07-29 01:18:18,897 INFO L280 TraceCheckUtils]: 1: Hoare triple {1059#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1059#true} is VALID [2020-07-29 01:18:18,898 INFO L280 TraceCheckUtils]: 2: Hoare triple {1059#true} assume true; {1059#true} is VALID [2020-07-29 01:18:18,898 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1059#true} {1059#true} #52#return; {1059#true} is VALID [2020-07-29 01:18:18,898 INFO L263 TraceCheckUtils]: 4: Hoare triple {1059#true} call #t~ret6 := main(); {1059#true} is VALID [2020-07-29 01:18:18,900 INFO L280 TraceCheckUtils]: 5: Hoare triple {1059#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~i~0 := #t~nondet0;havoc #t~nondet0;call ~#a~0.base, ~#a~0.offset := #Ultimate.allocOnStack(40);~n~0 := 0; {1087#(<= main_~n~0 0)} is VALID [2020-07-29 01:18:18,900 INFO L280 TraceCheckUtils]: 6: Hoare triple {1087#(<= main_~n~0 0)} assume !!(~n~0 < 10);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {1087#(<= main_~n~0 0)} is VALID [2020-07-29 01:18:18,901 INFO L280 TraceCheckUtils]: 7: Hoare triple {1087#(<= main_~n~0 0)} SUMMARY for call write~int(#t~nondet2, ~#a~0.base, ~#a~0.offset + 4 * ~n~0, 4); srcloc: L14 {1087#(<= main_~n~0 0)} is VALID [2020-07-29 01:18:18,902 INFO L280 TraceCheckUtils]: 8: Hoare triple {1087#(<= main_~n~0 0)} havoc #t~nondet2; {1087#(<= main_~n~0 0)} is VALID [2020-07-29 01:18:18,903 INFO L280 TraceCheckUtils]: 9: Hoare triple {1087#(<= main_~n~0 0)} #t~pre1 := 1 + ~n~0;~n~0 := 1 + ~n~0;havoc #t~pre1; {1065#(<= main_~n~0 1)} is VALID [2020-07-29 01:18:18,903 INFO L280 TraceCheckUtils]: 10: Hoare triple {1065#(<= main_~n~0 1)} assume !!(~n~0 < 10);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {1065#(<= main_~n~0 1)} is VALID [2020-07-29 01:18:18,904 INFO L280 TraceCheckUtils]: 11: Hoare triple {1065#(<= main_~n~0 1)} SUMMARY for call write~int(#t~nondet2, ~#a~0.base, ~#a~0.offset + 4 * ~n~0, 4); srcloc: L14 {1065#(<= main_~n~0 1)} is VALID [2020-07-29 01:18:18,905 INFO L280 TraceCheckUtils]: 12: Hoare triple {1065#(<= main_~n~0 1)} havoc #t~nondet2; {1065#(<= main_~n~0 1)} is VALID [2020-07-29 01:18:18,907 INFO L280 TraceCheckUtils]: 13: Hoare triple {1065#(<= main_~n~0 1)} #t~pre1 := 1 + ~n~0;~n~0 := 1 + ~n~0;havoc #t~pre1; {1066#(<= main_~n~0 2)} is VALID [2020-07-29 01:18:18,908 INFO L280 TraceCheckUtils]: 14: Hoare triple {1066#(<= main_~n~0 2)} assume !!(~n~0 < 10);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {1066#(<= main_~n~0 2)} is VALID [2020-07-29 01:18:18,908 INFO L280 TraceCheckUtils]: 15: Hoare triple {1066#(<= main_~n~0 2)} SUMMARY for call write~int(#t~nondet2, ~#a~0.base, ~#a~0.offset + 4 * ~n~0, 4); srcloc: L14 {1066#(<= main_~n~0 2)} is VALID [2020-07-29 01:18:18,908 INFO L280 TraceCheckUtils]: 16: Hoare triple {1066#(<= main_~n~0 2)} havoc #t~nondet2; {1066#(<= main_~n~0 2)} is VALID [2020-07-29 01:18:18,909 INFO L280 TraceCheckUtils]: 17: Hoare triple {1066#(<= main_~n~0 2)} #t~pre1 := 1 + ~n~0;~n~0 := 1 + ~n~0;havoc #t~pre1; {1067#(<= main_~n~0 3)} is VALID [2020-07-29 01:18:18,910 INFO L280 TraceCheckUtils]: 18: Hoare triple {1067#(<= main_~n~0 3)} assume !(~n~0 < 10); {1060#false} is VALID [2020-07-29 01:18:18,911 INFO L280 TraceCheckUtils]: 19: Hoare triple {1060#false} #t~short4 := 0 <= ~i~0 && ~i~0 < 10; {1060#false} is VALID [2020-07-29 01:18:18,911 INFO L280 TraceCheckUtils]: 20: Hoare triple {1060#false} assume !#t~short4; {1060#false} is VALID [2020-07-29 01:18:18,911 INFO L280 TraceCheckUtils]: 21: Hoare triple {1060#false} assume !#t~short4;havoc #t~mem3;havoc #t~short4; {1060#false} is VALID [2020-07-29 01:18:18,911 INFO L280 TraceCheckUtils]: 22: Hoare triple {1060#false} #res := 0;call ULTIMATE.dealloc(~#a~0.base, ~#a~0.offset);havoc ~#a~0.base, ~#a~0.offset; {1060#false} is VALID [2020-07-29 01:18:18,911 INFO L280 TraceCheckUtils]: 23: Hoare triple {1060#false} assume !(#valid == old(#valid)); {1060#false} is VALID [2020-07-29 01:18:18,913 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:18:18,913 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-29 01:18:18,913 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 8 [2020-07-29 01:18:18,913 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908997602] [2020-07-29 01:18:18,914 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 24 [2020-07-29 01:18:18,914 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:18:18,915 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-29 01:18:18,951 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:18:18,951 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-29 01:18:18,951 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:18:18,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-29 01:18:18,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-07-29 01:18:18,952 INFO L87 Difference]: Start difference. First operand 30 states and 32 transitions. Second operand 8 states. [2020-07-29 01:18:19,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:18:19,131 INFO L93 Difference]: Finished difference Result 37 states and 39 transitions. [2020-07-29 01:18:19,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-29 01:18:19,131 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 24 [2020-07-29 01:18:19,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:18:19,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-29 01:18:19,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 39 transitions. [2020-07-29 01:18:19,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-29 01:18:19,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 39 transitions. [2020-07-29 01:18:19,136 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 39 transitions. [2020-07-29 01:18:19,193 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:18:19,195 INFO L225 Difference]: With dead ends: 37 [2020-07-29 01:18:19,195 INFO L226 Difference]: Without dead ends: 37 [2020-07-29 01:18:19,196 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-07-29 01:18:19,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2020-07-29 01:18:19,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 34. [2020-07-29 01:18:19,199 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:18:19,199 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand 34 states. [2020-07-29 01:18:19,199 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 34 states. [2020-07-29 01:18:19,199 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 34 states. [2020-07-29 01:18:19,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:18:19,201 INFO L93 Difference]: Finished difference Result 37 states and 39 transitions. [2020-07-29 01:18:19,201 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2020-07-29 01:18:19,202 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:18:19,202 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:18:19,202 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 37 states. [2020-07-29 01:18:19,202 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 37 states. [2020-07-29 01:18:19,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:18:19,204 INFO L93 Difference]: Finished difference Result 37 states and 39 transitions. [2020-07-29 01:18:19,204 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2020-07-29 01:18:19,205 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:18:19,205 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:18:19,205 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:18:19,205 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:18:19,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2020-07-29 01:18:19,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 36 transitions. [2020-07-29 01:18:19,208 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 36 transitions. Word has length 24 [2020-07-29 01:18:19,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:18:19,208 INFO L479 AbstractCegarLoop]: Abstraction has 34 states and 36 transitions. [2020-07-29 01:18:19,208 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-29 01:18:19,208 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 36 transitions. [2020-07-29 01:18:19,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-07-29 01:18:19,209 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:18:19,210 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:18:19,410 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-29 01:18:19,411 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr6ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION]=== [2020-07-29 01:18:19,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:18:19,412 INFO L82 PathProgramCache]: Analyzing trace with hash 1360643474, now seen corresponding path program 2 times [2020-07-29 01:18:19,412 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:18:19,412 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096842417] [2020-07-29 01:18:19,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:18:19,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:18:19,500 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-07-29 01:18:19,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:18:19,505 INFO L280 TraceCheckUtils]: 0: Hoare triple {1296#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1286#true} is VALID [2020-07-29 01:18:19,506 INFO L280 TraceCheckUtils]: 1: Hoare triple {1286#true} assume true; {1286#true} is VALID [2020-07-29 01:18:19,506 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1286#true} {1286#true} #52#return; {1286#true} is VALID [2020-07-29 01:18:19,507 INFO L263 TraceCheckUtils]: 0: Hoare triple {1286#true} call ULTIMATE.init(); {1296#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-29 01:18:19,507 INFO L280 TraceCheckUtils]: 1: Hoare triple {1296#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1286#true} is VALID [2020-07-29 01:18:19,507 INFO L280 TraceCheckUtils]: 2: Hoare triple {1286#true} assume true; {1286#true} is VALID [2020-07-29 01:18:19,507 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1286#true} {1286#true} #52#return; {1286#true} is VALID [2020-07-29 01:18:19,507 INFO L263 TraceCheckUtils]: 4: Hoare triple {1286#true} call #t~ret6 := main(); {1286#true} is VALID [2020-07-29 01:18:19,508 INFO L280 TraceCheckUtils]: 5: Hoare triple {1286#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~i~0 := #t~nondet0;havoc #t~nondet0;call ~#a~0.base, ~#a~0.offset := #Ultimate.allocOnStack(40);~n~0 := 0; {1291#(= 0 main_~n~0)} is VALID [2020-07-29 01:18:19,508 INFO L280 TraceCheckUtils]: 6: Hoare triple {1291#(= 0 main_~n~0)} assume !!(~n~0 < 10);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {1291#(= 0 main_~n~0)} is VALID [2020-07-29 01:18:19,509 INFO L280 TraceCheckUtils]: 7: Hoare triple {1291#(= 0 main_~n~0)} SUMMARY for call write~int(#t~nondet2, ~#a~0.base, ~#a~0.offset + 4 * ~n~0, 4); srcloc: L14 {1291#(= 0 main_~n~0)} is VALID [2020-07-29 01:18:19,509 INFO L280 TraceCheckUtils]: 8: Hoare triple {1291#(= 0 main_~n~0)} havoc #t~nondet2; {1291#(= 0 main_~n~0)} is VALID [2020-07-29 01:18:19,510 INFO L280 TraceCheckUtils]: 9: Hoare triple {1291#(= 0 main_~n~0)} #t~pre1 := 1 + ~n~0;~n~0 := 1 + ~n~0;havoc #t~pre1; {1292#(<= main_~n~0 1)} is VALID [2020-07-29 01:18:19,510 INFO L280 TraceCheckUtils]: 10: Hoare triple {1292#(<= main_~n~0 1)} assume !!(~n~0 < 10);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {1292#(<= main_~n~0 1)} is VALID [2020-07-29 01:18:19,511 INFO L280 TraceCheckUtils]: 11: Hoare triple {1292#(<= main_~n~0 1)} SUMMARY for call write~int(#t~nondet2, ~#a~0.base, ~#a~0.offset + 4 * ~n~0, 4); srcloc: L14 {1292#(<= main_~n~0 1)} is VALID [2020-07-29 01:18:19,511 INFO L280 TraceCheckUtils]: 12: Hoare triple {1292#(<= main_~n~0 1)} havoc #t~nondet2; {1292#(<= main_~n~0 1)} is VALID [2020-07-29 01:18:19,512 INFO L280 TraceCheckUtils]: 13: Hoare triple {1292#(<= main_~n~0 1)} #t~pre1 := 1 + ~n~0;~n~0 := 1 + ~n~0;havoc #t~pre1; {1293#(<= main_~n~0 2)} is VALID [2020-07-29 01:18:19,512 INFO L280 TraceCheckUtils]: 14: Hoare triple {1293#(<= main_~n~0 2)} assume !!(~n~0 < 10);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {1293#(<= main_~n~0 2)} is VALID [2020-07-29 01:18:19,513 INFO L280 TraceCheckUtils]: 15: Hoare triple {1293#(<= main_~n~0 2)} SUMMARY for call write~int(#t~nondet2, ~#a~0.base, ~#a~0.offset + 4 * ~n~0, 4); srcloc: L14 {1293#(<= main_~n~0 2)} is VALID [2020-07-29 01:18:19,514 INFO L280 TraceCheckUtils]: 16: Hoare triple {1293#(<= main_~n~0 2)} havoc #t~nondet2; {1293#(<= main_~n~0 2)} is VALID [2020-07-29 01:18:19,514 INFO L280 TraceCheckUtils]: 17: Hoare triple {1293#(<= main_~n~0 2)} #t~pre1 := 1 + ~n~0;~n~0 := 1 + ~n~0;havoc #t~pre1; {1294#(<= main_~n~0 3)} is VALID [2020-07-29 01:18:19,515 INFO L280 TraceCheckUtils]: 18: Hoare triple {1294#(<= main_~n~0 3)} assume !!(~n~0 < 10);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {1294#(<= main_~n~0 3)} is VALID [2020-07-29 01:18:19,515 INFO L280 TraceCheckUtils]: 19: Hoare triple {1294#(<= main_~n~0 3)} SUMMARY for call write~int(#t~nondet2, ~#a~0.base, ~#a~0.offset + 4 * ~n~0, 4); srcloc: L14 {1294#(<= main_~n~0 3)} is VALID [2020-07-29 01:18:19,516 INFO L280 TraceCheckUtils]: 20: Hoare triple {1294#(<= main_~n~0 3)} havoc #t~nondet2; {1294#(<= main_~n~0 3)} is VALID [2020-07-29 01:18:19,516 INFO L280 TraceCheckUtils]: 21: Hoare triple {1294#(<= main_~n~0 3)} #t~pre1 := 1 + ~n~0;~n~0 := 1 + ~n~0;havoc #t~pre1; {1295#(<= main_~n~0 4)} is VALID [2020-07-29 01:18:19,517 INFO L280 TraceCheckUtils]: 22: Hoare triple {1295#(<= main_~n~0 4)} assume !(~n~0 < 10); {1287#false} is VALID [2020-07-29 01:18:19,517 INFO L280 TraceCheckUtils]: 23: Hoare triple {1287#false} #t~short4 := 0 <= ~i~0 && ~i~0 < 10; {1287#false} is VALID [2020-07-29 01:18:19,518 INFO L280 TraceCheckUtils]: 24: Hoare triple {1287#false} assume !#t~short4; {1287#false} is VALID [2020-07-29 01:18:19,518 INFO L280 TraceCheckUtils]: 25: Hoare triple {1287#false} assume !#t~short4;havoc #t~mem3;havoc #t~short4; {1287#false} is VALID [2020-07-29 01:18:19,518 INFO L280 TraceCheckUtils]: 26: Hoare triple {1287#false} #res := 0;call ULTIMATE.dealloc(~#a~0.base, ~#a~0.offset);havoc ~#a~0.base, ~#a~0.offset; {1287#false} is VALID [2020-07-29 01:18:19,518 INFO L280 TraceCheckUtils]: 27: Hoare triple {1287#false} assume !(#valid == old(#valid)); {1287#false} is VALID [2020-07-29 01:18:19,520 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:18:19,520 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096842417] [2020-07-29 01:18:19,520 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1495673094] [2020-07-29 01:18:19,520 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 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:18:19,550 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2020-07-29 01:18:19,551 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-29 01:18:19,552 INFO L263 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-29 01:18:19,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:18:19,576 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:18:19,701 INFO L263 TraceCheckUtils]: 0: Hoare triple {1286#true} call ULTIMATE.init(); {1286#true} is VALID [2020-07-29 01:18:19,701 INFO L280 TraceCheckUtils]: 1: Hoare triple {1286#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1286#true} is VALID [2020-07-29 01:18:19,702 INFO L280 TraceCheckUtils]: 2: Hoare triple {1286#true} assume true; {1286#true} is VALID [2020-07-29 01:18:19,702 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1286#true} {1286#true} #52#return; {1286#true} is VALID [2020-07-29 01:18:19,703 INFO L263 TraceCheckUtils]: 4: Hoare triple {1286#true} call #t~ret6 := main(); {1312#(= |#valid| |old(#valid)|)} is VALID [2020-07-29 01:18:19,704 INFO L280 TraceCheckUtils]: 5: Hoare triple {1312#(= |#valid| |old(#valid)|)} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~i~0 := #t~nondet0;havoc #t~nondet0;call ~#a~0.base, ~#a~0.offset := #Ultimate.allocOnStack(40);~n~0 := 0; {1316#(and (= 0 (select |old(#valid)| |main_~#a~0.base|)) (= |#valid| (store |old(#valid)| |main_~#a~0.base| 1)))} is VALID [2020-07-29 01:18:19,705 INFO L280 TraceCheckUtils]: 6: Hoare triple {1316#(and (= 0 (select |old(#valid)| |main_~#a~0.base|)) (= |#valid| (store |old(#valid)| |main_~#a~0.base| 1)))} assume !!(~n~0 < 10);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {1316#(and (= 0 (select |old(#valid)| |main_~#a~0.base|)) (= |#valid| (store |old(#valid)| |main_~#a~0.base| 1)))} is VALID [2020-07-29 01:18:19,706 INFO L280 TraceCheckUtils]: 7: Hoare triple {1316#(and (= 0 (select |old(#valid)| |main_~#a~0.base|)) (= |#valid| (store |old(#valid)| |main_~#a~0.base| 1)))} SUMMARY for call write~int(#t~nondet2, ~#a~0.base, ~#a~0.offset + 4 * ~n~0, 4); srcloc: L14 {1316#(and (= 0 (select |old(#valid)| |main_~#a~0.base|)) (= |#valid| (store |old(#valid)| |main_~#a~0.base| 1)))} is VALID [2020-07-29 01:18:19,708 INFO L280 TraceCheckUtils]: 8: Hoare triple {1316#(and (= 0 (select |old(#valid)| |main_~#a~0.base|)) (= |#valid| (store |old(#valid)| |main_~#a~0.base| 1)))} havoc #t~nondet2; {1316#(and (= 0 (select |old(#valid)| |main_~#a~0.base|)) (= |#valid| (store |old(#valid)| |main_~#a~0.base| 1)))} is VALID [2020-07-29 01:18:19,709 INFO L280 TraceCheckUtils]: 9: Hoare triple {1316#(and (= 0 (select |old(#valid)| |main_~#a~0.base|)) (= |#valid| (store |old(#valid)| |main_~#a~0.base| 1)))} #t~pre1 := 1 + ~n~0;~n~0 := 1 + ~n~0;havoc #t~pre1; {1316#(and (= 0 (select |old(#valid)| |main_~#a~0.base|)) (= |#valid| (store |old(#valid)| |main_~#a~0.base| 1)))} is VALID [2020-07-29 01:18:19,710 INFO L280 TraceCheckUtils]: 10: Hoare triple {1316#(and (= 0 (select |old(#valid)| |main_~#a~0.base|)) (= |#valid| (store |old(#valid)| |main_~#a~0.base| 1)))} assume !!(~n~0 < 10);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {1316#(and (= 0 (select |old(#valid)| |main_~#a~0.base|)) (= |#valid| (store |old(#valid)| |main_~#a~0.base| 1)))} is VALID [2020-07-29 01:18:19,711 INFO L280 TraceCheckUtils]: 11: Hoare triple {1316#(and (= 0 (select |old(#valid)| |main_~#a~0.base|)) (= |#valid| (store |old(#valid)| |main_~#a~0.base| 1)))} SUMMARY for call write~int(#t~nondet2, ~#a~0.base, ~#a~0.offset + 4 * ~n~0, 4); srcloc: L14 {1316#(and (= 0 (select |old(#valid)| |main_~#a~0.base|)) (= |#valid| (store |old(#valid)| |main_~#a~0.base| 1)))} is VALID [2020-07-29 01:18:19,712 INFO L280 TraceCheckUtils]: 12: Hoare triple {1316#(and (= 0 (select |old(#valid)| |main_~#a~0.base|)) (= |#valid| (store |old(#valid)| |main_~#a~0.base| 1)))} havoc #t~nondet2; {1316#(and (= 0 (select |old(#valid)| |main_~#a~0.base|)) (= |#valid| (store |old(#valid)| |main_~#a~0.base| 1)))} is VALID [2020-07-29 01:18:19,713 INFO L280 TraceCheckUtils]: 13: Hoare triple {1316#(and (= 0 (select |old(#valid)| |main_~#a~0.base|)) (= |#valid| (store |old(#valid)| |main_~#a~0.base| 1)))} #t~pre1 := 1 + ~n~0;~n~0 := 1 + ~n~0;havoc #t~pre1; {1316#(and (= 0 (select |old(#valid)| |main_~#a~0.base|)) (= |#valid| (store |old(#valid)| |main_~#a~0.base| 1)))} is VALID [2020-07-29 01:18:19,714 INFO L280 TraceCheckUtils]: 14: Hoare triple {1316#(and (= 0 (select |old(#valid)| |main_~#a~0.base|)) (= |#valid| (store |old(#valid)| |main_~#a~0.base| 1)))} assume !!(~n~0 < 10);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {1316#(and (= 0 (select |old(#valid)| |main_~#a~0.base|)) (= |#valid| (store |old(#valid)| |main_~#a~0.base| 1)))} is VALID [2020-07-29 01:18:19,715 INFO L280 TraceCheckUtils]: 15: Hoare triple {1316#(and (= 0 (select |old(#valid)| |main_~#a~0.base|)) (= |#valid| (store |old(#valid)| |main_~#a~0.base| 1)))} SUMMARY for call write~int(#t~nondet2, ~#a~0.base, ~#a~0.offset + 4 * ~n~0, 4); srcloc: L14 {1316#(and (= 0 (select |old(#valid)| |main_~#a~0.base|)) (= |#valid| (store |old(#valid)| |main_~#a~0.base| 1)))} is VALID [2020-07-29 01:18:19,716 INFO L280 TraceCheckUtils]: 16: Hoare triple {1316#(and (= 0 (select |old(#valid)| |main_~#a~0.base|)) (= |#valid| (store |old(#valid)| |main_~#a~0.base| 1)))} havoc #t~nondet2; {1316#(and (= 0 (select |old(#valid)| |main_~#a~0.base|)) (= |#valid| (store |old(#valid)| |main_~#a~0.base| 1)))} is VALID [2020-07-29 01:18:19,717 INFO L280 TraceCheckUtils]: 17: Hoare triple {1316#(and (= 0 (select |old(#valid)| |main_~#a~0.base|)) (= |#valid| (store |old(#valid)| |main_~#a~0.base| 1)))} #t~pre1 := 1 + ~n~0;~n~0 := 1 + ~n~0;havoc #t~pre1; {1316#(and (= 0 (select |old(#valid)| |main_~#a~0.base|)) (= |#valid| (store |old(#valid)| |main_~#a~0.base| 1)))} is VALID [2020-07-29 01:18:19,718 INFO L280 TraceCheckUtils]: 18: Hoare triple {1316#(and (= 0 (select |old(#valid)| |main_~#a~0.base|)) (= |#valid| (store |old(#valid)| |main_~#a~0.base| 1)))} assume !!(~n~0 < 10);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {1316#(and (= 0 (select |old(#valid)| |main_~#a~0.base|)) (= |#valid| (store |old(#valid)| |main_~#a~0.base| 1)))} is VALID [2020-07-29 01:18:19,719 INFO L280 TraceCheckUtils]: 19: Hoare triple {1316#(and (= 0 (select |old(#valid)| |main_~#a~0.base|)) (= |#valid| (store |old(#valid)| |main_~#a~0.base| 1)))} SUMMARY for call write~int(#t~nondet2, ~#a~0.base, ~#a~0.offset + 4 * ~n~0, 4); srcloc: L14 {1316#(and (= 0 (select |old(#valid)| |main_~#a~0.base|)) (= |#valid| (store |old(#valid)| |main_~#a~0.base| 1)))} is VALID [2020-07-29 01:18:19,720 INFO L280 TraceCheckUtils]: 20: Hoare triple {1316#(and (= 0 (select |old(#valid)| |main_~#a~0.base|)) (= |#valid| (store |old(#valid)| |main_~#a~0.base| 1)))} havoc #t~nondet2; {1316#(and (= 0 (select |old(#valid)| |main_~#a~0.base|)) (= |#valid| (store |old(#valid)| |main_~#a~0.base| 1)))} is VALID [2020-07-29 01:18:19,721 INFO L280 TraceCheckUtils]: 21: Hoare triple {1316#(and (= 0 (select |old(#valid)| |main_~#a~0.base|)) (= |#valid| (store |old(#valid)| |main_~#a~0.base| 1)))} #t~pre1 := 1 + ~n~0;~n~0 := 1 + ~n~0;havoc #t~pre1; {1316#(and (= 0 (select |old(#valid)| |main_~#a~0.base|)) (= |#valid| (store |old(#valid)| |main_~#a~0.base| 1)))} is VALID [2020-07-29 01:18:19,722 INFO L280 TraceCheckUtils]: 22: Hoare triple {1316#(and (= 0 (select |old(#valid)| |main_~#a~0.base|)) (= |#valid| (store |old(#valid)| |main_~#a~0.base| 1)))} assume !(~n~0 < 10); {1316#(and (= 0 (select |old(#valid)| |main_~#a~0.base|)) (= |#valid| (store |old(#valid)| |main_~#a~0.base| 1)))} is VALID [2020-07-29 01:18:19,723 INFO L280 TraceCheckUtils]: 23: Hoare triple {1316#(and (= 0 (select |old(#valid)| |main_~#a~0.base|)) (= |#valid| (store |old(#valid)| |main_~#a~0.base| 1)))} #t~short4 := 0 <= ~i~0 && ~i~0 < 10; {1316#(and (= 0 (select |old(#valid)| |main_~#a~0.base|)) (= |#valid| (store |old(#valid)| |main_~#a~0.base| 1)))} is VALID [2020-07-29 01:18:19,724 INFO L280 TraceCheckUtils]: 24: Hoare triple {1316#(and (= 0 (select |old(#valid)| |main_~#a~0.base|)) (= |#valid| (store |old(#valid)| |main_~#a~0.base| 1)))} assume !#t~short4; {1316#(and (= 0 (select |old(#valid)| |main_~#a~0.base|)) (= |#valid| (store |old(#valid)| |main_~#a~0.base| 1)))} is VALID [2020-07-29 01:18:19,725 INFO L280 TraceCheckUtils]: 25: Hoare triple {1316#(and (= 0 (select |old(#valid)| |main_~#a~0.base|)) (= |#valid| (store |old(#valid)| |main_~#a~0.base| 1)))} assume !#t~short4;havoc #t~mem3;havoc #t~short4; {1316#(and (= 0 (select |old(#valid)| |main_~#a~0.base|)) (= |#valid| (store |old(#valid)| |main_~#a~0.base| 1)))} is VALID [2020-07-29 01:18:19,727 INFO L280 TraceCheckUtils]: 26: Hoare triple {1316#(and (= 0 (select |old(#valid)| |main_~#a~0.base|)) (= |#valid| (store |old(#valid)| |main_~#a~0.base| 1)))} #res := 0;call ULTIMATE.dealloc(~#a~0.base, ~#a~0.offset);havoc ~#a~0.base, ~#a~0.offset; {1380#(exists ((|v_main_~#a~0.base_13| Int)) (and (= 0 (select |old(#valid)| |v_main_~#a~0.base_13|)) (= |#valid| (store |old(#valid)| |v_main_~#a~0.base_13| 0))))} is VALID [2020-07-29 01:18:19,728 INFO L280 TraceCheckUtils]: 27: Hoare triple {1380#(exists ((|v_main_~#a~0.base_13| Int)) (and (= 0 (select |old(#valid)| |v_main_~#a~0.base_13|)) (= |#valid| (store |old(#valid)| |v_main_~#a~0.base_13| 0))))} assume !(#valid == old(#valid)); {1287#false} is VALID [2020-07-29 01:18:19,733 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2020-07-29 01:18:19,734 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-29 01:18:19,734 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 11 [2020-07-29 01:18:19,735 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809971752] [2020-07-29 01:18:19,735 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2020-07-29 01:18:19,736 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:18:19,736 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-29 01:18:19,756 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:18:19,756 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-29 01:18:19,757 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:18:19,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-29 01:18:19,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2020-07-29 01:18:19,757 INFO L87 Difference]: Start difference. First operand 34 states and 36 transitions. Second operand 5 states. [2020-07-29 01:18:19,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:18:19,836 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2020-07-29 01:18:19,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-29 01:18:19,836 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2020-07-29 01:18:19,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:18:19,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-29 01:18:19,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 22 transitions. [2020-07-29 01:18:19,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-29 01:18:19,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 22 transitions. [2020-07-29 01:18:19,839 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 22 transitions. [2020-07-29 01:18:19,870 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:18:19,871 INFO L225 Difference]: With dead ends: 33 [2020-07-29 01:18:19,871 INFO L226 Difference]: Without dead ends: 30 [2020-07-29 01:18:19,872 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2020-07-29 01:18:19,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2020-07-29 01:18:19,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2020-07-29 01:18:19,875 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:18:19,875 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand 30 states. [2020-07-29 01:18:19,876 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 30 states. [2020-07-29 01:18:19,876 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 30 states. [2020-07-29 01:18:19,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:18:19,878 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2020-07-29 01:18:19,878 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2020-07-29 01:18:19,879 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:18:19,879 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:18:19,879 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 30 states. [2020-07-29 01:18:19,879 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 30 states. [2020-07-29 01:18:19,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:18:19,881 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2020-07-29 01:18:19,881 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2020-07-29 01:18:19,882 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:18:19,882 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:18:19,882 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:18:19,882 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:18:19,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-07-29 01:18:19,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2020-07-29 01:18:19,884 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 28 [2020-07-29 01:18:19,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:18:19,885 INFO L479 AbstractCegarLoop]: Abstraction has 30 states and 31 transitions. [2020-07-29 01:18:19,885 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-29 01:18:19,885 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2020-07-29 01:18:19,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-07-29 01:18:19,886 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:18:19,886 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:18:20,096 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-29 01:18:20,097 INFO L427 AbstractCegarLoop]: === Iteration 10 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr6ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION]=== [2020-07-29 01:18:20,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:18:20,097 INFO L82 PathProgramCache]: Analyzing trace with hash -775549161, now seen corresponding path program 1 times [2020-07-29 01:18:20,098 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:18:20,098 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660883522] [2020-07-29 01:18:20,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:18:20,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:18:20,192 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-07-29 01:18:20,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:18:20,196 INFO L280 TraceCheckUtils]: 0: Hoare triple {1516#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1506#true} is VALID [2020-07-29 01:18:20,196 INFO L280 TraceCheckUtils]: 1: Hoare triple {1506#true} assume true; {1506#true} is VALID [2020-07-29 01:18:20,197 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1506#true} {1506#true} #52#return; {1506#true} is VALID [2020-07-29 01:18:20,200 INFO L263 TraceCheckUtils]: 0: Hoare triple {1506#true} call ULTIMATE.init(); {1516#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-29 01:18:20,200 INFO L280 TraceCheckUtils]: 1: Hoare triple {1516#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1506#true} is VALID [2020-07-29 01:18:20,201 INFO L280 TraceCheckUtils]: 2: Hoare triple {1506#true} assume true; {1506#true} is VALID [2020-07-29 01:18:20,201 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1506#true} {1506#true} #52#return; {1506#true} is VALID [2020-07-29 01:18:20,201 INFO L263 TraceCheckUtils]: 4: Hoare triple {1506#true} call #t~ret6 := main(); {1506#true} is VALID [2020-07-29 01:18:20,202 INFO L280 TraceCheckUtils]: 5: Hoare triple {1506#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~i~0 := #t~nondet0;havoc #t~nondet0;call ~#a~0.base, ~#a~0.offset := #Ultimate.allocOnStack(40);~n~0 := 0; {1511#(= 0 main_~n~0)} is VALID [2020-07-29 01:18:20,202 INFO L280 TraceCheckUtils]: 6: Hoare triple {1511#(= 0 main_~n~0)} assume !!(~n~0 < 10);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {1511#(= 0 main_~n~0)} is VALID [2020-07-29 01:18:20,203 INFO L280 TraceCheckUtils]: 7: Hoare triple {1511#(= 0 main_~n~0)} SUMMARY for call write~int(#t~nondet2, ~#a~0.base, ~#a~0.offset + 4 * ~n~0, 4); srcloc: L14 {1511#(= 0 main_~n~0)} is VALID [2020-07-29 01:18:20,203 INFO L280 TraceCheckUtils]: 8: Hoare triple {1511#(= 0 main_~n~0)} havoc #t~nondet2; {1511#(= 0 main_~n~0)} is VALID [2020-07-29 01:18:20,204 INFO L280 TraceCheckUtils]: 9: Hoare triple {1511#(= 0 main_~n~0)} #t~pre1 := 1 + ~n~0;~n~0 := 1 + ~n~0;havoc #t~pre1; {1512#(<= main_~n~0 1)} is VALID [2020-07-29 01:18:20,204 INFO L280 TraceCheckUtils]: 10: Hoare triple {1512#(<= main_~n~0 1)} assume !!(~n~0 < 10);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {1512#(<= main_~n~0 1)} is VALID [2020-07-29 01:18:20,205 INFO L280 TraceCheckUtils]: 11: Hoare triple {1512#(<= main_~n~0 1)} SUMMARY for call write~int(#t~nondet2, ~#a~0.base, ~#a~0.offset + 4 * ~n~0, 4); srcloc: L14 {1512#(<= main_~n~0 1)} is VALID [2020-07-29 01:18:20,205 INFO L280 TraceCheckUtils]: 12: Hoare triple {1512#(<= main_~n~0 1)} havoc #t~nondet2; {1512#(<= main_~n~0 1)} is VALID [2020-07-29 01:18:20,206 INFO L280 TraceCheckUtils]: 13: Hoare triple {1512#(<= main_~n~0 1)} #t~pre1 := 1 + ~n~0;~n~0 := 1 + ~n~0;havoc #t~pre1; {1513#(<= main_~n~0 2)} is VALID [2020-07-29 01:18:20,208 INFO L280 TraceCheckUtils]: 14: Hoare triple {1513#(<= main_~n~0 2)} assume !!(~n~0 < 10);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {1513#(<= main_~n~0 2)} is VALID [2020-07-29 01:18:20,208 INFO L280 TraceCheckUtils]: 15: Hoare triple {1513#(<= main_~n~0 2)} SUMMARY for call write~int(#t~nondet2, ~#a~0.base, ~#a~0.offset + 4 * ~n~0, 4); srcloc: L14 {1513#(<= main_~n~0 2)} is VALID [2020-07-29 01:18:20,209 INFO L280 TraceCheckUtils]: 16: Hoare triple {1513#(<= main_~n~0 2)} havoc #t~nondet2; {1513#(<= main_~n~0 2)} is VALID [2020-07-29 01:18:20,214 INFO L280 TraceCheckUtils]: 17: Hoare triple {1513#(<= main_~n~0 2)} #t~pre1 := 1 + ~n~0;~n~0 := 1 + ~n~0;havoc #t~pre1; {1514#(<= main_~n~0 3)} is VALID [2020-07-29 01:18:20,216 INFO L280 TraceCheckUtils]: 18: Hoare triple {1514#(<= main_~n~0 3)} assume !!(~n~0 < 10);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {1514#(<= main_~n~0 3)} is VALID [2020-07-29 01:18:20,216 INFO L280 TraceCheckUtils]: 19: Hoare triple {1514#(<= main_~n~0 3)} SUMMARY for call write~int(#t~nondet2, ~#a~0.base, ~#a~0.offset + 4 * ~n~0, 4); srcloc: L14 {1514#(<= main_~n~0 3)} is VALID [2020-07-29 01:18:20,217 INFO L280 TraceCheckUtils]: 20: Hoare triple {1514#(<= main_~n~0 3)} havoc #t~nondet2; {1514#(<= main_~n~0 3)} is VALID [2020-07-29 01:18:20,218 INFO L280 TraceCheckUtils]: 21: Hoare triple {1514#(<= main_~n~0 3)} #t~pre1 := 1 + ~n~0;~n~0 := 1 + ~n~0;havoc #t~pre1; {1515#(<= main_~n~0 4)} is VALID [2020-07-29 01:18:20,218 INFO L280 TraceCheckUtils]: 22: Hoare triple {1515#(<= main_~n~0 4)} assume !(~n~0 < 10); {1507#false} is VALID [2020-07-29 01:18:20,219 INFO L280 TraceCheckUtils]: 23: Hoare triple {1507#false} #t~short4 := 0 <= ~i~0 && ~i~0 < 10; {1507#false} is VALID [2020-07-29 01:18:20,219 INFO L280 TraceCheckUtils]: 24: Hoare triple {1507#false} assume #t~short4; {1507#false} is VALID [2020-07-29 01:18:20,219 INFO L280 TraceCheckUtils]: 25: Hoare triple {1507#false} SUMMARY for call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); srcloc: L17-1 {1507#false} is VALID [2020-07-29 01:18:20,219 INFO L280 TraceCheckUtils]: 26: Hoare triple {1507#false} #t~short4 := #t~mem3 >= 0; {1507#false} is VALID [2020-07-29 01:18:20,220 INFO L280 TraceCheckUtils]: 27: Hoare triple {1507#false} assume !!#t~short4;havoc #t~mem3;havoc #t~short4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~i~0 := #t~nondet5;havoc #t~nondet5; {1507#false} is VALID [2020-07-29 01:18:20,220 INFO L280 TraceCheckUtils]: 28: Hoare triple {1507#false} assume !(4 + (~#a~0.offset + 4 * ~i~0) <= #length[~#a~0.base] && 0 <= ~#a~0.offset + 4 * ~i~0); {1507#false} is VALID [2020-07-29 01:18:20,221 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:18:20,222 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660883522] [2020-07-29 01:18:20,222 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1170517319] [2020-07-29 01:18:20,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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:18:20,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:18:20,257 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-29 01:18:20,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:18:20,268 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:18:20,422 INFO L263 TraceCheckUtils]: 0: Hoare triple {1506#true} call ULTIMATE.init(); {1506#true} is VALID [2020-07-29 01:18:20,422 INFO L280 TraceCheckUtils]: 1: Hoare triple {1506#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1506#true} is VALID [2020-07-29 01:18:20,423 INFO L280 TraceCheckUtils]: 2: Hoare triple {1506#true} assume true; {1506#true} is VALID [2020-07-29 01:18:20,423 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1506#true} {1506#true} #52#return; {1506#true} is VALID [2020-07-29 01:18:20,423 INFO L263 TraceCheckUtils]: 4: Hoare triple {1506#true} call #t~ret6 := main(); {1506#true} is VALID [2020-07-29 01:18:20,424 INFO L280 TraceCheckUtils]: 5: Hoare triple {1506#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~i~0 := #t~nondet0;havoc #t~nondet0;call ~#a~0.base, ~#a~0.offset := #Ultimate.allocOnStack(40);~n~0 := 0; {1535#(<= main_~n~0 0)} is VALID [2020-07-29 01:18:20,425 INFO L280 TraceCheckUtils]: 6: Hoare triple {1535#(<= main_~n~0 0)} assume !!(~n~0 < 10);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {1535#(<= main_~n~0 0)} is VALID [2020-07-29 01:18:20,426 INFO L280 TraceCheckUtils]: 7: Hoare triple {1535#(<= main_~n~0 0)} SUMMARY for call write~int(#t~nondet2, ~#a~0.base, ~#a~0.offset + 4 * ~n~0, 4); srcloc: L14 {1535#(<= main_~n~0 0)} is VALID [2020-07-29 01:18:20,426 INFO L280 TraceCheckUtils]: 8: Hoare triple {1535#(<= main_~n~0 0)} havoc #t~nondet2; {1535#(<= main_~n~0 0)} is VALID [2020-07-29 01:18:20,427 INFO L280 TraceCheckUtils]: 9: Hoare triple {1535#(<= main_~n~0 0)} #t~pre1 := 1 + ~n~0;~n~0 := 1 + ~n~0;havoc #t~pre1; {1512#(<= main_~n~0 1)} is VALID [2020-07-29 01:18:20,427 INFO L280 TraceCheckUtils]: 10: Hoare triple {1512#(<= main_~n~0 1)} assume !!(~n~0 < 10);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {1512#(<= main_~n~0 1)} is VALID [2020-07-29 01:18:20,427 INFO L280 TraceCheckUtils]: 11: Hoare triple {1512#(<= main_~n~0 1)} SUMMARY for call write~int(#t~nondet2, ~#a~0.base, ~#a~0.offset + 4 * ~n~0, 4); srcloc: L14 {1512#(<= main_~n~0 1)} is VALID [2020-07-29 01:18:20,428 INFO L280 TraceCheckUtils]: 12: Hoare triple {1512#(<= main_~n~0 1)} havoc #t~nondet2; {1512#(<= main_~n~0 1)} is VALID [2020-07-29 01:18:20,429 INFO L280 TraceCheckUtils]: 13: Hoare triple {1512#(<= main_~n~0 1)} #t~pre1 := 1 + ~n~0;~n~0 := 1 + ~n~0;havoc #t~pre1; {1513#(<= main_~n~0 2)} is VALID [2020-07-29 01:18:20,429 INFO L280 TraceCheckUtils]: 14: Hoare triple {1513#(<= main_~n~0 2)} assume !!(~n~0 < 10);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {1513#(<= main_~n~0 2)} is VALID [2020-07-29 01:18:20,430 INFO L280 TraceCheckUtils]: 15: Hoare triple {1513#(<= main_~n~0 2)} SUMMARY for call write~int(#t~nondet2, ~#a~0.base, ~#a~0.offset + 4 * ~n~0, 4); srcloc: L14 {1513#(<= main_~n~0 2)} is VALID [2020-07-29 01:18:20,431 INFO L280 TraceCheckUtils]: 16: Hoare triple {1513#(<= main_~n~0 2)} havoc #t~nondet2; {1513#(<= main_~n~0 2)} is VALID [2020-07-29 01:18:20,431 INFO L280 TraceCheckUtils]: 17: Hoare triple {1513#(<= main_~n~0 2)} #t~pre1 := 1 + ~n~0;~n~0 := 1 + ~n~0;havoc #t~pre1; {1514#(<= main_~n~0 3)} is VALID [2020-07-29 01:18:20,432 INFO L280 TraceCheckUtils]: 18: Hoare triple {1514#(<= main_~n~0 3)} assume !!(~n~0 < 10);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {1514#(<= main_~n~0 3)} is VALID [2020-07-29 01:18:20,433 INFO L280 TraceCheckUtils]: 19: Hoare triple {1514#(<= main_~n~0 3)} SUMMARY for call write~int(#t~nondet2, ~#a~0.base, ~#a~0.offset + 4 * ~n~0, 4); srcloc: L14 {1514#(<= main_~n~0 3)} is VALID [2020-07-29 01:18:20,433 INFO L280 TraceCheckUtils]: 20: Hoare triple {1514#(<= main_~n~0 3)} havoc #t~nondet2; {1514#(<= main_~n~0 3)} is VALID [2020-07-29 01:18:20,434 INFO L280 TraceCheckUtils]: 21: Hoare triple {1514#(<= main_~n~0 3)} #t~pre1 := 1 + ~n~0;~n~0 := 1 + ~n~0;havoc #t~pre1; {1515#(<= main_~n~0 4)} is VALID [2020-07-29 01:18:20,434 INFO L280 TraceCheckUtils]: 22: Hoare triple {1515#(<= main_~n~0 4)} assume !(~n~0 < 10); {1507#false} is VALID [2020-07-29 01:18:20,435 INFO L280 TraceCheckUtils]: 23: Hoare triple {1507#false} #t~short4 := 0 <= ~i~0 && ~i~0 < 10; {1507#false} is VALID [2020-07-29 01:18:20,435 INFO L280 TraceCheckUtils]: 24: Hoare triple {1507#false} assume #t~short4; {1507#false} is VALID [2020-07-29 01:18:20,435 INFO L280 TraceCheckUtils]: 25: Hoare triple {1507#false} SUMMARY for call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); srcloc: L17-1 {1507#false} is VALID [2020-07-29 01:18:20,435 INFO L280 TraceCheckUtils]: 26: Hoare triple {1507#false} #t~short4 := #t~mem3 >= 0; {1507#false} is VALID [2020-07-29 01:18:20,435 INFO L280 TraceCheckUtils]: 27: Hoare triple {1507#false} assume !!#t~short4;havoc #t~mem3;havoc #t~short4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~i~0 := #t~nondet5;havoc #t~nondet5; {1507#false} is VALID [2020-07-29 01:18:20,435 INFO L280 TraceCheckUtils]: 28: Hoare triple {1507#false} assume !(4 + (~#a~0.offset + 4 * ~i~0) <= #length[~#a~0.base] && 0 <= ~#a~0.offset + 4 * ~i~0); {1507#false} is VALID [2020-07-29 01:18:20,436 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:18:20,437 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-29 01:18:20,437 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 9 [2020-07-29 01:18:20,437 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205714876] [2020-07-29 01:18:20,437 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 29 [2020-07-29 01:18:20,438 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:18:20,438 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2020-07-29 01:18:20,490 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:18:20,490 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-29 01:18:20,490 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:18:20,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-29 01:18:20,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-07-29 01:18:20,492 INFO L87 Difference]: Start difference. First operand 30 states and 31 transitions. Second operand 9 states. [2020-07-29 01:18:20,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:18:20,666 INFO L93 Difference]: Finished difference Result 37 states and 38 transitions. [2020-07-29 01:18:20,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-29 01:18:20,666 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 29 [2020-07-29 01:18:20,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:18:20,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-29 01:18:20,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 39 transitions. [2020-07-29 01:18:20,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-29 01:18:20,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 39 transitions. [2020-07-29 01:18:20,670 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 39 transitions. [2020-07-29 01:18:20,723 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:18:20,725 INFO L225 Difference]: With dead ends: 37 [2020-07-29 01:18:20,725 INFO L226 Difference]: Without dead ends: 37 [2020-07-29 01:18:20,726 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-07-29 01:18:20,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2020-07-29 01:18:20,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 34. [2020-07-29 01:18:20,729 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:18:20,729 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand 34 states. [2020-07-29 01:18:20,729 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 34 states. [2020-07-29 01:18:20,729 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 34 states. [2020-07-29 01:18:20,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:18:20,732 INFO L93 Difference]: Finished difference Result 37 states and 38 transitions. [2020-07-29 01:18:20,732 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2020-07-29 01:18:20,732 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:18:20,732 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:18:20,733 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 37 states. [2020-07-29 01:18:20,733 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 37 states. [2020-07-29 01:18:20,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:18:20,734 INFO L93 Difference]: Finished difference Result 37 states and 38 transitions. [2020-07-29 01:18:20,735 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2020-07-29 01:18:20,735 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:18:20,735 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:18:20,735 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:18:20,735 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:18:20,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2020-07-29 01:18:20,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 35 transitions. [2020-07-29 01:18:20,737 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 35 transitions. Word has length 29 [2020-07-29 01:18:20,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:18:20,737 INFO L479 AbstractCegarLoop]: Abstraction has 34 states and 35 transitions. [2020-07-29 01:18:20,738 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-29 01:18:20,738 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2020-07-29 01:18:20,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2020-07-29 01:18:20,739 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:18:20,739 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:18:20,942 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-29 01:18:20,943 INFO L427 AbstractCegarLoop]: === Iteration 11 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr6ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION]=== [2020-07-29 01:18:20,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:18:20,944 INFO L82 PathProgramCache]: Analyzing trace with hash -105276236, now seen corresponding path program 2 times [2020-07-29 01:18:20,944 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:18:20,945 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605828145] [2020-07-29 01:18:20,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:18:20,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:18:21,039 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-07-29 01:18:21,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:18:21,043 INFO L280 TraceCheckUtils]: 0: Hoare triple {1760#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1749#true} is VALID [2020-07-29 01:18:21,043 INFO L280 TraceCheckUtils]: 1: Hoare triple {1749#true} assume true; {1749#true} is VALID [2020-07-29 01:18:21,044 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1749#true} {1749#true} #52#return; {1749#true} is VALID [2020-07-29 01:18:21,045 INFO L263 TraceCheckUtils]: 0: Hoare triple {1749#true} call ULTIMATE.init(); {1760#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-29 01:18:21,045 INFO L280 TraceCheckUtils]: 1: Hoare triple {1760#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1749#true} is VALID [2020-07-29 01:18:21,045 INFO L280 TraceCheckUtils]: 2: Hoare triple {1749#true} assume true; {1749#true} is VALID [2020-07-29 01:18:21,045 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1749#true} {1749#true} #52#return; {1749#true} is VALID [2020-07-29 01:18:21,046 INFO L263 TraceCheckUtils]: 4: Hoare triple {1749#true} call #t~ret6 := main(); {1749#true} is VALID [2020-07-29 01:18:21,047 INFO L280 TraceCheckUtils]: 5: Hoare triple {1749#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~i~0 := #t~nondet0;havoc #t~nondet0;call ~#a~0.base, ~#a~0.offset := #Ultimate.allocOnStack(40);~n~0 := 0; {1754#(= 0 main_~n~0)} is VALID [2020-07-29 01:18:21,049 INFO L280 TraceCheckUtils]: 6: Hoare triple {1754#(= 0 main_~n~0)} assume !!(~n~0 < 10);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {1754#(= 0 main_~n~0)} is VALID [2020-07-29 01:18:21,052 INFO L280 TraceCheckUtils]: 7: Hoare triple {1754#(= 0 main_~n~0)} SUMMARY for call write~int(#t~nondet2, ~#a~0.base, ~#a~0.offset + 4 * ~n~0, 4); srcloc: L14 {1754#(= 0 main_~n~0)} is VALID [2020-07-29 01:18:21,052 INFO L280 TraceCheckUtils]: 8: Hoare triple {1754#(= 0 main_~n~0)} havoc #t~nondet2; {1754#(= 0 main_~n~0)} is VALID [2020-07-29 01:18:21,053 INFO L280 TraceCheckUtils]: 9: Hoare triple {1754#(= 0 main_~n~0)} #t~pre1 := 1 + ~n~0;~n~0 := 1 + ~n~0;havoc #t~pre1; {1755#(<= main_~n~0 1)} is VALID [2020-07-29 01:18:21,053 INFO L280 TraceCheckUtils]: 10: Hoare triple {1755#(<= main_~n~0 1)} assume !!(~n~0 < 10);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {1755#(<= main_~n~0 1)} is VALID [2020-07-29 01:18:21,055 INFO L280 TraceCheckUtils]: 11: Hoare triple {1755#(<= main_~n~0 1)} SUMMARY for call write~int(#t~nondet2, ~#a~0.base, ~#a~0.offset + 4 * ~n~0, 4); srcloc: L14 {1755#(<= main_~n~0 1)} is VALID [2020-07-29 01:18:21,055 INFO L280 TraceCheckUtils]: 12: Hoare triple {1755#(<= main_~n~0 1)} havoc #t~nondet2; {1755#(<= main_~n~0 1)} is VALID [2020-07-29 01:18:21,056 INFO L280 TraceCheckUtils]: 13: Hoare triple {1755#(<= main_~n~0 1)} #t~pre1 := 1 + ~n~0;~n~0 := 1 + ~n~0;havoc #t~pre1; {1756#(<= main_~n~0 2)} is VALID [2020-07-29 01:18:21,056 INFO L280 TraceCheckUtils]: 14: Hoare triple {1756#(<= main_~n~0 2)} assume !!(~n~0 < 10);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {1756#(<= main_~n~0 2)} is VALID [2020-07-29 01:18:21,057 INFO L280 TraceCheckUtils]: 15: Hoare triple {1756#(<= main_~n~0 2)} SUMMARY for call write~int(#t~nondet2, ~#a~0.base, ~#a~0.offset + 4 * ~n~0, 4); srcloc: L14 {1756#(<= main_~n~0 2)} is VALID [2020-07-29 01:18:21,057 INFO L280 TraceCheckUtils]: 16: Hoare triple {1756#(<= main_~n~0 2)} havoc #t~nondet2; {1756#(<= main_~n~0 2)} is VALID [2020-07-29 01:18:21,058 INFO L280 TraceCheckUtils]: 17: Hoare triple {1756#(<= main_~n~0 2)} #t~pre1 := 1 + ~n~0;~n~0 := 1 + ~n~0;havoc #t~pre1; {1757#(<= main_~n~0 3)} is VALID [2020-07-29 01:18:21,058 INFO L280 TraceCheckUtils]: 18: Hoare triple {1757#(<= main_~n~0 3)} assume !!(~n~0 < 10);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {1757#(<= main_~n~0 3)} is VALID [2020-07-29 01:18:21,059 INFO L280 TraceCheckUtils]: 19: Hoare triple {1757#(<= main_~n~0 3)} SUMMARY for call write~int(#t~nondet2, ~#a~0.base, ~#a~0.offset + 4 * ~n~0, 4); srcloc: L14 {1757#(<= main_~n~0 3)} is VALID [2020-07-29 01:18:21,059 INFO L280 TraceCheckUtils]: 20: Hoare triple {1757#(<= main_~n~0 3)} havoc #t~nondet2; {1757#(<= main_~n~0 3)} is VALID [2020-07-29 01:18:21,060 INFO L280 TraceCheckUtils]: 21: Hoare triple {1757#(<= main_~n~0 3)} #t~pre1 := 1 + ~n~0;~n~0 := 1 + ~n~0;havoc #t~pre1; {1758#(<= main_~n~0 4)} is VALID [2020-07-29 01:18:21,060 INFO L280 TraceCheckUtils]: 22: Hoare triple {1758#(<= main_~n~0 4)} assume !!(~n~0 < 10);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {1758#(<= main_~n~0 4)} is VALID [2020-07-29 01:18:21,060 INFO L280 TraceCheckUtils]: 23: Hoare triple {1758#(<= main_~n~0 4)} SUMMARY for call write~int(#t~nondet2, ~#a~0.base, ~#a~0.offset + 4 * ~n~0, 4); srcloc: L14 {1758#(<= main_~n~0 4)} is VALID [2020-07-29 01:18:21,061 INFO L280 TraceCheckUtils]: 24: Hoare triple {1758#(<= main_~n~0 4)} havoc #t~nondet2; {1758#(<= main_~n~0 4)} is VALID [2020-07-29 01:18:21,061 INFO L280 TraceCheckUtils]: 25: Hoare triple {1758#(<= main_~n~0 4)} #t~pre1 := 1 + ~n~0;~n~0 := 1 + ~n~0;havoc #t~pre1; {1759#(<= main_~n~0 5)} is VALID [2020-07-29 01:18:21,062 INFO L280 TraceCheckUtils]: 26: Hoare triple {1759#(<= main_~n~0 5)} assume !(~n~0 < 10); {1750#false} is VALID [2020-07-29 01:18:21,062 INFO L280 TraceCheckUtils]: 27: Hoare triple {1750#false} #t~short4 := 0 <= ~i~0 && ~i~0 < 10; {1750#false} is VALID [2020-07-29 01:18:21,062 INFO L280 TraceCheckUtils]: 28: Hoare triple {1750#false} assume #t~short4; {1750#false} is VALID [2020-07-29 01:18:21,062 INFO L280 TraceCheckUtils]: 29: Hoare triple {1750#false} SUMMARY for call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); srcloc: L17-1 {1750#false} is VALID [2020-07-29 01:18:21,063 INFO L280 TraceCheckUtils]: 30: Hoare triple {1750#false} #t~short4 := #t~mem3 >= 0; {1750#false} is VALID [2020-07-29 01:18:21,063 INFO L280 TraceCheckUtils]: 31: Hoare triple {1750#false} assume !!#t~short4;havoc #t~mem3;havoc #t~short4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~i~0 := #t~nondet5;havoc #t~nondet5; {1750#false} is VALID [2020-07-29 01:18:21,063 INFO L280 TraceCheckUtils]: 32: Hoare triple {1750#false} assume !(4 + (~#a~0.offset + 4 * ~i~0) <= #length[~#a~0.base] && 0 <= ~#a~0.offset + 4 * ~i~0); {1750#false} is VALID [2020-07-29 01:18:21,065 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:18:21,065 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605828145] [2020-07-29 01:18:21,065 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [176992151] [2020-07-29 01:18:21,065 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 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:18:21,103 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-29 01:18:21,103 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-29 01:18:21,104 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-29 01:18:21,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:18:21,114 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:18:21,312 INFO L263 TraceCheckUtils]: 0: Hoare triple {1749#true} call ULTIMATE.init(); {1749#true} is VALID [2020-07-29 01:18:21,312 INFO L280 TraceCheckUtils]: 1: Hoare triple {1749#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1749#true} is VALID [2020-07-29 01:18:21,313 INFO L280 TraceCheckUtils]: 2: Hoare triple {1749#true} assume true; {1749#true} is VALID [2020-07-29 01:18:21,313 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1749#true} {1749#true} #52#return; {1749#true} is VALID [2020-07-29 01:18:21,314 INFO L263 TraceCheckUtils]: 4: Hoare triple {1749#true} call #t~ret6 := main(); {1749#true} is VALID [2020-07-29 01:18:21,318 INFO L280 TraceCheckUtils]: 5: Hoare triple {1749#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~i~0 := #t~nondet0;havoc #t~nondet0;call ~#a~0.base, ~#a~0.offset := #Ultimate.allocOnStack(40);~n~0 := 0; {1779#(<= main_~n~0 0)} is VALID [2020-07-29 01:18:21,318 INFO L280 TraceCheckUtils]: 6: Hoare triple {1779#(<= main_~n~0 0)} assume !!(~n~0 < 10);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {1779#(<= main_~n~0 0)} is VALID [2020-07-29 01:18:21,319 INFO L280 TraceCheckUtils]: 7: Hoare triple {1779#(<= main_~n~0 0)} SUMMARY for call write~int(#t~nondet2, ~#a~0.base, ~#a~0.offset + 4 * ~n~0, 4); srcloc: L14 {1779#(<= main_~n~0 0)} is VALID [2020-07-29 01:18:21,319 INFO L280 TraceCheckUtils]: 8: Hoare triple {1779#(<= main_~n~0 0)} havoc #t~nondet2; {1779#(<= main_~n~0 0)} is VALID [2020-07-29 01:18:21,320 INFO L280 TraceCheckUtils]: 9: Hoare triple {1779#(<= main_~n~0 0)} #t~pre1 := 1 + ~n~0;~n~0 := 1 + ~n~0;havoc #t~pre1; {1755#(<= main_~n~0 1)} is VALID [2020-07-29 01:18:21,320 INFO L280 TraceCheckUtils]: 10: Hoare triple {1755#(<= main_~n~0 1)} assume !!(~n~0 < 10);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {1755#(<= main_~n~0 1)} is VALID [2020-07-29 01:18:21,321 INFO L280 TraceCheckUtils]: 11: Hoare triple {1755#(<= main_~n~0 1)} SUMMARY for call write~int(#t~nondet2, ~#a~0.base, ~#a~0.offset + 4 * ~n~0, 4); srcloc: L14 {1755#(<= main_~n~0 1)} is VALID [2020-07-29 01:18:21,321 INFO L280 TraceCheckUtils]: 12: Hoare triple {1755#(<= main_~n~0 1)} havoc #t~nondet2; {1755#(<= main_~n~0 1)} is VALID [2020-07-29 01:18:21,321 INFO L280 TraceCheckUtils]: 13: Hoare triple {1755#(<= main_~n~0 1)} #t~pre1 := 1 + ~n~0;~n~0 := 1 + ~n~0;havoc #t~pre1; {1756#(<= main_~n~0 2)} is VALID [2020-07-29 01:18:21,322 INFO L280 TraceCheckUtils]: 14: Hoare triple {1756#(<= main_~n~0 2)} assume !!(~n~0 < 10);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {1756#(<= main_~n~0 2)} is VALID [2020-07-29 01:18:21,322 INFO L280 TraceCheckUtils]: 15: Hoare triple {1756#(<= main_~n~0 2)} SUMMARY for call write~int(#t~nondet2, ~#a~0.base, ~#a~0.offset + 4 * ~n~0, 4); srcloc: L14 {1756#(<= main_~n~0 2)} is VALID [2020-07-29 01:18:21,323 INFO L280 TraceCheckUtils]: 16: Hoare triple {1756#(<= main_~n~0 2)} havoc #t~nondet2; {1756#(<= main_~n~0 2)} is VALID [2020-07-29 01:18:21,323 INFO L280 TraceCheckUtils]: 17: Hoare triple {1756#(<= main_~n~0 2)} #t~pre1 := 1 + ~n~0;~n~0 := 1 + ~n~0;havoc #t~pre1; {1757#(<= main_~n~0 3)} is VALID [2020-07-29 01:18:21,324 INFO L280 TraceCheckUtils]: 18: Hoare triple {1757#(<= main_~n~0 3)} assume !!(~n~0 < 10);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {1757#(<= main_~n~0 3)} is VALID [2020-07-29 01:18:21,324 INFO L280 TraceCheckUtils]: 19: Hoare triple {1757#(<= main_~n~0 3)} SUMMARY for call write~int(#t~nondet2, ~#a~0.base, ~#a~0.offset + 4 * ~n~0, 4); srcloc: L14 {1757#(<= main_~n~0 3)} is VALID [2020-07-29 01:18:21,325 INFO L280 TraceCheckUtils]: 20: Hoare triple {1757#(<= main_~n~0 3)} havoc #t~nondet2; {1757#(<= main_~n~0 3)} is VALID [2020-07-29 01:18:21,325 INFO L280 TraceCheckUtils]: 21: Hoare triple {1757#(<= main_~n~0 3)} #t~pre1 := 1 + ~n~0;~n~0 := 1 + ~n~0;havoc #t~pre1; {1758#(<= main_~n~0 4)} is VALID [2020-07-29 01:18:21,326 INFO L280 TraceCheckUtils]: 22: Hoare triple {1758#(<= main_~n~0 4)} assume !!(~n~0 < 10);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {1758#(<= main_~n~0 4)} is VALID [2020-07-29 01:18:21,326 INFO L280 TraceCheckUtils]: 23: Hoare triple {1758#(<= main_~n~0 4)} SUMMARY for call write~int(#t~nondet2, ~#a~0.base, ~#a~0.offset + 4 * ~n~0, 4); srcloc: L14 {1758#(<= main_~n~0 4)} is VALID [2020-07-29 01:18:21,326 INFO L280 TraceCheckUtils]: 24: Hoare triple {1758#(<= main_~n~0 4)} havoc #t~nondet2; {1758#(<= main_~n~0 4)} is VALID [2020-07-29 01:18:21,327 INFO L280 TraceCheckUtils]: 25: Hoare triple {1758#(<= main_~n~0 4)} #t~pre1 := 1 + ~n~0;~n~0 := 1 + ~n~0;havoc #t~pre1; {1759#(<= main_~n~0 5)} is VALID [2020-07-29 01:18:21,327 INFO L280 TraceCheckUtils]: 26: Hoare triple {1759#(<= main_~n~0 5)} assume !(~n~0 < 10); {1750#false} is VALID [2020-07-29 01:18:21,328 INFO L280 TraceCheckUtils]: 27: Hoare triple {1750#false} #t~short4 := 0 <= ~i~0 && ~i~0 < 10; {1750#false} is VALID [2020-07-29 01:18:21,328 INFO L280 TraceCheckUtils]: 28: Hoare triple {1750#false} assume #t~short4; {1750#false} is VALID [2020-07-29 01:18:21,328 INFO L280 TraceCheckUtils]: 29: Hoare triple {1750#false} SUMMARY for call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); srcloc: L17-1 {1750#false} is VALID [2020-07-29 01:18:21,328 INFO L280 TraceCheckUtils]: 30: Hoare triple {1750#false} #t~short4 := #t~mem3 >= 0; {1750#false} is VALID [2020-07-29 01:18:21,328 INFO L280 TraceCheckUtils]: 31: Hoare triple {1750#false} assume !!#t~short4;havoc #t~mem3;havoc #t~short4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~i~0 := #t~nondet5;havoc #t~nondet5; {1750#false} is VALID [2020-07-29 01:18:21,328 INFO L280 TraceCheckUtils]: 32: Hoare triple {1750#false} assume !(4 + (~#a~0.offset + 4 * ~i~0) <= #length[~#a~0.base] && 0 <= ~#a~0.offset + 4 * ~i~0); {1750#false} is VALID [2020-07-29 01:18:21,329 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:18:21,330 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-29 01:18:21,330 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 10 [2020-07-29 01:18:21,330 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941262072] [2020-07-29 01:18:21,331 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 33 [2020-07-29 01:18:21,331 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:18:21,331 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2020-07-29 01:18:21,379 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:18:21,379 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-29 01:18:21,379 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:18:21,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-29 01:18:21,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-07-29 01:18:21,380 INFO L87 Difference]: Start difference. First operand 34 states and 35 transitions. Second operand 10 states. [2020-07-29 01:18:21,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:18:21,562 INFO L93 Difference]: Finished difference Result 41 states and 42 transitions. [2020-07-29 01:18:21,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-29 01:18:21,562 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 33 [2020-07-29 01:18:21,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:18:21,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-29 01:18:21,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 43 transitions. [2020-07-29 01:18:21,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-29 01:18:21,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 43 transitions. [2020-07-29 01:18:21,567 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 43 transitions. [2020-07-29 01:18:21,621 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:18:21,623 INFO L225 Difference]: With dead ends: 41 [2020-07-29 01:18:21,623 INFO L226 Difference]: Without dead ends: 41 [2020-07-29 01:18:21,624 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-07-29 01:18:21,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2020-07-29 01:18:21,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 38. [2020-07-29 01:18:21,627 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:18:21,627 INFO L82 GeneralOperation]: Start isEquivalent. First operand 41 states. Second operand 38 states. [2020-07-29 01:18:21,627 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand 38 states. [2020-07-29 01:18:21,627 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 38 states. [2020-07-29 01:18:21,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:18:21,629 INFO L93 Difference]: Finished difference Result 41 states and 42 transitions. [2020-07-29 01:18:21,629 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 42 transitions. [2020-07-29 01:18:21,630 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:18:21,630 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:18:21,630 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 41 states. [2020-07-29 01:18:21,630 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 41 states. [2020-07-29 01:18:21,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:18:21,632 INFO L93 Difference]: Finished difference Result 41 states and 42 transitions. [2020-07-29 01:18:21,632 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 42 transitions. [2020-07-29 01:18:21,632 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:18:21,632 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:18:21,633 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:18:21,633 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:18:21,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2020-07-29 01:18:21,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 39 transitions. [2020-07-29 01:18:21,634 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 39 transitions. Word has length 33 [2020-07-29 01:18:21,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:18:21,635 INFO L479 AbstractCegarLoop]: Abstraction has 38 states and 39 transitions. [2020-07-29 01:18:21,635 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-29 01:18:21,635 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 39 transitions. [2020-07-29 01:18:21,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2020-07-29 01:18:21,636 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:18:21,636 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:18:21,850 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-29 01:18:21,851 INFO L427 AbstractCegarLoop]: === Iteration 12 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr6ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION]=== [2020-07-29 01:18:21,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:18:21,852 INFO L82 PathProgramCache]: Analyzing trace with hash -1144843311, now seen corresponding path program 3 times [2020-07-29 01:18:21,852 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:18:21,852 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767470681] [2020-07-29 01:18:21,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:18:21,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:18:21,999 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-07-29 01:18:22,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:18:22,007 INFO L280 TraceCheckUtils]: 0: Hoare triple {2033#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {2021#true} is VALID [2020-07-29 01:18:22,008 INFO L280 TraceCheckUtils]: 1: Hoare triple {2021#true} assume true; {2021#true} is VALID [2020-07-29 01:18:22,008 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2021#true} {2021#true} #52#return; {2021#true} is VALID [2020-07-29 01:18:22,009 INFO L263 TraceCheckUtils]: 0: Hoare triple {2021#true} call ULTIMATE.init(); {2033#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-29 01:18:22,009 INFO L280 TraceCheckUtils]: 1: Hoare triple {2033#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {2021#true} is VALID [2020-07-29 01:18:22,009 INFO L280 TraceCheckUtils]: 2: Hoare triple {2021#true} assume true; {2021#true} is VALID [2020-07-29 01:18:22,009 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2021#true} {2021#true} #52#return; {2021#true} is VALID [2020-07-29 01:18:22,010 INFO L263 TraceCheckUtils]: 4: Hoare triple {2021#true} call #t~ret6 := main(); {2021#true} is VALID [2020-07-29 01:18:22,012 INFO L280 TraceCheckUtils]: 5: Hoare triple {2021#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~i~0 := #t~nondet0;havoc #t~nondet0;call ~#a~0.base, ~#a~0.offset := #Ultimate.allocOnStack(40);~n~0 := 0; {2026#(= 0 main_~n~0)} is VALID [2020-07-29 01:18:22,012 INFO L280 TraceCheckUtils]: 6: Hoare triple {2026#(= 0 main_~n~0)} assume !!(~n~0 < 10);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {2026#(= 0 main_~n~0)} is VALID [2020-07-29 01:18:22,013 INFO L280 TraceCheckUtils]: 7: Hoare triple {2026#(= 0 main_~n~0)} SUMMARY for call write~int(#t~nondet2, ~#a~0.base, ~#a~0.offset + 4 * ~n~0, 4); srcloc: L14 {2026#(= 0 main_~n~0)} is VALID [2020-07-29 01:18:22,013 INFO L280 TraceCheckUtils]: 8: Hoare triple {2026#(= 0 main_~n~0)} havoc #t~nondet2; {2026#(= 0 main_~n~0)} is VALID [2020-07-29 01:18:22,014 INFO L280 TraceCheckUtils]: 9: Hoare triple {2026#(= 0 main_~n~0)} #t~pre1 := 1 + ~n~0;~n~0 := 1 + ~n~0;havoc #t~pre1; {2027#(<= main_~n~0 1)} is VALID [2020-07-29 01:18:22,014 INFO L280 TraceCheckUtils]: 10: Hoare triple {2027#(<= main_~n~0 1)} assume !!(~n~0 < 10);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {2027#(<= main_~n~0 1)} is VALID [2020-07-29 01:18:22,015 INFO L280 TraceCheckUtils]: 11: Hoare triple {2027#(<= main_~n~0 1)} SUMMARY for call write~int(#t~nondet2, ~#a~0.base, ~#a~0.offset + 4 * ~n~0, 4); srcloc: L14 {2027#(<= main_~n~0 1)} is VALID [2020-07-29 01:18:22,015 INFO L280 TraceCheckUtils]: 12: Hoare triple {2027#(<= main_~n~0 1)} havoc #t~nondet2; {2027#(<= main_~n~0 1)} is VALID [2020-07-29 01:18:22,016 INFO L280 TraceCheckUtils]: 13: Hoare triple {2027#(<= main_~n~0 1)} #t~pre1 := 1 + ~n~0;~n~0 := 1 + ~n~0;havoc #t~pre1; {2028#(<= main_~n~0 2)} is VALID [2020-07-29 01:18:22,017 INFO L280 TraceCheckUtils]: 14: Hoare triple {2028#(<= main_~n~0 2)} assume !!(~n~0 < 10);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {2028#(<= main_~n~0 2)} is VALID [2020-07-29 01:18:22,018 INFO L280 TraceCheckUtils]: 15: Hoare triple {2028#(<= main_~n~0 2)} SUMMARY for call write~int(#t~nondet2, ~#a~0.base, ~#a~0.offset + 4 * ~n~0, 4); srcloc: L14 {2028#(<= main_~n~0 2)} is VALID [2020-07-29 01:18:22,019 INFO L280 TraceCheckUtils]: 16: Hoare triple {2028#(<= main_~n~0 2)} havoc #t~nondet2; {2028#(<= main_~n~0 2)} is VALID [2020-07-29 01:18:22,021 INFO L280 TraceCheckUtils]: 17: Hoare triple {2028#(<= main_~n~0 2)} #t~pre1 := 1 + ~n~0;~n~0 := 1 + ~n~0;havoc #t~pre1; {2029#(<= main_~n~0 3)} is VALID [2020-07-29 01:18:22,022 INFO L280 TraceCheckUtils]: 18: Hoare triple {2029#(<= main_~n~0 3)} assume !!(~n~0 < 10);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {2029#(<= main_~n~0 3)} is VALID [2020-07-29 01:18:22,024 INFO L280 TraceCheckUtils]: 19: Hoare triple {2029#(<= main_~n~0 3)} SUMMARY for call write~int(#t~nondet2, ~#a~0.base, ~#a~0.offset + 4 * ~n~0, 4); srcloc: L14 {2029#(<= main_~n~0 3)} is VALID [2020-07-29 01:18:22,026 INFO L280 TraceCheckUtils]: 20: Hoare triple {2029#(<= main_~n~0 3)} havoc #t~nondet2; {2029#(<= main_~n~0 3)} is VALID [2020-07-29 01:18:22,028 INFO L280 TraceCheckUtils]: 21: Hoare triple {2029#(<= main_~n~0 3)} #t~pre1 := 1 + ~n~0;~n~0 := 1 + ~n~0;havoc #t~pre1; {2030#(<= main_~n~0 4)} is VALID [2020-07-29 01:18:22,029 INFO L280 TraceCheckUtils]: 22: Hoare triple {2030#(<= main_~n~0 4)} assume !!(~n~0 < 10);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {2030#(<= main_~n~0 4)} is VALID [2020-07-29 01:18:22,029 INFO L280 TraceCheckUtils]: 23: Hoare triple {2030#(<= main_~n~0 4)} SUMMARY for call write~int(#t~nondet2, ~#a~0.base, ~#a~0.offset + 4 * ~n~0, 4); srcloc: L14 {2030#(<= main_~n~0 4)} is VALID [2020-07-29 01:18:22,029 INFO L280 TraceCheckUtils]: 24: Hoare triple {2030#(<= main_~n~0 4)} havoc #t~nondet2; {2030#(<= main_~n~0 4)} is VALID [2020-07-29 01:18:22,030 INFO L280 TraceCheckUtils]: 25: Hoare triple {2030#(<= main_~n~0 4)} #t~pre1 := 1 + ~n~0;~n~0 := 1 + ~n~0;havoc #t~pre1; {2031#(<= main_~n~0 5)} is VALID [2020-07-29 01:18:22,030 INFO L280 TraceCheckUtils]: 26: Hoare triple {2031#(<= main_~n~0 5)} assume !!(~n~0 < 10);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {2031#(<= main_~n~0 5)} is VALID [2020-07-29 01:18:22,031 INFO L280 TraceCheckUtils]: 27: Hoare triple {2031#(<= main_~n~0 5)} SUMMARY for call write~int(#t~nondet2, ~#a~0.base, ~#a~0.offset + 4 * ~n~0, 4); srcloc: L14 {2031#(<= main_~n~0 5)} is VALID [2020-07-29 01:18:22,031 INFO L280 TraceCheckUtils]: 28: Hoare triple {2031#(<= main_~n~0 5)} havoc #t~nondet2; {2031#(<= main_~n~0 5)} is VALID [2020-07-29 01:18:22,032 INFO L280 TraceCheckUtils]: 29: Hoare triple {2031#(<= main_~n~0 5)} #t~pre1 := 1 + ~n~0;~n~0 := 1 + ~n~0;havoc #t~pre1; {2032#(<= main_~n~0 6)} is VALID [2020-07-29 01:18:22,032 INFO L280 TraceCheckUtils]: 30: Hoare triple {2032#(<= main_~n~0 6)} assume !(~n~0 < 10); {2022#false} is VALID [2020-07-29 01:18:22,032 INFO L280 TraceCheckUtils]: 31: Hoare triple {2022#false} #t~short4 := 0 <= ~i~0 && ~i~0 < 10; {2022#false} is VALID [2020-07-29 01:18:22,033 INFO L280 TraceCheckUtils]: 32: Hoare triple {2022#false} assume #t~short4; {2022#false} is VALID [2020-07-29 01:18:22,033 INFO L280 TraceCheckUtils]: 33: Hoare triple {2022#false} SUMMARY for call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); srcloc: L17-1 {2022#false} is VALID [2020-07-29 01:18:22,033 INFO L280 TraceCheckUtils]: 34: Hoare triple {2022#false} #t~short4 := #t~mem3 >= 0; {2022#false} is VALID [2020-07-29 01:18:22,033 INFO L280 TraceCheckUtils]: 35: Hoare triple {2022#false} assume !!#t~short4;havoc #t~mem3;havoc #t~short4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~i~0 := #t~nondet5;havoc #t~nondet5; {2022#false} is VALID [2020-07-29 01:18:22,033 INFO L280 TraceCheckUtils]: 36: Hoare triple {2022#false} assume !(4 + (~#a~0.offset + 4 * ~i~0) <= #length[~#a~0.base] && 0 <= ~#a~0.offset + 4 * ~i~0); {2022#false} is VALID [2020-07-29 01:18:22,035 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:18:22,035 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767470681] [2020-07-29 01:18:22,035 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [40577119] [2020-07-29 01:18:22,035 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 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:18:22,075 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2020-07-29 01:18:22,075 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-29 01:18:22,076 INFO L263 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-29 01:18:22,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:18:22,094 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:18:22,325 INFO L263 TraceCheckUtils]: 0: Hoare triple {2021#true} call ULTIMATE.init(); {2021#true} is VALID [2020-07-29 01:18:22,325 INFO L280 TraceCheckUtils]: 1: Hoare triple {2021#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {2021#true} is VALID [2020-07-29 01:18:22,325 INFO L280 TraceCheckUtils]: 2: Hoare triple {2021#true} assume true; {2021#true} is VALID [2020-07-29 01:18:22,325 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2021#true} {2021#true} #52#return; {2021#true} is VALID [2020-07-29 01:18:22,325 INFO L263 TraceCheckUtils]: 4: Hoare triple {2021#true} call #t~ret6 := main(); {2021#true} is VALID [2020-07-29 01:18:22,326 INFO L280 TraceCheckUtils]: 5: Hoare triple {2021#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~i~0 := #t~nondet0;havoc #t~nondet0;call ~#a~0.base, ~#a~0.offset := #Ultimate.allocOnStack(40);~n~0 := 0; {2052#(<= main_~n~0 0)} is VALID [2020-07-29 01:18:22,327 INFO L280 TraceCheckUtils]: 6: Hoare triple {2052#(<= main_~n~0 0)} assume !!(~n~0 < 10);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {2052#(<= main_~n~0 0)} is VALID [2020-07-29 01:18:22,328 INFO L280 TraceCheckUtils]: 7: Hoare triple {2052#(<= main_~n~0 0)} SUMMARY for call write~int(#t~nondet2, ~#a~0.base, ~#a~0.offset + 4 * ~n~0, 4); srcloc: L14 {2052#(<= main_~n~0 0)} is VALID [2020-07-29 01:18:22,328 INFO L280 TraceCheckUtils]: 8: Hoare triple {2052#(<= main_~n~0 0)} havoc #t~nondet2; {2052#(<= main_~n~0 0)} is VALID [2020-07-29 01:18:22,329 INFO L280 TraceCheckUtils]: 9: Hoare triple {2052#(<= main_~n~0 0)} #t~pre1 := 1 + ~n~0;~n~0 := 1 + ~n~0;havoc #t~pre1; {2027#(<= main_~n~0 1)} is VALID [2020-07-29 01:18:22,329 INFO L280 TraceCheckUtils]: 10: Hoare triple {2027#(<= main_~n~0 1)} assume !!(~n~0 < 10);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {2027#(<= main_~n~0 1)} is VALID [2020-07-29 01:18:22,330 INFO L280 TraceCheckUtils]: 11: Hoare triple {2027#(<= main_~n~0 1)} SUMMARY for call write~int(#t~nondet2, ~#a~0.base, ~#a~0.offset + 4 * ~n~0, 4); srcloc: L14 {2027#(<= main_~n~0 1)} is VALID [2020-07-29 01:18:22,330 INFO L280 TraceCheckUtils]: 12: Hoare triple {2027#(<= main_~n~0 1)} havoc #t~nondet2; {2027#(<= main_~n~0 1)} is VALID [2020-07-29 01:18:22,331 INFO L280 TraceCheckUtils]: 13: Hoare triple {2027#(<= main_~n~0 1)} #t~pre1 := 1 + ~n~0;~n~0 := 1 + ~n~0;havoc #t~pre1; {2028#(<= main_~n~0 2)} is VALID [2020-07-29 01:18:22,331 INFO L280 TraceCheckUtils]: 14: Hoare triple {2028#(<= main_~n~0 2)} assume !!(~n~0 < 10);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {2028#(<= main_~n~0 2)} is VALID [2020-07-29 01:18:22,331 INFO L280 TraceCheckUtils]: 15: Hoare triple {2028#(<= main_~n~0 2)} SUMMARY for call write~int(#t~nondet2, ~#a~0.base, ~#a~0.offset + 4 * ~n~0, 4); srcloc: L14 {2028#(<= main_~n~0 2)} is VALID [2020-07-29 01:18:22,332 INFO L280 TraceCheckUtils]: 16: Hoare triple {2028#(<= main_~n~0 2)} havoc #t~nondet2; {2028#(<= main_~n~0 2)} is VALID [2020-07-29 01:18:22,332 INFO L280 TraceCheckUtils]: 17: Hoare triple {2028#(<= main_~n~0 2)} #t~pre1 := 1 + ~n~0;~n~0 := 1 + ~n~0;havoc #t~pre1; {2029#(<= main_~n~0 3)} is VALID [2020-07-29 01:18:22,333 INFO L280 TraceCheckUtils]: 18: Hoare triple {2029#(<= main_~n~0 3)} assume !!(~n~0 < 10);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {2029#(<= main_~n~0 3)} is VALID [2020-07-29 01:18:22,333 INFO L280 TraceCheckUtils]: 19: Hoare triple {2029#(<= main_~n~0 3)} SUMMARY for call write~int(#t~nondet2, ~#a~0.base, ~#a~0.offset + 4 * ~n~0, 4); srcloc: L14 {2029#(<= main_~n~0 3)} is VALID [2020-07-29 01:18:22,334 INFO L280 TraceCheckUtils]: 20: Hoare triple {2029#(<= main_~n~0 3)} havoc #t~nondet2; {2029#(<= main_~n~0 3)} is VALID [2020-07-29 01:18:22,334 INFO L280 TraceCheckUtils]: 21: Hoare triple {2029#(<= main_~n~0 3)} #t~pre1 := 1 + ~n~0;~n~0 := 1 + ~n~0;havoc #t~pre1; {2030#(<= main_~n~0 4)} is VALID [2020-07-29 01:18:22,335 INFO L280 TraceCheckUtils]: 22: Hoare triple {2030#(<= main_~n~0 4)} assume !!(~n~0 < 10);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {2030#(<= main_~n~0 4)} is VALID [2020-07-29 01:18:22,335 INFO L280 TraceCheckUtils]: 23: Hoare triple {2030#(<= main_~n~0 4)} SUMMARY for call write~int(#t~nondet2, ~#a~0.base, ~#a~0.offset + 4 * ~n~0, 4); srcloc: L14 {2030#(<= main_~n~0 4)} is VALID [2020-07-29 01:18:22,336 INFO L280 TraceCheckUtils]: 24: Hoare triple {2030#(<= main_~n~0 4)} havoc #t~nondet2; {2030#(<= main_~n~0 4)} is VALID [2020-07-29 01:18:22,336 INFO L280 TraceCheckUtils]: 25: Hoare triple {2030#(<= main_~n~0 4)} #t~pre1 := 1 + ~n~0;~n~0 := 1 + ~n~0;havoc #t~pre1; {2031#(<= main_~n~0 5)} is VALID [2020-07-29 01:18:22,337 INFO L280 TraceCheckUtils]: 26: Hoare triple {2031#(<= main_~n~0 5)} assume !!(~n~0 < 10);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {2031#(<= main_~n~0 5)} is VALID [2020-07-29 01:18:22,337 INFO L280 TraceCheckUtils]: 27: Hoare triple {2031#(<= main_~n~0 5)} SUMMARY for call write~int(#t~nondet2, ~#a~0.base, ~#a~0.offset + 4 * ~n~0, 4); srcloc: L14 {2031#(<= main_~n~0 5)} is VALID [2020-07-29 01:18:22,338 INFO L280 TraceCheckUtils]: 28: Hoare triple {2031#(<= main_~n~0 5)} havoc #t~nondet2; {2031#(<= main_~n~0 5)} is VALID [2020-07-29 01:18:22,338 INFO L280 TraceCheckUtils]: 29: Hoare triple {2031#(<= main_~n~0 5)} #t~pre1 := 1 + ~n~0;~n~0 := 1 + ~n~0;havoc #t~pre1; {2032#(<= main_~n~0 6)} is VALID [2020-07-29 01:18:22,339 INFO L280 TraceCheckUtils]: 30: Hoare triple {2032#(<= main_~n~0 6)} assume !(~n~0 < 10); {2022#false} is VALID [2020-07-29 01:18:22,339 INFO L280 TraceCheckUtils]: 31: Hoare triple {2022#false} #t~short4 := 0 <= ~i~0 && ~i~0 < 10; {2022#false} is VALID [2020-07-29 01:18:22,339 INFO L280 TraceCheckUtils]: 32: Hoare triple {2022#false} assume #t~short4; {2022#false} is VALID [2020-07-29 01:18:22,339 INFO L280 TraceCheckUtils]: 33: Hoare triple {2022#false} SUMMARY for call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); srcloc: L17-1 {2022#false} is VALID [2020-07-29 01:18:22,339 INFO L280 TraceCheckUtils]: 34: Hoare triple {2022#false} #t~short4 := #t~mem3 >= 0; {2022#false} is VALID [2020-07-29 01:18:22,339 INFO L280 TraceCheckUtils]: 35: Hoare triple {2022#false} assume !!#t~short4;havoc #t~mem3;havoc #t~short4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~i~0 := #t~nondet5;havoc #t~nondet5; {2022#false} is VALID [2020-07-29 01:18:22,340 INFO L280 TraceCheckUtils]: 36: Hoare triple {2022#false} assume !(4 + (~#a~0.offset + 4 * ~i~0) <= #length[~#a~0.base] && 0 <= ~#a~0.offset + 4 * ~i~0); {2022#false} is VALID [2020-07-29 01:18:22,341 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:18:22,341 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-29 01:18:22,341 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 11 [2020-07-29 01:18:22,341 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641231319] [2020-07-29 01:18:22,342 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 37 [2020-07-29 01:18:22,342 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:18:22,342 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2020-07-29 01:18:22,401 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:18:22,401 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-07-29 01:18:22,401 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:18:22,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-29 01:18:22,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-07-29 01:18:22,402 INFO L87 Difference]: Start difference. First operand 38 states and 39 transitions. Second operand 11 states. [2020-07-29 01:18:22,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:18:22,565 INFO L93 Difference]: Finished difference Result 45 states and 46 transitions. [2020-07-29 01:18:22,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-29 01:18:22,566 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 37 [2020-07-29 01:18:22,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:18:22,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-29 01:18:22,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 47 transitions. [2020-07-29 01:18:22,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-29 01:18:22,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 47 transitions. [2020-07-29 01:18:22,570 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 47 transitions. [2020-07-29 01:18:22,621 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:18:22,622 INFO L225 Difference]: With dead ends: 45 [2020-07-29 01:18:22,622 INFO L226 Difference]: Without dead ends: 45 [2020-07-29 01:18:22,623 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-07-29 01:18:22,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2020-07-29 01:18:22,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 42. [2020-07-29 01:18:22,626 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:18:22,626 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand 42 states. [2020-07-29 01:18:22,627 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand 42 states. [2020-07-29 01:18:22,627 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 42 states. [2020-07-29 01:18:22,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:18:22,629 INFO L93 Difference]: Finished difference Result 45 states and 46 transitions. [2020-07-29 01:18:22,629 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2020-07-29 01:18:22,629 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:18:22,630 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:18:22,630 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 45 states. [2020-07-29 01:18:22,630 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 45 states. [2020-07-29 01:18:22,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:18:22,632 INFO L93 Difference]: Finished difference Result 45 states and 46 transitions. [2020-07-29 01:18:22,632 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2020-07-29 01:18:22,632 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:18:22,632 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:18:22,633 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:18:22,633 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:18:22,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2020-07-29 01:18:22,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 43 transitions. [2020-07-29 01:18:22,634 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 43 transitions. Word has length 37 [2020-07-29 01:18:22,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:18:22,635 INFO L479 AbstractCegarLoop]: Abstraction has 42 states and 43 transitions. [2020-07-29 01:18:22,635 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-07-29 01:18:22,635 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 43 transitions. [2020-07-29 01:18:22,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-07-29 01:18:22,636 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:18:22,636 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:18:22,849 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2020-07-29 01:18:22,850 INFO L427 AbstractCegarLoop]: === Iteration 13 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr6ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION]=== [2020-07-29 01:18:22,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:18:22,851 INFO L82 PathProgramCache]: Analyzing trace with hash -539904914, now seen corresponding path program 4 times [2020-07-29 01:18:22,852 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:18:22,852 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831550570] [2020-07-29 01:18:22,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:18:22,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:18:23,018 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-07-29 01:18:23,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:18:23,022 INFO L280 TraceCheckUtils]: 0: Hoare triple {2335#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {2322#true} is VALID [2020-07-29 01:18:23,023 INFO L280 TraceCheckUtils]: 1: Hoare triple {2322#true} assume true; {2322#true} is VALID [2020-07-29 01:18:23,023 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2322#true} {2322#true} #52#return; {2322#true} is VALID [2020-07-29 01:18:23,024 INFO L263 TraceCheckUtils]: 0: Hoare triple {2322#true} call ULTIMATE.init(); {2335#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-29 01:18:23,024 INFO L280 TraceCheckUtils]: 1: Hoare triple {2335#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {2322#true} is VALID [2020-07-29 01:18:23,024 INFO L280 TraceCheckUtils]: 2: Hoare triple {2322#true} assume true; {2322#true} is VALID [2020-07-29 01:18:23,024 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2322#true} {2322#true} #52#return; {2322#true} is VALID [2020-07-29 01:18:23,025 INFO L263 TraceCheckUtils]: 4: Hoare triple {2322#true} call #t~ret6 := main(); {2322#true} is VALID [2020-07-29 01:18:23,026 INFO L280 TraceCheckUtils]: 5: Hoare triple {2322#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~i~0 := #t~nondet0;havoc #t~nondet0;call ~#a~0.base, ~#a~0.offset := #Ultimate.allocOnStack(40);~n~0 := 0; {2327#(= 0 main_~n~0)} is VALID [2020-07-29 01:18:23,026 INFO L280 TraceCheckUtils]: 6: Hoare triple {2327#(= 0 main_~n~0)} assume !!(~n~0 < 10);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {2327#(= 0 main_~n~0)} is VALID [2020-07-29 01:18:23,027 INFO L280 TraceCheckUtils]: 7: Hoare triple {2327#(= 0 main_~n~0)} SUMMARY for call write~int(#t~nondet2, ~#a~0.base, ~#a~0.offset + 4 * ~n~0, 4); srcloc: L14 {2327#(= 0 main_~n~0)} is VALID [2020-07-29 01:18:23,028 INFO L280 TraceCheckUtils]: 8: Hoare triple {2327#(= 0 main_~n~0)} havoc #t~nondet2; {2327#(= 0 main_~n~0)} is VALID [2020-07-29 01:18:23,028 INFO L280 TraceCheckUtils]: 9: Hoare triple {2327#(= 0 main_~n~0)} #t~pre1 := 1 + ~n~0;~n~0 := 1 + ~n~0;havoc #t~pre1; {2328#(<= main_~n~0 1)} is VALID [2020-07-29 01:18:23,029 INFO L280 TraceCheckUtils]: 10: Hoare triple {2328#(<= main_~n~0 1)} assume !!(~n~0 < 10);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {2328#(<= main_~n~0 1)} is VALID [2020-07-29 01:18:23,030 INFO L280 TraceCheckUtils]: 11: Hoare triple {2328#(<= main_~n~0 1)} SUMMARY for call write~int(#t~nondet2, ~#a~0.base, ~#a~0.offset + 4 * ~n~0, 4); srcloc: L14 {2328#(<= main_~n~0 1)} is VALID [2020-07-29 01:18:23,030 INFO L280 TraceCheckUtils]: 12: Hoare triple {2328#(<= main_~n~0 1)} havoc #t~nondet2; {2328#(<= main_~n~0 1)} is VALID [2020-07-29 01:18:23,031 INFO L280 TraceCheckUtils]: 13: Hoare triple {2328#(<= main_~n~0 1)} #t~pre1 := 1 + ~n~0;~n~0 := 1 + ~n~0;havoc #t~pre1; {2329#(<= main_~n~0 2)} is VALID [2020-07-29 01:18:23,032 INFO L280 TraceCheckUtils]: 14: Hoare triple {2329#(<= main_~n~0 2)} assume !!(~n~0 < 10);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {2329#(<= main_~n~0 2)} is VALID [2020-07-29 01:18:23,033 INFO L280 TraceCheckUtils]: 15: Hoare triple {2329#(<= main_~n~0 2)} SUMMARY for call write~int(#t~nondet2, ~#a~0.base, ~#a~0.offset + 4 * ~n~0, 4); srcloc: L14 {2329#(<= main_~n~0 2)} is VALID [2020-07-29 01:18:23,033 INFO L280 TraceCheckUtils]: 16: Hoare triple {2329#(<= main_~n~0 2)} havoc #t~nondet2; {2329#(<= main_~n~0 2)} is VALID [2020-07-29 01:18:23,034 INFO L280 TraceCheckUtils]: 17: Hoare triple {2329#(<= main_~n~0 2)} #t~pre1 := 1 + ~n~0;~n~0 := 1 + ~n~0;havoc #t~pre1; {2330#(<= main_~n~0 3)} is VALID [2020-07-29 01:18:23,035 INFO L280 TraceCheckUtils]: 18: Hoare triple {2330#(<= main_~n~0 3)} assume !!(~n~0 < 10);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {2330#(<= main_~n~0 3)} is VALID [2020-07-29 01:18:23,036 INFO L280 TraceCheckUtils]: 19: Hoare triple {2330#(<= main_~n~0 3)} SUMMARY for call write~int(#t~nondet2, ~#a~0.base, ~#a~0.offset + 4 * ~n~0, 4); srcloc: L14 {2330#(<= main_~n~0 3)} is VALID [2020-07-29 01:18:23,037 INFO L280 TraceCheckUtils]: 20: Hoare triple {2330#(<= main_~n~0 3)} havoc #t~nondet2; {2330#(<= main_~n~0 3)} is VALID [2020-07-29 01:18:23,038 INFO L280 TraceCheckUtils]: 21: Hoare triple {2330#(<= main_~n~0 3)} #t~pre1 := 1 + ~n~0;~n~0 := 1 + ~n~0;havoc #t~pre1; {2331#(<= main_~n~0 4)} is VALID [2020-07-29 01:18:23,038 INFO L280 TraceCheckUtils]: 22: Hoare triple {2331#(<= main_~n~0 4)} assume !!(~n~0 < 10);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {2331#(<= main_~n~0 4)} is VALID [2020-07-29 01:18:23,039 INFO L280 TraceCheckUtils]: 23: Hoare triple {2331#(<= main_~n~0 4)} SUMMARY for call write~int(#t~nondet2, ~#a~0.base, ~#a~0.offset + 4 * ~n~0, 4); srcloc: L14 {2331#(<= main_~n~0 4)} is VALID [2020-07-29 01:18:23,039 INFO L280 TraceCheckUtils]: 24: Hoare triple {2331#(<= main_~n~0 4)} havoc #t~nondet2; {2331#(<= main_~n~0 4)} is VALID [2020-07-29 01:18:23,040 INFO L280 TraceCheckUtils]: 25: Hoare triple {2331#(<= main_~n~0 4)} #t~pre1 := 1 + ~n~0;~n~0 := 1 + ~n~0;havoc #t~pre1; {2332#(<= main_~n~0 5)} is VALID [2020-07-29 01:18:23,041 INFO L280 TraceCheckUtils]: 26: Hoare triple {2332#(<= main_~n~0 5)} assume !!(~n~0 < 10);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {2332#(<= main_~n~0 5)} is VALID [2020-07-29 01:18:23,042 INFO L280 TraceCheckUtils]: 27: Hoare triple {2332#(<= main_~n~0 5)} SUMMARY for call write~int(#t~nondet2, ~#a~0.base, ~#a~0.offset + 4 * ~n~0, 4); srcloc: L14 {2332#(<= main_~n~0 5)} is VALID [2020-07-29 01:18:23,042 INFO L280 TraceCheckUtils]: 28: Hoare triple {2332#(<= main_~n~0 5)} havoc #t~nondet2; {2332#(<= main_~n~0 5)} is VALID [2020-07-29 01:18:23,043 INFO L280 TraceCheckUtils]: 29: Hoare triple {2332#(<= main_~n~0 5)} #t~pre1 := 1 + ~n~0;~n~0 := 1 + ~n~0;havoc #t~pre1; {2333#(<= main_~n~0 6)} is VALID [2020-07-29 01:18:23,044 INFO L280 TraceCheckUtils]: 30: Hoare triple {2333#(<= main_~n~0 6)} assume !!(~n~0 < 10);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {2333#(<= main_~n~0 6)} is VALID [2020-07-29 01:18:23,044 INFO L280 TraceCheckUtils]: 31: Hoare triple {2333#(<= main_~n~0 6)} SUMMARY for call write~int(#t~nondet2, ~#a~0.base, ~#a~0.offset + 4 * ~n~0, 4); srcloc: L14 {2333#(<= main_~n~0 6)} is VALID [2020-07-29 01:18:23,045 INFO L280 TraceCheckUtils]: 32: Hoare triple {2333#(<= main_~n~0 6)} havoc #t~nondet2; {2333#(<= main_~n~0 6)} is VALID [2020-07-29 01:18:23,046 INFO L280 TraceCheckUtils]: 33: Hoare triple {2333#(<= main_~n~0 6)} #t~pre1 := 1 + ~n~0;~n~0 := 1 + ~n~0;havoc #t~pre1; {2334#(<= main_~n~0 7)} is VALID [2020-07-29 01:18:23,047 INFO L280 TraceCheckUtils]: 34: Hoare triple {2334#(<= main_~n~0 7)} assume !(~n~0 < 10); {2323#false} is VALID [2020-07-29 01:18:23,047 INFO L280 TraceCheckUtils]: 35: Hoare triple {2323#false} #t~short4 := 0 <= ~i~0 && ~i~0 < 10; {2323#false} is VALID [2020-07-29 01:18:23,047 INFO L280 TraceCheckUtils]: 36: Hoare triple {2323#false} assume #t~short4; {2323#false} is VALID [2020-07-29 01:18:23,047 INFO L280 TraceCheckUtils]: 37: Hoare triple {2323#false} SUMMARY for call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); srcloc: L17-1 {2323#false} is VALID [2020-07-29 01:18:23,047 INFO L280 TraceCheckUtils]: 38: Hoare triple {2323#false} #t~short4 := #t~mem3 >= 0; {2323#false} is VALID [2020-07-29 01:18:23,048 INFO L280 TraceCheckUtils]: 39: Hoare triple {2323#false} assume !!#t~short4;havoc #t~mem3;havoc #t~short4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~i~0 := #t~nondet5;havoc #t~nondet5; {2323#false} is VALID [2020-07-29 01:18:23,048 INFO L280 TraceCheckUtils]: 40: Hoare triple {2323#false} assume !(4 + (~#a~0.offset + 4 * ~i~0) <= #length[~#a~0.base] && 0 <= ~#a~0.offset + 4 * ~i~0); {2323#false} is VALID [2020-07-29 01:18:23,050 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:18:23,050 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831550570] [2020-07-29 01:18:23,051 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1080885844] [2020-07-29 01:18:23,051 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 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:18:23,118 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-07-29 01:18:23,118 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-29 01:18:23,120 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 9 conjunts are in the unsatisfiable core [2020-07-29 01:18:23,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:18:23,138 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:18:23,377 INFO L263 TraceCheckUtils]: 0: Hoare triple {2322#true} call ULTIMATE.init(); {2322#true} is VALID [2020-07-29 01:18:23,377 INFO L280 TraceCheckUtils]: 1: Hoare triple {2322#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {2322#true} is VALID [2020-07-29 01:18:23,378 INFO L280 TraceCheckUtils]: 2: Hoare triple {2322#true} assume true; {2322#true} is VALID [2020-07-29 01:18:23,378 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2322#true} {2322#true} #52#return; {2322#true} is VALID [2020-07-29 01:18:23,379 INFO L263 TraceCheckUtils]: 4: Hoare triple {2322#true} call #t~ret6 := main(); {2322#true} is VALID [2020-07-29 01:18:23,380 INFO L280 TraceCheckUtils]: 5: Hoare triple {2322#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~i~0 := #t~nondet0;havoc #t~nondet0;call ~#a~0.base, ~#a~0.offset := #Ultimate.allocOnStack(40);~n~0 := 0; {2354#(<= main_~n~0 0)} is VALID [2020-07-29 01:18:23,381 INFO L280 TraceCheckUtils]: 6: Hoare triple {2354#(<= main_~n~0 0)} assume !!(~n~0 < 10);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {2354#(<= main_~n~0 0)} is VALID [2020-07-29 01:18:23,382 INFO L280 TraceCheckUtils]: 7: Hoare triple {2354#(<= main_~n~0 0)} SUMMARY for call write~int(#t~nondet2, ~#a~0.base, ~#a~0.offset + 4 * ~n~0, 4); srcloc: L14 {2354#(<= main_~n~0 0)} is VALID [2020-07-29 01:18:23,383 INFO L280 TraceCheckUtils]: 8: Hoare triple {2354#(<= main_~n~0 0)} havoc #t~nondet2; {2354#(<= main_~n~0 0)} is VALID [2020-07-29 01:18:23,384 INFO L280 TraceCheckUtils]: 9: Hoare triple {2354#(<= main_~n~0 0)} #t~pre1 := 1 + ~n~0;~n~0 := 1 + ~n~0;havoc #t~pre1; {2328#(<= main_~n~0 1)} is VALID [2020-07-29 01:18:23,385 INFO L280 TraceCheckUtils]: 10: Hoare triple {2328#(<= main_~n~0 1)} assume !!(~n~0 < 10);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {2328#(<= main_~n~0 1)} is VALID [2020-07-29 01:18:23,386 INFO L280 TraceCheckUtils]: 11: Hoare triple {2328#(<= main_~n~0 1)} SUMMARY for call write~int(#t~nondet2, ~#a~0.base, ~#a~0.offset + 4 * ~n~0, 4); srcloc: L14 {2328#(<= main_~n~0 1)} is VALID [2020-07-29 01:18:23,387 INFO L280 TraceCheckUtils]: 12: Hoare triple {2328#(<= main_~n~0 1)} havoc #t~nondet2; {2328#(<= main_~n~0 1)} is VALID [2020-07-29 01:18:23,388 INFO L280 TraceCheckUtils]: 13: Hoare triple {2328#(<= main_~n~0 1)} #t~pre1 := 1 + ~n~0;~n~0 := 1 + ~n~0;havoc #t~pre1; {2329#(<= main_~n~0 2)} is VALID [2020-07-29 01:18:23,389 INFO L280 TraceCheckUtils]: 14: Hoare triple {2329#(<= main_~n~0 2)} assume !!(~n~0 < 10);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {2329#(<= main_~n~0 2)} is VALID [2020-07-29 01:18:23,389 INFO L280 TraceCheckUtils]: 15: Hoare triple {2329#(<= main_~n~0 2)} SUMMARY for call write~int(#t~nondet2, ~#a~0.base, ~#a~0.offset + 4 * ~n~0, 4); srcloc: L14 {2329#(<= main_~n~0 2)} is VALID [2020-07-29 01:18:23,390 INFO L280 TraceCheckUtils]: 16: Hoare triple {2329#(<= main_~n~0 2)} havoc #t~nondet2; {2329#(<= main_~n~0 2)} is VALID [2020-07-29 01:18:23,391 INFO L280 TraceCheckUtils]: 17: Hoare triple {2329#(<= main_~n~0 2)} #t~pre1 := 1 + ~n~0;~n~0 := 1 + ~n~0;havoc #t~pre1; {2330#(<= main_~n~0 3)} is VALID [2020-07-29 01:18:23,392 INFO L280 TraceCheckUtils]: 18: Hoare triple {2330#(<= main_~n~0 3)} assume !!(~n~0 < 10);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {2330#(<= main_~n~0 3)} is VALID [2020-07-29 01:18:23,393 INFO L280 TraceCheckUtils]: 19: Hoare triple {2330#(<= main_~n~0 3)} SUMMARY for call write~int(#t~nondet2, ~#a~0.base, ~#a~0.offset + 4 * ~n~0, 4); srcloc: L14 {2330#(<= main_~n~0 3)} is VALID [2020-07-29 01:18:23,394 INFO L280 TraceCheckUtils]: 20: Hoare triple {2330#(<= main_~n~0 3)} havoc #t~nondet2; {2330#(<= main_~n~0 3)} is VALID [2020-07-29 01:18:23,395 INFO L280 TraceCheckUtils]: 21: Hoare triple {2330#(<= main_~n~0 3)} #t~pre1 := 1 + ~n~0;~n~0 := 1 + ~n~0;havoc #t~pre1; {2331#(<= main_~n~0 4)} is VALID [2020-07-29 01:18:23,395 INFO L280 TraceCheckUtils]: 22: Hoare triple {2331#(<= main_~n~0 4)} assume !!(~n~0 < 10);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {2331#(<= main_~n~0 4)} is VALID [2020-07-29 01:18:23,396 INFO L280 TraceCheckUtils]: 23: Hoare triple {2331#(<= main_~n~0 4)} SUMMARY for call write~int(#t~nondet2, ~#a~0.base, ~#a~0.offset + 4 * ~n~0, 4); srcloc: L14 {2331#(<= main_~n~0 4)} is VALID [2020-07-29 01:18:23,397 INFO L280 TraceCheckUtils]: 24: Hoare triple {2331#(<= main_~n~0 4)} havoc #t~nondet2; {2331#(<= main_~n~0 4)} is VALID [2020-07-29 01:18:23,398 INFO L280 TraceCheckUtils]: 25: Hoare triple {2331#(<= main_~n~0 4)} #t~pre1 := 1 + ~n~0;~n~0 := 1 + ~n~0;havoc #t~pre1; {2332#(<= main_~n~0 5)} is VALID [2020-07-29 01:18:23,399 INFO L280 TraceCheckUtils]: 26: Hoare triple {2332#(<= main_~n~0 5)} assume !!(~n~0 < 10);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {2332#(<= main_~n~0 5)} is VALID [2020-07-29 01:18:23,400 INFO L280 TraceCheckUtils]: 27: Hoare triple {2332#(<= main_~n~0 5)} SUMMARY for call write~int(#t~nondet2, ~#a~0.base, ~#a~0.offset + 4 * ~n~0, 4); srcloc: L14 {2332#(<= main_~n~0 5)} is VALID [2020-07-29 01:18:23,401 INFO L280 TraceCheckUtils]: 28: Hoare triple {2332#(<= main_~n~0 5)} havoc #t~nondet2; {2332#(<= main_~n~0 5)} is VALID [2020-07-29 01:18:23,403 INFO L280 TraceCheckUtils]: 29: Hoare triple {2332#(<= main_~n~0 5)} #t~pre1 := 1 + ~n~0;~n~0 := 1 + ~n~0;havoc #t~pre1; {2333#(<= main_~n~0 6)} is VALID [2020-07-29 01:18:23,404 INFO L280 TraceCheckUtils]: 30: Hoare triple {2333#(<= main_~n~0 6)} assume !!(~n~0 < 10);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {2333#(<= main_~n~0 6)} is VALID [2020-07-29 01:18:23,406 INFO L280 TraceCheckUtils]: 31: Hoare triple {2333#(<= main_~n~0 6)} SUMMARY for call write~int(#t~nondet2, ~#a~0.base, ~#a~0.offset + 4 * ~n~0, 4); srcloc: L14 {2333#(<= main_~n~0 6)} is VALID [2020-07-29 01:18:23,407 INFO L280 TraceCheckUtils]: 32: Hoare triple {2333#(<= main_~n~0 6)} havoc #t~nondet2; {2333#(<= main_~n~0 6)} is VALID [2020-07-29 01:18:23,409 INFO L280 TraceCheckUtils]: 33: Hoare triple {2333#(<= main_~n~0 6)} #t~pre1 := 1 + ~n~0;~n~0 := 1 + ~n~0;havoc #t~pre1; {2334#(<= main_~n~0 7)} is VALID [2020-07-29 01:18:23,411 INFO L280 TraceCheckUtils]: 34: Hoare triple {2334#(<= main_~n~0 7)} assume !(~n~0 < 10); {2323#false} is VALID [2020-07-29 01:18:23,412 INFO L280 TraceCheckUtils]: 35: Hoare triple {2323#false} #t~short4 := 0 <= ~i~0 && ~i~0 < 10; {2323#false} is VALID [2020-07-29 01:18:23,412 INFO L280 TraceCheckUtils]: 36: Hoare triple {2323#false} assume #t~short4; {2323#false} is VALID [2020-07-29 01:18:23,412 INFO L280 TraceCheckUtils]: 37: Hoare triple {2323#false} SUMMARY for call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); srcloc: L17-1 {2323#false} is VALID [2020-07-29 01:18:23,412 INFO L280 TraceCheckUtils]: 38: Hoare triple {2323#false} #t~short4 := #t~mem3 >= 0; {2323#false} is VALID [2020-07-29 01:18:23,413 INFO L280 TraceCheckUtils]: 39: Hoare triple {2323#false} assume !!#t~short4;havoc #t~mem3;havoc #t~short4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~i~0 := #t~nondet5;havoc #t~nondet5; {2323#false} is VALID [2020-07-29 01:18:23,413 INFO L280 TraceCheckUtils]: 40: Hoare triple {2323#false} assume !(4 + (~#a~0.offset + 4 * ~i~0) <= #length[~#a~0.base] && 0 <= ~#a~0.offset + 4 * ~i~0); {2323#false} is VALID [2020-07-29 01:18:23,416 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:18:23,417 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-29 01:18:23,417 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 12 [2020-07-29 01:18:23,418 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148107632] [2020-07-29 01:18:23,418 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 41 [2020-07-29 01:18:23,419 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:18:23,420 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2020-07-29 01:18:23,477 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:18:23,478 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-07-29 01:18:23,478 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:18:23,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-07-29 01:18:23,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-07-29 01:18:23,479 INFO L87 Difference]: Start difference. First operand 42 states and 43 transitions. Second operand 12 states. [2020-07-29 01:18:23,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:18:23,717 INFO L93 Difference]: Finished difference Result 49 states and 50 transitions. [2020-07-29 01:18:23,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-07-29 01:18:23,717 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 41 [2020-07-29 01:18:23,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:18:23,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-07-29 01:18:23,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 51 transitions. [2020-07-29 01:18:23,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-07-29 01:18:23,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 51 transitions. [2020-07-29 01:18:23,722 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 51 transitions. [2020-07-29 01:18:23,799 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:18:23,801 INFO L225 Difference]: With dead ends: 49 [2020-07-29 01:18:23,802 INFO L226 Difference]: Without dead ends: 49 [2020-07-29 01:18:23,802 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-07-29 01:18:23,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2020-07-29 01:18:23,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 46. [2020-07-29 01:18:23,810 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:18:23,810 INFO L82 GeneralOperation]: Start isEquivalent. First operand 49 states. Second operand 46 states. [2020-07-29 01:18:23,810 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand 46 states. [2020-07-29 01:18:23,810 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 46 states. [2020-07-29 01:18:23,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:18:23,812 INFO L93 Difference]: Finished difference Result 49 states and 50 transitions. [2020-07-29 01:18:23,812 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 50 transitions. [2020-07-29 01:18:23,813 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:18:23,813 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:18:23,813 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand 49 states. [2020-07-29 01:18:23,813 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 49 states. [2020-07-29 01:18:23,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:18:23,816 INFO L93 Difference]: Finished difference Result 49 states and 50 transitions. [2020-07-29 01:18:23,816 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 50 transitions. [2020-07-29 01:18:23,816 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:18:23,816 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:18:23,817 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:18:23,817 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:18:23,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2020-07-29 01:18:23,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 47 transitions. [2020-07-29 01:18:23,819 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 47 transitions. Word has length 41 [2020-07-29 01:18:23,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:18:23,820 INFO L479 AbstractCegarLoop]: Abstraction has 46 states and 47 transitions. [2020-07-29 01:18:23,820 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-07-29 01:18:23,820 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 47 transitions. [2020-07-29 01:18:23,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2020-07-29 01:18:23,823 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:18:23,823 INFO L422 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:18:24,037 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-29 01:18:24,038 INFO L427 AbstractCegarLoop]: === Iteration 14 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr6ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION]=== [2020-07-29 01:18:24,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:18:24,039 INFO L82 PathProgramCache]: Analyzing trace with hash 607436427, now seen corresponding path program 5 times [2020-07-29 01:18:24,040 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:18:24,040 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393440432] [2020-07-29 01:18:24,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:18:24,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:18:24,191 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-07-29 01:18:24,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:18:24,196 INFO L280 TraceCheckUtils]: 0: Hoare triple {2666#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {2652#true} is VALID [2020-07-29 01:18:24,196 INFO L280 TraceCheckUtils]: 1: Hoare triple {2652#true} assume true; {2652#true} is VALID [2020-07-29 01:18:24,196 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2652#true} {2652#true} #52#return; {2652#true} is VALID [2020-07-29 01:18:24,198 INFO L263 TraceCheckUtils]: 0: Hoare triple {2652#true} call ULTIMATE.init(); {2666#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-29 01:18:24,198 INFO L280 TraceCheckUtils]: 1: Hoare triple {2666#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {2652#true} is VALID [2020-07-29 01:18:24,198 INFO L280 TraceCheckUtils]: 2: Hoare triple {2652#true} assume true; {2652#true} is VALID [2020-07-29 01:18:24,198 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2652#true} {2652#true} #52#return; {2652#true} is VALID [2020-07-29 01:18:24,198 INFO L263 TraceCheckUtils]: 4: Hoare triple {2652#true} call #t~ret6 := main(); {2652#true} is VALID [2020-07-29 01:18:24,200 INFO L280 TraceCheckUtils]: 5: Hoare triple {2652#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~i~0 := #t~nondet0;havoc #t~nondet0;call ~#a~0.base, ~#a~0.offset := #Ultimate.allocOnStack(40);~n~0 := 0; {2657#(= 0 main_~n~0)} is VALID [2020-07-29 01:18:24,201 INFO L280 TraceCheckUtils]: 6: Hoare triple {2657#(= 0 main_~n~0)} assume !!(~n~0 < 10);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {2657#(= 0 main_~n~0)} is VALID [2020-07-29 01:18:24,201 INFO L280 TraceCheckUtils]: 7: Hoare triple {2657#(= 0 main_~n~0)} SUMMARY for call write~int(#t~nondet2, ~#a~0.base, ~#a~0.offset + 4 * ~n~0, 4); srcloc: L14 {2657#(= 0 main_~n~0)} is VALID [2020-07-29 01:18:24,202 INFO L280 TraceCheckUtils]: 8: Hoare triple {2657#(= 0 main_~n~0)} havoc #t~nondet2; {2657#(= 0 main_~n~0)} is VALID [2020-07-29 01:18:24,203 INFO L280 TraceCheckUtils]: 9: Hoare triple {2657#(= 0 main_~n~0)} #t~pre1 := 1 + ~n~0;~n~0 := 1 + ~n~0;havoc #t~pre1; {2658#(<= main_~n~0 1)} is VALID [2020-07-29 01:18:24,203 INFO L280 TraceCheckUtils]: 10: Hoare triple {2658#(<= main_~n~0 1)} assume !!(~n~0 < 10);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {2658#(<= main_~n~0 1)} is VALID [2020-07-29 01:18:24,204 INFO L280 TraceCheckUtils]: 11: Hoare triple {2658#(<= main_~n~0 1)} SUMMARY for call write~int(#t~nondet2, ~#a~0.base, ~#a~0.offset + 4 * ~n~0, 4); srcloc: L14 {2658#(<= main_~n~0 1)} is VALID [2020-07-29 01:18:24,205 INFO L280 TraceCheckUtils]: 12: Hoare triple {2658#(<= main_~n~0 1)} havoc #t~nondet2; {2658#(<= main_~n~0 1)} is VALID [2020-07-29 01:18:24,205 INFO L280 TraceCheckUtils]: 13: Hoare triple {2658#(<= main_~n~0 1)} #t~pre1 := 1 + ~n~0;~n~0 := 1 + ~n~0;havoc #t~pre1; {2659#(<= main_~n~0 2)} is VALID [2020-07-29 01:18:24,206 INFO L280 TraceCheckUtils]: 14: Hoare triple {2659#(<= main_~n~0 2)} assume !!(~n~0 < 10);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {2659#(<= main_~n~0 2)} is VALID [2020-07-29 01:18:24,207 INFO L280 TraceCheckUtils]: 15: Hoare triple {2659#(<= main_~n~0 2)} SUMMARY for call write~int(#t~nondet2, ~#a~0.base, ~#a~0.offset + 4 * ~n~0, 4); srcloc: L14 {2659#(<= main_~n~0 2)} is VALID [2020-07-29 01:18:24,207 INFO L280 TraceCheckUtils]: 16: Hoare triple {2659#(<= main_~n~0 2)} havoc #t~nondet2; {2659#(<= main_~n~0 2)} is VALID [2020-07-29 01:18:24,208 INFO L280 TraceCheckUtils]: 17: Hoare triple {2659#(<= main_~n~0 2)} #t~pre1 := 1 + ~n~0;~n~0 := 1 + ~n~0;havoc #t~pre1; {2660#(<= main_~n~0 3)} is VALID [2020-07-29 01:18:24,209 INFO L280 TraceCheckUtils]: 18: Hoare triple {2660#(<= main_~n~0 3)} assume !!(~n~0 < 10);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {2660#(<= main_~n~0 3)} is VALID [2020-07-29 01:18:24,210 INFO L280 TraceCheckUtils]: 19: Hoare triple {2660#(<= main_~n~0 3)} SUMMARY for call write~int(#t~nondet2, ~#a~0.base, ~#a~0.offset + 4 * ~n~0, 4); srcloc: L14 {2660#(<= main_~n~0 3)} is VALID [2020-07-29 01:18:24,210 INFO L280 TraceCheckUtils]: 20: Hoare triple {2660#(<= main_~n~0 3)} havoc #t~nondet2; {2660#(<= main_~n~0 3)} is VALID [2020-07-29 01:18:24,211 INFO L280 TraceCheckUtils]: 21: Hoare triple {2660#(<= main_~n~0 3)} #t~pre1 := 1 + ~n~0;~n~0 := 1 + ~n~0;havoc #t~pre1; {2661#(<= main_~n~0 4)} is VALID [2020-07-29 01:18:24,212 INFO L280 TraceCheckUtils]: 22: Hoare triple {2661#(<= main_~n~0 4)} assume !!(~n~0 < 10);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {2661#(<= main_~n~0 4)} is VALID [2020-07-29 01:18:24,213 INFO L280 TraceCheckUtils]: 23: Hoare triple {2661#(<= main_~n~0 4)} SUMMARY for call write~int(#t~nondet2, ~#a~0.base, ~#a~0.offset + 4 * ~n~0, 4); srcloc: L14 {2661#(<= main_~n~0 4)} is VALID [2020-07-29 01:18:24,214 INFO L280 TraceCheckUtils]: 24: Hoare triple {2661#(<= main_~n~0 4)} havoc #t~nondet2; {2661#(<= main_~n~0 4)} is VALID [2020-07-29 01:18:24,215 INFO L280 TraceCheckUtils]: 25: Hoare triple {2661#(<= main_~n~0 4)} #t~pre1 := 1 + ~n~0;~n~0 := 1 + ~n~0;havoc #t~pre1; {2662#(<= main_~n~0 5)} is VALID [2020-07-29 01:18:24,215 INFO L280 TraceCheckUtils]: 26: Hoare triple {2662#(<= main_~n~0 5)} assume !!(~n~0 < 10);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {2662#(<= main_~n~0 5)} is VALID [2020-07-29 01:18:24,216 INFO L280 TraceCheckUtils]: 27: Hoare triple {2662#(<= main_~n~0 5)} SUMMARY for call write~int(#t~nondet2, ~#a~0.base, ~#a~0.offset + 4 * ~n~0, 4); srcloc: L14 {2662#(<= main_~n~0 5)} is VALID [2020-07-29 01:18:24,217 INFO L280 TraceCheckUtils]: 28: Hoare triple {2662#(<= main_~n~0 5)} havoc #t~nondet2; {2662#(<= main_~n~0 5)} is VALID [2020-07-29 01:18:24,217 INFO L280 TraceCheckUtils]: 29: Hoare triple {2662#(<= main_~n~0 5)} #t~pre1 := 1 + ~n~0;~n~0 := 1 + ~n~0;havoc #t~pre1; {2663#(<= main_~n~0 6)} is VALID [2020-07-29 01:18:24,218 INFO L280 TraceCheckUtils]: 30: Hoare triple {2663#(<= main_~n~0 6)} assume !!(~n~0 < 10);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {2663#(<= main_~n~0 6)} is VALID [2020-07-29 01:18:24,219 INFO L280 TraceCheckUtils]: 31: Hoare triple {2663#(<= main_~n~0 6)} SUMMARY for call write~int(#t~nondet2, ~#a~0.base, ~#a~0.offset + 4 * ~n~0, 4); srcloc: L14 {2663#(<= main_~n~0 6)} is VALID [2020-07-29 01:18:24,219 INFO L280 TraceCheckUtils]: 32: Hoare triple {2663#(<= main_~n~0 6)} havoc #t~nondet2; {2663#(<= main_~n~0 6)} is VALID [2020-07-29 01:18:24,220 INFO L280 TraceCheckUtils]: 33: Hoare triple {2663#(<= main_~n~0 6)} #t~pre1 := 1 + ~n~0;~n~0 := 1 + ~n~0;havoc #t~pre1; {2664#(<= main_~n~0 7)} is VALID [2020-07-29 01:18:24,221 INFO L280 TraceCheckUtils]: 34: Hoare triple {2664#(<= main_~n~0 7)} assume !!(~n~0 < 10);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {2664#(<= main_~n~0 7)} is VALID [2020-07-29 01:18:24,221 INFO L280 TraceCheckUtils]: 35: Hoare triple {2664#(<= main_~n~0 7)} SUMMARY for call write~int(#t~nondet2, ~#a~0.base, ~#a~0.offset + 4 * ~n~0, 4); srcloc: L14 {2664#(<= main_~n~0 7)} is VALID [2020-07-29 01:18:24,222 INFO L280 TraceCheckUtils]: 36: Hoare triple {2664#(<= main_~n~0 7)} havoc #t~nondet2; {2664#(<= main_~n~0 7)} is VALID [2020-07-29 01:18:24,223 INFO L280 TraceCheckUtils]: 37: Hoare triple {2664#(<= main_~n~0 7)} #t~pre1 := 1 + ~n~0;~n~0 := 1 + ~n~0;havoc #t~pre1; {2665#(<= main_~n~0 8)} is VALID [2020-07-29 01:18:24,224 INFO L280 TraceCheckUtils]: 38: Hoare triple {2665#(<= main_~n~0 8)} assume !(~n~0 < 10); {2653#false} is VALID [2020-07-29 01:18:24,224 INFO L280 TraceCheckUtils]: 39: Hoare triple {2653#false} #t~short4 := 0 <= ~i~0 && ~i~0 < 10; {2653#false} is VALID [2020-07-29 01:18:24,225 INFO L280 TraceCheckUtils]: 40: Hoare triple {2653#false} assume #t~short4; {2653#false} is VALID [2020-07-29 01:18:24,225 INFO L280 TraceCheckUtils]: 41: Hoare triple {2653#false} SUMMARY for call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); srcloc: L17-1 {2653#false} is VALID [2020-07-29 01:18:24,225 INFO L280 TraceCheckUtils]: 42: Hoare triple {2653#false} #t~short4 := #t~mem3 >= 0; {2653#false} is VALID [2020-07-29 01:18:24,225 INFO L280 TraceCheckUtils]: 43: Hoare triple {2653#false} assume !!#t~short4;havoc #t~mem3;havoc #t~short4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~i~0 := #t~nondet5;havoc #t~nondet5; {2653#false} is VALID [2020-07-29 01:18:24,226 INFO L280 TraceCheckUtils]: 44: Hoare triple {2653#false} assume !(4 + (~#a~0.offset + 4 * ~i~0) <= #length[~#a~0.base] && 0 <= ~#a~0.offset + 4 * ~i~0); {2653#false} is VALID [2020-07-29 01:18:24,229 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:18:24,229 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393440432] [2020-07-29 01:18:24,229 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1225948870] [2020-07-29 01:18:24,229 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 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:18:24,293 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2020-07-29 01:18:24,293 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-29 01:18:24,295 INFO L263 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-29 01:18:24,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:18:24,307 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:18:24,547 INFO L263 TraceCheckUtils]: 0: Hoare triple {2652#true} call ULTIMATE.init(); {2652#true} is VALID [2020-07-29 01:18:24,547 INFO L280 TraceCheckUtils]: 1: Hoare triple {2652#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {2652#true} is VALID [2020-07-29 01:18:24,548 INFO L280 TraceCheckUtils]: 2: Hoare triple {2652#true} assume true; {2652#true} is VALID [2020-07-29 01:18:24,548 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2652#true} {2652#true} #52#return; {2652#true} is VALID [2020-07-29 01:18:24,549 INFO L263 TraceCheckUtils]: 4: Hoare triple {2652#true} call #t~ret6 := main(); {2652#true} is VALID [2020-07-29 01:18:24,550 INFO L280 TraceCheckUtils]: 5: Hoare triple {2652#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~i~0 := #t~nondet0;havoc #t~nondet0;call ~#a~0.base, ~#a~0.offset := #Ultimate.allocOnStack(40);~n~0 := 0; {2685#(<= main_~n~0 0)} is VALID [2020-07-29 01:18:24,550 INFO L280 TraceCheckUtils]: 6: Hoare triple {2685#(<= main_~n~0 0)} assume !!(~n~0 < 10);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {2685#(<= main_~n~0 0)} is VALID [2020-07-29 01:18:24,551 INFO L280 TraceCheckUtils]: 7: Hoare triple {2685#(<= main_~n~0 0)} SUMMARY for call write~int(#t~nondet2, ~#a~0.base, ~#a~0.offset + 4 * ~n~0, 4); srcloc: L14 {2685#(<= main_~n~0 0)} is VALID [2020-07-29 01:18:24,551 INFO L280 TraceCheckUtils]: 8: Hoare triple {2685#(<= main_~n~0 0)} havoc #t~nondet2; {2685#(<= main_~n~0 0)} is VALID [2020-07-29 01:18:24,552 INFO L280 TraceCheckUtils]: 9: Hoare triple {2685#(<= main_~n~0 0)} #t~pre1 := 1 + ~n~0;~n~0 := 1 + ~n~0;havoc #t~pre1; {2658#(<= main_~n~0 1)} is VALID [2020-07-29 01:18:24,552 INFO L280 TraceCheckUtils]: 10: Hoare triple {2658#(<= main_~n~0 1)} assume !!(~n~0 < 10);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {2658#(<= main_~n~0 1)} is VALID [2020-07-29 01:18:24,552 INFO L280 TraceCheckUtils]: 11: Hoare triple {2658#(<= main_~n~0 1)} SUMMARY for call write~int(#t~nondet2, ~#a~0.base, ~#a~0.offset + 4 * ~n~0, 4); srcloc: L14 {2658#(<= main_~n~0 1)} is VALID [2020-07-29 01:18:24,553 INFO L280 TraceCheckUtils]: 12: Hoare triple {2658#(<= main_~n~0 1)} havoc #t~nondet2; {2658#(<= main_~n~0 1)} is VALID [2020-07-29 01:18:24,553 INFO L280 TraceCheckUtils]: 13: Hoare triple {2658#(<= main_~n~0 1)} #t~pre1 := 1 + ~n~0;~n~0 := 1 + ~n~0;havoc #t~pre1; {2659#(<= main_~n~0 2)} is VALID [2020-07-29 01:18:24,554 INFO L280 TraceCheckUtils]: 14: Hoare triple {2659#(<= main_~n~0 2)} assume !!(~n~0 < 10);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {2659#(<= main_~n~0 2)} is VALID [2020-07-29 01:18:24,554 INFO L280 TraceCheckUtils]: 15: Hoare triple {2659#(<= main_~n~0 2)} SUMMARY for call write~int(#t~nondet2, ~#a~0.base, ~#a~0.offset + 4 * ~n~0, 4); srcloc: L14 {2659#(<= main_~n~0 2)} is VALID [2020-07-29 01:18:24,554 INFO L280 TraceCheckUtils]: 16: Hoare triple {2659#(<= main_~n~0 2)} havoc #t~nondet2; {2659#(<= main_~n~0 2)} is VALID [2020-07-29 01:18:24,555 INFO L280 TraceCheckUtils]: 17: Hoare triple {2659#(<= main_~n~0 2)} #t~pre1 := 1 + ~n~0;~n~0 := 1 + ~n~0;havoc #t~pre1; {2660#(<= main_~n~0 3)} is VALID [2020-07-29 01:18:24,555 INFO L280 TraceCheckUtils]: 18: Hoare triple {2660#(<= main_~n~0 3)} assume !!(~n~0 < 10);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {2660#(<= main_~n~0 3)} is VALID [2020-07-29 01:18:24,556 INFO L280 TraceCheckUtils]: 19: Hoare triple {2660#(<= main_~n~0 3)} SUMMARY for call write~int(#t~nondet2, ~#a~0.base, ~#a~0.offset + 4 * ~n~0, 4); srcloc: L14 {2660#(<= main_~n~0 3)} is VALID [2020-07-29 01:18:24,557 INFO L280 TraceCheckUtils]: 20: Hoare triple {2660#(<= main_~n~0 3)} havoc #t~nondet2; {2660#(<= main_~n~0 3)} is VALID [2020-07-29 01:18:24,561 INFO L280 TraceCheckUtils]: 21: Hoare triple {2660#(<= main_~n~0 3)} #t~pre1 := 1 + ~n~0;~n~0 := 1 + ~n~0;havoc #t~pre1; {2661#(<= main_~n~0 4)} is VALID [2020-07-29 01:18:24,566 INFO L280 TraceCheckUtils]: 22: Hoare triple {2661#(<= main_~n~0 4)} assume !!(~n~0 < 10);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {2661#(<= main_~n~0 4)} is VALID [2020-07-29 01:18:24,567 INFO L280 TraceCheckUtils]: 23: Hoare triple {2661#(<= main_~n~0 4)} SUMMARY for call write~int(#t~nondet2, ~#a~0.base, ~#a~0.offset + 4 * ~n~0, 4); srcloc: L14 {2661#(<= main_~n~0 4)} is VALID [2020-07-29 01:18:24,568 INFO L280 TraceCheckUtils]: 24: Hoare triple {2661#(<= main_~n~0 4)} havoc #t~nondet2; {2661#(<= main_~n~0 4)} is VALID [2020-07-29 01:18:24,568 INFO L280 TraceCheckUtils]: 25: Hoare triple {2661#(<= main_~n~0 4)} #t~pre1 := 1 + ~n~0;~n~0 := 1 + ~n~0;havoc #t~pre1; {2662#(<= main_~n~0 5)} is VALID [2020-07-29 01:18:24,569 INFO L280 TraceCheckUtils]: 26: Hoare triple {2662#(<= main_~n~0 5)} assume !!(~n~0 < 10);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {2662#(<= main_~n~0 5)} is VALID [2020-07-29 01:18:24,570 INFO L280 TraceCheckUtils]: 27: Hoare triple {2662#(<= main_~n~0 5)} SUMMARY for call write~int(#t~nondet2, ~#a~0.base, ~#a~0.offset + 4 * ~n~0, 4); srcloc: L14 {2662#(<= main_~n~0 5)} is VALID [2020-07-29 01:18:24,570 INFO L280 TraceCheckUtils]: 28: Hoare triple {2662#(<= main_~n~0 5)} havoc #t~nondet2; {2662#(<= main_~n~0 5)} is VALID [2020-07-29 01:18:24,571 INFO L280 TraceCheckUtils]: 29: Hoare triple {2662#(<= main_~n~0 5)} #t~pre1 := 1 + ~n~0;~n~0 := 1 + ~n~0;havoc #t~pre1; {2663#(<= main_~n~0 6)} is VALID [2020-07-29 01:18:24,571 INFO L280 TraceCheckUtils]: 30: Hoare triple {2663#(<= main_~n~0 6)} assume !!(~n~0 < 10);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {2663#(<= main_~n~0 6)} is VALID [2020-07-29 01:18:24,572 INFO L280 TraceCheckUtils]: 31: Hoare triple {2663#(<= main_~n~0 6)} SUMMARY for call write~int(#t~nondet2, ~#a~0.base, ~#a~0.offset + 4 * ~n~0, 4); srcloc: L14 {2663#(<= main_~n~0 6)} is VALID [2020-07-29 01:18:24,573 INFO L280 TraceCheckUtils]: 32: Hoare triple {2663#(<= main_~n~0 6)} havoc #t~nondet2; {2663#(<= main_~n~0 6)} is VALID [2020-07-29 01:18:24,573 INFO L280 TraceCheckUtils]: 33: Hoare triple {2663#(<= main_~n~0 6)} #t~pre1 := 1 + ~n~0;~n~0 := 1 + ~n~0;havoc #t~pre1; {2664#(<= main_~n~0 7)} is VALID [2020-07-29 01:18:24,574 INFO L280 TraceCheckUtils]: 34: Hoare triple {2664#(<= main_~n~0 7)} assume !!(~n~0 < 10);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {2664#(<= main_~n~0 7)} is VALID [2020-07-29 01:18:24,574 INFO L280 TraceCheckUtils]: 35: Hoare triple {2664#(<= main_~n~0 7)} SUMMARY for call write~int(#t~nondet2, ~#a~0.base, ~#a~0.offset + 4 * ~n~0, 4); srcloc: L14 {2664#(<= main_~n~0 7)} is VALID [2020-07-29 01:18:24,575 INFO L280 TraceCheckUtils]: 36: Hoare triple {2664#(<= main_~n~0 7)} havoc #t~nondet2; {2664#(<= main_~n~0 7)} is VALID [2020-07-29 01:18:24,576 INFO L280 TraceCheckUtils]: 37: Hoare triple {2664#(<= main_~n~0 7)} #t~pre1 := 1 + ~n~0;~n~0 := 1 + ~n~0;havoc #t~pre1; {2665#(<= main_~n~0 8)} is VALID [2020-07-29 01:18:24,577 INFO L280 TraceCheckUtils]: 38: Hoare triple {2665#(<= main_~n~0 8)} assume !(~n~0 < 10); {2653#false} is VALID [2020-07-29 01:18:24,577 INFO L280 TraceCheckUtils]: 39: Hoare triple {2653#false} #t~short4 := 0 <= ~i~0 && ~i~0 < 10; {2653#false} is VALID [2020-07-29 01:18:24,577 INFO L280 TraceCheckUtils]: 40: Hoare triple {2653#false} assume #t~short4; {2653#false} is VALID [2020-07-29 01:18:24,577 INFO L280 TraceCheckUtils]: 41: Hoare triple {2653#false} SUMMARY for call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); srcloc: L17-1 {2653#false} is VALID [2020-07-29 01:18:24,578 INFO L280 TraceCheckUtils]: 42: Hoare triple {2653#false} #t~short4 := #t~mem3 >= 0; {2653#false} is VALID [2020-07-29 01:18:24,578 INFO L280 TraceCheckUtils]: 43: Hoare triple {2653#false} assume !!#t~short4;havoc #t~mem3;havoc #t~short4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~i~0 := #t~nondet5;havoc #t~nondet5; {2653#false} is VALID [2020-07-29 01:18:24,578 INFO L280 TraceCheckUtils]: 44: Hoare triple {2653#false} assume !(4 + (~#a~0.offset + 4 * ~i~0) <= #length[~#a~0.base] && 0 <= ~#a~0.offset + 4 * ~i~0); {2653#false} is VALID [2020-07-29 01:18:24,580 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:18:24,580 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-29 01:18:24,580 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 13 [2020-07-29 01:18:24,580 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72848874] [2020-07-29 01:18:24,581 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 45 [2020-07-29 01:18:24,581 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:18:24,581 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2020-07-29 01:18:24,645 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:18:24,645 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-07-29 01:18:24,646 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:18:24,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-07-29 01:18:24,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-07-29 01:18:24,647 INFO L87 Difference]: Start difference. First operand 46 states and 47 transitions. Second operand 13 states. [2020-07-29 01:18:24,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:18:24,878 INFO L93 Difference]: Finished difference Result 53 states and 54 transitions. [2020-07-29 01:18:24,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-07-29 01:18:24,878 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 45 [2020-07-29 01:18:24,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:18:24,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-29 01:18:24,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 55 transitions. [2020-07-29 01:18:24,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-29 01:18:24,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 55 transitions. [2020-07-29 01:18:24,882 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 55 transitions. [2020-07-29 01:18:24,938 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:18:24,939 INFO L225 Difference]: With dead ends: 53 [2020-07-29 01:18:24,940 INFO L226 Difference]: Without dead ends: 53 [2020-07-29 01:18:24,942 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-07-29 01:18:24,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2020-07-29 01:18:24,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 50. [2020-07-29 01:18:24,945 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:18:24,945 INFO L82 GeneralOperation]: Start isEquivalent. First operand 53 states. Second operand 50 states. [2020-07-29 01:18:24,945 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand 50 states. [2020-07-29 01:18:24,948 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 50 states. [2020-07-29 01:18:24,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:18:24,950 INFO L93 Difference]: Finished difference Result 53 states and 54 transitions. [2020-07-29 01:18:24,950 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 54 transitions. [2020-07-29 01:18:24,950 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:18:24,950 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:18:24,951 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand 53 states. [2020-07-29 01:18:24,951 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 53 states. [2020-07-29 01:18:24,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:18:24,952 INFO L93 Difference]: Finished difference Result 53 states and 54 transitions. [2020-07-29 01:18:24,952 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 54 transitions. [2020-07-29 01:18:24,953 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:18:24,953 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:18:24,953 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:18:24,953 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:18:24,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2020-07-29 01:18:24,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 51 transitions. [2020-07-29 01:18:24,955 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 51 transitions. Word has length 45 [2020-07-29 01:18:24,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:18:24,955 INFO L479 AbstractCegarLoop]: Abstraction has 50 states and 51 transitions. [2020-07-29 01:18:24,956 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-07-29 01:18:24,956 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 51 transitions. [2020-07-29 01:18:24,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2020-07-29 01:18:24,956 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:18:24,957 INFO L422 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:18:25,169 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-29 01:18:25,170 INFO L427 AbstractCegarLoop]: === Iteration 15 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr6ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION]=== [2020-07-29 01:18:25,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:18:25,170 INFO L82 PathProgramCache]: Analyzing trace with hash 228291112, now seen corresponding path program 6 times [2020-07-29 01:18:25,170 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:18:25,171 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806022641] [2020-07-29 01:18:25,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:18:25,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:18:25,331 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-07-29 01:18:25,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:18:25,337 INFO L280 TraceCheckUtils]: 0: Hoare triple {3026#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {3011#true} is VALID [2020-07-29 01:18:25,337 INFO L280 TraceCheckUtils]: 1: Hoare triple {3011#true} assume true; {3011#true} is VALID [2020-07-29 01:18:25,337 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {3011#true} {3011#true} #52#return; {3011#true} is VALID [2020-07-29 01:18:25,341 INFO L263 TraceCheckUtils]: 0: Hoare triple {3011#true} call ULTIMATE.init(); {3026#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-29 01:18:25,341 INFO L280 TraceCheckUtils]: 1: Hoare triple {3026#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {3011#true} is VALID [2020-07-29 01:18:25,341 INFO L280 TraceCheckUtils]: 2: Hoare triple {3011#true} assume true; {3011#true} is VALID [2020-07-29 01:18:25,342 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {3011#true} {3011#true} #52#return; {3011#true} is VALID [2020-07-29 01:18:25,342 INFO L263 TraceCheckUtils]: 4: Hoare triple {3011#true} call #t~ret6 := main(); {3011#true} is VALID [2020-07-29 01:18:25,343 INFO L280 TraceCheckUtils]: 5: Hoare triple {3011#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~i~0 := #t~nondet0;havoc #t~nondet0;call ~#a~0.base, ~#a~0.offset := #Ultimate.allocOnStack(40);~n~0 := 0; {3016#(= 0 main_~n~0)} is VALID [2020-07-29 01:18:25,344 INFO L280 TraceCheckUtils]: 6: Hoare triple {3016#(= 0 main_~n~0)} assume !!(~n~0 < 10);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {3016#(= 0 main_~n~0)} is VALID [2020-07-29 01:18:25,344 INFO L280 TraceCheckUtils]: 7: Hoare triple {3016#(= 0 main_~n~0)} SUMMARY for call write~int(#t~nondet2, ~#a~0.base, ~#a~0.offset + 4 * ~n~0, 4); srcloc: L14 {3016#(= 0 main_~n~0)} is VALID [2020-07-29 01:18:25,345 INFO L280 TraceCheckUtils]: 8: Hoare triple {3016#(= 0 main_~n~0)} havoc #t~nondet2; {3016#(= 0 main_~n~0)} is VALID [2020-07-29 01:18:25,346 INFO L280 TraceCheckUtils]: 9: Hoare triple {3016#(= 0 main_~n~0)} #t~pre1 := 1 + ~n~0;~n~0 := 1 + ~n~0;havoc #t~pre1; {3017#(<= main_~n~0 1)} is VALID [2020-07-29 01:18:25,346 INFO L280 TraceCheckUtils]: 10: Hoare triple {3017#(<= main_~n~0 1)} assume !!(~n~0 < 10);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {3017#(<= main_~n~0 1)} is VALID [2020-07-29 01:18:25,347 INFO L280 TraceCheckUtils]: 11: Hoare triple {3017#(<= main_~n~0 1)} SUMMARY for call write~int(#t~nondet2, ~#a~0.base, ~#a~0.offset + 4 * ~n~0, 4); srcloc: L14 {3017#(<= main_~n~0 1)} is VALID [2020-07-29 01:18:25,348 INFO L280 TraceCheckUtils]: 12: Hoare triple {3017#(<= main_~n~0 1)} havoc #t~nondet2; {3017#(<= main_~n~0 1)} is VALID [2020-07-29 01:18:25,348 INFO L280 TraceCheckUtils]: 13: Hoare triple {3017#(<= main_~n~0 1)} #t~pre1 := 1 + ~n~0;~n~0 := 1 + ~n~0;havoc #t~pre1; {3018#(<= main_~n~0 2)} is VALID [2020-07-29 01:18:25,349 INFO L280 TraceCheckUtils]: 14: Hoare triple {3018#(<= main_~n~0 2)} assume !!(~n~0 < 10);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {3018#(<= main_~n~0 2)} is VALID [2020-07-29 01:18:25,350 INFO L280 TraceCheckUtils]: 15: Hoare triple {3018#(<= main_~n~0 2)} SUMMARY for call write~int(#t~nondet2, ~#a~0.base, ~#a~0.offset + 4 * ~n~0, 4); srcloc: L14 {3018#(<= main_~n~0 2)} is VALID [2020-07-29 01:18:25,350 INFO L280 TraceCheckUtils]: 16: Hoare triple {3018#(<= main_~n~0 2)} havoc #t~nondet2; {3018#(<= main_~n~0 2)} is VALID [2020-07-29 01:18:25,351 INFO L280 TraceCheckUtils]: 17: Hoare triple {3018#(<= main_~n~0 2)} #t~pre1 := 1 + ~n~0;~n~0 := 1 + ~n~0;havoc #t~pre1; {3019#(<= main_~n~0 3)} is VALID [2020-07-29 01:18:25,352 INFO L280 TraceCheckUtils]: 18: Hoare triple {3019#(<= main_~n~0 3)} assume !!(~n~0 < 10);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {3019#(<= main_~n~0 3)} is VALID [2020-07-29 01:18:25,353 INFO L280 TraceCheckUtils]: 19: Hoare triple {3019#(<= main_~n~0 3)} SUMMARY for call write~int(#t~nondet2, ~#a~0.base, ~#a~0.offset + 4 * ~n~0, 4); srcloc: L14 {3019#(<= main_~n~0 3)} is VALID [2020-07-29 01:18:25,353 INFO L280 TraceCheckUtils]: 20: Hoare triple {3019#(<= main_~n~0 3)} havoc #t~nondet2; {3019#(<= main_~n~0 3)} is VALID [2020-07-29 01:18:25,354 INFO L280 TraceCheckUtils]: 21: Hoare triple {3019#(<= main_~n~0 3)} #t~pre1 := 1 + ~n~0;~n~0 := 1 + ~n~0;havoc #t~pre1; {3020#(<= main_~n~0 4)} is VALID [2020-07-29 01:18:25,354 INFO L280 TraceCheckUtils]: 22: Hoare triple {3020#(<= main_~n~0 4)} assume !!(~n~0 < 10);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {3020#(<= main_~n~0 4)} is VALID [2020-07-29 01:18:25,355 INFO L280 TraceCheckUtils]: 23: Hoare triple {3020#(<= main_~n~0 4)} SUMMARY for call write~int(#t~nondet2, ~#a~0.base, ~#a~0.offset + 4 * ~n~0, 4); srcloc: L14 {3020#(<= main_~n~0 4)} is VALID [2020-07-29 01:18:25,355 INFO L280 TraceCheckUtils]: 24: Hoare triple {3020#(<= main_~n~0 4)} havoc #t~nondet2; {3020#(<= main_~n~0 4)} is VALID [2020-07-29 01:18:25,356 INFO L280 TraceCheckUtils]: 25: Hoare triple {3020#(<= main_~n~0 4)} #t~pre1 := 1 + ~n~0;~n~0 := 1 + ~n~0;havoc #t~pre1; {3021#(<= main_~n~0 5)} is VALID [2020-07-29 01:18:25,357 INFO L280 TraceCheckUtils]: 26: Hoare triple {3021#(<= main_~n~0 5)} assume !!(~n~0 < 10);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {3021#(<= main_~n~0 5)} is VALID [2020-07-29 01:18:25,357 INFO L280 TraceCheckUtils]: 27: Hoare triple {3021#(<= main_~n~0 5)} SUMMARY for call write~int(#t~nondet2, ~#a~0.base, ~#a~0.offset + 4 * ~n~0, 4); srcloc: L14 {3021#(<= main_~n~0 5)} is VALID [2020-07-29 01:18:25,358 INFO L280 TraceCheckUtils]: 28: Hoare triple {3021#(<= main_~n~0 5)} havoc #t~nondet2; {3021#(<= main_~n~0 5)} is VALID [2020-07-29 01:18:25,358 INFO L280 TraceCheckUtils]: 29: Hoare triple {3021#(<= main_~n~0 5)} #t~pre1 := 1 + ~n~0;~n~0 := 1 + ~n~0;havoc #t~pre1; {3022#(<= main_~n~0 6)} is VALID [2020-07-29 01:18:25,359 INFO L280 TraceCheckUtils]: 30: Hoare triple {3022#(<= main_~n~0 6)} assume !!(~n~0 < 10);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {3022#(<= main_~n~0 6)} is VALID [2020-07-29 01:18:25,360 INFO L280 TraceCheckUtils]: 31: Hoare triple {3022#(<= main_~n~0 6)} SUMMARY for call write~int(#t~nondet2, ~#a~0.base, ~#a~0.offset + 4 * ~n~0, 4); srcloc: L14 {3022#(<= main_~n~0 6)} is VALID [2020-07-29 01:18:25,360 INFO L280 TraceCheckUtils]: 32: Hoare triple {3022#(<= main_~n~0 6)} havoc #t~nondet2; {3022#(<= main_~n~0 6)} is VALID [2020-07-29 01:18:25,361 INFO L280 TraceCheckUtils]: 33: Hoare triple {3022#(<= main_~n~0 6)} #t~pre1 := 1 + ~n~0;~n~0 := 1 + ~n~0;havoc #t~pre1; {3023#(<= main_~n~0 7)} is VALID [2020-07-29 01:18:25,362 INFO L280 TraceCheckUtils]: 34: Hoare triple {3023#(<= main_~n~0 7)} assume !!(~n~0 < 10);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {3023#(<= main_~n~0 7)} is VALID [2020-07-29 01:18:25,362 INFO L280 TraceCheckUtils]: 35: Hoare triple {3023#(<= main_~n~0 7)} SUMMARY for call write~int(#t~nondet2, ~#a~0.base, ~#a~0.offset + 4 * ~n~0, 4); srcloc: L14 {3023#(<= main_~n~0 7)} is VALID [2020-07-29 01:18:25,363 INFO L280 TraceCheckUtils]: 36: Hoare triple {3023#(<= main_~n~0 7)} havoc #t~nondet2; {3023#(<= main_~n~0 7)} is VALID [2020-07-29 01:18:25,364 INFO L280 TraceCheckUtils]: 37: Hoare triple {3023#(<= main_~n~0 7)} #t~pre1 := 1 + ~n~0;~n~0 := 1 + ~n~0;havoc #t~pre1; {3024#(<= main_~n~0 8)} is VALID [2020-07-29 01:18:25,364 INFO L280 TraceCheckUtils]: 38: Hoare triple {3024#(<= main_~n~0 8)} assume !!(~n~0 < 10);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {3024#(<= main_~n~0 8)} is VALID [2020-07-29 01:18:25,365 INFO L280 TraceCheckUtils]: 39: Hoare triple {3024#(<= main_~n~0 8)} SUMMARY for call write~int(#t~nondet2, ~#a~0.base, ~#a~0.offset + 4 * ~n~0, 4); srcloc: L14 {3024#(<= main_~n~0 8)} is VALID [2020-07-29 01:18:25,366 INFO L280 TraceCheckUtils]: 40: Hoare triple {3024#(<= main_~n~0 8)} havoc #t~nondet2; {3024#(<= main_~n~0 8)} is VALID [2020-07-29 01:18:25,366 INFO L280 TraceCheckUtils]: 41: Hoare triple {3024#(<= main_~n~0 8)} #t~pre1 := 1 + ~n~0;~n~0 := 1 + ~n~0;havoc #t~pre1; {3025#(<= main_~n~0 9)} is VALID [2020-07-29 01:18:25,367 INFO L280 TraceCheckUtils]: 42: Hoare triple {3025#(<= main_~n~0 9)} assume !(~n~0 < 10); {3012#false} is VALID [2020-07-29 01:18:25,367 INFO L280 TraceCheckUtils]: 43: Hoare triple {3012#false} #t~short4 := 0 <= ~i~0 && ~i~0 < 10; {3012#false} is VALID [2020-07-29 01:18:25,367 INFO L280 TraceCheckUtils]: 44: Hoare triple {3012#false} assume #t~short4; {3012#false} is VALID [2020-07-29 01:18:25,368 INFO L280 TraceCheckUtils]: 45: Hoare triple {3012#false} SUMMARY for call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); srcloc: L17-1 {3012#false} is VALID [2020-07-29 01:18:25,368 INFO L280 TraceCheckUtils]: 46: Hoare triple {3012#false} #t~short4 := #t~mem3 >= 0; {3012#false} is VALID [2020-07-29 01:18:25,368 INFO L280 TraceCheckUtils]: 47: Hoare triple {3012#false} assume !!#t~short4;havoc #t~mem3;havoc #t~short4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~i~0 := #t~nondet5;havoc #t~nondet5; {3012#false} is VALID [2020-07-29 01:18:25,368 INFO L280 TraceCheckUtils]: 48: Hoare triple {3012#false} assume !(4 + (~#a~0.offset + 4 * ~i~0) <= #length[~#a~0.base] && 0 <= ~#a~0.offset + 4 * ~i~0); {3012#false} is VALID [2020-07-29 01:18:25,371 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:18:25,371 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806022641] [2020-07-29 01:18:25,371 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [863775165] [2020-07-29 01:18:25,371 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 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-29 01:18:25,491 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2020-07-29 01:18:25,491 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-29 01:18:25,493 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 11 conjunts are in the unsatisfiable core [2020-07-29 01:18:25,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:18:25,520 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:18:25,812 INFO L263 TraceCheckUtils]: 0: Hoare triple {3011#true} call ULTIMATE.init(); {3011#true} is VALID [2020-07-29 01:18:25,812 INFO L280 TraceCheckUtils]: 1: Hoare triple {3011#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {3011#true} is VALID [2020-07-29 01:18:25,813 INFO L280 TraceCheckUtils]: 2: Hoare triple {3011#true} assume true; {3011#true} is VALID [2020-07-29 01:18:25,813 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {3011#true} {3011#true} #52#return; {3011#true} is VALID [2020-07-29 01:18:25,813 INFO L263 TraceCheckUtils]: 4: Hoare triple {3011#true} call #t~ret6 := main(); {3011#true} is VALID [2020-07-29 01:18:25,814 INFO L280 TraceCheckUtils]: 5: Hoare triple {3011#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~i~0 := #t~nondet0;havoc #t~nondet0;call ~#a~0.base, ~#a~0.offset := #Ultimate.allocOnStack(40);~n~0 := 0; {3045#(<= main_~n~0 0)} is VALID [2020-07-29 01:18:25,815 INFO L280 TraceCheckUtils]: 6: Hoare triple {3045#(<= main_~n~0 0)} assume !!(~n~0 < 10);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {3045#(<= main_~n~0 0)} is VALID [2020-07-29 01:18:25,815 INFO L280 TraceCheckUtils]: 7: Hoare triple {3045#(<= main_~n~0 0)} SUMMARY for call write~int(#t~nondet2, ~#a~0.base, ~#a~0.offset + 4 * ~n~0, 4); srcloc: L14 {3045#(<= main_~n~0 0)} is VALID [2020-07-29 01:18:25,816 INFO L280 TraceCheckUtils]: 8: Hoare triple {3045#(<= main_~n~0 0)} havoc #t~nondet2; {3045#(<= main_~n~0 0)} is VALID [2020-07-29 01:18:25,816 INFO L280 TraceCheckUtils]: 9: Hoare triple {3045#(<= main_~n~0 0)} #t~pre1 := 1 + ~n~0;~n~0 := 1 + ~n~0;havoc #t~pre1; {3017#(<= main_~n~0 1)} is VALID [2020-07-29 01:18:25,817 INFO L280 TraceCheckUtils]: 10: Hoare triple {3017#(<= main_~n~0 1)} assume !!(~n~0 < 10);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {3017#(<= main_~n~0 1)} is VALID [2020-07-29 01:18:25,818 INFO L280 TraceCheckUtils]: 11: Hoare triple {3017#(<= main_~n~0 1)} SUMMARY for call write~int(#t~nondet2, ~#a~0.base, ~#a~0.offset + 4 * ~n~0, 4); srcloc: L14 {3017#(<= main_~n~0 1)} is VALID [2020-07-29 01:18:25,818 INFO L280 TraceCheckUtils]: 12: Hoare triple {3017#(<= main_~n~0 1)} havoc #t~nondet2; {3017#(<= main_~n~0 1)} is VALID [2020-07-29 01:18:25,819 INFO L280 TraceCheckUtils]: 13: Hoare triple {3017#(<= main_~n~0 1)} #t~pre1 := 1 + ~n~0;~n~0 := 1 + ~n~0;havoc #t~pre1; {3018#(<= main_~n~0 2)} is VALID [2020-07-29 01:18:25,820 INFO L280 TraceCheckUtils]: 14: Hoare triple {3018#(<= main_~n~0 2)} assume !!(~n~0 < 10);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {3018#(<= main_~n~0 2)} is VALID [2020-07-29 01:18:25,820 INFO L280 TraceCheckUtils]: 15: Hoare triple {3018#(<= main_~n~0 2)} SUMMARY for call write~int(#t~nondet2, ~#a~0.base, ~#a~0.offset + 4 * ~n~0, 4); srcloc: L14 {3018#(<= main_~n~0 2)} is VALID [2020-07-29 01:18:25,821 INFO L280 TraceCheckUtils]: 16: Hoare triple {3018#(<= main_~n~0 2)} havoc #t~nondet2; {3018#(<= main_~n~0 2)} is VALID [2020-07-29 01:18:25,821 INFO L280 TraceCheckUtils]: 17: Hoare triple {3018#(<= main_~n~0 2)} #t~pre1 := 1 + ~n~0;~n~0 := 1 + ~n~0;havoc #t~pre1; {3019#(<= main_~n~0 3)} is VALID [2020-07-29 01:18:25,822 INFO L280 TraceCheckUtils]: 18: Hoare triple {3019#(<= main_~n~0 3)} assume !!(~n~0 < 10);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {3019#(<= main_~n~0 3)} is VALID [2020-07-29 01:18:25,822 INFO L280 TraceCheckUtils]: 19: Hoare triple {3019#(<= main_~n~0 3)} SUMMARY for call write~int(#t~nondet2, ~#a~0.base, ~#a~0.offset + 4 * ~n~0, 4); srcloc: L14 {3019#(<= main_~n~0 3)} is VALID [2020-07-29 01:18:25,823 INFO L280 TraceCheckUtils]: 20: Hoare triple {3019#(<= main_~n~0 3)} havoc #t~nondet2; {3019#(<= main_~n~0 3)} is VALID [2020-07-29 01:18:25,824 INFO L280 TraceCheckUtils]: 21: Hoare triple {3019#(<= main_~n~0 3)} #t~pre1 := 1 + ~n~0;~n~0 := 1 + ~n~0;havoc #t~pre1; {3020#(<= main_~n~0 4)} is VALID [2020-07-29 01:18:25,825 INFO L280 TraceCheckUtils]: 22: Hoare triple {3020#(<= main_~n~0 4)} assume !!(~n~0 < 10);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {3020#(<= main_~n~0 4)} is VALID [2020-07-29 01:18:25,825 INFO L280 TraceCheckUtils]: 23: Hoare triple {3020#(<= main_~n~0 4)} SUMMARY for call write~int(#t~nondet2, ~#a~0.base, ~#a~0.offset + 4 * ~n~0, 4); srcloc: L14 {3020#(<= main_~n~0 4)} is VALID [2020-07-29 01:18:25,826 INFO L280 TraceCheckUtils]: 24: Hoare triple {3020#(<= main_~n~0 4)} havoc #t~nondet2; {3020#(<= main_~n~0 4)} is VALID [2020-07-29 01:18:25,827 INFO L280 TraceCheckUtils]: 25: Hoare triple {3020#(<= main_~n~0 4)} #t~pre1 := 1 + ~n~0;~n~0 := 1 + ~n~0;havoc #t~pre1; {3021#(<= main_~n~0 5)} is VALID [2020-07-29 01:18:25,827 INFO L280 TraceCheckUtils]: 26: Hoare triple {3021#(<= main_~n~0 5)} assume !!(~n~0 < 10);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {3021#(<= main_~n~0 5)} is VALID [2020-07-29 01:18:25,828 INFO L280 TraceCheckUtils]: 27: Hoare triple {3021#(<= main_~n~0 5)} SUMMARY for call write~int(#t~nondet2, ~#a~0.base, ~#a~0.offset + 4 * ~n~0, 4); srcloc: L14 {3021#(<= main_~n~0 5)} is VALID [2020-07-29 01:18:25,829 INFO L280 TraceCheckUtils]: 28: Hoare triple {3021#(<= main_~n~0 5)} havoc #t~nondet2; {3021#(<= main_~n~0 5)} is VALID [2020-07-29 01:18:25,829 INFO L280 TraceCheckUtils]: 29: Hoare triple {3021#(<= main_~n~0 5)} #t~pre1 := 1 + ~n~0;~n~0 := 1 + ~n~0;havoc #t~pre1; {3022#(<= main_~n~0 6)} is VALID [2020-07-29 01:18:25,830 INFO L280 TraceCheckUtils]: 30: Hoare triple {3022#(<= main_~n~0 6)} assume !!(~n~0 < 10);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {3022#(<= main_~n~0 6)} is VALID [2020-07-29 01:18:25,831 INFO L280 TraceCheckUtils]: 31: Hoare triple {3022#(<= main_~n~0 6)} SUMMARY for call write~int(#t~nondet2, ~#a~0.base, ~#a~0.offset + 4 * ~n~0, 4); srcloc: L14 {3022#(<= main_~n~0 6)} is VALID [2020-07-29 01:18:25,831 INFO L280 TraceCheckUtils]: 32: Hoare triple {3022#(<= main_~n~0 6)} havoc #t~nondet2; {3022#(<= main_~n~0 6)} is VALID [2020-07-29 01:18:25,832 INFO L280 TraceCheckUtils]: 33: Hoare triple {3022#(<= main_~n~0 6)} #t~pre1 := 1 + ~n~0;~n~0 := 1 + ~n~0;havoc #t~pre1; {3023#(<= main_~n~0 7)} is VALID [2020-07-29 01:18:25,833 INFO L280 TraceCheckUtils]: 34: Hoare triple {3023#(<= main_~n~0 7)} assume !!(~n~0 < 10);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {3023#(<= main_~n~0 7)} is VALID [2020-07-29 01:18:25,834 INFO L280 TraceCheckUtils]: 35: Hoare triple {3023#(<= main_~n~0 7)} SUMMARY for call write~int(#t~nondet2, ~#a~0.base, ~#a~0.offset + 4 * ~n~0, 4); srcloc: L14 {3023#(<= main_~n~0 7)} is VALID [2020-07-29 01:18:25,834 INFO L280 TraceCheckUtils]: 36: Hoare triple {3023#(<= main_~n~0 7)} havoc #t~nondet2; {3023#(<= main_~n~0 7)} is VALID [2020-07-29 01:18:25,835 INFO L280 TraceCheckUtils]: 37: Hoare triple {3023#(<= main_~n~0 7)} #t~pre1 := 1 + ~n~0;~n~0 := 1 + ~n~0;havoc #t~pre1; {3024#(<= main_~n~0 8)} is VALID [2020-07-29 01:18:25,836 INFO L280 TraceCheckUtils]: 38: Hoare triple {3024#(<= main_~n~0 8)} assume !!(~n~0 < 10);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {3024#(<= main_~n~0 8)} is VALID [2020-07-29 01:18:25,836 INFO L280 TraceCheckUtils]: 39: Hoare triple {3024#(<= main_~n~0 8)} SUMMARY for call write~int(#t~nondet2, ~#a~0.base, ~#a~0.offset + 4 * ~n~0, 4); srcloc: L14 {3024#(<= main_~n~0 8)} is VALID [2020-07-29 01:18:25,837 INFO L280 TraceCheckUtils]: 40: Hoare triple {3024#(<= main_~n~0 8)} havoc #t~nondet2; {3024#(<= main_~n~0 8)} is VALID [2020-07-29 01:18:25,838 INFO L280 TraceCheckUtils]: 41: Hoare triple {3024#(<= main_~n~0 8)} #t~pre1 := 1 + ~n~0;~n~0 := 1 + ~n~0;havoc #t~pre1; {3025#(<= main_~n~0 9)} is VALID [2020-07-29 01:18:25,838 INFO L280 TraceCheckUtils]: 42: Hoare triple {3025#(<= main_~n~0 9)} assume !(~n~0 < 10); {3012#false} is VALID [2020-07-29 01:18:25,839 INFO L280 TraceCheckUtils]: 43: Hoare triple {3012#false} #t~short4 := 0 <= ~i~0 && ~i~0 < 10; {3012#false} is VALID [2020-07-29 01:18:25,839 INFO L280 TraceCheckUtils]: 44: Hoare triple {3012#false} assume #t~short4; {3012#false} is VALID [2020-07-29 01:18:25,839 INFO L280 TraceCheckUtils]: 45: Hoare triple {3012#false} SUMMARY for call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); srcloc: L17-1 {3012#false} is VALID [2020-07-29 01:18:25,839 INFO L280 TraceCheckUtils]: 46: Hoare triple {3012#false} #t~short4 := #t~mem3 >= 0; {3012#false} is VALID [2020-07-29 01:18:25,839 INFO L280 TraceCheckUtils]: 47: Hoare triple {3012#false} assume !!#t~short4;havoc #t~mem3;havoc #t~short4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~i~0 := #t~nondet5;havoc #t~nondet5; {3012#false} is VALID [2020-07-29 01:18:25,839 INFO L280 TraceCheckUtils]: 48: Hoare triple {3012#false} assume !(4 + (~#a~0.offset + 4 * ~i~0) <= #length[~#a~0.base] && 0 <= ~#a~0.offset + 4 * ~i~0); {3012#false} is VALID [2020-07-29 01:18:25,842 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:18:25,843 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-29 01:18:25,843 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 14 [2020-07-29 01:18:25,843 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409198266] [2020-07-29 01:18:25,844 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 49 [2020-07-29 01:18:25,844 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:18:25,845 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2020-07-29 01:18:25,899 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:18:25,899 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-07-29 01:18:25,900 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:18:25,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-07-29 01:18:25,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=102, Unknown=0, NotChecked=0, Total=182 [2020-07-29 01:18:25,900 INFO L87 Difference]: Start difference. First operand 50 states and 51 transitions. Second operand 14 states. [2020-07-29 01:18:26,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:18:26,045 INFO L93 Difference]: Finished difference Result 54 states and 55 transitions. [2020-07-29 01:18:26,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-07-29 01:18:26,046 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 49 [2020-07-29 01:18:26,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:18:26,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-07-29 01:18:26,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 56 transitions. [2020-07-29 01:18:26,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-07-29 01:18:26,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 56 transitions. [2020-07-29 01:18:26,050 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 56 transitions. [2020-07-29 01:18:26,121 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:18:26,122 INFO L225 Difference]: With dead ends: 54 [2020-07-29 01:18:26,123 INFO L226 Difference]: Without dead ends: 54 [2020-07-29 01:18:26,123 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=80, Invalid=102, Unknown=0, NotChecked=0, Total=182 [2020-07-29 01:18:26,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2020-07-29 01:18:26,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2020-07-29 01:18:26,126 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:18:26,127 INFO L82 GeneralOperation]: Start isEquivalent. First operand 54 states. Second operand 54 states. [2020-07-29 01:18:26,127 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand 54 states. [2020-07-29 01:18:26,127 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 54 states. [2020-07-29 01:18:26,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:18:26,129 INFO L93 Difference]: Finished difference Result 54 states and 55 transitions. [2020-07-29 01:18:26,129 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 55 transitions. [2020-07-29 01:18:26,129 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:18:26,130 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:18:26,130 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand 54 states. [2020-07-29 01:18:26,130 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 54 states. [2020-07-29 01:18:26,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:18:26,132 INFO L93 Difference]: Finished difference Result 54 states and 55 transitions. [2020-07-29 01:18:26,132 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 55 transitions. [2020-07-29 01:18:26,132 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:18:26,132 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:18:26,133 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:18:26,133 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:18:26,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2020-07-29 01:18:26,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 55 transitions. [2020-07-29 01:18:26,134 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 55 transitions. Word has length 49 [2020-07-29 01:18:26,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:18:26,135 INFO L479 AbstractCegarLoop]: Abstraction has 54 states and 55 transitions. [2020-07-29 01:18:26,135 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-07-29 01:18:26,135 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 55 transitions. [2020-07-29 01:18:26,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2020-07-29 01:18:26,136 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:18:26,136 INFO L422 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:18:26,350 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2020-07-29 01:18:26,351 INFO L427 AbstractCegarLoop]: === Iteration 16 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr6ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION]=== [2020-07-29 01:18:26,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:18:26,351 INFO L82 PathProgramCache]: Analyzing trace with hash -1223356603, now seen corresponding path program 7 times [2020-07-29 01:18:26,351 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:18:26,351 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876355036] [2020-07-29 01:18:26,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:18:26,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:18:26,384 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:18:26,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:18:26,410 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:18:26,435 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:18:26,436 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-29 01:18:26,436 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-07-29 01:18:26,477 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.07 01:18:26 BoogieIcfgContainer [2020-07-29 01:18:26,477 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-29 01:18:26,478 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-07-29 01:18:26,478 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-07-29 01:18:26,478 INFO L275 PluginConnector]: Witness Printer initialized [2020-07-29 01:18:26,479 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:18:13" (3/4) ... [2020-07-29 01:18:26,482 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-07-29 01:18:26,581 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-07-29 01:18:26,581 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-07-29 01:18:26,584 INFO L168 Benchmark]: Toolchain (without parser) took 13541.76 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 302.0 MB). Free memory was 957.5 MB in the beginning and 938.2 MB in the end (delta: 19.3 MB). Peak memory consumption was 321.3 MB. Max. memory is 11.5 GB. [2020-07-29 01:18:26,584 INFO L168 Benchmark]: CDTParser took 0.29 ms. Allocated memory is still 1.0 GB. Free memory is still 987.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 01:18:26,585 INFO L168 Benchmark]: CACSL2BoogieTranslator took 282.90 ms. Allocated memory is still 1.0 GB. Free memory was 957.5 MB in the beginning and 946.8 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2020-07-29 01:18:26,585 INFO L168 Benchmark]: Boogie Preprocessor took 126.74 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 127.9 MB). Free memory was 946.8 MB in the beginning and 1.1 GB in the end (delta: -170.9 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. [2020-07-29 01:18:26,586 INFO L168 Benchmark]: RCFGBuilder took 435.50 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: 31.9 MB). Peak memory consumption was 31.9 MB. Max. memory is 11.5 GB. [2020-07-29 01:18:26,586 INFO L168 Benchmark]: TraceAbstraction took 12585.76 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 174.1 MB). Free memory was 1.1 GB in the beginning and 938.2 MB in the end (delta: 147.6 MB). Peak memory consumption was 321.6 MB. Max. memory is 11.5 GB. [2020-07-29 01:18:26,586 INFO L168 Benchmark]: Witness Printer took 103.62 ms. Allocated memory is still 1.3 GB. Free memory was 938.2 MB in the beginning and 938.2 MB in the end (delta: 24 B). Peak memory consumption was 24 B. Max. memory is 11.5 GB. [2020-07-29 01:18:26,588 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.29 ms. Allocated memory is still 1.0 GB. Free memory is still 987.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 282.90 ms. Allocated memory is still 1.0 GB. Free memory was 957.5 MB in the beginning and 946.8 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 126.74 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 127.9 MB). Free memory was 946.8 MB in the beginning and 1.1 GB in the end (delta: -170.9 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 435.50 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: 31.9 MB). Peak memory consumption was 31.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 12585.76 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 174.1 MB). Free memory was 1.1 GB in the beginning and 938.2 MB in the end (delta: 147.6 MB). Peak memory consumption was 321.6 MB. Max. memory is 11.5 GB. * Witness Printer took 103.62 ms. Allocated memory is still 1.3 GB. Free memory was 938.2 MB in the beginning and 938.2 MB in the end (delta: 24 B). Peak memory consumption was 24 B. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 20]: pointer dereference may fail pointer dereference may fail We found a FailurePath: [L10] int i = __VERIFIER_nondet_int(); [L11] int a[10]; [L13] int n = 0; VAL [a={2:0}, i=0, n=0] [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=9, a={2:0}, i=0, n=0] [L13] ++n VAL [a={2:0}, i=0, n=1] [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=-2, a={2:0}, i=0, n=1] [L13] ++n VAL [a={2:0}, i=0, n=2] [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=3, a={2:0}, i=0, n=2] [L13] ++n VAL [a={2:0}, i=0, n=3] [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=-3, a={2:0}, i=0, n=3] [L13] ++n VAL [a={2:0}, i=0, n=4] [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=-4, a={2:0}, i=0, n=4] [L13] ++n VAL [a={2:0}, i=0, n=5] [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=5, a={2:0}, i=0, n=5] [L13] ++n VAL [a={2:0}, i=0, n=6] [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=-5, a={2:0}, i=0, n=6] [L13] ++n VAL [a={2:0}, i=0, n=7] [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=6, a={2:0}, i=0, n=7] [L13] ++n VAL [a={2:0}, i=0, n=8] [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=-6, a={2:0}, i=0, n=8] [L13] ++n VAL [a={2:0}, i=0, n=9] [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=7, a={2:0}, i=0, n=9] [L13] ++n VAL [a={2:0}, i=0, n=10] [L13] COND FALSE !(n < 10) VAL [a={2:0}, i=0, n=10] [L17] 0 <= i && i < 10 && a[i] >= 0 VAL [0 <= i && i < 10 && a[i] >= 0=1, a={2:0}, i=0, n=10] [L17] EXPR a[i] VAL [0 <= i && i < 10 && a[i] >= 0=1, a={2:0}, a[i]=9, i=0, n=10] [L17] 0 <= i && i < 10 && a[i] >= 0 VAL [0 <= i && i < 10 && a[i] >= 0=1, a={2:0}, a[i]=9, i=0, n=10] [L17] COND TRUE 0 <= i && i < 10 && a[i] >= 0 [L18] i = __VERIFIER_nondet_int() [L20] a[i] = 0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 28 locations, 7 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 12.4s, OverallIterations: 16, TraceHistogramMax: 10, AutomataDifference: 3.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 236 SDtfs, 226 SDslu, 635 SDs, 0 SdLazy, 660 SolverSat, 36 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 446 GetRequests, 347 SyntacticMatches, 2 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=54occurred in iteration=15, 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, 15 MinimizatonAttempts, 33 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 4.4s InterpolantComputationTime, 778 NumberOfCodeBlocks, 762 NumberOfCodeBlocksAsserted, 53 NumberOfCheckSat, 699 ConstructedInterpolants, 1 QuantifiedInterpolants, 69393 SizeOfPredicates, 8 NumberOfNonLiveVariables, 1103 ConjunctsInSsa, 82 ConjunctsInUnsatCore, 26 InterpolantComputations, 6 PerfectInterpolantSequences, 68/1154 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...