./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem01_label06.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_0d41dcf3-3350-4c2e-8e93-10f536d99ca7/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_0d41dcf3-3350-4c2e-8e93-10f536d99ca7/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_0d41dcf3-3350-4c2e-8e93-10f536d99ca7/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_0d41dcf3-3350-4c2e-8e93-10f536d99ca7/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem01_label06.c -s /tmp/vcloud-vcloud-master/worker/run_dir_0d41dcf3-3350-4c2e-8e93-10f536d99ca7/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_0d41dcf3-3350-4c2e-8e93-10f536d99ca7/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 cc7fef7e01f0cbe23a4bfb5f51eb1c754f7b3b49 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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:35:35,252 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-26 02:35:35,254 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-26 02:35:35,268 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-26 02:35:35,268 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-26 02:35:35,269 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-26 02:35:35,271 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-26 02:35:35,272 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-26 02:35:35,274 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-26 02:35:35,275 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-26 02:35:35,276 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-26 02:35:35,277 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-26 02:35:35,277 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-26 02:35:35,278 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-26 02:35:35,279 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-26 02:35:35,280 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-26 02:35:35,281 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-26 02:35:35,282 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-26 02:35:35,284 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-26 02:35:35,286 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-26 02:35:35,287 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-26 02:35:35,289 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-26 02:35:35,290 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-26 02:35:35,290 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-26 02:35:35,293 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-26 02:35:35,293 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-26 02:35:35,294 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-26 02:35:35,299 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-26 02:35:35,300 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-26 02:35:35,300 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-26 02:35:35,301 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-26 02:35:35,301 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-26 02:35:35,302 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-26 02:35:35,303 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-26 02:35:35,304 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-26 02:35:35,304 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-26 02:35:35,304 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-26 02:35:35,304 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-26 02:35:35,305 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-26 02:35:35,305 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-26 02:35:35,306 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-26 02:35:35,307 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_0d41dcf3-3350-4c2e-8e93-10f536d99ca7/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-11-26 02:35:35,331 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-26 02:35:35,331 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-26 02:35:35,332 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-26 02:35:35,332 INFO L138 SettingsManager]: * User list type=DISABLED [2019-11-26 02:35:35,332 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-11-26 02:35:35,333 INFO L138 SettingsManager]: * Explicit value domain=true [2019-11-26 02:35:35,333 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-11-26 02:35:35,333 INFO L138 SettingsManager]: * Octagon Domain=false [2019-11-26 02:35:35,333 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-11-26 02:35:35,333 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-11-26 02:35:35,334 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-11-26 02:35:35,334 INFO L138 SettingsManager]: * Interval Domain=false [2019-11-26 02:35:35,335 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-11-26 02:35:35,335 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-11-26 02:35:35,335 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-11-26 02:35:35,336 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-26 02:35:35,336 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-26 02:35:35,336 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-26 02:35:35,336 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-26 02:35:35,336 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-26 02:35:35,337 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-26 02:35:35,337 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-26 02:35:35,337 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-26 02:35:35,337 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-26 02:35:35,337 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-26 02:35:35,338 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-26 02:35:35,338 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-26 02:35:35,338 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-26 02:35:35,338 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-26 02:35:35,338 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-26 02:35:35,339 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-26 02:35:35,339 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-26 02:35:35,339 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-26 02:35:35,339 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-11-26 02:35:35,339 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-26 02:35:35,340 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-26 02:35:35,340 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-26 02:35:35,340 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_0d41dcf3-3350-4c2e-8e93-10f536d99ca7/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 -> cc7fef7e01f0cbe23a4bfb5f51eb1c754f7b3b49 [2019-11-26 02:35:35,472 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-26 02:35:35,483 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-26 02:35:35,485 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-26 02:35:35,487 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-26 02:35:35,487 INFO L275 PluginConnector]: CDTParser initialized [2019-11-26 02:35:35,488 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_0d41dcf3-3350-4c2e-8e93-10f536d99ca7/bin/utaipan/../../sv-benchmarks/c/eca-rers2012/Problem01_label06.c [2019-11-26 02:35:35,537 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_0d41dcf3-3350-4c2e-8e93-10f536d99ca7/bin/utaipan/data/8a6fd2938/824892f98e8942f1bdbbc9b36b71faff/FLAG89e57c402 [2019-11-26 02:35:36,105 INFO L306 CDTParser]: Found 1 translation units. [2019-11-26 02:35:36,107 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_0d41dcf3-3350-4c2e-8e93-10f536d99ca7/sv-benchmarks/c/eca-rers2012/Problem01_label06.c [2019-11-26 02:35:36,122 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_0d41dcf3-3350-4c2e-8e93-10f536d99ca7/bin/utaipan/data/8a6fd2938/824892f98e8942f1bdbbc9b36b71faff/FLAG89e57c402 [2019-11-26 02:35:36,558 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_0d41dcf3-3350-4c2e-8e93-10f536d99ca7/bin/utaipan/data/8a6fd2938/824892f98e8942f1bdbbc9b36b71faff [2019-11-26 02:35:36,560 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-26 02:35:36,561 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-26 02:35:36,562 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-26 02:35:36,562 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-26 02:35:36,565 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-26 02:35:36,566 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 02:35:36" (1/1) ... [2019-11-26 02:35:36,569 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35ac5180 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:35:36, skipping insertion in model container [2019-11-26 02:35:36,569 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 02:35:36" (1/1) ... [2019-11-26 02:35:36,574 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-26 02:35:36,620 INFO L179 MainTranslator]: Built tables and reachable declarations [2019-11-26 02:35:37,032 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-26 02:35:37,051 INFO L201 MainTranslator]: Completed pre-run [2019-11-26 02:35:37,202 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-26 02:35:37,216 INFO L205 MainTranslator]: Completed translation [2019-11-26 02:35:37,217 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:35:37 WrapperNode [2019-11-26 02:35:37,217 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-26 02:35:37,218 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-26 02:35:37,218 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-26 02:35:37,218 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-26 02:35:37,226 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:35:37" (1/1) ... [2019-11-26 02:35:37,247 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:35:37" (1/1) ... [2019-11-26 02:35:37,294 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-26 02:35:37,295 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-26 02:35:37,295 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-26 02:35:37,295 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-26 02:35:37,304 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:35:37" (1/1) ... [2019-11-26 02:35:37,304 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:35:37" (1/1) ... [2019-11-26 02:35:37,308 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:35:37" (1/1) ... [2019-11-26 02:35:37,309 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:35:37" (1/1) ... [2019-11-26 02:35:37,327 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:35:37" (1/1) ... [2019-11-26 02:35:37,338 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:35:37" (1/1) ... [2019-11-26 02:35:37,343 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:35:37" (1/1) ... [2019-11-26 02:35:37,349 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-26 02:35:37,349 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-26 02:35:37,349 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-26 02:35:37,350 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-26 02:35:37,350 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:35:37" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0d41dcf3-3350-4c2e-8e93-10f536d99ca7/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:35:37,431 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-26 02:35:37,431 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-26 02:35:39,314 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-26 02:35:39,315 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-26 02:35:39,316 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 02:35:39 BoogieIcfgContainer [2019-11-26 02:35:39,317 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-26 02:35:39,318 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-26 02:35:39,318 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-26 02:35:39,321 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-26 02:35:39,321 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.11 02:35:36" (1/3) ... [2019-11-26 02:35:39,324 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b3ea82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 02:35:39, skipping insertion in model container [2019-11-26 02:35:39,324 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:35:37" (2/3) ... [2019-11-26 02:35:39,324 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b3ea82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 02:35:39, skipping insertion in model container [2019-11-26 02:35:39,324 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 02:35:39" (3/3) ... [2019-11-26 02:35:39,327 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem01_label06.c [2019-11-26 02:35:39,336 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-26 02:35:39,342 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-26 02:35:39,353 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-26 02:35:39,383 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-26 02:35:39,383 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-26 02:35:39,383 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-26 02:35:39,383 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-26 02:35:39,383 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-26 02:35:39,384 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-26 02:35:39,384 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-26 02:35:39,384 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-26 02:35:39,399 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states. [2019-11-26 02:35:39,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-11-26 02:35:39,410 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:35:39,411 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:35:39,412 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:35:39,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:35:39,417 INFO L82 PathProgramCache]: Analyzing trace with hash -839555290, now seen corresponding path program 1 times [2019-11-26 02:35:39,424 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:35:39,424 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401542265] [2019-11-26 02:35:39,424 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:35:39,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:35:39,816 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:35:39,817 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401542265] [2019-11-26 02:35:39,818 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:35:39,818 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 02:35:39,820 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108419361] [2019-11-26 02:35:39,824 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:35:39,824 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:35:39,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:35:39,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:35:39,839 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 4 states. [2019-11-26 02:35:40,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:35:40,541 INFO L93 Difference]: Finished difference Result 297 states and 569 transitions. [2019-11-26 02:35:40,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:35:40,543 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 71 [2019-11-26 02:35:40,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:35:40,563 INFO L225 Difference]: With dead ends: 297 [2019-11-26 02:35:40,564 INFO L226 Difference]: Without dead ends: 216 [2019-11-26 02:35:40,568 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:35:40,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2019-11-26 02:35:40,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 145. [2019-11-26 02:35:40,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2019-11-26 02:35:40,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 259 transitions. [2019-11-26 02:35:40,634 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 259 transitions. Word has length 71 [2019-11-26 02:35:40,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:35:40,635 INFO L462 AbstractCegarLoop]: Abstraction has 145 states and 259 transitions. [2019-11-26 02:35:40,635 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:35:40,635 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 259 transitions. [2019-11-26 02:35:40,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-11-26 02:35:40,641 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:35:40,641 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:35:40,642 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:35:40,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:35:40,642 INFO L82 PathProgramCache]: Analyzing trace with hash -1061916039, now seen corresponding path program 1 times [2019-11-26 02:35:40,642 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:35:40,643 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116256419] [2019-11-26 02:35:40,643 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:35:40,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:35:40,720 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:35:40,721 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116256419] [2019-11-26 02:35:40,721 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:35:40,721 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 02:35:40,722 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153219805] [2019-11-26 02:35:40,724 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:35:40,724 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:35:40,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:35:40,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:35:40,725 INFO L87 Difference]: Start difference. First operand 145 states and 259 transitions. Second operand 4 states. [2019-11-26 02:35:41,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:35:41,343 INFO L93 Difference]: Finished difference Result 573 states and 1031 transitions. [2019-11-26 02:35:41,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:35:41,343 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 77 [2019-11-26 02:35:41,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:35:41,345 INFO L225 Difference]: With dead ends: 573 [2019-11-26 02:35:41,346 INFO L226 Difference]: Without dead ends: 429 [2019-11-26 02:35:41,347 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:35:41,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2019-11-26 02:35:41,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 429. [2019-11-26 02:35:41,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 429 states. [2019-11-26 02:35:41,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 707 transitions. [2019-11-26 02:35:41,378 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 707 transitions. Word has length 77 [2019-11-26 02:35:41,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:35:41,378 INFO L462 AbstractCegarLoop]: Abstraction has 429 states and 707 transitions. [2019-11-26 02:35:41,378 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:35:41,379 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 707 transitions. [2019-11-26 02:35:41,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-11-26 02:35:41,382 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:35:41,382 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:35:41,383 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:35:41,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:35:41,383 INFO L82 PathProgramCache]: Analyzing trace with hash 1752162555, now seen corresponding path program 1 times [2019-11-26 02:35:41,383 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:35:41,384 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27408749] [2019-11-26 02:35:41,384 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:35:41,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:35:41,469 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-26 02:35:41,470 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27408749] [2019-11-26 02:35:41,470 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:35:41,470 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-26 02:35:41,471 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565634335] [2019-11-26 02:35:41,471 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-26 02:35:41,471 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:35:41,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-26 02:35:41,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:35:41,472 INFO L87 Difference]: Start difference. First operand 429 states and 707 transitions. Second operand 3 states. [2019-11-26 02:35:41,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:35:41,828 INFO L93 Difference]: Finished difference Result 1141 states and 1872 transitions. [2019-11-26 02:35:41,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 02:35:41,829 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 78 [2019-11-26 02:35:41,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:35:41,833 INFO L225 Difference]: With dead ends: 1141 [2019-11-26 02:35:41,833 INFO L226 Difference]: Without dead ends: 713 [2019-11-26 02:35:41,836 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:35:41,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 713 states. [2019-11-26 02:35:41,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 713 to 571. [2019-11-26 02:35:41,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 571 states. [2019-11-26 02:35:41,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 571 states to 571 states and 847 transitions. [2019-11-26 02:35:41,870 INFO L78 Accepts]: Start accepts. Automaton has 571 states and 847 transitions. Word has length 78 [2019-11-26 02:35:41,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:35:41,871 INFO L462 AbstractCegarLoop]: Abstraction has 571 states and 847 transitions. [2019-11-26 02:35:41,871 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-26 02:35:41,871 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 847 transitions. [2019-11-26 02:35:41,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-11-26 02:35:41,876 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:35:41,876 INFO L410 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:35:41,876 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:35:41,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:35:41,877 INFO L82 PathProgramCache]: Analyzing trace with hash 406859988, now seen corresponding path program 1 times [2019-11-26 02:35:41,877 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:35:41,877 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754701739] [2019-11-26 02:35:41,877 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:35:41,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:35:41,943 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-26 02:35:41,944 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754701739] [2019-11-26 02:35:41,944 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:35:41,944 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-26 02:35:41,945 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441787368] [2019-11-26 02:35:41,945 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-26 02:35:41,945 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:35:41,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-26 02:35:41,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:35:41,946 INFO L87 Difference]: Start difference. First operand 571 states and 847 transitions. Second operand 3 states. [2019-11-26 02:35:42,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:35:42,318 INFO L93 Difference]: Finished difference Result 1283 states and 1938 transitions. [2019-11-26 02:35:42,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 02:35:42,319 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 105 [2019-11-26 02:35:42,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:35:42,323 INFO L225 Difference]: With dead ends: 1283 [2019-11-26 02:35:42,323 INFO L226 Difference]: Without dead ends: 713 [2019-11-26 02:35:42,324 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:35:42,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 713 states. [2019-11-26 02:35:42,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 713 to 642. [2019-11-26 02:35:42,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 642 states. [2019-11-26 02:35:42,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 961 transitions. [2019-11-26 02:35:42,347 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 961 transitions. Word has length 105 [2019-11-26 02:35:42,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:35:42,347 INFO L462 AbstractCegarLoop]: Abstraction has 642 states and 961 transitions. [2019-11-26 02:35:42,347 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-26 02:35:42,348 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 961 transitions. [2019-11-26 02:35:42,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-11-26 02:35:42,350 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:35:42,350 INFO L410 BasicCegarLoop]: trace histogram [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, 2, 2, 2, 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] [2019-11-26 02:35:42,350 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:35:42,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:35:42,351 INFO L82 PathProgramCache]: Analyzing trace with hash -1772108359, now seen corresponding path program 1 times [2019-11-26 02:35:42,351 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:35:42,351 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961822930] [2019-11-26 02:35:42,351 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:35:42,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:35:42,475 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-26 02:35:42,476 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961822930] [2019-11-26 02:35:42,477 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:35:42,477 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-26 02:35:42,477 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224705011] [2019-11-26 02:35:42,478 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-26 02:35:42,478 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:35:42,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-26 02:35:42,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:35:42,479 INFO L87 Difference]: Start difference. First operand 642 states and 961 transitions. Second operand 3 states. [2019-11-26 02:35:42,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:35:42,855 INFO L93 Difference]: Finished difference Result 1709 states and 2539 transitions. [2019-11-26 02:35:42,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 02:35:42,855 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 129 [2019-11-26 02:35:42,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:35:42,861 INFO L225 Difference]: With dead ends: 1709 [2019-11-26 02:35:42,862 INFO L226 Difference]: Without dead ends: 1068 [2019-11-26 02:35:42,863 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:35:42,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1068 states. [2019-11-26 02:35:42,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1068 to 997. [2019-11-26 02:35:42,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 997 states. [2019-11-26 02:35:42,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 997 states to 997 states and 1424 transitions. [2019-11-26 02:35:42,898 INFO L78 Accepts]: Start accepts. Automaton has 997 states and 1424 transitions. Word has length 129 [2019-11-26 02:35:42,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:35:42,899 INFO L462 AbstractCegarLoop]: Abstraction has 997 states and 1424 transitions. [2019-11-26 02:35:42,899 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-26 02:35:42,899 INFO L276 IsEmpty]: Start isEmpty. Operand 997 states and 1424 transitions. [2019-11-26 02:35:42,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-11-26 02:35:42,902 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:35:42,902 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 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, 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:35:42,903 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:35:42,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:35:42,903 INFO L82 PathProgramCache]: Analyzing trace with hash -473524474, now seen corresponding path program 1 times [2019-11-26 02:35:42,903 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:35:42,903 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85859998] [2019-11-26 02:35:42,904 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:35:42,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:35:43,007 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2019-11-26 02:35:43,008 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85859998] [2019-11-26 02:35:43,008 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:35:43,009 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-26 02:35:43,009 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812762320] [2019-11-26 02:35:43,009 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-26 02:35:43,010 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:35:43,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-26 02:35:43,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:35:43,011 INFO L87 Difference]: Start difference. First operand 997 states and 1424 transitions. Second operand 3 states. [2019-11-26 02:35:43,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:35:43,371 INFO L93 Difference]: Finished difference Result 2064 states and 2930 transitions. [2019-11-26 02:35:43,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 02:35:43,372 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 134 [2019-11-26 02:35:43,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:35:43,378 INFO L225 Difference]: With dead ends: 2064 [2019-11-26 02:35:43,378 INFO L226 Difference]: Without dead ends: 1068 [2019-11-26 02:35:43,380 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:35:43,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1068 states. [2019-11-26 02:35:43,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1068 to 855. [2019-11-26 02:35:43,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 855 states. [2019-11-26 02:35:43,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 855 states to 855 states and 1234 transitions. [2019-11-26 02:35:43,433 INFO L78 Accepts]: Start accepts. Automaton has 855 states and 1234 transitions. Word has length 134 [2019-11-26 02:35:43,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:35:43,433 INFO L462 AbstractCegarLoop]: Abstraction has 855 states and 1234 transitions. [2019-11-26 02:35:43,434 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-26 02:35:43,434 INFO L276 IsEmpty]: Start isEmpty. Operand 855 states and 1234 transitions. [2019-11-26 02:35:43,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-11-26 02:35:43,436 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:35:43,436 INFO L410 BasicCegarLoop]: trace histogram [4, 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, 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] [2019-11-26 02:35:43,441 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:35:43,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:35:43,441 INFO L82 PathProgramCache]: Analyzing trace with hash 985786610, now seen corresponding path program 1 times [2019-11-26 02:35:43,441 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:35:43,442 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447149575] [2019-11-26 02:35:43,447 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:35:43,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:35:43,559 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2019-11-26 02:35:43,560 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447149575] [2019-11-26 02:35:43,560 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:35:43,560 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 02:35:43,560 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977505578] [2019-11-26 02:35:43,561 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:35:43,561 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:35:43,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:35:43,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:35:43,562 INFO L87 Difference]: Start difference. First operand 855 states and 1234 transitions. Second operand 4 states. [2019-11-26 02:35:44,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:35:44,014 INFO L93 Difference]: Finished difference Result 1815 states and 2585 transitions. [2019-11-26 02:35:44,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-26 02:35:44,014 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 142 [2019-11-26 02:35:44,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:35:44,019 INFO L225 Difference]: With dead ends: 1815 [2019-11-26 02:35:44,020 INFO L226 Difference]: Without dead ends: 961 [2019-11-26 02:35:44,021 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-26 02:35:44,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 961 states. [2019-11-26 02:35:44,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 961 to 926. [2019-11-26 02:35:44,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 926 states. [2019-11-26 02:35:44,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 926 states to 926 states and 1311 transitions. [2019-11-26 02:35:44,047 INFO L78 Accepts]: Start accepts. Automaton has 926 states and 1311 transitions. Word has length 142 [2019-11-26 02:35:44,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:35:44,047 INFO L462 AbstractCegarLoop]: Abstraction has 926 states and 1311 transitions. [2019-11-26 02:35:44,047 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:35:44,048 INFO L276 IsEmpty]: Start isEmpty. Operand 926 states and 1311 transitions. [2019-11-26 02:35:44,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-11-26 02:35:44,051 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:35:44,051 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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:35:44,052 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:35:44,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:35:44,052 INFO L82 PathProgramCache]: Analyzing trace with hash -1551426758, now seen corresponding path program 1 times [2019-11-26 02:35:44,052 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:35:44,053 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828161847] [2019-11-26 02:35:44,053 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:35:44,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:35:44,119 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2019-11-26 02:35:44,119 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828161847] [2019-11-26 02:35:44,120 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:35:44,120 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 02:35:44,120 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342626744] [2019-11-26 02:35:44,121 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:35:44,121 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:35:44,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:35:44,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:35:44,121 INFO L87 Difference]: Start difference. First operand 926 states and 1311 transitions. Second operand 4 states. [2019-11-26 02:35:44,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:35:44,587 INFO L93 Difference]: Finished difference Result 1780 states and 2544 transitions. [2019-11-26 02:35:44,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:35:44,588 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 146 [2019-11-26 02:35:44,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:35:44,593 INFO L225 Difference]: With dead ends: 1780 [2019-11-26 02:35:44,593 INFO L226 Difference]: Without dead ends: 926 [2019-11-26 02:35:44,594 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:35:44,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 926 states. [2019-11-26 02:35:44,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 926 to 926. [2019-11-26 02:35:44,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 926 states. [2019-11-26 02:35:44,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 926 states to 926 states and 1305 transitions. [2019-11-26 02:35:44,617 INFO L78 Accepts]: Start accepts. Automaton has 926 states and 1305 transitions. Word has length 146 [2019-11-26 02:35:44,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:35:44,617 INFO L462 AbstractCegarLoop]: Abstraction has 926 states and 1305 transitions. [2019-11-26 02:35:44,618 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:35:44,618 INFO L276 IsEmpty]: Start isEmpty. Operand 926 states and 1305 transitions. [2019-11-26 02:35:44,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-11-26 02:35:44,621 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:35:44,621 INFO L410 BasicCegarLoop]: trace histogram [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, 2, 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] [2019-11-26 02:35:44,621 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:35:44,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:35:44,622 INFO L82 PathProgramCache]: Analyzing trace with hash 1130227943, now seen corresponding path program 1 times [2019-11-26 02:35:44,622 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:35:44,622 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065484925] [2019-11-26 02:35:44,622 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:35:44,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:35:44,794 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2019-11-26 02:35:44,795 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065484925] [2019-11-26 02:35:44,795 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:35:44,795 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-26 02:35:44,796 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214671561] [2019-11-26 02:35:44,796 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-26 02:35:44,796 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:35:44,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-26 02:35:44,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-11-26 02:35:44,797 INFO L87 Difference]: Start difference. First operand 926 states and 1305 transitions. Second operand 8 states. [2019-11-26 02:35:45,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:35:45,524 INFO L93 Difference]: Finished difference Result 1961 states and 2743 transitions. [2019-11-26 02:35:45,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-26 02:35:45,524 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 158 [2019-11-26 02:35:45,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:35:45,530 INFO L225 Difference]: With dead ends: 1961 [2019-11-26 02:35:45,530 INFO L226 Difference]: Without dead ends: 1107 [2019-11-26 02:35:45,532 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-11-26 02:35:45,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1107 states. [2019-11-26 02:35:45,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1107 to 997. [2019-11-26 02:35:45,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 997 states. [2019-11-26 02:35:45,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 997 states to 997 states and 1376 transitions. [2019-11-26 02:35:45,562 INFO L78 Accepts]: Start accepts. Automaton has 997 states and 1376 transitions. Word has length 158 [2019-11-26 02:35:45,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:35:45,562 INFO L462 AbstractCegarLoop]: Abstraction has 997 states and 1376 transitions. [2019-11-26 02:35:45,562 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-26 02:35:45,562 INFO L276 IsEmpty]: Start isEmpty. Operand 997 states and 1376 transitions. [2019-11-26 02:35:45,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-11-26 02:35:45,566 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:35:45,566 INFO L410 BasicCegarLoop]: trace histogram [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, 2, 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] [2019-11-26 02:35:45,566 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:35:45,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:35:45,567 INFO L82 PathProgramCache]: Analyzing trace with hash -397128022, now seen corresponding path program 1 times [2019-11-26 02:35:45,567 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:35:45,567 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396855077] [2019-11-26 02:35:45,567 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:35:45,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:35:45,643 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2019-11-26 02:35:45,643 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396855077] [2019-11-26 02:35:45,643 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:35:45,644 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-26 02:35:45,644 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248419854] [2019-11-26 02:35:45,644 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:35:45,645 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:35:45,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:35:45,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:35:45,645 INFO L87 Difference]: Start difference. First operand 997 states and 1376 transitions. Second operand 4 states. [2019-11-26 02:35:46,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:35:46,080 INFO L93 Difference]: Finished difference Result 2348 states and 3226 transitions. [2019-11-26 02:35:46,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:35:46,081 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 161 [2019-11-26 02:35:46,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:35:46,086 INFO L225 Difference]: With dead ends: 2348 [2019-11-26 02:35:46,086 INFO L226 Difference]: Without dead ends: 1068 [2019-11-26 02:35:46,087 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 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:35:46,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1068 states. [2019-11-26 02:35:46,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1068 to 997. [2019-11-26 02:35:46,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 997 states. [2019-11-26 02:35:46,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 997 states to 997 states and 1145 transitions. [2019-11-26 02:35:46,111 INFO L78 Accepts]: Start accepts. Automaton has 997 states and 1145 transitions. Word has length 161 [2019-11-26 02:35:46,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:35:46,111 INFO L462 AbstractCegarLoop]: Abstraction has 997 states and 1145 transitions. [2019-11-26 02:35:46,111 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:35:46,111 INFO L276 IsEmpty]: Start isEmpty. Operand 997 states and 1145 transitions. [2019-11-26 02:35:46,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-11-26 02:35:46,115 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:35:46,115 INFO L410 BasicCegarLoop]: trace histogram [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, 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] [2019-11-26 02:35:46,115 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:35:46,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:35:46,115 INFO L82 PathProgramCache]: Analyzing trace with hash 1210202600, now seen corresponding path program 1 times [2019-11-26 02:35:46,116 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:35:46,116 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383804050] [2019-11-26 02:35:46,116 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:35:46,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:35:46,270 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 98 proven. 4 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2019-11-26 02:35:46,270 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383804050] [2019-11-26 02:35:46,270 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1974424794] [2019-11-26 02:35:46,271 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0d41dcf3-3350-4c2e-8e93-10f536d99ca7/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-11-26 02:35:46,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:35:46,397 INFO L255 TraceCheckSpWp]: Trace formula consists of 371 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-26 02:35:46,420 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 02:35:46,510 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2019-11-26 02:35:46,511 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 02:35:46,606 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2019-11-26 02:35:46,606 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-11-26 02:35:46,607 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [4] total 5 [2019-11-26 02:35:46,607 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645631334] [2019-11-26 02:35:46,608 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-26 02:35:46,608 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:35:46,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-26 02:35:46,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-26 02:35:46,608 INFO L87 Difference]: Start difference. First operand 997 states and 1145 transitions. Second operand 3 states. [2019-11-26 02:35:46,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:35:46,884 INFO L93 Difference]: Finished difference Result 1709 states and 1965 transitions. [2019-11-26 02:35:46,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 02:35:46,884 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 175 [2019-11-26 02:35:46,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:35:46,892 INFO L225 Difference]: With dead ends: 1709 [2019-11-26 02:35:46,893 INFO L226 Difference]: Without dead ends: 1707 [2019-11-26 02:35:46,894 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 352 GetRequests, 348 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-26 02:35:46,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1707 states. [2019-11-26 02:35:46,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1707 to 1565. [2019-11-26 02:35:46,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1565 states. [2019-11-26 02:35:46,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1565 states to 1565 states and 1819 transitions. [2019-11-26 02:35:46,934 INFO L78 Accepts]: Start accepts. Automaton has 1565 states and 1819 transitions. Word has length 175 [2019-11-26 02:35:46,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:35:46,935 INFO L462 AbstractCegarLoop]: Abstraction has 1565 states and 1819 transitions. [2019-11-26 02:35:46,936 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-26 02:35:46,936 INFO L276 IsEmpty]: Start isEmpty. Operand 1565 states and 1819 transitions. [2019-11-26 02:35:46,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2019-11-26 02:35:46,940 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:35:46,940 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2019-11-26 02:35:47,152 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-26 02:35:47,152 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:35:47,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:35:47,152 INFO L82 PathProgramCache]: Analyzing trace with hash 964514437, now seen corresponding path program 1 times [2019-11-26 02:35:47,153 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:35:47,153 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043789796] [2019-11-26 02:35:47,153 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:35:47,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:35:47,408 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 141 proven. 70 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-11-26 02:35:47,408 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043789796] [2019-11-26 02:35:47,409 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [375173507] [2019-11-26 02:35:47,409 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0d41dcf3-3350-4c2e-8e93-10f536d99ca7/bin/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-26 02:35:47,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:35:47,522 INFO L255 TraceCheckSpWp]: Trace formula consists of 419 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-26 02:35:47,531 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 02:35:47,576 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2019-11-26 02:35:47,576 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 02:35:47,620 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2019-11-26 02:35:47,621 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-11-26 02:35:47,621 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [5] total 7 [2019-11-26 02:35:47,621 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916468137] [2019-11-26 02:35:47,622 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-26 02:35:47,622 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:35:47,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-26 02:35:47,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-11-26 02:35:47,623 INFO L87 Difference]: Start difference. First operand 1565 states and 1819 transitions. Second operand 3 states. [2019-11-26 02:35:47,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:35:47,861 INFO L93 Difference]: Finished difference Result 1567 states and 1820 transitions. [2019-11-26 02:35:47,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 02:35:47,862 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 193 [2019-11-26 02:35:47,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:35:47,869 INFO L225 Difference]: With dead ends: 1567 [2019-11-26 02:35:47,869 INFO L226 Difference]: Without dead ends: 1565 [2019-11-26 02:35:47,870 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 395 GetRequests, 386 SyntacticMatches, 4 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-11-26 02:35:47,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1565 states. [2019-11-26 02:35:47,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1565 to 1494. [2019-11-26 02:35:47,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1494 states. [2019-11-26 02:35:47,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1494 states to 1494 states and 1731 transitions. [2019-11-26 02:35:47,902 INFO L78 Accepts]: Start accepts. Automaton has 1494 states and 1731 transitions. Word has length 193 [2019-11-26 02:35:47,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:35:47,903 INFO L462 AbstractCegarLoop]: Abstraction has 1494 states and 1731 transitions. [2019-11-26 02:35:47,903 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-26 02:35:47,903 INFO L276 IsEmpty]: Start isEmpty. Operand 1494 states and 1731 transitions. [2019-11-26 02:35:47,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2019-11-26 02:35:47,907 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:35:47,908 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-11-26 02:35:48,111 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-26 02:35:48,111 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:35:48,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:35:48,112 INFO L82 PathProgramCache]: Analyzing trace with hash 1019212946, now seen corresponding path program 1 times [2019-11-26 02:35:48,112 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:35:48,112 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145691117] [2019-11-26 02:35:48,113 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:35:48,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:35:48,325 INFO L134 CoverageAnalysis]: Checked inductivity of 329 backedges. 215 proven. 27 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2019-11-26 02:35:48,325 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145691117] [2019-11-26 02:35:48,325 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [408414723] [2019-11-26 02:35:48,326 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0d41dcf3-3350-4c2e-8e93-10f536d99ca7/bin/utaipan/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-26 02:35:48,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:35:48,444 INFO L255 TraceCheckSpWp]: Trace formula consists of 476 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-26 02:35:48,453 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 02:35:48,506 INFO L134 CoverageAnalysis]: Checked inductivity of 329 backedges. 264 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2019-11-26 02:35:48,506 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 02:35:48,547 INFO L134 CoverageAnalysis]: Checked inductivity of 329 backedges. 264 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2019-11-26 02:35:48,547 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-11-26 02:35:48,547 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [5] total 7 [2019-11-26 02:35:48,549 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499324802] [2019-11-26 02:35:48,550 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-26 02:35:48,551 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:35:48,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-26 02:35:48,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-11-26 02:35:48,552 INFO L87 Difference]: Start difference. First operand 1494 states and 1731 transitions. Second operand 3 states. [2019-11-26 02:35:48,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:35:48,818 INFO L93 Difference]: Finished difference Result 2488 states and 2891 transitions. [2019-11-26 02:35:48,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 02:35:48,819 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 218 [2019-11-26 02:35:48,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:35:48,819 INFO L225 Difference]: With dead ends: 2488 [2019-11-26 02:35:48,819 INFO L226 Difference]: Without dead ends: 0 [2019-11-26 02:35:48,822 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 441 GetRequests, 435 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-11-26 02:35:48,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-26 02:35:48,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-26 02:35:48,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-26 02:35:48,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-26 02:35:48,822 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 218 [2019-11-26 02:35:48,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:35:48,822 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-26 02:35:48,822 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-26 02:35:48,823 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-26 02:35:48,823 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-26 02:35:49,027 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-26 02:35:49,031 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-26 02:35:49,153 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 158 DAG size of output: 82 [2019-11-26 02:35:49,499 WARN L192 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 34 [2019-11-26 02:35:49,709 WARN L192 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 34 [2019-11-26 02:35:49,712 INFO L444 ceAbstractionStarter]: For program point L333(lines 333 390) no Hoare annotation was computed. [2019-11-26 02:35:49,712 INFO L444 ceAbstractionStarter]: For program point L102(lines 102 390) no Hoare annotation was computed. [2019-11-26 02:35:49,712 INFO L444 ceAbstractionStarter]: For program point L268(lines 268 390) no Hoare annotation was computed. [2019-11-26 02:35:49,712 INFO L444 ceAbstractionStarter]: For program point L136(lines 136 390) no Hoare annotation was computed. [2019-11-26 02:35:49,712 INFO L444 ceAbstractionStarter]: For program point L203(lines 203 390) no Hoare annotation was computed. [2019-11-26 02:35:49,713 INFO L444 ceAbstractionStarter]: For program point L72(lines 72 390) no Hoare annotation was computed. [2019-11-26 02:35:49,713 INFO L444 ceAbstractionStarter]: For program point L337(lines 337 390) no Hoare annotation was computed. [2019-11-26 02:35:49,713 INFO L444 ceAbstractionStarter]: For program point L238(lines 238 390) no Hoare annotation was computed. [2019-11-26 02:35:49,713 INFO L444 ceAbstractionStarter]: For program point L173(lines 173 390) no Hoare annotation was computed. [2019-11-26 02:35:49,713 INFO L444 ceAbstractionStarter]: For program point L140(lines 140 390) no Hoare annotation was computed. [2019-11-26 02:35:49,713 INFO L444 ceAbstractionStarter]: For program point L372(lines 372 390) no Hoare annotation was computed. [2019-11-26 02:35:49,713 INFO L444 ceAbstractionStarter]: For program point L306(lines 306 390) no Hoare annotation was computed. [2019-11-26 02:35:49,713 INFO L444 ceAbstractionStarter]: For program point L273(lines 273 390) no Hoare annotation was computed. [2019-11-26 02:35:49,713 INFO L444 ceAbstractionStarter]: For program point L108(lines 108 390) no Hoare annotation was computed. [2019-11-26 02:35:49,713 INFO L444 ceAbstractionStarter]: For program point L208(lines 208 390) no Hoare annotation was computed. [2019-11-26 02:35:49,713 INFO L444 ceAbstractionStarter]: For program point L43(lines 43 390) no Hoare annotation was computed. [2019-11-26 02:35:49,713 INFO L444 ceAbstractionStarter]: For program point L144(lines 144 390) no Hoare annotation was computed. [2019-11-26 02:35:49,714 INFO L440 ceAbstractionStarter]: At program point L574(lines 30 575) the Hoare annotation is: (let ((.cse8 (= 13 ~a8~0))) (let ((.cse1 (<= ~a7~0 0)) (.cse5 (not (= 15 ~a8~0))) (.cse0 (= ~a21~0 1)) (.cse2 (not .cse8)) (.cse4 (= 1 ~a7~0)) (.cse3 (not (= ~a16~0 6))) (.cse6 (= ~a20~0 1))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse0 .cse1) (and .cse4 .cse3 .cse0 .cse2) (and .cse5 .cse6 .cse0) (and .cse3 .cse5 .cse0 .cse2) (and .cse4 (let ((.cse7 (<= ~a21~0 0))) (or (and .cse7 .cse8 .cse3 (= ~a17~0 1)) (and .cse7 .cse8 .cse6))))))) [2019-11-26 02:35:49,714 INFO L444 ceAbstractionStarter]: For program point L178(lines 178 390) no Hoare annotation was computed. [2019-11-26 02:35:49,714 INFO L444 ceAbstractionStarter]: For program point L377(lines 377 390) no Hoare annotation was computed. [2019-11-26 02:35:49,714 INFO L444 ceAbstractionStarter]: For program point L278(lines 278 390) no Hoare annotation was computed. [2019-11-26 02:35:49,714 INFO L444 ceAbstractionStarter]: For program point L245(lines 245 390) no Hoare annotation was computed. [2019-11-26 02:35:49,714 INFO L444 ceAbstractionStarter]: For program point L80(lines 80 390) no Hoare annotation was computed. [2019-11-26 02:35:49,714 INFO L444 ceAbstractionStarter]: For program point L345(lines 345 390) no Hoare annotation was computed. [2019-11-26 02:35:49,714 INFO L444 ceAbstractionStarter]: For program point L312(lines 312 390) no Hoare annotation was computed. [2019-11-26 02:35:49,714 INFO L444 ceAbstractionStarter]: For program point L114(lines 114 390) no Hoare annotation was computed. [2019-11-26 02:35:49,714 INFO L447 ceAbstractionStarter]: At program point L577(lines 577 594) the Hoare annotation is: true [2019-11-26 02:35:49,714 INFO L444 ceAbstractionStarter]: For program point L544-1(lines 30 575) no Hoare annotation was computed. [2019-11-26 02:35:49,715 INFO L444 ceAbstractionStarter]: For program point L214(lines 214 390) no Hoare annotation was computed. [2019-11-26 02:35:49,715 INFO L444 ceAbstractionStarter]: For program point L148(lines 148 390) no Hoare annotation was computed. [2019-11-26 02:35:49,715 INFO L444 ceAbstractionStarter]: For program point L49(lines 49 390) no Hoare annotation was computed. [2019-11-26 02:35:49,715 INFO L444 ceAbstractionStarter]: For program point L84(lines 84 390) no Hoare annotation was computed. [2019-11-26 02:35:49,715 INFO L444 ceAbstractionStarter]: For program point L547-1(lines 30 575) no Hoare annotation was computed. [2019-11-26 02:35:49,715 INFO L444 ceAbstractionStarter]: For program point L382(lines 382 390) no Hoare annotation was computed. [2019-11-26 02:35:49,715 INFO L444 ceAbstractionStarter]: For program point L316(lines 316 390) no Hoare annotation was computed. [2019-11-26 02:35:49,715 INFO L444 ceAbstractionStarter]: For program point L250(lines 250 390) no Hoare annotation was computed. [2019-11-26 02:35:49,715 INFO L444 ceAbstractionStarter]: For program point L548(line 548) no Hoare annotation was computed. [2019-11-26 02:35:49,715 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-26 02:35:49,715 INFO L444 ceAbstractionStarter]: For program point L218(lines 218 390) no Hoare annotation was computed. [2019-11-26 02:35:49,715 INFO L444 ceAbstractionStarter]: For program point L152(lines 152 390) no Hoare annotation was computed. [2019-11-26 02:35:49,715 INFO L444 ceAbstractionStarter]: For program point L119(lines 119 390) no Hoare annotation was computed. [2019-11-26 02:35:49,716 INFO L444 ceAbstractionStarter]: For program point L318(lines 318 390) no Hoare annotation was computed. [2019-11-26 02:35:49,716 INFO L444 ceAbstractionStarter]: For program point L186(lines 186 390) no Hoare annotation was computed. [2019-11-26 02:35:49,716 INFO L444 ceAbstractionStarter]: For program point L54(lines 54 390) no Hoare annotation was computed. [2019-11-26 02:35:49,717 INFO L440 ceAbstractionStarter]: At program point L583-2(lines 583 593) the Hoare annotation is: (let ((.cse8 (= 13 ~a8~0))) (let ((.cse1 (<= ~a7~0 0)) (.cse5 (not (= 15 ~a8~0))) (.cse0 (= ~a21~0 1)) (.cse2 (not .cse8)) (.cse4 (= 1 ~a7~0)) (.cse3 (not (= ~a16~0 6))) (.cse6 (= ~a20~0 1))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse0 .cse1) (and .cse4 .cse3 .cse0 .cse2) (and .cse5 .cse6 .cse0) (and .cse3 .cse5 .cse0 .cse2) (and .cse4 (let ((.cse7 (<= ~a21~0 0))) (or (and .cse7 .cse8 .cse3 (= ~a17~0 1)) (and .cse7 .cse8 .cse6))))))) [2019-11-26 02:35:49,717 INFO L444 ceAbstractionStarter]: For program point L286(lines 286 390) no Hoare annotation was computed. [2019-11-26 02:35:49,717 INFO L444 ceAbstractionStarter]: For program point L353(lines 353 390) no Hoare annotation was computed. [2019-11-26 02:35:49,717 INFO L444 ceAbstractionStarter]: For program point L189(lines 189 390) no Hoare annotation was computed. [2019-11-26 02:35:49,717 INFO L444 ceAbstractionStarter]: For program point L355(lines 355 390) no Hoare annotation was computed. [2019-11-26 02:35:49,717 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-26 02:35:49,717 INFO L444 ceAbstractionStarter]: For program point L256(lines 256 390) no Hoare annotation was computed. [2019-11-26 02:35:49,717 INFO L444 ceAbstractionStarter]: For program point L223(lines 223 390) no Hoare annotation was computed. [2019-11-26 02:35:49,717 INFO L444 ceAbstractionStarter]: For program point L124(lines 124 390) no Hoare annotation was computed. [2019-11-26 02:35:49,717 INFO L444 ceAbstractionStarter]: For program point L92(lines 92 390) no Hoare annotation was computed. [2019-11-26 02:35:49,717 INFO L444 ceAbstractionStarter]: For program point L588(line 588) no Hoare annotation was computed. [2019-11-26 02:35:49,717 INFO L444 ceAbstractionStarter]: For program point L324(lines 324 390) no Hoare annotation was computed. [2019-11-26 02:35:49,717 INFO L444 ceAbstractionStarter]: For program point L292(lines 292 390) no Hoare annotation was computed. [2019-11-26 02:35:49,718 INFO L444 ceAbstractionStarter]: For program point L160(lines 160 390) no Hoare annotation was computed. [2019-11-26 02:35:49,718 INFO L444 ceAbstractionStarter]: For program point L194(lines 194 390) no Hoare annotation was computed. [2019-11-26 02:35:49,718 INFO L444 ceAbstractionStarter]: For program point L62(lines 62 390) no Hoare annotation was computed. [2019-11-26 02:35:49,718 INFO L444 ceAbstractionStarter]: For program point L261(lines 261 390) no Hoare annotation was computed. [2019-11-26 02:35:49,718 INFO L444 ceAbstractionStarter]: For program point L129(lines 129 390) no Hoare annotation was computed. [2019-11-26 02:35:49,718 INFO L444 ceAbstractionStarter]: For program point L361(lines 361 390) no Hoare annotation was computed. [2019-11-26 02:35:49,718 INFO L444 ceAbstractionStarter]: For program point L97(lines 97 390) no Hoare annotation was computed. [2019-11-26 02:35:49,718 INFO L444 ceAbstractionStarter]: For program point L31(lines 31 390) no Hoare annotation was computed. [2019-11-26 02:35:49,718 INFO L444 ceAbstractionStarter]: For program point L329(lines 329 390) no Hoare annotation was computed. [2019-11-26 02:35:49,718 INFO L444 ceAbstractionStarter]: For program point L197(lines 197 390) no Hoare annotation was computed. [2019-11-26 02:35:49,718 INFO L444 ceAbstractionStarter]: For program point L65(lines 65 390) no Hoare annotation was computed. [2019-11-26 02:35:49,718 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 548) no Hoare annotation was computed. [2019-11-26 02:35:49,718 INFO L444 ceAbstractionStarter]: For program point L363(lines 363 390) no Hoare annotation was computed. [2019-11-26 02:35:49,718 INFO L444 ceAbstractionStarter]: For program point L231(lines 231 390) no Hoare annotation was computed. [2019-11-26 02:35:49,718 INFO L444 ceAbstractionStarter]: For program point L165(lines 165 390) no Hoare annotation was computed. [2019-11-26 02:35:49,718 INFO L444 ceAbstractionStarter]: For program point L265(lines 265 390) no Hoare annotation was computed. [2019-11-26 02:35:49,719 INFO L444 ceAbstractionStarter]: For program point L365(lines 365 390) no Hoare annotation was computed. [2019-11-26 02:35:49,719 INFO L444 ceAbstractionStarter]: For program point L299(lines 299 390) no Hoare annotation was computed. [2019-11-26 02:35:49,719 INFO L444 ceAbstractionStarter]: For program point L35(lines 35 390) no Hoare annotation was computed. [2019-11-26 02:35:49,743 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.11 02:35:49 BoogieIcfgContainer [2019-11-26 02:35:49,743 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-26 02:35:49,744 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-26 02:35:49,744 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-26 02:35:49,744 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-26 02:35:49,745 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 02:35:39" (3/4) ... [2019-11-26 02:35:49,748 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-26 02:35:49,771 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 99 nodes and edges [2019-11-26 02:35:49,773 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 19 nodes and edges [2019-11-26 02:35:49,775 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2019-11-26 02:35:49,776 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-11-26 02:35:49,975 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_0d41dcf3-3350-4c2e-8e93-10f536d99ca7/bin/utaipan/witness.graphml [2019-11-26 02:35:49,975 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-26 02:35:49,977 INFO L168 Benchmark]: Toolchain (without parser) took 13415.72 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 412.6 MB). Free memory was 940.7 MB in the beginning and 965.7 MB in the end (delta: -25.0 MB). Peak memory consumption was 387.6 MB. Max. memory is 11.5 GB. [2019-11-26 02:35:49,977 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-26 02:35:49,978 INFO L168 Benchmark]: CACSL2BoogieTranslator took 655.15 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 125.3 MB). Free memory was 940.7 MB in the beginning and 1.1 GB in the end (delta: -156.2 MB). Peak memory consumption was 18.7 MB. Max. memory is 11.5 GB. [2019-11-26 02:35:49,978 INFO L168 Benchmark]: Boogie Procedure Inliner took 76.76 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:35:49,979 INFO L168 Benchmark]: Boogie Preprocessor took 54.31 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:35:49,979 INFO L168 Benchmark]: RCFGBuilder took 1967.56 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 873.9 MB in the end (delta: 212.3 MB). Peak memory consumption was 212.3 MB. Max. memory is 11.5 GB. [2019-11-26 02:35:49,979 INFO L168 Benchmark]: TraceAbstraction took 10425.15 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 287.3 MB). Free memory was 873.9 MB in the beginning and 992.2 MB in the end (delta: -118.3 MB). Peak memory consumption was 169.0 MB. Max. memory is 11.5 GB. [2019-11-26 02:35:49,980 INFO L168 Benchmark]: Witness Printer took 231.93 ms. Allocated memory is still 1.4 GB. Free memory was 992.2 MB in the beginning and 965.7 MB in the end (delta: 26.5 MB). Peak memory consumption was 26.5 MB. Max. memory is 11.5 GB. [2019-11-26 02:35:49,982 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.23 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 655.15 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 125.3 MB). Free memory was 940.7 MB in the beginning and 1.1 GB in the end (delta: -156.2 MB). Peak memory consumption was 18.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 76.76 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. * Boogie Preprocessor took 54.31 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 1967.56 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 873.9 MB in the end (delta: 212.3 MB). Peak memory consumption was 212.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 10425.15 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 287.3 MB). Free memory was 873.9 MB in the beginning and 992.2 MB in the end (delta: -118.3 MB). Peak memory consumption was 169.0 MB. Max. memory is 11.5 GB. * Witness Printer took 231.93 ms. Allocated memory is still 1.4 GB. Free memory was 992.2 MB in the beginning and 965.7 MB in the end (delta: 26.5 MB). Peak memory consumption was 26.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 548]: 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 == 1 && a7 <= 0) && !(13 == a8)) || ((!(a16 == 6) && a21 == 1) && a7 <= 0)) || (((1 == a7 && !(a16 == 6)) && a21 == 1) && !(13 == a8))) || ((!(15 == a8) && a20 == 1) && a21 == 1)) || (((!(a16 == 6) && !(15 == a8)) && a21 == 1) && !(13 == a8))) || (1 == a7 && ((((a21 <= 0 && 13 == a8) && !(a16 == 6)) && a17 == 1) || ((a21 <= 0 && 13 == a8) && a20 == 1))) - InvariantResult [Line: 577]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 583]: Loop Invariant Derived loop invariant: ((((((a21 == 1 && a7 <= 0) && !(13 == a8)) || ((!(a16 == 6) && a21 == 1) && a7 <= 0)) || (((1 == a7 && !(a16 == 6)) && a21 == 1) && !(13 == a8))) || ((!(15 == a8) && a20 == 1) && a21 == 1)) || (((!(a16 == 6) && !(15 == a8)) && a21 == 1) && !(13 == a8))) || (1 == a7 && ((((a21 <= 0 && 13 == a8) && !(a16 == 6)) && a17 == 1) || ((a21 <= 0 && 13 == a8) && a20 == 1))) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 76 locations, 1 error locations. Result: SAFE, OverallTime: 10.3s, OverallIterations: 13, TraceHistogramMax: 6, AutomataDifference: 5.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.6s, HoareTripleCheckerStatistics: 661 SDtfs, 1392 SDslu, 90 SDs, 0 SdLazy, 3703 SolverSat, 952 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1222 GetRequests, 1180 SyntacticMatches, 8 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1565occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 13 MinimizatonAttempts, 997 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 46 NumberOfFragments, 189 HoareAnnotationTreeSize, 3 FomulaSimplifications, 12995 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 3 FomulaSimplificationsInter, 1688 FormulaSimplificationTreeSizeReductionInter, 0.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 2373 NumberOfCodeBlocks, 2373 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 2940 ConstructedInterpolants, 0 QuantifiedInterpolants, 1192541 SizeOfPredicates, 2 NumberOfNonLiveVariables, 1266 ConjunctsInSsa, 7 ConjunctsInUnsatCore, 19 InterpolantComputations, 16 PerfectInterpolantSequences, 2760/2861 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...