./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/verifythis/lcp.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_3854473c-61ba-46fe-b64e-23a519e0219d/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_3854473c-61ba-46fe-b64e-23a519e0219d/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_3854473c-61ba-46fe-b64e-23a519e0219d/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_3854473c-61ba-46fe-b64e-23a519e0219d/bin/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/verifythis/lcp.c -s /tmp/vcloud-vcloud-master/worker/run_dir_3854473c-61ba-46fe-b64e-23a519e0219d/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_3854473c-61ba-46fe-b64e-23a519e0219d/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 17e6e52dd20f9be422d05cd630fd9252ae3011a2 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 20:49:23,968 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 20:49:23,969 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 20:49:23,977 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 20:49:23,977 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 20:49:23,978 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 20:49:23,979 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 20:49:23,981 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 20:49:23,982 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 20:49:23,983 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 20:49:23,984 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 20:49:23,985 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 20:49:23,985 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 20:49:23,986 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 20:49:23,987 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 20:49:23,988 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 20:49:23,989 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 20:49:23,990 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 20:49:23,992 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 20:49:23,994 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 20:49:23,995 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 20:49:23,996 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 20:49:23,997 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 20:49:23,998 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 20:49:24,000 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 20:49:24,000 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 20:49:24,000 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 20:49:24,001 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 20:49:24,001 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 20:49:24,002 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 20:49:24,002 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 20:49:24,003 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 20:49:24,003 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 20:49:24,004 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 20:49:24,004 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 20:49:24,005 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 20:49:24,005 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 20:49:24,005 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 20:49:24,006 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 20:49:24,006 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 20:49:24,007 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 20:49:24,007 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_3854473c-61ba-46fe-b64e-23a519e0219d/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2019-12-07 20:49:24,019 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 20:49:24,019 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 20:49:24,019 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 20:49:24,020 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 20:49:24,020 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 20:49:24,020 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 20:49:24,020 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-12-07 20:49:24,020 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 20:49:24,020 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 20:49:24,020 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-12-07 20:49:24,020 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-12-07 20:49:24,021 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 20:49:24,021 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-12-07 20:49:24,021 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-12-07 20:49:24,021 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-12-07 20:49:24,022 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 20:49:24,022 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 20:49:24,022 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 20:49:24,022 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 20:49:24,022 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-12-07 20:49:24,022 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 20:49:24,022 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 20:49:24,022 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 20:49:24,023 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-12-07 20:49:24,023 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-12-07 20:49:24,023 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-12-07 20:49:24,023 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 20:49:24,023 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 20:49:24,023 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 20:49:24,023 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 20:49:24,024 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 20:49:24,024 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 20:49:24,024 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 20:49:24,024 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 20:49:24,024 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 20:49:24,024 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 20:49:24,024 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-12-07 20:49:24,025 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 20:49:24,025 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 20:49:24,025 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 20:49:24,025 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/run_dir_3854473c-61ba-46fe-b64e-23a519e0219d/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 -> 17e6e52dd20f9be422d05cd630fd9252ae3011a2 [2019-12-07 20:49:24,141 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 20:49:24,151 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 20:49:24,154 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 20:49:24,155 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 20:49:24,155 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 20:49:24,156 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_3854473c-61ba-46fe-b64e-23a519e0219d/bin/utaipan/../../sv-benchmarks/c/verifythis/lcp.c [2019-12-07 20:49:24,202 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_3854473c-61ba-46fe-b64e-23a519e0219d/bin/utaipan/data/5c334072a/ac23c113939b48fb8da51c48d8871289/FLAG786715257 [2019-12-07 20:49:24,536 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 20:49:24,536 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_3854473c-61ba-46fe-b64e-23a519e0219d/sv-benchmarks/c/verifythis/lcp.c [2019-12-07 20:49:24,541 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_3854473c-61ba-46fe-b64e-23a519e0219d/bin/utaipan/data/5c334072a/ac23c113939b48fb8da51c48d8871289/FLAG786715257 [2019-12-07 20:49:24,967 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_3854473c-61ba-46fe-b64e-23a519e0219d/bin/utaipan/data/5c334072a/ac23c113939b48fb8da51c48d8871289 [2019-12-07 20:49:24,970 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 20:49:24,971 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 20:49:24,972 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 20:49:24,972 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 20:49:24,975 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 20:49:24,976 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 08:49:24" (1/1) ... [2019-12-07 20:49:24,978 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b847784 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:49:24, skipping insertion in model container [2019-12-07 20:49:24,978 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 08:49:24" (1/1) ... [2019-12-07 20:49:24,983 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 20:49:24,995 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 20:49:25,097 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 20:49:25,140 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 20:49:25,158 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 20:49:25,170 INFO L208 MainTranslator]: Completed translation [2019-12-07 20:49:25,170 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:49:25 WrapperNode [2019-12-07 20:49:25,170 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 20:49:25,171 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 20:49:25,171 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 20:49:25,171 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 20:49:25,176 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:49:25" (1/1) ... [2019-12-07 20:49:25,183 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:49:25" (1/1) ... [2019-12-07 20:49:25,199 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 20:49:25,199 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 20:49:25,199 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 20:49:25,199 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 20:49:25,205 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:49:25" (1/1) ... [2019-12-07 20:49:25,206 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:49:25" (1/1) ... [2019-12-07 20:49:25,207 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:49:25" (1/1) ... [2019-12-07 20:49:25,207 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:49:25" (1/1) ... [2019-12-07 20:49:25,212 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:49:25" (1/1) ... [2019-12-07 20:49:25,214 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:49:25" (1/1) ... [2019-12-07 20:49:25,216 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:49:25" (1/1) ... [2019-12-07 20:49:25,217 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 20:49:25,218 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 20:49:25,218 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 20:49:25,218 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 20:49:25,218 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:49:25" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3854473c-61ba-46fe-b64e-23a519e0219d/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-12-07 20:49:25,258 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-12-07 20:49:25,258 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 20:49:25,258 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 20:49:25,258 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-12-07 20:49:25,258 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 20:49:25,547 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 20:49:25,547 INFO L287 CfgBuilder]: Removed 15 assume(true) statements. [2019-12-07 20:49:25,548 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 08:49:25 BoogieIcfgContainer [2019-12-07 20:49:25,548 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 20:49:25,549 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 20:49:25,549 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 20:49:25,551 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 20:49:25,551 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 08:49:24" (1/3) ... [2019-12-07 20:49:25,552 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e5e2051 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 08:49:25, skipping insertion in model container [2019-12-07 20:49:25,552 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:49:25" (2/3) ... [2019-12-07 20:49:25,552 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e5e2051 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 08:49:25, skipping insertion in model container [2019-12-07 20:49:25,552 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 08:49:25" (3/3) ... [2019-12-07 20:49:25,553 INFO L109 eAbstractionObserver]: Analyzing ICFG lcp.c [2019-12-07 20:49:25,559 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 20:49:25,564 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 16 error locations. [2019-12-07 20:49:25,571 INFO L249 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2019-12-07 20:49:25,583 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 20:49:25,583 INFO L374 AbstractCegarLoop]: Hoare is false [2019-12-07 20:49:25,583 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 20:49:25,584 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 20:49:25,584 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 20:49:25,584 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 20:49:25,584 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 20:49:25,584 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 20:49:25,594 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states. [2019-12-07 20:49:25,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-12-07 20:49:25,598 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:49:25,599 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-12-07 20:49:25,599 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE]=== [2019-12-07 20:49:25,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:49:25,603 INFO L82 PathProgramCache]: Analyzing trace with hash 3375418, now seen corresponding path program 1 times [2019-12-07 20:49:25,608 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:49:25,609 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502808230] [2019-12-07 20:49:25,609 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:49:25,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:49:25,719 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:49:25,720 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502808230] [2019-12-07 20:49:25,720 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:49:25,720 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 20:49:25,721 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704312554] [2019-12-07 20:49:25,724 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 20:49:25,724 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:49:25,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 20:49:25,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 20:49:25,735 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 3 states. [2019-12-07 20:49:25,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:49:25,768 INFO L93 Difference]: Finished difference Result 31 states and 33 transitions. [2019-12-07 20:49:25,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 20:49:25,769 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-12-07 20:49:25,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:49:25,775 INFO L225 Difference]: With dead ends: 31 [2019-12-07 20:49:25,775 INFO L226 Difference]: Without dead ends: 30 [2019-12-07 20:49:25,776 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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-12-07 20:49:25,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-12-07 20:49:25,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-12-07 20:49:25,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-12-07 20:49:25,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2019-12-07 20:49:25,799 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 32 transitions. Word has length 4 [2019-12-07 20:49:25,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:49:25,799 INFO L462 AbstractCegarLoop]: Abstraction has 30 states and 32 transitions. [2019-12-07 20:49:25,799 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 20:49:25,799 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2019-12-07 20:49:25,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-12-07 20:49:25,800 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:49:25,800 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-12-07 20:49:25,800 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE]=== [2019-12-07 20:49:25,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:49:25,800 INFO L82 PathProgramCache]: Analyzing trace with hash 3375419, now seen corresponding path program 1 times [2019-12-07 20:49:25,801 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:49:25,801 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252651642] [2019-12-07 20:49:25,801 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:49:25,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:49:25,870 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:49:25,870 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252651642] [2019-12-07 20:49:25,871 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:49:25,871 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 20:49:25,871 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604026482] [2019-12-07 20:49:25,872 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 20:49:25,872 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:49:25,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 20:49:25,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 20:49:25,873 INFO L87 Difference]: Start difference. First operand 30 states and 32 transitions. Second operand 5 states. [2019-12-07 20:49:25,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:49:25,949 INFO L93 Difference]: Finished difference Result 39 states and 42 transitions. [2019-12-07 20:49:25,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 20:49:25,950 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 4 [2019-12-07 20:49:25,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:49:25,950 INFO L225 Difference]: With dead ends: 39 [2019-12-07 20:49:25,950 INFO L226 Difference]: Without dead ends: 37 [2019-12-07 20:49:25,951 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-07 20:49:25,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-12-07 20:49:25,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 35. [2019-12-07 20:49:25,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-12-07 20:49:25,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2019-12-07 20:49:25,955 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 4 [2019-12-07 20:49:25,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:49:25,955 INFO L462 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2019-12-07 20:49:25,955 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 20:49:25,955 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2019-12-07 20:49:25,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-07 20:49:25,955 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:49:25,956 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-07 20:49:25,956 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE]=== [2019-12-07 20:49:25,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:49:25,956 INFO L82 PathProgramCache]: Analyzing trace with hash 104637945, now seen corresponding path program 1 times [2019-12-07 20:49:25,956 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:49:25,956 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844260681] [2019-12-07 20:49:25,956 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:49:25,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:49:26,015 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:49:26,015 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844260681] [2019-12-07 20:49:26,016 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:49:26,016 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 20:49:26,016 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811143076] [2019-12-07 20:49:26,016 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 20:49:26,016 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:49:26,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 20:49:26,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 20:49:26,017 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand 5 states. [2019-12-07 20:49:26,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:49:26,088 INFO L93 Difference]: Finished difference Result 36 states and 39 transitions. [2019-12-07 20:49:26,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 20:49:26,088 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2019-12-07 20:49:26,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:49:26,089 INFO L225 Difference]: With dead ends: 36 [2019-12-07 20:49:26,089 INFO L226 Difference]: Without dead ends: 36 [2019-12-07 20:49:26,090 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-07 20:49:26,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-12-07 20:49:26,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2019-12-07 20:49:26,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-12-07 20:49:26,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 38 transitions. [2019-12-07 20:49:26,094 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 38 transitions. Word has length 5 [2019-12-07 20:49:26,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:49:26,094 INFO L462 AbstractCegarLoop]: Abstraction has 35 states and 38 transitions. [2019-12-07 20:49:26,094 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 20:49:26,095 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2019-12-07 20:49:26,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-07 20:49:26,095 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:49:26,095 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2019-12-07 20:49:26,095 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE]=== [2019-12-07 20:49:26,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:49:26,096 INFO L82 PathProgramCache]: Analyzing trace with hash 1781537838, now seen corresponding path program 1 times [2019-12-07 20:49:26,096 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:49:26,096 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782768475] [2019-12-07 20:49:26,096 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:49:26,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:49:26,120 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:49:26,120 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782768475] [2019-12-07 20:49:26,120 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:49:26,120 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 20:49:26,121 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24888339] [2019-12-07 20:49:26,121 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 20:49:26,121 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:49:26,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 20:49:26,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 20:49:26,121 INFO L87 Difference]: Start difference. First operand 35 states and 38 transitions. Second operand 3 states. [2019-12-07 20:49:26,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:49:26,130 INFO L93 Difference]: Finished difference Result 37 states and 39 transitions. [2019-12-07 20:49:26,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 20:49:26,131 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-12-07 20:49:26,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:49:26,131 INFO L225 Difference]: With dead ends: 37 [2019-12-07 20:49:26,131 INFO L226 Difference]: Without dead ends: 36 [2019-12-07 20:49:26,132 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 20:49:26,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-12-07 20:49:26,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-12-07 20:49:26,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-12-07 20:49:26,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2019-12-07 20:49:26,135 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 7 [2019-12-07 20:49:26,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:49:26,135 INFO L462 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2019-12-07 20:49:26,135 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 20:49:26,135 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2019-12-07 20:49:26,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-07 20:49:26,135 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:49:26,135 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1] [2019-12-07 20:49:26,136 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE]=== [2019-12-07 20:49:26,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:49:26,136 INFO L82 PathProgramCache]: Analyzing trace with hash -1362789876, now seen corresponding path program 1 times [2019-12-07 20:49:26,136 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:49:26,136 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879974102] [2019-12-07 20:49:26,136 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:49:26,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:49:26,200 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:49:26,200 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879974102] [2019-12-07 20:49:26,201 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1002727250] [2019-12-07 20:49:26,201 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3854473c-61ba-46fe-b64e-23a519e0219d/bin/utaipan/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 [2019-12-07 20:49:26,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:49:26,234 INFO L264 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 25 conjunts are in the unsatisfiable core [2019-12-07 20:49:26,238 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 20:49:26,282 INFO L377 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 8 treesize of output 7 [2019-12-07 20:49:26,282 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 20:49:26,292 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:49:26,296 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 20:49:26,296 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:27 [2019-12-07 20:49:30,362 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:49:30,363 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:49:30,418 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:49:30,418 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 20:49:30,448 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:49:30,466 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:49:30,496 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:49:30,497 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [323905582] [2019-12-07 20:49:30,516 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2019-12-07 20:49:30,516 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 20:49:30,520 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 20:49:30,525 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 20:49:30,526 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 20:49:30,884 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 20:49:31,108 WARN L192 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 72 [2019-12-07 20:49:31,630 WARN L192 SmtUtils]: Spent 456.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 116 [2019-12-07 20:49:31,791 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 64 [2019-12-07 20:49:31,958 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 65 [2019-12-07 20:49:32,149 WARN L192 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 84 [2019-12-07 20:49:32,304 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 63 [2019-12-07 20:49:32,306 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 20:49:32,306 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 20:49:32,306 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 13 [2019-12-07 20:49:32,306 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973637759] [2019-12-07 20:49:32,307 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-07 20:49:32,307 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:49:32,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-07 20:49:32,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=339, Unknown=0, NotChecked=0, Total=420 [2019-12-07 20:49:32,308 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. Second operand 15 states. [2019-12-07 20:49:38,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:49:38,552 INFO L93 Difference]: Finished difference Result 57 states and 59 transitions. [2019-12-07 20:49:38,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 20:49:38,553 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 9 [2019-12-07 20:49:38,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:49:38,553 INFO L225 Difference]: With dead ends: 57 [2019-12-07 20:49:38,553 INFO L226 Difference]: Without dead ends: 57 [2019-12-07 20:49:38,554 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=130, Invalid=470, Unknown=0, NotChecked=0, Total=600 [2019-12-07 20:49:38,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-12-07 20:49:38,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 35. [2019-12-07 20:49:38,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-12-07 20:49:38,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 37 transitions. [2019-12-07 20:49:38,557 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 37 transitions. Word has length 9 [2019-12-07 20:49:38,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:49:38,557 INFO L462 AbstractCegarLoop]: Abstraction has 35 states and 37 transitions. [2019-12-07 20:49:38,557 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-07 20:49:38,557 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2019-12-07 20:49:38,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-12-07 20:49:38,558 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:49:38,558 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1] [2019-12-07 20:49:38,758 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 20:49:38,759 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE]=== [2019-12-07 20:49:38,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:49:38,760 INFO L82 PathProgramCache]: Analyzing trace with hash 703186760, now seen corresponding path program 1 times [2019-12-07 20:49:38,760 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:49:38,761 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499637080] [2019-12-07 20:49:38,761 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:49:38,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:49:38,814 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:49:38,815 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499637080] [2019-12-07 20:49:38,815 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [197402266] [2019-12-07 20:49:38,815 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3854473c-61ba-46fe-b64e-23a519e0219d/bin/utaipan/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 [2019-12-07 20:49:38,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:49:38,843 INFO L264 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 25 conjunts are in the unsatisfiable core [2019-12-07 20:49:38,845 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 20:49:42,974 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:49:42,974 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 20:49:43,031 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:49:43,031 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [585611828] [2019-12-07 20:49:43,032 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2019-12-07 20:49:43,032 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 20:49:43,033 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 20:49:43,033 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 20:49:43,033 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 20:49:43,294 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 20:49:43,676 WARN L192 SmtUtils]: Spent 322.00 ms on a formula simplification. DAG size of input: 163 DAG size of output: 90 [2019-12-07 20:49:44,156 WARN L192 SmtUtils]: Spent 425.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 116 [2019-12-07 20:49:44,306 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 64 [2019-12-07 20:49:44,468 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 65 [2019-12-07 20:49:44,663 WARN L192 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 84 [2019-12-07 20:49:44,823 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 63 [2019-12-07 20:49:44,824 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 20:49:44,824 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 20:49:44,824 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 13 [2019-12-07 20:49:44,824 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936110764] [2019-12-07 20:49:44,825 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-07 20:49:44,825 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:49:44,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-07 20:49:44,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=341, Unknown=0, NotChecked=0, Total=420 [2019-12-07 20:49:44,825 INFO L87 Difference]: Start difference. First operand 35 states and 37 transitions. Second operand 15 states. [2019-12-07 20:49:47,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:49:47,019 INFO L93 Difference]: Finished difference Result 56 states and 58 transitions. [2019-12-07 20:49:47,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 20:49:47,020 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 10 [2019-12-07 20:49:47,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:49:47,020 INFO L225 Difference]: With dead ends: 56 [2019-12-07 20:49:47,021 INFO L226 Difference]: Without dead ends: 56 [2019-12-07 20:49:47,021 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=128, Invalid=472, Unknown=0, NotChecked=0, Total=600 [2019-12-07 20:49:47,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-12-07 20:49:47,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 34. [2019-12-07 20:49:47,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-12-07 20:49:47,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 36 transitions. [2019-12-07 20:49:47,024 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 36 transitions. Word has length 10 [2019-12-07 20:49:47,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:49:47,024 INFO L462 AbstractCegarLoop]: Abstraction has 34 states and 36 transitions. [2019-12-07 20:49:47,024 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-07 20:49:47,024 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 36 transitions. [2019-12-07 20:49:47,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-07 20:49:47,025 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:49:47,025 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:49:47,225 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 20:49:47,226 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE]=== [2019-12-07 20:49:47,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:49:47,227 INFO L82 PathProgramCache]: Analyzing trace with hash 324234688, now seen corresponding path program 1 times [2019-12-07 20:49:47,227 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:49:47,228 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956616085] [2019-12-07 20:49:47,228 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:49:47,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:49:47,273 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 20:49:47,273 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956616085] [2019-12-07 20:49:47,273 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [205706414] [2019-12-07 20:49:47,274 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3854473c-61ba-46fe-b64e-23a519e0219d/bin/utaipan/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 [2019-12-07 20:49:47,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:49:47,303 INFO L264 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-07 20:49:47,304 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 20:49:47,310 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-07 20:49:47,310 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 20:49:47,312 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-07 20:49:47,312 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-12-07 20:49:47,312 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [4] total 4 [2019-12-07 20:49:47,312 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820161478] [2019-12-07 20:49:47,313 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 20:49:47,313 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:49:47,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 20:49:47,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 20:49:47,313 INFO L87 Difference]: Start difference. First operand 34 states and 36 transitions. Second operand 4 states. [2019-12-07 20:49:47,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:49:47,339 INFO L93 Difference]: Finished difference Result 29 states and 31 transitions. [2019-12-07 20:49:47,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 20:49:47,340 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-07 20:49:47,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:49:47,340 INFO L225 Difference]: With dead ends: 29 [2019-12-07 20:49:47,340 INFO L226 Difference]: Without dead ends: 29 [2019-12-07 20:49:47,340 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-07 20:49:47,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-12-07 20:49:47,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-12-07 20:49:47,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-12-07 20:49:47,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2019-12-07 20:49:47,343 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 11 [2019-12-07 20:49:47,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:49:47,343 INFO L462 AbstractCegarLoop]: Abstraction has 29 states and 31 transitions. [2019-12-07 20:49:47,343 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 20:49:47,343 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2019-12-07 20:49:47,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-07 20:49:47,343 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:49:47,343 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:49:47,544 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 20:49:47,545 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE]=== [2019-12-07 20:49:47,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:49:47,546 INFO L82 PathProgramCache]: Analyzing trace with hash 324234689, now seen corresponding path program 1 times [2019-12-07 20:49:47,546 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:49:47,547 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530142347] [2019-12-07 20:49:47,547 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:49:47,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:49:47,666 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:49:47,666 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530142347] [2019-12-07 20:49:47,666 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1036605713] [2019-12-07 20:49:47,667 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3854473c-61ba-46fe-b64e-23a519e0219d/bin/utaipan/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 [2019-12-07 20:49:47,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:49:47,704 INFO L264 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 33 conjunts are in the unsatisfiable core [2019-12-07 20:49:47,705 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 20:49:47,808 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:49:47,808 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 20:49:47,912 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:49:47,912 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [725039612] [2019-12-07 20:49:47,913 INFO L159 IcfgInterpreter]: Started Sifa with 9 locations of interest [2019-12-07 20:49:47,913 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 20:49:47,913 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 20:49:47,913 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 20:49:47,913 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 20:49:48,199 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 20:49:48,480 WARN L192 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 106 [2019-12-07 20:49:49,078 WARN L192 SmtUtils]: Spent 531.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 108 [2019-12-07 20:49:49,238 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 64 [2019-12-07 20:49:49,446 WARN L192 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 65 [2019-12-07 20:49:49,806 WARN L192 SmtUtils]: Spent 278.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 84 [2019-12-07 20:49:50,449 WARN L192 SmtUtils]: Spent 298.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 100 [2019-12-07 20:49:50,450 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 20:49:50,450 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 20:49:50,450 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 15 [2019-12-07 20:49:50,450 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693087267] [2019-12-07 20:49:50,450 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-07 20:49:50,450 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:49:50,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-07 20:49:50,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=432, Unknown=0, NotChecked=0, Total=506 [2019-12-07 20:49:50,451 INFO L87 Difference]: Start difference. First operand 29 states and 31 transitions. Second operand 17 states. [2019-12-07 20:49:50,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:49:50,834 INFO L93 Difference]: Finished difference Result 42 states and 44 transitions. [2019-12-07 20:49:50,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 20:49:50,835 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 11 [2019-12-07 20:49:50,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:49:50,835 INFO L225 Difference]: With dead ends: 42 [2019-12-07 20:49:50,835 INFO L226 Difference]: Without dead ends: 42 [2019-12-07 20:49:50,836 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 13 SyntacticMatches, 3 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 201 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=170, Invalid=700, Unknown=0, NotChecked=0, Total=870 [2019-12-07 20:49:50,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-12-07 20:49:50,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 27. [2019-12-07 20:49:50,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-12-07 20:49:50,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2019-12-07 20:49:50,838 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 11 [2019-12-07 20:49:50,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:49:50,838 INFO L462 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2019-12-07 20:49:50,838 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-07 20:49:50,838 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2019-12-07 20:49:50,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-12-07 20:49:50,838 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:49:50,838 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:49:51,039 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 20:49:51,040 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE]=== [2019-12-07 20:49:51,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:49:51,041 INFO L82 PathProgramCache]: Analyzing trace with hash 1461340744, now seen corresponding path program 1 times [2019-12-07 20:49:51,041 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:49:51,042 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675444110] [2019-12-07 20:49:51,042 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:49:51,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:49:51,129 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:49:51,129 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675444110] [2019-12-07 20:49:51,129 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1929556972] [2019-12-07 20:49:51,129 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3854473c-61ba-46fe-b64e-23a519e0219d/bin/utaipan/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 [2019-12-07 20:49:51,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:49:51,162 INFO L264 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 33 conjunts are in the unsatisfiable core [2019-12-07 20:49:51,163 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 20:49:51,272 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:49:51,272 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 20:49:51,375 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:49:51,375 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1055102034] [2019-12-07 20:49:51,376 INFO L159 IcfgInterpreter]: Started Sifa with 10 locations of interest [2019-12-07 20:49:51,376 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 20:49:51,376 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 20:49:51,376 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 20:49:51,376 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 20:49:51,669 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 20:49:51,985 WARN L192 SmtUtils]: Spent 271.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 118 [2019-12-07 20:49:52,565 WARN L192 SmtUtils]: Spent 517.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 108 [2019-12-07 20:49:52,749 WARN L192 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 64 [2019-12-07 20:49:52,904 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 65 [2019-12-07 20:49:53,198 WARN L192 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 84 [2019-12-07 20:49:53,783 WARN L192 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 100 [2019-12-07 20:49:54,200 WARN L192 SmtUtils]: Spent 342.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 117 [2019-12-07 20:49:54,201 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 20:49:54,201 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 20:49:54,202 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 15 [2019-12-07 20:49:54,202 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817652843] [2019-12-07 20:49:54,202 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-07 20:49:54,202 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:49:54,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-07 20:49:54,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=472, Unknown=0, NotChecked=0, Total=552 [2019-12-07 20:49:54,203 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. Second operand 17 states. [2019-12-07 20:49:54,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:49:54,660 INFO L93 Difference]: Finished difference Result 40 states and 42 transitions. [2019-12-07 20:49:54,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 20:49:54,660 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 12 [2019-12-07 20:49:54,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:49:54,661 INFO L225 Difference]: With dead ends: 40 [2019-12-07 20:49:54,661 INFO L226 Difference]: Without dead ends: 40 [2019-12-07 20:49:54,661 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 15 SyntacticMatches, 3 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 222 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=176, Invalid=754, Unknown=0, NotChecked=0, Total=930 [2019-12-07 20:49:54,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-12-07 20:49:54,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 26. [2019-12-07 20:49:54,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-12-07 20:49:54,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2019-12-07 20:49:54,663 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 12 [2019-12-07 20:49:54,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:49:54,663 INFO L462 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2019-12-07 20:49:54,663 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-07 20:49:54,663 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2019-12-07 20:49:54,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 20:49:54,664 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:49:54,664 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:49:54,864 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 20:49:54,865 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE]=== [2019-12-07 20:49:54,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:49:54,866 INFO L82 PathProgramCache]: Analyzing trace with hash -105800194, now seen corresponding path program 1 times [2019-12-07 20:49:54,866 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:49:54,866 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611722976] [2019-12-07 20:49:54,867 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:49:54,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:49:54,940 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 20:49:54,940 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611722976] [2019-12-07 20:49:54,940 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1026055891] [2019-12-07 20:49:54,940 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3854473c-61ba-46fe-b64e-23a519e0219d/bin/utaipan/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 [2019-12-07 20:49:54,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:49:54,971 INFO L264 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 23 conjunts are in the unsatisfiable core [2019-12-07 20:49:54,972 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 20:49:55,018 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-07 20:49:55,018 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 20:49:55,092 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-07 20:49:55,093 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-12-07 20:49:55,093 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [5] total 11 [2019-12-07 20:49:55,093 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130358209] [2019-12-07 20:49:55,093 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 20:49:55,093 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:49:55,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 20:49:55,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-12-07 20:49:55,093 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. Second operand 8 states. [2019-12-07 20:49:55,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:49:55,162 INFO L93 Difference]: Finished difference Result 31 states and 32 transitions. [2019-12-07 20:49:55,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 20:49:55,162 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2019-12-07 20:49:55,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:49:55,163 INFO L225 Difference]: With dead ends: 31 [2019-12-07 20:49:55,163 INFO L226 Difference]: Without dead ends: 31 [2019-12-07 20:49:55,163 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2019-12-07 20:49:55,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-12-07 20:49:55,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 25. [2019-12-07 20:49:55,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-12-07 20:49:55,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2019-12-07 20:49:55,165 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 14 [2019-12-07 20:49:55,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:49:55,165 INFO L462 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2019-12-07 20:49:55,165 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 20:49:55,165 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2019-12-07 20:49:55,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-07 20:49:55,165 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:49:55,165 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:49:55,366 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 20:49:55,367 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE]=== [2019-12-07 20:49:55,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:49:55,368 INFO L82 PathProgramCache]: Analyzing trace with hash 1015161276, now seen corresponding path program 1 times [2019-12-07 20:49:55,368 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:49:55,369 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033828109] [2019-12-07 20:49:55,369 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:49:55,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:49:55,439 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 20:49:55,440 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033828109] [2019-12-07 20:49:55,440 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1342448174] [2019-12-07 20:49:55,440 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3854473c-61ba-46fe-b64e-23a519e0219d/bin/utaipan/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 [2019-12-07 20:49:55,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:49:55,470 INFO L264 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 23 conjunts are in the unsatisfiable core [2019-12-07 20:49:55,471 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 20:49:55,515 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-07 20:49:55,515 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 20:49:55,582 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-07 20:49:55,582 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-12-07 20:49:55,583 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [5] total 11 [2019-12-07 20:49:55,583 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303624814] [2019-12-07 20:49:55,583 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 20:49:55,583 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:49:55,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 20:49:55,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-12-07 20:49:55,584 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand 8 states. [2019-12-07 20:49:55,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:49:55,647 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2019-12-07 20:49:55,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 20:49:55,647 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2019-12-07 20:49:55,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:49:55,647 INFO L225 Difference]: With dead ends: 30 [2019-12-07 20:49:55,647 INFO L226 Difference]: Without dead ends: 30 [2019-12-07 20:49:55,648 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2019-12-07 20:49:55,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-12-07 20:49:55,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 24. [2019-12-07 20:49:55,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-12-07 20:49:55,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2019-12-07 20:49:55,649 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 15 [2019-12-07 20:49:55,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:49:55,649 INFO L462 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2019-12-07 20:49:55,649 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 20:49:55,649 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2019-12-07 20:49:55,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-07 20:49:55,650 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:49:55,650 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:49:55,850 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 20:49:55,851 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE]=== [2019-12-07 20:49:55,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:49:55,852 INFO L82 PathProgramCache]: Analyzing trace with hash 1015177224, now seen corresponding path program 1 times [2019-12-07 20:49:55,852 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:49:55,853 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185241099] [2019-12-07 20:49:55,853 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:49:55,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:49:55,898 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-07 20:49:55,899 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1185241099] [2019-12-07 20:49:55,899 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:49:55,899 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 20:49:55,899 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813812070] [2019-12-07 20:49:55,899 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 20:49:55,900 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:49:55,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 20:49:55,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 20:49:55,900 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand 3 states. [2019-12-07 20:49:55,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:49:55,905 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2019-12-07 20:49:55,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 20:49:55,905 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-12-07 20:49:55,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:49:55,906 INFO L225 Difference]: With dead ends: 23 [2019-12-07 20:49:55,906 INFO L226 Difference]: Without dead ends: 23 [2019-12-07 20:49:55,906 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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-12-07 20:49:55,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-12-07 20:49:55,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-12-07 20:49:55,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-12-07 20:49:55,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2019-12-07 20:49:55,908 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 15 [2019-12-07 20:49:55,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:49:55,908 INFO L462 AbstractCegarLoop]: Abstraction has 23 states and 25 transitions. [2019-12-07 20:49:55,908 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 20:49:55,908 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2019-12-07 20:49:55,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-07 20:49:55,909 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:49:55,909 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:49:55,909 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE]=== [2019-12-07 20:49:55,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:49:55,909 INFO L82 PathProgramCache]: Analyzing trace with hash 627739371, now seen corresponding path program 1 times [2019-12-07 20:49:55,909 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:49:55,909 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678627000] [2019-12-07 20:49:55,913 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:49:55,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:49:55,959 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-07 20:49:55,959 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678627000] [2019-12-07 20:49:55,959 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:49:55,959 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 20:49:55,960 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043108488] [2019-12-07 20:49:55,960 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 20:49:55,960 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:49:55,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 20:49:55,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 20:49:55,960 INFO L87 Difference]: Start difference. First operand 23 states and 25 transitions. Second operand 4 states. [2019-12-07 20:49:55,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:49:55,987 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2019-12-07 20:49:55,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 20:49:55,988 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-12-07 20:49:55,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:49:55,988 INFO L225 Difference]: With dead ends: 22 [2019-12-07 20:49:55,988 INFO L226 Difference]: Without dead ends: 0 [2019-12-07 20:49:55,988 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 20:49:55,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-12-07 20:49:55,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-12-07 20:49:55,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-12-07 20:49:55,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-12-07 20:49:55,989 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 17 [2019-12-07 20:49:55,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:49:55,989 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-12-07 20:49:55,989 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 20:49:55,989 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-12-07 20:49:55,989 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-12-07 20:49:55,992 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 08:49:55 BoogieIcfgContainer [2019-12-07 20:49:55,992 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 20:49:55,993 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 20:49:55,993 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 20:49:55,993 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 20:49:55,993 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 08:49:25" (3/4) ... [2019-12-07 20:49:55,995 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-12-07 20:49:56,003 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 19 nodes and edges [2019-12-07 20:49:56,004 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2019-12-07 20:49:56,004 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-12-07 20:49:56,034 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_3854473c-61ba-46fe-b64e-23a519e0219d/bin/utaipan/witness.graphml [2019-12-07 20:49:56,034 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 20:49:56,035 INFO L168 Benchmark]: Toolchain (without parser) took 31065.01 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 277.3 MB). Free memory was 939.3 MB in the beginning and 1.3 GB in the end (delta: -311.3 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 20:49:56,036 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 960.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 20:49:56,036 INFO L168 Benchmark]: CACSL2BoogieTranslator took 198.87 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 95.4 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -150.9 MB). Peak memory consumption was 23.0 MB. Max. memory is 11.5 GB. [2019-12-07 20:49:56,036 INFO L168 Benchmark]: Boogie Procedure Inliner took 27.90 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-12-07 20:49:56,036 INFO L168 Benchmark]: Boogie Preprocessor took 18.55 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: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-12-07 20:49:56,036 INFO L168 Benchmark]: RCFGBuilder took 330.77 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: 32.6 MB). Peak memory consumption was 32.6 MB. Max. memory is 11.5 GB. [2019-12-07 20:49:56,037 INFO L168 Benchmark]: TraceAbstraction took 30443.42 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 181.9 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -212.2 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 20:49:56,037 INFO L168 Benchmark]: Witness Printer took 41.87 ms. Allocated memory is still 1.3 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 12.5 MB). Peak memory consumption was 12.5 MB. Max. memory is 11.5 GB. [2019-12-07 20:49:56,038 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.19 ms. Allocated memory is still 1.0 GB. Free memory is still 960.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 198.87 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 95.4 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -150.9 MB). Peak memory consumption was 23.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 27.90 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. * Boogie Preprocessor took 18.55 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: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 330.77 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: 32.6 MB). Peak memory consumption was 32.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 30443.42 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 181.9 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -212.2 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 41.87 ms. Allocated memory is still 1.3 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 12.5 MB). Peak memory consumption was 12.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 13]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 27]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 13]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 27]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 23]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 30]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 13]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 13]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 23]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 23]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 23]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 42]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 27]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 42]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 27]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 42]: free always succeeds For all program executions holds that free always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 16 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 33 locations, 16 error locations. Result: SAFE, OverallTime: 30.4s, OverallIterations: 13, TraceHistogramMax: 2, AutomataDifference: 9.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 226 SDtfs, 858 SDslu, 261 SDs, 0 SdLazy, 665 SolverSat, 39 SolverUnsat, 4 SolverUnknown, 0 SolverNotchecked, 8.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 273 GetRequests, 119 SyntacticMatches, 6 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 757 ImplicationChecksByTransitivity, 17.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=36occurred in iteration=4, 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, 13 MinimizatonAttempts, 88 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 9.6s InterpolantComputationTime, 216 NumberOfCodeBlocks, 216 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 271 ConstructedInterpolants, 18 QuantifiedInterpolants, 62714 SizeOfPredicates, 106 NumberOfNonLiveVariables, 796 ConjunctsInSsa, 170 ConjunctsInUnsatCore, 27 InterpolantComputations, 12 PerfectInterpolantSequences, 33/74 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...