./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ntdrivers-simplified/kbfiltr_simpl2.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6b5699aa Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_9a40c928-5ffb-4778-afd4-681ccb5e7905/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_9a40c928-5ffb-4778-afd4-681ccb5e7905/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_9a40c928-5ffb-4778-afd4-681ccb5e7905/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_9a40c928-5ffb-4778-afd4-681ccb5e7905/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/ntdrivers-simplified/kbfiltr_simpl2.cil-2.c -s /tmp/vcloud-vcloud-master/worker/run_dir_9a40c928-5ffb-4778-afd4-681ccb5e7905/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_9a40c928-5ffb-4778-afd4-681ccb5e7905/bin/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 99a77f5372e1d3174eb539425b8da52ff3b34c76 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.24-6b5699a [2019-11-26 03:01:20,864 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-26 03:01:20,865 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-26 03:01:20,880 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-26 03:01:20,880 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-26 03:01:20,881 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-26 03:01:20,883 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-26 03:01:20,891 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-26 03:01:20,896 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-26 03:01:20,900 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-26 03:01:20,901 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-26 03:01:20,902 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-26 03:01:20,902 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-26 03:01:20,904 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-26 03:01:20,905 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-26 03:01:20,906 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-26 03:01:20,907 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-26 03:01:20,908 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-26 03:01:20,910 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-26 03:01:20,913 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-26 03:01:20,917 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-26 03:01:20,920 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-26 03:01:20,921 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-26 03:01:20,921 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-26 03:01:20,924 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-26 03:01:20,924 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-26 03:01:20,925 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-26 03:01:20,926 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-26 03:01:20,926 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-26 03:01:20,927 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-26 03:01:20,927 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-26 03:01:20,928 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-26 03:01:20,928 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-26 03:01:20,929 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-26 03:01:20,930 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-26 03:01:20,930 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-26 03:01:20,930 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-26 03:01:20,931 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-26 03:01:20,931 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-26 03:01:20,932 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-26 03:01:20,933 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-26 03:01:20,933 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_9a40c928-5ffb-4778-afd4-681ccb5e7905/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-11-26 03:01:20,957 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-26 03:01:20,957 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-26 03:01:20,958 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-26 03:01:20,958 INFO L138 SettingsManager]: * User list type=DISABLED [2019-11-26 03:01:20,958 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-11-26 03:01:20,958 INFO L138 SettingsManager]: * Explicit value domain=true [2019-11-26 03:01:20,959 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-11-26 03:01:20,959 INFO L138 SettingsManager]: * Octagon Domain=false [2019-11-26 03:01:20,959 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-11-26 03:01:20,959 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-11-26 03:01:20,959 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-11-26 03:01:20,959 INFO L138 SettingsManager]: * Interval Domain=false [2019-11-26 03:01:20,960 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-11-26 03:01:20,960 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-11-26 03:01:20,960 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-11-26 03:01:20,961 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-26 03:01:20,961 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-26 03:01:20,961 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-26 03:01:20,961 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-26 03:01:20,961 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-26 03:01:20,961 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-26 03:01:20,962 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-26 03:01:20,962 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-26 03:01:20,962 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-26 03:01:20,962 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-26 03:01:20,962 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-26 03:01:20,963 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-26 03:01:20,963 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-26 03:01:20,963 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-26 03:01:20,963 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-26 03:01:20,963 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-26 03:01:20,964 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-26 03:01:20,964 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-26 03:01:20,964 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-11-26 03:01:20,964 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-26 03:01:20,964 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-26 03:01:20,964 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-26 03:01:20,965 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_9a40c928-5ffb-4778-afd4-681ccb5e7905/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 ! call(__VERIFIER_error())) ) 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 -> 99a77f5372e1d3174eb539425b8da52ff3b34c76 [2019-11-26 03:01:21,133 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-26 03:01:21,143 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-26 03:01:21,145 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-26 03:01:21,147 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-26 03:01:21,147 INFO L275 PluginConnector]: CDTParser initialized [2019-11-26 03:01:21,148 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_9a40c928-5ffb-4778-afd4-681ccb5e7905/bin/utaipan/../../sv-benchmarks/c/ntdrivers-simplified/kbfiltr_simpl2.cil-2.c [2019-11-26 03:01:21,217 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_9a40c928-5ffb-4778-afd4-681ccb5e7905/bin/utaipan/data/e646295cd/4161ad6004884d099ebe1db03ff8c5e2/FLAGaf240e3dd [2019-11-26 03:01:21,599 INFO L306 CDTParser]: Found 1 translation units. [2019-11-26 03:01:21,599 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_9a40c928-5ffb-4778-afd4-681ccb5e7905/sv-benchmarks/c/ntdrivers-simplified/kbfiltr_simpl2.cil-2.c [2019-11-26 03:01:21,611 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_9a40c928-5ffb-4778-afd4-681ccb5e7905/bin/utaipan/data/e646295cd/4161ad6004884d099ebe1db03ff8c5e2/FLAGaf240e3dd [2019-11-26 03:01:21,928 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_9a40c928-5ffb-4778-afd4-681ccb5e7905/bin/utaipan/data/e646295cd/4161ad6004884d099ebe1db03ff8c5e2 [2019-11-26 03:01:21,930 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-26 03:01:21,931 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-26 03:01:21,932 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-26 03:01:21,932 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-26 03:01:21,935 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-26 03:01:21,936 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 03:01:21" (1/1) ... [2019-11-26 03:01:21,938 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1addfcd8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 03:01:21, skipping insertion in model container [2019-11-26 03:01:21,938 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 03:01:21" (1/1) ... [2019-11-26 03:01:21,945 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-26 03:01:22,001 INFO L179 MainTranslator]: Built tables and reachable declarations [2019-11-26 03:01:22,389 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-26 03:01:22,398 INFO L201 MainTranslator]: Completed pre-run [2019-11-26 03:01:22,495 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-26 03:01:22,524 INFO L205 MainTranslator]: Completed translation [2019-11-26 03:01:22,525 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 03:01:22 WrapperNode [2019-11-26 03:01:22,525 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-26 03:01:22,526 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-26 03:01:22,526 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-26 03:01:22,526 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-26 03:01:22,534 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 03:01:22" (1/1) ... [2019-11-26 03:01:22,548 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 03:01:22" (1/1) ... [2019-11-26 03:01:22,625 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-26 03:01:22,626 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-26 03:01:22,626 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-26 03:01:22,626 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-26 03:01:22,635 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 03:01:22" (1/1) ... [2019-11-26 03:01:22,635 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 03:01:22" (1/1) ... [2019-11-26 03:01:22,648 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 03:01:22" (1/1) ... [2019-11-26 03:01:22,648 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 03:01:22" (1/1) ... [2019-11-26 03:01:22,686 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 03:01:22" (1/1) ... [2019-11-26 03:01:22,704 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 03:01:22" (1/1) ... [2019-11-26 03:01:22,708 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 03:01:22" (1/1) ... [2019-11-26 03:01:22,731 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-26 03:01:22,732 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-26 03:01:22,732 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-26 03:01:22,732 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-26 03:01:22,733 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 03:01:22" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9a40c928-5ffb-4778-afd4-681ccb5e7905/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-11-26 03:01:22,791 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-26 03:01:22,792 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-26 03:01:22,954 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-26 03:01:22,963 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-26 03:01:22,989 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-26 03:01:22,998 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-26 03:01:23,015 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-26 03:01:23,020 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-26 03:01:23,030 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-26 03:01:23,050 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-26 03:01:23,062 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-26 03:01:23,074 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-26 03:01:23,076 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-26 03:01:23,083 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-26 03:01:23,983 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##249: assume false; [2019-11-26 03:01:23,983 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##250: assume !false; [2019-11-26 03:01:23,984 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##279: assume false; [2019-11-26 03:01:23,984 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##280: assume !false; [2019-11-26 03:01:23,984 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##219: assume false; [2019-11-26 03:01:23,984 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##220: assume !false; [2019-11-26 03:01:23,984 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##302: assume !false; [2019-11-26 03:01:23,985 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##301: assume false; [2019-11-26 03:01:23,985 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##322: assume !false; [2019-11-26 03:01:23,985 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##321: assume false; [2019-11-26 03:01:23,985 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2019-11-26 03:01:23,986 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2019-11-26 03:01:23,986 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##191: assume false; [2019-11-26 03:01:23,986 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##192: assume !false; [2019-11-26 03:01:23,986 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##46: assume !false; [2019-11-26 03:01:23,986 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##45: assume false; [2019-11-26 03:01:23,987 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##140: assume false; [2019-11-26 03:01:23,987 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##141: assume !false; [2019-11-26 03:01:23,987 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##389: assume !false; [2019-11-26 03:01:23,987 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##388: assume false; [2019-11-26 03:01:23,987 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##18: assume false; [2019-11-26 03:01:23,988 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##19: assume !false; [2019-11-26 03:01:23,988 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##162: assume !false; [2019-11-26 03:01:23,988 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##161: assume false; [2019-11-26 03:01:24,847 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-26 03:01:24,847 INFO L284 CfgBuilder]: Removed 154 assume(true) statements. [2019-11-26 03:01:24,848 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 03:01:24 BoogieIcfgContainer [2019-11-26 03:01:24,848 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-26 03:01:24,849 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-26 03:01:24,849 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-26 03:01:24,852 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-26 03:01:24,852 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.11 03:01:21" (1/3) ... [2019-11-26 03:01:24,853 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67415bdb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 03:01:24, skipping insertion in model container [2019-11-26 03:01:24,853 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 03:01:22" (2/3) ... [2019-11-26 03:01:24,853 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67415bdb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 03:01:24, skipping insertion in model container [2019-11-26 03:01:24,854 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 03:01:24" (3/3) ... [2019-11-26 03:01:24,855 INFO L109 eAbstractionObserver]: Analyzing ICFG kbfiltr_simpl2.cil-2.c [2019-11-26 03:01:24,864 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-26 03:01:24,870 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 30 error locations. [2019-11-26 03:01:24,881 INFO L249 AbstractCegarLoop]: Starting to check reachability of 30 error locations. [2019-11-26 03:01:24,905 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-26 03:01:24,906 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-26 03:01:24,906 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-26 03:01:24,906 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-26 03:01:24,906 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-26 03:01:24,906 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-26 03:01:24,907 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-26 03:01:24,907 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-26 03:01:24,957 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states. [2019-11-26 03:01:24,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-26 03:01:24,963 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 03:01:24,963 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 03:01:24,964 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 03:01:24,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 03:01:24,972 INFO L82 PathProgramCache]: Analyzing trace with hash 334546970, now seen corresponding path program 1 times [2019-11-26 03:01:24,978 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 03:01:24,978 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712450776] [2019-11-26 03:01:24,978 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 03:01:25,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 03:01:25,126 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 03:01:25,126 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712450776] [2019-11-26 03:01:25,127 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 03:01:25,127 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 03:01:25,129 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996799210] [2019-11-26 03:01:25,133 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-26 03:01:25,133 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 03:01:25,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-26 03:01:25,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 03:01:25,148 INFO L87 Difference]: Start difference. First operand 202 states. Second operand 3 states. [2019-11-26 03:01:25,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 03:01:25,402 INFO L93 Difference]: Finished difference Result 357 states and 532 transitions. [2019-11-26 03:01:25,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 03:01:25,404 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-11-26 03:01:25,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 03:01:25,421 INFO L225 Difference]: With dead ends: 357 [2019-11-26 03:01:25,422 INFO L226 Difference]: Without dead ends: 184 [2019-11-26 03:01:25,425 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 03:01:25,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2019-11-26 03:01:25,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 184. [2019-11-26 03:01:25,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2019-11-26 03:01:25,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 245 transitions. [2019-11-26 03:01:25,474 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 245 transitions. Word has length 9 [2019-11-26 03:01:25,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 03:01:25,474 INFO L462 AbstractCegarLoop]: Abstraction has 184 states and 245 transitions. [2019-11-26 03:01:25,474 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-26 03:01:25,474 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 245 transitions. [2019-11-26 03:01:25,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-26 03:01:25,476 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 03:01:25,476 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 03:01:25,476 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 03:01:25,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 03:01:25,477 INFO L82 PathProgramCache]: Analyzing trace with hash -1345803039, now seen corresponding path program 1 times [2019-11-26 03:01:25,477 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 03:01:25,477 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723444183] [2019-11-26 03:01:25,477 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 03:01:25,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 03:01:25,528 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 03:01:25,528 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723444183] [2019-11-26 03:01:25,529 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 03:01:25,529 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 03:01:25,529 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024766364] [2019-11-26 03:01:25,530 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-26 03:01:25,530 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 03:01:25,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-26 03:01:25,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 03:01:25,531 INFO L87 Difference]: Start difference. First operand 184 states and 245 transitions. Second operand 3 states. [2019-11-26 03:01:25,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 03:01:25,576 INFO L93 Difference]: Finished difference Result 288 states and 373 transitions. [2019-11-26 03:01:25,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 03:01:25,577 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-11-26 03:01:25,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 03:01:25,579 INFO L225 Difference]: With dead ends: 288 [2019-11-26 03:01:25,579 INFO L226 Difference]: Without dead ends: 190 [2019-11-26 03:01:25,580 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 03:01:25,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2019-11-26 03:01:25,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 154. [2019-11-26 03:01:25,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2019-11-26 03:01:25,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 201 transitions. [2019-11-26 03:01:25,604 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 201 transitions. Word has length 10 [2019-11-26 03:01:25,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 03:01:25,605 INFO L462 AbstractCegarLoop]: Abstraction has 154 states and 201 transitions. [2019-11-26 03:01:25,605 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-26 03:01:25,605 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 201 transitions. [2019-11-26 03:01:25,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-26 03:01:25,608 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 03:01:25,608 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 03:01:25,608 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 03:01:25,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 03:01:25,609 INFO L82 PathProgramCache]: Analyzing trace with hash 1906729073, now seen corresponding path program 1 times [2019-11-26 03:01:25,609 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 03:01:25,610 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004204134] [2019-11-26 03:01:25,610 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 03:01:25,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 03:01:25,654 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 03:01:25,654 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004204134] [2019-11-26 03:01:25,654 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 03:01:25,655 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-26 03:01:25,655 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423573069] [2019-11-26 03:01:25,655 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-26 03:01:25,655 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 03:01:25,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-26 03:01:25,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 03:01:25,656 INFO L87 Difference]: Start difference. First operand 154 states and 201 transitions. Second operand 3 states. [2019-11-26 03:01:25,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 03:01:25,685 INFO L93 Difference]: Finished difference Result 171 states and 221 transitions. [2019-11-26 03:01:25,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 03:01:25,685 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-11-26 03:01:25,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 03:01:25,687 INFO L225 Difference]: With dead ends: 171 [2019-11-26 03:01:25,687 INFO L226 Difference]: Without dead ends: 154 [2019-11-26 03:01:25,687 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 03:01:25,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2019-11-26 03:01:25,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 154. [2019-11-26 03:01:25,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2019-11-26 03:01:25,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 200 transitions. [2019-11-26 03:01:25,712 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 200 transitions. Word has length 10 [2019-11-26 03:01:25,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 03:01:25,712 INFO L462 AbstractCegarLoop]: Abstraction has 154 states and 200 transitions. [2019-11-26 03:01:25,712 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-26 03:01:25,713 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 200 transitions. [2019-11-26 03:01:25,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-26 03:01:25,715 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 03:01:25,715 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 03:01:25,716 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 03:01:25,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 03:01:25,716 INFO L82 PathProgramCache]: Analyzing trace with hash -107456817, now seen corresponding path program 1 times [2019-11-26 03:01:25,716 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 03:01:25,717 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488406953] [2019-11-26 03:01:25,717 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 03:01:25,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 03:01:25,799 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 03:01:25,799 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488406953] [2019-11-26 03:01:25,799 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 03:01:25,799 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 03:01:25,799 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773524347] [2019-11-26 03:01:25,800 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-26 03:01:25,800 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 03:01:25,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-26 03:01:25,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 03:01:25,801 INFO L87 Difference]: Start difference. First operand 154 states and 200 transitions. Second operand 3 states. [2019-11-26 03:01:25,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 03:01:25,927 INFO L93 Difference]: Finished difference Result 154 states and 200 transitions. [2019-11-26 03:01:25,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 03:01:25,928 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-11-26 03:01:25,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 03:01:25,929 INFO L225 Difference]: With dead ends: 154 [2019-11-26 03:01:25,929 INFO L226 Difference]: Without dead ends: 140 [2019-11-26 03:01:25,930 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 03:01:25,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2019-11-26 03:01:25,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2019-11-26 03:01:25,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2019-11-26 03:01:25,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 186 transitions. [2019-11-26 03:01:25,949 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 186 transitions. Word has length 15 [2019-11-26 03:01:25,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 03:01:25,949 INFO L462 AbstractCegarLoop]: Abstraction has 140 states and 186 transitions. [2019-11-26 03:01:25,949 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-26 03:01:25,950 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 186 transitions. [2019-11-26 03:01:25,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-26 03:01:25,956 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 03:01:25,956 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 03:01:25,957 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 03:01:25,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 03:01:25,957 INFO L82 PathProgramCache]: Analyzing trace with hash -231494050, now seen corresponding path program 1 times [2019-11-26 03:01:25,957 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 03:01:25,958 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684805360] [2019-11-26 03:01:25,958 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 03:01:25,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 03:01:26,024 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 03:01:26,025 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684805360] [2019-11-26 03:01:26,025 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 03:01:26,025 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 03:01:26,025 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351606310] [2019-11-26 03:01:26,026 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-26 03:01:26,026 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 03:01:26,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-26 03:01:26,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 03:01:26,027 INFO L87 Difference]: Start difference. First operand 140 states and 186 transitions. Second operand 3 states. [2019-11-26 03:01:26,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 03:01:26,049 INFO L93 Difference]: Finished difference Result 194 states and 250 transitions. [2019-11-26 03:01:26,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 03:01:26,050 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-11-26 03:01:26,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 03:01:26,052 INFO L225 Difference]: With dead ends: 194 [2019-11-26 03:01:26,052 INFO L226 Difference]: Without dead ends: 158 [2019-11-26 03:01:26,052 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 03:01:26,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2019-11-26 03:01:26,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 140. [2019-11-26 03:01:26,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2019-11-26 03:01:26,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 185 transitions. [2019-11-26 03:01:26,076 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 185 transitions. Word has length 18 [2019-11-26 03:01:26,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 03:01:26,078 INFO L462 AbstractCegarLoop]: Abstraction has 140 states and 185 transitions. [2019-11-26 03:01:26,078 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-26 03:01:26,078 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 185 transitions. [2019-11-26 03:01:26,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-26 03:01:26,081 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 03:01:26,082 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 03:01:26,082 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 03:01:26,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 03:01:26,082 INFO L82 PathProgramCache]: Analyzing trace with hash 1811817549, now seen corresponding path program 1 times [2019-11-26 03:01:26,084 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 03:01:26,084 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811046976] [2019-11-26 03:01:26,085 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 03:01:26,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 03:01:26,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 03:01:26,117 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811046976] [2019-11-26 03:01:26,118 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 03:01:26,118 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 03:01:26,118 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215721688] [2019-11-26 03:01:26,118 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-26 03:01:26,118 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 03:01:26,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-26 03:01:26,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 03:01:26,119 INFO L87 Difference]: Start difference. First operand 140 states and 185 transitions. Second operand 3 states. [2019-11-26 03:01:26,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 03:01:26,205 INFO L93 Difference]: Finished difference Result 174 states and 226 transitions. [2019-11-26 03:01:26,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 03:01:26,206 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-11-26 03:01:26,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 03:01:26,207 INFO L225 Difference]: With dead ends: 174 [2019-11-26 03:01:26,207 INFO L226 Difference]: Without dead ends: 137 [2019-11-26 03:01:26,208 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 03:01:26,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2019-11-26 03:01:26,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2019-11-26 03:01:26,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2019-11-26 03:01:26,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 181 transitions. [2019-11-26 03:01:26,216 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 181 transitions. Word has length 18 [2019-11-26 03:01:26,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 03:01:26,216 INFO L462 AbstractCegarLoop]: Abstraction has 137 states and 181 transitions. [2019-11-26 03:01:26,216 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-26 03:01:26,216 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 181 transitions. [2019-11-26 03:01:26,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-26 03:01:26,217 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 03:01:26,217 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-11-26 03:01:26,218 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 03:01:26,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 03:01:26,218 INFO L82 PathProgramCache]: Analyzing trace with hash -200722242, now seen corresponding path program 1 times [2019-11-26 03:01:26,218 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 03:01:26,219 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503466587] [2019-11-26 03:01:26,219 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 03:01:26,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 03:01:26,280 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 03:01:26,281 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503466587] [2019-11-26 03:01:26,281 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 03:01:26,281 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 03:01:26,281 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731997952] [2019-11-26 03:01:26,282 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-26 03:01:26,282 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 03:01:26,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-26 03:01:26,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 03:01:26,282 INFO L87 Difference]: Start difference. First operand 137 states and 181 transitions. Second operand 3 states. [2019-11-26 03:01:26,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 03:01:26,302 INFO L93 Difference]: Finished difference Result 189 states and 243 transitions. [2019-11-26 03:01:26,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 03:01:26,303 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-11-26 03:01:26,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 03:01:26,305 INFO L225 Difference]: With dead ends: 189 [2019-11-26 03:01:26,305 INFO L226 Difference]: Without dead ends: 153 [2019-11-26 03:01:26,305 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 03:01:26,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2019-11-26 03:01:26,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 135. [2019-11-26 03:01:26,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2019-11-26 03:01:26,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 178 transitions. [2019-11-26 03:01:26,315 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 178 transitions. Word has length 19 [2019-11-26 03:01:26,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 03:01:26,316 INFO L462 AbstractCegarLoop]: Abstraction has 135 states and 178 transitions. [2019-11-26 03:01:26,316 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-26 03:01:26,317 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 178 transitions. [2019-11-26 03:01:26,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-26 03:01:26,318 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 03:01:26,318 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 03:01:26,318 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 03:01:26,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 03:01:26,319 INFO L82 PathProgramCache]: Analyzing trace with hash -1920632013, now seen corresponding path program 1 times [2019-11-26 03:01:26,319 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 03:01:26,320 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608495383] [2019-11-26 03:01:26,320 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 03:01:26,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 03:01:26,371 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 03:01:26,371 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608495383] [2019-11-26 03:01:26,371 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 03:01:26,372 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 03:01:26,372 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472486388] [2019-11-26 03:01:26,372 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 03:01:26,372 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 03:01:26,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 03:01:26,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 03:01:26,373 INFO L87 Difference]: Start difference. First operand 135 states and 178 transitions. Second operand 4 states. [2019-11-26 03:01:26,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 03:01:26,514 INFO L93 Difference]: Finished difference Result 169 states and 219 transitions. [2019-11-26 03:01:26,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 03:01:26,518 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2019-11-26 03:01:26,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 03:01:26,519 INFO L225 Difference]: With dead ends: 169 [2019-11-26 03:01:26,519 INFO L226 Difference]: Without dead ends: 135 [2019-11-26 03:01:26,520 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-11-26 03:01:26,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2019-11-26 03:01:26,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2019-11-26 03:01:26,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2019-11-26 03:01:26,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 177 transitions. [2019-11-26 03:01:26,528 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 177 transitions. Word has length 20 [2019-11-26 03:01:26,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 03:01:26,528 INFO L462 AbstractCegarLoop]: Abstraction has 135 states and 177 transitions. [2019-11-26 03:01:26,529 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 03:01:26,529 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 177 transitions. [2019-11-26 03:01:26,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-26 03:01:26,530 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 03:01:26,530 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 03:01:26,531 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 03:01:26,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 03:01:26,532 INFO L82 PathProgramCache]: Analyzing trace with hash -1210076498, now seen corresponding path program 1 times [2019-11-26 03:01:26,532 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 03:01:26,533 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929835143] [2019-11-26 03:01:26,533 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 03:01:26,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 03:01:26,572 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 03:01:26,572 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929835143] [2019-11-26 03:01:26,572 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 03:01:26,573 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 03:01:26,573 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239810273] [2019-11-26 03:01:26,573 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-26 03:01:26,573 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 03:01:26,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-26 03:01:26,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 03:01:26,574 INFO L87 Difference]: Start difference. First operand 135 states and 177 transitions. Second operand 3 states. [2019-11-26 03:01:26,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 03:01:26,589 INFO L93 Difference]: Finished difference Result 146 states and 191 transitions. [2019-11-26 03:01:26,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 03:01:26,590 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-11-26 03:01:26,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 03:01:26,591 INFO L225 Difference]: With dead ends: 146 [2019-11-26 03:01:26,591 INFO L226 Difference]: Without dead ends: 130 [2019-11-26 03:01:26,592 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 03:01:26,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2019-11-26 03:01:26,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2019-11-26 03:01:26,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2019-11-26 03:01:26,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 170 transitions. [2019-11-26 03:01:26,600 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 170 transitions. Word has length 21 [2019-11-26 03:01:26,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 03:01:26,601 INFO L462 AbstractCegarLoop]: Abstraction has 130 states and 170 transitions. [2019-11-26 03:01:26,601 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-26 03:01:26,601 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 170 transitions. [2019-11-26 03:01:26,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-26 03:01:26,602 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 03:01:26,602 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 03:01:26,602 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 03:01:26,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 03:01:26,603 INFO L82 PathProgramCache]: Analyzing trace with hash 1330689250, now seen corresponding path program 1 times [2019-11-26 03:01:26,603 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 03:01:26,603 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722004131] [2019-11-26 03:01:26,603 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 03:01:26,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 03:01:26,672 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 03:01:26,672 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722004131] [2019-11-26 03:01:26,672 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 03:01:26,673 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-26 03:01:26,673 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725946546] [2019-11-26 03:01:26,673 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-26 03:01:26,673 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 03:01:26,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-26 03:01:26,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-26 03:01:26,674 INFO L87 Difference]: Start difference. First operand 130 states and 170 transitions. Second operand 5 states. [2019-11-26 03:01:26,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 03:01:26,909 INFO L93 Difference]: Finished difference Result 154 states and 195 transitions. [2019-11-26 03:01:26,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-26 03:01:26,909 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2019-11-26 03:01:26,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 03:01:26,910 INFO L225 Difference]: With dead ends: 154 [2019-11-26 03:01:26,910 INFO L226 Difference]: Without dead ends: 152 [2019-11-26 03:01:26,911 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-11-26 03:01:26,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2019-11-26 03:01:26,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 130. [2019-11-26 03:01:26,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2019-11-26 03:01:26,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 170 transitions. [2019-11-26 03:01:26,921 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 170 transitions. Word has length 21 [2019-11-26 03:01:26,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 03:01:26,922 INFO L462 AbstractCegarLoop]: Abstraction has 130 states and 170 transitions. [2019-11-26 03:01:26,922 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-26 03:01:26,922 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 170 transitions. [2019-11-26 03:01:26,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-26 03:01:26,923 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 03:01:26,923 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 03:01:26,923 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 03:01:26,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 03:01:26,924 INFO L82 PathProgramCache]: Analyzing trace with hash 1142712830, now seen corresponding path program 1 times [2019-11-26 03:01:26,924 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 03:01:26,924 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747545360] [2019-11-26 03:01:26,924 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 03:01:26,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 03:01:26,965 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 03:01:26,966 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747545360] [2019-11-26 03:01:26,966 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 03:01:26,966 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-26 03:01:26,966 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968331563] [2019-11-26 03:01:26,966 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-26 03:01:26,966 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 03:01:26,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-26 03:01:26,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-26 03:01:26,967 INFO L87 Difference]: Start difference. First operand 130 states and 170 transitions. Second operand 5 states. [2019-11-26 03:01:27,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 03:01:27,191 INFO L93 Difference]: Finished difference Result 156 states and 196 transitions. [2019-11-26 03:01:27,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-26 03:01:27,191 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-11-26 03:01:27,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 03:01:27,192 INFO L225 Difference]: With dead ends: 156 [2019-11-26 03:01:27,193 INFO L226 Difference]: Without dead ends: 151 [2019-11-26 03:01:27,193 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-11-26 03:01:27,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2019-11-26 03:01:27,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 144. [2019-11-26 03:01:27,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2019-11-26 03:01:27,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 184 transitions. [2019-11-26 03:01:27,211 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 184 transitions. Word has length 22 [2019-11-26 03:01:27,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 03:01:27,212 INFO L462 AbstractCegarLoop]: Abstraction has 144 states and 184 transitions. [2019-11-26 03:01:27,212 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-26 03:01:27,212 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 184 transitions. [2019-11-26 03:01:27,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-26 03:01:27,213 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 03:01:27,213 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 03:01:27,213 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 03:01:27,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 03:01:27,214 INFO L82 PathProgramCache]: Analyzing trace with hash -1764070242, now seen corresponding path program 1 times [2019-11-26 03:01:27,214 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 03:01:27,214 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785409762] [2019-11-26 03:01:27,214 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 03:01:27,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 03:01:27,245 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 03:01:27,245 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785409762] [2019-11-26 03:01:27,246 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 03:01:27,246 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 03:01:27,246 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169556425] [2019-11-26 03:01:27,246 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-26 03:01:27,246 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 03:01:27,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-26 03:01:27,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 03:01:27,247 INFO L87 Difference]: Start difference. First operand 144 states and 184 transitions. Second operand 3 states. [2019-11-26 03:01:27,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 03:01:27,330 INFO L93 Difference]: Finished difference Result 148 states and 189 transitions. [2019-11-26 03:01:27,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 03:01:27,331 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-11-26 03:01:27,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 03:01:27,332 INFO L225 Difference]: With dead ends: 148 [2019-11-26 03:01:27,332 INFO L226 Difference]: Without dead ends: 146 [2019-11-26 03:01:27,332 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 03:01:27,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2019-11-26 03:01:27,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 146. [2019-11-26 03:01:27,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-11-26 03:01:27,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 187 transitions. [2019-11-26 03:01:27,344 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 187 transitions. Word has length 22 [2019-11-26 03:01:27,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 03:01:27,345 INFO L462 AbstractCegarLoop]: Abstraction has 146 states and 187 transitions. [2019-11-26 03:01:27,345 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-26 03:01:27,345 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 187 transitions. [2019-11-26 03:01:27,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-26 03:01:27,346 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 03:01:27,346 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 03:01:27,346 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 03:01:27,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 03:01:27,347 INFO L82 PathProgramCache]: Analyzing trace with hash -76626783, now seen corresponding path program 1 times [2019-11-26 03:01:27,347 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 03:01:27,347 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483440237] [2019-11-26 03:01:27,347 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 03:01:27,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 03:01:27,371 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 03:01:27,372 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483440237] [2019-11-26 03:01:27,372 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 03:01:27,372 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 03:01:27,372 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078094327] [2019-11-26 03:01:27,372 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-26 03:01:27,372 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 03:01:27,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-26 03:01:27,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 03:01:27,373 INFO L87 Difference]: Start difference. First operand 146 states and 187 transitions. Second operand 3 states. [2019-11-26 03:01:27,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 03:01:27,463 INFO L93 Difference]: Finished difference Result 160 states and 202 transitions. [2019-11-26 03:01:27,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 03:01:27,464 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-11-26 03:01:27,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 03:01:27,465 INFO L225 Difference]: With dead ends: 160 [2019-11-26 03:01:27,465 INFO L226 Difference]: Without dead ends: 140 [2019-11-26 03:01:27,465 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 03:01:27,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2019-11-26 03:01:27,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2019-11-26 03:01:27,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2019-11-26 03:01:27,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 174 transitions. [2019-11-26 03:01:27,476 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 174 transitions. Word has length 23 [2019-11-26 03:01:27,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 03:01:27,476 INFO L462 AbstractCegarLoop]: Abstraction has 140 states and 174 transitions. [2019-11-26 03:01:27,477 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-26 03:01:27,477 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 174 transitions. [2019-11-26 03:01:27,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-26 03:01:27,478 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 03:01:27,478 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 03:01:27,478 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 03:01:27,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 03:01:27,478 INFO L82 PathProgramCache]: Analyzing trace with hash 674304095, now seen corresponding path program 1 times [2019-11-26 03:01:27,479 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 03:01:27,479 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193956576] [2019-11-26 03:01:27,479 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 03:01:27,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 03:01:27,508 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 03:01:27,508 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193956576] [2019-11-26 03:01:27,509 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 03:01:27,509 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 03:01:27,509 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669346206] [2019-11-26 03:01:27,509 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 03:01:27,509 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 03:01:27,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 03:01:27,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 03:01:27,510 INFO L87 Difference]: Start difference. First operand 140 states and 174 transitions. Second operand 4 states. [2019-11-26 03:01:27,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 03:01:27,614 INFO L93 Difference]: Finished difference Result 146 states and 179 transitions. [2019-11-26 03:01:27,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 03:01:27,614 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2019-11-26 03:01:27,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 03:01:27,615 INFO L225 Difference]: With dead ends: 146 [2019-11-26 03:01:27,616 INFO L226 Difference]: Without dead ends: 126 [2019-11-26 03:01:27,616 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-11-26 03:01:27,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2019-11-26 03:01:27,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2019-11-26 03:01:27,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2019-11-26 03:01:27,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 153 transitions. [2019-11-26 03:01:27,625 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 153 transitions. Word has length 23 [2019-11-26 03:01:27,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 03:01:27,626 INFO L462 AbstractCegarLoop]: Abstraction has 126 states and 153 transitions. [2019-11-26 03:01:27,626 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 03:01:27,626 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 153 transitions. [2019-11-26 03:01:27,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-26 03:01:27,627 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 03:01:27,627 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 03:01:27,628 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 03:01:27,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 03:01:27,628 INFO L82 PathProgramCache]: Analyzing trace with hash -877819429, now seen corresponding path program 1 times [2019-11-26 03:01:27,628 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 03:01:27,628 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219590258] [2019-11-26 03:01:27,629 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 03:01:27,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 03:01:27,661 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 03:01:27,662 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219590258] [2019-11-26 03:01:27,662 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 03:01:27,662 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 03:01:27,662 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442028396] [2019-11-26 03:01:27,662 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 03:01:27,662 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 03:01:27,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 03:01:27,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 03:01:27,663 INFO L87 Difference]: Start difference. First operand 126 states and 153 transitions. Second operand 4 states. [2019-11-26 03:01:27,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 03:01:27,751 INFO L93 Difference]: Finished difference Result 146 states and 173 transitions. [2019-11-26 03:01:27,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 03:01:27,752 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2019-11-26 03:01:27,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 03:01:27,752 INFO L225 Difference]: With dead ends: 146 [2019-11-26 03:01:27,753 INFO L226 Difference]: Without dead ends: 126 [2019-11-26 03:01:27,753 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-11-26 03:01:27,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2019-11-26 03:01:27,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2019-11-26 03:01:27,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2019-11-26 03:01:27,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 146 transitions. [2019-11-26 03:01:27,764 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 146 transitions. Word has length 23 [2019-11-26 03:01:27,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 03:01:27,764 INFO L462 AbstractCegarLoop]: Abstraction has 126 states and 146 transitions. [2019-11-26 03:01:27,764 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 03:01:27,764 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 146 transitions. [2019-11-26 03:01:27,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-26 03:01:27,765 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 03:01:27,765 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 03:01:27,765 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 03:01:27,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 03:01:27,766 INFO L82 PathProgramCache]: Analyzing trace with hash 1140738629, now seen corresponding path program 1 times [2019-11-26 03:01:27,766 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 03:01:27,766 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103608106] [2019-11-26 03:01:27,766 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 03:01:27,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 03:01:27,788 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 03:01:27,788 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103608106] [2019-11-26 03:01:27,788 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 03:01:27,788 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 03:01:27,788 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510277013] [2019-11-26 03:01:27,789 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-26 03:01:27,789 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 03:01:27,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-26 03:01:27,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 03:01:27,789 INFO L87 Difference]: Start difference. First operand 126 states and 146 transitions. Second operand 3 states. [2019-11-26 03:01:27,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 03:01:27,803 INFO L93 Difference]: Finished difference Result 131 states and 150 transitions. [2019-11-26 03:01:27,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 03:01:27,803 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-11-26 03:01:27,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 03:01:27,804 INFO L225 Difference]: With dead ends: 131 [2019-11-26 03:01:27,804 INFO L226 Difference]: Without dead ends: 121 [2019-11-26 03:01:27,805 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 03:01:27,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-11-26 03:01:27,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2019-11-26 03:01:27,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-11-26 03:01:27,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 140 transitions. [2019-11-26 03:01:27,816 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 140 transitions. Word has length 23 [2019-11-26 03:01:27,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 03:01:27,816 INFO L462 AbstractCegarLoop]: Abstraction has 121 states and 140 transitions. [2019-11-26 03:01:27,816 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-26 03:01:27,816 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 140 transitions. [2019-11-26 03:01:27,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-26 03:01:27,817 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 03:01:27,817 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 03:01:27,818 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 03:01:27,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 03:01:27,818 INFO L82 PathProgramCache]: Analyzing trace with hash 1856621795, now seen corresponding path program 1 times [2019-11-26 03:01:27,818 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 03:01:27,818 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804261166] [2019-11-26 03:01:27,819 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 03:01:27,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 03:01:27,852 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 03:01:27,853 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804261166] [2019-11-26 03:01:27,853 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 03:01:27,853 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-26 03:01:27,853 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153363870] [2019-11-26 03:01:27,853 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 03:01:27,854 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 03:01:27,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 03:01:27,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 03:01:27,854 INFO L87 Difference]: Start difference. First operand 121 states and 140 transitions. Second operand 4 states. [2019-11-26 03:01:27,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 03:01:27,907 INFO L93 Difference]: Finished difference Result 132 states and 151 transitions. [2019-11-26 03:01:27,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-26 03:01:27,907 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2019-11-26 03:01:27,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 03:01:27,908 INFO L225 Difference]: With dead ends: 132 [2019-11-26 03:01:27,908 INFO L226 Difference]: Without dead ends: 113 [2019-11-26 03:01:27,909 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-11-26 03:01:27,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-11-26 03:01:27,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2019-11-26 03:01:27,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-11-26 03:01:27,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 131 transitions. [2019-11-26 03:01:27,918 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 131 transitions. Word has length 24 [2019-11-26 03:01:27,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 03:01:27,918 INFO L462 AbstractCegarLoop]: Abstraction has 113 states and 131 transitions. [2019-11-26 03:01:27,918 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 03:01:27,918 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 131 transitions. [2019-11-26 03:01:27,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-26 03:01:27,919 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 03:01:27,919 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 03:01:27,919 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 03:01:27,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 03:01:27,919 INFO L82 PathProgramCache]: Analyzing trace with hash -1426253951, now seen corresponding path program 1 times [2019-11-26 03:01:27,920 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 03:01:27,920 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093284334] [2019-11-26 03:01:27,920 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 03:01:27,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 03:01:27,948 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 03:01:27,948 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093284334] [2019-11-26 03:01:27,948 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 03:01:27,948 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-26 03:01:27,949 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611958312] [2019-11-26 03:01:27,949 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 03:01:27,949 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 03:01:27,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 03:01:27,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 03:01:27,950 INFO L87 Difference]: Start difference. First operand 113 states and 131 transitions. Second operand 4 states. [2019-11-26 03:01:28,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 03:01:28,028 INFO L93 Difference]: Finished difference Result 124 states and 142 transitions. [2019-11-26 03:01:28,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-26 03:01:28,028 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2019-11-26 03:01:28,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 03:01:28,029 INFO L225 Difference]: With dead ends: 124 [2019-11-26 03:01:28,029 INFO L226 Difference]: Without dead ends: 87 [2019-11-26 03:01:28,030 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-11-26 03:01:28,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-11-26 03:01:28,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2019-11-26 03:01:28,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-11-26 03:01:28,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 99 transitions. [2019-11-26 03:01:28,037 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 99 transitions. Word has length 24 [2019-11-26 03:01:28,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 03:01:28,037 INFO L462 AbstractCegarLoop]: Abstraction has 87 states and 99 transitions. [2019-11-26 03:01:28,037 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 03:01:28,037 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 99 transitions. [2019-11-26 03:01:28,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-26 03:01:28,038 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 03:01:28,038 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 03:01:28,038 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 03:01:28,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 03:01:28,038 INFO L82 PathProgramCache]: Analyzing trace with hash -165613475, now seen corresponding path program 1 times [2019-11-26 03:01:28,038 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 03:01:28,039 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399888415] [2019-11-26 03:01:28,039 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 03:01:28,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 03:01:28,075 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 03:01:28,075 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399888415] [2019-11-26 03:01:28,075 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 03:01:28,075 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-26 03:01:28,075 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532630179] [2019-11-26 03:01:28,076 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 03:01:28,076 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 03:01:28,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 03:01:28,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-26 03:01:28,076 INFO L87 Difference]: Start difference. First operand 87 states and 99 transitions. Second operand 4 states. [2019-11-26 03:01:28,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 03:01:28,121 INFO L93 Difference]: Finished difference Result 87 states and 99 transitions. [2019-11-26 03:01:28,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 03:01:28,121 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-11-26 03:01:28,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 03:01:28,122 INFO L225 Difference]: With dead ends: 87 [2019-11-26 03:01:28,122 INFO L226 Difference]: Without dead ends: 68 [2019-11-26 03:01:28,122 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-26 03:01:28,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-11-26 03:01:28,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2019-11-26 03:01:28,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-11-26 03:01:28,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 80 transitions. [2019-11-26 03:01:28,129 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 80 transitions. Word has length 25 [2019-11-26 03:01:28,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 03:01:28,129 INFO L462 AbstractCegarLoop]: Abstraction has 68 states and 80 transitions. [2019-11-26 03:01:28,129 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 03:01:28,130 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 80 transitions. [2019-11-26 03:01:28,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-26 03:01:28,130 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 03:01:28,130 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 03:01:28,131 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 03:01:28,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 03:01:28,131 INFO L82 PathProgramCache]: Analyzing trace with hash 878232028, now seen corresponding path program 1 times [2019-11-26 03:01:28,131 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 03:01:28,131 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051541277] [2019-11-26 03:01:28,131 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 03:01:28,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 03:01:28,163 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 03:01:28,163 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051541277] [2019-11-26 03:01:28,163 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 03:01:28,163 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-26 03:01:28,163 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818140294] [2019-11-26 03:01:28,164 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-26 03:01:28,164 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 03:01:28,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-26 03:01:28,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-26 03:01:28,164 INFO L87 Difference]: Start difference. First operand 68 states and 80 transitions. Second operand 5 states. [2019-11-26 03:01:28,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 03:01:28,241 INFO L93 Difference]: Finished difference Result 80 states and 92 transitions. [2019-11-26 03:01:28,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-26 03:01:28,242 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-11-26 03:01:28,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 03:01:28,242 INFO L225 Difference]: With dead ends: 80 [2019-11-26 03:01:28,242 INFO L226 Difference]: Without dead ends: 52 [2019-11-26 03:01:28,243 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 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-11-26 03:01:28,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-11-26 03:01:28,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2019-11-26 03:01:28,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-11-26 03:01:28,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 62 transitions. [2019-11-26 03:01:28,247 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 62 transitions. Word has length 26 [2019-11-26 03:01:28,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 03:01:28,247 INFO L462 AbstractCegarLoop]: Abstraction has 52 states and 62 transitions. [2019-11-26 03:01:28,248 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-26 03:01:28,248 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 62 transitions. [2019-11-26 03:01:28,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-26 03:01:28,249 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 03:01:28,249 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 03:01:28,249 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 03:01:28,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 03:01:28,249 INFO L82 PathProgramCache]: Analyzing trace with hash -1669883762, now seen corresponding path program 1 times [2019-11-26 03:01:28,250 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 03:01:28,250 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752591214] [2019-11-26 03:01:28,250 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 03:01:28,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-26 03:01:28,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-26 03:01:28,297 INFO L174 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2019-11-26 03:01:28,297 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-26 03:01:28,376 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.11 03:01:28 BoogieIcfgContainer [2019-11-26 03:01:28,380 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-26 03:01:28,381 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-26 03:01:28,381 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-26 03:01:28,381 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-26 03:01:28,382 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 03:01:24" (3/4) ... [2019-11-26 03:01:28,384 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-26 03:01:28,508 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_9a40c928-5ffb-4778-afd4-681ccb5e7905/bin/utaipan/witness.graphml [2019-11-26 03:01:28,509 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-26 03:01:28,511 INFO L168 Benchmark]: Toolchain (without parser) took 6578.90 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 223.3 MB). Free memory was 944.8 MB in the beginning and 945.3 MB in the end (delta: -515.3 kB). Peak memory consumption was 222.8 MB. Max. memory is 11.5 GB. [2019-11-26 03:01:28,512 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-26 03:01:28,512 INFO L168 Benchmark]: CACSL2BoogieTranslator took 593.18 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 174.1 MB). Free memory was 939.4 MB in the beginning and 1.2 GB in the end (delta: -222.6 MB). Peak memory consumption was 23.4 MB. Max. memory is 11.5 GB. [2019-11-26 03:01:28,512 INFO L168 Benchmark]: Boogie Procedure Inliner took 100.02 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-11-26 03:01:28,513 INFO L168 Benchmark]: Boogie Preprocessor took 105.52 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-26 03:01:28,513 INFO L168 Benchmark]: RCFGBuilder took 2116.88 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 917.4 MB in the end (delta: 233.9 MB). Peak memory consumption was 233.9 MB. Max. memory is 11.5 GB. [2019-11-26 03:01:28,513 INFO L168 Benchmark]: TraceAbstraction took 3531.12 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 49.3 MB). Free memory was 917.4 MB in the beginning and 959.7 MB in the end (delta: -42.3 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. [2019-11-26 03:01:28,514 INFO L168 Benchmark]: Witness Printer took 128.16 ms. Allocated memory is still 1.3 GB. Free memory was 959.7 MB in the beginning and 945.3 MB in the end (delta: 14.4 MB). Peak memory consumption was 14.4 MB. Max. memory is 11.5 GB. [2019-11-26 03:01:28,515 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 593.18 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 174.1 MB). Free memory was 939.4 MB in the beginning and 1.2 GB in the end (delta: -222.6 MB). Peak memory consumption was 23.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 100.02 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 105.52 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 2116.88 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 917.4 MB in the end (delta: 233.9 MB). Peak memory consumption was 233.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 3531.12 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 49.3 MB). Free memory was 917.4 MB in the beginning and 959.7 MB in the end (delta: -42.3 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. * Witness Printer took 128.16 ms. Allocated memory is still 1.3 GB. Free memory was 959.7 MB in the beginning and 945.3 MB in the end (delta: 14.4 MB). Peak memory consumption was 14.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1011]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L21] int KernelMode ; [L22] int Executive ; [L23] int DevicePowerState ; [L24] int s ; [L25] int UNLOADED ; [L26] int NP ; [L27] int DC ; [L28] int SKIP1 ; [L29] int SKIP2 ; [L30] int MPR1 ; [L31] int MPR3 ; [L32] int IPC ; [L33] int pended ; [L34] int compFptr ; [L35] int compRegistered ; [L36] int lowerDriverReturn ; [L37] int setEventCalled ; [L38] int customIrp ; [L39] int myStatus ; [L292] int status ; [L293] int irp = __VERIFIER_nondet_int() ; [L294] int pirp ; [L295] int pirp__IoStatus__Status ; [L296] int irp_choice = __VERIFIER_nondet_int() ; [L297] int devobj = __VERIFIER_nondet_int() ; [L298] int __cil_tmp8 ; [L300] KernelMode = 0 [L301] Executive = 0 [L302] DevicePowerState = 1 [L303] s = 0 [L304] UNLOADED = 0 [L305] NP = 0 [L306] DC = 0 [L307] SKIP1 = 0 [L308] SKIP2 = 0 [L309] MPR1 = 0 [L310] MPR3 = 0 [L311] IPC = 0 [L312] pended = 0 [L313] compFptr = 0 [L314] compRegistered = 0 [L315] lowerDriverReturn = 0 [L316] setEventCalled = 0 [L317] customIrp = 0 [L318] myStatus = 0 [L322] status = 0 [L323] pirp = irp [L59] UNLOADED = 0 [L60] NP = 1 [L61] DC = 2 [L62] SKIP1 = 3 [L63] SKIP2 = 4 [L64] MPR1 = 5 [L65] MPR3 = 6 [L66] IPC = 7 [L67] s = UNLOADED [L68] pended = 0 [L69] compFptr = 0 [L70] compRegistered = 0 [L71] lowerDriverReturn = 0 [L72] setEventCalled = 0 [L73] customIrp = 0 VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=0, s=0, setEventCalled=0, SKIP1=3, SKIP2=4, UNLOADED=0] [L326] COND TRUE status >= 0 [L327] s = NP [L328] customIrp = 0 [L329] setEventCalled = customIrp [L330] lowerDriverReturn = setEventCalled [L331] compRegistered = lowerDriverReturn [L332] pended = compRegistered [L333] pirp__IoStatus__Status = 0 [L334] myStatus = 0 [L335] COND FALSE !(irp_choice == 0) [L45] s = NP [L46] pended = 0 [L47] compFptr = 0 [L48] compRegistered = 0 [L49] lowerDriverReturn = 0 [L50] setEventCalled = 0 [L51] customIrp = 0 VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, UNLOADED=0] [L343] COND FALSE !(status < 0) [L347] int tmp_ndt_1; [L348] tmp_ndt_1 = __VERIFIER_nondet_int() [L349] COND FALSE !(tmp_ndt_1 == 0) [L352] int tmp_ndt_2; [L353] tmp_ndt_2 = __VERIFIER_nondet_int() [L354] COND FALSE !(tmp_ndt_2 == 1) [L357] int tmp_ndt_3; [L358] tmp_ndt_3 = __VERIFIER_nondet_int() [L359] COND TRUE tmp_ndt_3 == 3 [L78] int devExt ; [L79] int irpStack ; [L80] int status ; [L81] int event = __VERIFIER_nondet_int() ; [L82] int DeviceObject__DeviceExtension = __VERIFIER_nondet_int() ; [L83] int Irp__Tail__Overlay__CurrentStackLocation = __VERIFIER_nondet_int() ; [L84] int irpStack__MinorFunction = __VERIFIER_nondet_int() ; [L85] int devExt__TopOfStack = __VERIFIER_nondet_int() ; [L86] int devExt__Started ; [L87] int devExt__Removed ; [L88] int devExt__SurpriseRemoved ; [L89] int Irp__IoStatus__Status ; [L90] int Irp__IoStatus__Information ; [L91] int Irp__CurrentLocation = __VERIFIER_nondet_int() ; [L92] int irpSp ; [L93] int nextIrpSp ; [L94] int nextIrpSp__Control ; [L95] int irpSp___0 ; [L96] int irpSp__Context ; [L97] int irpSp__Control ; [L98] long __cil_tmp23 ; [L101] status = 0 [L102] devExt = DeviceObject__DeviceExtension [L103] irpStack = Irp__Tail__Overlay__CurrentStackLocation VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, UNLOADED=0] [L104] COND FALSE !(irpStack__MinorFunction == 0) VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, UNLOADED=0] [L107] COND FALSE !(irpStack__MinorFunction == 23) VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, UNLOADED=0] [L110] COND TRUE irpStack__MinorFunction == 2 [L234] devExt__Removed = 1 VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, UNLOADED=0] [L235] COND TRUE s == NP [L236] s = SKIP1 VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=0, s=3, setEventCalled=0, SKIP1=3, SKIP2=4, UNLOADED=0] [L243] Irp__CurrentLocation ++ [L244] Irp__Tail__Overlay__CurrentStackLocation ++ [L481] int returnVal2 ; [L482] int compRetStatus ; [L483] int lcontext = __VERIFIER_nondet_int() ; [L484] long long __cil_tmp7 ; VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=0, s=3, setEventCalled=0, SKIP1=3, SKIP2=4, UNLOADED=0] [L487] COND FALSE !(\read(compRegistered)) VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=0, s=3, setEventCalled=0, SKIP1=3, SKIP2=4, UNLOADED=0] [L500] int tmp_ndt_6; [L501] tmp_ndt_6 = __VERIFIER_nondet_int() [L502] COND FALSE !(tmp_ndt_6 == 0) [L505] int tmp_ndt_7; [L506] tmp_ndt_7 = __VERIFIER_nondet_int() [L507] COND FALSE !(tmp_ndt_7 == 1) [L519] returnVal2 = 259 VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=0, s=3, setEventCalled=0, SKIP1=3, SKIP2=4, UNLOADED=0] [L526] COND FALSE !(s == NP) VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=0, s=3, setEventCalled=0, SKIP1=3, SKIP2=4, UNLOADED=0] [L530] COND FALSE !(s == MPR1) VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=0, s=3, setEventCalled=0, SKIP1=3, SKIP2=4, UNLOADED=0] [L539] COND TRUE s == SKIP1 [L540] s = SKIP2 [L541] lowerDriverReturn = returnVal2 VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=259, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=0, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, UNLOADED=0] [L549] return (returnVal2); [L246] status = 0 VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=259, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=0, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, UNLOADED=0] [L288] return (status); [L386] status = KbFilter_PnP(devobj, pirp) [L410] COND FALSE !(pended == 1) VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=259, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=0, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, UNLOADED=0] [L418] COND FALSE !(pended == 1) VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=259, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=0, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, UNLOADED=0] [L426] COND TRUE s != UNLOADED VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=259, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=0, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, UNLOADED=0] [L427] COND TRUE status != -1 VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=259, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=0, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, UNLOADED=0] [L428] COND FALSE !(s != SKIP2) VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=259, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=0, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, UNLOADED=0] [L438] COND FALSE !(pended == 1) VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=259, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=0, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, UNLOADED=0] [L445] COND FALSE !(s == DC) VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=259, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=0, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, UNLOADED=0] [L450] COND TRUE status != lowerDriverReturn VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=259, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=0, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, UNLOADED=0] [L1011] __VERIFIER_error() VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=259, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=0, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, UNLOADED=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 202 locations, 30 error locations. Result: UNSAFE, OverallTime: 3.4s, OverallIterations: 21, TraceHistogramMax: 1, AutomataDifference: 1.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 3019 SDtfs, 1792 SDslu, 2142 SDs, 0 SdLazy, 1151 SolverSat, 154 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 77 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=202occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 20 MinimizatonAttempts, 101 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 423 NumberOfCodeBlocks, 423 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 376 ConstructedInterpolants, 0 QuantifiedInterpolants, 17227 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 20 InterpolantComputations, 20 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...