./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/memory-alloca/c.03-alloca-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_68d94ab8-0c23-4268-abb9-09de895ef163/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_68d94ab8-0c23-4268-abb9-09de895ef163/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_68d94ab8-0c23-4268-abb9-09de895ef163/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_68d94ab8-0c23-4268-abb9-09de895ef163/bin/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/memory-alloca/c.03-alloca-2.i -s /tmp/vcloud-vcloud-master/worker/working_dir_68d94ab8-0c23-4268-abb9-09de895ef163/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_68d94ab8-0c23-4268-abb9-09de895ef163/bin/utaipan --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ab87ef7cc863b18816ae397a50b6c6e9fb3e753d ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-10-22 11:26:32,041 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 11:26:32,042 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 11:26:32,051 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 11:26:32,052 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 11:26:32,054 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 11:26:32,055 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 11:26:32,056 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 11:26:32,057 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 11:26:32,058 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 11:26:32,059 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 11:26:32,060 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 11:26:32,060 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 11:26:32,061 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 11:26:32,061 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 11:26:32,062 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 11:26:32,063 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 11:26:32,064 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 11:26:32,065 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 11:26:32,067 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 11:26:32,068 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 11:26:32,069 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 11:26:32,070 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 11:26:32,070 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 11:26:32,072 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 11:26:32,073 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 11:26:32,073 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 11:26:32,074 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 11:26:32,074 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 11:26:32,075 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 11:26:32,075 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 11:26:32,076 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 11:26:32,076 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 11:26:32,077 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 11:26:32,078 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 11:26:32,078 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 11:26:32,079 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 11:26:32,079 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 11:26:32,079 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 11:26:32,083 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 11:26:32,084 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 11:26:32,085 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_68d94ab8-0c23-4268-abb9-09de895ef163/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2019-10-22 11:26:32,096 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 11:26:32,097 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 11:26:32,097 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-10-22 11:26:32,098 INFO L138 SettingsManager]: * User list type=DISABLED [2019-10-22 11:26:32,098 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-10-22 11:26:32,098 INFO L138 SettingsManager]: * Explicit value domain=true [2019-10-22 11:26:32,098 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-10-22 11:26:32,098 INFO L138 SettingsManager]: * Octagon Domain=false [2019-10-22 11:26:32,098 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-10-22 11:26:32,098 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-10-22 11:26:32,099 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-10-22 11:26:32,099 INFO L138 SettingsManager]: * Interval Domain=false [2019-10-22 11:26:32,099 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-22 11:26:32,099 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-22 11:26:32,100 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 11:26:32,100 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-22 11:26:32,100 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-10-22 11:26:32,100 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 11:26:32,101 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-22 11:26:32,101 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 11:26:32,101 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-10-22 11:26:32,101 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-10-22 11:26:32,101 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-10-22 11:26:32,101 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-22 11:26:32,101 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-22 11:26:32,102 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 11:26:32,102 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 11:26:32,102 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-22 11:26:32,102 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-22 11:26:32,102 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-22 11:26:32,102 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 11:26:32,102 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-22 11:26:32,103 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-10-22 11:26:32,103 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-22 11:26:32,103 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-22 11:26:32,103 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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 -> /tmp/vcloud-vcloud-master/worker/working_dir_68d94ab8-0c23-4268-abb9-09de895ef163/bin/utaipan 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 -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ab87ef7cc863b18816ae397a50b6c6e9fb3e753d [2019-10-22 11:26:32,127 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 11:26:32,138 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 11:26:32,141 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 11:26:32,143 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 11:26:32,143 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 11:26:32,144 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_68d94ab8-0c23-4268-abb9-09de895ef163/bin/utaipan/../../sv-benchmarks/c/memory-alloca/c.03-alloca-2.i [2019-10-22 11:26:32,197 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_68d94ab8-0c23-4268-abb9-09de895ef163/bin/utaipan/data/3be90c9b5/2ef021d3bf7542d69b7f4b7a8c859034/FLAG964e1e57f [2019-10-22 11:26:32,613 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 11:26:32,615 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_68d94ab8-0c23-4268-abb9-09de895ef163/sv-benchmarks/c/memory-alloca/c.03-alloca-2.i [2019-10-22 11:26:32,625 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_68d94ab8-0c23-4268-abb9-09de895ef163/bin/utaipan/data/3be90c9b5/2ef021d3bf7542d69b7f4b7a8c859034/FLAG964e1e57f [2019-10-22 11:26:32,980 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_68d94ab8-0c23-4268-abb9-09de895ef163/bin/utaipan/data/3be90c9b5/2ef021d3bf7542d69b7f4b7a8c859034 [2019-10-22 11:26:32,982 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 11:26:32,983 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 11:26:32,984 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 11:26:32,984 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 11:26:32,988 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 11:26:32,988 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 11:26:32" (1/1) ... [2019-10-22 11:26:32,991 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@40b5808b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:26:32, skipping insertion in model container [2019-10-22 11:26:32,991 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 11:26:32" (1/1) ... [2019-10-22 11:26:32,998 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 11:26:33,039 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 11:26:33,403 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 11:26:33,414 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 11:26:33,462 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 11:26:33,502 INFO L192 MainTranslator]: Completed translation [2019-10-22 11:26:33,502 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:26:33 WrapperNode [2019-10-22 11:26:33,502 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 11:26:33,503 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 11:26:33,504 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 11:26:33,504 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 11:26:33,512 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:26:33" (1/1) ... [2019-10-22 11:26:33,525 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:26:33" (1/1) ... [2019-10-22 11:26:33,547 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 11:26:33,549 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 11:26:33,549 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 11:26:33,550 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 11:26:33,558 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:26:33" (1/1) ... [2019-10-22 11:26:33,558 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:26:33" (1/1) ... [2019-10-22 11:26:33,562 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:26:33" (1/1) ... [2019-10-22 11:26:33,569 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:26:33" (1/1) ... [2019-10-22 11:26:33,573 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:26:33" (1/1) ... [2019-10-22 11:26:33,579 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:26:33" (1/1) ... [2019-10-22 11:26:33,580 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:26:33" (1/1) ... [2019-10-22 11:26:33,586 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 11:26:33,589 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 11:26:33,590 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 11:26:33,590 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 11:26:33,591 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:26:33" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_68d94ab8-0c23-4268-abb9-09de895ef163/bin/utaipan/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 [2019-10-22 11:26:33,645 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-22 11:26:33,646 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-22 11:26:33,646 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-22 11:26:33,647 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-22 11:26:33,647 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 11:26:33,647 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 11:26:33,972 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 11:26:33,972 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-10-22 11:26:33,973 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:26:33 BoogieIcfgContainer [2019-10-22 11:26:33,973 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 11:26:33,974 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-22 11:26:33,974 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-22 11:26:33,978 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-22 11:26:33,978 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.10 11:26:32" (1/3) ... [2019-10-22 11:26:33,979 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41fbae0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 11:26:33, skipping insertion in model container [2019-10-22 11:26:33,979 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:26:33" (2/3) ... [2019-10-22 11:26:33,980 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41fbae0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 11:26:33, skipping insertion in model container [2019-10-22 11:26:33,980 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:26:33" (3/3) ... [2019-10-22 11:26:33,982 INFO L109 eAbstractionObserver]: Analyzing ICFG c.03-alloca-2.i [2019-10-22 11:26:33,991 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-22 11:26:33,999 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 31 error locations. [2019-10-22 11:26:34,011 INFO L249 AbstractCegarLoop]: Starting to check reachability of 31 error locations. [2019-10-22 11:26:34,028 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-22 11:26:34,029 INFO L374 AbstractCegarLoop]: Hoare is false [2019-10-22 11:26:34,029 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-22 11:26:34,029 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 11:26:34,029 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 11:26:34,029 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-22 11:26:34,029 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 11:26:34,029 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-22 11:26:34,042 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states. [2019-10-22 11:26:34,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-10-22 11:26:34,049 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:26:34,049 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-10-22 11:26:34,051 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION]=== [2019-10-22 11:26:34,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:26:34,055 INFO L82 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2019-10-22 11:26:34,061 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:26:34,061 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123340416] [2019-10-22 11:26:34,061 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:34,062 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:34,062 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:26:34,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:26:34,203 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:26:34,204 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123340416] [2019-10-22 11:26:34,204 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:26:34,205 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 11:26:34,205 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114391459] [2019-10-22 11:26:34,209 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:26:34,210 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:26:34,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:26:34,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:26:34,225 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 3 states. [2019-10-22 11:26:34,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:26:34,315 INFO L93 Difference]: Finished difference Result 53 states and 54 transitions. [2019-10-22 11:26:34,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:26:34,317 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-10-22 11:26:34,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:26:34,326 INFO L225 Difference]: With dead ends: 53 [2019-10-22 11:26:34,326 INFO L226 Difference]: Without dead ends: 51 [2019-10-22 11:26:34,327 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:26:34,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-10-22 11:26:34,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2019-10-22 11:26:34,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-10-22 11:26:34,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 52 transitions. [2019-10-22 11:26:34,360 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 52 transitions. Word has length 3 [2019-10-22 11:26:34,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:26:34,360 INFO L462 AbstractCegarLoop]: Abstraction has 51 states and 52 transitions. [2019-10-22 11:26:34,360 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:26:34,360 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 52 transitions. [2019-10-22 11:26:34,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-10-22 11:26:34,361 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:26:34,361 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-10-22 11:26:34,361 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION]=== [2019-10-22 11:26:34,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:26:34,362 INFO L82 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2019-10-22 11:26:34,362 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:26:34,362 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458152471] [2019-10-22 11:26:34,362 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:34,362 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:34,362 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:26:34,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:26:34,417 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:26:34,418 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458152471] [2019-10-22 11:26:34,418 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:26:34,418 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 11:26:34,418 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647785075] [2019-10-22 11:26:34,419 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:26:34,420 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:26:34,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:26:34,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:26:34,420 INFO L87 Difference]: Start difference. First operand 51 states and 52 transitions. Second operand 3 states. [2019-10-22 11:26:34,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:26:34,470 INFO L93 Difference]: Finished difference Result 46 states and 47 transitions. [2019-10-22 11:26:34,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:26:34,470 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-10-22 11:26:34,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:26:34,471 INFO L225 Difference]: With dead ends: 46 [2019-10-22 11:26:34,471 INFO L226 Difference]: Without dead ends: 46 [2019-10-22 11:26:34,472 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:26:34,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-10-22 11:26:34,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2019-10-22 11:26:34,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-10-22 11:26:34,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 47 transitions. [2019-10-22 11:26:34,476 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 47 transitions. Word has length 3 [2019-10-22 11:26:34,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:26:34,476 INFO L462 AbstractCegarLoop]: Abstraction has 46 states and 47 transitions. [2019-10-22 11:26:34,476 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:26:34,476 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 47 transitions. [2019-10-22 11:26:34,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-10-22 11:26:34,477 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:26:34,477 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-10-22 11:26:34,477 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION]=== [2019-10-22 11:26:34,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:26:34,477 INFO L82 PathProgramCache]: Analyzing trace with hash 925543, now seen corresponding path program 1 times [2019-10-22 11:26:34,478 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:26:34,478 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692694866] [2019-10-22 11:26:34,478 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:34,478 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:34,478 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:26:34,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:26:34,510 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:26:34,510 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692694866] [2019-10-22 11:26:34,511 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:26:34,511 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 11:26:34,511 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781153048] [2019-10-22 11:26:34,511 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:26:34,511 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:26:34,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:26:34,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:26:34,512 INFO L87 Difference]: Start difference. First operand 46 states and 47 transitions. Second operand 3 states. [2019-10-22 11:26:34,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:26:34,556 INFO L93 Difference]: Finished difference Result 44 states and 45 transitions. [2019-10-22 11:26:34,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:26:34,557 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-10-22 11:26:34,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:26:34,557 INFO L225 Difference]: With dead ends: 44 [2019-10-22 11:26:34,557 INFO L226 Difference]: Without dead ends: 44 [2019-10-22 11:26:34,558 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:26:34,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-10-22 11:26:34,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2019-10-22 11:26:34,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-10-22 11:26:34,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 45 transitions. [2019-10-22 11:26:34,561 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 45 transitions. Word has length 4 [2019-10-22 11:26:34,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:26:34,561 INFO L462 AbstractCegarLoop]: Abstraction has 44 states and 45 transitions. [2019-10-22 11:26:34,562 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:26:34,562 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 45 transitions. [2019-10-22 11:26:34,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-10-22 11:26:34,562 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:26:34,562 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-10-22 11:26:34,562 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION]=== [2019-10-22 11:26:34,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:26:34,563 INFO L82 PathProgramCache]: Analyzing trace with hash 925544, now seen corresponding path program 1 times [2019-10-22 11:26:34,563 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:26:34,563 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743080873] [2019-10-22 11:26:34,563 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:34,563 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:34,563 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:26:34,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:26:34,601 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:26:34,602 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743080873] [2019-10-22 11:26:34,602 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:26:34,602 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 11:26:34,602 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763693739] [2019-10-22 11:26:34,602 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:26:34,603 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:26:34,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:26:34,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:26:34,603 INFO L87 Difference]: Start difference. First operand 44 states and 45 transitions. Second operand 3 states. [2019-10-22 11:26:34,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:26:34,658 INFO L93 Difference]: Finished difference Result 42 states and 43 transitions. [2019-10-22 11:26:34,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:26:34,660 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-10-22 11:26:34,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:26:34,660 INFO L225 Difference]: With dead ends: 42 [2019-10-22 11:26:34,660 INFO L226 Difference]: Without dead ends: 42 [2019-10-22 11:26:34,661 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:26:34,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-10-22 11:26:34,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2019-10-22 11:26:34,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-10-22 11:26:34,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 43 transitions. [2019-10-22 11:26:34,667 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 43 transitions. Word has length 4 [2019-10-22 11:26:34,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:26:34,667 INFO L462 AbstractCegarLoop]: Abstraction has 42 states and 43 transitions. [2019-10-22 11:26:34,667 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:26:34,672 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 43 transitions. [2019-10-22 11:26:34,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-10-22 11:26:34,673 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:26:34,673 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-10-22 11:26:34,673 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION]=== [2019-10-22 11:26:34,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:26:34,673 INFO L82 PathProgramCache]: Analyzing trace with hash 28691812, now seen corresponding path program 1 times [2019-10-22 11:26:34,674 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:26:34,674 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308034549] [2019-10-22 11:26:34,674 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:34,674 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:34,674 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:26:34,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:26:34,741 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:26:34,741 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308034549] [2019-10-22 11:26:34,741 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:26:34,742 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 11:26:34,742 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716298922] [2019-10-22 11:26:34,742 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:26:34,742 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:26:34,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:26:34,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:26:34,743 INFO L87 Difference]: Start difference. First operand 42 states and 43 transitions. Second operand 3 states. [2019-10-22 11:26:34,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:26:34,785 INFO L93 Difference]: Finished difference Result 38 states and 39 transitions. [2019-10-22 11:26:34,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:26:34,785 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-10-22 11:26:34,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:26:34,786 INFO L225 Difference]: With dead ends: 38 [2019-10-22 11:26:34,786 INFO L226 Difference]: Without dead ends: 38 [2019-10-22 11:26:34,786 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:26:34,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-10-22 11:26:34,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2019-10-22 11:26:34,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-10-22 11:26:34,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 39 transitions. [2019-10-22 11:26:34,789 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 39 transitions. Word has length 5 [2019-10-22 11:26:34,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:26:34,790 INFO L462 AbstractCegarLoop]: Abstraction has 38 states and 39 transitions. [2019-10-22 11:26:34,790 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:26:34,790 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 39 transitions. [2019-10-22 11:26:34,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-10-22 11:26:34,790 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:26:34,790 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-10-22 11:26:34,790 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION]=== [2019-10-22 11:26:34,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:26:34,791 INFO L82 PathProgramCache]: Analyzing trace with hash 28691813, now seen corresponding path program 1 times [2019-10-22 11:26:34,791 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:26:34,791 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262747713] [2019-10-22 11:26:34,791 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:34,791 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:34,791 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:26:34,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:26:34,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:26:34,827 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262747713] [2019-10-22 11:26:34,828 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:26:34,828 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 11:26:34,828 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049696890] [2019-10-22 11:26:34,828 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:26:34,828 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:26:34,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:26:34,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:26:34,829 INFO L87 Difference]: Start difference. First operand 38 states and 39 transitions. Second operand 3 states. [2019-10-22 11:26:34,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:26:34,861 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2019-10-22 11:26:34,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:26:34,861 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-10-22 11:26:34,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:26:34,862 INFO L225 Difference]: With dead ends: 34 [2019-10-22 11:26:34,862 INFO L226 Difference]: Without dead ends: 34 [2019-10-22 11:26:34,862 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:26:34,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-10-22 11:26:34,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2019-10-22 11:26:34,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-10-22 11:26:34,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 35 transitions. [2019-10-22 11:26:34,865 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 35 transitions. Word has length 5 [2019-10-22 11:26:34,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:26:34,865 INFO L462 AbstractCegarLoop]: Abstraction has 34 states and 35 transitions. [2019-10-22 11:26:34,865 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:26:34,865 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2019-10-22 11:26:34,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-10-22 11:26:34,866 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:26:34,866 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-10-22 11:26:34,866 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION]=== [2019-10-22 11:26:34,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:26:34,866 INFO L82 PathProgramCache]: Analyzing trace with hash 889446154, now seen corresponding path program 1 times [2019-10-22 11:26:34,866 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:26:34,866 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955650145] [2019-10-22 11:26:34,867 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:34,867 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:34,867 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:26:34,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:26:34,899 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:26:34,899 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955650145] [2019-10-22 11:26:34,899 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:26:34,899 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 11:26:34,900 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075870573] [2019-10-22 11:26:34,900 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:26:34,900 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:26:34,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:26:34,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:26:34,901 INFO L87 Difference]: Start difference. First operand 34 states and 35 transitions. Second operand 3 states. [2019-10-22 11:26:34,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:26:34,942 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2019-10-22 11:26:34,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:26:34,942 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2019-10-22 11:26:34,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:26:34,943 INFO L225 Difference]: With dead ends: 30 [2019-10-22 11:26:34,943 INFO L226 Difference]: Without dead ends: 30 [2019-10-22 11:26:34,943 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:26:34,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-10-22 11:26:34,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-10-22 11:26:34,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-10-22 11:26:34,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2019-10-22 11:26:34,945 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 6 [2019-10-22 11:26:34,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:26:34,945 INFO L462 AbstractCegarLoop]: Abstraction has 30 states and 31 transitions. [2019-10-22 11:26:34,945 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:26:34,945 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2019-10-22 11:26:34,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-10-22 11:26:34,946 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:26:34,946 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-10-22 11:26:34,946 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION]=== [2019-10-22 11:26:34,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:26:34,946 INFO L82 PathProgramCache]: Analyzing trace with hash 889446155, now seen corresponding path program 1 times [2019-10-22 11:26:34,947 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:26:34,947 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493403289] [2019-10-22 11:26:34,947 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:34,947 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:34,947 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:26:34,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:26:34,998 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:26:34,998 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493403289] [2019-10-22 11:26:34,999 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:26:34,999 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 11:26:34,999 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480644318] [2019-10-22 11:26:34,999 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:26:34,999 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:26:35,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:26:35,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:26:35,000 INFO L87 Difference]: Start difference. First operand 30 states and 31 transitions. Second operand 3 states. [2019-10-22 11:26:35,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:26:35,026 INFO L93 Difference]: Finished difference Result 26 states and 27 transitions. [2019-10-22 11:26:35,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:26:35,026 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2019-10-22 11:26:35,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:26:35,027 INFO L225 Difference]: With dead ends: 26 [2019-10-22 11:26:35,027 INFO L226 Difference]: Without dead ends: 26 [2019-10-22 11:26:35,027 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:26:35,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-10-22 11:26:35,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-10-22 11:26:35,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-10-22 11:26:35,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2019-10-22 11:26:35,029 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 27 transitions. Word has length 6 [2019-10-22 11:26:35,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:26:35,029 INFO L462 AbstractCegarLoop]: Abstraction has 26 states and 27 transitions. [2019-10-22 11:26:35,030 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:26:35,030 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2019-10-22 11:26:35,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-10-22 11:26:35,030 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:26:35,030 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:26:35,030 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION]=== [2019-10-22 11:26:35,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:26:35,031 INFO L82 PathProgramCache]: Analyzing trace with hash -1831182508, now seen corresponding path program 1 times [2019-10-22 11:26:35,031 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:26:35,031 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705565498] [2019-10-22 11:26:35,031 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:35,031 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:35,031 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:26:35,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:26:35,188 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:26:35,189 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705565498] [2019-10-22 11:26:35,189 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:26:35,189 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:26:35,189 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226403403] [2019-10-22 11:26:35,189 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:26:35,190 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:26:35,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:26:35,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:26:35,190 INFO L87 Difference]: Start difference. First operand 26 states and 27 transitions. Second operand 4 states. [2019-10-22 11:26:35,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:26:35,243 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2019-10-22 11:26:35,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 11:26:35,243 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-10-22 11:26:35,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:26:35,244 INFO L225 Difference]: With dead ends: 25 [2019-10-22 11:26:35,244 INFO L226 Difference]: Without dead ends: 0 [2019-10-22 11:26:35,244 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:26:35,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-22 11:26:35,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-22 11:26:35,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-22 11:26:35,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-22 11:26:35,245 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 13 [2019-10-22 11:26:35,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:26:35,245 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 11:26:35,245 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:26:35,245 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-22 11:26:35,246 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-22 11:26:35,251 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.10 11:26:35 BoogieIcfgContainer [2019-10-22 11:26:35,251 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-22 11:26:35,251 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 11:26:35,252 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 11:26:35,252 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 11:26:35,252 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:26:33" (3/4) ... [2019-10-22 11:26:35,256 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-10-22 11:26:35,267 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2019-10-22 11:26:35,267 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-10-22 11:26:35,267 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-10-22 11:26:35,316 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_68d94ab8-0c23-4268-abb9-09de895ef163/bin/utaipan/witness.graphml [2019-10-22 11:26:35,316 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 11:26:35,318 INFO L168 Benchmark]: Toolchain (without parser) took 2334.15 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 102.8 MB). Free memory was 939.2 MB in the beginning and 907.8 MB in the end (delta: 31.3 MB). Peak memory consumption was 134.1 MB. Max. memory is 11.5 GB. [2019-10-22 11:26:35,318 INFO L168 Benchmark]: CDTParser took 0.31 ms. Allocated memory is still 1.0 GB. Free memory is still 962.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 11:26:35,319 INFO L168 Benchmark]: CACSL2BoogieTranslator took 518.54 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 102.8 MB). Free memory was 939.2 MB in the beginning and 1.1 GB in the end (delta: -145.3 MB). Peak memory consumption was 17.9 MB. Max. memory is 11.5 GB. [2019-10-22 11:26:35,319 INFO L168 Benchmark]: Boogie Procedure Inliner took 45.74 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. [2019-10-22 11:26:35,319 INFO L168 Benchmark]: Boogie Preprocessor took 39.69 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 11:26:35,320 INFO L168 Benchmark]: RCFGBuilder took 384.15 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 29.2 MB). Peak memory consumption was 29.2 MB. Max. memory is 11.5 GB. [2019-10-22 11:26:35,320 INFO L168 Benchmark]: TraceAbstraction took 1276.80 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 914.8 MB in the end (delta: 133.4 MB). Peak memory consumption was 133.4 MB. Max. memory is 11.5 GB. [2019-10-22 11:26:35,320 INFO L168 Benchmark]: Witness Printer took 64.99 ms. Allocated memory is still 1.1 GB. Free memory was 914.8 MB in the beginning and 907.8 MB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. [2019-10-22 11:26:35,322 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.31 ms. Allocated memory is still 1.0 GB. Free memory is still 962.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 518.54 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 102.8 MB). Free memory was 939.2 MB in the beginning and 1.1 GB in the end (delta: -145.3 MB). Peak memory consumption was 17.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 45.74 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 39.69 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 384.15 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 29.2 MB). Peak memory consumption was 29.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 1276.80 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 914.8 MB in the end (delta: 133.4 MB). Peak memory consumption was 133.4 MB. Max. memory is 11.5 GB. * Witness Printer took 64.99 ms. Allocated memory is still 1.1 GB. Free memory was 914.8 MB in the beginning and 907.8 MB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 522]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 522]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 522]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 521]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 532]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 521]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 530]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 530]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 522]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 528]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 520]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 519]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 520]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 528]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 518]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 528]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 526]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 526]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 528]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 519]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 526]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 526]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 518]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 524]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 524]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 524]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 523]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 523]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 524]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 523]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 523]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 31 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 58 locations, 31 error locations. Result: SAFE, OverallTime: 1.2s, OverallIterations: 9, TraceHistogramMax: 1, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 148 SDtfs, 293 SDslu, 17 SDs, 0 SdLazy, 231 SolverSat, 22 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 19 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=58occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 9 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 49 NumberOfCodeBlocks, 49 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 40 ConstructedInterpolants, 0 QuantifiedInterpolants, 4992 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...