./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem01_label05.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_de471a95-df44-4193-838d-929466d83d83/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_de471a95-df44-4193-838d-929466d83d83/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_de471a95-df44-4193-838d-929466d83d83/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_de471a95-df44-4193-838d-929466d83d83/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem01_label05.c -s /tmp/vcloud-vcloud-master/worker/run_dir_de471a95-df44-4193-838d-929466d83d83/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_de471a95-df44-4193-838d-929466d83d83/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 6893c9ea3ad65b75d2a8fdb58db378617d0e1a5f ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 13:14:07,455 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 13:14:07,456 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 13:14:07,464 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 13:14:07,464 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 13:14:07,464 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 13:14:07,465 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 13:14:07,467 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 13:14:07,468 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 13:14:07,468 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 13:14:07,469 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 13:14:07,470 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 13:14:07,470 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 13:14:07,471 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 13:14:07,471 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 13:14:07,472 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 13:14:07,473 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 13:14:07,473 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 13:14:07,475 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 13:14:07,476 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 13:14:07,477 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 13:14:07,478 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 13:14:07,478 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 13:14:07,479 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 13:14:07,481 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 13:14:07,481 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 13:14:07,481 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 13:14:07,481 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 13:14:07,482 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 13:14:07,482 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 13:14:07,482 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 13:14:07,483 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 13:14:07,483 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 13:14:07,484 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 13:14:07,484 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 13:14:07,484 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 13:14:07,485 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 13:14:07,485 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 13:14:07,485 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 13:14:07,486 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 13:14:07,486 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 13:14:07,486 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_de471a95-df44-4193-838d-929466d83d83/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-12-07 13:14:07,496 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 13:14:07,496 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 13:14:07,497 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 13:14:07,497 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 13:14:07,497 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 13:14:07,497 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 13:14:07,497 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-12-07 13:14:07,497 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 13:14:07,497 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 13:14:07,498 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-12-07 13:14:07,498 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-12-07 13:14:07,498 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 13:14:07,498 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-12-07 13:14:07,498 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-12-07 13:14:07,498 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-12-07 13:14:07,499 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 13:14:07,499 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 13:14:07,499 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 13:14:07,499 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 13:14:07,499 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 13:14:07,499 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 13:14:07,499 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 13:14:07,499 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 13:14:07,500 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 13:14:07,500 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 13:14:07,500 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 13:14:07,500 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 13:14:07,500 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 13:14:07,500 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 13:14:07,500 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 13:14:07,500 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 13:14:07,500 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 13:14:07,501 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 13:14:07,501 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 13:14:07,501 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 13:14:07,501 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-12-07 13:14:07,501 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 13:14:07,501 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 13:14:07,501 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 13:14:07,501 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 13:14:07,501 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_de471a95-df44-4193-838d-929466d83d83/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 -> 6893c9ea3ad65b75d2a8fdb58db378617d0e1a5f [2019-12-07 13:14:07,601 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 13:14:07,611 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 13:14:07,614 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 13:14:07,615 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 13:14:07,615 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 13:14:07,616 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_de471a95-df44-4193-838d-929466d83d83/bin/utaipan/../../sv-benchmarks/c/eca-rers2012/Problem01_label05.c [2019-12-07 13:14:07,657 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_de471a95-df44-4193-838d-929466d83d83/bin/utaipan/data/c08a7e3cf/cae1dfc020164b68ab1078183d040f7d/FLAGa0579e5de [2019-12-07 13:14:08,046 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 13:14:08,046 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_de471a95-df44-4193-838d-929466d83d83/sv-benchmarks/c/eca-rers2012/Problem01_label05.c [2019-12-07 13:14:08,055 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_de471a95-df44-4193-838d-929466d83d83/bin/utaipan/data/c08a7e3cf/cae1dfc020164b68ab1078183d040f7d/FLAGa0579e5de [2019-12-07 13:14:08,064 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_de471a95-df44-4193-838d-929466d83d83/bin/utaipan/data/c08a7e3cf/cae1dfc020164b68ab1078183d040f7d [2019-12-07 13:14:08,066 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 13:14:08,067 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 13:14:08,068 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 13:14:08,068 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 13:14:08,070 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 13:14:08,070 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 01:14:08" (1/1) ... [2019-12-07 13:14:08,072 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@374ca533 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:14:08, skipping insertion in model container [2019-12-07 13:14:08,072 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 01:14:08" (1/1) ... [2019-12-07 13:14:08,077 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 13:14:08,111 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 13:14:08,354 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 13:14:08,357 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 13:14:08,409 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 13:14:08,420 INFO L208 MainTranslator]: Completed translation [2019-12-07 13:14:08,420 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:14:08 WrapperNode [2019-12-07 13:14:08,421 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 13:14:08,421 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 13:14:08,421 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 13:14:08,421 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 13:14:08,427 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:14:08" (1/1) ... [2019-12-07 13:14:08,439 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:14:08" (1/1) ... [2019-12-07 13:14:08,472 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 13:14:08,472 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 13:14:08,472 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 13:14:08,473 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 13:14:08,479 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:14:08" (1/1) ... [2019-12-07 13:14:08,480 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:14:08" (1/1) ... [2019-12-07 13:14:08,482 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:14:08" (1/1) ... [2019-12-07 13:14:08,483 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:14:08" (1/1) ... [2019-12-07 13:14:08,498 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:14:08" (1/1) ... [2019-12-07 13:14:08,504 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:14:08" (1/1) ... [2019-12-07 13:14:08,508 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:14:08" (1/1) ... [2019-12-07 13:14:08,513 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 13:14:08,513 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 13:14:08,513 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 13:14:08,513 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 13:14:08,514 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:14:08" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_de471a95-df44-4193-838d-929466d83d83/bin/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 13:14:08,562 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 13:14:08,562 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 13:14:09,653 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 13:14:09,653 INFO L287 CfgBuilder]: Removed 7 assume(true) statements. [2019-12-07 13:14:09,654 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 01:14:09 BoogieIcfgContainer [2019-12-07 13:14:09,654 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 13:14:09,655 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 13:14:09,655 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 13:14:09,657 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 13:14:09,657 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 01:14:08" (1/3) ... [2019-12-07 13:14:09,658 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6adf78c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 01:14:09, skipping insertion in model container [2019-12-07 13:14:09,658 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:14:08" (2/3) ... [2019-12-07 13:14:09,658 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6adf78c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 01:14:09, skipping insertion in model container [2019-12-07 13:14:09,659 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 01:14:09" (3/3) ... [2019-12-07 13:14:09,660 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem01_label05.c [2019-12-07 13:14:09,666 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 13:14:09,671 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-07 13:14:09,678 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-12-07 13:14:09,694 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 13:14:09,694 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 13:14:09,694 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 13:14:09,695 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 13:14:09,695 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 13:14:09,695 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 13:14:09,695 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 13:14:09,695 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 13:14:09,706 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states. [2019-12-07 13:14:09,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-12-07 13:14:09,711 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:14:09,712 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:14:09,712 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:14:09,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:14:09,716 INFO L82 PathProgramCache]: Analyzing trace with hash -1323244063, now seen corresponding path program 1 times [2019-12-07 13:14:09,722 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:14:09,722 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657880690] [2019-12-07 13:14:09,723 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:14:09,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:14:09,951 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:14:09,951 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657880690] [2019-12-07 13:14:09,952 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:14:09,952 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 13:14:09,953 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263701672] [2019-12-07 13:14:09,956 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:14:09,956 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:14:09,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:14:09,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:14:09,967 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 4 states. [2019-12-07 13:14:10,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:14:10,341 INFO L93 Difference]: Finished difference Result 297 states and 569 transitions. [2019-12-07 13:14:10,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:14:10,342 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 71 [2019-12-07 13:14:10,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:14:10,352 INFO L225 Difference]: With dead ends: 297 [2019-12-07 13:14:10,352 INFO L226 Difference]: Without dead ends: 216 [2019-12-07 13:14:10,354 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:14:10,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2019-12-07 13:14:10,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 145. [2019-12-07 13:14:10,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2019-12-07 13:14:10,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 259 transitions. [2019-12-07 13:14:10,394 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 259 transitions. Word has length 71 [2019-12-07 13:14:10,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:14:10,395 INFO L462 AbstractCegarLoop]: Abstraction has 145 states and 259 transitions. [2019-12-07 13:14:10,395 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:14:10,395 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 259 transitions. [2019-12-07 13:14:10,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-12-07 13:14:10,398 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:14:10,399 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-12-07 13:14:10,399 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:14:10,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:14:10,399 INFO L82 PathProgramCache]: Analyzing trace with hash -1048396684, now seen corresponding path program 1 times [2019-12-07 13:14:10,399 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:14:10,400 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583982250] [2019-12-07 13:14:10,400 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:14:10,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:14:10,447 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:14:10,447 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583982250] [2019-12-07 13:14:10,447 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:14:10,447 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 13:14:10,447 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563166948] [2019-12-07 13:14:10,449 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:14:10,449 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:14:10,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:14:10,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:14:10,449 INFO L87 Difference]: Start difference. First operand 145 states and 259 transitions. Second operand 4 states. [2019-12-07 13:14:10,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:14:10,793 INFO L93 Difference]: Finished difference Result 573 states and 1031 transitions. [2019-12-07 13:14:10,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:14:10,793 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 77 [2019-12-07 13:14:10,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:14:10,796 INFO L225 Difference]: With dead ends: 573 [2019-12-07 13:14:10,796 INFO L226 Difference]: Without dead ends: 429 [2019-12-07 13:14:10,797 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:14:10,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2019-12-07 13:14:10,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 429. [2019-12-07 13:14:10,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 429 states. [2019-12-07 13:14:10,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 706 transitions. [2019-12-07 13:14:10,816 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 706 transitions. Word has length 77 [2019-12-07 13:14:10,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:14:10,816 INFO L462 AbstractCegarLoop]: Abstraction has 429 states and 706 transitions. [2019-12-07 13:14:10,816 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:14:10,816 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 706 transitions. [2019-12-07 13:14:10,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-12-07 13:14:10,819 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:14:10,819 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-12-07 13:14:10,819 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:14:10,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:14:10,819 INFO L82 PathProgramCache]: Analyzing trace with hash -2123301356, now seen corresponding path program 1 times [2019-12-07 13:14:10,820 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:14:10,820 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269644775] [2019-12-07 13:14:10,820 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:14:10,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:14:10,876 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-12-07 13:14:10,877 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1269644775] [2019-12-07 13:14:10,877 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:14:10,877 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 13:14:10,877 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734543835] [2019-12-07 13:14:10,878 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:14:10,878 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:14:10,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:14:10,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:14:10,878 INFO L87 Difference]: Start difference. First operand 429 states and 706 transitions. Second operand 3 states. [2019-12-07 13:14:11,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:14:11,115 INFO L93 Difference]: Finished difference Result 1141 states and 1870 transitions. [2019-12-07 13:14:11,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:14:11,115 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 78 [2019-12-07 13:14:11,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:14:11,120 INFO L225 Difference]: With dead ends: 1141 [2019-12-07 13:14:11,120 INFO L226 Difference]: Without dead ends: 713 [2019-12-07 13:14:11,122 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:14:11,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 713 states. [2019-12-07 13:14:11,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 713 to 571. [2019-12-07 13:14:11,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 571 states. [2019-12-07 13:14:11,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 571 states to 571 states and 847 transitions. [2019-12-07 13:14:11,140 INFO L78 Accepts]: Start accepts. Automaton has 571 states and 847 transitions. Word has length 78 [2019-12-07 13:14:11,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:14:11,141 INFO L462 AbstractCegarLoop]: Abstraction has 571 states and 847 transitions. [2019-12-07 13:14:11,141 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:14:11,141 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 847 transitions. [2019-12-07 13:14:11,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-12-07 13:14:11,143 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:14:11,143 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-12-07 13:14:11,143 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:14:11,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:14:11,144 INFO L82 PathProgramCache]: Analyzing trace with hash 466067279, now seen corresponding path program 1 times [2019-12-07 13:14:11,144 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:14:11,144 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300283676] [2019-12-07 13:14:11,144 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:14:11,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:14:11,196 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-12-07 13:14:11,197 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300283676] [2019-12-07 13:14:11,197 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:14:11,197 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 13:14:11,197 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485166922] [2019-12-07 13:14:11,197 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:14:11,198 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:14:11,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:14:11,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:14:11,198 INFO L87 Difference]: Start difference. First operand 571 states and 847 transitions. Second operand 3 states. [2019-12-07 13:14:11,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:14:11,425 INFO L93 Difference]: Finished difference Result 1283 states and 1938 transitions. [2019-12-07 13:14:11,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:14:11,425 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 105 [2019-12-07 13:14:11,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:14:11,428 INFO L225 Difference]: With dead ends: 1283 [2019-12-07 13:14:11,429 INFO L226 Difference]: Without dead ends: 713 [2019-12-07 13:14:11,429 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:14:11,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 713 states. [2019-12-07 13:14:11,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 713 to 642. [2019-12-07 13:14:11,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 642 states. [2019-12-07 13:14:11,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 961 transitions. [2019-12-07 13:14:11,442 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 961 transitions. Word has length 105 [2019-12-07 13:14:11,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:14:11,443 INFO L462 AbstractCegarLoop]: Abstraction has 642 states and 961 transitions. [2019-12-07 13:14:11,443 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:14:11,443 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 961 transitions. [2019-12-07 13:14:11,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-12-07 13:14:11,444 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:14:11,444 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-12-07 13:14:11,445 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:14:11,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:14:11,445 INFO L82 PathProgramCache]: Analyzing trace with hash 2048819508, now seen corresponding path program 1 times [2019-12-07 13:14:11,445 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:14:11,445 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845987741] [2019-12-07 13:14:11,445 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:14:11,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:14:11,492 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-07 13:14:11,492 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845987741] [2019-12-07 13:14:11,492 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:14:11,492 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 13:14:11,492 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429287048] [2019-12-07 13:14:11,493 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:14:11,493 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:14:11,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:14:11,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:14:11,493 INFO L87 Difference]: Start difference. First operand 642 states and 961 transitions. Second operand 3 states. [2019-12-07 13:14:11,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:14:11,727 INFO L93 Difference]: Finished difference Result 1709 states and 2539 transitions. [2019-12-07 13:14:11,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:14:11,728 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 129 [2019-12-07 13:14:11,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:14:11,733 INFO L225 Difference]: With dead ends: 1709 [2019-12-07 13:14:11,734 INFO L226 Difference]: Without dead ends: 1068 [2019-12-07 13:14:11,735 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:14:11,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1068 states. [2019-12-07 13:14:11,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1068 to 997. [2019-12-07 13:14:11,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 997 states. [2019-12-07 13:14:11,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 997 states to 997 states and 1424 transitions. [2019-12-07 13:14:11,756 INFO L78 Accepts]: Start accepts. Automaton has 997 states and 1424 transitions. Word has length 129 [2019-12-07 13:14:11,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:14:11,756 INFO L462 AbstractCegarLoop]: Abstraction has 997 states and 1424 transitions. [2019-12-07 13:14:11,757 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:14:11,757 INFO L276 IsEmpty]: Start isEmpty. Operand 997 states and 1424 transitions. [2019-12-07 13:14:11,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-12-07 13:14:11,758 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:14:11,759 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-12-07 13:14:11,759 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:14:11,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:14:11,759 INFO L82 PathProgramCache]: Analyzing trace with hash 865225503, now seen corresponding path program 1 times [2019-12-07 13:14:11,759 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:14:11,759 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791057796] [2019-12-07 13:14:11,759 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:14:11,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:14:11,814 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2019-12-07 13:14:11,814 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791057796] [2019-12-07 13:14:11,815 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:14:11,815 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 13:14:11,815 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382170732] [2019-12-07 13:14:11,815 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:14:11,815 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:14:11,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:14:11,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:14:11,816 INFO L87 Difference]: Start difference. First operand 997 states and 1424 transitions. Second operand 3 states. [2019-12-07 13:14:12,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:14:12,069 INFO L93 Difference]: Finished difference Result 1993 states and 2847 transitions. [2019-12-07 13:14:12,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:14:12,070 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 134 [2019-12-07 13:14:12,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:14:12,075 INFO L225 Difference]: With dead ends: 1993 [2019-12-07 13:14:12,075 INFO L226 Difference]: Without dead ends: 997 [2019-12-07 13:14:12,077 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:14:12,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 997 states. [2019-12-07 13:14:12,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 997 to 926. [2019-12-07 13:14:12,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 926 states. [2019-12-07 13:14:12,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 926 states to 926 states and 1329 transitions. [2019-12-07 13:14:12,102 INFO L78 Accepts]: Start accepts. Automaton has 926 states and 1329 transitions. Word has length 134 [2019-12-07 13:14:12,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:14:12,102 INFO L462 AbstractCegarLoop]: Abstraction has 926 states and 1329 transitions. [2019-12-07 13:14:12,103 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:14:12,103 INFO L276 IsEmpty]: Start isEmpty. Operand 926 states and 1329 transitions. [2019-12-07 13:14:12,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-12-07 13:14:12,106 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:14:12,106 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-12-07 13:14:12,119 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:14:12,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:14:12,119 INFO L82 PathProgramCache]: Analyzing trace with hash 465703224, now seen corresponding path program 1 times [2019-12-07 13:14:12,119 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:14:12,119 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746875470] [2019-12-07 13:14:12,120 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:14:12,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:14:12,170 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2019-12-07 13:14:12,170 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746875470] [2019-12-07 13:14:12,171 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:14:12,171 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 13:14:12,171 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989572305] [2019-12-07 13:14:12,171 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:14:12,171 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:14:12,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:14:12,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:14:12,172 INFO L87 Difference]: Start difference. First operand 926 states and 1329 transitions. Second operand 3 states. [2019-12-07 13:14:12,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:14:12,397 INFO L93 Difference]: Finished difference Result 1922 states and 2740 transitions. [2019-12-07 13:14:12,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:14:12,397 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 154 [2019-12-07 13:14:12,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:14:12,401 INFO L225 Difference]: With dead ends: 1922 [2019-12-07 13:14:12,401 INFO L226 Difference]: Without dead ends: 997 [2019-12-07 13:14:12,403 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:14:12,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 997 states. [2019-12-07 13:14:12,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 997 to 997. [2019-12-07 13:14:12,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 997 states. [2019-12-07 13:14:12,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 997 states to 997 states and 1388 transitions. [2019-12-07 13:14:12,419 INFO L78 Accepts]: Start accepts. Automaton has 997 states and 1388 transitions. Word has length 154 [2019-12-07 13:14:12,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:14:12,420 INFO L462 AbstractCegarLoop]: Abstraction has 997 states and 1388 transitions. [2019-12-07 13:14:12,420 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:14:12,420 INFO L276 IsEmpty]: Start isEmpty. Operand 997 states and 1388 transitions. [2019-12-07 13:14:12,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-12-07 13:14:12,422 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:14:12,422 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-12-07 13:14:12,422 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:14:12,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:14:12,422 INFO L82 PathProgramCache]: Analyzing trace with hash -2114883584, now seen corresponding path program 1 times [2019-12-07 13:14:12,422 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:14:12,423 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975103656] [2019-12-07 13:14:12,423 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:14:12,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:14:12,536 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2019-12-07 13:14:12,536 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975103656] [2019-12-07 13:14:12,536 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:14:12,536 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 13:14:12,537 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695465570] [2019-12-07 13:14:12,537 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 13:14:12,537 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:14:12,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 13:14:12,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-12-07 13:14:12,537 INFO L87 Difference]: Start difference. First operand 997 states and 1388 transitions. Second operand 8 states. [2019-12-07 13:14:13,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:14:13,022 INFO L93 Difference]: Finished difference Result 2103 states and 2891 transitions. [2019-12-07 13:14:13,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 13:14:13,022 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 158 [2019-12-07 13:14:13,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:14:13,028 INFO L225 Difference]: With dead ends: 2103 [2019-12-07 13:14:13,028 INFO L226 Difference]: Without dead ends: 1107 [2019-12-07 13:14:13,029 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-12-07 13:14:13,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1107 states. [2019-12-07 13:14:13,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1107 to 997. [2019-12-07 13:14:13,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 997 states. [2019-12-07 13:14:13,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 997 states to 997 states and 1376 transitions. [2019-12-07 13:14:13,058 INFO L78 Accepts]: Start accepts. Automaton has 997 states and 1376 transitions. Word has length 158 [2019-12-07 13:14:13,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:14:13,058 INFO L462 AbstractCegarLoop]: Abstraction has 997 states and 1376 transitions. [2019-12-07 13:14:13,058 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 13:14:13,058 INFO L276 IsEmpty]: Start isEmpty. Operand 997 states and 1376 transitions. [2019-12-07 13:14:13,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-12-07 13:14:13,061 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:14:13,062 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-12-07 13:14:13,062 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:14:13,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:14:13,062 INFO L82 PathProgramCache]: Analyzing trace with hash 1219959715, now seen corresponding path program 1 times [2019-12-07 13:14:13,062 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:14:13,062 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66892635] [2019-12-07 13:14:13,063 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:14:13,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:14:13,177 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2019-12-07 13:14:13,177 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66892635] [2019-12-07 13:14:13,178 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:14:13,178 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 13:14:13,178 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902861970] [2019-12-07 13:14:13,178 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:14:13,179 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:14:13,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:14:13,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:14:13,179 INFO L87 Difference]: Start difference. First operand 997 states and 1376 transitions. Second operand 3 states. [2019-12-07 13:14:13,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:14:13,363 INFO L93 Difference]: Finished difference Result 1283 states and 1745 transitions. [2019-12-07 13:14:13,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:14:13,364 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 175 [2019-12-07 13:14:13,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:14:13,368 INFO L225 Difference]: With dead ends: 1283 [2019-12-07 13:14:13,368 INFO L226 Difference]: Without dead ends: 1281 [2019-12-07 13:14:13,369 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:14:13,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1281 states. [2019-12-07 13:14:13,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1281 to 926. [2019-12-07 13:14:13,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 926 states. [2019-12-07 13:14:13,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 926 states to 926 states and 1262 transitions. [2019-12-07 13:14:13,384 INFO L78 Accepts]: Start accepts. Automaton has 926 states and 1262 transitions. Word has length 175 [2019-12-07 13:14:13,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:14:13,385 INFO L462 AbstractCegarLoop]: Abstraction has 926 states and 1262 transitions. [2019-12-07 13:14:13,385 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:14:13,385 INFO L276 IsEmpty]: Start isEmpty. Operand 926 states and 1262 transitions. [2019-12-07 13:14:13,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2019-12-07 13:14:13,387 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:14:13,387 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-12-07 13:14:13,387 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:14:13,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:14:13,387 INFO L82 PathProgramCache]: Analyzing trace with hash -75790848, now seen corresponding path program 1 times [2019-12-07 13:14:13,387 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:14:13,388 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274232274] [2019-12-07 13:14:13,388 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:14:13,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:14:13,511 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 141 proven. 70 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-12-07 13:14:13,511 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274232274] [2019-12-07 13:14:13,512 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [924150227] [2019-12-07 13:14:13,512 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_de471a95-df44-4193-838d-929466d83d83/bin/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 13:14:13,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:14:13,576 INFO L264 TraceCheckSpWp]: Trace formula consists of 389 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 13:14:13,585 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:14:13,631 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2019-12-07 13:14:13,631 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 13:14:13,664 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2019-12-07 13:14:13,664 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-12-07 13:14:13,664 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [5] total 7 [2019-12-07 13:14:13,665 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494636244] [2019-12-07 13:14:13,665 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:14:13,665 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:14:13,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:14:13,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-07 13:14:13,665 INFO L87 Difference]: Start difference. First operand 926 states and 1262 transitions. Second operand 3 states. [2019-12-07 13:14:13,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:14:13,895 INFO L93 Difference]: Finished difference Result 1849 states and 2522 transitions. [2019-12-07 13:14:13,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:14:13,895 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 193 [2019-12-07 13:14:13,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:14:13,896 INFO L225 Difference]: With dead ends: 1849 [2019-12-07 13:14:13,896 INFO L226 Difference]: Without dead ends: 0 [2019-12-07 13:14:13,897 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-12-07 13:14:13,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-12-07 13:14:13,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-12-07 13:14:13,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-12-07 13:14:13,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-12-07 13:14:13,898 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 193 [2019-12-07 13:14:13,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:14:13,898 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-12-07 13:14:13,898 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:14:13,898 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-12-07 13:14:13,898 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-12-07 13:14:14,099 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 13:14:14,101 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-12-07 13:14:14,368 INFO L246 CegarLoopResult]: For program point L333(lines 333 390) no Hoare annotation was computed. [2019-12-07 13:14:14,368 INFO L246 CegarLoopResult]: For program point L102(lines 102 390) no Hoare annotation was computed. [2019-12-07 13:14:14,368 INFO L246 CegarLoopResult]: For program point L268(lines 268 390) no Hoare annotation was computed. [2019-12-07 13:14:14,369 INFO L246 CegarLoopResult]: For program point L136(lines 136 390) no Hoare annotation was computed. [2019-12-07 13:14:14,369 INFO L246 CegarLoopResult]: For program point L203(lines 203 390) no Hoare annotation was computed. [2019-12-07 13:14:14,369 INFO L246 CegarLoopResult]: For program point L72(lines 72 390) no Hoare annotation was computed. [2019-12-07 13:14:14,369 INFO L246 CegarLoopResult]: For program point L337(lines 337 390) no Hoare annotation was computed. [2019-12-07 13:14:14,369 INFO L246 CegarLoopResult]: For program point L238(lines 238 390) no Hoare annotation was computed. [2019-12-07 13:14:14,369 INFO L246 CegarLoopResult]: For program point L173(lines 173 390) no Hoare annotation was computed. [2019-12-07 13:14:14,369 INFO L246 CegarLoopResult]: For program point L140(lines 140 390) no Hoare annotation was computed. [2019-12-07 13:14:14,369 INFO L246 CegarLoopResult]: For program point L372(lines 372 390) no Hoare annotation was computed. [2019-12-07 13:14:14,369 INFO L246 CegarLoopResult]: For program point L306(lines 306 390) no Hoare annotation was computed. [2019-12-07 13:14:14,369 INFO L246 CegarLoopResult]: For program point L273(lines 273 390) no Hoare annotation was computed. [2019-12-07 13:14:14,369 INFO L246 CegarLoopResult]: For program point L108(lines 108 390) no Hoare annotation was computed. [2019-12-07 13:14:14,369 INFO L246 CegarLoopResult]: For program point L208(lines 208 390) no Hoare annotation was computed. [2019-12-07 13:14:14,369 INFO L246 CegarLoopResult]: For program point L43(lines 43 390) no Hoare annotation was computed. [2019-12-07 13:14:14,369 INFO L246 CegarLoopResult]: For program point L144(lines 144 390) no Hoare annotation was computed. [2019-12-07 13:14:14,370 INFO L242 CegarLoopResult]: At program point L574(lines 30 575) the Hoare annotation is: (let ((.cse3 (not (= 13 ~a8~0))) (.cse6 (= ~a17~0 1)) (.cse4 (<= ~a21~0 0)) (.cse1 (= ~a20~0 1)) (.cse5 (not (= ~a16~0 6))) (.cse0 (not (= 1 ~a7~0))) (.cse2 (= ~a21~0 1))) (or (and .cse0 .cse1 .cse2) (and .cse0 .cse2 .cse3) (and .cse4 .cse5 .cse6) (and .cse5 .cse2 .cse3) (and .cse6 .cse1 .cse2) (and .cse4 .cse1) (and .cse5 .cse0 .cse2))) [2019-12-07 13:14:14,370 INFO L246 CegarLoopResult]: For program point L178(lines 178 390) no Hoare annotation was computed. [2019-12-07 13:14:14,370 INFO L246 CegarLoopResult]: For program point L377(lines 377 390) no Hoare annotation was computed. [2019-12-07 13:14:14,370 INFO L246 CegarLoopResult]: For program point L278(lines 278 390) no Hoare annotation was computed. [2019-12-07 13:14:14,370 INFO L246 CegarLoopResult]: For program point L245(lines 245 390) no Hoare annotation was computed. [2019-12-07 13:14:14,370 INFO L246 CegarLoopResult]: For program point L80(lines 80 390) no Hoare annotation was computed. [2019-12-07 13:14:14,370 INFO L246 CegarLoopResult]: For program point L345(lines 345 390) no Hoare annotation was computed. [2019-12-07 13:14:14,370 INFO L246 CegarLoopResult]: For program point L312(lines 312 390) no Hoare annotation was computed. [2019-12-07 13:14:14,370 INFO L246 CegarLoopResult]: For program point L114(lines 114 390) no Hoare annotation was computed. [2019-12-07 13:14:14,371 INFO L249 CegarLoopResult]: At program point L577(lines 577 594) the Hoare annotation is: true [2019-12-07 13:14:14,371 INFO L246 CegarLoopResult]: For program point L214(lines 214 390) no Hoare annotation was computed. [2019-12-07 13:14:14,371 INFO L246 CegarLoopResult]: For program point L148(lines 148 390) no Hoare annotation was computed. [2019-12-07 13:14:14,371 INFO L246 CegarLoopResult]: For program point L49(lines 49 390) no Hoare annotation was computed. [2019-12-07 13:14:14,371 INFO L246 CegarLoopResult]: For program point L84(lines 84 390) no Hoare annotation was computed. [2019-12-07 13:14:14,371 INFO L246 CegarLoopResult]: For program point L382(lines 382 390) no Hoare annotation was computed. [2019-12-07 13:14:14,371 INFO L246 CegarLoopResult]: For program point L316(lines 316 390) no Hoare annotation was computed. [2019-12-07 13:14:14,371 INFO L246 CegarLoopResult]: For program point L250(lines 250 390) no Hoare annotation was computed. [2019-12-07 13:14:14,371 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-12-07 13:14:14,371 INFO L246 CegarLoopResult]: For program point L218(lines 218 390) no Hoare annotation was computed. [2019-12-07 13:14:14,371 INFO L246 CegarLoopResult]: For program point L152(lines 152 390) no Hoare annotation was computed. [2019-12-07 13:14:14,371 INFO L246 CegarLoopResult]: For program point L119(lines 119 390) no Hoare annotation was computed. [2019-12-07 13:14:14,371 INFO L246 CegarLoopResult]: For program point L318(lines 318 390) no Hoare annotation was computed. [2019-12-07 13:14:14,371 INFO L246 CegarLoopResult]: For program point L186(lines 186 390) no Hoare annotation was computed. [2019-12-07 13:14:14,372 INFO L246 CegarLoopResult]: For program point L54(lines 54 390) no Hoare annotation was computed. [2019-12-07 13:14:14,372 INFO L242 CegarLoopResult]: At program point L583-2(lines 583 593) the Hoare annotation is: (let ((.cse3 (not (= 13 ~a8~0))) (.cse6 (= ~a17~0 1)) (.cse4 (<= ~a21~0 0)) (.cse1 (= ~a20~0 1)) (.cse5 (not (= ~a16~0 6))) (.cse0 (not (= 1 ~a7~0))) (.cse2 (= ~a21~0 1))) (or (and .cse0 .cse1 .cse2) (and .cse0 .cse2 .cse3) (and .cse4 .cse5 .cse6) (and .cse5 .cse2 .cse3) (and .cse6 .cse1 .cse2) (and .cse4 .cse1) (and .cse5 .cse0 .cse2))) [2019-12-07 13:14:14,372 INFO L246 CegarLoopResult]: For program point L286(lines 286 390) no Hoare annotation was computed. [2019-12-07 13:14:14,372 INFO L246 CegarLoopResult]: For program point L353(lines 353 390) no Hoare annotation was computed. [2019-12-07 13:14:14,372 INFO L246 CegarLoopResult]: For program point L189(lines 189 390) no Hoare annotation was computed. [2019-12-07 13:14:14,372 INFO L246 CegarLoopResult]: For program point L454-1(lines 30 575) no Hoare annotation was computed. [2019-12-07 13:14:14,372 INFO L246 CegarLoopResult]: For program point L355(lines 355 390) no Hoare annotation was computed. [2019-12-07 13:14:14,372 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-12-07 13:14:14,372 INFO L246 CegarLoopResult]: For program point L256(lines 256 390) no Hoare annotation was computed. [2019-12-07 13:14:14,372 INFO L246 CegarLoopResult]: For program point L223(lines 223 390) no Hoare annotation was computed. [2019-12-07 13:14:14,372 INFO L246 CegarLoopResult]: For program point L124(lines 124 390) no Hoare annotation was computed. [2019-12-07 13:14:14,372 INFO L246 CegarLoopResult]: For program point L92(lines 92 390) no Hoare annotation was computed. [2019-12-07 13:14:14,373 INFO L246 CegarLoopResult]: For program point L588(line 588) no Hoare annotation was computed. [2019-12-07 13:14:14,373 INFO L246 CegarLoopResult]: For program point L324(lines 324 390) no Hoare annotation was computed. [2019-12-07 13:14:14,373 INFO L246 CegarLoopResult]: For program point L457-1(lines 30 575) no Hoare annotation was computed. [2019-12-07 13:14:14,373 INFO L246 CegarLoopResult]: For program point L292(lines 292 390) no Hoare annotation was computed. [2019-12-07 13:14:14,373 INFO L246 CegarLoopResult]: For program point L160(lines 160 390) no Hoare annotation was computed. [2019-12-07 13:14:14,373 INFO L246 CegarLoopResult]: For program point L458(line 458) no Hoare annotation was computed. [2019-12-07 13:14:14,373 INFO L246 CegarLoopResult]: For program point L194(lines 194 390) no Hoare annotation was computed. [2019-12-07 13:14:14,373 INFO L246 CegarLoopResult]: For program point L62(lines 62 390) no Hoare annotation was computed. [2019-12-07 13:14:14,373 INFO L246 CegarLoopResult]: For program point L261(lines 261 390) no Hoare annotation was computed. [2019-12-07 13:14:14,373 INFO L246 CegarLoopResult]: For program point L129(lines 129 390) no Hoare annotation was computed. [2019-12-07 13:14:14,373 INFO L246 CegarLoopResult]: For program point L361(lines 361 390) no Hoare annotation was computed. [2019-12-07 13:14:14,373 INFO L246 CegarLoopResult]: For program point L97(lines 97 390) no Hoare annotation was computed. [2019-12-07 13:14:14,373 INFO L246 CegarLoopResult]: For program point L31(lines 31 390) no Hoare annotation was computed. [2019-12-07 13:14:14,373 INFO L246 CegarLoopResult]: For program point L329(lines 329 390) no Hoare annotation was computed. [2019-12-07 13:14:14,374 INFO L246 CegarLoopResult]: For program point L197(lines 197 390) no Hoare annotation was computed. [2019-12-07 13:14:14,374 INFO L246 CegarLoopResult]: For program point L65(lines 65 390) no Hoare annotation was computed. [2019-12-07 13:14:14,374 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 458) no Hoare annotation was computed. [2019-12-07 13:14:14,374 INFO L246 CegarLoopResult]: For program point L363(lines 363 390) no Hoare annotation was computed. [2019-12-07 13:14:14,374 INFO L246 CegarLoopResult]: For program point L231(lines 231 390) no Hoare annotation was computed. [2019-12-07 13:14:14,374 INFO L246 CegarLoopResult]: For program point L165(lines 165 390) no Hoare annotation was computed. [2019-12-07 13:14:14,374 INFO L246 CegarLoopResult]: For program point L265(lines 265 390) no Hoare annotation was computed. [2019-12-07 13:14:14,374 INFO L246 CegarLoopResult]: For program point L365(lines 365 390) no Hoare annotation was computed. [2019-12-07 13:14:14,374 INFO L246 CegarLoopResult]: For program point L299(lines 299 390) no Hoare annotation was computed. [2019-12-07 13:14:14,374 INFO L246 CegarLoopResult]: For program point L35(lines 35 390) no Hoare annotation was computed. [2019-12-07 13:14:14,392 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 01:14:14 BoogieIcfgContainer [2019-12-07 13:14:14,392 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 13:14:14,392 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 13:14:14,393 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 13:14:14,393 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 13:14:14,393 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 01:14:09" (3/4) ... [2019-12-07 13:14:14,396 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-12-07 13:14:14,414 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 100 nodes and edges [2019-12-07 13:14:14,415 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2019-12-07 13:14:14,417 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2019-12-07 13:14:14,520 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_de471a95-df44-4193-838d-929466d83d83/bin/utaipan/witness.graphml [2019-12-07 13:14:14,520 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 13:14:14,521 INFO L168 Benchmark]: Toolchain (without parser) took 6454.16 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 233.8 MB). Free memory was 938.1 MB in the beginning and 1.1 GB in the end (delta: -205.3 MB). Peak memory consumption was 28.5 MB. Max. memory is 11.5 GB. [2019-12-07 13:14:14,522 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 960.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 13:14:14,522 INFO L168 Benchmark]: CACSL2BoogieTranslator took 353.23 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 120.1 MB). Free memory was 938.1 MB in the beginning and 1.1 GB in the end (delta: -154.8 MB). Peak memory consumption was 18.8 MB. Max. memory is 11.5 GB. [2019-12-07 13:14:14,522 INFO L168 Benchmark]: Boogie Procedure Inliner took 51.09 ms. Allocated memory is still 1.1 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-12-07 13:14:14,523 INFO L168 Benchmark]: Boogie Preprocessor took 40.39 ms. Allocated memory is still 1.1 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-12-07 13:14:14,523 INFO L168 Benchmark]: RCFGBuilder took 1141.60 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 866.9 MB in the end (delta: 215.2 MB). Peak memory consumption was 215.2 MB. Max. memory is 11.5 GB. [2019-12-07 13:14:14,523 INFO L168 Benchmark]: TraceAbstraction took 4737.00 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 113.8 MB). Free memory was 866.9 MB in the beginning and 1.2 GB in the end (delta: -295.0 MB). Peak memory consumption was 160.8 MB. Max. memory is 11.5 GB. [2019-12-07 13:14:14,523 INFO L168 Benchmark]: Witness Printer took 127.39 ms. Allocated memory is still 1.3 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 18.5 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. [2019-12-07 13:14:14,525 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.17 ms. Allocated memory is still 1.0 GB. Free memory is still 960.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 353.23 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 120.1 MB). Free memory was 938.1 MB in the beginning and 1.1 GB in the end (delta: -154.8 MB). Peak memory consumption was 18.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 51.09 ms. Allocated memory is still 1.1 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 40.39 ms. Allocated memory is still 1.1 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 1141.60 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 866.9 MB in the end (delta: 215.2 MB). Peak memory consumption was 215.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 4737.00 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 113.8 MB). Free memory was 866.9 MB in the beginning and 1.2 GB in the end (delta: -295.0 MB). Peak memory consumption was 160.8 MB. Max. memory is 11.5 GB. * Witness Printer took 127.39 ms. Allocated memory is still 1.3 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 18.5 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 458]: 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: (((((((!(1 == a7) && a20 == 1) && a21 == 1) || ((!(1 == a7) && a21 == 1) && !(13 == a8))) || ((a21 <= 0 && !(a16 == 6)) && a17 == 1)) || ((!(a16 == 6) && a21 == 1) && !(13 == a8))) || ((a17 == 1 && a20 == 1) && a21 == 1)) || (a21 <= 0 && a20 == 1)) || ((!(a16 == 6) && !(1 == a7)) && a21 == 1) - InvariantResult [Line: 577]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 583]: Loop Invariant Derived loop invariant: (((((((!(1 == a7) && a20 == 1) && a21 == 1) || ((!(1 == a7) && a21 == 1) && !(13 == a8))) || ((a21 <= 0 && !(a16 == 6)) && a17 == 1)) || ((!(a16 == 6) && a21 == 1) && !(13 == a8))) || ((a17 == 1 && a20 == 1) && a21 == 1)) || (a21 <= 0 && a20 == 1)) || ((!(a16 == 6) && !(1 == a7)) && a21 == 1) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 76 locations, 1 error locations. Result: SAFE, OverallTime: 4.4s, OverallIterations: 10, TraceHistogramMax: 5, AutomataDifference: 2.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.2s, HoareTripleCheckerStatistics: 431 SDtfs, 918 SDslu, 69 SDs, 0 SdLazy, 2857 SolverSat, 744 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 422 GetRequests, 396 SyntacticMatches, 5 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=997occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 10 MinimizatonAttempts, 891 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 32 NumberOfFragments, 153 HoareAnnotationTreeSize, 3 FomulaSimplifications, 3250 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 3 FomulaSimplificationsInter, 328 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 1467 NumberOfCodeBlocks, 1467 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 1648 ConstructedInterpolants, 0 QuantifiedInterpolants, 628287 SizeOfPredicates, 1 NumberOfNonLiveVariables, 389 ConjunctsInSsa, 2 ConjunctsInUnsatCore, 12 InterpolantComputations, 11 PerfectInterpolantSequences, 1249/1319 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...