./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem01_label10.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_2ec5fffa-0932-481b-83af-56bdf564944e/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_2ec5fffa-0932-481b-83af-56bdf564944e/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_2ec5fffa-0932-481b-83af-56bdf564944e/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_2ec5fffa-0932-481b-83af-56bdf564944e/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem01_label10.c -s /tmp/vcloud-vcloud-master/worker/run_dir_2ec5fffa-0932-481b-83af-56bdf564944e/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_2ec5fffa-0932-481b-83af-56bdf564944e/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 d90d90ab0f83213f6e486d9f5a42850d0f82e05d .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 16:57:11,052 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 16:57:11,053 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 16:57:11,060 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 16:57:11,060 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 16:57:11,061 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 16:57:11,062 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 16:57:11,063 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 16:57:11,064 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 16:57:11,065 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 16:57:11,066 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 16:57:11,066 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 16:57:11,067 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 16:57:11,067 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 16:57:11,068 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 16:57:11,069 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 16:57:11,069 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 16:57:11,070 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 16:57:11,071 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 16:57:11,073 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 16:57:11,074 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 16:57:11,074 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 16:57:11,075 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 16:57:11,075 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 16:57:11,077 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 16:57:11,077 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 16:57:11,078 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 16:57:11,078 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 16:57:11,078 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 16:57:11,079 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 16:57:11,079 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 16:57:11,079 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 16:57:11,080 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 16:57:11,081 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 16:57:11,081 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 16:57:11,082 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 16:57:11,082 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 16:57:11,082 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 16:57:11,083 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 16:57:11,083 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 16:57:11,084 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 16:57:11,085 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_2ec5fffa-0932-481b-83af-56bdf564944e/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-12-07 16:57:11,098 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 16:57:11,098 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 16:57:11,099 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 16:57:11,099 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 16:57:11,099 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 16:57:11,099 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 16:57:11,099 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-12-07 16:57:11,100 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 16:57:11,100 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 16:57:11,100 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-12-07 16:57:11,100 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-12-07 16:57:11,100 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 16:57:11,101 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-12-07 16:57:11,101 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-12-07 16:57:11,101 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-12-07 16:57:11,102 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 16:57:11,102 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 16:57:11,102 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 16:57:11,102 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 16:57:11,102 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 16:57:11,102 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 16:57:11,103 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 16:57:11,103 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 16:57:11,103 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 16:57:11,103 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 16:57:11,103 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 16:57:11,103 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 16:57:11,104 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 16:57:11,104 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 16:57:11,104 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 16:57:11,104 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 16:57:11,104 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 16:57:11,104 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 16:57:11,105 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 16:57:11,105 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 16:57:11,105 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-12-07 16:57:11,105 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 16:57:11,105 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 16:57:11,105 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 16:57:11,106 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 16:57:11,106 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_2ec5fffa-0932-481b-83af-56bdf564944e/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 -> d90d90ab0f83213f6e486d9f5a42850d0f82e05d [2019-12-07 16:57:11,214 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 16:57:11,222 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 16:57:11,224 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 16:57:11,225 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 16:57:11,225 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 16:57:11,226 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_2ec5fffa-0932-481b-83af-56bdf564944e/bin/utaipan/../../sv-benchmarks/c/eca-rers2012/Problem01_label10.c [2019-12-07 16:57:11,262 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_2ec5fffa-0932-481b-83af-56bdf564944e/bin/utaipan/data/f3c1dbc9e/9cc027ec6b7f496f912303853f77821f/FLAG3b2ca329e [2019-12-07 16:57:11,737 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 16:57:11,738 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_2ec5fffa-0932-481b-83af-56bdf564944e/sv-benchmarks/c/eca-rers2012/Problem01_label10.c [2019-12-07 16:57:11,746 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_2ec5fffa-0932-481b-83af-56bdf564944e/bin/utaipan/data/f3c1dbc9e/9cc027ec6b7f496f912303853f77821f/FLAG3b2ca329e [2019-12-07 16:57:11,755 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_2ec5fffa-0932-481b-83af-56bdf564944e/bin/utaipan/data/f3c1dbc9e/9cc027ec6b7f496f912303853f77821f [2019-12-07 16:57:11,757 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 16:57:11,758 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 16:57:11,759 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 16:57:11,759 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 16:57:11,761 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 16:57:11,762 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 04:57:11" (1/1) ... [2019-12-07 16:57:11,764 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c51c803 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:57:11, skipping insertion in model container [2019-12-07 16:57:11,764 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 04:57:11" (1/1) ... [2019-12-07 16:57:11,769 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 16:57:11,797 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 16:57:12,030 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 16:57:12,034 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 16:57:12,086 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 16:57:12,096 INFO L208 MainTranslator]: Completed translation [2019-12-07 16:57:12,096 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:57:12 WrapperNode [2019-12-07 16:57:12,096 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 16:57:12,097 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 16:57:12,097 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 16:57:12,097 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 16:57:12,102 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:57:12" (1/1) ... [2019-12-07 16:57:12,115 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:57:12" (1/1) ... [2019-12-07 16:57:12,147 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 16:57:12,147 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 16:57:12,147 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 16:57:12,147 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 16:57:12,154 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:57:12" (1/1) ... [2019-12-07 16:57:12,154 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:57:12" (1/1) ... [2019-12-07 16:57:12,157 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:57:12" (1/1) ... [2019-12-07 16:57:12,157 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:57:12" (1/1) ... [2019-12-07 16:57:12,171 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:57:12" (1/1) ... [2019-12-07 16:57:12,178 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:57:12" (1/1) ... [2019-12-07 16:57:12,182 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:57:12" (1/1) ... [2019-12-07 16:57:12,187 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 16:57:12,188 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 16:57:12,188 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 16:57:12,188 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 16:57:12,188 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:57:12" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2ec5fffa-0932-481b-83af-56bdf564944e/bin/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 16:57:12,230 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 16:57:12,230 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 16:57:13,275 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 16:57:13,276 INFO L287 CfgBuilder]: Removed 7 assume(true) statements. [2019-12-07 16:57:13,277 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 04:57:13 BoogieIcfgContainer [2019-12-07 16:57:13,277 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 16:57:13,278 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 16:57:13,278 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 16:57:13,280 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 16:57:13,280 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 04:57:11" (1/3) ... [2019-12-07 16:57:13,281 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@388f69ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 04:57:13, skipping insertion in model container [2019-12-07 16:57:13,281 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:57:12" (2/3) ... [2019-12-07 16:57:13,281 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@388f69ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 04:57:13, skipping insertion in model container [2019-12-07 16:57:13,281 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 04:57:13" (3/3) ... [2019-12-07 16:57:13,282 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem01_label10.c [2019-12-07 16:57:13,289 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 16:57:13,295 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-07 16:57:13,302 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-12-07 16:57:13,319 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 16:57:13,319 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 16:57:13,319 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 16:57:13,319 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 16:57:13,319 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 16:57:13,319 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 16:57:13,319 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 16:57:13,319 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 16:57:13,331 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states. [2019-12-07 16:57:13,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-12-07 16:57:13,336 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:57:13,337 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-12-07 16:57:13,337 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:57:13,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:57:13,341 INFO L82 PathProgramCache]: Analyzing trace with hash -1323234201, now seen corresponding path program 1 times [2019-12-07 16:57:13,347 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:57:13,348 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051540744] [2019-12-07 16:57:13,348 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:57:13,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:57:13,587 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:57:13,587 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051540744] [2019-12-07 16:57:13,588 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:57:13,588 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 16:57:13,590 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579900886] [2019-12-07 16:57:13,594 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:57:13,594 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:57:13,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:57:13,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:57:13,608 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 4 states. [2019-12-07 16:57:14,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:57:14,026 INFO L93 Difference]: Finished difference Result 297 states and 569 transitions. [2019-12-07 16:57:14,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 16:57:14,027 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 71 [2019-12-07 16:57:14,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:57:14,037 INFO L225 Difference]: With dead ends: 297 [2019-12-07 16:57:14,037 INFO L226 Difference]: Without dead ends: 216 [2019-12-07 16:57:14,040 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-12-07 16:57:14,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2019-12-07 16:57:14,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 216. [2019-12-07 16:57:14,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2019-12-07 16:57:14,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 378 transitions. [2019-12-07 16:57:14,076 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 378 transitions. Word has length 71 [2019-12-07 16:57:14,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:57:14,077 INFO L462 AbstractCegarLoop]: Abstraction has 216 states and 378 transitions. [2019-12-07 16:57:14,077 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:57:14,077 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 378 transitions. [2019-12-07 16:57:14,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-12-07 16:57:14,080 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:57:14,080 INFO L410 BasicCegarLoop]: trace histogram [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, 1] [2019-12-07 16:57:14,080 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:57:14,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:57:14,080 INFO L82 PathProgramCache]: Analyzing trace with hash 585783519, now seen corresponding path program 1 times [2019-12-07 16:57:14,080 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:57:14,081 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576638283] [2019-12-07 16:57:14,081 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:57:14,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:57:14,119 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:57:14,120 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576638283] [2019-12-07 16:57:14,120 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:57:14,120 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 16:57:14,120 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756415246] [2019-12-07 16:57:14,121 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:57:14,121 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:57:14,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:57:14,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:57:14,122 INFO L87 Difference]: Start difference. First operand 216 states and 378 transitions. Second operand 4 states. [2019-12-07 16:57:14,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:57:14,368 INFO L93 Difference]: Finished difference Result 644 states and 1131 transitions. [2019-12-07 16:57:14,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:57:14,369 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2019-12-07 16:57:14,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:57:14,371 INFO L225 Difference]: With dead ends: 644 [2019-12-07 16:57:14,372 INFO L226 Difference]: Without dead ends: 429 [2019-12-07 16:57:14,373 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-12-07 16:57:14,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2019-12-07 16:57:14,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 429. [2019-12-07 16:57:14,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 429 states. [2019-12-07 16:57:14,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 705 transitions. [2019-12-07 16:57:14,391 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 705 transitions. Word has length 76 [2019-12-07 16:57:14,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:57:14,391 INFO L462 AbstractCegarLoop]: Abstraction has 429 states and 705 transitions. [2019-12-07 16:57:14,391 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:57:14,391 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 705 transitions. [2019-12-07 16:57:14,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-07 16:57:14,394 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:57:14,394 INFO L410 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:57:14,394 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:57:14,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:57:14,394 INFO L82 PathProgramCache]: Analyzing trace with hash 928590825, now seen corresponding path program 1 times [2019-12-07 16:57:14,394 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:57:14,395 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4182698] [2019-12-07 16:57:14,395 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:57:14,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:57:14,436 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-12-07 16:57:14,437 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4182698] [2019-12-07 16:57:14,437 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:57:14,437 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 16:57:14,437 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539767274] [2019-12-07 16:57:14,438 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:57:14,438 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:57:14,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:57:14,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:57:14,438 INFO L87 Difference]: Start difference. First operand 429 states and 705 transitions. Second operand 3 states. [2019-12-07 16:57:14,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:57:14,653 INFO L93 Difference]: Finished difference Result 1070 states and 1785 transitions. [2019-12-07 16:57:14,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:57:14,654 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 97 [2019-12-07 16:57:14,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:57:14,657 INFO L225 Difference]: With dead ends: 1070 [2019-12-07 16:57:14,657 INFO L226 Difference]: Without dead ends: 642 [2019-12-07 16:57:14,658 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-12-07 16:57:14,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 642 states. [2019-12-07 16:57:14,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 642 to 500. [2019-12-07 16:57:14,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 500 states. [2019-12-07 16:57:14,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 825 transitions. [2019-12-07 16:57:14,671 INFO L78 Accepts]: Start accepts. Automaton has 500 states and 825 transitions. Word has length 97 [2019-12-07 16:57:14,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:57:14,671 INFO L462 AbstractCegarLoop]: Abstraction has 500 states and 825 transitions. [2019-12-07 16:57:14,671 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:57:14,671 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 825 transitions. [2019-12-07 16:57:14,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-12-07 16:57:14,673 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:57:14,673 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 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] [2019-12-07 16:57:14,673 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:57:14,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:57:14,673 INFO L82 PathProgramCache]: Analyzing trace with hash -1330793460, now seen corresponding path program 1 times [2019-12-07 16:57:14,674 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:57:14,674 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636795928] [2019-12-07 16:57:14,674 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:57:14,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:57:14,723 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2019-12-07 16:57:14,723 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636795928] [2019-12-07 16:57:14,723 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:57:14,723 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 16:57:14,723 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488218141] [2019-12-07 16:57:14,724 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:57:14,724 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:57:14,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:57:14,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:57:14,724 INFO L87 Difference]: Start difference. First operand 500 states and 825 transitions. Second operand 3 states. [2019-12-07 16:57:14,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:57:14,921 INFO L93 Difference]: Finished difference Result 1212 states and 1976 transitions. [2019-12-07 16:57:14,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:57:14,921 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 133 [2019-12-07 16:57:14,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:57:14,926 INFO L225 Difference]: With dead ends: 1212 [2019-12-07 16:57:14,926 INFO L226 Difference]: Without dead ends: 713 [2019-12-07 16:57:14,927 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-12-07 16:57:14,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 713 states. [2019-12-07 16:57:14,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 713 to 571. [2019-12-07 16:57:14,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 571 states. [2019-12-07 16:57:14,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 571 states to 571 states and 889 transitions. [2019-12-07 16:57:14,943 INFO L78 Accepts]: Start accepts. Automaton has 571 states and 889 transitions. Word has length 133 [2019-12-07 16:57:14,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:57:14,943 INFO L462 AbstractCegarLoop]: Abstraction has 571 states and 889 transitions. [2019-12-07 16:57:14,943 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:57:14,943 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 889 transitions. [2019-12-07 16:57:14,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-12-07 16:57:14,945 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:57:14,945 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 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] [2019-12-07 16:57:14,946 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:57:14,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:57:14,946 INFO L82 PathProgramCache]: Analyzing trace with hash -573611104, now seen corresponding path program 1 times [2019-12-07 16:57:14,946 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:57:14,946 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946560988] [2019-12-07 16:57:14,947 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:57:14,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:57:15,027 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2019-12-07 16:57:15,027 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946560988] [2019-12-07 16:57:15,027 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:57:15,027 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 16:57:15,027 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168689664] [2019-12-07 16:57:15,028 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:57:15,028 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:57:15,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:57:15,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:57:15,028 INFO L87 Difference]: Start difference. First operand 571 states and 889 transitions. Second operand 4 states. [2019-12-07 16:57:15,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:57:15,313 INFO L93 Difference]: Finished difference Result 1229 states and 1883 transitions. [2019-12-07 16:57:15,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 16:57:15,313 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 141 [2019-12-07 16:57:15,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:57:15,317 INFO L225 Difference]: With dead ends: 1229 [2019-12-07 16:57:15,317 INFO L226 Difference]: Without dead ends: 659 [2019-12-07 16:57:15,318 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 16:57:15,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 659 states. [2019-12-07 16:57:15,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 659 to 642. [2019-12-07 16:57:15,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 642 states. [2019-12-07 16:57:15,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 966 transitions. [2019-12-07 16:57:15,334 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 966 transitions. Word has length 141 [2019-12-07 16:57:15,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:57:15,334 INFO L462 AbstractCegarLoop]: Abstraction has 642 states and 966 transitions. [2019-12-07 16:57:15,335 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:57:15,335 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 966 transitions. [2019-12-07 16:57:15,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-12-07 16:57:15,337 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:57:15,337 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 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] [2019-12-07 16:57:15,337 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:57:15,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:57:15,338 INFO L82 PathProgramCache]: Analyzing trace with hash 925212632, now seen corresponding path program 1 times [2019-12-07 16:57:15,338 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:57:15,338 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449344120] [2019-12-07 16:57:15,338 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:57:15,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:57:15,398 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 101 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2019-12-07 16:57:15,398 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449344120] [2019-12-07 16:57:15,398 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:57:15,398 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 16:57:15,399 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300443826] [2019-12-07 16:57:15,399 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:57:15,399 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:57:15,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:57:15,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:57:15,400 INFO L87 Difference]: Start difference. First operand 642 states and 966 transitions. Second operand 4 states. [2019-12-07 16:57:15,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:57:15,782 INFO L93 Difference]: Finished difference Result 1567 states and 2365 transitions. [2019-12-07 16:57:15,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 16:57:15,782 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 145 [2019-12-07 16:57:15,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:57:15,787 INFO L225 Difference]: With dead ends: 1567 [2019-12-07 16:57:15,788 INFO L226 Difference]: Without dead ends: 997 [2019-12-07 16:57:15,789 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-12-07 16:57:15,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 997 states. [2019-12-07 16:57:15,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 997 to 784. [2019-12-07 16:57:15,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 784 states. [2019-12-07 16:57:15,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 784 states to 784 states and 1138 transitions. [2019-12-07 16:57:15,808 INFO L78 Accepts]: Start accepts. Automaton has 784 states and 1138 transitions. Word has length 145 [2019-12-07 16:57:15,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:57:15,808 INFO L462 AbstractCegarLoop]: Abstraction has 784 states and 1138 transitions. [2019-12-07 16:57:15,808 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:57:15,808 INFO L276 IsEmpty]: Start isEmpty. Operand 784 states and 1138 transitions. [2019-12-07 16:57:15,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-12-07 16:57:15,811 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:57:15,811 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 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] [2019-12-07 16:57:15,811 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:57:15,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:57:15,811 INFO L82 PathProgramCache]: Analyzing trace with hash -1683943653, now seen corresponding path program 1 times [2019-12-07 16:57:15,812 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:57:15,812 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105314529] [2019-12-07 16:57:15,812 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:57:15,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:57:15,946 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2019-12-07 16:57:15,946 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105314529] [2019-12-07 16:57:15,946 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:57:15,946 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 16:57:15,946 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428203559] [2019-12-07 16:57:15,947 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 16:57:15,947 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:57:15,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 16:57:15,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-12-07 16:57:15,947 INFO L87 Difference]: Start difference. First operand 784 states and 1138 transitions. Second operand 8 states. [2019-12-07 16:57:16,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:57:16,466 INFO L93 Difference]: Finished difference Result 1742 states and 2534 transitions. [2019-12-07 16:57:16,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 16:57:16,466 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 159 [2019-12-07 16:57:16,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:57:16,471 INFO L225 Difference]: With dead ends: 1742 [2019-12-07 16:57:16,471 INFO L226 Difference]: Without dead ends: 1030 [2019-12-07 16:57:16,472 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-12-07 16:57:16,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1030 states. [2019-12-07 16:57:16,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1030 to 926. [2019-12-07 16:57:16,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 926 states. [2019-12-07 16:57:16,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 926 states to 926 states and 1316 transitions. [2019-12-07 16:57:16,486 INFO L78 Accepts]: Start accepts. Automaton has 926 states and 1316 transitions. Word has length 159 [2019-12-07 16:57:16,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:57:16,487 INFO L462 AbstractCegarLoop]: Abstraction has 926 states and 1316 transitions. [2019-12-07 16:57:16,487 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 16:57:16,487 INFO L276 IsEmpty]: Start isEmpty. Operand 926 states and 1316 transitions. [2019-12-07 16:57:16,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-12-07 16:57:16,489 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:57:16,489 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 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] [2019-12-07 16:57:16,489 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:57:16,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:57:16,489 INFO L82 PathProgramCache]: Analyzing trace with hash 311590294, now seen corresponding path program 1 times [2019-12-07 16:57:16,489 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:57:16,489 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678097097] [2019-12-07 16:57:16,489 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:57:16,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:57:16,537 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 114 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2019-12-07 16:57:16,538 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678097097] [2019-12-07 16:57:16,538 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:57:16,538 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 16:57:16,538 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079187734] [2019-12-07 16:57:16,538 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:57:16,538 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:57:16,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:57:16,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:57:16,539 INFO L87 Difference]: Start difference. First operand 926 states and 1316 transitions. Second operand 4 states. [2019-12-07 16:57:16,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:57:16,894 INFO L93 Difference]: Finished difference Result 2277 states and 3219 transitions. [2019-12-07 16:57:16,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 16:57:16,894 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 162 [2019-12-07 16:57:16,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:57:16,900 INFO L225 Difference]: With dead ends: 2277 [2019-12-07 16:57:16,900 INFO L226 Difference]: Without dead ends: 1068 [2019-12-07 16:57:16,901 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-12-07 16:57:16,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1068 states. [2019-12-07 16:57:16,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1068 to 926. [2019-12-07 16:57:16,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 926 states. [2019-12-07 16:57:16,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 926 states to 926 states and 1072 transitions. [2019-12-07 16:57:16,922 INFO L78 Accepts]: Start accepts. Automaton has 926 states and 1072 transitions. Word has length 162 [2019-12-07 16:57:16,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:57:16,923 INFO L462 AbstractCegarLoop]: Abstraction has 926 states and 1072 transitions. [2019-12-07 16:57:16,923 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:57:16,923 INFO L276 IsEmpty]: Start isEmpty. Operand 926 states and 1072 transitions. [2019-12-07 16:57:16,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-12-07 16:57:16,926 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:57:16,926 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 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, 1] [2019-12-07 16:57:16,926 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:57:16,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:57:16,926 INFO L82 PathProgramCache]: Analyzing trace with hash -114222837, now seen corresponding path program 1 times [2019-12-07 16:57:16,927 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:57:16,927 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995905776] [2019-12-07 16:57:16,927 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:57:16,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:57:17,032 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 205 proven. 27 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-12-07 16:57:17,033 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995905776] [2019-12-07 16:57:17,033 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1608965255] [2019-12-07 16:57:17,033 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2ec5fffa-0932-481b-83af-56bdf564944e/bin/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 16:57:17,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:57:17,121 INFO L264 TraceCheckSpWp]: Trace formula consists of 430 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 16:57:17,131 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:57:17,178 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 184 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-12-07 16:57:17,179 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 16:57:17,220 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 184 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-12-07 16:57:17,220 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-12-07 16:57:17,221 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [5] total 7 [2019-12-07 16:57:17,221 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908929159] [2019-12-07 16:57:17,221 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:57:17,222 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:57:17,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:57:17,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-12-07 16:57:17,222 INFO L87 Difference]: Start difference. First operand 926 states and 1072 transitions. Second operand 3 states. [2019-12-07 16:57:17,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:57:17,394 INFO L93 Difference]: Finished difference Result 926 states and 1072 transitions. [2019-12-07 16:57:17,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:57:17,395 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 192 [2019-12-07 16:57:17,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:57:17,396 INFO L225 Difference]: With dead ends: 926 [2019-12-07 16:57:17,396 INFO L226 Difference]: Without dead ends: 0 [2019-12-07 16:57:17,397 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 389 GetRequests, 382 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-12-07 16:57:17,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-12-07 16:57:17,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-12-07 16:57:17,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-12-07 16:57:17,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-12-07 16:57:17,398 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 192 [2019-12-07 16:57:17,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:57:17,398 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-12-07 16:57:17,398 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:57:17,398 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-12-07 16:57:17,398 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-12-07 16:57:17,599 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 16:57:17,601 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-12-07 16:57:17,905 INFO L246 CegarLoopResult]: For program point L333(lines 333 390) no Hoare annotation was computed. [2019-12-07 16:57:17,906 INFO L246 CegarLoopResult]: For program point L102(lines 102 390) no Hoare annotation was computed. [2019-12-07 16:57:17,906 INFO L246 CegarLoopResult]: For program point L268(lines 268 390) no Hoare annotation was computed. [2019-12-07 16:57:17,906 INFO L246 CegarLoopResult]: For program point L136(lines 136 390) no Hoare annotation was computed. [2019-12-07 16:57:17,906 INFO L246 CegarLoopResult]: For program point L203(lines 203 390) no Hoare annotation was computed. [2019-12-07 16:57:17,906 INFO L246 CegarLoopResult]: For program point L72(lines 72 390) no Hoare annotation was computed. [2019-12-07 16:57:17,906 INFO L246 CegarLoopResult]: For program point L502-1(lines 30 575) no Hoare annotation was computed. [2019-12-07 16:57:17,906 INFO L246 CegarLoopResult]: For program point L337(lines 337 390) no Hoare annotation was computed. [2019-12-07 16:57:17,906 INFO L246 CegarLoopResult]: For program point L238(lines 238 390) no Hoare annotation was computed. [2019-12-07 16:57:17,907 INFO L246 CegarLoopResult]: For program point L173(lines 173 390) no Hoare annotation was computed. [2019-12-07 16:57:17,907 INFO L246 CegarLoopResult]: For program point L140(lines 140 390) no Hoare annotation was computed. [2019-12-07 16:57:17,907 INFO L246 CegarLoopResult]: For program point L372(lines 372 390) no Hoare annotation was computed. [2019-12-07 16:57:17,907 INFO L246 CegarLoopResult]: For program point L306(lines 306 390) no Hoare annotation was computed. [2019-12-07 16:57:17,907 INFO L246 CegarLoopResult]: For program point L273(lines 273 390) no Hoare annotation was computed. [2019-12-07 16:57:17,907 INFO L246 CegarLoopResult]: For program point L108(lines 108 390) no Hoare annotation was computed. [2019-12-07 16:57:17,907 INFO L246 CegarLoopResult]: For program point L505-1(lines 30 575) no Hoare annotation was computed. [2019-12-07 16:57:17,907 INFO L246 CegarLoopResult]: For program point L208(lines 208 390) no Hoare annotation was computed. [2019-12-07 16:57:17,907 INFO L246 CegarLoopResult]: For program point L43(lines 43 390) no Hoare annotation was computed. [2019-12-07 16:57:17,908 INFO L246 CegarLoopResult]: For program point L506(line 506) no Hoare annotation was computed. [2019-12-07 16:57:17,908 INFO L246 CegarLoopResult]: For program point L144(lines 144 390) no Hoare annotation was computed. [2019-12-07 16:57:17,908 INFO L242 CegarLoopResult]: At program point L574(lines 30 575) the Hoare annotation is: (let ((.cse0 (= ~a21~0 1))) (or (and (<= ~a21~0 0) (= 13 ~a8~0)) (and (not (= ~a16~0 6)) .cse0) (and .cse0 (= 15 ~a8~0)) (and (= ~a17~0 1) .cse0))) [2019-12-07 16:57:17,908 INFO L246 CegarLoopResult]: For program point L178(lines 178 390) no Hoare annotation was computed. [2019-12-07 16:57:17,908 INFO L246 CegarLoopResult]: For program point L377(lines 377 390) no Hoare annotation was computed. [2019-12-07 16:57:17,908 INFO L246 CegarLoopResult]: For program point L278(lines 278 390) no Hoare annotation was computed. [2019-12-07 16:57:17,908 INFO L246 CegarLoopResult]: For program point L245(lines 245 390) no Hoare annotation was computed. [2019-12-07 16:57:17,909 INFO L246 CegarLoopResult]: For program point L80(lines 80 390) no Hoare annotation was computed. [2019-12-07 16:57:17,909 INFO L246 CegarLoopResult]: For program point L345(lines 345 390) no Hoare annotation was computed. [2019-12-07 16:57:17,909 INFO L246 CegarLoopResult]: For program point L312(lines 312 390) no Hoare annotation was computed. [2019-12-07 16:57:17,909 INFO L246 CegarLoopResult]: For program point L114(lines 114 390) no Hoare annotation was computed. [2019-12-07 16:57:17,909 INFO L249 CegarLoopResult]: At program point L577(lines 577 594) the Hoare annotation is: true [2019-12-07 16:57:17,909 INFO L246 CegarLoopResult]: For program point L214(lines 214 390) no Hoare annotation was computed. [2019-12-07 16:57:17,909 INFO L246 CegarLoopResult]: For program point L148(lines 148 390) no Hoare annotation was computed. [2019-12-07 16:57:17,909 INFO L246 CegarLoopResult]: For program point L49(lines 49 390) no Hoare annotation was computed. [2019-12-07 16:57:17,909 INFO L246 CegarLoopResult]: For program point L84(lines 84 390) no Hoare annotation was computed. [2019-12-07 16:57:17,910 INFO L246 CegarLoopResult]: For program point L382(lines 382 390) no Hoare annotation was computed. [2019-12-07 16:57:17,910 INFO L246 CegarLoopResult]: For program point L316(lines 316 390) no Hoare annotation was computed. [2019-12-07 16:57:17,910 INFO L246 CegarLoopResult]: For program point L250(lines 250 390) no Hoare annotation was computed. [2019-12-07 16:57:17,910 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-12-07 16:57:17,910 INFO L246 CegarLoopResult]: For program point L218(lines 218 390) no Hoare annotation was computed. [2019-12-07 16:57:17,910 INFO L246 CegarLoopResult]: For program point L152(lines 152 390) no Hoare annotation was computed. [2019-12-07 16:57:17,910 INFO L246 CegarLoopResult]: For program point L119(lines 119 390) no Hoare annotation was computed. [2019-12-07 16:57:17,910 INFO L246 CegarLoopResult]: For program point L318(lines 318 390) no Hoare annotation was computed. [2019-12-07 16:57:17,910 INFO L246 CegarLoopResult]: For program point L186(lines 186 390) no Hoare annotation was computed. [2019-12-07 16:57:17,910 INFO L246 CegarLoopResult]: For program point L54(lines 54 390) no Hoare annotation was computed. [2019-12-07 16:57:17,911 INFO L242 CegarLoopResult]: At program point L583-2(lines 583 593) the Hoare annotation is: (let ((.cse0 (= ~a21~0 1))) (or (and (<= ~a21~0 0) (= 13 ~a8~0)) (and (not (= ~a16~0 6)) .cse0) (and .cse0 (= 15 ~a8~0)) (and (= ~a17~0 1) .cse0))) [2019-12-07 16:57:17,911 INFO L246 CegarLoopResult]: For program point L286(lines 286 390) no Hoare annotation was computed. [2019-12-07 16:57:17,911 INFO L246 CegarLoopResult]: For program point L353(lines 353 390) no Hoare annotation was computed. [2019-12-07 16:57:17,911 INFO L246 CegarLoopResult]: For program point L189(lines 189 390) no Hoare annotation was computed. [2019-12-07 16:57:17,911 INFO L246 CegarLoopResult]: For program point L355(lines 355 390) no Hoare annotation was computed. [2019-12-07 16:57:17,911 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-12-07 16:57:17,911 INFO L246 CegarLoopResult]: For program point L256(lines 256 390) no Hoare annotation was computed. [2019-12-07 16:57:17,911 INFO L246 CegarLoopResult]: For program point L223(lines 223 390) no Hoare annotation was computed. [2019-12-07 16:57:17,911 INFO L246 CegarLoopResult]: For program point L124(lines 124 390) no Hoare annotation was computed. [2019-12-07 16:57:17,912 INFO L246 CegarLoopResult]: For program point L92(lines 92 390) no Hoare annotation was computed. [2019-12-07 16:57:17,912 INFO L246 CegarLoopResult]: For program point L588(line 588) no Hoare annotation was computed. [2019-12-07 16:57:17,912 INFO L246 CegarLoopResult]: For program point L324(lines 324 390) no Hoare annotation was computed. [2019-12-07 16:57:17,912 INFO L246 CegarLoopResult]: For program point L292(lines 292 390) no Hoare annotation was computed. [2019-12-07 16:57:17,912 INFO L246 CegarLoopResult]: For program point L160(lines 160 390) no Hoare annotation was computed. [2019-12-07 16:57:17,912 INFO L246 CegarLoopResult]: For program point L194(lines 194 390) no Hoare annotation was computed. [2019-12-07 16:57:17,912 INFO L246 CegarLoopResult]: For program point L62(lines 62 390) no Hoare annotation was computed. [2019-12-07 16:57:17,912 INFO L246 CegarLoopResult]: For program point L261(lines 261 390) no Hoare annotation was computed. [2019-12-07 16:57:17,912 INFO L246 CegarLoopResult]: For program point L129(lines 129 390) no Hoare annotation was computed. [2019-12-07 16:57:17,912 INFO L246 CegarLoopResult]: For program point L361(lines 361 390) no Hoare annotation was computed. [2019-12-07 16:57:17,913 INFO L246 CegarLoopResult]: For program point L97(lines 97 390) no Hoare annotation was computed. [2019-12-07 16:57:17,913 INFO L246 CegarLoopResult]: For program point L31(lines 31 390) no Hoare annotation was computed. [2019-12-07 16:57:17,913 INFO L246 CegarLoopResult]: For program point L329(lines 329 390) no Hoare annotation was computed. [2019-12-07 16:57:17,913 INFO L246 CegarLoopResult]: For program point L197(lines 197 390) no Hoare annotation was computed. [2019-12-07 16:57:17,913 INFO L246 CegarLoopResult]: For program point L65(lines 65 390) no Hoare annotation was computed. [2019-12-07 16:57:17,913 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 506) no Hoare annotation was computed. [2019-12-07 16:57:17,913 INFO L246 CegarLoopResult]: For program point L363(lines 363 390) no Hoare annotation was computed. [2019-12-07 16:57:17,913 INFO L246 CegarLoopResult]: For program point L231(lines 231 390) no Hoare annotation was computed. [2019-12-07 16:57:17,913 INFO L246 CegarLoopResult]: For program point L165(lines 165 390) no Hoare annotation was computed. [2019-12-07 16:57:17,913 INFO L246 CegarLoopResult]: For program point L265(lines 265 390) no Hoare annotation was computed. [2019-12-07 16:57:17,914 INFO L246 CegarLoopResult]: For program point L365(lines 365 390) no Hoare annotation was computed. [2019-12-07 16:57:17,914 INFO L246 CegarLoopResult]: For program point L299(lines 299 390) no Hoare annotation was computed. [2019-12-07 16:57:17,914 INFO L246 CegarLoopResult]: For program point L35(lines 35 390) no Hoare annotation was computed. [2019-12-07 16:57:17,930 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 04:57:17 BoogieIcfgContainer [2019-12-07 16:57:17,930 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 16:57:17,931 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 16:57:17,931 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 16:57:17,931 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 16:57:17,931 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 04:57:13" (3/4) ... [2019-12-07 16:57:17,934 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-12-07 16:57:17,952 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 99 nodes and edges [2019-12-07 16:57:17,954 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2019-12-07 16:57:17,955 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2019-12-07 16:57:17,957 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-12-07 16:57:18,052 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_2ec5fffa-0932-481b-83af-56bdf564944e/bin/utaipan/witness.graphml [2019-12-07 16:57:18,052 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 16:57:18,054 INFO L168 Benchmark]: Toolchain (without parser) took 6295.20 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 216.5 MB). Free memory was 933.5 MB in the beginning and 802.4 MB in the end (delta: 131.0 MB). Peak memory consumption was 347.6 MB. Max. memory is 11.5 GB. [2019-12-07 16:57:18,054 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 955.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 16:57:18,054 INFO L168 Benchmark]: CACSL2BoogieTranslator took 337.44 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 78.6 MB). Free memory was 933.5 MB in the beginning and 1.0 GB in the end (delta: -112.7 MB). Peak memory consumption was 18.9 MB. Max. memory is 11.5 GB. [2019-12-07 16:57:18,055 INFO L168 Benchmark]: Boogie Procedure Inliner took 50.34 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 16:57:18,055 INFO L168 Benchmark]: Boogie Preprocessor took 40.38 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 16:57:18,055 INFO L168 Benchmark]: RCFGBuilder took 1089.39 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 826.7 MB in the end (delta: 208.6 MB). Peak memory consumption was 208.6 MB. Max. memory is 11.5 GB. [2019-12-07 16:57:18,055 INFO L168 Benchmark]: TraceAbstraction took 4652.64 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 137.9 MB). Free memory was 826.7 MB in the beginning and 821.9 MB in the end (delta: 4.8 MB). Peak memory consumption was 142.7 MB. Max. memory is 11.5 GB. [2019-12-07 16:57:18,056 INFO L168 Benchmark]: Witness Printer took 121.72 ms. Allocated memory is still 1.2 GB. Free memory was 821.9 MB in the beginning and 802.4 MB in the end (delta: 19.5 MB). Peak memory consumption was 19.5 MB. Max. memory is 11.5 GB. [2019-12-07 16:57:18,057 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.13 ms. Allocated memory is still 1.0 GB. Free memory is still 955.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 337.44 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 78.6 MB). Free memory was 933.5 MB in the beginning and 1.0 GB in the end (delta: -112.7 MB). Peak memory consumption was 18.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 50.34 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 40.38 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1089.39 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 826.7 MB in the end (delta: 208.6 MB). Peak memory consumption was 208.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 4652.64 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 137.9 MB). Free memory was 826.7 MB in the beginning and 821.9 MB in the end (delta: 4.8 MB). Peak memory consumption was 142.7 MB. Max. memory is 11.5 GB. * Witness Printer took 121.72 ms. Allocated memory is still 1.2 GB. Free memory was 821.9 MB in the beginning and 802.4 MB in the end (delta: 19.5 MB). Peak memory consumption was 19.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 506]: 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: (((a21 <= 0 && 13 == a8) || (!(a16 == 6) && a21 == 1)) || (a21 == 1 && 15 == a8)) || (a17 == 1 && a21 == 1) - InvariantResult [Line: 577]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 583]: Loop Invariant Derived loop invariant: (((a21 <= 0 && 13 == a8) || (!(a16 == 6) && a21 == 1)) || (a21 == 1 && 15 == a8)) || (a17 == 1 && a21 == 1) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 76 locations, 1 error locations. Result: SAFE, OverallTime: 4.2s, OverallIterations: 9, TraceHistogramMax: 6, AutomataDifference: 2.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.3s, HoareTripleCheckerStatistics: 519 SDtfs, 1071 SDslu, 80 SDs, 0 SdLazy, 2988 SolverSat, 772 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 419 GetRequests, 391 SyntacticMatches, 4 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=926occurred 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.1s AutomataMinimizationTime, 9 MinimizatonAttempts, 760 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 42 NumberOfFragments, 61 HoareAnnotationTreeSize, 3 FomulaSimplifications, 10077 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 3 FomulaSimplificationsInter, 550 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 1368 NumberOfCodeBlocks, 1368 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 1549 ConstructedInterpolants, 0 QuantifiedInterpolants, 536643 SizeOfPredicates, 1 NumberOfNonLiveVariables, 430 ConjunctsInSsa, 2 ConjunctsInUnsatCore, 11 InterpolantComputations, 10 PerfectInterpolantSequences, 1736/1763 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...