./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ntdrivers-simplified/kbfiltr_simpl1.cil.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_bf22354f-9612-4a8e-8a1d-a2766b76c0f3/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_bf22354f-9612-4a8e-8a1d-a2766b76c0f3/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_bf22354f-9612-4a8e-8a1d-a2766b76c0f3/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_bf22354f-9612-4a8e-8a1d-a2766b76c0f3/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/ntdrivers-simplified/kbfiltr_simpl1.cil.c -s /tmp/vcloud-vcloud-master/worker/run_dir_bf22354f-9612-4a8e-8a1d-a2766b76c0f3/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_bf22354f-9612-4a8e-8a1d-a2766b76c0f3/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 a3956b9d522359ca85af7edde8f84196cd7ca984 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-6b5699a [2019-11-26 02:29:15,788 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-26 02:29:15,790 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-26 02:29:15,804 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-26 02:29:15,805 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-26 02:29:15,806 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-26 02:29:15,808 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-26 02:29:15,816 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-26 02:29:15,820 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-26 02:29:15,824 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-26 02:29:15,826 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-26 02:29:15,827 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-26 02:29:15,827 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-26 02:29:15,829 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-26 02:29:15,830 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-26 02:29:15,831 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-26 02:29:15,832 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-26 02:29:15,833 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-26 02:29:15,835 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-26 02:29:15,839 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-26 02:29:15,843 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-26 02:29:15,846 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-26 02:29:15,847 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-26 02:29:15,848 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-26 02:29:15,851 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-26 02:29:15,851 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-26 02:29:15,852 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-26 02:29:15,853 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-26 02:29:15,854 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-26 02:29:15,854 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-26 02:29:15,854 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-26 02:29:15,855 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-26 02:29:15,856 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-26 02:29:15,856 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-26 02:29:15,857 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-26 02:29:15,857 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-26 02:29:15,858 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-26 02:29:15,858 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-26 02:29:15,858 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-26 02:29:15,859 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-26 02:29:15,859 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-26 02:29:15,860 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_bf22354f-9612-4a8e-8a1d-a2766b76c0f3/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-11-26 02:29:15,872 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-26 02:29:15,873 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-26 02:29:15,873 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-26 02:29:15,873 INFO L138 SettingsManager]: * User list type=DISABLED [2019-11-26 02:29:15,874 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-11-26 02:29:15,874 INFO L138 SettingsManager]: * Explicit value domain=true [2019-11-26 02:29:15,874 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-11-26 02:29:15,874 INFO L138 SettingsManager]: * Octagon Domain=false [2019-11-26 02:29:15,874 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-11-26 02:29:15,874 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-11-26 02:29:15,875 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-11-26 02:29:15,875 INFO L138 SettingsManager]: * Interval Domain=false [2019-11-26 02:29:15,875 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-11-26 02:29:15,875 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-11-26 02:29:15,875 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-11-26 02:29:15,876 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-26 02:29:15,876 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-26 02:29:15,876 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-26 02:29:15,876 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-26 02:29:15,877 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-26 02:29:15,877 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-26 02:29:15,877 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-26 02:29:15,877 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-26 02:29:15,877 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-26 02:29:15,877 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-26 02:29:15,878 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-26 02:29:15,878 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-26 02:29:15,878 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-26 02:29:15,878 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-26 02:29:15,878 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-26 02:29:15,879 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-26 02:29:15,879 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-26 02:29:15,879 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-26 02:29:15,879 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-11-26 02:29:15,879 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-26 02:29:15,880 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-26 02:29:15,880 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-26 02:29:15,880 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_bf22354f-9612-4a8e-8a1d-a2766b76c0f3/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 -> a3956b9d522359ca85af7edde8f84196cd7ca984 [2019-11-26 02:29:16,051 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-26 02:29:16,066 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-26 02:29:16,068 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-26 02:29:16,070 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-26 02:29:16,070 INFO L275 PluginConnector]: CDTParser initialized [2019-11-26 02:29:16,070 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_bf22354f-9612-4a8e-8a1d-a2766b76c0f3/bin/utaipan/../../sv-benchmarks/c/ntdrivers-simplified/kbfiltr_simpl1.cil.c [2019-11-26 02:29:16,125 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_bf22354f-9612-4a8e-8a1d-a2766b76c0f3/bin/utaipan/data/b62446ca9/cd7a46d8d44b43f587ef53005b9323f1/FLAG70a8ea476 [2019-11-26 02:29:16,522 INFO L306 CDTParser]: Found 1 translation units. [2019-11-26 02:29:16,523 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_bf22354f-9612-4a8e-8a1d-a2766b76c0f3/sv-benchmarks/c/ntdrivers-simplified/kbfiltr_simpl1.cil.c [2019-11-26 02:29:16,531 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_bf22354f-9612-4a8e-8a1d-a2766b76c0f3/bin/utaipan/data/b62446ca9/cd7a46d8d44b43f587ef53005b9323f1/FLAG70a8ea476 [2019-11-26 02:29:16,541 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_bf22354f-9612-4a8e-8a1d-a2766b76c0f3/bin/utaipan/data/b62446ca9/cd7a46d8d44b43f587ef53005b9323f1 [2019-11-26 02:29:16,543 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-26 02:29:16,544 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-26 02:29:16,545 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-26 02:29:16,545 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-26 02:29:16,548 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-26 02:29:16,549 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 02:29:16" (1/1) ... [2019-11-26 02:29:16,551 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@572511bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:29:16, skipping insertion in model container [2019-11-26 02:29:16,551 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 02:29:16" (1/1) ... [2019-11-26 02:29:16,558 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-26 02:29:16,597 INFO L179 MainTranslator]: Built tables and reachable declarations [2019-11-26 02:29:16,939 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-26 02:29:16,948 INFO L201 MainTranslator]: Completed pre-run [2019-11-26 02:29:16,989 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-26 02:29:17,006 INFO L205 MainTranslator]: Completed translation [2019-11-26 02:29:17,006 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:29:17 WrapperNode [2019-11-26 02:29:17,006 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-26 02:29:17,007 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-26 02:29:17,007 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-26 02:29:17,007 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-26 02:29:17,013 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:29:17" (1/1) ... [2019-11-26 02:29:17,021 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:29:17" (1/1) ... [2019-11-26 02:29:17,069 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-26 02:29:17,069 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-26 02:29:17,069 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-26 02:29:17,070 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-26 02:29:17,079 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:29:17" (1/1) ... [2019-11-26 02:29:17,079 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:29:17" (1/1) ... [2019-11-26 02:29:17,095 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:29:17" (1/1) ... [2019-11-26 02:29:17,095 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:29:17" (1/1) ... [2019-11-26 02:29:17,106 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:29:17" (1/1) ... [2019-11-26 02:29:17,118 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:29:17" (1/1) ... [2019-11-26 02:29:17,121 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:29:17" (1/1) ... [2019-11-26 02:29:17,125 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-26 02:29:17,126 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-26 02:29:17,126 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-26 02:29:17,126 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-26 02:29:17,127 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:29:17" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_bf22354f-9612-4a8e-8a1d-a2766b76c0f3/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 02:29:17,180 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-26 02:29:17,181 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-26 02:29:17,293 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-26 02:29:17,298 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-26 02:29:17,304 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-26 02:29:17,307 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-26 02:29:17,311 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-26 02:29:17,316 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-26 02:29:17,319 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-26 02:29:17,980 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##76: assume !false; [2019-11-26 02:29:17,981 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##75: assume false; [2019-11-26 02:29:17,981 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##184: assume false; [2019-11-26 02:29:17,981 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##185: assume !false; [2019-11-26 02:29:17,982 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##58: assume !false; [2019-11-26 02:29:17,982 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##57: assume false; [2019-11-26 02:29:17,982 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##131: assume !false; [2019-11-26 02:29:17,982 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##130: assume false; [2019-11-26 02:29:17,983 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##14: assume !false; [2019-11-26 02:29:17,983 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##13: assume false; [2019-11-26 02:29:17,983 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##158: assume !false; [2019-11-26 02:29:17,983 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##157: assume false; [2019-11-26 02:29:17,983 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##106: assume !false; [2019-11-26 02:29:17,983 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##105: assume false; [2019-11-26 02:29:18,495 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-26 02:29:18,495 INFO L284 CfgBuilder]: Removed 78 assume(true) statements. [2019-11-26 02:29:18,496 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 02:29:18 BoogieIcfgContainer [2019-11-26 02:29:18,496 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-26 02:29:18,497 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-26 02:29:18,497 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-26 02:29:18,500 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-26 02:29:18,500 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.11 02:29:16" (1/3) ... [2019-11-26 02:29:18,501 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32c76b66 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 02:29:18, skipping insertion in model container [2019-11-26 02:29:18,501 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:29:17" (2/3) ... [2019-11-26 02:29:18,501 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32c76b66 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 02:29:18, skipping insertion in model container [2019-11-26 02:29:18,501 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 02:29:18" (3/3) ... [2019-11-26 02:29:18,503 INFO L109 eAbstractionObserver]: Analyzing ICFG kbfiltr_simpl1.cil.c [2019-11-26 02:29:18,512 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-26 02:29:18,518 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 16 error locations. [2019-11-26 02:29:18,528 INFO L249 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2019-11-26 02:29:18,559 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-26 02:29:18,559 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-26 02:29:18,559 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-26 02:29:18,559 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-26 02:29:18,559 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-26 02:29:18,559 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-26 02:29:18,560 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-26 02:29:18,560 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-26 02:29:18,587 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states. [2019-11-26 02:29:18,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-11-26 02:29:18,592 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:29:18,593 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:29:18,594 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:29:18,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:29:18,599 INFO L82 PathProgramCache]: Analyzing trace with hash 671809730, now seen corresponding path program 1 times [2019-11-26 02:29:18,608 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:29:18,608 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150246152] [2019-11-26 02:29:18,608 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:29:18,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:29:18,797 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 02:29:18,797 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150246152] [2019-11-26 02:29:18,798 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:29:18,798 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 02:29:18,800 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341329079] [2019-11-26 02:29:18,805 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-26 02:29:18,806 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:29:18,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-26 02:29:18,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:29:18,820 INFO L87 Difference]: Start difference. First operand 99 states. Second operand 3 states. [2019-11-26 02:29:19,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:29:19,001 INFO L93 Difference]: Finished difference Result 182 states and 266 transitions. [2019-11-26 02:29:19,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 02:29:19,003 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-11-26 02:29:19,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:29:19,015 INFO L225 Difference]: With dead ends: 182 [2019-11-26 02:29:19,015 INFO L226 Difference]: Without dead ends: 91 [2019-11-26 02:29:19,019 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 02:29:19,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-11-26 02:29:19,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2019-11-26 02:29:19,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-11-26 02:29:19,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 114 transitions. [2019-11-26 02:29:19,078 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 114 transitions. Word has length 7 [2019-11-26 02:29:19,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:29:19,079 INFO L462 AbstractCegarLoop]: Abstraction has 91 states and 114 transitions. [2019-11-26 02:29:19,079 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-26 02:29:19,079 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 114 transitions. [2019-11-26 02:29:19,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-11-26 02:29:19,080 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:29:19,080 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:29:19,081 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:29:19,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:29:19,081 INFO L82 PathProgramCache]: Analyzing trace with hash -648728712, now seen corresponding path program 1 times [2019-11-26 02:29:19,081 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:29:19,082 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341080890] [2019-11-26 02:29:19,082 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:29:19,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:29:19,149 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 02:29:19,149 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341080890] [2019-11-26 02:29:19,149 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:29:19,150 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 02:29:19,150 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517092940] [2019-11-26 02:29:19,151 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-26 02:29:19,151 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:29:19,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-26 02:29:19,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:29:19,152 INFO L87 Difference]: Start difference. First operand 91 states and 114 transitions. Second operand 3 states. [2019-11-26 02:29:19,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:29:19,183 INFO L93 Difference]: Finished difference Result 156 states and 195 transitions. [2019-11-26 02:29:19,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 02:29:19,184 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2019-11-26 02:29:19,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:29:19,186 INFO L225 Difference]: With dead ends: 156 [2019-11-26 02:29:19,186 INFO L226 Difference]: Without dead ends: 110 [2019-11-26 02:29:19,187 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 02:29:19,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-11-26 02:29:19,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 80. [2019-11-26 02:29:19,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-11-26 02:29:19,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 100 transitions. [2019-11-26 02:29:19,197 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 100 transitions. Word has length 8 [2019-11-26 02:29:19,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:29:19,198 INFO L462 AbstractCegarLoop]: Abstraction has 80 states and 100 transitions. [2019-11-26 02:29:19,198 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-26 02:29:19,198 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 100 transitions. [2019-11-26 02:29:19,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-26 02:29:19,199 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:29:19,199 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:29:19,200 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:29:19,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:29:19,200 INFO L82 PathProgramCache]: Analyzing trace with hash 207254872, now seen corresponding path program 1 times [2019-11-26 02:29:19,201 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:29:19,201 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782446863] [2019-11-26 02:29:19,201 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:29:19,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:29:19,235 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 02:29:19,236 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782446863] [2019-11-26 02:29:19,236 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:29:19,236 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-26 02:29:19,236 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227639108] [2019-11-26 02:29:19,237 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-26 02:29:19,237 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:29:19,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-26 02:29:19,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:29:19,238 INFO L87 Difference]: Start difference. First operand 80 states and 100 transitions. Second operand 3 states. [2019-11-26 02:29:19,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:29:19,252 INFO L93 Difference]: Finished difference Result 93 states and 116 transitions. [2019-11-26 02:29:19,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 02:29:19,252 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-11-26 02:29:19,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:29:19,254 INFO L225 Difference]: With dead ends: 93 [2019-11-26 02:29:19,254 INFO L226 Difference]: Without dead ends: 80 [2019-11-26 02:29:19,254 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 02:29:19,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-11-26 02:29:19,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2019-11-26 02:29:19,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-11-26 02:29:19,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 99 transitions. [2019-11-26 02:29:19,264 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 99 transitions. Word has length 10 [2019-11-26 02:29:19,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:29:19,264 INFO L462 AbstractCegarLoop]: Abstraction has 80 states and 99 transitions. [2019-11-26 02:29:19,265 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-26 02:29:19,265 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 99 transitions. [2019-11-26 02:29:19,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-26 02:29:19,266 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:29:19,266 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:29:19,266 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:29:19,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:29:19,267 INFO L82 PathProgramCache]: Analyzing trace with hash 535982816, now seen corresponding path program 1 times [2019-11-26 02:29:19,267 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:29:19,268 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872861729] [2019-11-26 02:29:19,268 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:29:19,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:29:19,305 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 02:29:19,306 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872861729] [2019-11-26 02:29:19,306 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:29:19,306 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 02:29:19,307 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799071269] [2019-11-26 02:29:19,307 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-26 02:29:19,307 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:29:19,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-26 02:29:19,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:29:19,308 INFO L87 Difference]: Start difference. First operand 80 states and 99 transitions. Second operand 3 states. [2019-11-26 02:29:19,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:29:19,385 INFO L93 Difference]: Finished difference Result 80 states and 99 transitions. [2019-11-26 02:29:19,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 02:29:19,386 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-11-26 02:29:19,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:29:19,387 INFO L225 Difference]: With dead ends: 80 [2019-11-26 02:29:19,387 INFO L226 Difference]: Without dead ends: 74 [2019-11-26 02:29:19,388 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 02:29:19,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-11-26 02:29:19,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2019-11-26 02:29:19,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-11-26 02:29:19,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 93 transitions. [2019-11-26 02:29:19,396 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 93 transitions. Word has length 14 [2019-11-26 02:29:19,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:29:19,396 INFO L462 AbstractCegarLoop]: Abstraction has 74 states and 93 transitions. [2019-11-26 02:29:19,396 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-26 02:29:19,396 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 93 transitions. [2019-11-26 02:29:19,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-26 02:29:19,397 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:29:19,398 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:29:19,398 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:29:19,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:29:19,398 INFO L82 PathProgramCache]: Analyzing trace with hash 559806363, now seen corresponding path program 1 times [2019-11-26 02:29:19,399 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:29:19,399 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851508812] [2019-11-26 02:29:19,399 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:29:19,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:29:19,454 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 02:29:19,454 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851508812] [2019-11-26 02:29:19,454 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:29:19,454 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 02:29:19,455 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559424933] [2019-11-26 02:29:19,455 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-26 02:29:19,455 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:29:19,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-26 02:29:19,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:29:19,456 INFO L87 Difference]: Start difference. First operand 74 states and 93 transitions. Second operand 3 states. [2019-11-26 02:29:19,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:29:19,533 INFO L93 Difference]: Finished difference Result 104 states and 130 transitions. [2019-11-26 02:29:19,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 02:29:19,533 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-11-26 02:29:19,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:29:19,534 INFO L225 Difference]: With dead ends: 104 [2019-11-26 02:29:19,534 INFO L226 Difference]: Without dead ends: 71 [2019-11-26 02:29:19,535 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 02:29:19,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-11-26 02:29:19,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2019-11-26 02:29:19,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-11-26 02:29:19,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 89 transitions. [2019-11-26 02:29:19,542 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 89 transitions. Word has length 15 [2019-11-26 02:29:19,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:29:19,542 INFO L462 AbstractCegarLoop]: Abstraction has 71 states and 89 transitions. [2019-11-26 02:29:19,542 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-26 02:29:19,542 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 89 transitions. [2019-11-26 02:29:19,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-26 02:29:19,543 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:29:19,544 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:29:19,544 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:29:19,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:29:19,544 INFO L82 PathProgramCache]: Analyzing trace with hash 1878512821, now seen corresponding path program 1 times [2019-11-26 02:29:19,545 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:29:19,545 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881625632] [2019-11-26 02:29:19,547 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:29:19,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:29:19,625 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 02:29:19,626 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881625632] [2019-11-26 02:29:19,627 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:29:19,627 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-26 02:29:19,627 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089071135] [2019-11-26 02:29:19,628 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:29:19,628 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:29:19,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:29:19,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:29:19,629 INFO L87 Difference]: Start difference. First operand 71 states and 89 transitions. Second operand 4 states. [2019-11-26 02:29:19,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:29:19,659 INFO L93 Difference]: Finished difference Result 115 states and 143 transitions. [2019-11-26 02:29:19,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:29:19,660 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-11-26 02:29:19,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:29:19,661 INFO L225 Difference]: With dead ends: 115 [2019-11-26 02:29:19,661 INFO L226 Difference]: Without dead ends: 83 [2019-11-26 02:29:19,662 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-26 02:29:19,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-11-26 02:29:19,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 69. [2019-11-26 02:29:19,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-11-26 02:29:19,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 86 transitions. [2019-11-26 02:29:19,674 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 86 transitions. Word has length 16 [2019-11-26 02:29:19,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:29:19,674 INFO L462 AbstractCegarLoop]: Abstraction has 69 states and 86 transitions. [2019-11-26 02:29:19,674 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:29:19,675 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 86 transitions. [2019-11-26 02:29:19,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-26 02:29:19,676 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:29:19,676 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:29:19,676 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:29:19,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:29:19,676 INFO L82 PathProgramCache]: Analyzing trace with hash 1480986174, now seen corresponding path program 1 times [2019-11-26 02:29:19,677 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:29:19,677 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272302238] [2019-11-26 02:29:19,677 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:29:19,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:29:19,741 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:29:19,742 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272302238] [2019-11-26 02:29:19,742 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:29:19,742 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 02:29:19,742 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751510401] [2019-11-26 02:29:19,743 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:29:19,743 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:29:19,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:29:19,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:29:19,744 INFO L87 Difference]: Start difference. First operand 69 states and 86 transitions. Second operand 4 states. [2019-11-26 02:29:19,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:29:19,833 INFO L93 Difference]: Finished difference Result 99 states and 123 transitions. [2019-11-26 02:29:19,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:29:19,833 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-11-26 02:29:19,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:29:19,834 INFO L225 Difference]: With dead ends: 99 [2019-11-26 02:29:19,834 INFO L226 Difference]: Without dead ends: 69 [2019-11-26 02:29:19,835 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 02:29:19,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-11-26 02:29:19,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2019-11-26 02:29:19,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-11-26 02:29:19,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 85 transitions. [2019-11-26 02:29:19,851 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 85 transitions. Word has length 17 [2019-11-26 02:29:19,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:29:19,851 INFO L462 AbstractCegarLoop]: Abstraction has 69 states and 85 transitions. [2019-11-26 02:29:19,851 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:29:19,851 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 85 transitions. [2019-11-26 02:29:19,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-26 02:29:19,852 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:29:19,852 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 02:29:19,853 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:29:19,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:29:19,853 INFO L82 PathProgramCache]: Analyzing trace with hash 1607917556, now seen corresponding path program 1 times [2019-11-26 02:29:19,853 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:29:19,853 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384072560] [2019-11-26 02:29:19,854 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:29:19,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:29:19,919 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 02:29:19,919 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384072560] [2019-11-26 02:29:19,920 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:29:19,920 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-26 02:29:19,920 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508718288] [2019-11-26 02:29:19,920 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-26 02:29:19,920 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:29:19,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-26 02:29:19,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-26 02:29:19,921 INFO L87 Difference]: Start difference. First operand 69 states and 85 transitions. Second operand 5 states. [2019-11-26 02:29:20,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:29:20,098 INFO L93 Difference]: Finished difference Result 90 states and 109 transitions. [2019-11-26 02:29:20,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-26 02:29:20,099 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2019-11-26 02:29:20,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:29:20,100 INFO L225 Difference]: With dead ends: 90 [2019-11-26 02:29:20,100 INFO L226 Difference]: Without dead ends: 88 [2019-11-26 02:29:20,100 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 02:29:20,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-11-26 02:29:20,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 69. [2019-11-26 02:29:20,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-11-26 02:29:20,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 85 transitions. [2019-11-26 02:29:20,113 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 85 transitions. Word has length 18 [2019-11-26 02:29:20,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:29:20,114 INFO L462 AbstractCegarLoop]: Abstraction has 69 states and 85 transitions. [2019-11-26 02:29:20,114 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-26 02:29:20,114 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 85 transitions. [2019-11-26 02:29:20,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-26 02:29:20,115 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:29:20,115 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 02:29:20,115 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:29:20,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:29:20,116 INFO L82 PathProgramCache]: Analyzing trace with hash -1748577235, now seen corresponding path program 1 times [2019-11-26 02:29:20,116 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:29:20,116 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420445338] [2019-11-26 02:29:20,116 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:29:20,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:29:20,152 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 02:29:20,152 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420445338] [2019-11-26 02:29:20,152 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:29:20,153 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 02:29:20,153 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093765051] [2019-11-26 02:29:20,153 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-26 02:29:20,153 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:29:20,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-26 02:29:20,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:29:20,155 INFO L87 Difference]: Start difference. First operand 69 states and 85 transitions. Second operand 3 states. [2019-11-26 02:29:20,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:29:20,226 INFO L93 Difference]: Finished difference Result 82 states and 100 transitions. [2019-11-26 02:29:20,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 02:29:20,227 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-11-26 02:29:20,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:29:20,228 INFO L225 Difference]: With dead ends: 82 [2019-11-26 02:29:20,228 INFO L226 Difference]: Without dead ends: 80 [2019-11-26 02:29:20,228 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 02:29:20,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-11-26 02:29:20,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 71. [2019-11-26 02:29:20,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-11-26 02:29:20,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 88 transitions. [2019-11-26 02:29:20,238 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 88 transitions. Word has length 19 [2019-11-26 02:29:20,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:29:20,238 INFO L462 AbstractCegarLoop]: Abstraction has 71 states and 88 transitions. [2019-11-26 02:29:20,238 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-26 02:29:20,238 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 88 transitions. [2019-11-26 02:29:20,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-26 02:29:20,239 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:29:20,240 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 02:29:20,240 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:29:20,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:29:20,240 INFO L82 PathProgramCache]: Analyzing trace with hash 1621021588, now seen corresponding path program 1 times [2019-11-26 02:29:20,241 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:29:20,241 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096401822] [2019-11-26 02:29:20,241 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:29:20,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:29:20,278 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 02:29:20,278 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096401822] [2019-11-26 02:29:20,279 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:29:20,279 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 02:29:20,279 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730150147] [2019-11-26 02:29:20,279 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-26 02:29:20,280 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:29:20,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-26 02:29:20,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:29:20,280 INFO L87 Difference]: Start difference. First operand 71 states and 88 transitions. Second operand 3 states. [2019-11-26 02:29:20,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:29:20,299 INFO L93 Difference]: Finished difference Result 110 states and 133 transitions. [2019-11-26 02:29:20,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 02:29:20,300 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-11-26 02:29:20,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:29:20,301 INFO L225 Difference]: With dead ends: 110 [2019-11-26 02:29:20,301 INFO L226 Difference]: Without dead ends: 84 [2019-11-26 02:29:20,302 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 02:29:20,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-11-26 02:29:20,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 67. [2019-11-26 02:29:20,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-11-26 02:29:20,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 82 transitions. [2019-11-26 02:29:20,312 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 82 transitions. Word has length 20 [2019-11-26 02:29:20,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:29:20,314 INFO L462 AbstractCegarLoop]: Abstraction has 67 states and 82 transitions. [2019-11-26 02:29:20,314 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-26 02:29:20,314 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 82 transitions. [2019-11-26 02:29:20,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-26 02:29:20,316 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:29:20,316 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 02:29:20,317 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:29:20,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:29:20,317 INFO L82 PathProgramCache]: Analyzing trace with hash -561666676, now seen corresponding path program 1 times [2019-11-26 02:29:20,317 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:29:20,317 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203589035] [2019-11-26 02:29:20,318 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:29:20,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:29:20,355 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 02:29:20,355 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203589035] [2019-11-26 02:29:20,355 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:29:20,355 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-26 02:29:20,356 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667549578] [2019-11-26 02:29:20,356 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:29:20,356 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:29:20,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:29:20,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:29:20,379 INFO L87 Difference]: Start difference. First operand 67 states and 82 transitions. Second operand 4 states. [2019-11-26 02:29:20,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:29:20,403 INFO L93 Difference]: Finished difference Result 74 states and 92 transitions. [2019-11-26 02:29:20,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 02:29:20,404 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2019-11-26 02:29:20,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:29:20,404 INFO L225 Difference]: With dead ends: 74 [2019-11-26 02:29:20,405 INFO L226 Difference]: Without dead ends: 23 [2019-11-26 02:29:20,405 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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 02:29:20,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-11-26 02:29:20,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-11-26 02:29:20,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-11-26 02:29:20,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 22 transitions. [2019-11-26 02:29:20,408 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 22 transitions. Word has length 21 [2019-11-26 02:29:20,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:29:20,408 INFO L462 AbstractCegarLoop]: Abstraction has 23 states and 22 transitions. [2019-11-26 02:29:20,408 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:29:20,408 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 22 transitions. [2019-11-26 02:29:20,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-26 02:29:20,409 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:29:20,409 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 02:29:20,409 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:29:20,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:29:20,409 INFO L82 PathProgramCache]: Analyzing trace with hash 1813263430, now seen corresponding path program 1 times [2019-11-26 02:29:20,410 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:29:20,410 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789579447] [2019-11-26 02:29:20,410 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:29:20,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:29:20,468 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 02:29:20,469 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789579447] [2019-11-26 02:29:20,469 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:29:20,469 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-26 02:29:20,469 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583243637] [2019-11-26 02:29:20,470 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-26 02:29:20,470 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:29:20,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-26 02:29:20,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-26 02:29:20,470 INFO L87 Difference]: Start difference. First operand 23 states and 22 transitions. Second operand 5 states. [2019-11-26 02:29:20,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:29:20,506 INFO L93 Difference]: Finished difference Result 23 states and 22 transitions. [2019-11-26 02:29:20,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-26 02:29:20,507 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-11-26 02:29:20,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:29:20,507 INFO L225 Difference]: With dead ends: 23 [2019-11-26 02:29:20,507 INFO L226 Difference]: Without dead ends: 0 [2019-11-26 02:29:20,508 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 02:29:20,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-26 02:29:20,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-26 02:29:20,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-26 02:29:20,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-26 02:29:20,509 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 22 [2019-11-26 02:29:20,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:29:20,509 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-26 02:29:20,509 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-26 02:29:20,509 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-26 02:29:20,509 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-26 02:29:20,513 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-26 02:29:21,171 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 579) no Hoare annotation was computed. [2019-11-26 02:29:21,172 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION(line 579) no Hoare annotation was computed. [2019-11-26 02:29:21,172 INFO L444 ceAbstractionStarter]: For program point L169(lines 169 181) no Hoare annotation was computed. [2019-11-26 02:29:21,172 INFO L440 ceAbstractionStarter]: At program point L103(lines 103 281) the Hoare annotation is: (and (or (= ULTIMATE.start_main_~__cil_tmp8~0 1) (= ULTIMATE.start_main_~__cil_tmp8~0 0)) (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (= ~NP~0 ~s~0) (<= (+ ~NP~0 4) ~MPR1~0)) [2019-11-26 02:29:21,172 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION(line 579) no Hoare annotation was computed. [2019-11-26 02:29:21,172 INFO L444 ceAbstractionStarter]: For program point L368(lines 368 372) no Hoare annotation was computed. [2019-11-26 02:29:21,172 INFO L440 ceAbstractionStarter]: At program point L534(lines 526 545) the Hoare annotation is: false [2019-11-26 02:29:21,172 INFO L440 ceAbstractionStarter]: At program point L469(lines 442 497) the Hoare annotation is: (and (or (= ULTIMATE.start_main_~__cil_tmp8~0 1) (= ULTIMATE.start_main_~__cil_tmp8~0 0)) (not (= 1 ~pended~0)) (= ~MPR1~0 ~s~0) (not (= 0 ~compRegistered~0)) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~NP~0 4) ~MPR1~0) (= ~setEventCalled~0 1)) [2019-11-26 02:29:21,172 INFO L440 ceAbstractionStarter]: At program point L469-1(lines 442 497) the Hoare annotation is: (and (or (= ULTIMATE.start_main_~__cil_tmp8~0 1) (= ULTIMATE.start_main_~__cil_tmp8~0 0)) (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~NP~0 4) ~MPR1~0) (= ~SKIP1~0 ~s~0)) [2019-11-26 02:29:21,173 INFO L440 ceAbstractionStarter]: At program point L469-2(lines 442 497) the Hoare annotation is: (and (or (= ULTIMATE.start_main_~__cil_tmp8~0 1) (= ULTIMATE.start_main_~__cil_tmp8~0 0)) (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~NP~0 4) ~MPR1~0) (= ~SKIP1~0 ~s~0)) [2019-11-26 02:29:21,173 INFO L440 ceAbstractionStarter]: At program point L469-3(lines 442 497) the Hoare annotation is: (and (or (= ULTIMATE.start_main_~__cil_tmp8~0 1) (= ULTIMATE.start_main_~__cil_tmp8~0 0)) (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~NP~0 4) ~MPR1~0) (= ~SKIP1~0 ~s~0)) [2019-11-26 02:29:21,173 INFO L440 ceAbstractionStarter]: At program point L106(lines 106 280) the Hoare annotation is: (and (or (= ULTIMATE.start_main_~__cil_tmp8~0 1) (= ULTIMATE.start_main_~__cil_tmp8~0 0)) (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (= ~NP~0 ~s~0) (<= (+ ~NP~0 4) ~MPR1~0)) [2019-11-26 02:29:21,173 INFO L444 ceAbstractionStarter]: For program point L503(lines 503 509) no Hoare annotation was computed. [2019-11-26 02:29:21,173 INFO L444 ceAbstractionStarter]: For program point L338-1(lines 337 347) no Hoare annotation was computed. [2019-11-26 02:29:21,173 INFO L444 ceAbstractionStarter]: For program point L174(lines 174 180) no Hoare annotation was computed. [2019-11-26 02:29:21,173 INFO L440 ceAbstractionStarter]: At program point L174-1(lines 1 582) the Hoare annotation is: (and (or (= ULTIMATE.start_main_~__cil_tmp8~0 1) (= ULTIMATE.start_main_~__cil_tmp8~0 0)) (not (= 1 ~pended~0)) (not (= 0 ~compRegistered~0)) (= ULTIMATE.start_main_~status~1 0) (= ~NP~0 ~s~0) (<= (+ ~NP~0 4) ~MPR1~0)) [2019-11-26 02:29:21,173 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 579) no Hoare annotation was computed. [2019-11-26 02:29:21,173 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION(line 579) no Hoare annotation was computed. [2019-11-26 02:29:21,173 INFO L444 ceAbstractionStarter]: For program point L539(lines 539 543) no Hoare annotation was computed. [2019-11-26 02:29:21,174 INFO L440 ceAbstractionStarter]: At program point L539-1(lines 539 543) the Hoare annotation is: (and (or (= ULTIMATE.start_main_~__cil_tmp8~0 1) (= ULTIMATE.start_main_~__cil_tmp8~0 0)) (= ~s~0 ~NP~0) (not (= 1 ~pended~0)) (not (= 0 ~compRegistered~0)) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~NP~0 4) ~MPR1~0)) [2019-11-26 02:29:21,174 INFO L440 ceAbstractionStarter]: At program point L374(lines 367 416) the Hoare annotation is: (and (or (= ULTIMATE.start_main_~__cil_tmp8~0 1) (= ULTIMATE.start_main_~__cil_tmp8~0 0)) (not (= 1 ~pended~0)) (<= (+ ~NP~0 4) ~MPR1~0)) [2019-11-26 02:29:21,174 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION(line 579) no Hoare annotation was computed. [2019-11-26 02:29:21,174 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION(line 579) no Hoare annotation was computed. [2019-11-26 02:29:21,174 INFO L444 ceAbstractionStarter]: For program point L376(lines 376 380) no Hoare annotation was computed. [2019-11-26 02:29:21,174 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 579) no Hoare annotation was computed. [2019-11-26 02:29:21,174 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION(line 579) no Hoare annotation was computed. [2019-11-26 02:29:21,174 INFO L440 ceAbstractionStarter]: At program point L443(lines 443 446) the Hoare annotation is: (and (or (= ULTIMATE.start_main_~__cil_tmp8~0 1) (= ULTIMATE.start_main_~__cil_tmp8~0 0)) (not (= 1 ~pended~0)) (not (= 0 ~compRegistered~0)) (= ULTIMATE.start_main_~status~1 0) (= ~NP~0 ~s~0) (<= (+ ~NP~0 4) ~MPR1~0)) [2019-11-26 02:29:21,174 INFO L440 ceAbstractionStarter]: At program point L443-1(lines 443 446) the Hoare annotation is: (and (or (= ULTIMATE.start_main_~__cil_tmp8~0 1) (= ULTIMATE.start_main_~__cil_tmp8~0 0)) (not (= 1 ~pended~0)) (= ~MPR1~0 ~s~0) (not (= 0 ~compRegistered~0)) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~NP~0 4) ~MPR1~0) (= ~setEventCalled~0 1)) [2019-11-26 02:29:21,175 INFO L440 ceAbstractionStarter]: At program point L443-2(lines 443 446) the Hoare annotation is: (and (or (= ULTIMATE.start_main_~__cil_tmp8~0 1) (= ULTIMATE.start_main_~__cil_tmp8~0 0)) (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~NP~0 4) ~MPR1~0) (= ~SKIP1~0 ~s~0)) [2019-11-26 02:29:21,175 INFO L440 ceAbstractionStarter]: At program point L443-3(lines 443 446) the Hoare annotation is: (and (or (= ULTIMATE.start_main_~__cil_tmp8~0 1) (= ULTIMATE.start_main_~__cil_tmp8~0 0)) (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~NP~0 4) ~MPR1~0) (= ~SKIP1~0 ~s~0)) [2019-11-26 02:29:21,175 INFO L440 ceAbstractionStarter]: At program point L443-4(lines 443 446) the Hoare annotation is: (and (or (= ULTIMATE.start_main_~__cil_tmp8~0 1) (= ULTIMATE.start_main_~__cil_tmp8~0 0)) (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~NP~0 4) ~MPR1~0) (= ~SKIP1~0 ~s~0)) [2019-11-26 02:29:21,175 INFO L440 ceAbstractionStarter]: At program point L443-5(lines 443 446) the Hoare annotation is: (and (or (= ULTIMATE.start_main_~__cil_tmp8~0 1) (= ULTIMATE.start_main_~__cil_tmp8~0 0)) (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~NP~0 4) ~MPR1~0) (= ~SKIP1~0 ~s~0)) [2019-11-26 02:29:21,175 INFO L440 ceAbstractionStarter]: At program point L443-6(lines 443 446) the Hoare annotation is: (and (or (= ULTIMATE.start_main_~__cil_tmp8~0 1) (= ULTIMATE.start_main_~__cil_tmp8~0 0)) (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~NP~0 4) ~MPR1~0) (= ~SKIP1~0 ~s~0)) [2019-11-26 02:29:21,175 INFO L440 ceAbstractionStarter]: At program point L443-7(lines 443 446) the Hoare annotation is: (and (or (= ULTIMATE.start_main_~__cil_tmp8~0 1) (= ULTIMATE.start_main_~__cil_tmp8~0 0)) (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~NP~0 4) ~MPR1~0) (= ~SKIP1~0 ~s~0)) [2019-11-26 02:29:21,175 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION(line 579) no Hoare annotation was computed. [2019-11-26 02:29:21,175 INFO L444 ceAbstractionStarter]: For program point L477(lines 477 494) no Hoare annotation was computed. [2019-11-26 02:29:21,175 INFO L444 ceAbstractionStarter]: For program point L477-1(lines 477 494) no Hoare annotation was computed. [2019-11-26 02:29:21,175 INFO L444 ceAbstractionStarter]: For program point L477-2(lines 477 494) no Hoare annotation was computed. [2019-11-26 02:29:21,176 INFO L444 ceAbstractionStarter]: For program point L477-3(lines 477 494) no Hoare annotation was computed. [2019-11-26 02:29:21,176 INFO L444 ceAbstractionStarter]: For program point L214(lines 214 220) no Hoare annotation was computed. [2019-11-26 02:29:21,176 INFO L444 ceAbstractionStarter]: For program point L579(line 579) no Hoare annotation was computed. [2019-11-26 02:29:21,176 INFO L444 ceAbstractionStarter]: For program point L579-1(line 579) no Hoare annotation was computed. [2019-11-26 02:29:21,176 INFO L444 ceAbstractionStarter]: For program point L579-2(line 579) no Hoare annotation was computed. [2019-11-26 02:29:21,176 INFO L444 ceAbstractionStarter]: For program point L579-3(line 579) no Hoare annotation was computed. [2019-11-26 02:29:21,176 INFO L444 ceAbstractionStarter]: For program point L579-4(line 579) no Hoare annotation was computed. [2019-11-26 02:29:21,176 INFO L444 ceAbstractionStarter]: For program point L579-5(line 579) no Hoare annotation was computed. [2019-11-26 02:29:21,176 INFO L444 ceAbstractionStarter]: For program point L579-6(line 579) no Hoare annotation was computed. [2019-11-26 02:29:21,176 INFO L444 ceAbstractionStarter]: For program point L579-7(line 579) no Hoare annotation was computed. [2019-11-26 02:29:21,176 INFO L444 ceAbstractionStarter]: For program point L579-8(line 579) no Hoare annotation was computed. [2019-11-26 02:29:21,176 INFO L444 ceAbstractionStarter]: For program point L579-9(line 579) no Hoare annotation was computed. [2019-11-26 02:29:21,176 INFO L444 ceAbstractionStarter]: For program point L579-10(line 579) no Hoare annotation was computed. [2019-11-26 02:29:21,176 INFO L444 ceAbstractionStarter]: For program point L579-11(line 579) no Hoare annotation was computed. [2019-11-26 02:29:21,177 INFO L444 ceAbstractionStarter]: For program point L579-12(line 579) no Hoare annotation was computed. [2019-11-26 02:29:21,177 INFO L444 ceAbstractionStarter]: For program point L579-13(line 579) no Hoare annotation was computed. [2019-11-26 02:29:21,177 INFO L444 ceAbstractionStarter]: For program point L579-14(line 579) no Hoare annotation was computed. [2019-11-26 02:29:21,177 INFO L444 ceAbstractionStarter]: For program point L579-15(line 579) no Hoare annotation was computed. [2019-11-26 02:29:21,177 INFO L440 ceAbstractionStarter]: At program point L580-3(lines 1 582) the Hoare annotation is: (let ((.cse0 (= 259 ULTIMATE.start_IofCallDriver_~returnVal2~0))) (and (or (= ULTIMATE.start_main_~__cil_tmp8~0 1) (= ULTIMATE.start_main_~__cil_tmp8~0 0)) (not (= 1 ~pended~0)) (or .cse0 (= ~NP~0 ~s~0)) (not (= 0 ~compRegistered~0)) (= ULTIMATE.start_main_~status~1 0) (or (= ~MPR3~0 ~s~0) (not .cse0)) (<= (+ ~NP~0 4) ~MPR1~0) (= ~setEventCalled~0 1))) [2019-11-26 02:29:21,180 INFO L440 ceAbstractionStarter]: At program point L580-6(lines 1 582) the Hoare annotation is: (and (or (= ULTIMATE.start_main_~__cil_tmp8~0 1) (= ULTIMATE.start_main_~__cil_tmp8~0 0)) (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~NP~0 4) ~MPR1~0) (= ~SKIP1~0 ~s~0)) [2019-11-26 02:29:21,181 INFO L440 ceAbstractionStarter]: At program point L382(lines 375 415) the Hoare annotation is: (and (or (= ULTIMATE.start_main_~__cil_tmp8~0 1) (= ULTIMATE.start_main_~__cil_tmp8~0 0)) (not (= 1 ~pended~0)) (<= (+ ~NP~0 4) ~MPR1~0)) [2019-11-26 02:29:21,181 INFO L440 ceAbstractionStarter]: At program point L580-8(lines 1 582) the Hoare annotation is: (and (or (= ULTIMATE.start_main_~__cil_tmp8~0 1) (= ULTIMATE.start_main_~__cil_tmp8~0 0)) (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~NP~0 4) ~MPR1~0)) [2019-11-26 02:29:21,181 INFO L440 ceAbstractionStarter]: At program point L580-9(lines 1 582) the Hoare annotation is: (and (or (= ULTIMATE.start_main_~__cil_tmp8~0 1) (= ULTIMATE.start_main_~__cil_tmp8~0 0)) (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~NP~0 4) ~MPR1~0) (= ~SKIP1~0 ~s~0)) [2019-11-26 02:29:21,181 INFO L440 ceAbstractionStarter]: At program point L580-11(lines 1 582) the Hoare annotation is: (and (or (= ULTIMATE.start_main_~__cil_tmp8~0 1) (= ULTIMATE.start_main_~__cil_tmp8~0 0)) (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~NP~0 4) ~MPR1~0)) [2019-11-26 02:29:21,181 INFO L440 ceAbstractionStarter]: At program point L580-12(lines 1 582) the Hoare annotation is: (and (or (= ULTIMATE.start_main_~__cil_tmp8~0 1) (= ULTIMATE.start_main_~__cil_tmp8~0 0)) (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~NP~0 4) ~MPR1~0) (= ~SKIP1~0 ~s~0)) [2019-11-26 02:29:21,181 INFO L440 ceAbstractionStarter]: At program point L580-14(lines 1 582) the Hoare annotation is: (and (or (= ULTIMATE.start_main_~__cil_tmp8~0 1) (= ULTIMATE.start_main_~__cil_tmp8~0 0)) (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~NP~0 4) ~MPR1~0)) [2019-11-26 02:29:21,181 INFO L447 ceAbstractionStarter]: At program point L383(lines 367 416) the Hoare annotation is: true [2019-11-26 02:29:21,181 INFO L440 ceAbstractionStarter]: At program point L350(lines 350 365) the Hoare annotation is: (and (or (= ULTIMATE.start_main_~__cil_tmp8~0 1) (= ULTIMATE.start_main_~__cil_tmp8~0 0)) (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (= ~NP~0 ~s~0) (<= (+ ~NP~0 4) ~MPR1~0)) [2019-11-26 02:29:21,182 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-26 02:29:21,182 INFO L444 ceAbstractionStarter]: For program point L384(lines 384 413) no Hoare annotation was computed. [2019-11-26 02:29:21,182 INFO L447 ceAbstractionStarter]: At program point L418(lines 286 420) the Hoare annotation is: true [2019-11-26 02:29:21,182 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION(line 579) no Hoare annotation was computed. [2019-11-26 02:29:21,182 INFO L444 ceAbstractionStarter]: For program point L385(lines 385 412) no Hoare annotation was computed. [2019-11-26 02:29:21,182 INFO L444 ceAbstractionStarter]: For program point L386(lines 386 392) no Hoare annotation was computed. [2019-11-26 02:29:21,182 INFO L444 ceAbstractionStarter]: For program point L486(lines 486 493) no Hoare annotation was computed. [2019-11-26 02:29:21,182 INFO L444 ceAbstractionStarter]: For program point L486-2(lines 486 493) no Hoare annotation was computed. [2019-11-26 02:29:21,182 INFO L444 ceAbstractionStarter]: For program point L387(lines 387 389) no Hoare annotation was computed. [2019-11-26 02:29:21,182 INFO L444 ceAbstractionStarter]: For program point L486-4(lines 486 493) no Hoare annotation was computed. [2019-11-26 02:29:21,183 INFO L440 ceAbstractionStarter]: At program point L321(lines 295 419) the Hoare annotation is: (and (or (= ULTIMATE.start_main_~__cil_tmp8~0 1) (= ULTIMATE.start_main_~__cil_tmp8~0 0)) (not (= 1 ~pended~0)) (<= (+ ~NP~0 4) ~MPR1~0)) [2019-11-26 02:29:21,183 INFO L444 ceAbstractionStarter]: For program point L486-6(lines 486 493) no Hoare annotation was computed. [2019-11-26 02:29:21,183 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION(line 579) no Hoare annotation was computed. [2019-11-26 02:29:21,183 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-26 02:29:21,183 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION(line 579) no Hoare annotation was computed. [2019-11-26 02:29:21,183 INFO L444 ceAbstractionStarter]: For program point L190(lines 190 196) no Hoare annotation was computed. [2019-11-26 02:29:21,183 INFO L444 ceAbstractionStarter]: For program point L190-2(lines 164 259) no Hoare annotation was computed. [2019-11-26 02:29:21,183 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION(line 579) no Hoare annotation was computed. [2019-11-26 02:29:21,183 INFO L444 ceAbstractionStarter]: For program point L425(lines 425 431) no Hoare annotation was computed. [2019-11-26 02:29:21,183 INFO L444 ceAbstractionStarter]: For program point L425-2(lines 425 431) no Hoare annotation was computed. [2019-11-26 02:29:21,183 INFO L444 ceAbstractionStarter]: For program point L425-4(lines 425 431) no Hoare annotation was computed. [2019-11-26 02:29:21,184 INFO L440 ceAbstractionStarter]: At program point L260(lines 164 261) the Hoare annotation is: (and (or (= ULTIMATE.start_main_~__cil_tmp8~0 1) (= ULTIMATE.start_main_~__cil_tmp8~0 0)) (not (= 1 ~pended~0)) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~NP~0 4) ~MPR1~0)) [2019-11-26 02:29:21,184 INFO L444 ceAbstractionStarter]: For program point L425-6(lines 425 431) no Hoare annotation was computed. [2019-11-26 02:29:21,184 INFO L444 ceAbstractionStarter]: For program point L526(lines 526 545) no Hoare annotation was computed. [2019-11-26 02:29:21,184 INFO L440 ceAbstractionStarter]: At program point L394(lines 385 412) the Hoare annotation is: (and (or (= ULTIMATE.start_main_~__cil_tmp8~0 1) (= ULTIMATE.start_main_~__cil_tmp8~0 0)) (not (= 1 ~pended~0)) (<= (+ ~NP~0 4) ~MPR1~0)) [2019-11-26 02:29:21,184 INFO L440 ceAbstractionStarter]: At program point L163(lines 109 279) the Hoare annotation is: (and (or (= ULTIMATE.start_main_~__cil_tmp8~0 1) (= ULTIMATE.start_main_~__cil_tmp8~0 0)) (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (= ~NP~0 ~s~0) (<= (+ ~NP~0 4) ~MPR1~0)) [2019-11-26 02:29:21,184 INFO L444 ceAbstractionStarter]: For program point L527(lines 527 532) no Hoare annotation was computed. [2019-11-26 02:29:21,184 INFO L444 ceAbstractionStarter]: For program point L230(lines 230 236) no Hoare annotation was computed. [2019-11-26 02:29:21,184 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 579) no Hoare annotation was computed. [2019-11-26 02:29:21,184 INFO L444 ceAbstractionStarter]: For program point L396(lines 396 400) no Hoare annotation was computed. [2019-11-26 02:29:21,185 INFO L440 ceAbstractionStarter]: At program point L100(lines 100 282) the Hoare annotation is: (and (or (= ULTIMATE.start_main_~__cil_tmp8~0 1) (= ULTIMATE.start_main_~__cil_tmp8~0 0)) (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (= ~NP~0 ~s~0) (<= (+ ~NP~0 4) ~MPR1~0)) [2019-11-26 02:29:21,185 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION(line 579) no Hoare annotation was computed. [2019-11-26 02:29:21,185 INFO L440 ceAbstractionStarter]: At program point L68(lines 321 366) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (not (= ~MPR3~0 ~s~0)) (<= (+ ~NP~0 4) ~MPR1~0)) [2019-11-26 02:29:21,212 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.11 02:29:21 BoogieIcfgContainer [2019-11-26 02:29:21,212 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-26 02:29:21,212 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-26 02:29:21,212 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-26 02:29:21,213 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-26 02:29:21,213 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 02:29:18" (3/4) ... [2019-11-26 02:29:21,216 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-26 02:29:21,235 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 84 nodes and edges [2019-11-26 02:29:21,237 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2019-11-26 02:29:21,238 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-11-26 02:29:21,377 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_bf22354f-9612-4a8e-8a1d-a2766b76c0f3/bin/utaipan/witness.graphml [2019-11-26 02:29:21,377 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-26 02:29:21,379 INFO L168 Benchmark]: Toolchain (without parser) took 4834.82 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 211.3 MB). Free memory was 947.4 MB in the beginning and 1.1 GB in the end (delta: -108.0 MB). Peak memory consumption was 103.3 MB. Max. memory is 11.5 GB. [2019-11-26 02:29:21,380 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-26 02:29:21,380 INFO L168 Benchmark]: CACSL2BoogieTranslator took 462.12 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.5 MB). Free memory was 947.4 MB in the beginning and 1.1 GB in the end (delta: -172.7 MB). Peak memory consumption was 24.2 MB. Max. memory is 11.5 GB. [2019-11-26 02:29:21,380 INFO L168 Benchmark]: Boogie Procedure Inliner took 62.05 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.1 MB). Peak memory consumption was 7.1 MB. Max. memory is 11.5 GB. [2019-11-26 02:29:21,381 INFO L168 Benchmark]: Boogie Preprocessor took 56.10 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-26 02:29:21,382 INFO L168 Benchmark]: RCFGBuilder took 1370.78 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 972.0 MB in the end (delta: 141.0 MB). Peak memory consumption was 141.0 MB. Max. memory is 11.5 GB. [2019-11-26 02:29:21,382 INFO L168 Benchmark]: TraceAbstraction took 2714.78 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 81.8 MB). Free memory was 972.0 MB in the beginning and 1.1 GB in the end (delta: -103.0 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-11-26 02:29:21,382 INFO L168 Benchmark]: Witness Printer took 165.00 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.6 MB). Peak memory consumption was 19.6 MB. Max. memory is 11.5 GB. [2019-11-26 02:29:21,384 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.18 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 462.12 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.5 MB). Free memory was 947.4 MB in the beginning and 1.1 GB in the end (delta: -172.7 MB). Peak memory consumption was 24.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 62.05 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.1 MB). Peak memory consumption was 7.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 56.10 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 1370.78 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 972.0 MB in the end (delta: 141.0 MB). Peak memory consumption was 141.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 2714.78 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 81.8 MB). Free memory was 972.0 MB in the beginning and 1.1 GB in the end (delta: -103.0 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 165.00 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.6 MB). Peak memory consumption was 19.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 579]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 579]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 579]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 579]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 579]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 579]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 579]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 579]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 579]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 579]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 579]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 579]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 579]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 579]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 579]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 579]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 16 specifications checked. All of them hold - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((__cil_tmp8 == 1 || __cil_tmp8 == 0) && !(1 == pended)) && 0 == compRegistered) && status == 0) && NP + 4 <= MPR1 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((((__cil_tmp8 == 1 || __cil_tmp8 == 0) && !(1 == pended)) && 0 == compRegistered) && status == 0) && NP + 4 <= MPR1) && SKIP1 == s - InvariantResult [Line: 286]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 295]: Loop Invariant Derived loop invariant: ((__cil_tmp8 == 1 || __cil_tmp8 == 0) && !(1 == pended)) && NP + 4 <= MPR1 - InvariantResult [Line: 367]: Loop Invariant Derived loop invariant: ((__cil_tmp8 == 1 || __cil_tmp8 == 0) && !(1 == pended)) && NP + 4 <= MPR1 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((__cil_tmp8 == 1 || __cil_tmp8 == 0) && !(1 == pended)) && 0 == compRegistered) && status == 0) && NP + 4 <= MPR1 - InvariantResult [Line: 442]: Loop Invariant Derived loop invariant: ((((((__cil_tmp8 == 1 || __cil_tmp8 == 0) && !(1 == pended)) && MPR1 == s) && !(0 == compRegistered)) && status == 0) && NP + 4 <= MPR1) && setEventCalled == 1 - InvariantResult [Line: 385]: Loop Invariant Derived loop invariant: ((__cil_tmp8 == 1 || __cil_tmp8 == 0) && !(1 == pended)) && NP + 4 <= MPR1 - InvariantResult [Line: 367]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 443]: Loop Invariant Derived loop invariant: (((((__cil_tmp8 == 1 || __cil_tmp8 == 0) && !(1 == pended)) && 0 == compRegistered) && status == 0) && NP + 4 <= MPR1) && SKIP1 == s - InvariantResult [Line: 375]: Loop Invariant Derived loop invariant: ((__cil_tmp8 == 1 || __cil_tmp8 == 0) && !(1 == pended)) && NP + 4 <= MPR1 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((((__cil_tmp8 == 1 || __cil_tmp8 == 0) && !(1 == pended)) && 0 == compRegistered) && status == 0) && NP + 4 <= MPR1) && SKIP1 == s - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((__cil_tmp8 == 1 || __cil_tmp8 == 0) && !(1 == pended)) && 0 == compRegistered) && status == 0) && NP + 4 <= MPR1 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((((__cil_tmp8 == 1 || __cil_tmp8 == 0) && !(1 == pended)) && 0 == compRegistered) && status == 0) && NP + 4 <= MPR1) && SKIP1 == s - InvariantResult [Line: 539]: Loop Invariant Derived loop invariant: (((((__cil_tmp8 == 1 || __cil_tmp8 == 0) && s == NP) && !(1 == pended)) && !(0 == compRegistered)) && status == 0) && NP + 4 <= MPR1 - InvariantResult [Line: 100]: Loop Invariant Derived loop invariant: (((((__cil_tmp8 == 1 || __cil_tmp8 == 0) && !(1 == pended)) && 0 == compRegistered) && status == 0) && NP == s) && NP + 4 <= MPR1 - InvariantResult [Line: 443]: Loop Invariant Derived loop invariant: (((((__cil_tmp8 == 1 || __cil_tmp8 == 0) && !(1 == pended)) && 0 == compRegistered) && status == 0) && NP + 4 <= MPR1) && SKIP1 == s - InvariantResult [Line: 443]: Loop Invariant Derived loop invariant: (((((__cil_tmp8 == 1 || __cil_tmp8 == 0) && !(1 == pended)) && 0 == compRegistered) && status == 0) && NP + 4 <= MPR1) && SKIP1 == s - InvariantResult [Line: 443]: Loop Invariant Derived loop invariant: (((((__cil_tmp8 == 1 || __cil_tmp8 == 0) && !(1 == pended)) && 0 == compRegistered) && status == 0) && NP + 4 <= MPR1) && SKIP1 == s - InvariantResult [Line: 103]: Loop Invariant Derived loop invariant: (((((__cil_tmp8 == 1 || __cil_tmp8 == 0) && !(1 == pended)) && 0 == compRegistered) && status == 0) && NP == s) && NP + 4 <= MPR1 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((((((__cil_tmp8 == 1 || __cil_tmp8 == 0) && !(1 == pended)) && (259 == returnVal2 || NP == s)) && !(0 == compRegistered)) && status == 0) && (MPR3 == s || !(259 == returnVal2))) && NP + 4 <= MPR1) && setEventCalled == 1 - InvariantResult [Line: 443]: Loop Invariant Derived loop invariant: (((((__cil_tmp8 == 1 || __cil_tmp8 == 0) && !(1 == pended)) && 0 == compRegistered) && status == 0) && NP + 4 <= MPR1) && SKIP1 == s - InvariantResult [Line: 526]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 443]: Loop Invariant Derived loop invariant: (((((__cil_tmp8 == 1 || __cil_tmp8 == 0) && !(1 == pended)) && 0 == compRegistered) && status == 0) && NP + 4 <= MPR1) && SKIP1 == s - InvariantResult [Line: 442]: Loop Invariant Derived loop invariant: (((((__cil_tmp8 == 1 || __cil_tmp8 == 0) && !(1 == pended)) && 0 == compRegistered) && status == 0) && NP + 4 <= MPR1) && SKIP1 == s - InvariantResult [Line: 106]: Loop Invariant Derived loop invariant: (((((__cil_tmp8 == 1 || __cil_tmp8 == 0) && !(1 == pended)) && 0 == compRegistered) && status == 0) && NP == s) && NP + 4 <= MPR1 - InvariantResult [Line: 350]: Loop Invariant Derived loop invariant: (((((__cil_tmp8 == 1 || __cil_tmp8 == 0) && !(1 == pended)) && 0 == compRegistered) && status == 0) && NP == s) && NP + 4 <= MPR1 - InvariantResult [Line: 442]: Loop Invariant Derived loop invariant: (((((__cil_tmp8 == 1 || __cil_tmp8 == 0) && !(1 == pended)) && 0 == compRegistered) && status == 0) && NP + 4 <= MPR1) && SKIP1 == s - InvariantResult [Line: 442]: Loop Invariant Derived loop invariant: (((((__cil_tmp8 == 1 || __cil_tmp8 == 0) && !(1 == pended)) && 0 == compRegistered) && status == 0) && NP + 4 <= MPR1) && SKIP1 == s - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((((__cil_tmp8 == 1 || __cil_tmp8 == 0) && !(1 == pended)) && !(0 == compRegistered)) && status == 0) && NP == s) && NP + 4 <= MPR1 - InvariantResult [Line: 443]: Loop Invariant Derived loop invariant: (((((__cil_tmp8 == 1 || __cil_tmp8 == 0) && !(1 == pended)) && !(0 == compRegistered)) && status == 0) && NP == s) && NP + 4 <= MPR1 - InvariantResult [Line: 109]: Loop Invariant Derived loop invariant: (((((__cil_tmp8 == 1 || __cil_tmp8 == 0) && !(1 == pended)) && 0 == compRegistered) && status == 0) && NP == s) && NP + 4 <= MPR1 - InvariantResult [Line: 443]: Loop Invariant Derived loop invariant: ((((((__cil_tmp8 == 1 || __cil_tmp8 == 0) && !(1 == pended)) && MPR1 == s) && !(0 == compRegistered)) && status == 0) && NP + 4 <= MPR1) && setEventCalled == 1 - InvariantResult [Line: 321]: Loop Invariant Derived loop invariant: (((!(1 == pended) && 0 == compRegistered) && status == 0) && !(MPR3 == s)) && NP + 4 <= MPR1 - InvariantResult [Line: 164]: Loop Invariant Derived loop invariant: (((__cil_tmp8 == 1 || __cil_tmp8 == 0) && !(1 == pended)) && status == 0) && NP + 4 <= MPR1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 99 locations, 16 error locations. Result: SAFE, OverallTime: 2.6s, OverallIterations: 12, TraceHistogramMax: 1, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.6s, HoareTripleCheckerStatistics: 949 SDtfs, 634 SDslu, 438 SDs, 0 SdLazy, 416 SolverSat, 39 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 47 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=99occurred 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.1s AutomataMinimizationTime, 12 MinimizatonAttempts, 89 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 35 LocationsWithAnnotation, 35 PreInvPairs, 65 NumberOfFragments, 805 HoareAnnotationTreeSize, 35 FomulaSimplifications, 886 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 35 FomulaSimplificationsInter, 79 FormulaSimplificationTreeSizeReductionInter, 0.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 187 NumberOfCodeBlocks, 187 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 175 ConstructedInterpolants, 0 QuantifiedInterpolants, 6207 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...