./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/termination-crafted/LexIndexValue-Array-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/LexIndexValue-Array-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 b9dfe2826dbd43b76a93fbf593c8a07947a4c894 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-8bd4bc6 [2020-07-29 01:17:57,634 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-29 01:17:57,636 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-29 01:17:57,650 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-29 01:17:57,651 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-29 01:17:57,652 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-29 01:17:57,653 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-29 01:17:57,655 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-29 01:17:57,657 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-29 01:17:57,659 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-29 01:17:57,660 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-29 01:17:57,661 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-29 01:17:57,662 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-29 01:17:57,663 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-29 01:17:57,664 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-29 01:17:57,666 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-29 01:17:57,667 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-29 01:17:57,668 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-29 01:17:57,670 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-29 01:17:57,672 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-29 01:17:57,674 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-29 01:17:57,676 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-29 01:17:57,677 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-29 01:17:57,678 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-29 01:17:57,681 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-29 01:17:57,681 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-29 01:17:57,682 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-29 01:17:57,683 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-29 01:17:57,683 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-29 01:17:57,685 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-29 01:17:57,685 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-29 01:17:57,686 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-29 01:17:57,687 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-29 01:17:57,688 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-29 01:17:57,689 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-29 01:17:57,689 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-29 01:17:57,690 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-29 01:17:57,690 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-29 01:17:57,691 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-29 01:17:57,692 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-29 01:17:57,693 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-29 01:17:57,693 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:17:57,709 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-29 01:17:57,710 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-29 01:17:57,711 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-29 01:17:57,712 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-29 01:17:57,712 INFO L138 SettingsManager]: * Use SBE=true [2020-07-29 01:17:57,712 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-29 01:17:57,713 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-29 01:17:57,713 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-29 01:17:57,713 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-29 01:17:57,713 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2020-07-29 01:17:57,714 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2020-07-29 01:17:57,714 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2020-07-29 01:17:57,714 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-29 01:17:57,714 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2020-07-29 01:17:57,715 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-29 01:17:57,715 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-29 01:17:57,715 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-29 01:17:57,716 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-29 01:17:57,716 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-29 01:17:57,716 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-29 01:17:57,717 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-29 01:17:57,717 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-29 01:17:57,717 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-29 01:17:57,717 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-29 01:17:57,718 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-29 01:17:57,718 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 -> b9dfe2826dbd43b76a93fbf593c8a07947a4c894 [2020-07-29 01:17:58,008 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-29 01:17:58,025 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-29 01:17:58,029 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-29 01:17:58,031 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-29 01:17:58,031 INFO L275 PluginConnector]: CDTParser initialized [2020-07-29 01:17:58,032 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-crafted/LexIndexValue-Array-1.c [2020-07-29 01:17:58,102 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1fa015bca/55f542d54a5a4e2bb6384b15c76d0142/FLAG154a95dbe [2020-07-29 01:17:58,479 INFO L306 CDTParser]: Found 1 translation units. [2020-07-29 01:17:58,480 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-crafted/LexIndexValue-Array-1.c [2020-07-29 01:17:58,486 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1fa015bca/55f542d54a5a4e2bb6384b15c76d0142/FLAG154a95dbe [2020-07-29 01:17:58,870 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1fa015bca/55f542d54a5a4e2bb6384b15c76d0142 [2020-07-29 01:17:58,873 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-29 01:17:58,875 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-07-29 01:17:58,876 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-29 01:17:58,876 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-29 01:17:58,880 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-29 01:17:58,882 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 01:17:58" (1/1) ... [2020-07-29 01:17:58,885 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@52d22436 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:17:58, skipping insertion in model container [2020-07-29 01:17:58,885 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 01:17:58" (1/1) ... [2020-07-29 01:17:58,892 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-29 01:17:58,907 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-29 01:17:59,105 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 01:17:59,120 INFO L203 MainTranslator]: Completed pre-run [2020-07-29 01:17:59,153 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 01:17:59,181 INFO L208 MainTranslator]: Completed translation [2020-07-29 01:17:59,182 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:17:59 WrapperNode [2020-07-29 01:17:59,182 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-29 01:17:59,184 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-29 01:17:59,184 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-29 01:17:59,184 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-29 01:17:59,281 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:17:59" (1/1) ... [2020-07-29 01:17:59,282 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:17:59" (1/1) ... [2020-07-29 01:17:59,292 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:17:59" (1/1) ... [2020-07-29 01:17:59,293 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:17:59" (1/1) ... [2020-07-29 01:17:59,315 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:17:59" (1/1) ... [2020-07-29 01:17:59,325 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:17:59" (1/1) ... [2020-07-29 01:17:59,328 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:17:59" (1/1) ... [2020-07-29 01:17:59,339 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-29 01:17:59,340 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-29 01:17:59,341 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-29 01:17:59,341 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-29 01:17:59,342 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:17:59" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-29 01:17:59,398 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-29 01:17:59,398 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-29 01:17:59,399 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-29 01:17:59,399 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-29 01:17:59,399 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-29 01:17:59,399 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-29 01:17:59,399 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-29 01:17:59,399 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-29 01:17:59,399 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-29 01:17:59,400 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-29 01:17:59,400 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-29 01:17:59,869 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-29 01:17:59,869 INFO L295 CfgBuilder]: Removed 2 assume(true) statements. [2020-07-29 01:17:59,873 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:17:59 BoogieIcfgContainer [2020-07-29 01:17:59,873 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-29 01:17:59,874 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-29 01:17:59,874 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-29 01:17:59,877 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-29 01:17:59,877 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.07 01:17:58" (1/3) ... [2020-07-29 01:17:59,878 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19e6e513 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.07 01:17:59, skipping insertion in model container [2020-07-29 01:17:59,879 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:17:59" (2/3) ... [2020-07-29 01:17:59,879 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19e6e513 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.07 01:17:59, skipping insertion in model container [2020-07-29 01:17:59,879 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:17:59" (3/3) ... [2020-07-29 01:17:59,881 INFO L109 eAbstractionObserver]: Analyzing ICFG LexIndexValue-Array-1.c [2020-07-29 01:17:59,889 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-29 01:17:59,896 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 9 error locations. [2020-07-29 01:17:59,909 INFO L251 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2020-07-29 01:17:59,931 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-29 01:17:59,931 INFO L376 AbstractCegarLoop]: Hoare is false [2020-07-29 01:17:59,931 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-29 01:17:59,931 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-29 01:17:59,931 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-29 01:17:59,931 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-29 01:17:59,932 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-29 01:17:59,932 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-29 01:17:59,947 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states. [2020-07-29 01:17:59,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-07-29 01:17:59,957 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:17:59,958 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:17:59,958 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-07-29 01:17:59,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:17:59,965 INFO L82 PathProgramCache]: Analyzing trace with hash -1038673271, now seen corresponding path program 1 times [2020-07-29 01:17:59,976 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:17:59,976 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723011931] [2020-07-29 01:17:59,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:18:00,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:18:00,209 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-07-29 01:18:00,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:18:00,226 INFO L280 TraceCheckUtils]: 0: Hoare triple {43#(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; {37#true} is VALID [2020-07-29 01:18:00,227 INFO L280 TraceCheckUtils]: 1: Hoare triple {37#true} assume true; {37#true} is VALID [2020-07-29 01:18:00,227 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {37#true} {37#true} #63#return; {37#true} is VALID [2020-07-29 01:18:00,231 INFO L263 TraceCheckUtils]: 0: Hoare triple {37#true} call ULTIMATE.init(); {43#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-29 01:18:00,231 INFO L280 TraceCheckUtils]: 1: Hoare triple {43#(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; {37#true} is VALID [2020-07-29 01:18:00,232 INFO L280 TraceCheckUtils]: 2: Hoare triple {37#true} assume true; {37#true} is VALID [2020-07-29 01:18:00,232 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {37#true} {37#true} #63#return; {37#true} is VALID [2020-07-29 01:18:00,232 INFO L263 TraceCheckUtils]: 4: Hoare triple {37#true} call #t~ret8 := main(); {37#true} is VALID [2020-07-29 01:18:00,234 INFO L280 TraceCheckUtils]: 5: Hoare triple {37#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.allocOnStack(4192);~k~0 := 0;~i~0 := 0; {42#(and (= 0 main_~i~0) (= (select |#length| |main_~#a~0.base|) 4192) (= 0 |main_~#a~0.offset|))} is VALID [2020-07-29 01:18:00,236 INFO L280 TraceCheckUtils]: 6: Hoare triple {42#(and (= 0 main_~i~0) (= (select |#length| |main_~#a~0.base|) 4192) (= 0 |main_~#a~0.offset|))} assume !!(~i~0 < 1048);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {42#(and (= 0 main_~i~0) (= (select |#length| |main_~#a~0.base|) 4192) (= 0 |main_~#a~0.offset|))} is VALID [2020-07-29 01:18:00,237 INFO L280 TraceCheckUtils]: 7: Hoare triple {42#(and (= 0 main_~i~0) (= (select |#length| |main_~#a~0.base|) 4192) (= 0 |main_~#a~0.offset|))} assume !(4 + (~#a~0.offset + 4 * ~i~0) <= #length[~#a~0.base] && 0 <= ~#a~0.offset + 4 * ~i~0); {38#false} is VALID [2020-07-29 01:18:00,239 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:00,239 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723011931] [2020-07-29 01:18:00,240 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:18:00,241 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-29 01:18:00,242 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81390504] [2020-07-29 01:18:00,248 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2020-07-29 01:18:00,251 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:18:00,256 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 01:18:00,277 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:00,278 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-29 01:18:00,278 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:18:00,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-29 01:18:00,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-29 01:18:00,291 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 4 states. [2020-07-29 01:18:00,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:18:00,538 INFO L93 Difference]: Finished difference Result 39 states and 42 transitions. [2020-07-29 01:18:00,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-29 01:18:00,539 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2020-07-29 01:18:00,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:18:00,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 01:18:00,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 47 transitions. [2020-07-29 01:18:00,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 01:18:00,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 47 transitions. [2020-07-29 01:18:00,558 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 47 transitions. [2020-07-29 01:18:00,631 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:00,643 INFO L225 Difference]: With dead ends: 39 [2020-07-29 01:18:00,644 INFO L226 Difference]: Without dead ends: 36 [2020-07-29 01:18:00,645 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:00,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2020-07-29 01:18:00,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 33. [2020-07-29 01:18:00,681 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:18:00,682 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand 33 states. [2020-07-29 01:18:00,683 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 33 states. [2020-07-29 01:18:00,683 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 33 states. [2020-07-29 01:18:00,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:18:00,688 INFO L93 Difference]: Finished difference Result 36 states and 39 transitions. [2020-07-29 01:18:00,688 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 39 transitions. [2020-07-29 01:18:00,689 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:18:00,689 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:18:00,689 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 36 states. [2020-07-29 01:18:00,690 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 36 states. [2020-07-29 01:18:00,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:18:00,694 INFO L93 Difference]: Finished difference Result 36 states and 39 transitions. [2020-07-29 01:18:00,695 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 39 transitions. [2020-07-29 01:18:00,695 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:18:00,695 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:18:00,696 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:18:00,696 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:18:00,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2020-07-29 01:18:00,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2020-07-29 01:18:00,700 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 8 [2020-07-29 01:18:00,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:18:00,701 INFO L479 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2020-07-29 01:18:00,701 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-29 01:18:00,701 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2020-07-29 01:18:00,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-07-29 01:18:00,702 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:18:00,702 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:18:00,703 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-29 01:18:00,703 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-07-29 01:18:00,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:18:00,703 INFO L82 PathProgramCache]: Analyzing trace with hash -1038673272, now seen corresponding path program 1 times [2020-07-29 01:18:00,704 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:18:00,704 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599032669] [2020-07-29 01:18:00,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:18:00,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:18:00,795 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-07-29 01:18:00,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:18:00,805 INFO L280 TraceCheckUtils]: 0: Hoare triple {196#(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; {190#true} is VALID [2020-07-29 01:18:00,806 INFO L280 TraceCheckUtils]: 1: Hoare triple {190#true} assume true; {190#true} is VALID [2020-07-29 01:18:00,806 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {190#true} {190#true} #63#return; {190#true} is VALID [2020-07-29 01:18:00,807 INFO L263 TraceCheckUtils]: 0: Hoare triple {190#true} call ULTIMATE.init(); {196#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-29 01:18:00,808 INFO L280 TraceCheckUtils]: 1: Hoare triple {196#(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; {190#true} is VALID [2020-07-29 01:18:00,808 INFO L280 TraceCheckUtils]: 2: Hoare triple {190#true} assume true; {190#true} is VALID [2020-07-29 01:18:00,809 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {190#true} {190#true} #63#return; {190#true} is VALID [2020-07-29 01:18:00,809 INFO L263 TraceCheckUtils]: 4: Hoare triple {190#true} call #t~ret8 := main(); {190#true} is VALID [2020-07-29 01:18:00,810 INFO L280 TraceCheckUtils]: 5: Hoare triple {190#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.allocOnStack(4192);~k~0 := 0;~i~0 := 0; {195#(= 1 (select |#valid| |main_~#a~0.base|))} is VALID [2020-07-29 01:18:00,811 INFO L280 TraceCheckUtils]: 6: Hoare triple {195#(= 1 (select |#valid| |main_~#a~0.base|))} assume !!(~i~0 < 1048);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {195#(= 1 (select |#valid| |main_~#a~0.base|))} is VALID [2020-07-29 01:18:00,812 INFO L280 TraceCheckUtils]: 7: Hoare triple {195#(= 1 (select |#valid| |main_~#a~0.base|))} assume !(1 == #valid[~#a~0.base]); {191#false} is VALID [2020-07-29 01:18:00,813 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:00,813 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599032669] [2020-07-29 01:18:00,814 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:18:00,814 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-29 01:18:00,814 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353848515] [2020-07-29 01:18:00,816 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2020-07-29 01:18:00,816 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:18:00,816 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 01:18:00,828 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:00,828 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-29 01:18:00,829 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:18:00,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-29 01:18:00,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-29 01:18:00,830 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand 4 states. [2020-07-29 01:18:00,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:18:00,975 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2020-07-29 01:18:00,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-29 01:18:00,975 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2020-07-29 01:18:00,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:18:00,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 01:18:00,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 34 transitions. [2020-07-29 01:18:00,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 01:18:00,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 34 transitions. [2020-07-29 01:18:00,981 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 34 transitions. [2020-07-29 01:18:01,029 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:01,031 INFO L225 Difference]: With dead ends: 29 [2020-07-29 01:18:01,031 INFO L226 Difference]: Without dead ends: 29 [2020-07-29 01:18:01,032 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:01,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2020-07-29 01:18:01,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2020-07-29 01:18:01,036 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:18:01,036 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand 29 states. [2020-07-29 01:18:01,037 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 29 states. [2020-07-29 01:18:01,037 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 29 states. [2020-07-29 01:18:01,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:18:01,040 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2020-07-29 01:18:01,040 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2020-07-29 01:18:01,041 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:18:01,041 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:18:01,041 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 29 states. [2020-07-29 01:18:01,041 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 29 states. [2020-07-29 01:18:01,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:18:01,044 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2020-07-29 01:18:01,045 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2020-07-29 01:18:01,045 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:18:01,046 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:18:01,046 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:18:01,046 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:18:01,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2020-07-29 01:18:01,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2020-07-29 01:18:01,049 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 32 transitions. Word has length 8 [2020-07-29 01:18:01,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:18:01,050 INFO L479 AbstractCegarLoop]: Abstraction has 29 states and 32 transitions. [2020-07-29 01:18:01,050 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-29 01:18:01,050 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2020-07-29 01:18:01,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-07-29 01:18:01,051 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:18:01,051 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:18:01,051 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-29 01:18:01,052 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-07-29 01:18:01,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:18:01,053 INFO L82 PathProgramCache]: Analyzing trace with hash 1416659532, now seen corresponding path program 1 times [2020-07-29 01:18:01,053 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:18:01,053 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118907995] [2020-07-29 01:18:01,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:18:01,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:18:01,187 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-07-29 01:18:01,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:18:01,197 INFO L280 TraceCheckUtils]: 0: Hoare triple {322#(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; {315#true} is VALID [2020-07-29 01:18:01,198 INFO L280 TraceCheckUtils]: 1: Hoare triple {315#true} assume true; {315#true} is VALID [2020-07-29 01:18:01,198 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {315#true} {315#true} #63#return; {315#true} is VALID [2020-07-29 01:18:01,200 INFO L263 TraceCheckUtils]: 0: Hoare triple {315#true} call ULTIMATE.init(); {322#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-29 01:18:01,200 INFO L280 TraceCheckUtils]: 1: Hoare triple {322#(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; {315#true} is VALID [2020-07-29 01:18:01,201 INFO L280 TraceCheckUtils]: 2: Hoare triple {315#true} assume true; {315#true} is VALID [2020-07-29 01:18:01,201 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {315#true} {315#true} #63#return; {315#true} is VALID [2020-07-29 01:18:01,202 INFO L263 TraceCheckUtils]: 4: Hoare triple {315#true} call #t~ret8 := main(); {315#true} is VALID [2020-07-29 01:18:01,203 INFO L280 TraceCheckUtils]: 5: Hoare triple {315#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.allocOnStack(4192);~k~0 := 0;~i~0 := 0; {320#(and (= 0 main_~i~0) (= (select |#length| |main_~#a~0.base|) 4192) (= 0 |main_~#a~0.offset|))} is VALID [2020-07-29 01:18:01,205 INFO L280 TraceCheckUtils]: 6: Hoare triple {320#(and (= 0 main_~i~0) (= (select |#length| |main_~#a~0.base|) 4192) (= 0 |main_~#a~0.offset|))} assume !!(~i~0 < 1048);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {320#(and (= 0 main_~i~0) (= (select |#length| |main_~#a~0.base|) 4192) (= 0 |main_~#a~0.offset|))} is VALID [2020-07-29 01:18:01,206 INFO L280 TraceCheckUtils]: 7: Hoare triple {320#(and (= 0 main_~i~0) (= (select |#length| |main_~#a~0.base|) 4192) (= 0 |main_~#a~0.offset|))} SUMMARY for call write~int(#t~nondet1, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); srcloc: L15 {320#(and (= 0 main_~i~0) (= (select |#length| |main_~#a~0.base|) 4192) (= 0 |main_~#a~0.offset|))} is VALID [2020-07-29 01:18:01,207 INFO L280 TraceCheckUtils]: 8: Hoare triple {320#(and (= 0 main_~i~0) (= (select |#length| |main_~#a~0.base|) 4192) (= 0 |main_~#a~0.offset|))} havoc #t~nondet1; {320#(and (= 0 main_~i~0) (= (select |#length| |main_~#a~0.base|) 4192) (= 0 |main_~#a~0.offset|))} is VALID [2020-07-29 01:18:01,209 INFO L280 TraceCheckUtils]: 9: Hoare triple {320#(and (= 0 main_~i~0) (= (select |#length| |main_~#a~0.base|) 4192) (= 0 |main_~#a~0.offset|))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {321#(and (<= main_~i~0 1) (= (select |#length| |main_~#a~0.base|) 4192) (<= 1 main_~i~0) (= 0 |main_~#a~0.offset|))} is VALID [2020-07-29 01:18:01,210 INFO L280 TraceCheckUtils]: 10: Hoare triple {321#(and (<= main_~i~0 1) (= (select |#length| |main_~#a~0.base|) 4192) (<= 1 main_~i~0) (= 0 |main_~#a~0.offset|))} assume !!(~i~0 < 1048);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {321#(and (<= main_~i~0 1) (= (select |#length| |main_~#a~0.base|) 4192) (<= 1 main_~i~0) (= 0 |main_~#a~0.offset|))} is VALID [2020-07-29 01:18:01,211 INFO L280 TraceCheckUtils]: 11: Hoare triple {321#(and (<= main_~i~0 1) (= (select |#length| |main_~#a~0.base|) 4192) (<= 1 main_~i~0) (= 0 |main_~#a~0.offset|))} assume !(4 + (~#a~0.offset + 4 * ~i~0) <= #length[~#a~0.base] && 0 <= ~#a~0.offset + 4 * ~i~0); {316#false} is VALID [2020-07-29 01:18:01,213 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:01,214 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118907995] [2020-07-29 01:18:01,214 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1659323385] [2020-07-29 01:18:01,214 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:01,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:18:01,279 INFO L263 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-29 01:18:01,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:18:01,309 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:18:01,407 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:01,408 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-29 01:18:01,422 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 01:18:01,422 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-29 01:18:01,423 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2020-07-29 01:18:01,427 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-29 01:18:01,427 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#length_13|]. (and (= |#length| (store |v_#length_13| |main_~#a~0.base| 4192)) (= 0 main_~i~0) (= 0 |main_~#a~0.offset|)) [2020-07-29 01:18:01,427 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= 0 main_~i~0) (= 4192 (select |#length| |main_~#a~0.base|)) (= 0 |main_~#a~0.offset|)) [2020-07-29 01:18:01,462 INFO L263 TraceCheckUtils]: 0: Hoare triple {315#true} call ULTIMATE.init(); {315#true} is VALID [2020-07-29 01:18:01,462 INFO L280 TraceCheckUtils]: 1: Hoare triple {315#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {315#true} is VALID [2020-07-29 01:18:01,463 INFO L280 TraceCheckUtils]: 2: Hoare triple {315#true} assume true; {315#true} is VALID [2020-07-29 01:18:01,463 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {315#true} {315#true} #63#return; {315#true} is VALID [2020-07-29 01:18:01,463 INFO L263 TraceCheckUtils]: 4: Hoare triple {315#true} call #t~ret8 := main(); {315#true} is VALID [2020-07-29 01:18:01,465 INFO L280 TraceCheckUtils]: 5: Hoare triple {315#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.allocOnStack(4192);~k~0 := 0;~i~0 := 0; {320#(and (= 0 main_~i~0) (= (select |#length| |main_~#a~0.base|) 4192) (= 0 |main_~#a~0.offset|))} is VALID [2020-07-29 01:18:01,466 INFO L280 TraceCheckUtils]: 6: Hoare triple {320#(and (= 0 main_~i~0) (= (select |#length| |main_~#a~0.base|) 4192) (= 0 |main_~#a~0.offset|))} assume !!(~i~0 < 1048);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {320#(and (= 0 main_~i~0) (= (select |#length| |main_~#a~0.base|) 4192) (= 0 |main_~#a~0.offset|))} is VALID [2020-07-29 01:18:01,467 INFO L280 TraceCheckUtils]: 7: Hoare triple {320#(and (= 0 main_~i~0) (= (select |#length| |main_~#a~0.base|) 4192) (= 0 |main_~#a~0.offset|))} SUMMARY for call write~int(#t~nondet1, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); srcloc: L15 {320#(and (= 0 main_~i~0) (= (select |#length| |main_~#a~0.base|) 4192) (= 0 |main_~#a~0.offset|))} is VALID [2020-07-29 01:18:01,468 INFO L280 TraceCheckUtils]: 8: Hoare triple {320#(and (= 0 main_~i~0) (= (select |#length| |main_~#a~0.base|) 4192) (= 0 |main_~#a~0.offset|))} havoc #t~nondet1; {320#(and (= 0 main_~i~0) (= (select |#length| |main_~#a~0.base|) 4192) (= 0 |main_~#a~0.offset|))} is VALID [2020-07-29 01:18:01,469 INFO L280 TraceCheckUtils]: 9: Hoare triple {320#(and (= 0 main_~i~0) (= (select |#length| |main_~#a~0.base|) 4192) (= 0 |main_~#a~0.offset|))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {321#(and (<= main_~i~0 1) (= (select |#length| |main_~#a~0.base|) 4192) (<= 1 main_~i~0) (= 0 |main_~#a~0.offset|))} is VALID [2020-07-29 01:18:01,471 INFO L280 TraceCheckUtils]: 10: Hoare triple {321#(and (<= main_~i~0 1) (= (select |#length| |main_~#a~0.base|) 4192) (<= 1 main_~i~0) (= 0 |main_~#a~0.offset|))} assume !!(~i~0 < 1048);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {321#(and (<= main_~i~0 1) (= (select |#length| |main_~#a~0.base|) 4192) (<= 1 main_~i~0) (= 0 |main_~#a~0.offset|))} is VALID [2020-07-29 01:18:01,472 INFO L280 TraceCheckUtils]: 11: Hoare triple {321#(and (<= main_~i~0 1) (= (select |#length| |main_~#a~0.base|) 4192) (<= 1 main_~i~0) (= 0 |main_~#a~0.offset|))} assume !(4 + (~#a~0.offset + 4 * ~i~0) <= #length[~#a~0.base] && 0 <= ~#a~0.offset + 4 * ~i~0); {316#false} is VALID [2020-07-29 01:18:01,473 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:01,474 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-29 01:18:01,474 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3] total 4 [2020-07-29 01:18:01,474 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195019120] [2020-07-29 01:18:01,475 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2020-07-29 01:18:01,475 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:18:01,475 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-29 01:18:01,495 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:01,496 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-29 01:18:01,496 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:18:01,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-29 01:18:01,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-29 01:18:01,497 INFO L87 Difference]: Start difference. First operand 29 states and 32 transitions. Second operand 5 states. [2020-07-29 01:18:01,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:18:01,717 INFO L93 Difference]: Finished difference Result 35 states and 38 transitions. [2020-07-29 01:18:01,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-29 01:18:01,717 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2020-07-29 01:18:01,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:18:01,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-29 01:18:01,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 40 transitions. [2020-07-29 01:18:01,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-29 01:18:01,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 40 transitions. [2020-07-29 01:18:01,721 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 40 transitions. [2020-07-29 01:18:01,779 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:01,781 INFO L225 Difference]: With dead ends: 35 [2020-07-29 01:18:01,782 INFO L226 Difference]: Without dead ends: 35 [2020-07-29 01:18:01,785 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 11 SyntacticMatches, 2 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:01,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2020-07-29 01:18:01,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 33. [2020-07-29 01:18:01,791 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:18:01,792 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand 33 states. [2020-07-29 01:18:01,792 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 33 states. [2020-07-29 01:18:01,792 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 33 states. [2020-07-29 01:18:01,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:18:01,797 INFO L93 Difference]: Finished difference Result 35 states and 38 transitions. [2020-07-29 01:18:01,797 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2020-07-29 01:18:01,798 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:18:01,799 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:18:01,799 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 35 states. [2020-07-29 01:18:01,799 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 35 states. [2020-07-29 01:18:01,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:18:01,809 INFO L93 Difference]: Finished difference Result 35 states and 38 transitions. [2020-07-29 01:18:01,810 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2020-07-29 01:18:01,810 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:18:01,811 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:18:01,812 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:18:01,812 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:18:01,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2020-07-29 01:18:01,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 36 transitions. [2020-07-29 01:18:01,820 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 36 transitions. Word has length 12 [2020-07-29 01:18:01,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:18:01,821 INFO L479 AbstractCegarLoop]: Abstraction has 33 states and 36 transitions. [2020-07-29 01:18:01,821 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-29 01:18:01,821 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2020-07-29 01:18:01,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-07-29 01:18:01,823 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:18:01,823 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:18:02,027 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2020-07-29 01:18:02,028 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-07-29 01:18:02,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:18:02,028 INFO L82 PathProgramCache]: Analyzing trace with hash -931508081, now seen corresponding path program 2 times [2020-07-29 01:18:02,029 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:18:02,029 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601040451] [2020-07-29 01:18:02,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:18:02,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:18:02,255 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-07-29 01:18:02,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:18:02,262 INFO L280 TraceCheckUtils]: 0: Hoare triple {505#(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; {496#true} is VALID [2020-07-29 01:18:02,262 INFO L280 TraceCheckUtils]: 1: Hoare triple {496#true} assume true; {496#true} is VALID [2020-07-29 01:18:02,263 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {496#true} {496#true} #63#return; {496#true} is VALID [2020-07-29 01:18:02,264 INFO L263 TraceCheckUtils]: 0: Hoare triple {496#true} call ULTIMATE.init(); {505#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-29 01:18:02,265 INFO L280 TraceCheckUtils]: 1: Hoare triple {505#(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; {496#true} is VALID [2020-07-29 01:18:02,265 INFO L280 TraceCheckUtils]: 2: Hoare triple {496#true} assume true; {496#true} is VALID [2020-07-29 01:18:02,266 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {496#true} {496#true} #63#return; {496#true} is VALID [2020-07-29 01:18:02,266 INFO L263 TraceCheckUtils]: 4: Hoare triple {496#true} call #t~ret8 := main(); {496#true} is VALID [2020-07-29 01:18:02,268 INFO L280 TraceCheckUtils]: 5: Hoare triple {496#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.allocOnStack(4192);~k~0 := 0;~i~0 := 0; {501#(and (= 0 main_~i~0) (= (select |#length| |main_~#a~0.base|) 4192) (= 0 |main_~#a~0.offset|))} is VALID [2020-07-29 01:18:02,269 INFO L280 TraceCheckUtils]: 6: Hoare triple {501#(and (= 0 main_~i~0) (= (select |#length| |main_~#a~0.base|) 4192) (= 0 |main_~#a~0.offset|))} assume !!(~i~0 < 1048);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {501#(and (= 0 main_~i~0) (= (select |#length| |main_~#a~0.base|) 4192) (= 0 |main_~#a~0.offset|))} is VALID [2020-07-29 01:18:02,270 INFO L280 TraceCheckUtils]: 7: Hoare triple {501#(and (= 0 main_~i~0) (= (select |#length| |main_~#a~0.base|) 4192) (= 0 |main_~#a~0.offset|))} SUMMARY for call write~int(#t~nondet1, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); srcloc: L15 {501#(and (= 0 main_~i~0) (= (select |#length| |main_~#a~0.base|) 4192) (= 0 |main_~#a~0.offset|))} is VALID [2020-07-29 01:18:02,271 INFO L280 TraceCheckUtils]: 8: Hoare triple {501#(and (= 0 main_~i~0) (= (select |#length| |main_~#a~0.base|) 4192) (= 0 |main_~#a~0.offset|))} havoc #t~nondet1; {501#(and (= 0 main_~i~0) (= (select |#length| |main_~#a~0.base|) 4192) (= 0 |main_~#a~0.offset|))} is VALID [2020-07-29 01:18:02,273 INFO L280 TraceCheckUtils]: 9: Hoare triple {501#(and (= 0 main_~i~0) (= (select |#length| |main_~#a~0.base|) 4192) (= 0 |main_~#a~0.offset|))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {502#(and (= (select |#length| |main_~#a~0.base|) 4192) (<= 1 main_~i~0) (= 0 |main_~#a~0.offset|))} is VALID [2020-07-29 01:18:02,274 INFO L280 TraceCheckUtils]: 10: Hoare triple {502#(and (= (select |#length| |main_~#a~0.base|) 4192) (<= 1 main_~i~0) (= 0 |main_~#a~0.offset|))} assume !!(~i~0 < 1048);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {502#(and (= (select |#length| |main_~#a~0.base|) 4192) (<= 1 main_~i~0) (= 0 |main_~#a~0.offset|))} is VALID [2020-07-29 01:18:02,275 INFO L280 TraceCheckUtils]: 11: Hoare triple {502#(and (= (select |#length| |main_~#a~0.base|) 4192) (<= 1 main_~i~0) (= 0 |main_~#a~0.offset|))} SUMMARY for call write~int(#t~nondet1, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); srcloc: L15 {502#(and (= (select |#length| |main_~#a~0.base|) 4192) (<= 1 main_~i~0) (= 0 |main_~#a~0.offset|))} is VALID [2020-07-29 01:18:02,276 INFO L280 TraceCheckUtils]: 12: Hoare triple {502#(and (= (select |#length| |main_~#a~0.base|) 4192) (<= 1 main_~i~0) (= 0 |main_~#a~0.offset|))} havoc #t~nondet1; {502#(and (= (select |#length| |main_~#a~0.base|) 4192) (<= 1 main_~i~0) (= 0 |main_~#a~0.offset|))} is VALID [2020-07-29 01:18:02,277 INFO L280 TraceCheckUtils]: 13: Hoare triple {502#(and (= (select |#length| |main_~#a~0.base|) 4192) (<= 1 main_~i~0) (= 0 |main_~#a~0.offset|))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {503#(and (<= 2 main_~i~0) (= (select |#length| |main_~#a~0.base|) 4192) (= 0 |main_~#a~0.offset|))} is VALID [2020-07-29 01:18:02,279 INFO L280 TraceCheckUtils]: 14: Hoare triple {503#(and (<= 2 main_~i~0) (= (select |#length| |main_~#a~0.base|) 4192) (= 0 |main_~#a~0.offset|))} assume !!(~i~0 < 1048);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {504#(and (<= 2 main_~i~0) (<= main_~i~0 1047) (= (select |#length| |main_~#a~0.base|) 4192) (= 0 |main_~#a~0.offset|))} is VALID [2020-07-29 01:18:02,280 INFO L280 TraceCheckUtils]: 15: Hoare triple {504#(and (<= 2 main_~i~0) (<= main_~i~0 1047) (= (select |#length| |main_~#a~0.base|) 4192) (= 0 |main_~#a~0.offset|))} assume !(4 + (~#a~0.offset + 4 * ~i~0) <= #length[~#a~0.base] && 0 <= ~#a~0.offset + 4 * ~i~0); {497#false} is VALID [2020-07-29 01:18:02,282 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:02,282 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601040451] [2020-07-29 01:18:02,282 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1279097272] [2020-07-29 01:18:02,283 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:02,317 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-29 01:18:02,317 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-29 01:18:02,319 INFO L263 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-29 01:18:02,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:18:02,329 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:18:02,345 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:02,346 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-29 01:18:02,353 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 01:18:02,353 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-29 01:18:02,353 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2020-07-29 01:18:02,357 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-29 01:18:02,357 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#length_14|]. (and (<= 0 main_~i~0) (= (store |v_#length_14| |main_~#a~0.base| 4192) |#length|) (= 0 |main_~#a~0.offset|)) [2020-07-29 01:18:02,357 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (and (<= 0 main_~i~0) (= 4192 (select |#length| |main_~#a~0.base|)) (= 0 |main_~#a~0.offset|)) [2020-07-29 01:18:02,498 INFO L263 TraceCheckUtils]: 0: Hoare triple {496#true} call ULTIMATE.init(); {496#true} is VALID [2020-07-29 01:18:02,499 INFO L280 TraceCheckUtils]: 1: Hoare triple {496#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {496#true} is VALID [2020-07-29 01:18:02,499 INFO L280 TraceCheckUtils]: 2: Hoare triple {496#true} assume true; {496#true} is VALID [2020-07-29 01:18:02,499 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {496#true} {496#true} #63#return; {496#true} is VALID [2020-07-29 01:18:02,500 INFO L263 TraceCheckUtils]: 4: Hoare triple {496#true} call #t~ret8 := main(); {496#true} is VALID [2020-07-29 01:18:02,501 INFO L280 TraceCheckUtils]: 5: Hoare triple {496#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.allocOnStack(4192);~k~0 := 0;~i~0 := 0; {524#(and (<= 0 main_~i~0) (= 4192 (select |#length| |main_~#a~0.base|)) (= 0 |main_~#a~0.offset|))} is VALID [2020-07-29 01:18:02,503 INFO L280 TraceCheckUtils]: 6: Hoare triple {524#(and (<= 0 main_~i~0) (= 4192 (select |#length| |main_~#a~0.base|)) (= 0 |main_~#a~0.offset|))} assume !!(~i~0 < 1048);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {524#(and (<= 0 main_~i~0) (= 4192 (select |#length| |main_~#a~0.base|)) (= 0 |main_~#a~0.offset|))} is VALID [2020-07-29 01:18:02,504 INFO L280 TraceCheckUtils]: 7: Hoare triple {524#(and (<= 0 main_~i~0) (= 4192 (select |#length| |main_~#a~0.base|)) (= 0 |main_~#a~0.offset|))} SUMMARY for call write~int(#t~nondet1, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); srcloc: L15 {524#(and (<= 0 main_~i~0) (= 4192 (select |#length| |main_~#a~0.base|)) (= 0 |main_~#a~0.offset|))} is VALID [2020-07-29 01:18:02,505 INFO L280 TraceCheckUtils]: 8: Hoare triple {524#(and (<= 0 main_~i~0) (= 4192 (select |#length| |main_~#a~0.base|)) (= 0 |main_~#a~0.offset|))} havoc #t~nondet1; {524#(and (<= 0 main_~i~0) (= 4192 (select |#length| |main_~#a~0.base|)) (= 0 |main_~#a~0.offset|))} is VALID [2020-07-29 01:18:02,507 INFO L280 TraceCheckUtils]: 9: Hoare triple {524#(and (<= 0 main_~i~0) (= 4192 (select |#length| |main_~#a~0.base|)) (= 0 |main_~#a~0.offset|))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {502#(and (= (select |#length| |main_~#a~0.base|) 4192) (<= 1 main_~i~0) (= 0 |main_~#a~0.offset|))} is VALID [2020-07-29 01:18:02,508 INFO L280 TraceCheckUtils]: 10: Hoare triple {502#(and (= (select |#length| |main_~#a~0.base|) 4192) (<= 1 main_~i~0) (= 0 |main_~#a~0.offset|))} assume !!(~i~0 < 1048);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {502#(and (= (select |#length| |main_~#a~0.base|) 4192) (<= 1 main_~i~0) (= 0 |main_~#a~0.offset|))} is VALID [2020-07-29 01:18:02,510 INFO L280 TraceCheckUtils]: 11: Hoare triple {502#(and (= (select |#length| |main_~#a~0.base|) 4192) (<= 1 main_~i~0) (= 0 |main_~#a~0.offset|))} SUMMARY for call write~int(#t~nondet1, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); srcloc: L15 {502#(and (= (select |#length| |main_~#a~0.base|) 4192) (<= 1 main_~i~0) (= 0 |main_~#a~0.offset|))} is VALID [2020-07-29 01:18:02,511 INFO L280 TraceCheckUtils]: 12: Hoare triple {502#(and (= (select |#length| |main_~#a~0.base|) 4192) (<= 1 main_~i~0) (= 0 |main_~#a~0.offset|))} havoc #t~nondet1; {502#(and (= (select |#length| |main_~#a~0.base|) 4192) (<= 1 main_~i~0) (= 0 |main_~#a~0.offset|))} is VALID [2020-07-29 01:18:02,513 INFO L280 TraceCheckUtils]: 13: Hoare triple {502#(and (= (select |#length| |main_~#a~0.base|) 4192) (<= 1 main_~i~0) (= 0 |main_~#a~0.offset|))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {503#(and (<= 2 main_~i~0) (= (select |#length| |main_~#a~0.base|) 4192) (= 0 |main_~#a~0.offset|))} is VALID [2020-07-29 01:18:02,514 INFO L280 TraceCheckUtils]: 14: Hoare triple {503#(and (<= 2 main_~i~0) (= (select |#length| |main_~#a~0.base|) 4192) (= 0 |main_~#a~0.offset|))} assume !!(~i~0 < 1048);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {504#(and (<= 2 main_~i~0) (<= main_~i~0 1047) (= (select |#length| |main_~#a~0.base|) 4192) (= 0 |main_~#a~0.offset|))} is VALID [2020-07-29 01:18:02,516 INFO L280 TraceCheckUtils]: 15: Hoare triple {504#(and (<= 2 main_~i~0) (<= main_~i~0 1047) (= (select |#length| |main_~#a~0.base|) 4192) (= 0 |main_~#a~0.offset|))} assume !(4 + (~#a~0.offset + 4 * ~i~0) <= #length[~#a~0.base] && 0 <= ~#a~0.offset + 4 * ~i~0); {497#false} is VALID [2020-07-29 01:18:02,518 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:02,518 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-29 01:18:02,518 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2020-07-29 01:18:02,519 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564040083] [2020-07-29 01:18:02,519 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2020-07-29 01:18:02,520 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:18:02,520 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-29 01:18:02,543 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:02,543 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-29 01:18:02,544 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:18:02,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-29 01:18:02,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2020-07-29 01:18:02,545 INFO L87 Difference]: Start difference. First operand 33 states and 36 transitions. Second operand 6 states. [2020-07-29 01:18:02,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:18:02,746 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2020-07-29 01:18:02,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-29 01:18:02,746 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2020-07-29 01:18:02,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:18:02,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-29 01:18:02,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 38 transitions. [2020-07-29 01:18:02,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-29 01:18:02,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 38 transitions. [2020-07-29 01:18:02,756 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 38 transitions. [2020-07-29 01:18:02,813 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:18:02,831 INFO L225 Difference]: With dead ends: 34 [2020-07-29 01:18:02,831 INFO L226 Difference]: Without dead ends: 34 [2020-07-29 01:18:02,831 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 14 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2020-07-29 01:18:02,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2020-07-29 01:18:02,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 31. [2020-07-29 01:18:02,835 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:18:02,835 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand 31 states. [2020-07-29 01:18:02,835 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 31 states. [2020-07-29 01:18:02,835 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 31 states. [2020-07-29 01:18:02,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:18:02,838 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2020-07-29 01:18:02,838 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2020-07-29 01:18:02,839 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:18:02,839 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:18:02,839 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 34 states. [2020-07-29 01:18:02,839 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 34 states. [2020-07-29 01:18:02,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:18:02,841 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2020-07-29 01:18:02,842 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2020-07-29 01:18:02,842 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:18:02,842 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:18:02,842 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:18:02,842 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:18:02,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-07-29 01:18:02,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2020-07-29 01:18:02,844 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 16 [2020-07-29 01:18:02,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:18:02,845 INFO L479 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2020-07-29 01:18:02,845 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-29 01:18:02,845 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2020-07-29 01:18:02,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-07-29 01:18:02,845 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:18:02,846 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:18:03,058 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-29 01:18:03,059 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-07-29 01:18:03,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:18:03,062 INFO L82 PathProgramCache]: Analyzing trace with hash -1826117314, now seen corresponding path program 1 times [2020-07-29 01:18:03,062 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:18:03,063 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67679139] [2020-07-29 01:18:03,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:18:03,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:18:03,163 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-07-29 01:18:03,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:18:03,170 INFO L280 TraceCheckUtils]: 0: Hoare triple {695#(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; {687#true} is VALID [2020-07-29 01:18:03,171 INFO L280 TraceCheckUtils]: 1: Hoare triple {687#true} assume true; {687#true} is VALID [2020-07-29 01:18:03,171 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {687#true} {687#true} #63#return; {687#true} is VALID [2020-07-29 01:18:03,172 INFO L263 TraceCheckUtils]: 0: Hoare triple {687#true} call ULTIMATE.init(); {695#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-29 01:18:03,172 INFO L280 TraceCheckUtils]: 1: Hoare triple {695#(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; {687#true} is VALID [2020-07-29 01:18:03,173 INFO L280 TraceCheckUtils]: 2: Hoare triple {687#true} assume true; {687#true} is VALID [2020-07-29 01:18:03,173 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {687#true} {687#true} #63#return; {687#true} is VALID [2020-07-29 01:18:03,173 INFO L263 TraceCheckUtils]: 4: Hoare triple {687#true} call #t~ret8 := main(); {687#true} is VALID [2020-07-29 01:18:03,174 INFO L280 TraceCheckUtils]: 5: Hoare triple {687#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.allocOnStack(4192);~k~0 := 0;~i~0 := 0; {692#(= 0 main_~i~0)} is VALID [2020-07-29 01:18:03,175 INFO L280 TraceCheckUtils]: 6: Hoare triple {692#(= 0 main_~i~0)} assume !!(~i~0 < 1048);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {692#(= 0 main_~i~0)} is VALID [2020-07-29 01:18:03,175 INFO L280 TraceCheckUtils]: 7: Hoare triple {692#(= 0 main_~i~0)} SUMMARY for call write~int(#t~nondet1, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); srcloc: L15 {692#(= 0 main_~i~0)} is VALID [2020-07-29 01:18:03,176 INFO L280 TraceCheckUtils]: 8: Hoare triple {692#(= 0 main_~i~0)} havoc #t~nondet1; {692#(= 0 main_~i~0)} is VALID [2020-07-29 01:18:03,177 INFO L280 TraceCheckUtils]: 9: Hoare triple {692#(= 0 main_~i~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {693#(<= main_~i~0 1)} is VALID [2020-07-29 01:18:03,177 INFO L280 TraceCheckUtils]: 10: Hoare triple {693#(<= main_~i~0 1)} assume !!(~i~0 < 1048);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {693#(<= main_~i~0 1)} is VALID [2020-07-29 01:18:03,178 INFO L280 TraceCheckUtils]: 11: Hoare triple {693#(<= main_~i~0 1)} SUMMARY for call write~int(#t~nondet1, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); srcloc: L15 {693#(<= main_~i~0 1)} is VALID [2020-07-29 01:18:03,179 INFO L280 TraceCheckUtils]: 12: Hoare triple {693#(<= main_~i~0 1)} havoc #t~nondet1; {693#(<= main_~i~0 1)} is VALID [2020-07-29 01:18:03,180 INFO L280 TraceCheckUtils]: 13: Hoare triple {693#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {694#(<= main_~i~0 2)} is VALID [2020-07-29 01:18:03,180 INFO L280 TraceCheckUtils]: 14: Hoare triple {694#(<= main_~i~0 2)} assume !(~i~0 < 1048); {688#false} is VALID [2020-07-29 01:18:03,180 INFO L280 TraceCheckUtils]: 15: Hoare triple {688#false} #t~short3 := ~k~0 < 1048; {688#false} is VALID [2020-07-29 01:18:03,181 INFO L280 TraceCheckUtils]: 16: Hoare triple {688#false} assume #t~short3; {688#false} is VALID [2020-07-29 01:18:03,181 INFO L280 TraceCheckUtils]: 17: Hoare triple {688#false} assume !(4 + (~#a~0.offset + 4 * ~k~0) <= #length[~#a~0.base] && 0 <= ~#a~0.offset + 4 * ~k~0); {688#false} is VALID [2020-07-29 01:18:03,182 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:03,182 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67679139] [2020-07-29 01:18:03,182 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [177327869] [2020-07-29 01:18:03,182 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:03,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:18:03,214 INFO L263 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 01:18:03,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:18:03,223 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:18:03,347 INFO L263 TraceCheckUtils]: 0: Hoare triple {687#true} call ULTIMATE.init(); {687#true} is VALID [2020-07-29 01:18:03,348 INFO L280 TraceCheckUtils]: 1: Hoare triple {687#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {687#true} is VALID [2020-07-29 01:18:03,348 INFO L280 TraceCheckUtils]: 2: Hoare triple {687#true} assume true; {687#true} is VALID [2020-07-29 01:18:03,348 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {687#true} {687#true} #63#return; {687#true} is VALID [2020-07-29 01:18:03,349 INFO L263 TraceCheckUtils]: 4: Hoare triple {687#true} call #t~ret8 := main(); {687#true} is VALID [2020-07-29 01:18:03,350 INFO L280 TraceCheckUtils]: 5: Hoare triple {687#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.allocOnStack(4192);~k~0 := 0;~i~0 := 0; {714#(<= main_~i~0 0)} is VALID [2020-07-29 01:18:03,350 INFO L280 TraceCheckUtils]: 6: Hoare triple {714#(<= main_~i~0 0)} assume !!(~i~0 < 1048);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {714#(<= main_~i~0 0)} is VALID [2020-07-29 01:18:03,351 INFO L280 TraceCheckUtils]: 7: Hoare triple {714#(<= main_~i~0 0)} SUMMARY for call write~int(#t~nondet1, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); srcloc: L15 {714#(<= main_~i~0 0)} is VALID [2020-07-29 01:18:03,352 INFO L280 TraceCheckUtils]: 8: Hoare triple {714#(<= main_~i~0 0)} havoc #t~nondet1; {714#(<= main_~i~0 0)} is VALID [2020-07-29 01:18:03,353 INFO L280 TraceCheckUtils]: 9: Hoare triple {714#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {693#(<= main_~i~0 1)} is VALID [2020-07-29 01:18:03,353 INFO L280 TraceCheckUtils]: 10: Hoare triple {693#(<= main_~i~0 1)} assume !!(~i~0 < 1048);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {693#(<= main_~i~0 1)} is VALID [2020-07-29 01:18:03,354 INFO L280 TraceCheckUtils]: 11: Hoare triple {693#(<= main_~i~0 1)} SUMMARY for call write~int(#t~nondet1, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); srcloc: L15 {693#(<= main_~i~0 1)} is VALID [2020-07-29 01:18:03,355 INFO L280 TraceCheckUtils]: 12: Hoare triple {693#(<= main_~i~0 1)} havoc #t~nondet1; {693#(<= main_~i~0 1)} is VALID [2020-07-29 01:18:03,356 INFO L280 TraceCheckUtils]: 13: Hoare triple {693#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {694#(<= main_~i~0 2)} is VALID [2020-07-29 01:18:03,357 INFO L280 TraceCheckUtils]: 14: Hoare triple {694#(<= main_~i~0 2)} assume !(~i~0 < 1048); {688#false} is VALID [2020-07-29 01:18:03,357 INFO L280 TraceCheckUtils]: 15: Hoare triple {688#false} #t~short3 := ~k~0 < 1048; {688#false} is VALID [2020-07-29 01:18:03,357 INFO L280 TraceCheckUtils]: 16: Hoare triple {688#false} assume #t~short3; {688#false} is VALID [2020-07-29 01:18:03,358 INFO L280 TraceCheckUtils]: 17: Hoare triple {688#false} assume !(4 + (~#a~0.offset + 4 * ~k~0) <= #length[~#a~0.base] && 0 <= ~#a~0.offset + 4 * ~k~0); {688#false} is VALID [2020-07-29 01:18:03,358 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:03,359 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-29 01:18:03,359 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 7 [2020-07-29 01:18:03,359 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674096866] [2020-07-29 01:18:03,360 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2020-07-29 01:18:03,360 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:18:03,360 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-29 01:18:03,389 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:03,390 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-29 01:18:03,390 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:18:03,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-29 01:18:03,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-07-29 01:18:03,390 INFO L87 Difference]: Start difference. First operand 31 states and 34 transitions. Second operand 7 states. [2020-07-29 01:18:03,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:18:03,579 INFO L93 Difference]: Finished difference Result 38 states and 41 transitions. [2020-07-29 01:18:03,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-29 01:18:03,579 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2020-07-29 01:18:03,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:18:03,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-29 01:18:03,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 42 transitions. [2020-07-29 01:18:03,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-29 01:18:03,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 42 transitions. [2020-07-29 01:18:03,584 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 42 transitions. [2020-07-29 01:18:03,645 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:18:03,646 INFO L225 Difference]: With dead ends: 38 [2020-07-29 01:18:03,647 INFO L226 Difference]: Without dead ends: 38 [2020-07-29 01:18:03,647 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:03,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2020-07-29 01:18:03,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 35. [2020-07-29 01:18:03,651 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:18:03,652 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand 35 states. [2020-07-29 01:18:03,652 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 35 states. [2020-07-29 01:18:03,652 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 35 states. [2020-07-29 01:18:03,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:18:03,655 INFO L93 Difference]: Finished difference Result 38 states and 41 transitions. [2020-07-29 01:18:03,655 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2020-07-29 01:18:03,655 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:18:03,656 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:18:03,656 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 38 states. [2020-07-29 01:18:03,656 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 38 states. [2020-07-29 01:18:03,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:18:03,659 INFO L93 Difference]: Finished difference Result 38 states and 41 transitions. [2020-07-29 01:18:03,662 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2020-07-29 01:18:03,664 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:18:03,665 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:18:03,665 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:18:03,665 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:18:03,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2020-07-29 01:18:03,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 38 transitions. [2020-07-29 01:18:03,672 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 38 transitions. Word has length 18 [2020-07-29 01:18:03,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:18:03,675 INFO L479 AbstractCegarLoop]: Abstraction has 35 states and 38 transitions. [2020-07-29 01:18:03,675 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-29 01:18:03,675 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2020-07-29 01:18:03,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-07-29 01:18:03,676 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:18:03,676 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:18:03,879 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-29 01:18:03,880 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-07-29 01:18:03,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:18:03,881 INFO L82 PathProgramCache]: Analyzing trace with hash 945846593, now seen corresponding path program 2 times [2020-07-29 01:18:03,882 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:18:03,882 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317612626] [2020-07-29 01:18:03,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:18:03,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:18:03,962 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-07-29 01:18:03,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:18:03,968 INFO L280 TraceCheckUtils]: 0: Hoare triple {905#(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; {899#true} is VALID [2020-07-29 01:18:03,968 INFO L280 TraceCheckUtils]: 1: Hoare triple {899#true} assume true; {899#true} is VALID [2020-07-29 01:18:03,969 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {899#true} {899#true} #63#return; {899#true} is VALID [2020-07-29 01:18:03,970 INFO L263 TraceCheckUtils]: 0: Hoare triple {899#true} call ULTIMATE.init(); {905#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-29 01:18:03,970 INFO L280 TraceCheckUtils]: 1: Hoare triple {905#(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; {899#true} is VALID [2020-07-29 01:18:03,970 INFO L280 TraceCheckUtils]: 2: Hoare triple {899#true} assume true; {899#true} is VALID [2020-07-29 01:18:03,970 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {899#true} {899#true} #63#return; {899#true} is VALID [2020-07-29 01:18:03,971 INFO L263 TraceCheckUtils]: 4: Hoare triple {899#true} call #t~ret8 := main(); {899#true} is VALID [2020-07-29 01:18:03,972 INFO L280 TraceCheckUtils]: 5: Hoare triple {899#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.allocOnStack(4192);~k~0 := 0;~i~0 := 0; {904#(and (= 0 main_~k~0) (= (select |#length| |main_~#a~0.base|) 4192) (= 0 |main_~#a~0.offset|))} is VALID [2020-07-29 01:18:03,974 INFO L280 TraceCheckUtils]: 6: Hoare triple {904#(and (= 0 main_~k~0) (= (select |#length| |main_~#a~0.base|) 4192) (= 0 |main_~#a~0.offset|))} assume !!(~i~0 < 1048);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {904#(and (= 0 main_~k~0) (= (select |#length| |main_~#a~0.base|) 4192) (= 0 |main_~#a~0.offset|))} is VALID [2020-07-29 01:18:03,975 INFO L280 TraceCheckUtils]: 7: Hoare triple {904#(and (= 0 main_~k~0) (= (select |#length| |main_~#a~0.base|) 4192) (= 0 |main_~#a~0.offset|))} SUMMARY for call write~int(#t~nondet1, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); srcloc: L15 {904#(and (= 0 main_~k~0) (= (select |#length| |main_~#a~0.base|) 4192) (= 0 |main_~#a~0.offset|))} is VALID [2020-07-29 01:18:03,976 INFO L280 TraceCheckUtils]: 8: Hoare triple {904#(and (= 0 main_~k~0) (= (select |#length| |main_~#a~0.base|) 4192) (= 0 |main_~#a~0.offset|))} havoc #t~nondet1; {904#(and (= 0 main_~k~0) (= (select |#length| |main_~#a~0.base|) 4192) (= 0 |main_~#a~0.offset|))} is VALID [2020-07-29 01:18:03,977 INFO L280 TraceCheckUtils]: 9: Hoare triple {904#(and (= 0 main_~k~0) (= (select |#length| |main_~#a~0.base|) 4192) (= 0 |main_~#a~0.offset|))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {904#(and (= 0 main_~k~0) (= (select |#length| |main_~#a~0.base|) 4192) (= 0 |main_~#a~0.offset|))} is VALID [2020-07-29 01:18:03,978 INFO L280 TraceCheckUtils]: 10: Hoare triple {904#(and (= 0 main_~k~0) (= (select |#length| |main_~#a~0.base|) 4192) (= 0 |main_~#a~0.offset|))} assume !!(~i~0 < 1048);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {904#(and (= 0 main_~k~0) (= (select |#length| |main_~#a~0.base|) 4192) (= 0 |main_~#a~0.offset|))} is VALID [2020-07-29 01:18:03,978 INFO L280 TraceCheckUtils]: 11: Hoare triple {904#(and (= 0 main_~k~0) (= (select |#length| |main_~#a~0.base|) 4192) (= 0 |main_~#a~0.offset|))} SUMMARY for call write~int(#t~nondet1, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); srcloc: L15 {904#(and (= 0 main_~k~0) (= (select |#length| |main_~#a~0.base|) 4192) (= 0 |main_~#a~0.offset|))} is VALID [2020-07-29 01:18:03,979 INFO L280 TraceCheckUtils]: 12: Hoare triple {904#(and (= 0 main_~k~0) (= (select |#length| |main_~#a~0.base|) 4192) (= 0 |main_~#a~0.offset|))} havoc #t~nondet1; {904#(and (= 0 main_~k~0) (= (select |#length| |main_~#a~0.base|) 4192) (= 0 |main_~#a~0.offset|))} is VALID [2020-07-29 01:18:03,980 INFO L280 TraceCheckUtils]: 13: Hoare triple {904#(and (= 0 main_~k~0) (= (select |#length| |main_~#a~0.base|) 4192) (= 0 |main_~#a~0.offset|))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {904#(and (= 0 main_~k~0) (= (select |#length| |main_~#a~0.base|) 4192) (= 0 |main_~#a~0.offset|))} is VALID [2020-07-29 01:18:03,980 INFO L280 TraceCheckUtils]: 14: Hoare triple {904#(and (= 0 main_~k~0) (= (select |#length| |main_~#a~0.base|) 4192) (= 0 |main_~#a~0.offset|))} assume !!(~i~0 < 1048);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {904#(and (= 0 main_~k~0) (= (select |#length| |main_~#a~0.base|) 4192) (= 0 |main_~#a~0.offset|))} is VALID [2020-07-29 01:18:03,982 INFO L280 TraceCheckUtils]: 15: Hoare triple {904#(and (= 0 main_~k~0) (= (select |#length| |main_~#a~0.base|) 4192) (= 0 |main_~#a~0.offset|))} SUMMARY for call write~int(#t~nondet1, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); srcloc: L15 {904#(and (= 0 main_~k~0) (= (select |#length| |main_~#a~0.base|) 4192) (= 0 |main_~#a~0.offset|))} is VALID [2020-07-29 01:18:03,982 INFO L280 TraceCheckUtils]: 16: Hoare triple {904#(and (= 0 main_~k~0) (= (select |#length| |main_~#a~0.base|) 4192) (= 0 |main_~#a~0.offset|))} havoc #t~nondet1; {904#(and (= 0 main_~k~0) (= (select |#length| |main_~#a~0.base|) 4192) (= 0 |main_~#a~0.offset|))} is VALID [2020-07-29 01:18:03,983 INFO L280 TraceCheckUtils]: 17: Hoare triple {904#(and (= 0 main_~k~0) (= (select |#length| |main_~#a~0.base|) 4192) (= 0 |main_~#a~0.offset|))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {904#(and (= 0 main_~k~0) (= (select |#length| |main_~#a~0.base|) 4192) (= 0 |main_~#a~0.offset|))} is VALID [2020-07-29 01:18:03,983 INFO L280 TraceCheckUtils]: 18: Hoare triple {904#(and (= 0 main_~k~0) (= (select |#length| |main_~#a~0.base|) 4192) (= 0 |main_~#a~0.offset|))} assume !(~i~0 < 1048); {904#(and (= 0 main_~k~0) (= (select |#length| |main_~#a~0.base|) 4192) (= 0 |main_~#a~0.offset|))} is VALID [2020-07-29 01:18:03,984 INFO L280 TraceCheckUtils]: 19: Hoare triple {904#(and (= 0 main_~k~0) (= (select |#length| |main_~#a~0.base|) 4192) (= 0 |main_~#a~0.offset|))} #t~short3 := ~k~0 < 1048; {904#(and (= 0 main_~k~0) (= (select |#length| |main_~#a~0.base|) 4192) (= 0 |main_~#a~0.offset|))} is VALID [2020-07-29 01:18:03,985 INFO L280 TraceCheckUtils]: 20: Hoare triple {904#(and (= 0 main_~k~0) (= (select |#length| |main_~#a~0.base|) 4192) (= 0 |main_~#a~0.offset|))} assume #t~short3; {904#(and (= 0 main_~k~0) (= (select |#length| |main_~#a~0.base|) 4192) (= 0 |main_~#a~0.offset|))} is VALID [2020-07-29 01:18:03,986 INFO L280 TraceCheckUtils]: 21: Hoare triple {904#(and (= 0 main_~k~0) (= (select |#length| |main_~#a~0.base|) 4192) (= 0 |main_~#a~0.offset|))} assume !(4 + (~#a~0.offset + 4 * ~k~0) <= #length[~#a~0.base] && 0 <= ~#a~0.offset + 4 * ~k~0); {900#false} is VALID [2020-07-29 01:18:03,988 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:03,988 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317612626] [2020-07-29 01:18:03,988 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:18:03,988 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-29 01:18:03,988 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380688290] [2020-07-29 01:18:03,989 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2020-07-29 01:18:03,989 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:18:03,989 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 01:18:04,016 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:04,016 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-29 01:18:04,016 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:18:04,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-29 01:18:04,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-29 01:18:04,017 INFO L87 Difference]: Start difference. First operand 35 states and 38 transitions. Second operand 4 states. [2020-07-29 01:18:04,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:18:04,186 INFO L93 Difference]: Finished difference Result 46 states and 52 transitions. [2020-07-29 01:18:04,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-29 01:18:04,187 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2020-07-29 01:18:04,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:18:04,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 01:18:04,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 46 transitions. [2020-07-29 01:18:04,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 01:18:04,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 46 transitions. [2020-07-29 01:18:04,191 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 46 transitions. [2020-07-29 01:18:04,257 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:18:04,258 INFO L225 Difference]: With dead ends: 46 [2020-07-29 01:18:04,258 INFO L226 Difference]: Without dead ends: 46 [2020-07-29 01:18:04,259 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:04,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2020-07-29 01:18:04,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 45. [2020-07-29 01:18:04,266 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:18:04,266 INFO L82 GeneralOperation]: Start isEquivalent. First operand 46 states. Second operand 45 states. [2020-07-29 01:18:04,266 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand 45 states. [2020-07-29 01:18:04,266 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 45 states. [2020-07-29 01:18:04,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:18:04,269 INFO L93 Difference]: Finished difference Result 46 states and 52 transitions. [2020-07-29 01:18:04,269 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 52 transitions. [2020-07-29 01:18:04,269 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:18:04,269 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:18:04,269 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand 46 states. [2020-07-29 01:18:04,270 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 46 states. [2020-07-29 01:18:04,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:18:04,271 INFO L93 Difference]: Finished difference Result 46 states and 52 transitions. [2020-07-29 01:18:04,271 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 52 transitions. [2020-07-29 01:18:04,271 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:18:04,272 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:18:04,272 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:18:04,272 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:18:04,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2020-07-29 01:18:04,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 51 transitions. [2020-07-29 01:18:04,274 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 51 transitions. Word has length 22 [2020-07-29 01:18:04,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:18:04,274 INFO L479 AbstractCegarLoop]: Abstraction has 45 states and 51 transitions. [2020-07-29 01:18:04,274 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-29 01:18:04,274 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 51 transitions. [2020-07-29 01:18:04,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-07-29 01:18:04,275 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:18:04,275 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:04,275 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-29 01:18:04,275 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-07-29 01:18:04,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:18:04,276 INFO L82 PathProgramCache]: Analyzing trace with hash -1574303516, now seen corresponding path program 1 times [2020-07-29 01:18:04,276 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:18:04,276 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110763114] [2020-07-29 01:18:04,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:18:04,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:18:04,336 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-07-29 01:18:04,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:18:04,341 INFO L280 TraceCheckUtils]: 0: Hoare triple {1098#(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; {1091#true} is VALID [2020-07-29 01:18:04,341 INFO L280 TraceCheckUtils]: 1: Hoare triple {1091#true} assume true; {1091#true} is VALID [2020-07-29 01:18:04,341 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1091#true} {1091#true} #63#return; {1091#true} is VALID [2020-07-29 01:18:04,342 INFO L263 TraceCheckUtils]: 0: Hoare triple {1091#true} call ULTIMATE.init(); {1098#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-29 01:18:04,342 INFO L280 TraceCheckUtils]: 1: Hoare triple {1098#(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; {1091#true} is VALID [2020-07-29 01:18:04,343 INFO L280 TraceCheckUtils]: 2: Hoare triple {1091#true} assume true; {1091#true} is VALID [2020-07-29 01:18:04,343 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1091#true} {1091#true} #63#return; {1091#true} is VALID [2020-07-29 01:18:04,343 INFO L263 TraceCheckUtils]: 4: Hoare triple {1091#true} call #t~ret8 := main(); {1091#true} is VALID [2020-07-29 01:18:04,344 INFO L280 TraceCheckUtils]: 5: Hoare triple {1091#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.allocOnStack(4192);~k~0 := 0;~i~0 := 0; {1096#(= 0 main_~k~0)} is VALID [2020-07-29 01:18:04,344 INFO L280 TraceCheckUtils]: 6: Hoare triple {1096#(= 0 main_~k~0)} assume !!(~i~0 < 1048);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {1096#(= 0 main_~k~0)} is VALID [2020-07-29 01:18:04,345 INFO L280 TraceCheckUtils]: 7: Hoare triple {1096#(= 0 main_~k~0)} SUMMARY for call write~int(#t~nondet1, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); srcloc: L15 {1096#(= 0 main_~k~0)} is VALID [2020-07-29 01:18:04,346 INFO L280 TraceCheckUtils]: 8: Hoare triple {1096#(= 0 main_~k~0)} havoc #t~nondet1; {1096#(= 0 main_~k~0)} is VALID [2020-07-29 01:18:04,346 INFO L280 TraceCheckUtils]: 9: Hoare triple {1096#(= 0 main_~k~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1096#(= 0 main_~k~0)} is VALID [2020-07-29 01:18:04,347 INFO L280 TraceCheckUtils]: 10: Hoare triple {1096#(= 0 main_~k~0)} assume !!(~i~0 < 1048);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {1096#(= 0 main_~k~0)} is VALID [2020-07-29 01:18:04,347 INFO L280 TraceCheckUtils]: 11: Hoare triple {1096#(= 0 main_~k~0)} SUMMARY for call write~int(#t~nondet1, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); srcloc: L15 {1096#(= 0 main_~k~0)} is VALID [2020-07-29 01:18:04,348 INFO L280 TraceCheckUtils]: 12: Hoare triple {1096#(= 0 main_~k~0)} havoc #t~nondet1; {1096#(= 0 main_~k~0)} is VALID [2020-07-29 01:18:04,348 INFO L280 TraceCheckUtils]: 13: Hoare triple {1096#(= 0 main_~k~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1096#(= 0 main_~k~0)} is VALID [2020-07-29 01:18:04,349 INFO L280 TraceCheckUtils]: 14: Hoare triple {1096#(= 0 main_~k~0)} assume !!(~i~0 < 1048);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {1096#(= 0 main_~k~0)} is VALID [2020-07-29 01:18:04,350 INFO L280 TraceCheckUtils]: 15: Hoare triple {1096#(= 0 main_~k~0)} SUMMARY for call write~int(#t~nondet1, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); srcloc: L15 {1096#(= 0 main_~k~0)} is VALID [2020-07-29 01:18:04,350 INFO L280 TraceCheckUtils]: 16: Hoare triple {1096#(= 0 main_~k~0)} havoc #t~nondet1; {1096#(= 0 main_~k~0)} is VALID [2020-07-29 01:18:04,351 INFO L280 TraceCheckUtils]: 17: Hoare triple {1096#(= 0 main_~k~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1096#(= 0 main_~k~0)} is VALID [2020-07-29 01:18:04,351 INFO L280 TraceCheckUtils]: 18: Hoare triple {1096#(= 0 main_~k~0)} assume !(~i~0 < 1048); {1096#(= 0 main_~k~0)} is VALID [2020-07-29 01:18:04,352 INFO L280 TraceCheckUtils]: 19: Hoare triple {1096#(= 0 main_~k~0)} #t~short3 := ~k~0 < 1048; {1097#|main_#t~short3|} is VALID [2020-07-29 01:18:04,353 INFO L280 TraceCheckUtils]: 20: Hoare triple {1097#|main_#t~short3|} assume !#t~short3; {1092#false} is VALID [2020-07-29 01:18:04,353 INFO L280 TraceCheckUtils]: 21: Hoare triple {1092#false} assume !#t~short3;havoc #t~short3;havoc #t~mem2; {1092#false} is VALID [2020-07-29 01:18:04,353 INFO L280 TraceCheckUtils]: 22: Hoare triple {1092#false} #res := 0;call ULTIMATE.dealloc(~#a~0.base, ~#a~0.offset);havoc ~#a~0.base, ~#a~0.offset; {1092#false} is VALID [2020-07-29 01:18:04,353 INFO L280 TraceCheckUtils]: 23: Hoare triple {1092#false} assume !(#valid == old(#valid)); {1092#false} is VALID [2020-07-29 01:18:04,354 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:04,355 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110763114] [2020-07-29 01:18:04,355 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:18:04,355 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-29 01:18:04,355 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132686311] [2020-07-29 01:18:04,356 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2020-07-29 01:18:04,356 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:18:04,356 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-29 01:18:04,373 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:04,373 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-29 01:18:04,374 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:18:04,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-29 01:18:04,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-29 01:18:04,374 INFO L87 Difference]: Start difference. First operand 45 states and 51 transitions. Second operand 5 states. [2020-07-29 01:18:04,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:18:04,546 INFO L93 Difference]: Finished difference Result 48 states and 52 transitions. [2020-07-29 01:18:04,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-29 01:18:04,547 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2020-07-29 01:18:04,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:18:04,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-29 01:18:04,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 44 transitions. [2020-07-29 01:18:04,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-29 01:18:04,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 44 transitions. [2020-07-29 01:18:04,551 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 44 transitions. [2020-07-29 01:18:04,613 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:04,615 INFO L225 Difference]: With dead ends: 48 [2020-07-29 01:18:04,615 INFO L226 Difference]: Without dead ends: 48 [2020-07-29 01:18:04,615 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-29 01:18:04,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2020-07-29 01:18:04,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 45. [2020-07-29 01:18:04,619 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:18:04,619 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand 45 states. [2020-07-29 01:18:04,619 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand 45 states. [2020-07-29 01:18:04,620 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 45 states. [2020-07-29 01:18:04,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:18:04,622 INFO L93 Difference]: Finished difference Result 48 states and 52 transitions. [2020-07-29 01:18:04,622 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 52 transitions. [2020-07-29 01:18:04,623 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:18:04,623 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:18:04,623 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand 48 states. [2020-07-29 01:18:04,623 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 48 states. [2020-07-29 01:18:04,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:18:04,626 INFO L93 Difference]: Finished difference Result 48 states and 52 transitions. [2020-07-29 01:18:04,626 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 52 transitions. [2020-07-29 01:18:04,626 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:18:04,626 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:18:04,627 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:18:04,627 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:18:04,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2020-07-29 01:18:04,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 50 transitions. [2020-07-29 01:18:04,629 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 50 transitions. Word has length 24 [2020-07-29 01:18:04,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:18:04,630 INFO L479 AbstractCegarLoop]: Abstraction has 45 states and 50 transitions. [2020-07-29 01:18:04,630 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-29 01:18:04,630 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 50 transitions. [2020-07-29 01:18:04,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-07-29 01:18:04,631 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:18:04,631 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:18:04,631 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-29 01:18:04,631 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-07-29 01:18:04,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:18:04,632 INFO L82 PathProgramCache]: Analyzing trace with hash -1258071097, now seen corresponding path program 1 times [2020-07-29 01:18:04,632 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:18:04,633 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125962274] [2020-07-29 01:18:04,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:18:04,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:18:04,742 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-07-29 01:18:04,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:18:04,749 INFO L280 TraceCheckUtils]: 0: Hoare triple {1301#(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; {1292#true} is VALID [2020-07-29 01:18:04,750 INFO L280 TraceCheckUtils]: 1: Hoare triple {1292#true} assume true; {1292#true} is VALID [2020-07-29 01:18:04,750 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1292#true} {1292#true} #63#return; {1292#true} is VALID [2020-07-29 01:18:04,751 INFO L263 TraceCheckUtils]: 0: Hoare triple {1292#true} call ULTIMATE.init(); {1301#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-29 01:18:04,751 INFO L280 TraceCheckUtils]: 1: Hoare triple {1301#(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; {1292#true} is VALID [2020-07-29 01:18:04,751 INFO L280 TraceCheckUtils]: 2: Hoare triple {1292#true} assume true; {1292#true} is VALID [2020-07-29 01:18:04,751 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1292#true} {1292#true} #63#return; {1292#true} is VALID [2020-07-29 01:18:04,751 INFO L263 TraceCheckUtils]: 4: Hoare triple {1292#true} call #t~ret8 := main(); {1292#true} is VALID [2020-07-29 01:18:04,752 INFO L280 TraceCheckUtils]: 5: Hoare triple {1292#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.allocOnStack(4192);~k~0 := 0;~i~0 := 0; {1297#(= 0 main_~i~0)} is VALID [2020-07-29 01:18:04,752 INFO L280 TraceCheckUtils]: 6: Hoare triple {1297#(= 0 main_~i~0)} assume !!(~i~0 < 1048);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {1297#(= 0 main_~i~0)} is VALID [2020-07-29 01:18:04,753 INFO L280 TraceCheckUtils]: 7: Hoare triple {1297#(= 0 main_~i~0)} SUMMARY for call write~int(#t~nondet1, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); srcloc: L15 {1297#(= 0 main_~i~0)} is VALID [2020-07-29 01:18:04,754 INFO L280 TraceCheckUtils]: 8: Hoare triple {1297#(= 0 main_~i~0)} havoc #t~nondet1; {1297#(= 0 main_~i~0)} is VALID [2020-07-29 01:18:04,755 INFO L280 TraceCheckUtils]: 9: Hoare triple {1297#(= 0 main_~i~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1298#(<= main_~i~0 1)} is VALID [2020-07-29 01:18:04,755 INFO L280 TraceCheckUtils]: 10: Hoare triple {1298#(<= main_~i~0 1)} assume !!(~i~0 < 1048);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {1298#(<= main_~i~0 1)} is VALID [2020-07-29 01:18:04,755 INFO L280 TraceCheckUtils]: 11: Hoare triple {1298#(<= main_~i~0 1)} SUMMARY for call write~int(#t~nondet1, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); srcloc: L15 {1298#(<= main_~i~0 1)} is VALID [2020-07-29 01:18:04,756 INFO L280 TraceCheckUtils]: 12: Hoare triple {1298#(<= main_~i~0 1)} havoc #t~nondet1; {1298#(<= main_~i~0 1)} is VALID [2020-07-29 01:18:04,759 INFO L280 TraceCheckUtils]: 13: Hoare triple {1298#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1299#(<= main_~i~0 2)} is VALID [2020-07-29 01:18:04,760 INFO L280 TraceCheckUtils]: 14: Hoare triple {1299#(<= main_~i~0 2)} assume !!(~i~0 < 1048);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {1299#(<= main_~i~0 2)} is VALID [2020-07-29 01:18:04,760 INFO L280 TraceCheckUtils]: 15: Hoare triple {1299#(<= main_~i~0 2)} SUMMARY for call write~int(#t~nondet1, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); srcloc: L15 {1299#(<= main_~i~0 2)} is VALID [2020-07-29 01:18:04,761 INFO L280 TraceCheckUtils]: 16: Hoare triple {1299#(<= main_~i~0 2)} havoc #t~nondet1; {1299#(<= main_~i~0 2)} is VALID [2020-07-29 01:18:04,762 INFO L280 TraceCheckUtils]: 17: Hoare triple {1299#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1300#(<= main_~i~0 3)} is VALID [2020-07-29 01:18:04,763 INFO L280 TraceCheckUtils]: 18: Hoare triple {1300#(<= main_~i~0 3)} assume !(~i~0 < 1048); {1293#false} is VALID [2020-07-29 01:18:04,763 INFO L280 TraceCheckUtils]: 19: Hoare triple {1293#false} #t~short3 := ~k~0 < 1048; {1293#false} is VALID [2020-07-29 01:18:04,763 INFO L280 TraceCheckUtils]: 20: Hoare triple {1293#false} assume #t~short3; {1293#false} is VALID [2020-07-29 01:18:04,763 INFO L280 TraceCheckUtils]: 21: Hoare triple {1293#false} SUMMARY for call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4); srcloc: L18-1 {1293#false} is VALID [2020-07-29 01:18:04,764 INFO L280 TraceCheckUtils]: 22: Hoare triple {1293#false} #t~short3 := #t~mem2 >= 0; {1293#false} is VALID [2020-07-29 01:18:04,764 INFO L280 TraceCheckUtils]: 23: Hoare triple {1293#false} assume !#t~short3;havoc #t~short3;havoc #t~mem2; {1293#false} is VALID [2020-07-29 01:18:04,764 INFO L280 TraceCheckUtils]: 24: Hoare triple {1293#false} #res := 0;call ULTIMATE.dealloc(~#a~0.base, ~#a~0.offset);havoc ~#a~0.base, ~#a~0.offset; {1293#false} is VALID [2020-07-29 01:18:04,765 INFO L280 TraceCheckUtils]: 25: Hoare triple {1293#false} assume !(#valid == old(#valid)); {1293#false} is VALID [2020-07-29 01:18:04,766 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:04,766 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125962274] [2020-07-29 01:18:04,766 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1142738675] [2020-07-29 01:18:04,767 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:04,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:18:04,802 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-29 01:18:04,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:18:04,815 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:18:04,953 INFO L263 TraceCheckUtils]: 0: Hoare triple {1292#true} call ULTIMATE.init(); {1292#true} is VALID [2020-07-29 01:18:04,954 INFO L280 TraceCheckUtils]: 1: Hoare triple {1292#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1292#true} is VALID [2020-07-29 01:18:04,954 INFO L280 TraceCheckUtils]: 2: Hoare triple {1292#true} assume true; {1292#true} is VALID [2020-07-29 01:18:04,954 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1292#true} {1292#true} #63#return; {1292#true} is VALID [2020-07-29 01:18:04,954 INFO L263 TraceCheckUtils]: 4: Hoare triple {1292#true} call #t~ret8 := main(); {1292#true} is VALID [2020-07-29 01:18:04,955 INFO L280 TraceCheckUtils]: 5: Hoare triple {1292#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.allocOnStack(4192);~k~0 := 0;~i~0 := 0; {1320#(<= main_~i~0 0)} is VALID [2020-07-29 01:18:04,956 INFO L280 TraceCheckUtils]: 6: Hoare triple {1320#(<= main_~i~0 0)} assume !!(~i~0 < 1048);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {1320#(<= main_~i~0 0)} is VALID [2020-07-29 01:18:04,957 INFO L280 TraceCheckUtils]: 7: Hoare triple {1320#(<= main_~i~0 0)} SUMMARY for call write~int(#t~nondet1, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); srcloc: L15 {1320#(<= main_~i~0 0)} is VALID [2020-07-29 01:18:04,958 INFO L280 TraceCheckUtils]: 8: Hoare triple {1320#(<= main_~i~0 0)} havoc #t~nondet1; {1320#(<= main_~i~0 0)} is VALID [2020-07-29 01:18:04,959 INFO L280 TraceCheckUtils]: 9: Hoare triple {1320#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1298#(<= main_~i~0 1)} is VALID [2020-07-29 01:18:04,959 INFO L280 TraceCheckUtils]: 10: Hoare triple {1298#(<= main_~i~0 1)} assume !!(~i~0 < 1048);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {1298#(<= main_~i~0 1)} is VALID [2020-07-29 01:18:04,960 INFO L280 TraceCheckUtils]: 11: Hoare triple {1298#(<= main_~i~0 1)} SUMMARY for call write~int(#t~nondet1, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); srcloc: L15 {1298#(<= main_~i~0 1)} is VALID [2020-07-29 01:18:04,961 INFO L280 TraceCheckUtils]: 12: Hoare triple {1298#(<= main_~i~0 1)} havoc #t~nondet1; {1298#(<= main_~i~0 1)} is VALID [2020-07-29 01:18:04,962 INFO L280 TraceCheckUtils]: 13: Hoare triple {1298#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1299#(<= main_~i~0 2)} is VALID [2020-07-29 01:18:04,963 INFO L280 TraceCheckUtils]: 14: Hoare triple {1299#(<= main_~i~0 2)} assume !!(~i~0 < 1048);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {1299#(<= main_~i~0 2)} is VALID [2020-07-29 01:18:04,963 INFO L280 TraceCheckUtils]: 15: Hoare triple {1299#(<= main_~i~0 2)} SUMMARY for call write~int(#t~nondet1, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); srcloc: L15 {1299#(<= main_~i~0 2)} is VALID [2020-07-29 01:18:04,964 INFO L280 TraceCheckUtils]: 16: Hoare triple {1299#(<= main_~i~0 2)} havoc #t~nondet1; {1299#(<= main_~i~0 2)} is VALID [2020-07-29 01:18:04,965 INFO L280 TraceCheckUtils]: 17: Hoare triple {1299#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1300#(<= main_~i~0 3)} is VALID [2020-07-29 01:18:04,966 INFO L280 TraceCheckUtils]: 18: Hoare triple {1300#(<= main_~i~0 3)} assume !(~i~0 < 1048); {1293#false} is VALID [2020-07-29 01:18:04,966 INFO L280 TraceCheckUtils]: 19: Hoare triple {1293#false} #t~short3 := ~k~0 < 1048; {1293#false} is VALID [2020-07-29 01:18:04,966 INFO L280 TraceCheckUtils]: 20: Hoare triple {1293#false} assume #t~short3; {1293#false} is VALID [2020-07-29 01:18:04,967 INFO L280 TraceCheckUtils]: 21: Hoare triple {1293#false} SUMMARY for call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4); srcloc: L18-1 {1293#false} is VALID [2020-07-29 01:18:04,967 INFO L280 TraceCheckUtils]: 22: Hoare triple {1293#false} #t~short3 := #t~mem2 >= 0; {1293#false} is VALID [2020-07-29 01:18:04,967 INFO L280 TraceCheckUtils]: 23: Hoare triple {1293#false} assume !#t~short3;havoc #t~short3;havoc #t~mem2; {1293#false} is VALID [2020-07-29 01:18:04,967 INFO L280 TraceCheckUtils]: 24: Hoare triple {1293#false} #res := 0;call ULTIMATE.dealloc(~#a~0.base, ~#a~0.offset);havoc ~#a~0.base, ~#a~0.offset; {1293#false} is VALID [2020-07-29 01:18:04,968 INFO L280 TraceCheckUtils]: 25: Hoare triple {1293#false} assume !(#valid == old(#valid)); {1293#false} is VALID [2020-07-29 01:18:04,969 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:04,969 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-29 01:18:04,969 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 8 [2020-07-29 01:18:04,969 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20022391] [2020-07-29 01:18:04,970 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 26 [2020-07-29 01:18:04,970 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:18:04,970 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-29 01:18:05,010 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:18:05,011 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-29 01:18:05,011 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:18:05,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-29 01:18:05,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-07-29 01:18:05,012 INFO L87 Difference]: Start difference. First operand 45 states and 50 transitions. Second operand 8 states. [2020-07-29 01:18:05,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:18:05,208 INFO L93 Difference]: Finished difference Result 52 states and 57 transitions. [2020-07-29 01:18:05,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-29 01:18:05,209 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 26 [2020-07-29 01:18:05,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:18:05,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-29 01:18:05,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 46 transitions. [2020-07-29 01:18:05,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-29 01:18:05,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 46 transitions. [2020-07-29 01:18:05,212 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 46 transitions. [2020-07-29 01:18:05,269 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:18:05,272 INFO L225 Difference]: With dead ends: 52 [2020-07-29 01:18:05,272 INFO L226 Difference]: Without dead ends: 52 [2020-07-29 01:18:05,272 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 27 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:05,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2020-07-29 01:18:05,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 49. [2020-07-29 01:18:05,275 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:18:05,275 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand 49 states. [2020-07-29 01:18:05,276 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand 49 states. [2020-07-29 01:18:05,276 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 49 states. [2020-07-29 01:18:05,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:18:05,278 INFO L93 Difference]: Finished difference Result 52 states and 57 transitions. [2020-07-29 01:18:05,278 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 57 transitions. [2020-07-29 01:18:05,278 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:18:05,278 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:18:05,279 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand 52 states. [2020-07-29 01:18:05,279 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 52 states. [2020-07-29 01:18:05,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:18:05,281 INFO L93 Difference]: Finished difference Result 52 states and 57 transitions. [2020-07-29 01:18:05,281 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 57 transitions. [2020-07-29 01:18:05,281 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:18:05,282 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:18:05,282 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:18:05,282 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:18:05,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2020-07-29 01:18:05,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 54 transitions. [2020-07-29 01:18:05,284 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 54 transitions. Word has length 26 [2020-07-29 01:18:05,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:18:05,284 INFO L479 AbstractCegarLoop]: Abstraction has 49 states and 54 transitions. [2020-07-29 01:18:05,284 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-29 01:18:05,285 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 54 transitions. [2020-07-29 01:18:05,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-07-29 01:18:05,285 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:18:05,285 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:18:05,498 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-29 01:18:05,499 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-07-29 01:18:05,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:18:05,500 INFO L82 PathProgramCache]: Analyzing trace with hash -113674038, now seen corresponding path program 2 times [2020-07-29 01:18:05,501 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:18:05,501 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621538210] [2020-07-29 01:18:05,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:18:05,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:18:05,602 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-07-29 01:18:05,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:18:05,610 INFO L280 TraceCheckUtils]: 0: Hoare triple {1595#(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; {1585#true} is VALID [2020-07-29 01:18:05,611 INFO L280 TraceCheckUtils]: 1: Hoare triple {1585#true} assume true; {1585#true} is VALID [2020-07-29 01:18:05,611 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1585#true} {1585#true} #63#return; {1585#true} is VALID [2020-07-29 01:18:05,612 INFO L263 TraceCheckUtils]: 0: Hoare triple {1585#true} call ULTIMATE.init(); {1595#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-29 01:18:05,612 INFO L280 TraceCheckUtils]: 1: Hoare triple {1595#(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; {1585#true} is VALID [2020-07-29 01:18:05,612 INFO L280 TraceCheckUtils]: 2: Hoare triple {1585#true} assume true; {1585#true} is VALID [2020-07-29 01:18:05,612 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1585#true} {1585#true} #63#return; {1585#true} is VALID [2020-07-29 01:18:05,612 INFO L263 TraceCheckUtils]: 4: Hoare triple {1585#true} call #t~ret8 := main(); {1585#true} is VALID [2020-07-29 01:18:05,613 INFO L280 TraceCheckUtils]: 5: Hoare triple {1585#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.allocOnStack(4192);~k~0 := 0;~i~0 := 0; {1590#(= 0 main_~i~0)} is VALID [2020-07-29 01:18:05,613 INFO L280 TraceCheckUtils]: 6: Hoare triple {1590#(= 0 main_~i~0)} assume !!(~i~0 < 1048);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {1590#(= 0 main_~i~0)} is VALID [2020-07-29 01:18:05,614 INFO L280 TraceCheckUtils]: 7: Hoare triple {1590#(= 0 main_~i~0)} SUMMARY for call write~int(#t~nondet1, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); srcloc: L15 {1590#(= 0 main_~i~0)} is VALID [2020-07-29 01:18:05,615 INFO L280 TraceCheckUtils]: 8: Hoare triple {1590#(= 0 main_~i~0)} havoc #t~nondet1; {1590#(= 0 main_~i~0)} is VALID [2020-07-29 01:18:05,615 INFO L280 TraceCheckUtils]: 9: Hoare triple {1590#(= 0 main_~i~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1591#(<= main_~i~0 1)} is VALID [2020-07-29 01:18:05,616 INFO L280 TraceCheckUtils]: 10: Hoare triple {1591#(<= main_~i~0 1)} assume !!(~i~0 < 1048);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {1591#(<= main_~i~0 1)} is VALID [2020-07-29 01:18:05,616 INFO L280 TraceCheckUtils]: 11: Hoare triple {1591#(<= main_~i~0 1)} SUMMARY for call write~int(#t~nondet1, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); srcloc: L15 {1591#(<= main_~i~0 1)} is VALID [2020-07-29 01:18:05,617 INFO L280 TraceCheckUtils]: 12: Hoare triple {1591#(<= main_~i~0 1)} havoc #t~nondet1; {1591#(<= main_~i~0 1)} is VALID [2020-07-29 01:18:05,617 INFO L280 TraceCheckUtils]: 13: Hoare triple {1591#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1592#(<= main_~i~0 2)} is VALID [2020-07-29 01:18:05,618 INFO L280 TraceCheckUtils]: 14: Hoare triple {1592#(<= main_~i~0 2)} assume !!(~i~0 < 1048);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {1592#(<= main_~i~0 2)} is VALID [2020-07-29 01:18:05,618 INFO L280 TraceCheckUtils]: 15: Hoare triple {1592#(<= main_~i~0 2)} SUMMARY for call write~int(#t~nondet1, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); srcloc: L15 {1592#(<= main_~i~0 2)} is VALID [2020-07-29 01:18:05,619 INFO L280 TraceCheckUtils]: 16: Hoare triple {1592#(<= main_~i~0 2)} havoc #t~nondet1; {1592#(<= main_~i~0 2)} is VALID [2020-07-29 01:18:05,619 INFO L280 TraceCheckUtils]: 17: Hoare triple {1592#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1593#(<= main_~i~0 3)} is VALID [2020-07-29 01:18:05,621 INFO L280 TraceCheckUtils]: 18: Hoare triple {1593#(<= main_~i~0 3)} assume !!(~i~0 < 1048);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {1593#(<= main_~i~0 3)} is VALID [2020-07-29 01:18:05,623 INFO L280 TraceCheckUtils]: 19: Hoare triple {1593#(<= main_~i~0 3)} SUMMARY for call write~int(#t~nondet1, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); srcloc: L15 {1593#(<= main_~i~0 3)} is VALID [2020-07-29 01:18:05,624 INFO L280 TraceCheckUtils]: 20: Hoare triple {1593#(<= main_~i~0 3)} havoc #t~nondet1; {1593#(<= main_~i~0 3)} is VALID [2020-07-29 01:18:05,627 INFO L280 TraceCheckUtils]: 21: Hoare triple {1593#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1594#(<= main_~i~0 4)} is VALID [2020-07-29 01:18:05,631 INFO L280 TraceCheckUtils]: 22: Hoare triple {1594#(<= main_~i~0 4)} assume !(~i~0 < 1048); {1586#false} is VALID [2020-07-29 01:18:05,631 INFO L280 TraceCheckUtils]: 23: Hoare triple {1586#false} #t~short3 := ~k~0 < 1048; {1586#false} is VALID [2020-07-29 01:18:05,631 INFO L280 TraceCheckUtils]: 24: Hoare triple {1586#false} assume #t~short3; {1586#false} is VALID [2020-07-29 01:18:05,632 INFO L280 TraceCheckUtils]: 25: Hoare triple {1586#false} SUMMARY for call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4); srcloc: L18-1 {1586#false} is VALID [2020-07-29 01:18:05,632 INFO L280 TraceCheckUtils]: 26: Hoare triple {1586#false} #t~short3 := #t~mem2 >= 0; {1586#false} is VALID [2020-07-29 01:18:05,632 INFO L280 TraceCheckUtils]: 27: Hoare triple {1586#false} assume !#t~short3;havoc #t~short3;havoc #t~mem2; {1586#false} is VALID [2020-07-29 01:18:05,632 INFO L280 TraceCheckUtils]: 28: Hoare triple {1586#false} #res := 0;call ULTIMATE.dealloc(~#a~0.base, ~#a~0.offset);havoc ~#a~0.base, ~#a~0.offset; {1586#false} is VALID [2020-07-29 01:18:05,632 INFO L280 TraceCheckUtils]: 29: Hoare triple {1586#false} assume !(#valid == old(#valid)); {1586#false} is VALID [2020-07-29 01:18:05,634 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:05,634 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621538210] [2020-07-29 01:18:05,634 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [551675344] [2020-07-29 01:18:05,634 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:05,665 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2020-07-29 01:18:05,665 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-29 01:18:05,666 INFO L263 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-29 01:18:05,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:18:05,679 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:18:05,796 INFO L263 TraceCheckUtils]: 0: Hoare triple {1585#true} call ULTIMATE.init(); {1585#true} is VALID [2020-07-29 01:18:05,798 INFO L280 TraceCheckUtils]: 1: Hoare triple {1585#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1585#true} is VALID [2020-07-29 01:18:05,798 INFO L280 TraceCheckUtils]: 2: Hoare triple {1585#true} assume true; {1585#true} is VALID [2020-07-29 01:18:05,799 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1585#true} {1585#true} #63#return; {1585#true} is VALID [2020-07-29 01:18:05,800 INFO L263 TraceCheckUtils]: 4: Hoare triple {1585#true} call #t~ret8 := main(); {1611#(= |#valid| |old(#valid)|)} is VALID [2020-07-29 01:18:05,801 INFO L280 TraceCheckUtils]: 5: Hoare triple {1611#(= |#valid| |old(#valid)|)} call ~#a~0.base, ~#a~0.offset := #Ultimate.allocOnStack(4192);~k~0 := 0;~i~0 := 0; {1615#(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:05,802 INFO L280 TraceCheckUtils]: 6: Hoare triple {1615#(and (= 0 (select |old(#valid)| |main_~#a~0.base|)) (= |#valid| (store |old(#valid)| |main_~#a~0.base| 1)))} assume !!(~i~0 < 1048);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {1615#(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:05,803 INFO L280 TraceCheckUtils]: 7: Hoare triple {1615#(and (= 0 (select |old(#valid)| |main_~#a~0.base|)) (= |#valid| (store |old(#valid)| |main_~#a~0.base| 1)))} SUMMARY for call write~int(#t~nondet1, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); srcloc: L15 {1615#(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:05,804 INFO L280 TraceCheckUtils]: 8: Hoare triple {1615#(and (= 0 (select |old(#valid)| |main_~#a~0.base|)) (= |#valid| (store |old(#valid)| |main_~#a~0.base| 1)))} havoc #t~nondet1; {1615#(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:05,805 INFO L280 TraceCheckUtils]: 9: Hoare triple {1615#(and (= 0 (select |old(#valid)| |main_~#a~0.base|)) (= |#valid| (store |old(#valid)| |main_~#a~0.base| 1)))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1615#(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:05,806 INFO L280 TraceCheckUtils]: 10: Hoare triple {1615#(and (= 0 (select |old(#valid)| |main_~#a~0.base|)) (= |#valid| (store |old(#valid)| |main_~#a~0.base| 1)))} assume !!(~i~0 < 1048);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {1615#(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:05,807 INFO L280 TraceCheckUtils]: 11: Hoare triple {1615#(and (= 0 (select |old(#valid)| |main_~#a~0.base|)) (= |#valid| (store |old(#valid)| |main_~#a~0.base| 1)))} SUMMARY for call write~int(#t~nondet1, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); srcloc: L15 {1615#(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:05,808 INFO L280 TraceCheckUtils]: 12: Hoare triple {1615#(and (= 0 (select |old(#valid)| |main_~#a~0.base|)) (= |#valid| (store |old(#valid)| |main_~#a~0.base| 1)))} havoc #t~nondet1; {1615#(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:05,809 INFO L280 TraceCheckUtils]: 13: Hoare triple {1615#(and (= 0 (select |old(#valid)| |main_~#a~0.base|)) (= |#valid| (store |old(#valid)| |main_~#a~0.base| 1)))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1615#(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:05,810 INFO L280 TraceCheckUtils]: 14: Hoare triple {1615#(and (= 0 (select |old(#valid)| |main_~#a~0.base|)) (= |#valid| (store |old(#valid)| |main_~#a~0.base| 1)))} assume !!(~i~0 < 1048);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {1615#(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:05,811 INFO L280 TraceCheckUtils]: 15: Hoare triple {1615#(and (= 0 (select |old(#valid)| |main_~#a~0.base|)) (= |#valid| (store |old(#valid)| |main_~#a~0.base| 1)))} SUMMARY for call write~int(#t~nondet1, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); srcloc: L15 {1615#(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:05,812 INFO L280 TraceCheckUtils]: 16: Hoare triple {1615#(and (= 0 (select |old(#valid)| |main_~#a~0.base|)) (= |#valid| (store |old(#valid)| |main_~#a~0.base| 1)))} havoc #t~nondet1; {1615#(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:05,813 INFO L280 TraceCheckUtils]: 17: Hoare triple {1615#(and (= 0 (select |old(#valid)| |main_~#a~0.base|)) (= |#valid| (store |old(#valid)| |main_~#a~0.base| 1)))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1615#(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:05,814 INFO L280 TraceCheckUtils]: 18: Hoare triple {1615#(and (= 0 (select |old(#valid)| |main_~#a~0.base|)) (= |#valid| (store |old(#valid)| |main_~#a~0.base| 1)))} assume !!(~i~0 < 1048);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {1615#(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:05,815 INFO L280 TraceCheckUtils]: 19: Hoare triple {1615#(and (= 0 (select |old(#valid)| |main_~#a~0.base|)) (= |#valid| (store |old(#valid)| |main_~#a~0.base| 1)))} SUMMARY for call write~int(#t~nondet1, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); srcloc: L15 {1615#(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:05,816 INFO L280 TraceCheckUtils]: 20: Hoare triple {1615#(and (= 0 (select |old(#valid)| |main_~#a~0.base|)) (= |#valid| (store |old(#valid)| |main_~#a~0.base| 1)))} havoc #t~nondet1; {1615#(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:05,817 INFO L280 TraceCheckUtils]: 21: Hoare triple {1615#(and (= 0 (select |old(#valid)| |main_~#a~0.base|)) (= |#valid| (store |old(#valid)| |main_~#a~0.base| 1)))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1615#(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:05,818 INFO L280 TraceCheckUtils]: 22: Hoare triple {1615#(and (= 0 (select |old(#valid)| |main_~#a~0.base|)) (= |#valid| (store |old(#valid)| |main_~#a~0.base| 1)))} assume !(~i~0 < 1048); {1615#(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:05,819 INFO L280 TraceCheckUtils]: 23: Hoare triple {1615#(and (= 0 (select |old(#valid)| |main_~#a~0.base|)) (= |#valid| (store |old(#valid)| |main_~#a~0.base| 1)))} #t~short3 := ~k~0 < 1048; {1615#(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:05,819 INFO L280 TraceCheckUtils]: 24: Hoare triple {1615#(and (= 0 (select |old(#valid)| |main_~#a~0.base|)) (= |#valid| (store |old(#valid)| |main_~#a~0.base| 1)))} assume #t~short3; {1615#(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:05,820 INFO L280 TraceCheckUtils]: 25: Hoare triple {1615#(and (= 0 (select |old(#valid)| |main_~#a~0.base|)) (= |#valid| (store |old(#valid)| |main_~#a~0.base| 1)))} SUMMARY for call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4); srcloc: L18-1 {1615#(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:05,821 INFO L280 TraceCheckUtils]: 26: Hoare triple {1615#(and (= 0 (select |old(#valid)| |main_~#a~0.base|)) (= |#valid| (store |old(#valid)| |main_~#a~0.base| 1)))} #t~short3 := #t~mem2 >= 0; {1615#(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:05,822 INFO L280 TraceCheckUtils]: 27: Hoare triple {1615#(and (= 0 (select |old(#valid)| |main_~#a~0.base|)) (= |#valid| (store |old(#valid)| |main_~#a~0.base| 1)))} assume !#t~short3;havoc #t~short3;havoc #t~mem2; {1615#(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:05,824 INFO L280 TraceCheckUtils]: 28: Hoare triple {1615#(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; {1685#(exists ((|v_main_~#a~0.base_16| Int)) (and (= 0 (select |old(#valid)| |v_main_~#a~0.base_16|)) (= |#valid| (store |old(#valid)| |v_main_~#a~0.base_16| 0))))} is VALID [2020-07-29 01:18:05,825 INFO L280 TraceCheckUtils]: 29: Hoare triple {1685#(exists ((|v_main_~#a~0.base_16| Int)) (and (= 0 (select |old(#valid)| |v_main_~#a~0.base_16|)) (= |#valid| (store |old(#valid)| |v_main_~#a~0.base_16| 0))))} assume !(#valid == old(#valid)); {1586#false} is VALID [2020-07-29 01:18:05,830 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:05,831 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-29 01:18:05,831 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 11 [2020-07-29 01:18:05,832 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632421055] [2020-07-29 01:18:05,832 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2020-07-29 01:18:05,833 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:18:05,833 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-29 01:18:05,855 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:18:05,856 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-29 01:18:05,856 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:18:05,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-29 01:18:05,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2020-07-29 01:18:05,858 INFO L87 Difference]: Start difference. First operand 49 states and 54 transitions. Second operand 5 states. [2020-07-29 01:18:06,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:18:06,033 INFO L93 Difference]: Finished difference Result 48 states and 53 transitions. [2020-07-29 01:18:06,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-29 01:18:06,033 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2020-07-29 01:18:06,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:18:06,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-29 01:18:06,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 29 transitions. [2020-07-29 01:18:06,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-29 01:18:06,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 29 transitions. [2020-07-29 01:18:06,036 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 29 transitions. [2020-07-29 01:18:06,077 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:06,078 INFO L225 Difference]: With dead ends: 48 [2020-07-29 01:18:06,078 INFO L226 Difference]: Without dead ends: 46 [2020-07-29 01:18:06,079 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 29 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:06,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2020-07-29 01:18:06,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2020-07-29 01:18:06,082 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:18:06,082 INFO L82 GeneralOperation]: Start isEquivalent. First operand 46 states. Second operand 46 states. [2020-07-29 01:18:06,083 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand 46 states. [2020-07-29 01:18:06,083 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 46 states. [2020-07-29 01:18:06,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:18:06,085 INFO L93 Difference]: Finished difference Result 46 states and 50 transitions. [2020-07-29 01:18:06,086 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 50 transitions. [2020-07-29 01:18:06,086 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:18:06,086 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:18:06,087 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand 46 states. [2020-07-29 01:18:06,087 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 46 states. [2020-07-29 01:18:06,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:18:06,089 INFO L93 Difference]: Finished difference Result 46 states and 50 transitions. [2020-07-29 01:18:06,089 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 50 transitions. [2020-07-29 01:18:06,090 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:18:06,090 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:18:06,090 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:18:06,091 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:18:06,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2020-07-29 01:18:06,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 50 transitions. [2020-07-29 01:18:06,102 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 50 transitions. Word has length 30 [2020-07-29 01:18:06,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:18:06,103 INFO L479 AbstractCegarLoop]: Abstraction has 46 states and 50 transitions. [2020-07-29 01:18:06,110 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-29 01:18:06,111 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 50 transitions. [2020-07-29 01:18:06,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2020-07-29 01:18:06,112 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:18:06,113 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:18:06,326 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-29 01:18:06,327 INFO L427 AbstractCegarLoop]: === Iteration 10 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-07-29 01:18:06,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:18:06,328 INFO L82 PathProgramCache]: Analyzing trace with hash -1865200645, now seen corresponding path program 1 times [2020-07-29 01:18:06,328 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:18:06,329 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055109459] [2020-07-29 01:18:06,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:18:06,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:18:06,451 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-07-29 01:18:06,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:18:06,456 INFO L280 TraceCheckUtils]: 0: Hoare triple {1884#(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; {1874#true} is VALID [2020-07-29 01:18:06,456 INFO L280 TraceCheckUtils]: 1: Hoare triple {1874#true} assume true; {1874#true} is VALID [2020-07-29 01:18:06,457 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1874#true} {1874#true} #63#return; {1874#true} is VALID [2020-07-29 01:18:06,457 INFO L263 TraceCheckUtils]: 0: Hoare triple {1874#true} call ULTIMATE.init(); {1884#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-29 01:18:06,458 INFO L280 TraceCheckUtils]: 1: Hoare triple {1884#(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; {1874#true} is VALID [2020-07-29 01:18:06,458 INFO L280 TraceCheckUtils]: 2: Hoare triple {1874#true} assume true; {1874#true} is VALID [2020-07-29 01:18:06,458 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1874#true} {1874#true} #63#return; {1874#true} is VALID [2020-07-29 01:18:06,458 INFO L263 TraceCheckUtils]: 4: Hoare triple {1874#true} call #t~ret8 := main(); {1874#true} is VALID [2020-07-29 01:18:06,459 INFO L280 TraceCheckUtils]: 5: Hoare triple {1874#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.allocOnStack(4192);~k~0 := 0;~i~0 := 0; {1879#(= 0 main_~i~0)} is VALID [2020-07-29 01:18:06,459 INFO L280 TraceCheckUtils]: 6: Hoare triple {1879#(= 0 main_~i~0)} assume !!(~i~0 < 1048);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {1879#(= 0 main_~i~0)} is VALID [2020-07-29 01:18:06,460 INFO L280 TraceCheckUtils]: 7: Hoare triple {1879#(= 0 main_~i~0)} SUMMARY for call write~int(#t~nondet1, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); srcloc: L15 {1879#(= 0 main_~i~0)} is VALID [2020-07-29 01:18:06,460 INFO L280 TraceCheckUtils]: 8: Hoare triple {1879#(= 0 main_~i~0)} havoc #t~nondet1; {1879#(= 0 main_~i~0)} is VALID [2020-07-29 01:18:06,466 INFO L280 TraceCheckUtils]: 9: Hoare triple {1879#(= 0 main_~i~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1880#(<= main_~i~0 1)} is VALID [2020-07-29 01:18:06,467 INFO L280 TraceCheckUtils]: 10: Hoare triple {1880#(<= main_~i~0 1)} assume !!(~i~0 < 1048);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {1880#(<= main_~i~0 1)} is VALID [2020-07-29 01:18:06,469 INFO L280 TraceCheckUtils]: 11: Hoare triple {1880#(<= main_~i~0 1)} SUMMARY for call write~int(#t~nondet1, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); srcloc: L15 {1880#(<= main_~i~0 1)} is VALID [2020-07-29 01:18:06,472 INFO L280 TraceCheckUtils]: 12: Hoare triple {1880#(<= main_~i~0 1)} havoc #t~nondet1; {1880#(<= main_~i~0 1)} is VALID [2020-07-29 01:18:06,474 INFO L280 TraceCheckUtils]: 13: Hoare triple {1880#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1881#(<= main_~i~0 2)} is VALID [2020-07-29 01:18:06,475 INFO L280 TraceCheckUtils]: 14: Hoare triple {1881#(<= main_~i~0 2)} assume !!(~i~0 < 1048);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {1881#(<= main_~i~0 2)} is VALID [2020-07-29 01:18:06,476 INFO L280 TraceCheckUtils]: 15: Hoare triple {1881#(<= main_~i~0 2)} SUMMARY for call write~int(#t~nondet1, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); srcloc: L15 {1881#(<= main_~i~0 2)} is VALID [2020-07-29 01:18:06,476 INFO L280 TraceCheckUtils]: 16: Hoare triple {1881#(<= main_~i~0 2)} havoc #t~nondet1; {1881#(<= main_~i~0 2)} is VALID [2020-07-29 01:18:06,477 INFO L280 TraceCheckUtils]: 17: Hoare triple {1881#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1882#(<= main_~i~0 3)} is VALID [2020-07-29 01:18:06,478 INFO L280 TraceCheckUtils]: 18: Hoare triple {1882#(<= main_~i~0 3)} assume !!(~i~0 < 1048);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {1882#(<= main_~i~0 3)} is VALID [2020-07-29 01:18:06,478 INFO L280 TraceCheckUtils]: 19: Hoare triple {1882#(<= main_~i~0 3)} SUMMARY for call write~int(#t~nondet1, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); srcloc: L15 {1882#(<= main_~i~0 3)} is VALID [2020-07-29 01:18:06,478 INFO L280 TraceCheckUtils]: 20: Hoare triple {1882#(<= main_~i~0 3)} havoc #t~nondet1; {1882#(<= main_~i~0 3)} is VALID [2020-07-29 01:18:06,479 INFO L280 TraceCheckUtils]: 21: Hoare triple {1882#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1883#(<= main_~i~0 4)} is VALID [2020-07-29 01:18:06,479 INFO L280 TraceCheckUtils]: 22: Hoare triple {1883#(<= main_~i~0 4)} assume !(~i~0 < 1048); {1875#false} is VALID [2020-07-29 01:18:06,480 INFO L280 TraceCheckUtils]: 23: Hoare triple {1875#false} #t~short3 := ~k~0 < 1048; {1875#false} is VALID [2020-07-29 01:18:06,480 INFO L280 TraceCheckUtils]: 24: Hoare triple {1875#false} assume #t~short3; {1875#false} is VALID [2020-07-29 01:18:06,480 INFO L280 TraceCheckUtils]: 25: Hoare triple {1875#false} SUMMARY for call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4); srcloc: L18-1 {1875#false} is VALID [2020-07-29 01:18:06,480 INFO L280 TraceCheckUtils]: 26: Hoare triple {1875#false} #t~short3 := #t~mem2 >= 0; {1875#false} is VALID [2020-07-29 01:18:06,480 INFO L280 TraceCheckUtils]: 27: Hoare triple {1875#false} assume !!#t~short3;havoc #t~short3;havoc #t~mem2;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {1875#false} is VALID [2020-07-29 01:18:06,481 INFO L280 TraceCheckUtils]: 28: Hoare triple {1875#false} assume 0 != #t~nondet4;havoc #t~nondet4;#t~post5 := ~k~0;~k~0 := 1 + #t~post5;havoc #t~post5; {1875#false} is VALID [2020-07-29 01:18:06,481 INFO L280 TraceCheckUtils]: 29: Hoare triple {1875#false} #t~short3 := ~k~0 < 1048; {1875#false} is VALID [2020-07-29 01:18:06,481 INFO L280 TraceCheckUtils]: 30: Hoare triple {1875#false} assume #t~short3; {1875#false} is VALID [2020-07-29 01:18:06,481 INFO L280 TraceCheckUtils]: 31: Hoare triple {1875#false} assume !(4 + (~#a~0.offset + 4 * ~k~0) <= #length[~#a~0.base] && 0 <= ~#a~0.offset + 4 * ~k~0); {1875#false} is VALID [2020-07-29 01:18:06,482 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-07-29 01:18:06,482 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055109459] [2020-07-29 01:18:06,482 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1795062741] [2020-07-29 01:18:06,483 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:06,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:18:06,516 INFO L263 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-29 01:18:06,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:18:06,528 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:18:06,702 INFO L263 TraceCheckUtils]: 0: Hoare triple {1874#true} call ULTIMATE.init(); {1874#true} is VALID [2020-07-29 01:18:06,703 INFO L280 TraceCheckUtils]: 1: Hoare triple {1874#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1874#true} is VALID [2020-07-29 01:18:06,703 INFO L280 TraceCheckUtils]: 2: Hoare triple {1874#true} assume true; {1874#true} is VALID [2020-07-29 01:18:06,703 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1874#true} {1874#true} #63#return; {1874#true} is VALID [2020-07-29 01:18:06,704 INFO L263 TraceCheckUtils]: 4: Hoare triple {1874#true} call #t~ret8 := main(); {1874#true} is VALID [2020-07-29 01:18:06,705 INFO L280 TraceCheckUtils]: 5: Hoare triple {1874#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.allocOnStack(4192);~k~0 := 0;~i~0 := 0; {1903#(<= main_~i~0 0)} is VALID [2020-07-29 01:18:06,705 INFO L280 TraceCheckUtils]: 6: Hoare triple {1903#(<= main_~i~0 0)} assume !!(~i~0 < 1048);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {1903#(<= main_~i~0 0)} is VALID [2020-07-29 01:18:06,706 INFO L280 TraceCheckUtils]: 7: Hoare triple {1903#(<= main_~i~0 0)} SUMMARY for call write~int(#t~nondet1, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); srcloc: L15 {1903#(<= main_~i~0 0)} is VALID [2020-07-29 01:18:06,706 INFO L280 TraceCheckUtils]: 8: Hoare triple {1903#(<= main_~i~0 0)} havoc #t~nondet1; {1903#(<= main_~i~0 0)} is VALID [2020-07-29 01:18:06,707 INFO L280 TraceCheckUtils]: 9: Hoare triple {1903#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1880#(<= main_~i~0 1)} is VALID [2020-07-29 01:18:06,707 INFO L280 TraceCheckUtils]: 10: Hoare triple {1880#(<= main_~i~0 1)} assume !!(~i~0 < 1048);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {1880#(<= main_~i~0 1)} is VALID [2020-07-29 01:18:06,708 INFO L280 TraceCheckUtils]: 11: Hoare triple {1880#(<= main_~i~0 1)} SUMMARY for call write~int(#t~nondet1, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); srcloc: L15 {1880#(<= main_~i~0 1)} is VALID [2020-07-29 01:18:06,708 INFO L280 TraceCheckUtils]: 12: Hoare triple {1880#(<= main_~i~0 1)} havoc #t~nondet1; {1880#(<= main_~i~0 1)} is VALID [2020-07-29 01:18:06,709 INFO L280 TraceCheckUtils]: 13: Hoare triple {1880#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1881#(<= main_~i~0 2)} is VALID [2020-07-29 01:18:06,709 INFO L280 TraceCheckUtils]: 14: Hoare triple {1881#(<= main_~i~0 2)} assume !!(~i~0 < 1048);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {1881#(<= main_~i~0 2)} is VALID [2020-07-29 01:18:06,709 INFO L280 TraceCheckUtils]: 15: Hoare triple {1881#(<= main_~i~0 2)} SUMMARY for call write~int(#t~nondet1, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); srcloc: L15 {1881#(<= main_~i~0 2)} is VALID [2020-07-29 01:18:06,710 INFO L280 TraceCheckUtils]: 16: Hoare triple {1881#(<= main_~i~0 2)} havoc #t~nondet1; {1881#(<= main_~i~0 2)} is VALID [2020-07-29 01:18:06,710 INFO L280 TraceCheckUtils]: 17: Hoare triple {1881#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1882#(<= main_~i~0 3)} is VALID [2020-07-29 01:18:06,711 INFO L280 TraceCheckUtils]: 18: Hoare triple {1882#(<= main_~i~0 3)} assume !!(~i~0 < 1048);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {1882#(<= main_~i~0 3)} is VALID [2020-07-29 01:18:06,711 INFO L280 TraceCheckUtils]: 19: Hoare triple {1882#(<= main_~i~0 3)} SUMMARY for call write~int(#t~nondet1, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); srcloc: L15 {1882#(<= main_~i~0 3)} is VALID [2020-07-29 01:18:06,712 INFO L280 TraceCheckUtils]: 20: Hoare triple {1882#(<= main_~i~0 3)} havoc #t~nondet1; {1882#(<= main_~i~0 3)} is VALID [2020-07-29 01:18:06,712 INFO L280 TraceCheckUtils]: 21: Hoare triple {1882#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1883#(<= main_~i~0 4)} is VALID [2020-07-29 01:18:06,713 INFO L280 TraceCheckUtils]: 22: Hoare triple {1883#(<= main_~i~0 4)} assume !(~i~0 < 1048); {1875#false} is VALID [2020-07-29 01:18:06,713 INFO L280 TraceCheckUtils]: 23: Hoare triple {1875#false} #t~short3 := ~k~0 < 1048; {1875#false} is VALID [2020-07-29 01:18:06,713 INFO L280 TraceCheckUtils]: 24: Hoare triple {1875#false} assume #t~short3; {1875#false} is VALID [2020-07-29 01:18:06,713 INFO L280 TraceCheckUtils]: 25: Hoare triple {1875#false} SUMMARY for call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4); srcloc: L18-1 {1875#false} is VALID [2020-07-29 01:18:06,713 INFO L280 TraceCheckUtils]: 26: Hoare triple {1875#false} #t~short3 := #t~mem2 >= 0; {1875#false} is VALID [2020-07-29 01:18:06,714 INFO L280 TraceCheckUtils]: 27: Hoare triple {1875#false} assume !!#t~short3;havoc #t~short3;havoc #t~mem2;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {1875#false} is VALID [2020-07-29 01:18:06,714 INFO L280 TraceCheckUtils]: 28: Hoare triple {1875#false} assume 0 != #t~nondet4;havoc #t~nondet4;#t~post5 := ~k~0;~k~0 := 1 + #t~post5;havoc #t~post5; {1875#false} is VALID [2020-07-29 01:18:06,714 INFO L280 TraceCheckUtils]: 29: Hoare triple {1875#false} #t~short3 := ~k~0 < 1048; {1875#false} is VALID [2020-07-29 01:18:06,714 INFO L280 TraceCheckUtils]: 30: Hoare triple {1875#false} assume #t~short3; {1875#false} is VALID [2020-07-29 01:18:06,715 INFO L280 TraceCheckUtils]: 31: Hoare triple {1875#false} assume !(4 + (~#a~0.offset + 4 * ~k~0) <= #length[~#a~0.base] && 0 <= ~#a~0.offset + 4 * ~k~0); {1875#false} is VALID [2020-07-29 01:18:06,716 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-07-29 01:18:06,717 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-29 01:18:06,717 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 9 [2020-07-29 01:18:06,717 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3322158] [2020-07-29 01:18:06,718 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 32 [2020-07-29 01:18:06,718 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:18:06,718 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2020-07-29 01:18:06,765 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:18:06,765 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-29 01:18:06,766 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:18:06,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-29 01:18:06,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-07-29 01:18:06,767 INFO L87 Difference]: Start difference. First operand 46 states and 50 transitions. Second operand 9 states. [2020-07-29 01:18:06,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:18:06,984 INFO L93 Difference]: Finished difference Result 53 states and 57 transitions. [2020-07-29 01:18:06,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-29 01:18:06,984 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 32 [2020-07-29 01:18:06,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:18:06,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-29 01:18:06,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 47 transitions. [2020-07-29 01:18:06,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-29 01:18:06,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 47 transitions. [2020-07-29 01:18:06,988 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 47 transitions. [2020-07-29 01:18:07,043 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:07,048 INFO L225 Difference]: With dead ends: 53 [2020-07-29 01:18:07,048 INFO L226 Difference]: Without dead ends: 53 [2020-07-29 01:18:07,048 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 33 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:07,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2020-07-29 01:18:07,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 50. [2020-07-29 01:18:07,057 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:18:07,058 INFO L82 GeneralOperation]: Start isEquivalent. First operand 53 states. Second operand 50 states. [2020-07-29 01:18:07,058 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand 50 states. [2020-07-29 01:18:07,058 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 50 states. [2020-07-29 01:18:07,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:18:07,064 INFO L93 Difference]: Finished difference Result 53 states and 57 transitions. [2020-07-29 01:18:07,065 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 57 transitions. [2020-07-29 01:18:07,065 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:18:07,065 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:18:07,065 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand 53 states. [2020-07-29 01:18:07,066 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 53 states. [2020-07-29 01:18:07,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:18:07,069 INFO L93 Difference]: Finished difference Result 53 states and 57 transitions. [2020-07-29 01:18:07,069 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 57 transitions. [2020-07-29 01:18:07,070 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:18:07,070 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:18:07,070 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:18:07,070 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:18:07,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2020-07-29 01:18:07,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2020-07-29 01:18:07,074 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 32 [2020-07-29 01:18:07,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:18:07,074 INFO L479 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2020-07-29 01:18:07,075 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-29 01:18:07,075 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2020-07-29 01:18:07,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2020-07-29 01:18:07,076 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:18:07,076 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:18:07,290 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-29 01:18:07,291 INFO L427 AbstractCegarLoop]: === Iteration 11 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-07-29 01:18:07,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:18:07,292 INFO L82 PathProgramCache]: Analyzing trace with hash 133323454, now seen corresponding path program 2 times [2020-07-29 01:18:07,292 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:18:07,292 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404556430] [2020-07-29 01:18:07,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:18:07,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:18:07,393 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-07-29 01:18:07,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:18:07,398 INFO L280 TraceCheckUtils]: 0: Hoare triple {2201#(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; {2190#true} is VALID [2020-07-29 01:18:07,398 INFO L280 TraceCheckUtils]: 1: Hoare triple {2190#true} assume true; {2190#true} is VALID [2020-07-29 01:18:07,398 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2190#true} {2190#true} #63#return; {2190#true} is VALID [2020-07-29 01:18:07,399 INFO L263 TraceCheckUtils]: 0: Hoare triple {2190#true} call ULTIMATE.init(); {2201#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-29 01:18:07,400 INFO L280 TraceCheckUtils]: 1: Hoare triple {2201#(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; {2190#true} is VALID [2020-07-29 01:18:07,400 INFO L280 TraceCheckUtils]: 2: Hoare triple {2190#true} assume true; {2190#true} is VALID [2020-07-29 01:18:07,400 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2190#true} {2190#true} #63#return; {2190#true} is VALID [2020-07-29 01:18:07,400 INFO L263 TraceCheckUtils]: 4: Hoare triple {2190#true} call #t~ret8 := main(); {2190#true} is VALID [2020-07-29 01:18:07,401 INFO L280 TraceCheckUtils]: 5: Hoare triple {2190#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.allocOnStack(4192);~k~0 := 0;~i~0 := 0; {2195#(= 0 main_~i~0)} is VALID [2020-07-29 01:18:07,402 INFO L280 TraceCheckUtils]: 6: Hoare triple {2195#(= 0 main_~i~0)} assume !!(~i~0 < 1048);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {2195#(= 0 main_~i~0)} is VALID [2020-07-29 01:18:07,402 INFO L280 TraceCheckUtils]: 7: Hoare triple {2195#(= 0 main_~i~0)} SUMMARY for call write~int(#t~nondet1, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); srcloc: L15 {2195#(= 0 main_~i~0)} is VALID [2020-07-29 01:18:07,403 INFO L280 TraceCheckUtils]: 8: Hoare triple {2195#(= 0 main_~i~0)} havoc #t~nondet1; {2195#(= 0 main_~i~0)} is VALID [2020-07-29 01:18:07,403 INFO L280 TraceCheckUtils]: 9: Hoare triple {2195#(= 0 main_~i~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2196#(<= main_~i~0 1)} is VALID [2020-07-29 01:18:07,404 INFO L280 TraceCheckUtils]: 10: Hoare triple {2196#(<= main_~i~0 1)} assume !!(~i~0 < 1048);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {2196#(<= main_~i~0 1)} is VALID [2020-07-29 01:18:07,404 INFO L280 TraceCheckUtils]: 11: Hoare triple {2196#(<= main_~i~0 1)} SUMMARY for call write~int(#t~nondet1, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); srcloc: L15 {2196#(<= main_~i~0 1)} is VALID [2020-07-29 01:18:07,404 INFO L280 TraceCheckUtils]: 12: Hoare triple {2196#(<= main_~i~0 1)} havoc #t~nondet1; {2196#(<= main_~i~0 1)} is VALID [2020-07-29 01:18:07,405 INFO L280 TraceCheckUtils]: 13: Hoare triple {2196#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2197#(<= main_~i~0 2)} is VALID [2020-07-29 01:18:07,406 INFO L280 TraceCheckUtils]: 14: Hoare triple {2197#(<= main_~i~0 2)} assume !!(~i~0 < 1048);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {2197#(<= main_~i~0 2)} is VALID [2020-07-29 01:18:07,406 INFO L280 TraceCheckUtils]: 15: Hoare triple {2197#(<= main_~i~0 2)} SUMMARY for call write~int(#t~nondet1, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); srcloc: L15 {2197#(<= main_~i~0 2)} is VALID [2020-07-29 01:18:07,408 INFO L280 TraceCheckUtils]: 16: Hoare triple {2197#(<= main_~i~0 2)} havoc #t~nondet1; {2197#(<= main_~i~0 2)} is VALID [2020-07-29 01:18:07,408 INFO L280 TraceCheckUtils]: 17: Hoare triple {2197#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2198#(<= main_~i~0 3)} is VALID [2020-07-29 01:18:07,411 INFO L280 TraceCheckUtils]: 18: Hoare triple {2198#(<= main_~i~0 3)} assume !!(~i~0 < 1048);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {2198#(<= main_~i~0 3)} is VALID [2020-07-29 01:18:07,412 INFO L280 TraceCheckUtils]: 19: Hoare triple {2198#(<= main_~i~0 3)} SUMMARY for call write~int(#t~nondet1, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); srcloc: L15 {2198#(<= main_~i~0 3)} is VALID [2020-07-29 01:18:07,417 INFO L280 TraceCheckUtils]: 20: Hoare triple {2198#(<= main_~i~0 3)} havoc #t~nondet1; {2198#(<= main_~i~0 3)} is VALID [2020-07-29 01:18:07,419 INFO L280 TraceCheckUtils]: 21: Hoare triple {2198#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2199#(<= main_~i~0 4)} is VALID [2020-07-29 01:18:07,421 INFO L280 TraceCheckUtils]: 22: Hoare triple {2199#(<= main_~i~0 4)} assume !!(~i~0 < 1048);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {2199#(<= main_~i~0 4)} is VALID [2020-07-29 01:18:07,422 INFO L280 TraceCheckUtils]: 23: Hoare triple {2199#(<= main_~i~0 4)} SUMMARY for call write~int(#t~nondet1, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); srcloc: L15 {2199#(<= main_~i~0 4)} is VALID [2020-07-29 01:18:07,423 INFO L280 TraceCheckUtils]: 24: Hoare triple {2199#(<= main_~i~0 4)} havoc #t~nondet1; {2199#(<= main_~i~0 4)} is VALID [2020-07-29 01:18:07,424 INFO L280 TraceCheckUtils]: 25: Hoare triple {2199#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2200#(<= main_~i~0 5)} is VALID [2020-07-29 01:18:07,425 INFO L280 TraceCheckUtils]: 26: Hoare triple {2200#(<= main_~i~0 5)} assume !(~i~0 < 1048); {2191#false} is VALID [2020-07-29 01:18:07,425 INFO L280 TraceCheckUtils]: 27: Hoare triple {2191#false} #t~short3 := ~k~0 < 1048; {2191#false} is VALID [2020-07-29 01:18:07,425 INFO L280 TraceCheckUtils]: 28: Hoare triple {2191#false} assume #t~short3; {2191#false} is VALID [2020-07-29 01:18:07,425 INFO L280 TraceCheckUtils]: 29: Hoare triple {2191#false} SUMMARY for call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4); srcloc: L18-1 {2191#false} is VALID [2020-07-29 01:18:07,425 INFO L280 TraceCheckUtils]: 30: Hoare triple {2191#false} #t~short3 := #t~mem2 >= 0; {2191#false} is VALID [2020-07-29 01:18:07,425 INFO L280 TraceCheckUtils]: 31: Hoare triple {2191#false} assume !!#t~short3;havoc #t~short3;havoc #t~mem2;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {2191#false} is VALID [2020-07-29 01:18:07,426 INFO L280 TraceCheckUtils]: 32: Hoare triple {2191#false} assume 0 != #t~nondet4;havoc #t~nondet4;#t~post5 := ~k~0;~k~0 := 1 + #t~post5;havoc #t~post5; {2191#false} is VALID [2020-07-29 01:18:07,426 INFO L280 TraceCheckUtils]: 33: Hoare triple {2191#false} #t~short3 := ~k~0 < 1048; {2191#false} is VALID [2020-07-29 01:18:07,426 INFO L280 TraceCheckUtils]: 34: Hoare triple {2191#false} assume #t~short3; {2191#false} is VALID [2020-07-29 01:18:07,426 INFO L280 TraceCheckUtils]: 35: Hoare triple {2191#false} assume !(4 + (~#a~0.offset + 4 * ~k~0) <= #length[~#a~0.base] && 0 <= ~#a~0.offset + 4 * ~k~0); {2191#false} is VALID [2020-07-29 01:18:07,428 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-07-29 01:18:07,428 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404556430] [2020-07-29 01:18:07,428 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1386621765] [2020-07-29 01:18:07,429 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:07,475 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-29 01:18:07,475 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-29 01:18:07,476 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-29 01:18:07,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:18:07,485 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:18:07,651 INFO L263 TraceCheckUtils]: 0: Hoare triple {2190#true} call ULTIMATE.init(); {2190#true} is VALID [2020-07-29 01:18:07,652 INFO L280 TraceCheckUtils]: 1: Hoare triple {2190#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {2190#true} is VALID [2020-07-29 01:18:07,652 INFO L280 TraceCheckUtils]: 2: Hoare triple {2190#true} assume true; {2190#true} is VALID [2020-07-29 01:18:07,652 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2190#true} {2190#true} #63#return; {2190#true} is VALID [2020-07-29 01:18:07,652 INFO L263 TraceCheckUtils]: 4: Hoare triple {2190#true} call #t~ret8 := main(); {2190#true} is VALID [2020-07-29 01:18:07,653 INFO L280 TraceCheckUtils]: 5: Hoare triple {2190#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.allocOnStack(4192);~k~0 := 0;~i~0 := 0; {2220#(<= main_~i~0 0)} is VALID [2020-07-29 01:18:07,654 INFO L280 TraceCheckUtils]: 6: Hoare triple {2220#(<= main_~i~0 0)} assume !!(~i~0 < 1048);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {2220#(<= main_~i~0 0)} is VALID [2020-07-29 01:18:07,654 INFO L280 TraceCheckUtils]: 7: Hoare triple {2220#(<= main_~i~0 0)} SUMMARY for call write~int(#t~nondet1, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); srcloc: L15 {2220#(<= main_~i~0 0)} is VALID [2020-07-29 01:18:07,655 INFO L280 TraceCheckUtils]: 8: Hoare triple {2220#(<= main_~i~0 0)} havoc #t~nondet1; {2220#(<= main_~i~0 0)} is VALID [2020-07-29 01:18:07,655 INFO L280 TraceCheckUtils]: 9: Hoare triple {2220#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2196#(<= main_~i~0 1)} is VALID [2020-07-29 01:18:07,656 INFO L280 TraceCheckUtils]: 10: Hoare triple {2196#(<= main_~i~0 1)} assume !!(~i~0 < 1048);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {2196#(<= main_~i~0 1)} is VALID [2020-07-29 01:18:07,657 INFO L280 TraceCheckUtils]: 11: Hoare triple {2196#(<= main_~i~0 1)} SUMMARY for call write~int(#t~nondet1, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); srcloc: L15 {2196#(<= main_~i~0 1)} is VALID [2020-07-29 01:18:07,657 INFO L280 TraceCheckUtils]: 12: Hoare triple {2196#(<= main_~i~0 1)} havoc #t~nondet1; {2196#(<= main_~i~0 1)} is VALID [2020-07-29 01:18:07,658 INFO L280 TraceCheckUtils]: 13: Hoare triple {2196#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2197#(<= main_~i~0 2)} is VALID [2020-07-29 01:18:07,658 INFO L280 TraceCheckUtils]: 14: Hoare triple {2197#(<= main_~i~0 2)} assume !!(~i~0 < 1048);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {2197#(<= main_~i~0 2)} is VALID [2020-07-29 01:18:07,659 INFO L280 TraceCheckUtils]: 15: Hoare triple {2197#(<= main_~i~0 2)} SUMMARY for call write~int(#t~nondet1, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); srcloc: L15 {2197#(<= main_~i~0 2)} is VALID [2020-07-29 01:18:07,659 INFO L280 TraceCheckUtils]: 16: Hoare triple {2197#(<= main_~i~0 2)} havoc #t~nondet1; {2197#(<= main_~i~0 2)} is VALID [2020-07-29 01:18:07,660 INFO L280 TraceCheckUtils]: 17: Hoare triple {2197#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2198#(<= main_~i~0 3)} is VALID [2020-07-29 01:18:07,660 INFO L280 TraceCheckUtils]: 18: Hoare triple {2198#(<= main_~i~0 3)} assume !!(~i~0 < 1048);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {2198#(<= main_~i~0 3)} is VALID [2020-07-29 01:18:07,661 INFO L280 TraceCheckUtils]: 19: Hoare triple {2198#(<= main_~i~0 3)} SUMMARY for call write~int(#t~nondet1, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); srcloc: L15 {2198#(<= main_~i~0 3)} is VALID [2020-07-29 01:18:07,661 INFO L280 TraceCheckUtils]: 20: Hoare triple {2198#(<= main_~i~0 3)} havoc #t~nondet1; {2198#(<= main_~i~0 3)} is VALID [2020-07-29 01:18:07,662 INFO L280 TraceCheckUtils]: 21: Hoare triple {2198#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2199#(<= main_~i~0 4)} is VALID [2020-07-29 01:18:07,662 INFO L280 TraceCheckUtils]: 22: Hoare triple {2199#(<= main_~i~0 4)} assume !!(~i~0 < 1048);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {2199#(<= main_~i~0 4)} is VALID [2020-07-29 01:18:07,663 INFO L280 TraceCheckUtils]: 23: Hoare triple {2199#(<= main_~i~0 4)} SUMMARY for call write~int(#t~nondet1, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); srcloc: L15 {2199#(<= main_~i~0 4)} is VALID [2020-07-29 01:18:07,663 INFO L280 TraceCheckUtils]: 24: Hoare triple {2199#(<= main_~i~0 4)} havoc #t~nondet1; {2199#(<= main_~i~0 4)} is VALID [2020-07-29 01:18:07,666 INFO L280 TraceCheckUtils]: 25: Hoare triple {2199#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2200#(<= main_~i~0 5)} is VALID [2020-07-29 01:18:07,668 INFO L280 TraceCheckUtils]: 26: Hoare triple {2200#(<= main_~i~0 5)} assume !(~i~0 < 1048); {2191#false} is VALID [2020-07-29 01:18:07,668 INFO L280 TraceCheckUtils]: 27: Hoare triple {2191#false} #t~short3 := ~k~0 < 1048; {2191#false} is VALID [2020-07-29 01:18:07,668 INFO L280 TraceCheckUtils]: 28: Hoare triple {2191#false} assume #t~short3; {2191#false} is VALID [2020-07-29 01:18:07,669 INFO L280 TraceCheckUtils]: 29: Hoare triple {2191#false} SUMMARY for call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4); srcloc: L18-1 {2191#false} is VALID [2020-07-29 01:18:07,669 INFO L280 TraceCheckUtils]: 30: Hoare triple {2191#false} #t~short3 := #t~mem2 >= 0; {2191#false} is VALID [2020-07-29 01:18:07,669 INFO L280 TraceCheckUtils]: 31: Hoare triple {2191#false} assume !!#t~short3;havoc #t~short3;havoc #t~mem2;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {2191#false} is VALID [2020-07-29 01:18:07,669 INFO L280 TraceCheckUtils]: 32: Hoare triple {2191#false} assume 0 != #t~nondet4;havoc #t~nondet4;#t~post5 := ~k~0;~k~0 := 1 + #t~post5;havoc #t~post5; {2191#false} is VALID [2020-07-29 01:18:07,669 INFO L280 TraceCheckUtils]: 33: Hoare triple {2191#false} #t~short3 := ~k~0 < 1048; {2191#false} is VALID [2020-07-29 01:18:07,669 INFO L280 TraceCheckUtils]: 34: Hoare triple {2191#false} assume #t~short3; {2191#false} is VALID [2020-07-29 01:18:07,669 INFO L280 TraceCheckUtils]: 35: Hoare triple {2191#false} assume !(4 + (~#a~0.offset + 4 * ~k~0) <= #length[~#a~0.base] && 0 <= ~#a~0.offset + 4 * ~k~0); {2191#false} is VALID [2020-07-29 01:18:07,671 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-07-29 01:18:07,671 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-29 01:18:07,671 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 10 [2020-07-29 01:18:07,671 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955518671] [2020-07-29 01:18:07,672 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 36 [2020-07-29 01:18:07,672 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:18:07,672 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2020-07-29 01:18:07,719 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:18:07,720 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-29 01:18:07,720 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:18:07,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-29 01:18:07,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-07-29 01:18:07,721 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand 10 states. [2020-07-29 01:18:07,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:18:07,952 INFO L93 Difference]: Finished difference Result 57 states and 61 transitions. [2020-07-29 01:18:07,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-29 01:18:07,952 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 36 [2020-07-29 01:18:07,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:18:07,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-29 01:18:07,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 51 transitions. [2020-07-29 01:18:07,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-29 01:18:07,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 51 transitions. [2020-07-29 01:18:07,956 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 51 transitions. [2020-07-29 01:18:08,009 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:08,010 INFO L225 Difference]: With dead ends: 57 [2020-07-29 01:18:08,011 INFO L226 Difference]: Without dead ends: 57 [2020-07-29 01:18:08,011 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 37 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:08,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2020-07-29 01:18:08,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 54. [2020-07-29 01:18:08,015 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:18:08,015 INFO L82 GeneralOperation]: Start isEquivalent. First operand 57 states. Second operand 54 states. [2020-07-29 01:18:08,015 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand 54 states. [2020-07-29 01:18:08,016 INFO L87 Difference]: Start difference. First operand 57 states. Second operand 54 states. [2020-07-29 01:18:08,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:18:08,021 INFO L93 Difference]: Finished difference Result 57 states and 61 transitions. [2020-07-29 01:18:08,021 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 61 transitions. [2020-07-29 01:18:08,022 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:18:08,022 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:18:08,022 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand 57 states. [2020-07-29 01:18:08,023 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 57 states. [2020-07-29 01:18:08,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:18:08,026 INFO L93 Difference]: Finished difference Result 57 states and 61 transitions. [2020-07-29 01:18:08,026 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 61 transitions. [2020-07-29 01:18:08,026 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:18:08,026 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:18:08,027 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:18:08,027 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:18:08,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2020-07-29 01:18:08,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 58 transitions. [2020-07-29 01:18:08,029 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 58 transitions. Word has length 36 [2020-07-29 01:18:08,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:18:08,029 INFO L479 AbstractCegarLoop]: Abstraction has 54 states and 58 transitions. [2020-07-29 01:18:08,029 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-29 01:18:08,029 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2020-07-29 01:18:08,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-07-29 01:18:08,034 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:18:08,034 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:18:08,248 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-29 01:18:08,249 INFO L427 AbstractCegarLoop]: === Iteration 12 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-07-29 01:18:08,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:18:08,250 INFO L82 PathProgramCache]: Analyzing trace with hash -1483321343, now seen corresponding path program 3 times [2020-07-29 01:18:08,250 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:18:08,251 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684057104] [2020-07-29 01:18:08,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:18:08,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:18:08,392 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-07-29 01:18:08,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:18:08,407 INFO L280 TraceCheckUtils]: 0: Hoare triple {2547#(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; {2535#true} is VALID [2020-07-29 01:18:08,407 INFO L280 TraceCheckUtils]: 1: Hoare triple {2535#true} assume true; {2535#true} is VALID [2020-07-29 01:18:08,408 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2535#true} {2535#true} #63#return; {2535#true} is VALID [2020-07-29 01:18:08,409 INFO L263 TraceCheckUtils]: 0: Hoare triple {2535#true} call ULTIMATE.init(); {2547#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-29 01:18:08,409 INFO L280 TraceCheckUtils]: 1: Hoare triple {2547#(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; {2535#true} is VALID [2020-07-29 01:18:08,409 INFO L280 TraceCheckUtils]: 2: Hoare triple {2535#true} assume true; {2535#true} is VALID [2020-07-29 01:18:08,409 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2535#true} {2535#true} #63#return; {2535#true} is VALID [2020-07-29 01:18:08,409 INFO L263 TraceCheckUtils]: 4: Hoare triple {2535#true} call #t~ret8 := main(); {2535#true} is VALID [2020-07-29 01:18:08,410 INFO L280 TraceCheckUtils]: 5: Hoare triple {2535#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.allocOnStack(4192);~k~0 := 0;~i~0 := 0; {2540#(= 0 main_~i~0)} is VALID [2020-07-29 01:18:08,410 INFO L280 TraceCheckUtils]: 6: Hoare triple {2540#(= 0 main_~i~0)} assume !!(~i~0 < 1048);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {2540#(= 0 main_~i~0)} is VALID [2020-07-29 01:18:08,411 INFO L280 TraceCheckUtils]: 7: Hoare triple {2540#(= 0 main_~i~0)} SUMMARY for call write~int(#t~nondet1, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); srcloc: L15 {2540#(= 0 main_~i~0)} is VALID [2020-07-29 01:18:08,411 INFO L280 TraceCheckUtils]: 8: Hoare triple {2540#(= 0 main_~i~0)} havoc #t~nondet1; {2540#(= 0 main_~i~0)} is VALID [2020-07-29 01:18:08,412 INFO L280 TraceCheckUtils]: 9: Hoare triple {2540#(= 0 main_~i~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2541#(<= main_~i~0 1)} is VALID [2020-07-29 01:18:08,413 INFO L280 TraceCheckUtils]: 10: Hoare triple {2541#(<= main_~i~0 1)} assume !!(~i~0 < 1048);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {2541#(<= main_~i~0 1)} is VALID [2020-07-29 01:18:08,413 INFO L280 TraceCheckUtils]: 11: Hoare triple {2541#(<= main_~i~0 1)} SUMMARY for call write~int(#t~nondet1, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); srcloc: L15 {2541#(<= main_~i~0 1)} is VALID [2020-07-29 01:18:08,414 INFO L280 TraceCheckUtils]: 12: Hoare triple {2541#(<= main_~i~0 1)} havoc #t~nondet1; {2541#(<= main_~i~0 1)} is VALID [2020-07-29 01:18:08,415 INFO L280 TraceCheckUtils]: 13: Hoare triple {2541#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2542#(<= main_~i~0 2)} is VALID [2020-07-29 01:18:08,416 INFO L280 TraceCheckUtils]: 14: Hoare triple {2542#(<= main_~i~0 2)} assume !!(~i~0 < 1048);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {2542#(<= main_~i~0 2)} is VALID [2020-07-29 01:18:08,416 INFO L280 TraceCheckUtils]: 15: Hoare triple {2542#(<= main_~i~0 2)} SUMMARY for call write~int(#t~nondet1, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); srcloc: L15 {2542#(<= main_~i~0 2)} is VALID [2020-07-29 01:18:08,417 INFO L280 TraceCheckUtils]: 16: Hoare triple {2542#(<= main_~i~0 2)} havoc #t~nondet1; {2542#(<= main_~i~0 2)} is VALID [2020-07-29 01:18:08,417 INFO L280 TraceCheckUtils]: 17: Hoare triple {2542#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2543#(<= main_~i~0 3)} is VALID [2020-07-29 01:18:08,418 INFO L280 TraceCheckUtils]: 18: Hoare triple {2543#(<= main_~i~0 3)} assume !!(~i~0 < 1048);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {2543#(<= main_~i~0 3)} is VALID [2020-07-29 01:18:08,418 INFO L280 TraceCheckUtils]: 19: Hoare triple {2543#(<= main_~i~0 3)} SUMMARY for call write~int(#t~nondet1, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); srcloc: L15 {2543#(<= main_~i~0 3)} is VALID [2020-07-29 01:18:08,419 INFO L280 TraceCheckUtils]: 20: Hoare triple {2543#(<= main_~i~0 3)} havoc #t~nondet1; {2543#(<= main_~i~0 3)} is VALID [2020-07-29 01:18:08,420 INFO L280 TraceCheckUtils]: 21: Hoare triple {2543#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2544#(<= main_~i~0 4)} is VALID [2020-07-29 01:18:08,420 INFO L280 TraceCheckUtils]: 22: Hoare triple {2544#(<= main_~i~0 4)} assume !!(~i~0 < 1048);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {2544#(<= main_~i~0 4)} is VALID [2020-07-29 01:18:08,421 INFO L280 TraceCheckUtils]: 23: Hoare triple {2544#(<= main_~i~0 4)} SUMMARY for call write~int(#t~nondet1, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); srcloc: L15 {2544#(<= main_~i~0 4)} is VALID [2020-07-29 01:18:08,421 INFO L280 TraceCheckUtils]: 24: Hoare triple {2544#(<= main_~i~0 4)} havoc #t~nondet1; {2544#(<= main_~i~0 4)} is VALID [2020-07-29 01:18:08,422 INFO L280 TraceCheckUtils]: 25: Hoare triple {2544#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2545#(<= main_~i~0 5)} is VALID [2020-07-29 01:18:08,422 INFO L280 TraceCheckUtils]: 26: Hoare triple {2545#(<= main_~i~0 5)} assume !!(~i~0 < 1048);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {2545#(<= main_~i~0 5)} is VALID [2020-07-29 01:18:08,423 INFO L280 TraceCheckUtils]: 27: Hoare triple {2545#(<= main_~i~0 5)} SUMMARY for call write~int(#t~nondet1, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); srcloc: L15 {2545#(<= main_~i~0 5)} is VALID [2020-07-29 01:18:08,423 INFO L280 TraceCheckUtils]: 28: Hoare triple {2545#(<= main_~i~0 5)} havoc #t~nondet1; {2545#(<= main_~i~0 5)} is VALID [2020-07-29 01:18:08,424 INFO L280 TraceCheckUtils]: 29: Hoare triple {2545#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2546#(<= main_~i~0 6)} is VALID [2020-07-29 01:18:08,425 INFO L280 TraceCheckUtils]: 30: Hoare triple {2546#(<= main_~i~0 6)} assume !(~i~0 < 1048); {2536#false} is VALID [2020-07-29 01:18:08,425 INFO L280 TraceCheckUtils]: 31: Hoare triple {2536#false} #t~short3 := ~k~0 < 1048; {2536#false} is VALID [2020-07-29 01:18:08,425 INFO L280 TraceCheckUtils]: 32: Hoare triple {2536#false} assume #t~short3; {2536#false} is VALID [2020-07-29 01:18:08,425 INFO L280 TraceCheckUtils]: 33: Hoare triple {2536#false} SUMMARY for call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4); srcloc: L18-1 {2536#false} is VALID [2020-07-29 01:18:08,425 INFO L280 TraceCheckUtils]: 34: Hoare triple {2536#false} #t~short3 := #t~mem2 >= 0; {2536#false} is VALID [2020-07-29 01:18:08,425 INFO L280 TraceCheckUtils]: 35: Hoare triple {2536#false} assume !!#t~short3;havoc #t~short3;havoc #t~mem2;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {2536#false} is VALID [2020-07-29 01:18:08,426 INFO L280 TraceCheckUtils]: 36: Hoare triple {2536#false} assume 0 != #t~nondet4;havoc #t~nondet4;#t~post5 := ~k~0;~k~0 := 1 + #t~post5;havoc #t~post5; {2536#false} is VALID [2020-07-29 01:18:08,426 INFO L280 TraceCheckUtils]: 37: Hoare triple {2536#false} #t~short3 := ~k~0 < 1048; {2536#false} is VALID [2020-07-29 01:18:08,426 INFO L280 TraceCheckUtils]: 38: Hoare triple {2536#false} assume #t~short3; {2536#false} is VALID [2020-07-29 01:18:08,426 INFO L280 TraceCheckUtils]: 39: Hoare triple {2536#false} assume !(4 + (~#a~0.offset + 4 * ~k~0) <= #length[~#a~0.base] && 0 <= ~#a~0.offset + 4 * ~k~0); {2536#false} is VALID [2020-07-29 01:18:08,427 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-07-29 01:18:08,427 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684057104] [2020-07-29 01:18:08,428 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1736001836] [2020-07-29 01:18:08,428 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:08,457 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2020-07-29 01:18:08,457 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-29 01:18:08,458 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-29 01:18:08,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:18:08,469 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:18:08,485 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:08,486 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-29 01:18:08,492 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 01:18:08,492 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-29 01:18:08,493 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2020-07-29 01:18:08,496 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-29 01:18:08,497 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#length_15|]. (and (= (store |v_#length_15| |main_~#a~0.base| 4192) |#length|) (<= 0 main_~k~0) (= 0 |main_~#a~0.offset|)) [2020-07-29 01:18:08,497 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (and (<= 0 main_~k~0) (= 4192 (select |#length| |main_~#a~0.base|)) (= 0 |main_~#a~0.offset|)) [2020-07-29 01:18:08,754 INFO L263 TraceCheckUtils]: 0: Hoare triple {2535#true} call ULTIMATE.init(); {2535#true} is VALID [2020-07-29 01:18:08,754 INFO L280 TraceCheckUtils]: 1: Hoare triple {2535#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {2535#true} is VALID [2020-07-29 01:18:08,754 INFO L280 TraceCheckUtils]: 2: Hoare triple {2535#true} assume true; {2535#true} is VALID [2020-07-29 01:18:08,754 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2535#true} {2535#true} #63#return; {2535#true} is VALID [2020-07-29 01:18:08,755 INFO L263 TraceCheckUtils]: 4: Hoare triple {2535#true} call #t~ret8 := main(); {2535#true} is VALID [2020-07-29 01:18:08,757 INFO L280 TraceCheckUtils]: 5: Hoare triple {2535#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.allocOnStack(4192);~k~0 := 0;~i~0 := 0; {2566#(and (<= 0 main_~k~0) (= 4192 (select |#length| |main_~#a~0.base|)) (= 0 |main_~#a~0.offset|))} is VALID [2020-07-29 01:18:08,759 INFO L280 TraceCheckUtils]: 6: Hoare triple {2566#(and (<= 0 main_~k~0) (= 4192 (select |#length| |main_~#a~0.base|)) (= 0 |main_~#a~0.offset|))} assume !!(~i~0 < 1048);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {2566#(and (<= 0 main_~k~0) (= 4192 (select |#length| |main_~#a~0.base|)) (= 0 |main_~#a~0.offset|))} is VALID [2020-07-29 01:18:08,760 INFO L280 TraceCheckUtils]: 7: Hoare triple {2566#(and (<= 0 main_~k~0) (= 4192 (select |#length| |main_~#a~0.base|)) (= 0 |main_~#a~0.offset|))} SUMMARY for call write~int(#t~nondet1, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); srcloc: L15 {2566#(and (<= 0 main_~k~0) (= 4192 (select |#length| |main_~#a~0.base|)) (= 0 |main_~#a~0.offset|))} is VALID [2020-07-29 01:18:08,761 INFO L280 TraceCheckUtils]: 8: Hoare triple {2566#(and (<= 0 main_~k~0) (= 4192 (select |#length| |main_~#a~0.base|)) (= 0 |main_~#a~0.offset|))} havoc #t~nondet1; {2566#(and (<= 0 main_~k~0) (= 4192 (select |#length| |main_~#a~0.base|)) (= 0 |main_~#a~0.offset|))} is VALID [2020-07-29 01:18:08,762 INFO L280 TraceCheckUtils]: 9: Hoare triple {2566#(and (<= 0 main_~k~0) (= 4192 (select |#length| |main_~#a~0.base|)) (= 0 |main_~#a~0.offset|))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2566#(and (<= 0 main_~k~0) (= 4192 (select |#length| |main_~#a~0.base|)) (= 0 |main_~#a~0.offset|))} is VALID [2020-07-29 01:18:08,763 INFO L280 TraceCheckUtils]: 10: Hoare triple {2566#(and (<= 0 main_~k~0) (= 4192 (select |#length| |main_~#a~0.base|)) (= 0 |main_~#a~0.offset|))} assume !!(~i~0 < 1048);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {2566#(and (<= 0 main_~k~0) (= 4192 (select |#length| |main_~#a~0.base|)) (= 0 |main_~#a~0.offset|))} is VALID [2020-07-29 01:18:08,764 INFO L280 TraceCheckUtils]: 11: Hoare triple {2566#(and (<= 0 main_~k~0) (= 4192 (select |#length| |main_~#a~0.base|)) (= 0 |main_~#a~0.offset|))} SUMMARY for call write~int(#t~nondet1, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); srcloc: L15 {2566#(and (<= 0 main_~k~0) (= 4192 (select |#length| |main_~#a~0.base|)) (= 0 |main_~#a~0.offset|))} is VALID [2020-07-29 01:18:08,765 INFO L280 TraceCheckUtils]: 12: Hoare triple {2566#(and (<= 0 main_~k~0) (= 4192 (select |#length| |main_~#a~0.base|)) (= 0 |main_~#a~0.offset|))} havoc #t~nondet1; {2566#(and (<= 0 main_~k~0) (= 4192 (select |#length| |main_~#a~0.base|)) (= 0 |main_~#a~0.offset|))} is VALID [2020-07-29 01:18:08,766 INFO L280 TraceCheckUtils]: 13: Hoare triple {2566#(and (<= 0 main_~k~0) (= 4192 (select |#length| |main_~#a~0.base|)) (= 0 |main_~#a~0.offset|))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2566#(and (<= 0 main_~k~0) (= 4192 (select |#length| |main_~#a~0.base|)) (= 0 |main_~#a~0.offset|))} is VALID [2020-07-29 01:18:08,767 INFO L280 TraceCheckUtils]: 14: Hoare triple {2566#(and (<= 0 main_~k~0) (= 4192 (select |#length| |main_~#a~0.base|)) (= 0 |main_~#a~0.offset|))} assume !!(~i~0 < 1048);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {2566#(and (<= 0 main_~k~0) (= 4192 (select |#length| |main_~#a~0.base|)) (= 0 |main_~#a~0.offset|))} is VALID [2020-07-29 01:18:08,769 INFO L280 TraceCheckUtils]: 15: Hoare triple {2566#(and (<= 0 main_~k~0) (= 4192 (select |#length| |main_~#a~0.base|)) (= 0 |main_~#a~0.offset|))} SUMMARY for call write~int(#t~nondet1, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); srcloc: L15 {2566#(and (<= 0 main_~k~0) (= 4192 (select |#length| |main_~#a~0.base|)) (= 0 |main_~#a~0.offset|))} is VALID [2020-07-29 01:18:08,770 INFO L280 TraceCheckUtils]: 16: Hoare triple {2566#(and (<= 0 main_~k~0) (= 4192 (select |#length| |main_~#a~0.base|)) (= 0 |main_~#a~0.offset|))} havoc #t~nondet1; {2566#(and (<= 0 main_~k~0) (= 4192 (select |#length| |main_~#a~0.base|)) (= 0 |main_~#a~0.offset|))} is VALID [2020-07-29 01:18:08,772 INFO L280 TraceCheckUtils]: 17: Hoare triple {2566#(and (<= 0 main_~k~0) (= 4192 (select |#length| |main_~#a~0.base|)) (= 0 |main_~#a~0.offset|))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2566#(and (<= 0 main_~k~0) (= 4192 (select |#length| |main_~#a~0.base|)) (= 0 |main_~#a~0.offset|))} is VALID [2020-07-29 01:18:08,773 INFO L280 TraceCheckUtils]: 18: Hoare triple {2566#(and (<= 0 main_~k~0) (= 4192 (select |#length| |main_~#a~0.base|)) (= 0 |main_~#a~0.offset|))} assume !!(~i~0 < 1048);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {2566#(and (<= 0 main_~k~0) (= 4192 (select |#length| |main_~#a~0.base|)) (= 0 |main_~#a~0.offset|))} is VALID [2020-07-29 01:18:08,775 INFO L280 TraceCheckUtils]: 19: Hoare triple {2566#(and (<= 0 main_~k~0) (= 4192 (select |#length| |main_~#a~0.base|)) (= 0 |main_~#a~0.offset|))} SUMMARY for call write~int(#t~nondet1, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); srcloc: L15 {2566#(and (<= 0 main_~k~0) (= 4192 (select |#length| |main_~#a~0.base|)) (= 0 |main_~#a~0.offset|))} is VALID [2020-07-29 01:18:08,776 INFO L280 TraceCheckUtils]: 20: Hoare triple {2566#(and (<= 0 main_~k~0) (= 4192 (select |#length| |main_~#a~0.base|)) (= 0 |main_~#a~0.offset|))} havoc #t~nondet1; {2566#(and (<= 0 main_~k~0) (= 4192 (select |#length| |main_~#a~0.base|)) (= 0 |main_~#a~0.offset|))} is VALID [2020-07-29 01:18:08,777 INFO L280 TraceCheckUtils]: 21: Hoare triple {2566#(and (<= 0 main_~k~0) (= 4192 (select |#length| |main_~#a~0.base|)) (= 0 |main_~#a~0.offset|))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2566#(and (<= 0 main_~k~0) (= 4192 (select |#length| |main_~#a~0.base|)) (= 0 |main_~#a~0.offset|))} is VALID [2020-07-29 01:18:08,778 INFO L280 TraceCheckUtils]: 22: Hoare triple {2566#(and (<= 0 main_~k~0) (= 4192 (select |#length| |main_~#a~0.base|)) (= 0 |main_~#a~0.offset|))} assume !!(~i~0 < 1048);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {2566#(and (<= 0 main_~k~0) (= 4192 (select |#length| |main_~#a~0.base|)) (= 0 |main_~#a~0.offset|))} is VALID [2020-07-29 01:18:08,780 INFO L280 TraceCheckUtils]: 23: Hoare triple {2566#(and (<= 0 main_~k~0) (= 4192 (select |#length| |main_~#a~0.base|)) (= 0 |main_~#a~0.offset|))} SUMMARY for call write~int(#t~nondet1, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); srcloc: L15 {2566#(and (<= 0 main_~k~0) (= 4192 (select |#length| |main_~#a~0.base|)) (= 0 |main_~#a~0.offset|))} is VALID [2020-07-29 01:18:08,781 INFO L280 TraceCheckUtils]: 24: Hoare triple {2566#(and (<= 0 main_~k~0) (= 4192 (select |#length| |main_~#a~0.base|)) (= 0 |main_~#a~0.offset|))} havoc #t~nondet1; {2566#(and (<= 0 main_~k~0) (= 4192 (select |#length| |main_~#a~0.base|)) (= 0 |main_~#a~0.offset|))} is VALID [2020-07-29 01:18:08,782 INFO L280 TraceCheckUtils]: 25: Hoare triple {2566#(and (<= 0 main_~k~0) (= 4192 (select |#length| |main_~#a~0.base|)) (= 0 |main_~#a~0.offset|))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2566#(and (<= 0 main_~k~0) (= 4192 (select |#length| |main_~#a~0.base|)) (= 0 |main_~#a~0.offset|))} is VALID [2020-07-29 01:18:08,784 INFO L280 TraceCheckUtils]: 26: Hoare triple {2566#(and (<= 0 main_~k~0) (= 4192 (select |#length| |main_~#a~0.base|)) (= 0 |main_~#a~0.offset|))} assume !!(~i~0 < 1048);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {2566#(and (<= 0 main_~k~0) (= 4192 (select |#length| |main_~#a~0.base|)) (= 0 |main_~#a~0.offset|))} is VALID [2020-07-29 01:18:08,785 INFO L280 TraceCheckUtils]: 27: Hoare triple {2566#(and (<= 0 main_~k~0) (= 4192 (select |#length| |main_~#a~0.base|)) (= 0 |main_~#a~0.offset|))} SUMMARY for call write~int(#t~nondet1, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); srcloc: L15 {2566#(and (<= 0 main_~k~0) (= 4192 (select |#length| |main_~#a~0.base|)) (= 0 |main_~#a~0.offset|))} is VALID [2020-07-29 01:18:08,786 INFO L280 TraceCheckUtils]: 28: Hoare triple {2566#(and (<= 0 main_~k~0) (= 4192 (select |#length| |main_~#a~0.base|)) (= 0 |main_~#a~0.offset|))} havoc #t~nondet1; {2566#(and (<= 0 main_~k~0) (= 4192 (select |#length| |main_~#a~0.base|)) (= 0 |main_~#a~0.offset|))} is VALID [2020-07-29 01:18:08,787 INFO L280 TraceCheckUtils]: 29: Hoare triple {2566#(and (<= 0 main_~k~0) (= 4192 (select |#length| |main_~#a~0.base|)) (= 0 |main_~#a~0.offset|))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2566#(and (<= 0 main_~k~0) (= 4192 (select |#length| |main_~#a~0.base|)) (= 0 |main_~#a~0.offset|))} is VALID [2020-07-29 01:18:08,789 INFO L280 TraceCheckUtils]: 30: Hoare triple {2566#(and (<= 0 main_~k~0) (= 4192 (select |#length| |main_~#a~0.base|)) (= 0 |main_~#a~0.offset|))} assume !(~i~0 < 1048); {2566#(and (<= 0 main_~k~0) (= 4192 (select |#length| |main_~#a~0.base|)) (= 0 |main_~#a~0.offset|))} is VALID [2020-07-29 01:18:08,790 INFO L280 TraceCheckUtils]: 31: Hoare triple {2566#(and (<= 0 main_~k~0) (= 4192 (select |#length| |main_~#a~0.base|)) (= 0 |main_~#a~0.offset|))} #t~short3 := ~k~0 < 1048; {2566#(and (<= 0 main_~k~0) (= 4192 (select |#length| |main_~#a~0.base|)) (= 0 |main_~#a~0.offset|))} is VALID [2020-07-29 01:18:08,793 INFO L280 TraceCheckUtils]: 32: Hoare triple {2566#(and (<= 0 main_~k~0) (= 4192 (select |#length| |main_~#a~0.base|)) (= 0 |main_~#a~0.offset|))} assume #t~short3; {2566#(and (<= 0 main_~k~0) (= 4192 (select |#length| |main_~#a~0.base|)) (= 0 |main_~#a~0.offset|))} is VALID [2020-07-29 01:18:08,795 INFO L280 TraceCheckUtils]: 33: Hoare triple {2566#(and (<= 0 main_~k~0) (= 4192 (select |#length| |main_~#a~0.base|)) (= 0 |main_~#a~0.offset|))} SUMMARY for call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4); srcloc: L18-1 {2566#(and (<= 0 main_~k~0) (= 4192 (select |#length| |main_~#a~0.base|)) (= 0 |main_~#a~0.offset|))} is VALID [2020-07-29 01:18:08,818 INFO L280 TraceCheckUtils]: 34: Hoare triple {2566#(and (<= 0 main_~k~0) (= 4192 (select |#length| |main_~#a~0.base|)) (= 0 |main_~#a~0.offset|))} #t~short3 := #t~mem2 >= 0; {2566#(and (<= 0 main_~k~0) (= 4192 (select |#length| |main_~#a~0.base|)) (= 0 |main_~#a~0.offset|))} is VALID [2020-07-29 01:18:08,823 INFO L280 TraceCheckUtils]: 35: Hoare triple {2566#(and (<= 0 main_~k~0) (= 4192 (select |#length| |main_~#a~0.base|)) (= 0 |main_~#a~0.offset|))} assume !!#t~short3;havoc #t~short3;havoc #t~mem2;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {2566#(and (<= 0 main_~k~0) (= 4192 (select |#length| |main_~#a~0.base|)) (= 0 |main_~#a~0.offset|))} is VALID [2020-07-29 01:18:08,825 INFO L280 TraceCheckUtils]: 36: Hoare triple {2566#(and (<= 0 main_~k~0) (= 4192 (select |#length| |main_~#a~0.base|)) (= 0 |main_~#a~0.offset|))} assume 0 != #t~nondet4;havoc #t~nondet4;#t~post5 := ~k~0;~k~0 := 1 + #t~post5;havoc #t~post5; {2660#(and (<= 1 main_~k~0) (= 4192 (select |#length| |main_~#a~0.base|)) (= 0 |main_~#a~0.offset|))} is VALID [2020-07-29 01:18:08,830 INFO L280 TraceCheckUtils]: 37: Hoare triple {2660#(and (<= 1 main_~k~0) (= 4192 (select |#length| |main_~#a~0.base|)) (= 0 |main_~#a~0.offset|))} #t~short3 := ~k~0 < 1048; {2664#(and (<= 1 main_~k~0) (= 4192 (select |#length| |main_~#a~0.base|)) (or (and (< main_~k~0 1048) |main_#t~short3|) (and (<= 1048 main_~k~0) (not |main_#t~short3|))) (= 0 |main_~#a~0.offset|))} is VALID [2020-07-29 01:18:08,832 INFO L280 TraceCheckUtils]: 38: Hoare triple {2664#(and (<= 1 main_~k~0) (= 4192 (select |#length| |main_~#a~0.base|)) (or (and (< main_~k~0 1048) |main_#t~short3|) (and (<= 1048 main_~k~0) (not |main_#t~short3|))) (= 0 |main_~#a~0.offset|))} assume #t~short3; {2668#(and (<= 1 main_~k~0) (< main_~k~0 1048) (= 4192 (select |#length| |main_~#a~0.base|)) (= 0 |main_~#a~0.offset|))} is VALID [2020-07-29 01:18:08,833 INFO L280 TraceCheckUtils]: 39: Hoare triple {2668#(and (<= 1 main_~k~0) (< main_~k~0 1048) (= 4192 (select |#length| |main_~#a~0.base|)) (= 0 |main_~#a~0.offset|))} assume !(4 + (~#a~0.offset + 4 * ~k~0) <= #length[~#a~0.base] && 0 <= ~#a~0.offset + 4 * ~k~0); {2536#false} is VALID [2020-07-29 01:18:08,841 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2020-07-29 01:18:08,841 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-29 01:18:08,842 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 14 [2020-07-29 01:18:08,843 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547345112] [2020-07-29 01:18:08,845 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 40 [2020-07-29 01:18:08,846 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:18:08,846 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-29 01:18:08,884 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:18:08,884 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-29 01:18:08,885 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:18:08,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-29 01:18:08,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2020-07-29 01:18:08,885 INFO L87 Difference]: Start difference. First operand 54 states and 58 transitions. Second operand 6 states. [2020-07-29 01:18:09,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:18:09,064 INFO L93 Difference]: Finished difference Result 54 states and 58 transitions. [2020-07-29 01:18:09,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-29 01:18:09,065 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 40 [2020-07-29 01:18:09,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:18:09,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-29 01:18:09,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 41 transitions. [2020-07-29 01:18:09,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-29 01:18:09,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 41 transitions. [2020-07-29 01:18:09,073 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 41 transitions. [2020-07-29 01:18:09,124 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:18:09,124 INFO L225 Difference]: With dead ends: 54 [2020-07-29 01:18:09,124 INFO L226 Difference]: Without dead ends: 0 [2020-07-29 01:18:09,124 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2020-07-29 01:18:09,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-29 01:18:09,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-29 01:18:09,125 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:18:09,125 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-29 01:18:09,125 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-29 01:18:09,125 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-29 01:18:09,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:18:09,126 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-29 01:18:09,126 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-29 01:18:09,126 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:18:09,126 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:18:09,127 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-29 01:18:09,127 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-29 01:18:09,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:18:09,127 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-29 01:18:09,127 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-29 01:18:09,128 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:18:09,128 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:18:09,128 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:18:09,128 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:18:09,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-29 01:18:09,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-29 01:18:09,129 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 40 [2020-07-29 01:18:09,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:18:09,129 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 01:18:09,129 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-29 01:18:09,130 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-29 01:18:09,130 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:18:09,330 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2020-07-29 01:18:09,337 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.07 01:18:09 BoogieIcfgContainer [2020-07-29 01:18:09,337 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-29 01:18:09,338 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-07-29 01:18:09,338 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-07-29 01:18:09,338 INFO L275 PluginConnector]: Witness Printer initialized [2020-07-29 01:18:09,338 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:17:59" (3/4) ... [2020-07-29 01:18:09,341 INFO L137 WitnessPrinter]: Generating witness for correct program [2020-07-29 01:18:09,347 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2020-07-29 01:18:09,348 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2020-07-29 01:18:09,352 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2020-07-29 01:18:09,353 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2020-07-29 01:18:09,353 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2020-07-29 01:18:09,353 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2020-07-29 01:18:09,396 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-07-29 01:18:09,397 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-07-29 01:18:09,399 INFO L168 Benchmark]: Toolchain (without parser) took 10525.08 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 295.2 MB). Free memory was 950.8 MB in the beginning and 886.4 MB in the end (delta: 64.4 MB). Peak memory consumption was 359.6 MB. Max. memory is 11.5 GB. [2020-07-29 01:18:09,399 INFO L168 Benchmark]: CDTParser took 0.28 ms. Allocated memory is still 1.0 GB. Free memory is still 981.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 01:18:09,400 INFO L168 Benchmark]: CACSL2BoogieTranslator took 306.86 ms. Allocated memory is still 1.0 GB. Free memory was 950.8 MB in the beginning and 940.1 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:09,400 INFO L168 Benchmark]: Boogie Preprocessor took 156.22 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 154.7 MB). Free memory was 940.1 MB in the beginning and 1.1 GB in the end (delta: -204.0 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. [2020-07-29 01:18:09,401 INFO L168 Benchmark]: RCFGBuilder took 532.88 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.6 MB). Peak memory consumption was 31.6 MB. Max. memory is 11.5 GB. [2020-07-29 01:18:09,401 INFO L168 Benchmark]: TraceAbstraction took 9463.14 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 140.5 MB). Free memory was 1.1 GB in the beginning and 895.2 MB in the end (delta: 217.2 MB). Peak memory consumption was 357.7 MB. Max. memory is 11.5 GB. [2020-07-29 01:18:09,402 INFO L168 Benchmark]: Witness Printer took 59.24 ms. Allocated memory is still 1.3 GB. Free memory was 895.2 MB in the beginning and 886.4 MB in the end (delta: 8.8 MB). Peak memory consumption was 8.8 MB. Max. memory is 11.5 GB. [2020-07-29 01:18:09,404 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.28 ms. Allocated memory is still 1.0 GB. Free memory is still 981.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 306.86 ms. Allocated memory is still 1.0 GB. Free memory was 950.8 MB in the beginning and 940.1 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 156.22 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 154.7 MB). Free memory was 940.1 MB in the beginning and 1.1 GB in the end (delta: -204.0 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 532.88 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.6 MB). Peak memory consumption was 31.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 9463.14 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 140.5 MB). Free memory was 1.1 GB in the beginning and 895.2 MB in the end (delta: 217.2 MB). Peak memory consumption was 357.7 MB. Max. memory is 11.5 GB. * Witness Printer took 59.24 ms. Allocated memory is still 1.3 GB. Free memory was 895.2 MB in the beginning and 886.4 MB in the end (delta: 8.8 MB). Peak memory consumption was 8.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 18]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 18]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 22]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 22]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 15]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 15]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 22]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 22]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 10]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - AllSpecificationsHoldResult: All specifications hold 9 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 34 locations, 9 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 9.4s, OverallIterations: 12, TraceHistogramMax: 6, AutomataDifference: 3.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 266 SDtfs, 185 SDslu, 583 SDs, 0 SdLazy, 573 SolverSat, 31 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 288 GetRequests, 217 SyntacticMatches, 4 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=54occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 12 MinimizatonAttempts, 24 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.1s InterpolantComputationTime, 482 NumberOfCodeBlocks, 446 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 462 ConstructedInterpolants, 1 QuantifiedInterpolants, 57358 SizeOfPredicates, 5 NumberOfNonLiveVariables, 617 ConjunctsInSsa, 52 ConjunctsInUnsatCore, 20 InterpolantComputations, 7 PerfectInterpolantSequences, 152/444 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 correct! Received shutdown request...