./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../../sv-benchmarks/c/forester-heap/dll-simple-white-blue-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) 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_8d0492a9-35d4-47f9-8fba-3eae8b14bba4/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_8d0492a9-35d4-47f9-8fba-3eae8b14bba4/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_8d0492a9-35d4-47f9-8fba-3eae8b14bba4/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_8d0492a9-35d4-47f9-8fba-3eae8b14bba4/bin/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/forester-heap/dll-simple-white-blue-1.i -s /tmp/vcloud-vcloud-master/worker/run_dir_8d0492a9-35d4-47f9-8fba-3eae8b14bba4/bin/utaipan/config/svcomp-MemCleanup-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_8d0492a9-35d4-47f9-8fba-3eae8b14bba4/bin/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-memcleanup) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f369e67185304fce6130a1dfc66e8cb89abf0605 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-memcleanup) --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 19:55:41,900 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 19:55:41,901 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 19:55:41,910 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 19:55:41,911 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 19:55:41,911 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 19:55:41,912 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 19:55:41,913 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 19:55:41,915 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 19:55:41,916 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 19:55:41,916 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 19:55:41,917 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 19:55:41,917 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 19:55:41,918 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 19:55:41,919 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 19:55:41,920 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 19:55:41,920 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 19:55:41,921 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 19:55:41,922 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 19:55:41,924 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 19:55:41,925 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 19:55:41,926 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 19:55:41,926 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 19:55:41,927 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 19:55:41,928 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 19:55:41,929 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 19:55:41,929 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 19:55:41,929 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 19:55:41,929 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 19:55:41,930 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 19:55:41,930 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 19:55:41,931 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 19:55:41,931 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 19:55:41,932 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 19:55:41,933 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 19:55:41,933 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 19:55:41,933 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 19:55:41,934 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 19:55:41,934 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 19:55:41,935 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 19:55:41,935 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 19:55:41,936 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_8d0492a9-35d4-47f9-8fba-3eae8b14bba4/bin/utaipan/config/svcomp-MemCleanup-32bit-Taipan_Default.epf [2019-12-07 19:55:41,949 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 19:55:41,949 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 19:55:41,950 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 19:55:41,950 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 19:55:41,950 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 19:55:41,951 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 19:55:41,951 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-12-07 19:55:41,951 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 19:55:41,951 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 19:55:41,951 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-12-07 19:55:41,952 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-12-07 19:55:41,952 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 19:55:41,952 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-12-07 19:55:41,952 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-12-07 19:55:41,952 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-12-07 19:55:41,953 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 19:55:41,953 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 19:55:41,953 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 19:55:41,953 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 19:55:41,954 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-12-07 19:55:41,954 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 19:55:41,954 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 19:55:41,954 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 19:55:41,954 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-12-07 19:55:41,954 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-12-07 19:55:41,955 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 19:55:41,955 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 19:55:41,955 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 19:55:41,955 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 19:55:41,955 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 19:55:41,955 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 19:55:41,955 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 19:55:41,956 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 19:55:41,956 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 19:55:41,956 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 19:55:41,956 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-12-07 19:55:41,956 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 19:55:41,956 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 19:55:41,957 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 19:55:41,957 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_8d0492a9-35d4-47f9-8fba-3eae8b14bba4/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-memcleanup) ) 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 -> f369e67185304fce6130a1dfc66e8cb89abf0605 [2019-12-07 19:55:42,055 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 19:55:42,063 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 19:55:42,065 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 19:55:42,066 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 19:55:42,067 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 19:55:42,067 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_8d0492a9-35d4-47f9-8fba-3eae8b14bba4/bin/utaipan/../../sv-benchmarks/c/forester-heap/dll-simple-white-blue-1.i [2019-12-07 19:55:42,105 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_8d0492a9-35d4-47f9-8fba-3eae8b14bba4/bin/utaipan/data/d116283ba/8c79430a18604e1c9910566fff7b213a/FLAG1192a4561 [2019-12-07 19:55:42,467 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 19:55:42,468 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_8d0492a9-35d4-47f9-8fba-3eae8b14bba4/sv-benchmarks/c/forester-heap/dll-simple-white-blue-1.i [2019-12-07 19:55:42,479 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_8d0492a9-35d4-47f9-8fba-3eae8b14bba4/bin/utaipan/data/d116283ba/8c79430a18604e1c9910566fff7b213a/FLAG1192a4561 [2019-12-07 19:55:42,490 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_8d0492a9-35d4-47f9-8fba-3eae8b14bba4/bin/utaipan/data/d116283ba/8c79430a18604e1c9910566fff7b213a [2019-12-07 19:55:42,493 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 19:55:42,494 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 19:55:42,495 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 19:55:42,495 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 19:55:42,498 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 19:55:42,498 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 07:55:42" (1/1) ... [2019-12-07 19:55:42,500 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f8fae9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:55:42, skipping insertion in model container [2019-12-07 19:55:42,501 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 07:55:42" (1/1) ... [2019-12-07 19:55:42,506 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 19:55:42,531 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 19:55:42,731 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 19:55:42,737 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 19:55:42,769 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 19:55:42,798 INFO L208 MainTranslator]: Completed translation [2019-12-07 19:55:42,799 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:55:42 WrapperNode [2019-12-07 19:55:42,799 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 19:55:42,799 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 19:55:42,799 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 19:55:42,800 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 19:55:42,805 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:55:42" (1/1) ... [2019-12-07 19:55:42,815 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:55:42" (1/1) ... [2019-12-07 19:55:42,831 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 19:55:42,831 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 19:55:42,831 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 19:55:42,832 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 19:55:42,838 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:55:42" (1/1) ... [2019-12-07 19:55:42,838 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:55:42" (1/1) ... [2019-12-07 19:55:42,840 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:55:42" (1/1) ... [2019-12-07 19:55:42,841 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:55:42" (1/1) ... [2019-12-07 19:55:42,847 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:55:42" (1/1) ... [2019-12-07 19:55:42,850 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:55:42" (1/1) ... [2019-12-07 19:55:42,851 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:55:42" (1/1) ... [2019-12-07 19:55:42,853 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 19:55:42,853 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 19:55:42,854 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 19:55:42,854 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 19:55:42,854 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:55:42" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8d0492a9-35d4-47f9-8fba-3eae8b14bba4/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 19:55:42,893 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-12-07 19:55:42,893 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 19:55:42,893 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-12-07 19:55:42,893 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-12-07 19:55:42,893 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-12-07 19:55:42,893 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 19:55:42,893 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 19:55:42,893 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 19:55:43,264 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 19:55:43,264 INFO L287 CfgBuilder]: Removed 12 assume(true) statements. [2019-12-07 19:55:43,265 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 07:55:43 BoogieIcfgContainer [2019-12-07 19:55:43,265 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 19:55:43,266 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 19:55:43,266 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 19:55:43,268 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 19:55:43,268 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 07:55:42" (1/3) ... [2019-12-07 19:55:43,268 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79ff590b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 07:55:43, skipping insertion in model container [2019-12-07 19:55:43,268 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:55:42" (2/3) ... [2019-12-07 19:55:43,269 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79ff590b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 07:55:43, skipping insertion in model container [2019-12-07 19:55:43,269 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 07:55:43" (3/3) ... [2019-12-07 19:55:43,270 INFO L109 eAbstractionObserver]: Analyzing ICFG dll-simple-white-blue-1.i [2019-12-07 19:55:43,276 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 19:55:43,281 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 61 error locations. [2019-12-07 19:55:43,288 INFO L249 AbstractCegarLoop]: Starting to check reachability of 61 error locations. [2019-12-07 19:55:43,301 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 19:55:43,301 INFO L374 AbstractCegarLoop]: Hoare is false [2019-12-07 19:55:43,301 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 19:55:43,301 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 19:55:43,301 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 19:55:43,301 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 19:55:43,301 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 19:55:43,301 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 19:55:43,313 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states. [2019-12-07 19:55:43,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2019-12-07 19:55:43,318 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:55:43,318 INFO L410 BasicCegarLoop]: trace histogram [1, 1] [2019-12-07 19:55:43,319 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr59ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr60ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2019-12-07 19:55:43,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:55:43,322 INFO L82 PathProgramCache]: Analyzing trace with hash 7723, now seen corresponding path program 1 times [2019-12-07 19:55:43,328 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:55:43,328 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677332322] [2019-12-07 19:55:43,329 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:55:43,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:55:43,419 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 19:55:43,420 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677332322] [2019-12-07 19:55:43,420 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:55:43,420 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 19:55:43,421 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174173045] [2019-12-07 19:55:43,424 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 19:55:43,424 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:55:43,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 19:55:43,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:55:43,435 INFO L87 Difference]: Start difference. First operand 109 states. Second operand 3 states. [2019-12-07 19:55:43,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:55:43,537 INFO L93 Difference]: Finished difference Result 109 states and 116 transitions. [2019-12-07 19:55:43,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 19:55:43,538 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-12-07 19:55:43,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:55:43,545 INFO L225 Difference]: With dead ends: 109 [2019-12-07 19:55:43,545 INFO L226 Difference]: Without dead ends: 107 [2019-12-07 19:55:43,546 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 19:55:43,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-12-07 19:55:43,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 104. [2019-12-07 19:55:43,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-12-07 19:55:43,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 111 transitions. [2019-12-07 19:55:43,572 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 111 transitions. Word has length 2 [2019-12-07 19:55:43,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:55:43,572 INFO L462 AbstractCegarLoop]: Abstraction has 104 states and 111 transitions. [2019-12-07 19:55:43,572 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 19:55:43,572 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 111 transitions. [2019-12-07 19:55:43,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2019-12-07 19:55:43,573 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:55:43,573 INFO L410 BasicCegarLoop]: trace histogram [1, 1] [2019-12-07 19:55:43,573 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr59ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr60ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2019-12-07 19:55:43,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:55:43,573 INFO L82 PathProgramCache]: Analyzing trace with hash 7724, now seen corresponding path program 1 times [2019-12-07 19:55:43,574 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:55:43,574 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956910895] [2019-12-07 19:55:43,574 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:55:43,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:55:43,596 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 19:55:43,596 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956910895] [2019-12-07 19:55:43,596 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:55:43,596 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 19:55:43,596 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245663551] [2019-12-07 19:55:43,597 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 19:55:43,597 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:55:43,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 19:55:43,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:55:43,598 INFO L87 Difference]: Start difference. First operand 104 states and 111 transitions. Second operand 3 states. [2019-12-07 19:55:43,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:55:43,689 INFO L93 Difference]: Finished difference Result 125 states and 134 transitions. [2019-12-07 19:55:43,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 19:55:43,689 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-12-07 19:55:43,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:55:43,690 INFO L225 Difference]: With dead ends: 125 [2019-12-07 19:55:43,691 INFO L226 Difference]: Without dead ends: 125 [2019-12-07 19:55:43,691 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 19:55:43,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2019-12-07 19:55:43,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 101. [2019-12-07 19:55:43,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-12-07 19:55:43,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 108 transitions. [2019-12-07 19:55:43,698 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 108 transitions. Word has length 2 [2019-12-07 19:55:43,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:55:43,698 INFO L462 AbstractCegarLoop]: Abstraction has 101 states and 108 transitions. [2019-12-07 19:55:43,698 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 19:55:43,698 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 108 transitions. [2019-12-07 19:55:43,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-07 19:55:43,698 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:55:43,698 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:55:43,699 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr59ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr60ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2019-12-07 19:55:43,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:55:43,699 INFO L82 PathProgramCache]: Analyzing trace with hash 2042994742, now seen corresponding path program 1 times [2019-12-07 19:55:43,699 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:55:43,699 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522713884] [2019-12-07 19:55:43,699 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:55:43,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:55:43,746 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 19:55:43,746 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522713884] [2019-12-07 19:55:43,747 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:55:43,747 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 19:55:43,747 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528479110] [2019-12-07 19:55:43,747 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 19:55:43,747 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:55:43,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 19:55:43,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 19:55:43,748 INFO L87 Difference]: Start difference. First operand 101 states and 108 transitions. Second operand 4 states. [2019-12-07 19:55:43,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:55:43,879 INFO L93 Difference]: Finished difference Result 99 states and 106 transitions. [2019-12-07 19:55:43,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 19:55:43,880 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2019-12-07 19:55:43,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:55:43,881 INFO L225 Difference]: With dead ends: 99 [2019-12-07 19:55:43,881 INFO L226 Difference]: Without dead ends: 99 [2019-12-07 19:55:43,881 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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 19:55:43,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-12-07 19:55:43,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 92. [2019-12-07 19:55:43,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-12-07 19:55:43,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 105 transitions. [2019-12-07 19:55:43,887 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 105 transitions. Word has length 7 [2019-12-07 19:55:43,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:55:43,887 INFO L462 AbstractCegarLoop]: Abstraction has 92 states and 105 transitions. [2019-12-07 19:55:43,887 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 19:55:43,887 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 105 transitions. [2019-12-07 19:55:43,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-07 19:55:43,887 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:55:43,887 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:55:43,887 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr59ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr60ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2019-12-07 19:55:43,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:55:43,888 INFO L82 PathProgramCache]: Analyzing trace with hash 2042994743, now seen corresponding path program 1 times [2019-12-07 19:55:43,888 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:55:43,888 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363386712] [2019-12-07 19:55:43,888 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:55:43,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:55:43,935 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 19:55:43,935 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363386712] [2019-12-07 19:55:43,935 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:55:43,935 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 19:55:43,935 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670090417] [2019-12-07 19:55:43,935 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 19:55:43,936 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:55:43,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 19:55:43,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 19:55:43,936 INFO L87 Difference]: Start difference. First operand 92 states and 105 transitions. Second operand 4 states. [2019-12-07 19:55:44,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:55:44,091 INFO L93 Difference]: Finished difference Result 131 states and 150 transitions. [2019-12-07 19:55:44,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 19:55:44,091 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2019-12-07 19:55:44,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:55:44,092 INFO L225 Difference]: With dead ends: 131 [2019-12-07 19:55:44,092 INFO L226 Difference]: Without dead ends: 131 [2019-12-07 19:55:44,092 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 1 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 19:55:44,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2019-12-07 19:55:44,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 116. [2019-12-07 19:55:44,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2019-12-07 19:55:44,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 145 transitions. [2019-12-07 19:55:44,099 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 145 transitions. Word has length 7 [2019-12-07 19:55:44,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:55:44,099 INFO L462 AbstractCegarLoop]: Abstraction has 116 states and 145 transitions. [2019-12-07 19:55:44,099 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 19:55:44,099 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 145 transitions. [2019-12-07 19:55:44,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-07 19:55:44,100 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:55:44,100 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:55:44,100 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr59ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr60ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2019-12-07 19:55:44,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:55:44,100 INFO L82 PathProgramCache]: Analyzing trace with hash 517892665, now seen corresponding path program 1 times [2019-12-07 19:55:44,100 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:55:44,101 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493498214] [2019-12-07 19:55:44,101 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:55:44,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:55:44,136 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 19:55:44,136 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493498214] [2019-12-07 19:55:44,136 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:55:44,137 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 19:55:44,137 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193205540] [2019-12-07 19:55:44,137 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 19:55:44,137 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:55:44,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 19:55:44,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 19:55:44,138 INFO L87 Difference]: Start difference. First operand 116 states and 145 transitions. Second operand 5 states. [2019-12-07 19:55:44,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:55:44,347 INFO L93 Difference]: Finished difference Result 198 states and 247 transitions. [2019-12-07 19:55:44,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 19:55:44,348 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-12-07 19:55:44,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:55:44,349 INFO L225 Difference]: With dead ends: 198 [2019-12-07 19:55:44,349 INFO L226 Difference]: Without dead ends: 198 [2019-12-07 19:55:44,349 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-07 19:55:44,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2019-12-07 19:55:44,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 115. [2019-12-07 19:55:44,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-12-07 19:55:44,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 143 transitions. [2019-12-07 19:55:44,355 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 143 transitions. Word has length 9 [2019-12-07 19:55:44,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:55:44,355 INFO L462 AbstractCegarLoop]: Abstraction has 115 states and 143 transitions. [2019-12-07 19:55:44,355 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 19:55:44,356 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 143 transitions. [2019-12-07 19:55:44,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-07 19:55:44,356 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:55:44,356 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:55:44,357 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr59ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr60ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2019-12-07 19:55:44,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:55:44,357 INFO L82 PathProgramCache]: Analyzing trace with hash 517892666, now seen corresponding path program 1 times [2019-12-07 19:55:44,357 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:55:44,357 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948314662] [2019-12-07 19:55:44,357 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:55:44,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:55:44,408 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 19:55:44,408 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948314662] [2019-12-07 19:55:44,409 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:55:44,409 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 19:55:44,409 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457147596] [2019-12-07 19:55:44,409 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 19:55:44,409 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:55:44,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 19:55:44,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 19:55:44,410 INFO L87 Difference]: Start difference. First operand 115 states and 143 transitions. Second operand 5 states. [2019-12-07 19:55:44,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:55:44,617 INFO L93 Difference]: Finished difference Result 204 states and 256 transitions. [2019-12-07 19:55:44,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 19:55:44,618 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-12-07 19:55:44,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:55:44,619 INFO L225 Difference]: With dead ends: 204 [2019-12-07 19:55:44,619 INFO L226 Difference]: Without dead ends: 204 [2019-12-07 19:55:44,619 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-07 19:55:44,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2019-12-07 19:55:44,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 114. [2019-12-07 19:55:44,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-12-07 19:55:44,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 141 transitions. [2019-12-07 19:55:44,624 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 141 transitions. Word has length 9 [2019-12-07 19:55:44,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:55:44,624 INFO L462 AbstractCegarLoop]: Abstraction has 114 states and 141 transitions. [2019-12-07 19:55:44,624 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 19:55:44,624 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 141 transitions. [2019-12-07 19:55:44,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-07 19:55:44,625 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:55:44,625 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:55:44,625 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr59ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr60ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2019-12-07 19:55:44,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:55:44,625 INFO L82 PathProgramCache]: Analyzing trace with hash -521163901, now seen corresponding path program 1 times [2019-12-07 19:55:44,625 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:55:44,625 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441304485] [2019-12-07 19:55:44,626 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:55:44,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:55:44,683 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 19:55:44,683 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441304485] [2019-12-07 19:55:44,683 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:55:44,683 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 19:55:44,684 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982550789] [2019-12-07 19:55:44,684 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 19:55:44,684 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:55:44,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 19:55:44,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-07 19:55:44,684 INFO L87 Difference]: Start difference. First operand 114 states and 141 transitions. Second operand 8 states. [2019-12-07 19:55:44,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:55:44,945 INFO L93 Difference]: Finished difference Result 119 states and 141 transitions. [2019-12-07 19:55:44,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 19:55:44,946 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 11 [2019-12-07 19:55:44,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:55:44,947 INFO L225 Difference]: With dead ends: 119 [2019-12-07 19:55:44,947 INFO L226 Difference]: Without dead ends: 119 [2019-12-07 19:55:44,947 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2019-12-07 19:55:44,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-12-07 19:55:44,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 113. [2019-12-07 19:55:44,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-12-07 19:55:44,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 140 transitions. [2019-12-07 19:55:44,953 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 140 transitions. Word has length 11 [2019-12-07 19:55:44,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:55:44,953 INFO L462 AbstractCegarLoop]: Abstraction has 113 states and 140 transitions. [2019-12-07 19:55:44,953 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 19:55:44,953 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 140 transitions. [2019-12-07 19:55:44,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-07 19:55:44,954 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:55:44,954 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:55:44,954 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr59ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr60ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2019-12-07 19:55:44,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:55:44,955 INFO L82 PathProgramCache]: Analyzing trace with hash -521163900, now seen corresponding path program 1 times [2019-12-07 19:55:44,955 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:55:44,955 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683853415] [2019-12-07 19:55:44,955 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:55:44,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:55:45,043 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 19:55:45,043 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [683853415] [2019-12-07 19:55:45,043 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:55:45,043 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 19:55:45,043 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10787989] [2019-12-07 19:55:45,044 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 19:55:45,044 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:55:45,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 19:55:45,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-07 19:55:45,044 INFO L87 Difference]: Start difference. First operand 113 states and 140 transitions. Second operand 9 states. [2019-12-07 19:55:45,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:55:45,438 INFO L93 Difference]: Finished difference Result 116 states and 139 transitions. [2019-12-07 19:55:45,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-07 19:55:45,438 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 11 [2019-12-07 19:55:45,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:55:45,439 INFO L225 Difference]: With dead ends: 116 [2019-12-07 19:55:45,439 INFO L226 Difference]: Without dead ends: 116 [2019-12-07 19:55:45,439 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=99, Invalid=207, Unknown=0, NotChecked=0, Total=306 [2019-12-07 19:55:45,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2019-12-07 19:55:45,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 102. [2019-12-07 19:55:45,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-12-07 19:55:45,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 128 transitions. [2019-12-07 19:55:45,442 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 128 transitions. Word has length 11 [2019-12-07 19:55:45,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:55:45,442 INFO L462 AbstractCegarLoop]: Abstraction has 102 states and 128 transitions. [2019-12-07 19:55:45,442 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 19:55:45,442 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 128 transitions. [2019-12-07 19:55:45,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 19:55:45,443 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:55:45,443 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:55:45,443 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr59ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr60ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2019-12-07 19:55:45,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:55:45,443 INFO L82 PathProgramCache]: Analyzing trace with hash 1914587100, now seen corresponding path program 1 times [2019-12-07 19:55:45,443 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:55:45,444 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750152150] [2019-12-07 19:55:45,444 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:55:45,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:55:45,470 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 19:55:45,470 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750152150] [2019-12-07 19:55:45,470 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:55:45,471 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 19:55:45,471 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954732718] [2019-12-07 19:55:45,471 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 19:55:45,471 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:55:45,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 19:55:45,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 19:55:45,471 INFO L87 Difference]: Start difference. First operand 102 states and 128 transitions. Second operand 4 states. [2019-12-07 19:55:45,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:55:45,571 INFO L93 Difference]: Finished difference Result 119 states and 143 transitions. [2019-12-07 19:55:45,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 19:55:45,571 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-07 19:55:45,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:55:45,572 INFO L225 Difference]: With dead ends: 119 [2019-12-07 19:55:45,572 INFO L226 Difference]: Without dead ends: 119 [2019-12-07 19:55:45,572 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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 19:55:45,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-12-07 19:55:45,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 90. [2019-12-07 19:55:45,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-12-07 19:55:45,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 102 transitions. [2019-12-07 19:55:45,575 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 102 transitions. Word has length 13 [2019-12-07 19:55:45,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:55:45,575 INFO L462 AbstractCegarLoop]: Abstraction has 90 states and 102 transitions. [2019-12-07 19:55:45,575 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 19:55:45,575 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 102 transitions. [2019-12-07 19:55:45,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 19:55:45,576 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:55:45,576 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:55:45,576 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr59ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr60ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2019-12-07 19:55:45,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:55:45,576 INFO L82 PathProgramCache]: Analyzing trace with hash -2021590533, now seen corresponding path program 1 times [2019-12-07 19:55:45,576 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:55:45,576 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821483815] [2019-12-07 19:55:45,577 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:55:45,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:55:45,616 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:55:45,616 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821483815] [2019-12-07 19:55:45,617 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:55:45,617 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 19:55:45,617 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870621398] [2019-12-07 19:55:45,617 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 19:55:45,617 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:55:45,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 19:55:45,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 19:55:45,618 INFO L87 Difference]: Start difference. First operand 90 states and 102 transitions. Second operand 5 states. [2019-12-07 19:55:45,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:55:45,729 INFO L93 Difference]: Finished difference Result 100 states and 114 transitions. [2019-12-07 19:55:45,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 19:55:45,730 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-12-07 19:55:45,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:55:45,730 INFO L225 Difference]: With dead ends: 100 [2019-12-07 19:55:45,730 INFO L226 Difference]: Without dead ends: 100 [2019-12-07 19:55:45,731 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-07 19:55:45,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-12-07 19:55:45,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 96. [2019-12-07 19:55:45,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-12-07 19:55:45,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 110 transitions. [2019-12-07 19:55:45,733 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 110 transitions. Word has length 13 [2019-12-07 19:55:45,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:55:45,733 INFO L462 AbstractCegarLoop]: Abstraction has 96 states and 110 transitions. [2019-12-07 19:55:45,733 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 19:55:45,733 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 110 transitions. [2019-12-07 19:55:45,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 19:55:45,733 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:55:45,733 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:55:45,734 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr59ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr60ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2019-12-07 19:55:45,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:55:45,734 INFO L82 PathProgramCache]: Analyzing trace with hash 1757342883, now seen corresponding path program 1 times [2019-12-07 19:55:45,734 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:55:45,734 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400483000] [2019-12-07 19:55:45,734 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:55:45,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:55:45,758 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 19:55:45,758 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400483000] [2019-12-07 19:55:45,758 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:55:45,758 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 19:55:45,759 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955986198] [2019-12-07 19:55:45,759 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 19:55:45,759 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:55:45,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 19:55:45,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 19:55:45,759 INFO L87 Difference]: Start difference. First operand 96 states and 110 transitions. Second operand 5 states. [2019-12-07 19:55:45,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:55:45,892 INFO L93 Difference]: Finished difference Result 125 states and 142 transitions. [2019-12-07 19:55:45,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 19:55:45,892 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-07 19:55:45,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:55:45,893 INFO L225 Difference]: With dead ends: 125 [2019-12-07 19:55:45,893 INFO L226 Difference]: Without dead ends: 125 [2019-12-07 19:55:45,893 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-07 19:55:45,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2019-12-07 19:55:45,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 95. [2019-12-07 19:55:45,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-12-07 19:55:45,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 109 transitions. [2019-12-07 19:55:45,895 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 109 transitions. Word has length 14 [2019-12-07 19:55:45,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:55:45,896 INFO L462 AbstractCegarLoop]: Abstraction has 95 states and 109 transitions. [2019-12-07 19:55:45,896 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 19:55:45,896 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 109 transitions. [2019-12-07 19:55:45,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 19:55:45,896 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:55:45,896 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:55:45,896 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr59ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr60ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2019-12-07 19:55:45,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:55:45,897 INFO L82 PathProgramCache]: Analyzing trace with hash 1757342884, now seen corresponding path program 1 times [2019-12-07 19:55:45,897 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:55:45,897 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821915795] [2019-12-07 19:55:45,897 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:55:45,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:55:45,925 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 19:55:45,925 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821915795] [2019-12-07 19:55:45,925 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:55:45,925 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 19:55:45,925 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824239327] [2019-12-07 19:55:45,926 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 19:55:45,926 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:55:45,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 19:55:45,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 19:55:45,926 INFO L87 Difference]: Start difference. First operand 95 states and 109 transitions. Second operand 5 states. [2019-12-07 19:55:46,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:55:46,064 INFO L93 Difference]: Finished difference Result 131 states and 150 transitions. [2019-12-07 19:55:46,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 19:55:46,064 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-07 19:55:46,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:55:46,065 INFO L225 Difference]: With dead ends: 131 [2019-12-07 19:55:46,065 INFO L226 Difference]: Without dead ends: 131 [2019-12-07 19:55:46,065 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-07 19:55:46,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2019-12-07 19:55:46,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 92. [2019-12-07 19:55:46,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-12-07 19:55:46,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 106 transitions. [2019-12-07 19:55:46,067 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 106 transitions. Word has length 14 [2019-12-07 19:55:46,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:55:46,067 INFO L462 AbstractCegarLoop]: Abstraction has 92 states and 106 transitions. [2019-12-07 19:55:46,067 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 19:55:46,067 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 106 transitions. [2019-12-07 19:55:46,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 19:55:46,068 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:55:46,068 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:55:46,068 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr59ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr60ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2019-12-07 19:55:46,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:55:46,068 INFO L82 PathProgramCache]: Analyzing trace with hash 298678505, now seen corresponding path program 1 times [2019-12-07 19:55:46,068 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:55:46,068 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406223162] [2019-12-07 19:55:46,068 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:55:46,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:55:46,120 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:55:46,121 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406223162] [2019-12-07 19:55:46,121 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1842789557] [2019-12-07 19:55:46,121 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8d0492a9-35d4-47f9-8fba-3eae8b14bba4/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 19:55:46,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:55:46,159 INFO L264 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 20 conjunts are in the unsatisfiable core [2019-12-07 19:55:46,163 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 19:55:46,209 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:55:46,209 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 28 [2019-12-07 19:55:46,210 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 19:55:46,219 INFO L614 ElimStorePlain]: treesize reduction 14, result has 44.0 percent of original size [2019-12-07 19:55:46,219 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 19:55:46,219 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-12-07 19:55:46,224 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 11 treesize of output 7 [2019-12-07 19:55:46,224 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 19:55:46,230 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:55:46,230 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 19:55:46,230 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:15 [2019-12-07 19:55:46,247 INFO L343 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2019-12-07 19:55:46,248 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2019-12-07 19:55:46,248 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 19:55:46,253 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:55:46,253 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 19:55:46,253 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:24 [2019-12-07 19:55:46,284 INFO L343 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2019-12-07 19:55:46,285 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 12 [2019-12-07 19:55:46,285 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 19:55:46,289 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:55:46,290 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 19:55:46,290 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:31, output treesize:11 [2019-12-07 19:55:46,300 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:55:46,300 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 19:55:46,317 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 15 [2019-12-07 19:55:46,320 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 19:55:46,325 INFO L614 ElimStorePlain]: treesize reduction 19, result has 20.8 percent of original size [2019-12-07 19:55:46,325 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 19:55:46,327 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:55:46,327 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 19:55:46,327 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2019-12-07 19:55:46,341 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:55:46,341 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [998668076] [2019-12-07 19:55:46,358 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2019-12-07 19:55:46,358 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 19:55:46,362 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 19:55:46,367 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 19:55:46,368 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 19:55:46,765 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 19:55:47,584 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 69 [2019-12-07 19:55:47,762 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 78 [2019-12-07 19:55:47,952 WARN L192 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 81 [2019-12-07 19:55:48,262 WARN L192 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 86 [2019-12-07 19:55:48,340 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 3 imperfect interpolant sequences. [2019-12-07 19:55:48,341 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [6, 7, 6] total 23 [2019-12-07 19:55:48,341 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258462686] [2019-12-07 19:55:48,342 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-07 19:55:48,342 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:55:48,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-07 19:55:48,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=359, Unknown=0, NotChecked=0, Total=506 [2019-12-07 19:55:48,343 INFO L87 Difference]: Start difference. First operand 92 states and 106 transitions. Second operand 13 states. [2019-12-07 19:55:48,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:55:48,732 INFO L93 Difference]: Finished difference Result 127 states and 144 transitions. [2019-12-07 19:55:48,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-07 19:55:48,732 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 16 [2019-12-07 19:55:48,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:55:48,735 INFO L225 Difference]: With dead ends: 127 [2019-12-07 19:55:48,735 INFO L226 Difference]: Without dead ends: 127 [2019-12-07 19:55:48,735 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 23 SyntacticMatches, 9 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=147, Invalid=359, Unknown=0, NotChecked=0, Total=506 [2019-12-07 19:55:48,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-12-07 19:55:48,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 98. [2019-12-07 19:55:48,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-12-07 19:55:48,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 112 transitions. [2019-12-07 19:55:48,740 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 112 transitions. Word has length 16 [2019-12-07 19:55:48,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:55:48,740 INFO L462 AbstractCegarLoop]: Abstraction has 98 states and 112 transitions. [2019-12-07 19:55:48,740 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-07 19:55:48,740 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 112 transitions. [2019-12-07 19:55:48,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-07 19:55:48,741 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:55:48,741 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:55:48,941 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 19:55:48,942 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr59ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr60ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2019-12-07 19:55:48,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:55:48,943 INFO L82 PathProgramCache]: Analyzing trace with hash 669034674, now seen corresponding path program 1 times [2019-12-07 19:55:48,943 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:55:48,943 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579352464] [2019-12-07 19:55:48,943 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:55:48,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:55:49,022 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 19:55:49,022 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579352464] [2019-12-07 19:55:49,022 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:55:49,023 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 19:55:49,023 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835515610] [2019-12-07 19:55:49,023 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 19:55:49,023 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:55:49,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 19:55:49,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-07 19:55:49,023 INFO L87 Difference]: Start difference. First operand 98 states and 112 transitions. Second operand 8 states. [2019-12-07 19:55:49,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:55:49,203 INFO L93 Difference]: Finished difference Result 134 states and 151 transitions. [2019-12-07 19:55:49,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 19:55:49,203 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 17 [2019-12-07 19:55:49,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:55:49,204 INFO L225 Difference]: With dead ends: 134 [2019-12-07 19:55:49,204 INFO L226 Difference]: Without dead ends: 134 [2019-12-07 19:55:49,204 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2019-12-07 19:55:49,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2019-12-07 19:55:49,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 103. [2019-12-07 19:55:49,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-12-07 19:55:49,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 120 transitions. [2019-12-07 19:55:49,206 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 120 transitions. Word has length 17 [2019-12-07 19:55:49,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:55:49,206 INFO L462 AbstractCegarLoop]: Abstraction has 103 states and 120 transitions. [2019-12-07 19:55:49,206 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 19:55:49,207 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 120 transitions. [2019-12-07 19:55:49,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-07 19:55:49,207 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:55:49,207 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:55:49,207 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr59ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr60ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2019-12-07 19:55:49,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:55:49,207 INFO L82 PathProgramCache]: Analyzing trace with hash 669034675, now seen corresponding path program 1 times [2019-12-07 19:55:49,207 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:55:49,207 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50562953] [2019-12-07 19:55:49,208 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:55:49,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:55:49,289 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 19:55:49,289 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50562953] [2019-12-07 19:55:49,289 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:55:49,289 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 19:55:49,289 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975748034] [2019-12-07 19:55:49,290 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 19:55:49,290 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:55:49,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 19:55:49,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-07 19:55:49,290 INFO L87 Difference]: Start difference. First operand 103 states and 120 transitions. Second operand 7 states. [2019-12-07 19:55:49,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:55:49,551 INFO L93 Difference]: Finished difference Result 153 states and 170 transitions. [2019-12-07 19:55:49,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 19:55:49,551 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2019-12-07 19:55:49,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:55:49,552 INFO L225 Difference]: With dead ends: 153 [2019-12-07 19:55:49,552 INFO L226 Difference]: Without dead ends: 153 [2019-12-07 19:55:49,553 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2019-12-07 19:55:49,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2019-12-07 19:55:49,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 123. [2019-12-07 19:55:49,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2019-12-07 19:55:49,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 154 transitions. [2019-12-07 19:55:49,555 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 154 transitions. Word has length 17 [2019-12-07 19:55:49,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:55:49,555 INFO L462 AbstractCegarLoop]: Abstraction has 123 states and 154 transitions. [2019-12-07 19:55:49,556 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 19:55:49,556 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 154 transitions. [2019-12-07 19:55:49,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-07 19:55:49,556 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:55:49,556 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:55:49,556 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr59ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr60ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2019-12-07 19:55:49,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:55:49,556 INFO L82 PathProgramCache]: Analyzing trace with hash 1645526180, now seen corresponding path program 1 times [2019-12-07 19:55:49,557 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:55:49,557 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714041367] [2019-12-07 19:55:49,557 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:55:49,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:55:49,588 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 19:55:49,588 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714041367] [2019-12-07 19:55:49,588 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:55:49,588 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 19:55:49,588 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328167212] [2019-12-07 19:55:49,588 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 19:55:49,589 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:55:49,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 19:55:49,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 19:55:49,589 INFO L87 Difference]: Start difference. First operand 123 states and 154 transitions. Second operand 5 states. [2019-12-07 19:55:49,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:55:49,710 INFO L93 Difference]: Finished difference Result 173 states and 208 transitions. [2019-12-07 19:55:49,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 19:55:49,710 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-12-07 19:55:49,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:55:49,711 INFO L225 Difference]: With dead ends: 173 [2019-12-07 19:55:49,711 INFO L226 Difference]: Without dead ends: 173 [2019-12-07 19:55:49,711 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 19:55:49,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2019-12-07 19:55:49,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 132. [2019-12-07 19:55:49,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2019-12-07 19:55:49,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 166 transitions. [2019-12-07 19:55:49,714 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 166 transitions. Word has length 17 [2019-12-07 19:55:49,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:55:49,714 INFO L462 AbstractCegarLoop]: Abstraction has 132 states and 166 transitions. [2019-12-07 19:55:49,714 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 19:55:49,714 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 166 transitions. [2019-12-07 19:55:49,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 19:55:49,714 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:55:49,715 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:55:49,715 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr59ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr60ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2019-12-07 19:55:49,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:55:49,715 INFO L82 PathProgramCache]: Analyzing trace with hash -734684000, now seen corresponding path program 1 times [2019-12-07 19:55:49,715 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:55:49,715 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486262408] [2019-12-07 19:55:49,715 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:55:49,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:55:49,731 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 19:55:49,731 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486262408] [2019-12-07 19:55:49,731 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:55:49,731 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 19:55:49,731 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467917962] [2019-12-07 19:55:49,731 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 19:55:49,731 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:55:49,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 19:55:49,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 19:55:49,732 INFO L87 Difference]: Start difference. First operand 132 states and 166 transitions. Second operand 4 states. [2019-12-07 19:55:49,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:55:49,796 INFO L93 Difference]: Finished difference Result 143 states and 175 transitions. [2019-12-07 19:55:49,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 19:55:49,797 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-12-07 19:55:49,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:55:49,797 INFO L225 Difference]: With dead ends: 143 [2019-12-07 19:55:49,797 INFO L226 Difference]: Without dead ends: 143 [2019-12-07 19:55:49,798 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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 19:55:49,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2019-12-07 19:55:49,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 132. [2019-12-07 19:55:49,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2019-12-07 19:55:49,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 164 transitions. [2019-12-07 19:55:49,800 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 164 transitions. Word has length 18 [2019-12-07 19:55:49,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:55:49,800 INFO L462 AbstractCegarLoop]: Abstraction has 132 states and 164 transitions. [2019-12-07 19:55:49,800 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 19:55:49,801 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 164 transitions. [2019-12-07 19:55:49,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-07 19:55:49,801 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:55:49,801 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:55:49,801 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr59ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr60ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2019-12-07 19:55:49,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:55:49,801 INFO L82 PathProgramCache]: Analyzing trace with hash -1302768617, now seen corresponding path program 1 times [2019-12-07 19:55:49,801 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:55:49,801 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663684306] [2019-12-07 19:55:49,802 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:55:49,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 19:55:49,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 19:55:49,834 INFO L174 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2019-12-07 19:55:49,835 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 19:55:49,856 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 07:55:49 BoogieIcfgContainer [2019-12-07 19:55:49,856 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 19:55:49,856 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 19:55:49,856 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 19:55:49,857 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 19:55:49,857 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 07:55:43" (3/4) ... [2019-12-07 19:55:49,858 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 19:55:49,888 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_8d0492a9-35d4-47f9-8fba-3eae8b14bba4/bin/utaipan/witness.graphml [2019-12-07 19:55:49,888 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 19:55:49,889 INFO L168 Benchmark]: Toolchain (without parser) took 7395.62 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 184.5 MB). Free memory was 931.9 MB in the beginning and 910.0 MB in the end (delta: 21.9 MB). Peak memory consumption was 206.5 MB. Max. memory is 11.5 GB. [2019-12-07 19:55:49,889 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 952.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 19:55:49,890 INFO L168 Benchmark]: CACSL2BoogieTranslator took 304.44 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 102.2 MB). Free memory was 931.9 MB in the beginning and 1.1 GB in the end (delta: -154.2 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. [2019-12-07 19:55:49,890 INFO L168 Benchmark]: Boogie Procedure Inliner took 31.85 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 19:55:49,890 INFO L168 Benchmark]: Boogie Preprocessor took 21.94 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 19:55:49,890 INFO L168 Benchmark]: RCFGBuilder took 411.64 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 55.2 MB). Peak memory consumption was 55.2 MB. Max. memory is 11.5 GB. [2019-12-07 19:55:49,890 INFO L168 Benchmark]: TraceAbstraction took 6590.44 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 82.3 MB). Free memory was 1.0 GB in the beginning and 911.5 MB in the end (delta: 114.0 MB). Peak memory consumption was 196.3 MB. Max. memory is 11.5 GB. [2019-12-07 19:55:49,891 INFO L168 Benchmark]: Witness Printer took 31.81 ms. Allocated memory is still 1.2 GB. Free memory was 911.5 MB in the beginning and 910.0 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 11.5 GB. [2019-12-07 19:55:49,892 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.12 ms. Allocated memory is still 1.0 GB. Free memory is still 952.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 304.44 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 102.2 MB). Free memory was 931.9 MB in the beginning and 1.1 GB in the end (delta: -154.2 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 31.85 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 21.94 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 411.64 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 55.2 MB). Peak memory consumption was 55.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 6590.44 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 82.3 MB). Free memory was 1.0 GB in the beginning and 911.5 MB in the end (delta: 114.0 MB). Peak memory consumption was 196.3 MB. Max. memory is 11.5 GB. * Witness Printer took 31.81 ms. Allocated memory is still 1.2 GB. Free memory was 911.5 MB in the beginning and 910.0 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1052]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: [L989] SLL* head = malloc(sizeof(SLL)); [L990] head->next = ((void*)0) [L991] head->prev = ((void*)0) [L992] head->data = 0 [L994] SLL* x = head; [L997] COND FALSE !(__VERIFIER_nondet_int()) [L1008] COND TRUE __VERIFIER_nondet_int() [L1009] x = malloc(sizeof(SLL)) [L1010] x->data = 1 [L1011] x->next = head [L1012] x->prev = ((void*)0) [L1013] head = x [L1039] x = head [L1042] EXPR x->data [L1042] COND FALSE !(x->data != 1) [L1048] EXPR x->next [L1048] x = x->next [L1049] COND TRUE \read(*x) [L1051] EXPR x->data [L1051] COND TRUE x->data != 1 [L1052] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 109 locations, 61 error locations. Result: UNSAFE, OverallTime: 6.5s, OverallIterations: 18, TraceHistogramMax: 1, AutomataDifference: 3.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 977 SDtfs, 1729 SDslu, 1210 SDs, 0 SdLazy, 3341 SolverSat, 415 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 167 GetRequests, 40 SyntacticMatches, 15 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 245 ImplicationChecksByTransitivity, 2.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=132occurred in iteration=16, 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, 17 MinimizatonAttempts, 486 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 232 NumberOfCodeBlocks, 232 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 210 ConstructedInterpolants, 0 QuantifiedInterpolants, 20414 SizeOfPredicates, 9 NumberOfNonLiveVariables, 109 ConjunctsInSsa, 20 ConjunctsInUnsatCore, 19 InterpolantComputations, 16 PerfectInterpolantSequences, 1/4 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: OVERALL_TIME[ms]: 408, ICFG_INTERPRETER_ENTERED_PROCEDURES: 1, DAG_INTERPRETER_EARLY_EXIT_QUERIES_NONTRIVIAL: 14, DAG_INTERPRETER_EARLY_EXITS: 0, TOOLS_POST_APPLICATIONS: 18, TOOLS_POST_TIME[ms]: 345, TOOLS_POST_CALL_APPLICATIONS: 0, TOOLS_POST_CALL_TIME[ms]: 0, TOOLS_POST_RETURN_APPLICATIONS: 0, TOOLS_POST_RETURN_TIME[ms]: 0, TOOLS_QUANTIFIERELIM_APPLICATIONS: 18, TOOLS_QUANTIFIERELIM_TIME[ms]: 339, TOOLS_QUANTIFIERELIM_MAX_TIME[ms]: 76, FLUID_QUERY_TIME[ms]: 3, FLUID_QUERIES: 38, FLUID_YES_ANSWERS: 0, DOMAIN_JOIN_APPLICATIONS: 0, DOMAIN_JOIN_TIME[ms]: 0, DOMAIN_ALPHA_APPLICATIONS: 0, DOMAIN_ALPHA_TIME[ms]: 0, DOMAIN_WIDEN_APPLICATIONS: 0, DOMAIN_WIDEN_TIME[ms]: 0, DOMAIN_ISSUBSETEQ_APPLICATIONS: 1, DOMAIN_ISSUBSETEQ_TIME[ms]: 0, DOMAIN_ISBOTTOM_APPLICATIONS: 14, DOMAIN_ISBOTTOM_TIME[ms]: 22, LOOP_SUMMARIZER_APPLICATIONS: 1, LOOP_SUMMARIZER_CACHE_MISSES: 1, LOOP_SUMMARIZER_OVERALL_TIME[ms]: 4, LOOP_SUMMARIZER_NEW_COMPUTATION_TIME[ms]: 3, LOOP_SUMMARIZER_FIXPOINT_ITERATIONS: 1, CALL_SUMMARIZER_APPLICATIONS: 0, CALL_SUMMARIZER_CACHE_MISSES: 0, CALL_SUMMARIZER_OVERALL_TIME[ms]: 0, CALL_SUMMARIZER_NEW_COMPUTATION_TIME[ms]: 0, PROCEDURE_GRAPH_BUILDER_TIME[ms]: 2, PATH_EXPR_TIME[ms]: 3, REGEX_TO_DAG_TIME[ms]: 3, DAG_COMPRESSION_TIME[ms]: 9, DAG_COMPRESSION_PROCESSED_NODES: 148, DAG_COMPRESSION_RETAINED_NODES: 40, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...