./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem01_label24.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_68604199-911a-44a7-8634-ee8186fb8d29/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_68604199-911a-44a7-8634-ee8186fb8d29/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_68604199-911a-44a7-8634-ee8186fb8d29/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_68604199-911a-44a7-8634-ee8186fb8d29/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem01_label24.c -s /tmp/vcloud-vcloud-master/worker/run_dir_68604199-911a-44a7-8634-ee8186fb8d29/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_68604199-911a-44a7-8634-ee8186fb8d29/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 c5fe2c6077c684b4b50af2f6570d6f5c736d513e ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:38:48,028 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-26 02:38:48,030 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-26 02:38:48,041 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-26 02:38:48,041 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-26 02:38:48,042 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-26 02:38:48,043 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-26 02:38:48,046 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-26 02:38:48,048 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-26 02:38:48,048 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-26 02:38:48,049 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-26 02:38:48,051 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-26 02:38:48,051 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-26 02:38:48,052 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-26 02:38:48,053 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-26 02:38:48,054 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-26 02:38:48,055 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-26 02:38:48,056 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-26 02:38:48,058 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-26 02:38:48,060 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-26 02:38:48,062 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-26 02:38:48,063 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-26 02:38:48,064 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-26 02:38:48,065 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-26 02:38:48,067 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-26 02:38:48,067 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-26 02:38:48,068 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-26 02:38:48,069 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-26 02:38:48,069 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-26 02:38:48,070 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-26 02:38:48,070 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-26 02:38:48,071 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-26 02:38:48,071 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-26 02:38:48,072 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-26 02:38:48,073 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-26 02:38:48,073 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-26 02:38:48,073 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-26 02:38:48,074 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-26 02:38:48,074 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-26 02:38:48,075 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-26 02:38:48,075 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-26 02:38:48,076 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_68604199-911a-44a7-8634-ee8186fb8d29/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-11-26 02:38:48,088 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-26 02:38:48,089 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-26 02:38:48,089 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-26 02:38:48,090 INFO L138 SettingsManager]: * User list type=DISABLED [2019-11-26 02:38:48,090 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-11-26 02:38:48,090 INFO L138 SettingsManager]: * Explicit value domain=true [2019-11-26 02:38:48,090 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-11-26 02:38:48,091 INFO L138 SettingsManager]: * Octagon Domain=false [2019-11-26 02:38:48,091 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-11-26 02:38:48,091 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-11-26 02:38:48,091 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-11-26 02:38:48,091 INFO L138 SettingsManager]: * Interval Domain=false [2019-11-26 02:38:48,092 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-11-26 02:38:48,092 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-11-26 02:38:48,092 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-11-26 02:38:48,093 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-26 02:38:48,093 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-26 02:38:48,093 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-26 02:38:48,093 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-26 02:38:48,093 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-26 02:38:48,094 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-26 02:38:48,094 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-26 02:38:48,094 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-26 02:38:48,094 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-26 02:38:48,095 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-26 02:38:48,095 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-26 02:38:48,095 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-26 02:38:48,095 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-26 02:38:48,095 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-26 02:38:48,096 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-26 02:38:48,096 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-26 02:38:48,096 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-26 02:38:48,096 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-26 02:38:48,097 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-11-26 02:38:48,097 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-26 02:38:48,097 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-26 02:38:48,097 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-26 02:38:48,097 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_68604199-911a-44a7-8634-ee8186fb8d29/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 -> c5fe2c6077c684b4b50af2f6570d6f5c736d513e [2019-11-26 02:38:48,230 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-26 02:38:48,239 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-26 02:38:48,242 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-26 02:38:48,244 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-26 02:38:48,244 INFO L275 PluginConnector]: CDTParser initialized [2019-11-26 02:38:48,245 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_68604199-911a-44a7-8634-ee8186fb8d29/bin/utaipan/../../sv-benchmarks/c/eca-rers2012/Problem01_label24.c [2019-11-26 02:38:48,293 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_68604199-911a-44a7-8634-ee8186fb8d29/bin/utaipan/data/dd56bdf2e/a5e38aeda88542f08733694568bcb2a6/FLAGcbcfbf4d2 [2019-11-26 02:38:48,784 INFO L306 CDTParser]: Found 1 translation units. [2019-11-26 02:38:48,785 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_68604199-911a-44a7-8634-ee8186fb8d29/sv-benchmarks/c/eca-rers2012/Problem01_label24.c [2019-11-26 02:38:48,795 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_68604199-911a-44a7-8634-ee8186fb8d29/bin/utaipan/data/dd56bdf2e/a5e38aeda88542f08733694568bcb2a6/FLAGcbcfbf4d2 [2019-11-26 02:38:49,067 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_68604199-911a-44a7-8634-ee8186fb8d29/bin/utaipan/data/dd56bdf2e/a5e38aeda88542f08733694568bcb2a6 [2019-11-26 02:38:49,075 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-26 02:38:49,076 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-26 02:38:49,077 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-26 02:38:49,082 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-26 02:38:49,084 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-26 02:38:49,085 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 02:38:49" (1/1) ... [2019-11-26 02:38:49,088 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@24ea7aab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:38:49, skipping insertion in model container [2019-11-26 02:38:49,088 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 02:38:49" (1/1) ... [2019-11-26 02:38:49,094 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-26 02:38:49,151 INFO L179 MainTranslator]: Built tables and reachable declarations [2019-11-26 02:38:49,610 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-26 02:38:49,614 INFO L201 MainTranslator]: Completed pre-run [2019-11-26 02:38:49,718 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-26 02:38:49,735 INFO L205 MainTranslator]: Completed translation [2019-11-26 02:38:49,736 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:38:49 WrapperNode [2019-11-26 02:38:49,736 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-26 02:38:49,737 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-26 02:38:49,737 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-26 02:38:49,737 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-26 02:38:49,744 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:38:49" (1/1) ... [2019-11-26 02:38:49,771 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:38:49" (1/1) ... [2019-11-26 02:38:49,831 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-26 02:38:49,831 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-26 02:38:49,831 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-26 02:38:49,831 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-26 02:38:49,844 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:38:49" (1/1) ... [2019-11-26 02:38:49,844 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:38:49" (1/1) ... [2019-11-26 02:38:49,847 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:38:49" (1/1) ... [2019-11-26 02:38:49,847 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:38:49" (1/1) ... [2019-11-26 02:38:49,881 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:38:49" (1/1) ... [2019-11-26 02:38:49,908 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:38:49" (1/1) ... [2019-11-26 02:38:49,912 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:38:49" (1/1) ... [2019-11-26 02:38:49,917 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-26 02:38:49,918 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-26 02:38:49,918 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-26 02:38:49,918 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-26 02:38:49,919 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:38:49" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_68604199-911a-44a7-8634-ee8186fb8d29/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:38:49,990 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-26 02:38:49,993 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-26 02:38:51,709 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-26 02:38:51,709 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-26 02:38:51,710 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 02:38:51 BoogieIcfgContainer [2019-11-26 02:38:51,710 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-26 02:38:51,711 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-26 02:38:51,711 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-26 02:38:51,714 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-26 02:38:51,714 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.11 02:38:49" (1/3) ... [2019-11-26 02:38:51,715 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d9e49c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 02:38:51, skipping insertion in model container [2019-11-26 02:38:51,715 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:38:49" (2/3) ... [2019-11-26 02:38:51,716 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d9e49c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 02:38:51, skipping insertion in model container [2019-11-26 02:38:51,716 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 02:38:51" (3/3) ... [2019-11-26 02:38:51,718 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem01_label24.c [2019-11-26 02:38:51,727 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-26 02:38:51,733 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-26 02:38:51,743 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-26 02:38:51,776 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-26 02:38:51,776 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-26 02:38:51,776 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-26 02:38:51,776 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-26 02:38:51,776 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-26 02:38:51,777 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-26 02:38:51,777 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-26 02:38:51,777 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-26 02:38:51,795 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states. [2019-11-26 02:38:51,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-11-26 02:38:51,805 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:38:51,805 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:38:51,806 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:38:51,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:38:51,811 INFO L82 PathProgramCache]: Analyzing trace with hash -1323243039, now seen corresponding path program 1 times [2019-11-26 02:38:51,820 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:38:51,820 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658112146] [2019-11-26 02:38:51,821 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:38:51,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:38:52,176 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:38:52,176 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658112146] [2019-11-26 02:38:52,177 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:38:52,177 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 02:38:52,179 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865040867] [2019-11-26 02:38:52,183 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:38:52,183 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:38:52,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:38:52,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:38:52,198 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 4 states. [2019-11-26 02:38:52,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:38:52,927 INFO L93 Difference]: Finished difference Result 297 states and 569 transitions. [2019-11-26 02:38:52,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:38:52,929 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 71 [2019-11-26 02:38:52,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:38:52,948 INFO L225 Difference]: With dead ends: 297 [2019-11-26 02:38:52,948 INFO L226 Difference]: Without dead ends: 216 [2019-11-26 02:38:52,952 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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:38:52,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2019-11-26 02:38:53,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 145. [2019-11-26 02:38:53,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2019-11-26 02:38:53,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 259 transitions. [2019-11-26 02:38:53,022 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 259 transitions. Word has length 71 [2019-11-26 02:38:53,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:38:53,023 INFO L462 AbstractCegarLoop]: Abstraction has 145 states and 259 transitions. [2019-11-26 02:38:53,023 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:38:53,023 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 259 transitions. [2019-11-26 02:38:53,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-11-26 02:38:53,028 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:38:53,029 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:38:53,029 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:38:53,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:38:53,029 INFO L82 PathProgramCache]: Analyzing trace with hash -1048395660, now seen corresponding path program 1 times [2019-11-26 02:38:53,030 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:38:53,030 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294383337] [2019-11-26 02:38:53,030 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:38:53,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:38:53,093 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:38:53,093 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294383337] [2019-11-26 02:38:53,093 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:38:53,094 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 02:38:53,094 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272624214] [2019-11-26 02:38:53,095 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:38:53,096 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:38:53,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:38:53,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:38:53,096 INFO L87 Difference]: Start difference. First operand 145 states and 259 transitions. Second operand 4 states. [2019-11-26 02:38:53,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:38:53,670 INFO L93 Difference]: Finished difference Result 573 states and 1031 transitions. [2019-11-26 02:38:53,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:38:53,670 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 77 [2019-11-26 02:38:53,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:38:53,674 INFO L225 Difference]: With dead ends: 573 [2019-11-26 02:38:53,674 INFO L226 Difference]: Without dead ends: 429 [2019-11-26 02:38:53,675 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 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:38:53,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2019-11-26 02:38:53,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 429. [2019-11-26 02:38:53,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 429 states. [2019-11-26 02:38:53,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 707 transitions. [2019-11-26 02:38:53,705 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 707 transitions. Word has length 77 [2019-11-26 02:38:53,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:38:53,705 INFO L462 AbstractCegarLoop]: Abstraction has 429 states and 707 transitions. [2019-11-26 02:38:53,705 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:38:53,705 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 707 transitions. [2019-11-26 02:38:53,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-11-26 02:38:53,709 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:38:53,709 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:38:53,709 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:38:53,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:38:53,710 INFO L82 PathProgramCache]: Analyzing trace with hash -2123300332, now seen corresponding path program 1 times [2019-11-26 02:38:53,710 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:38:53,710 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462766064] [2019-11-26 02:38:53,710 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:38:53,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:38:53,828 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:38:53,829 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462766064] [2019-11-26 02:38:53,829 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:38:53,829 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-26 02:38:53,829 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325907500] [2019-11-26 02:38:53,830 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:38:53,830 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:38:53,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:38:53,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:38:53,831 INFO L87 Difference]: Start difference. First operand 429 states and 707 transitions. Second operand 4 states. [2019-11-26 02:38:54,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:38:54,345 INFO L93 Difference]: Finished difference Result 1425 states and 2333 transitions. [2019-11-26 02:38:54,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:38:54,347 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2019-11-26 02:38:54,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:38:54,351 INFO L225 Difference]: With dead ends: 1425 [2019-11-26 02:38:54,351 INFO L226 Difference]: Without dead ends: 926 [2019-11-26 02:38:54,354 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 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:38:54,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 926 states. [2019-11-26 02:38:54,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 926 to 571. [2019-11-26 02:38:54,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 571 states. [2019-11-26 02:38:54,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 571 states to 571 states and 820 transitions. [2019-11-26 02:38:54,384 INFO L78 Accepts]: Start accepts. Automaton has 571 states and 820 transitions. Word has length 78 [2019-11-26 02:38:54,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:38:54,384 INFO L462 AbstractCegarLoop]: Abstraction has 571 states and 820 transitions. [2019-11-26 02:38:54,384 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:38:54,384 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 820 transitions. [2019-11-26 02:38:54,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-11-26 02:38:54,389 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:38:54,390 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:38:54,390 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:38:54,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:38:54,390 INFO L82 PathProgramCache]: Analyzing trace with hash 2133653614, now seen corresponding path program 1 times [2019-11-26 02:38:54,390 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:38:54,391 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407803100] [2019-11-26 02:38:54,391 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:38:54,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:38:54,443 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-26 02:38:54,443 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407803100] [2019-11-26 02:38:54,443 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:38:54,443 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-26 02:38:54,444 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654919913] [2019-11-26 02:38:54,444 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-26 02:38:54,444 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:38:54,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-26 02:38:54,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:38:54,445 INFO L87 Difference]: Start difference. First operand 571 states and 820 transitions. Second operand 3 states. [2019-11-26 02:38:54,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:38:54,731 INFO L93 Difference]: Finished difference Result 1283 states and 1815 transitions. [2019-11-26 02:38:54,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 02:38:54,731 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 94 [2019-11-26 02:38:54,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:38:54,735 INFO L225 Difference]: With dead ends: 1283 [2019-11-26 02:38:54,735 INFO L226 Difference]: Without dead ends: 642 [2019-11-26 02:38:54,737 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:38:54,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 642 states. [2019-11-26 02:38:54,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 642 to 571. [2019-11-26 02:38:54,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 571 states. [2019-11-26 02:38:54,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 571 states to 571 states and 782 transitions. [2019-11-26 02:38:54,755 INFO L78 Accepts]: Start accepts. Automaton has 571 states and 782 transitions. Word has length 94 [2019-11-26 02:38:54,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:38:54,755 INFO L462 AbstractCegarLoop]: Abstraction has 571 states and 782 transitions. [2019-11-26 02:38:54,755 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-26 02:38:54,756 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 782 transitions. [2019-11-26 02:38:54,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-11-26 02:38:54,760 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:38:54,760 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:38:54,760 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:38:54,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:38:54,761 INFO L82 PathProgramCache]: Analyzing trace with hash 501972945, now seen corresponding path program 1 times [2019-11-26 02:38:54,761 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:38:54,761 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924232574] [2019-11-26 02:38:54,761 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:38:54,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:38:54,873 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-11-26 02:38:54,874 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924232574] [2019-11-26 02:38:54,874 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:38:54,875 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-26 02:38:54,875 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128633704] [2019-11-26 02:38:54,876 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-26 02:38:54,876 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:38:54,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-26 02:38:54,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:38:54,877 INFO L87 Difference]: Start difference. First operand 571 states and 782 transitions. Second operand 3 states. [2019-11-26 02:38:55,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:38:55,173 INFO L93 Difference]: Finished difference Result 1425 states and 1961 transitions. [2019-11-26 02:38:55,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 02:38:55,175 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 105 [2019-11-26 02:38:55,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:38:55,179 INFO L225 Difference]: With dead ends: 1425 [2019-11-26 02:38:55,179 INFO L226 Difference]: Without dead ends: 784 [2019-11-26 02:38:55,180 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:38:55,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 784 states. [2019-11-26 02:38:55,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 784 to 713. [2019-11-26 02:38:55,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 713 states. [2019-11-26 02:38:55,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 713 states to 713 states and 854 transitions. [2019-11-26 02:38:55,199 INFO L78 Accepts]: Start accepts. Automaton has 713 states and 854 transitions. Word has length 105 [2019-11-26 02:38:55,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:38:55,200 INFO L462 AbstractCegarLoop]: Abstraction has 713 states and 854 transitions. [2019-11-26 02:38:55,200 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-26 02:38:55,200 INFO L276 IsEmpty]: Start isEmpty. Operand 713 states and 854 transitions. [2019-11-26 02:38:55,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-11-26 02:38:55,203 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:38:55,204 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:38:55,204 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:38:55,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:38:55,204 INFO L82 PathProgramCache]: Analyzing trace with hash -802120607, now seen corresponding path program 1 times [2019-11-26 02:38:55,205 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:38:55,205 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646109763] [2019-11-26 02:38:55,205 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:38:55,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:38:55,287 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2019-11-26 02:38:55,288 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646109763] [2019-11-26 02:38:55,289 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:38:55,289 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-26 02:38:55,289 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221584768] [2019-11-26 02:38:55,290 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-26 02:38:55,290 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:38:55,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-26 02:38:55,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:38:55,291 INFO L87 Difference]: Start difference. First operand 713 states and 854 transitions. Second operand 3 states. [2019-11-26 02:38:55,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:38:55,598 INFO L93 Difference]: Finished difference Result 1780 states and 2146 transitions. [2019-11-26 02:38:55,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 02:38:55,599 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 124 [2019-11-26 02:38:55,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:38:55,604 INFO L225 Difference]: With dead ends: 1780 [2019-11-26 02:38:55,605 INFO L226 Difference]: Without dead ends: 1068 [2019-11-26 02:38:55,606 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:38:55,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1068 states. [2019-11-26 02:38:55,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1068 to 926. [2019-11-26 02:38:55,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 926 states. [2019-11-26 02:38:55,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 926 states to 926 states and 1103 transitions. [2019-11-26 02:38:55,667 INFO L78 Accepts]: Start accepts. Automaton has 926 states and 1103 transitions. Word has length 124 [2019-11-26 02:38:55,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:38:55,667 INFO L462 AbstractCegarLoop]: Abstraction has 926 states and 1103 transitions. [2019-11-26 02:38:55,667 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-26 02:38:55,667 INFO L276 IsEmpty]: Start isEmpty. Operand 926 states and 1103 transitions. [2019-11-26 02:38:55,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-11-26 02:38:55,674 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:38:55,674 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:38:55,674 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:38:55,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:38:55,675 INFO L82 PathProgramCache]: Analyzing trace with hash 1331378472, now seen corresponding path program 1 times [2019-11-26 02:38:55,675 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:38:55,675 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882783376] [2019-11-26 02:38:55,680 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:38:55,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:38:55,761 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-11-26 02:38:55,762 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882783376] [2019-11-26 02:38:55,762 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:38:55,762 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-26 02:38:55,763 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228297085] [2019-11-26 02:38:55,763 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-26 02:38:55,763 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:38:55,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-26 02:38:55,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:38:55,764 INFO L87 Difference]: Start difference. First operand 926 states and 1103 transitions. Second operand 3 states. [2019-11-26 02:38:56,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:38:56,003 INFO L93 Difference]: Finished difference Result 1993 states and 2370 transitions. [2019-11-26 02:38:56,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 02:38:56,003 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 127 [2019-11-26 02:38:56,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:38:56,009 INFO L225 Difference]: With dead ends: 1993 [2019-11-26 02:38:56,009 INFO L226 Difference]: Without dead ends: 1068 [2019-11-26 02:38:56,010 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:38:56,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1068 states. [2019-11-26 02:38:56,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1068 to 1068. [2019-11-26 02:38:56,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1068 states. [2019-11-26 02:38:56,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1068 states to 1068 states and 1258 transitions. [2019-11-26 02:38:56,035 INFO L78 Accepts]: Start accepts. Automaton has 1068 states and 1258 transitions. Word has length 127 [2019-11-26 02:38:56,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:38:56,035 INFO L462 AbstractCegarLoop]: Abstraction has 1068 states and 1258 transitions. [2019-11-26 02:38:56,035 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-26 02:38:56,036 INFO L276 IsEmpty]: Start isEmpty. Operand 1068 states and 1258 transitions. [2019-11-26 02:38:56,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-11-26 02:38:56,038 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:38:56,039 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:56,039 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:38:56,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:38:56,039 INFO L82 PathProgramCache]: Analyzing trace with hash 1638315872, now seen corresponding path program 1 times [2019-11-26 02:38:56,039 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:38:56,039 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154541283] [2019-11-26 02:38:56,040 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:38:56,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:38:56,235 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2019-11-26 02:38:56,235 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154541283] [2019-11-26 02:38:56,235 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:38:56,236 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-26 02:38:56,236 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048308753] [2019-11-26 02:38:56,236 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-26 02:38:56,236 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:38:56,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-26 02:38:56,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-26 02:38:56,237 INFO L87 Difference]: Start difference. First operand 1068 states and 1258 transitions. Second operand 6 states. [2019-11-26 02:38:56,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:38:56,817 INFO L93 Difference]: Finished difference Result 2138 states and 2531 transitions. [2019-11-26 02:38:56,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-26 02:38:56,818 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 131 [2019-11-26 02:38:56,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:38:56,822 INFO L225 Difference]: With dead ends: 2138 [2019-11-26 02:38:56,822 INFO L226 Difference]: Without dead ends: 1142 [2019-11-26 02:38:56,823 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-11-26 02:38:56,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1142 states. [2019-11-26 02:38:56,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1142 to 1068. [2019-11-26 02:38:56,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1068 states. [2019-11-26 02:38:56,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1068 states to 1068 states and 1244 transitions. [2019-11-26 02:38:56,845 INFO L78 Accepts]: Start accepts. Automaton has 1068 states and 1244 transitions. Word has length 131 [2019-11-26 02:38:56,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:38:56,846 INFO L462 AbstractCegarLoop]: Abstraction has 1068 states and 1244 transitions. [2019-11-26 02:38:56,846 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-26 02:38:56,846 INFO L276 IsEmpty]: Start isEmpty. Operand 1068 states and 1244 transitions. [2019-11-26 02:38:56,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-11-26 02:38:56,849 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:38:56,849 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:38:56,849 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:38:56,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:38:56,850 INFO L82 PathProgramCache]: Analyzing trace with hash 2055473488, now seen corresponding path program 1 times [2019-11-26 02:38:56,850 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:38:56,850 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846115233] [2019-11-26 02:38:56,850 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:38:56,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:38:56,961 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 139 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2019-11-26 02:38:56,961 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846115233] [2019-11-26 02:38:56,961 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:38:56,961 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-26 02:38:56,961 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200933894] [2019-11-26 02:38:56,962 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:38:56,962 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:38:56,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:38:56,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:38:56,963 INFO L87 Difference]: Start difference. First operand 1068 states and 1244 transitions. Second operand 4 states. [2019-11-26 02:38:57,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:38:57,358 INFO L93 Difference]: Finished difference Result 2277 states and 2651 transitions. [2019-11-26 02:38:57,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:38:57,362 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 164 [2019-11-26 02:38:57,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:38:57,367 INFO L225 Difference]: With dead ends: 2277 [2019-11-26 02:38:57,367 INFO L226 Difference]: Without dead ends: 1139 [2019-11-26 02:38:57,369 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 3 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:38:57,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1139 states. [2019-11-26 02:38:57,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1139 to 1068. [2019-11-26 02:38:57,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1068 states. [2019-11-26 02:38:57,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1068 states to 1068 states and 1202 transitions. [2019-11-26 02:38:57,393 INFO L78 Accepts]: Start accepts. Automaton has 1068 states and 1202 transitions. Word has length 164 [2019-11-26 02:38:57,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:38:57,393 INFO L462 AbstractCegarLoop]: Abstraction has 1068 states and 1202 transitions. [2019-11-26 02:38:57,393 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:38:57,393 INFO L276 IsEmpty]: Start isEmpty. Operand 1068 states and 1202 transitions. [2019-11-26 02:38:57,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-11-26 02:38:57,397 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:38:57,398 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:38:57,398 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:38:57,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:38:57,398 INFO L82 PathProgramCache]: Analyzing trace with hash 634321042, now seen corresponding path program 1 times [2019-11-26 02:38:57,399 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:38:57,399 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537501577] [2019-11-26 02:38:57,399 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:38:57,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:38:57,508 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 159 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-11-26 02:38:57,508 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537501577] [2019-11-26 02:38:57,508 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:38:57,509 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-26 02:38:57,509 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143630345] [2019-11-26 02:38:57,509 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:38:57,510 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:38:57,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:38:57,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:38:57,510 INFO L87 Difference]: Start difference. First operand 1068 states and 1202 transitions. Second operand 4 states. [2019-11-26 02:38:57,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:38:57,829 INFO L93 Difference]: Finished difference Result 2135 states and 2405 transitions. [2019-11-26 02:38:57,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:38:57,830 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 170 [2019-11-26 02:38:57,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:38:57,835 INFO L225 Difference]: With dead ends: 2135 [2019-11-26 02:38:57,835 INFO L226 Difference]: Without dead ends: 1139 [2019-11-26 02:38:57,836 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:38:57,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1139 states. [2019-11-26 02:38:57,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1139 to 1068. [2019-11-26 02:38:57,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1068 states. [2019-11-26 02:38:57,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1068 states to 1068 states and 1201 transitions. [2019-11-26 02:38:57,861 INFO L78 Accepts]: Start accepts. Automaton has 1068 states and 1201 transitions. Word has length 170 [2019-11-26 02:38:57,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:38:57,861 INFO L462 AbstractCegarLoop]: Abstraction has 1068 states and 1201 transitions. [2019-11-26 02:38:57,861 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:38:57,861 INFO L276 IsEmpty]: Start isEmpty. Operand 1068 states and 1201 transitions. [2019-11-26 02:38:57,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2019-11-26 02:38:57,865 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:38:57,865 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:38:57,865 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:38:57,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:38:57,865 INFO L82 PathProgramCache]: Analyzing trace with hash -1529648803, now seen corresponding path program 1 times [2019-11-26 02:38:57,866 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:38:57,866 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644000452] [2019-11-26 02:38:57,866 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:38:57,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:38:58,040 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 188 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2019-11-26 02:38:58,041 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644000452] [2019-11-26 02:38:58,041 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:38:58,041 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-26 02:38:58,041 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929948382] [2019-11-26 02:38:58,042 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-26 02:38:58,042 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:38:58,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-26 02:38:58,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-26 02:38:58,044 INFO L87 Difference]: Start difference. First operand 1068 states and 1201 transitions. Second operand 6 states. [2019-11-26 02:38:58,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:38:58,406 INFO L93 Difference]: Finished difference Result 2170 states and 2447 transitions. [2019-11-26 02:38:58,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-26 02:38:58,407 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 191 [2019-11-26 02:38:58,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:38:58,412 INFO L225 Difference]: With dead ends: 2170 [2019-11-26 02:38:58,413 INFO L226 Difference]: Without dead ends: 1174 [2019-11-26 02:38:58,414 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-26 02:38:58,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1174 states. [2019-11-26 02:38:58,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1174 to 1068. [2019-11-26 02:38:58,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1068 states. [2019-11-26 02:38:58,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1068 states to 1068 states and 1187 transitions. [2019-11-26 02:38:58,441 INFO L78 Accepts]: Start accepts. Automaton has 1068 states and 1187 transitions. Word has length 191 [2019-11-26 02:38:58,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:38:58,441 INFO L462 AbstractCegarLoop]: Abstraction has 1068 states and 1187 transitions. [2019-11-26 02:38:58,441 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-26 02:38:58,442 INFO L276 IsEmpty]: Start isEmpty. Operand 1068 states and 1187 transitions. [2019-11-26 02:38:58,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2019-11-26 02:38:58,445 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:38:58,446 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:38:58,446 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:38:58,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:38:58,447 INFO L82 PathProgramCache]: Analyzing trace with hash 1379061172, now seen corresponding path program 1 times [2019-11-26 02:38:58,447 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:38:58,447 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806452381] [2019-11-26 02:38:58,447 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:38:58,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:38:58,667 INFO L134 CoverageAnalysis]: Checked inductivity of 285 backedges. 141 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2019-11-26 02:38:58,667 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806452381] [2019-11-26 02:38:58,668 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:38:58,668 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-26 02:38:58,668 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059292983] [2019-11-26 02:38:58,669 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:38:58,669 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:38:58,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:38:58,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:38:58,669 INFO L87 Difference]: Start difference. First operand 1068 states and 1187 transitions. Second operand 4 states. [2019-11-26 02:38:58,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:38:58,971 INFO L93 Difference]: Finished difference Result 2062 states and 2298 transitions. [2019-11-26 02:38:58,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 02:38:58,972 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 213 [2019-11-26 02:38:58,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:38:58,973 INFO L225 Difference]: With dead ends: 2062 [2019-11-26 02:38:58,973 INFO L226 Difference]: Without dead ends: 0 [2019-11-26 02:38:58,974 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:38:58,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-26 02:38:58,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-26 02:38:58,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-26 02:38:58,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-26 02:38:58,975 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 213 [2019-11-26 02:38:58,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:38:58,975 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-26 02:38:58,975 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:38:58,975 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-26 02:38:58,975 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-26 02:38:58,980 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-26 02:38:59,442 WARN L192 SmtUtils]: Spent 343.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 50 [2019-11-26 02:38:59,783 WARN L192 SmtUtils]: Spent 336.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 50 [2019-11-26 02:38:59,785 INFO L444 ceAbstractionStarter]: For program point L333(lines 333 390) no Hoare annotation was computed. [2019-11-26 02:38:59,785 INFO L444 ceAbstractionStarter]: For program point L102(lines 102 390) no Hoare annotation was computed. [2019-11-26 02:38:59,785 INFO L444 ceAbstractionStarter]: For program point L466-1(lines 30 575) no Hoare annotation was computed. [2019-11-26 02:38:59,785 INFO L444 ceAbstractionStarter]: For program point L268(lines 268 390) no Hoare annotation was computed. [2019-11-26 02:38:59,785 INFO L444 ceAbstractionStarter]: For program point L136(lines 136 390) no Hoare annotation was computed. [2019-11-26 02:38:59,785 INFO L444 ceAbstractionStarter]: For program point L203(lines 203 390) no Hoare annotation was computed. [2019-11-26 02:38:59,785 INFO L444 ceAbstractionStarter]: For program point L72(lines 72 390) no Hoare annotation was computed. [2019-11-26 02:38:59,785 INFO L444 ceAbstractionStarter]: For program point L469-1(lines 30 575) no Hoare annotation was computed. [2019-11-26 02:38:59,786 INFO L444 ceAbstractionStarter]: For program point L337(lines 337 390) no Hoare annotation was computed. [2019-11-26 02:38:59,786 INFO L444 ceAbstractionStarter]: For program point L238(lines 238 390) no Hoare annotation was computed. [2019-11-26 02:38:59,786 INFO L444 ceAbstractionStarter]: For program point L470(line 470) no Hoare annotation was computed. [2019-11-26 02:38:59,786 INFO L444 ceAbstractionStarter]: For program point L173(lines 173 390) no Hoare annotation was computed. [2019-11-26 02:38:59,786 INFO L444 ceAbstractionStarter]: For program point L140(lines 140 390) no Hoare annotation was computed. [2019-11-26 02:38:59,786 INFO L444 ceAbstractionStarter]: For program point L372(lines 372 390) no Hoare annotation was computed. [2019-11-26 02:38:59,786 INFO L444 ceAbstractionStarter]: For program point L306(lines 306 390) no Hoare annotation was computed. [2019-11-26 02:38:59,786 INFO L444 ceAbstractionStarter]: For program point L273(lines 273 390) no Hoare annotation was computed. [2019-11-26 02:38:59,786 INFO L444 ceAbstractionStarter]: For program point L108(lines 108 390) no Hoare annotation was computed. [2019-11-26 02:38:59,786 INFO L444 ceAbstractionStarter]: For program point L208(lines 208 390) no Hoare annotation was computed. [2019-11-26 02:38:59,786 INFO L444 ceAbstractionStarter]: For program point L43(lines 43 390) no Hoare annotation was computed. [2019-11-26 02:38:59,786 INFO L444 ceAbstractionStarter]: For program point L144(lines 144 390) no Hoare annotation was computed. [2019-11-26 02:38:59,787 INFO L440 ceAbstractionStarter]: At program point L574(lines 30 575) the Hoare annotation is: (let ((.cse7 (= ~a16~0 6)) (.cse8 (not (= 15 ~a8~0)))) (let ((.cse1 (<= ~a20~0 0)) (.cse9 (= ~a16~0 5)) (.cse5 (not (= 1 ~a7~0))) (.cse3 (<= ~a17~0 0)) (.cse11 (= ~a12~0 8)) (.cse6 (= ~a20~0 1)) (.cse0 (or (and (not .cse7) .cse8) (= 13 ~a8~0))) (.cse2 (= ~a16~0 4)) (.cse4 (= ~a21~0 1)) (.cse10 (= ~a17~0 1))) (or (and .cse0 .cse1) (and .cse2 .cse3 .cse4 .cse1) (and .cse2 .cse5 .cse3 .cse4 .cse6) (and .cse5 .cse4 .cse7 .cse1) (and .cse8 .cse5 .cse9) (and .cse5 .cse4 .cse6 .cse9) (and .cse5 .cse10 .cse11 .cse4 .cse1) (and .cse8 .cse4 .cse9) (and .cse4 .cse1 .cse9) (and .cse0 .cse4 .cse6) (and .cse5 .cse4 .cse6 .cse7) (and .cse0 .cse2 .cse3) (and .cse0 .cse10 .cse11 .cse6) (and .cse0 .cse7) (and .cse0 .cse2 .cse4 (not .cse10))))) [2019-11-26 02:38:59,787 INFO L444 ceAbstractionStarter]: For program point L178(lines 178 390) no Hoare annotation was computed. [2019-11-26 02:38:59,787 INFO L444 ceAbstractionStarter]: For program point L377(lines 377 390) no Hoare annotation was computed. [2019-11-26 02:38:59,787 INFO L444 ceAbstractionStarter]: For program point L278(lines 278 390) no Hoare annotation was computed. [2019-11-26 02:38:59,787 INFO L444 ceAbstractionStarter]: For program point L245(lines 245 390) no Hoare annotation was computed. [2019-11-26 02:38:59,787 INFO L444 ceAbstractionStarter]: For program point L80(lines 80 390) no Hoare annotation was computed. [2019-11-26 02:38:59,787 INFO L444 ceAbstractionStarter]: For program point L345(lines 345 390) no Hoare annotation was computed. [2019-11-26 02:38:59,787 INFO L444 ceAbstractionStarter]: For program point L312(lines 312 390) no Hoare annotation was computed. [2019-11-26 02:38:59,788 INFO L444 ceAbstractionStarter]: For program point L114(lines 114 390) no Hoare annotation was computed. [2019-11-26 02:38:59,788 INFO L447 ceAbstractionStarter]: At program point L577(lines 577 594) the Hoare annotation is: true [2019-11-26 02:38:59,788 INFO L444 ceAbstractionStarter]: For program point L214(lines 214 390) no Hoare annotation was computed. [2019-11-26 02:38:59,788 INFO L444 ceAbstractionStarter]: For program point L148(lines 148 390) no Hoare annotation was computed. [2019-11-26 02:38:59,788 INFO L444 ceAbstractionStarter]: For program point L49(lines 49 390) no Hoare annotation was computed. [2019-11-26 02:38:59,788 INFO L444 ceAbstractionStarter]: For program point L84(lines 84 390) no Hoare annotation was computed. [2019-11-26 02:38:59,788 INFO L444 ceAbstractionStarter]: For program point L382(lines 382 390) no Hoare annotation was computed. [2019-11-26 02:38:59,788 INFO L444 ceAbstractionStarter]: For program point L316(lines 316 390) no Hoare annotation was computed. [2019-11-26 02:38:59,788 INFO L444 ceAbstractionStarter]: For program point L250(lines 250 390) no Hoare annotation was computed. [2019-11-26 02:38:59,788 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-26 02:38:59,788 INFO L444 ceAbstractionStarter]: For program point L218(lines 218 390) no Hoare annotation was computed. [2019-11-26 02:38:59,788 INFO L444 ceAbstractionStarter]: For program point L152(lines 152 390) no Hoare annotation was computed. [2019-11-26 02:38:59,788 INFO L444 ceAbstractionStarter]: For program point L119(lines 119 390) no Hoare annotation was computed. [2019-11-26 02:38:59,788 INFO L444 ceAbstractionStarter]: For program point L318(lines 318 390) no Hoare annotation was computed. [2019-11-26 02:38:59,788 INFO L444 ceAbstractionStarter]: For program point L186(lines 186 390) no Hoare annotation was computed. [2019-11-26 02:38:59,788 INFO L444 ceAbstractionStarter]: For program point L54(lines 54 390) no Hoare annotation was computed. [2019-11-26 02:38:59,789 INFO L440 ceAbstractionStarter]: At program point L583-2(lines 583 593) the Hoare annotation is: (let ((.cse7 (= ~a16~0 6)) (.cse8 (not (= 15 ~a8~0)))) (let ((.cse1 (<= ~a20~0 0)) (.cse9 (= ~a16~0 5)) (.cse5 (not (= 1 ~a7~0))) (.cse3 (<= ~a17~0 0)) (.cse11 (= ~a12~0 8)) (.cse6 (= ~a20~0 1)) (.cse0 (or (and (not .cse7) .cse8) (= 13 ~a8~0))) (.cse2 (= ~a16~0 4)) (.cse4 (= ~a21~0 1)) (.cse10 (= ~a17~0 1))) (or (and .cse0 .cse1) (and .cse2 .cse3 .cse4 .cse1) (and .cse2 .cse5 .cse3 .cse4 .cse6) (and .cse5 .cse4 .cse7 .cse1) (and .cse8 .cse5 .cse9) (and .cse5 .cse4 .cse6 .cse9) (and .cse5 .cse10 .cse11 .cse4 .cse1) (and .cse8 .cse4 .cse9) (and .cse4 .cse1 .cse9) (and .cse0 .cse4 .cse6) (and .cse5 .cse4 .cse6 .cse7) (and .cse0 .cse2 .cse3) (and .cse0 .cse10 .cse11 .cse6) (and .cse0 .cse7) (and .cse0 .cse2 .cse4 (not .cse10))))) [2019-11-26 02:38:59,789 INFO L444 ceAbstractionStarter]: For program point L286(lines 286 390) no Hoare annotation was computed. [2019-11-26 02:38:59,789 INFO L444 ceAbstractionStarter]: For program point L353(lines 353 390) no Hoare annotation was computed. [2019-11-26 02:38:59,789 INFO L444 ceAbstractionStarter]: For program point L189(lines 189 390) no Hoare annotation was computed. [2019-11-26 02:38:59,789 INFO L444 ceAbstractionStarter]: For program point L355(lines 355 390) no Hoare annotation was computed. [2019-11-26 02:38:59,789 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-26 02:38:59,789 INFO L444 ceAbstractionStarter]: For program point L256(lines 256 390) no Hoare annotation was computed. [2019-11-26 02:38:59,789 INFO L444 ceAbstractionStarter]: For program point L223(lines 223 390) no Hoare annotation was computed. [2019-11-26 02:38:59,789 INFO L444 ceAbstractionStarter]: For program point L124(lines 124 390) no Hoare annotation was computed. [2019-11-26 02:38:59,789 INFO L444 ceAbstractionStarter]: For program point L92(lines 92 390) no Hoare annotation was computed. [2019-11-26 02:38:59,789 INFO L444 ceAbstractionStarter]: For program point L588(line 588) no Hoare annotation was computed. [2019-11-26 02:38:59,789 INFO L444 ceAbstractionStarter]: For program point L324(lines 324 390) no Hoare annotation was computed. [2019-11-26 02:38:59,790 INFO L444 ceAbstractionStarter]: For program point L292(lines 292 390) no Hoare annotation was computed. [2019-11-26 02:38:59,790 INFO L444 ceAbstractionStarter]: For program point L160(lines 160 390) no Hoare annotation was computed. [2019-11-26 02:38:59,790 INFO L444 ceAbstractionStarter]: For program point L194(lines 194 390) no Hoare annotation was computed. [2019-11-26 02:38:59,790 INFO L444 ceAbstractionStarter]: For program point L62(lines 62 390) no Hoare annotation was computed. [2019-11-26 02:38:59,790 INFO L444 ceAbstractionStarter]: For program point L261(lines 261 390) no Hoare annotation was computed. [2019-11-26 02:38:59,790 INFO L444 ceAbstractionStarter]: For program point L129(lines 129 390) no Hoare annotation was computed. [2019-11-26 02:38:59,790 INFO L444 ceAbstractionStarter]: For program point L361(lines 361 390) no Hoare annotation was computed. [2019-11-26 02:38:59,791 INFO L444 ceAbstractionStarter]: For program point L97(lines 97 390) no Hoare annotation was computed. [2019-11-26 02:38:59,791 INFO L444 ceAbstractionStarter]: For program point L31(lines 31 390) no Hoare annotation was computed. [2019-11-26 02:38:59,791 INFO L444 ceAbstractionStarter]: For program point L329(lines 329 390) no Hoare annotation was computed. [2019-11-26 02:38:59,791 INFO L444 ceAbstractionStarter]: For program point L197(lines 197 390) no Hoare annotation was computed. [2019-11-26 02:38:59,791 INFO L444 ceAbstractionStarter]: For program point L65(lines 65 390) no Hoare annotation was computed. [2019-11-26 02:38:59,791 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 470) no Hoare annotation was computed. [2019-11-26 02:38:59,791 INFO L444 ceAbstractionStarter]: For program point L363(lines 363 390) no Hoare annotation was computed. [2019-11-26 02:38:59,792 INFO L444 ceAbstractionStarter]: For program point L231(lines 231 390) no Hoare annotation was computed. [2019-11-26 02:38:59,792 INFO L444 ceAbstractionStarter]: For program point L165(lines 165 390) no Hoare annotation was computed. [2019-11-26 02:38:59,792 INFO L444 ceAbstractionStarter]: For program point L265(lines 265 390) no Hoare annotation was computed. [2019-11-26 02:38:59,792 INFO L444 ceAbstractionStarter]: For program point L365(lines 365 390) no Hoare annotation was computed. [2019-11-26 02:38:59,792 INFO L444 ceAbstractionStarter]: For program point L299(lines 299 390) no Hoare annotation was computed. [2019-11-26 02:38:59,792 INFO L444 ceAbstractionStarter]: For program point L35(lines 35 390) no Hoare annotation was computed. [2019-11-26 02:38:59,815 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.11 02:38:59 BoogieIcfgContainer [2019-11-26 02:38:59,815 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-26 02:38:59,815 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-26 02:38:59,815 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-26 02:38:59,816 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-26 02:38:59,816 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 02:38:51" (3/4) ... [2019-11-26 02:38:59,819 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-26 02:38:59,840 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 99 nodes and edges [2019-11-26 02:38:59,842 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 19 nodes and edges [2019-11-26 02:38:59,843 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2019-11-26 02:38:59,997 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_68604199-911a-44a7-8634-ee8186fb8d29/bin/utaipan/witness.graphml [2019-11-26 02:38:59,997 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-26 02:38:59,998 INFO L168 Benchmark]: Toolchain (without parser) took 10922.72 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 274.7 MB). Free memory was 939.4 MB in the beginning and 1.0 GB in the end (delta: -88.8 MB). Peak memory consumption was 185.9 MB. Max. memory is 11.5 GB. [2019-11-26 02:38:59,999 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-26 02:38:59,999 INFO L168 Benchmark]: CACSL2BoogieTranslator took 659.46 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.2 MB). Free memory was 939.4 MB in the beginning and 1.1 GB in the end (delta: -183.0 MB). Peak memory consumption was 18.8 MB. Max. memory is 11.5 GB. [2019-11-26 02:38:59,999 INFO L168 Benchmark]: Boogie Procedure Inliner took 93.82 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: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-11-26 02:39:00,000 INFO L168 Benchmark]: Boogie Preprocessor took 86.49 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-26 02:39:00,000 INFO L168 Benchmark]: RCFGBuilder took 1792.64 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 898.2 MB in the end (delta: 212.2 MB). Peak memory consumption was 212.2 MB. Max. memory is 11.5 GB. [2019-11-26 02:39:00,001 INFO L168 Benchmark]: TraceAbstraction took 8103.71 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 130.5 MB). Free memory was 898.2 MB in the beginning and 1.0 GB in the end (delta: -149.9 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-11-26 02:39:00,001 INFO L168 Benchmark]: Witness Printer took 181.77 ms. Allocated memory is still 1.3 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 19.9 MB). Peak memory consumption was 19.9 MB. Max. memory is 11.5 GB. [2019-11-26 02:39:00,003 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.21 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 659.46 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.2 MB). Free memory was 939.4 MB in the beginning and 1.1 GB in the end (delta: -183.0 MB). Peak memory consumption was 18.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 93.82 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: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 86.49 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1792.64 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 898.2 MB in the end (delta: 212.2 MB). Peak memory consumption was 212.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 8103.71 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 130.5 MB). Free memory was 898.2 MB in the beginning and 1.0 GB in the end (delta: -149.9 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 181.77 ms. Allocated memory is still 1.3 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 19.9 MB). Peak memory consumption was 19.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 470]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 30]: Loop Invariant Derived loop invariant: ((((((((((((((((!(a16 == 6) && !(15 == a8)) || 13 == a8) && a20 <= 0) || (((a16 == 4 && a17 <= 0) && a21 == 1) && a20 <= 0)) || ((((a16 == 4 && !(1 == a7)) && a17 <= 0) && a21 == 1) && a20 == 1)) || (((!(1 == a7) && a21 == 1) && a16 == 6) && a20 <= 0)) || ((!(15 == a8) && !(1 == a7)) && a16 == 5)) || (((!(1 == a7) && a21 == 1) && a20 == 1) && a16 == 5)) || ((((!(1 == a7) && a17 == 1) && a12 == 8) && a21 == 1) && a20 <= 0)) || ((!(15 == a8) && a21 == 1) && a16 == 5)) || ((a21 == 1 && a20 <= 0) && a16 == 5)) || ((((!(a16 == 6) && !(15 == a8)) || 13 == a8) && a21 == 1) && a20 == 1)) || (((!(1 == a7) && a21 == 1) && a20 == 1) && a16 == 6)) || ((((!(a16 == 6) && !(15 == a8)) || 13 == a8) && a16 == 4) && a17 <= 0)) || (((((!(a16 == 6) && !(15 == a8)) || 13 == a8) && a17 == 1) && a12 == 8) && a20 == 1)) || (((!(a16 == 6) && !(15 == a8)) || 13 == a8) && a16 == 6)) || (((((!(a16 == 6) && !(15 == a8)) || 13 == a8) && a16 == 4) && a21 == 1) && !(a17 == 1)) - InvariantResult [Line: 577]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 583]: Loop Invariant Derived loop invariant: ((((((((((((((((!(a16 == 6) && !(15 == a8)) || 13 == a8) && a20 <= 0) || (((a16 == 4 && a17 <= 0) && a21 == 1) && a20 <= 0)) || ((((a16 == 4 && !(1 == a7)) && a17 <= 0) && a21 == 1) && a20 == 1)) || (((!(1 == a7) && a21 == 1) && a16 == 6) && a20 <= 0)) || ((!(15 == a8) && !(1 == a7)) && a16 == 5)) || (((!(1 == a7) && a21 == 1) && a20 == 1) && a16 == 5)) || ((((!(1 == a7) && a17 == 1) && a12 == 8) && a21 == 1) && a20 <= 0)) || ((!(15 == a8) && a21 == 1) && a16 == 5)) || ((a21 == 1 && a20 <= 0) && a16 == 5)) || ((((!(a16 == 6) && !(15 == a8)) || 13 == a8) && a21 == 1) && a20 == 1)) || (((!(1 == a7) && a21 == 1) && a20 == 1) && a16 == 6)) || ((((!(a16 == 6) && !(15 == a8)) || 13 == a8) && a16 == 4) && a17 <= 0)) || (((((!(a16 == 6) && !(15 == a8)) || 13 == a8) && a17 == 1) && a12 == 8) && a20 == 1)) || (((!(a16 == 6) && !(15 == a8)) || 13 == a8) && a16 == 6)) || (((((!(a16 == 6) && !(15 == a8)) || 13 == a8) && a16 == 4) && a21 == 1) && !(a17 == 1)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 76 locations, 1 error locations. Result: SAFE, OverallTime: 8.0s, OverallIterations: 12, TraceHistogramMax: 6, AutomataDifference: 5.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.8s, HoareTripleCheckerStatistics: 645 SDtfs, 1516 SDslu, 94 SDs, 0 SdLazy, 3631 SolverSat, 756 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 54 GetRequests, 19 SyntacticMatches, 9 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1068occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 12 MinimizatonAttempts, 1032 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 46 NumberOfFragments, 489 HoareAnnotationTreeSize, 3 FomulaSimplifications, 2761 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 3 FomulaSimplificationsInter, 323 FormulaSimplificationTreeSizeReductionInter, 0.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 1545 NumberOfCodeBlocks, 1545 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 1533 ConstructedInterpolants, 0 QuantifiedInterpolants, 497891 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 1309/1309 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...