./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem02_label53.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_dc426aaf-4cd1-4066-b8bb-6bda8865c6ec/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_dc426aaf-4cd1-4066-b8bb-6bda8865c6ec/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_dc426aaf-4cd1-4066-b8bb-6bda8865c6ec/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_dc426aaf-4cd1-4066-b8bb-6bda8865c6ec/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem02_label53.c -s /tmp/vcloud-vcloud-master/worker/run_dir_dc426aaf-4cd1-4066-b8bb-6bda8865c6ec/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_dc426aaf-4cd1-4066-b8bb-6bda8865c6ec/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 cae8686038ca87cfc982771df117a4c5585b00bb .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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:44:49,674 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-26 02:44:49,676 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-26 02:44:49,691 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-26 02:44:49,692 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-26 02:44:49,693 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-26 02:44:49,695 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-26 02:44:49,703 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-26 02:44:49,707 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-26 02:44:49,709 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-26 02:44:49,712 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-26 02:44:49,713 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-26 02:44:49,713 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-26 02:44:49,717 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-26 02:44:49,718 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-26 02:44:49,719 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-26 02:44:49,720 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-26 02:44:49,720 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-26 02:44:49,723 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-26 02:44:49,725 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-26 02:44:49,726 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-26 02:44:49,727 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-26 02:44:49,728 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-26 02:44:49,729 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-26 02:44:49,731 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-26 02:44:49,731 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-26 02:44:49,731 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-26 02:44:49,732 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-26 02:44:49,732 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-26 02:44:49,733 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-26 02:44:49,733 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-26 02:44:49,734 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-26 02:44:49,734 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-26 02:44:49,735 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-26 02:44:49,736 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-26 02:44:49,736 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-26 02:44:49,736 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-26 02:44:49,737 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-26 02:44:49,737 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-26 02:44:49,738 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-26 02:44:49,738 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-26 02:44:49,740 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_dc426aaf-4cd1-4066-b8bb-6bda8865c6ec/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-11-26 02:44:49,752 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-26 02:44:49,752 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-26 02:44:49,753 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-26 02:44:49,753 INFO L138 SettingsManager]: * User list type=DISABLED [2019-11-26 02:44:49,753 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-11-26 02:44:49,753 INFO L138 SettingsManager]: * Explicit value domain=true [2019-11-26 02:44:49,753 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-11-26 02:44:49,754 INFO L138 SettingsManager]: * Octagon Domain=false [2019-11-26 02:44:49,754 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-11-26 02:44:49,754 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-11-26 02:44:49,754 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-11-26 02:44:49,754 INFO L138 SettingsManager]: * Interval Domain=false [2019-11-26 02:44:49,755 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-11-26 02:44:49,755 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-11-26 02:44:49,755 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-11-26 02:44:49,756 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-26 02:44:49,756 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-26 02:44:49,756 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-26 02:44:49,756 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-26 02:44:49,756 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-26 02:44:49,757 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-26 02:44:49,757 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-26 02:44:49,757 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-26 02:44:49,757 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-26 02:44:49,757 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-26 02:44:49,757 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-26 02:44:49,758 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-26 02:44:49,758 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-26 02:44:49,758 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-26 02:44:49,758 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-26 02:44:49,758 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-26 02:44:49,759 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-26 02:44:49,759 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-26 02:44:49,759 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-11-26 02:44:49,759 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-26 02:44:49,759 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-26 02:44:49,760 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-26 02:44:49,760 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_dc426aaf-4cd1-4066-b8bb-6bda8865c6ec/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 -> cae8686038ca87cfc982771df117a4c5585b00bb [2019-11-26 02:44:49,908 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-26 02:44:49,919 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-26 02:44:49,924 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-26 02:44:49,926 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-26 02:44:49,926 INFO L275 PluginConnector]: CDTParser initialized [2019-11-26 02:44:49,927 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_dc426aaf-4cd1-4066-b8bb-6bda8865c6ec/bin/utaipan/../../sv-benchmarks/c/eca-rers2012/Problem02_label53.c [2019-11-26 02:44:49,981 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_dc426aaf-4cd1-4066-b8bb-6bda8865c6ec/bin/utaipan/data/981747a50/758ed78d6cc04b97a3ebff358d0074ad/FLAG16b86b85d [2019-11-26 02:44:50,441 INFO L306 CDTParser]: Found 1 translation units. [2019-11-26 02:44:50,442 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_dc426aaf-4cd1-4066-b8bb-6bda8865c6ec/sv-benchmarks/c/eca-rers2012/Problem02_label53.c [2019-11-26 02:44:50,463 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_dc426aaf-4cd1-4066-b8bb-6bda8865c6ec/bin/utaipan/data/981747a50/758ed78d6cc04b97a3ebff358d0074ad/FLAG16b86b85d [2019-11-26 02:44:50,709 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_dc426aaf-4cd1-4066-b8bb-6bda8865c6ec/bin/utaipan/data/981747a50/758ed78d6cc04b97a3ebff358d0074ad [2019-11-26 02:44:50,712 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-26 02:44:50,713 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-26 02:44:50,714 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-26 02:44:50,714 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-26 02:44:50,718 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-26 02:44:50,719 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 02:44:50" (1/1) ... [2019-11-26 02:44:50,721 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6247f2e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:44:50, skipping insertion in model container [2019-11-26 02:44:50,721 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 02:44:50" (1/1) ... [2019-11-26 02:44:50,728 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-26 02:44:50,774 INFO L179 MainTranslator]: Built tables and reachable declarations [2019-11-26 02:44:51,201 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-26 02:44:51,212 INFO L201 MainTranslator]: Completed pre-run [2019-11-26 02:44:51,368 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-26 02:44:51,386 INFO L205 MainTranslator]: Completed translation [2019-11-26 02:44:51,387 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:44:51 WrapperNode [2019-11-26 02:44:51,387 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-26 02:44:51,388 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-26 02:44:51,388 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-26 02:44:51,388 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-26 02:44:51,396 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:44:51" (1/1) ... [2019-11-26 02:44:51,424 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:44:51" (1/1) ... [2019-11-26 02:44:51,483 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-26 02:44:51,483 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-26 02:44:51,483 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-26 02:44:51,484 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-26 02:44:51,492 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:44:51" (1/1) ... [2019-11-26 02:44:51,493 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:44:51" (1/1) ... [2019-11-26 02:44:51,496 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:44:51" (1/1) ... [2019-11-26 02:44:51,496 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:44:51" (1/1) ... [2019-11-26 02:44:51,522 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:44:51" (1/1) ... [2019-11-26 02:44:51,534 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:44:51" (1/1) ... [2019-11-26 02:44:51,540 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:44:51" (1/1) ... [2019-11-26 02:44:51,545 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-26 02:44:51,546 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-26 02:44:51,546 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-26 02:44:51,546 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-26 02:44:51,547 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:44:51" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_dc426aaf-4cd1-4066-b8bb-6bda8865c6ec/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:44:51,616 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-26 02:44:51,618 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-26 02:44:53,862 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-26 02:44:53,863 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-26 02:44:53,864 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 02:44:53 BoogieIcfgContainer [2019-11-26 02:44:53,864 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-26 02:44:53,866 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-26 02:44:53,866 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-26 02:44:53,869 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-26 02:44:53,869 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.11 02:44:50" (1/3) ... [2019-11-26 02:44:53,870 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48e9931e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 02:44:53, skipping insertion in model container [2019-11-26 02:44:53,870 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:44:51" (2/3) ... [2019-11-26 02:44:53,871 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48e9931e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 02:44:53, skipping insertion in model container [2019-11-26 02:44:53,871 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 02:44:53" (3/3) ... [2019-11-26 02:44:53,873 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem02_label53.c [2019-11-26 02:44:53,882 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-26 02:44:53,892 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-26 02:44:53,935 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-26 02:44:53,980 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-26 02:44:53,981 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-26 02:44:53,981 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-26 02:44:53,981 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-26 02:44:53,981 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-26 02:44:53,982 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-26 02:44:53,982 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-26 02:44:53,982 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-26 02:44:54,002 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states. [2019-11-26 02:44:54,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-11-26 02:44:54,012 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:44:54,013 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:44:54,013 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:44:54,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:44:54,020 INFO L82 PathProgramCache]: Analyzing trace with hash 925963023, now seen corresponding path program 1 times [2019-11-26 02:44:54,028 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:44:54,029 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241446049] [2019-11-26 02:44:54,029 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:44:54,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:44:54,385 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:44:54,386 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241446049] [2019-11-26 02:44:54,387 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:44:54,387 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-26 02:44:54,389 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976251376] [2019-11-26 02:44:54,393 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-26 02:44:54,394 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:44:54,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-26 02:44:54,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:44:54,409 INFO L87 Difference]: Start difference. First operand 85 states. Second operand 3 states. [2019-11-26 02:44:54,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:44:54,957 INFO L93 Difference]: Finished difference Result 251 states and 482 transitions. [2019-11-26 02:44:54,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 02:44:54,959 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 80 [2019-11-26 02:44:54,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:44:54,980 INFO L225 Difference]: With dead ends: 251 [2019-11-26 02:44:54,981 INFO L226 Difference]: Without dead ends: 163 [2019-11-26 02:44:54,984 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:44:55,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2019-11-26 02:44:55,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 163. [2019-11-26 02:44:55,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-11-26 02:44:55,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 288 transitions. [2019-11-26 02:44:55,041 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 288 transitions. Word has length 80 [2019-11-26 02:44:55,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:44:55,042 INFO L462 AbstractCegarLoop]: Abstraction has 163 states and 288 transitions. [2019-11-26 02:44:55,042 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-26 02:44:55,043 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 288 transitions. [2019-11-26 02:44:55,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-26 02:44:55,047 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:44:55,047 INFO L410 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:44:55,047 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:44:55,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:44:55,048 INFO L82 PathProgramCache]: Analyzing trace with hash 221763502, now seen corresponding path program 1 times [2019-11-26 02:44:55,048 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:44:55,049 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577435386] [2019-11-26 02:44:55,049 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:44:55,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:44:55,147 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:44:55,147 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577435386] [2019-11-26 02:44:55,148 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:44:55,148 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 02:44:55,148 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549377269] [2019-11-26 02:44:55,150 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:44:55,150 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:44:55,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:44:55,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:44:55,150 INFO L87 Difference]: Start difference. First operand 163 states and 288 transitions. Second operand 4 states. [2019-11-26 02:44:55,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:44:55,785 INFO L93 Difference]: Finished difference Result 645 states and 1147 transitions. [2019-11-26 02:44:55,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:44:55,785 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2019-11-26 02:44:55,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:44:55,789 INFO L225 Difference]: With dead ends: 645 [2019-11-26 02:44:55,790 INFO L226 Difference]: Without dead ends: 483 [2019-11-26 02:44:55,791 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:44:55,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 483 states. [2019-11-26 02:44:55,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 483 to 323. [2019-11-26 02:44:55,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 323 states. [2019-11-26 02:44:55,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 548 transitions. [2019-11-26 02:44:55,815 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 548 transitions. Word has length 98 [2019-11-26 02:44:55,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:44:55,816 INFO L462 AbstractCegarLoop]: Abstraction has 323 states and 548 transitions. [2019-11-26 02:44:55,816 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:44:55,816 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 548 transitions. [2019-11-26 02:44:55,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-11-26 02:44:55,820 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:44:55,820 INFO L410 BasicCegarLoop]: trace histogram [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, 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:44:55,820 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:44:55,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:44:55,821 INFO L82 PathProgramCache]: Analyzing trace with hash -450003061, now seen corresponding path program 1 times [2019-11-26 02:44:55,821 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:44:55,821 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396643869] [2019-11-26 02:44:55,822 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:44:55,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:44:55,903 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:44:55,904 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396643869] [2019-11-26 02:44:55,904 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:44:55,904 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 02:44:55,904 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907834809] [2019-11-26 02:44:55,905 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:44:55,905 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:44:55,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:44:55,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:44:55,906 INFO L87 Difference]: Start difference. First operand 323 states and 548 transitions. Second operand 4 states. [2019-11-26 02:44:56,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:44:56,586 INFO L93 Difference]: Finished difference Result 1285 states and 2187 transitions. [2019-11-26 02:44:56,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:44:56,588 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 109 [2019-11-26 02:44:56,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:44:56,594 INFO L225 Difference]: With dead ends: 1285 [2019-11-26 02:44:56,594 INFO L226 Difference]: Without dead ends: 963 [2019-11-26 02:44:56,600 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:44:56,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 963 states. [2019-11-26 02:44:56,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 963 to 803. [2019-11-26 02:44:56,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 803 states. [2019-11-26 02:44:56,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 803 states to 803 states and 1249 transitions. [2019-11-26 02:44:56,673 INFO L78 Accepts]: Start accepts. Automaton has 803 states and 1249 transitions. Word has length 109 [2019-11-26 02:44:56,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:44:56,675 INFO L462 AbstractCegarLoop]: Abstraction has 803 states and 1249 transitions. [2019-11-26 02:44:56,676 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:44:56,676 INFO L276 IsEmpty]: Start isEmpty. Operand 803 states and 1249 transitions. [2019-11-26 02:44:56,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-11-26 02:44:56,687 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:44:56,687 INFO L410 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44:56,687 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:44:56,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:44:56,688 INFO L82 PathProgramCache]: Analyzing trace with hash -400978491, now seen corresponding path program 1 times [2019-11-26 02:44:56,688 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:44:56,688 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218749589] [2019-11-26 02:44:56,688 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:44:56,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:44:56,796 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-11-26 02:44:56,796 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218749589] [2019-11-26 02:44:56,797 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:44:56,797 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 02:44:56,797 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536012135] [2019-11-26 02:44:56,797 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:44:56,798 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:44:56,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:44:56,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:44:56,799 INFO L87 Difference]: Start difference. First operand 803 states and 1249 transitions. Second operand 4 states. [2019-11-26 02:44:57,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:44:57,498 INFO L93 Difference]: Finished difference Result 2885 states and 4419 transitions. [2019-11-26 02:44:57,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:44:57,499 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 125 [2019-11-26 02:44:57,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:44:57,510 INFO L225 Difference]: With dead ends: 2885 [2019-11-26 02:44:57,510 INFO L226 Difference]: Without dead ends: 2083 [2019-11-26 02:44:57,512 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:44:57,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2083 states. [2019-11-26 02:44:57,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2083 to 1283. [2019-11-26 02:44:57,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1283 states. [2019-11-26 02:44:57,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1283 states to 1283 states and 1858 transitions. [2019-11-26 02:44:57,552 INFO L78 Accepts]: Start accepts. Automaton has 1283 states and 1858 transitions. Word has length 125 [2019-11-26 02:44:57,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:44:57,553 INFO L462 AbstractCegarLoop]: Abstraction has 1283 states and 1858 transitions. [2019-11-26 02:44:57,553 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:44:57,553 INFO L276 IsEmpty]: Start isEmpty. Operand 1283 states and 1858 transitions. [2019-11-26 02:44:57,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-11-26 02:44:57,557 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:44:57,557 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:44:57,557 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:44:57,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:44:57,558 INFO L82 PathProgramCache]: Analyzing trace with hash -1423409937, now seen corresponding path program 1 times [2019-11-26 02:44:57,558 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:44:57,558 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621916357] [2019-11-26 02:44:57,558 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:44:57,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:44:57,615 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2019-11-26 02:44:57,616 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621916357] [2019-11-26 02:44:57,616 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:44:57,616 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 02:44:57,617 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128609888] [2019-11-26 02:44:57,617 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-26 02:44:57,617 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:44:57,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-26 02:44:57,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:44:57,618 INFO L87 Difference]: Start difference. First operand 1283 states and 1858 transitions. Second operand 3 states. [2019-11-26 02:44:58,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:44:58,059 INFO L93 Difference]: Finished difference Result 2805 states and 4060 transitions. [2019-11-26 02:44:58,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 02:44:58,060 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 133 [2019-11-26 02:44:58,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:44:58,067 INFO L225 Difference]: With dead ends: 2805 [2019-11-26 02:44:58,068 INFO L226 Difference]: Without dead ends: 1523 [2019-11-26 02:44:58,069 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:44:58,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1523 states. [2019-11-26 02:44:58,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1523 to 1363. [2019-11-26 02:44:58,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1363 states. [2019-11-26 02:44:58,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1363 states to 1363 states and 1908 transitions. [2019-11-26 02:44:58,107 INFO L78 Accepts]: Start accepts. Automaton has 1363 states and 1908 transitions. Word has length 133 [2019-11-26 02:44:58,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:44:58,108 INFO L462 AbstractCegarLoop]: Abstraction has 1363 states and 1908 transitions. [2019-11-26 02:44:58,108 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-26 02:44:58,108 INFO L276 IsEmpty]: Start isEmpty. Operand 1363 states and 1908 transitions. [2019-11-26 02:44:58,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-11-26 02:44:58,112 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:44:58,112 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:44:58,112 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:44:58,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:44:58,113 INFO L82 PathProgramCache]: Analyzing trace with hash 440377068, now seen corresponding path program 1 times [2019-11-26 02:44:58,113 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:44:58,113 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10379945] [2019-11-26 02:44:58,113 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:44:58,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:44:58,199 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2019-11-26 02:44:58,200 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10379945] [2019-11-26 02:44:58,201 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:44:58,201 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-26 02:44:58,201 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479334173] [2019-11-26 02:44:58,202 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:44:58,202 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:44:58,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:44:58,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:44:58,203 INFO L87 Difference]: Start difference. First operand 1363 states and 1908 transitions. Second operand 4 states. [2019-11-26 02:44:58,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:44:58,815 INFO L93 Difference]: Finished difference Result 3125 states and 4340 transitions. [2019-11-26 02:44:58,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:44:58,816 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 150 [2019-11-26 02:44:58,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:44:58,825 INFO L225 Difference]: With dead ends: 3125 [2019-11-26 02:44:58,825 INFO L226 Difference]: Without dead ends: 1523 [2019-11-26 02:44:58,827 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:44:58,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1523 states. [2019-11-26 02:44:58,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1523 to 1363. [2019-11-26 02:44:58,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1363 states. [2019-11-26 02:44:58,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1363 states to 1363 states and 1651 transitions. [2019-11-26 02:44:58,861 INFO L78 Accepts]: Start accepts. Automaton has 1363 states and 1651 transitions. Word has length 150 [2019-11-26 02:44:58,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:44:58,865 INFO L462 AbstractCegarLoop]: Abstraction has 1363 states and 1651 transitions. [2019-11-26 02:44:58,865 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:44:58,865 INFO L276 IsEmpty]: Start isEmpty. Operand 1363 states and 1651 transitions. [2019-11-26 02:44:58,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-11-26 02:44:58,869 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:44:58,870 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:44:58,870 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:44:58,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:44:58,870 INFO L82 PathProgramCache]: Analyzing trace with hash -118806558, now seen corresponding path program 1 times [2019-11-26 02:44:58,870 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:44:58,871 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072510524] [2019-11-26 02:44:58,874 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:44:58,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:44:58,952 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2019-11-26 02:44:58,953 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072510524] [2019-11-26 02:44:58,953 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:44:58,953 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 02:44:58,953 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777698275] [2019-11-26 02:44:58,954 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-26 02:44:58,954 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:44:58,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-26 02:44:58,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:44:58,955 INFO L87 Difference]: Start difference. First operand 1363 states and 1651 transitions. Second operand 3 states. [2019-11-26 02:44:59,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:44:59,272 INFO L93 Difference]: Finished difference Result 2965 states and 3565 transitions. [2019-11-26 02:44:59,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 02:44:59,272 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 154 [2019-11-26 02:44:59,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:44:59,280 INFO L225 Difference]: With dead ends: 2965 [2019-11-26 02:44:59,280 INFO L226 Difference]: Without dead ends: 1523 [2019-11-26 02:44:59,282 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:44:59,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1523 states. [2019-11-26 02:44:59,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1523 to 1523. [2019-11-26 02:44:59,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1523 states. [2019-11-26 02:44:59,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1523 states to 1523 states and 1734 transitions. [2019-11-26 02:44:59,321 INFO L78 Accepts]: Start accepts. Automaton has 1523 states and 1734 transitions. Word has length 154 [2019-11-26 02:44:59,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:44:59,323 INFO L462 AbstractCegarLoop]: Abstraction has 1523 states and 1734 transitions. [2019-11-26 02:44:59,323 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-26 02:44:59,324 INFO L276 IsEmpty]: Start isEmpty. Operand 1523 states and 1734 transitions. [2019-11-26 02:44:59,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-11-26 02:44:59,327 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:44:59,328 INFO L410 BasicCegarLoop]: trace histogram [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, 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] [2019-11-26 02:44:59,328 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:44:59,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:44:59,328 INFO L82 PathProgramCache]: Analyzing trace with hash -1933236694, now seen corresponding path program 1 times [2019-11-26 02:44:59,329 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:44:59,329 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527955597] [2019-11-26 02:44:59,329 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:44:59,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:44:59,506 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:44:59,506 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [527955597] [2019-11-26 02:44:59,506 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:44:59,506 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-26 02:44:59,506 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282669198] [2019-11-26 02:44:59,507 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:44:59,507 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:44:59,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:44:59,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:44:59,507 INFO L87 Difference]: Start difference. First operand 1523 states and 1734 transitions. Second operand 4 states. [2019-11-26 02:45:00,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:45:00,011 INFO L93 Difference]: Finished difference Result 3045 states and 3467 transitions. [2019-11-26 02:45:00,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:45:00,011 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 157 [2019-11-26 02:45:00,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:45:00,019 INFO L225 Difference]: With dead ends: 3045 [2019-11-26 02:45:00,019 INFO L226 Difference]: Without dead ends: 1523 [2019-11-26 02:45:00,021 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:45:00,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1523 states. [2019-11-26 02:45:00,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1523 to 1523. [2019-11-26 02:45:00,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1523 states. [2019-11-26 02:45:00,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1523 states to 1523 states and 1714 transitions. [2019-11-26 02:45:00,057 INFO L78 Accepts]: Start accepts. Automaton has 1523 states and 1714 transitions. Word has length 157 [2019-11-26 02:45:00,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:45:00,058 INFO L462 AbstractCegarLoop]: Abstraction has 1523 states and 1714 transitions. [2019-11-26 02:45:00,058 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:45:00,058 INFO L276 IsEmpty]: Start isEmpty. Operand 1523 states and 1714 transitions. [2019-11-26 02:45:00,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-11-26 02:45:00,062 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:45:00,062 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:45:00,062 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:45:00,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:45:00,063 INFO L82 PathProgramCache]: Analyzing trace with hash -1296448316, now seen corresponding path program 1 times [2019-11-26 02:45:00,063 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:45:00,063 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707117470] [2019-11-26 02:45:00,064 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:45:00,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:45:00,219 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 97 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-11-26 02:45:00,220 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707117470] [2019-11-26 02:45:00,220 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:45:00,221 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-26 02:45:00,224 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351942992] [2019-11-26 02:45:00,225 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:45:00,225 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:45:00,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:45:00,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:45:00,226 INFO L87 Difference]: Start difference. First operand 1523 states and 1714 transitions. Second operand 4 states. [2019-11-26 02:45:00,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:45:00,746 INFO L93 Difference]: Finished difference Result 3283 states and 3699 transitions. [2019-11-26 02:45:00,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:45:00,747 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 178 [2019-11-26 02:45:00,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:45:00,748 INFO L225 Difference]: With dead ends: 3283 [2019-11-26 02:45:00,748 INFO L226 Difference]: Without dead ends: 0 [2019-11-26 02:45:00,751 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:45:00,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-26 02:45:00,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-26 02:45:00,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-26 02:45:00,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-26 02:45:00,752 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 178 [2019-11-26 02:45:00,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:45:00,752 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-26 02:45:00,752 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:45:00,752 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-26 02:45:00,752 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-26 02:45:00,756 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-26 02:45:01,165 WARN L192 SmtUtils]: Spent 281.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 37 [2019-11-26 02:45:01,425 WARN L192 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 37 [2019-11-26 02:45:01,427 INFO L444 ceAbstractionStarter]: For program point L234(lines 234 413) no Hoare annotation was computed. [2019-11-26 02:45:01,428 INFO L444 ceAbstractionStarter]: For program point L169(lines 169 413) no Hoare annotation was computed. [2019-11-26 02:45:01,428 INFO L444 ceAbstractionStarter]: For program point L368(lines 368 413) no Hoare annotation was computed. [2019-11-26 02:45:01,428 INFO L444 ceAbstractionStarter]: For program point L38(lines 38 413) no Hoare annotation was computed. [2019-11-26 02:45:01,428 INFO L444 ceAbstractionStarter]: For program point L237(lines 237 413) no Hoare annotation was computed. [2019-11-26 02:45:01,428 INFO L444 ceAbstractionStarter]: For program point L106(lines 106 413) no Hoare annotation was computed. [2019-11-26 02:45:01,428 INFO L444 ceAbstractionStarter]: For program point L42(lines 42 413) no Hoare annotation was computed. [2019-11-26 02:45:01,428 INFO L444 ceAbstractionStarter]: For program point L175(lines 175 413) no Hoare annotation was computed. [2019-11-26 02:45:01,428 INFO L444 ceAbstractionStarter]: For program point L375(lines 375 413) no Hoare annotation was computed. [2019-11-26 02:45:01,428 INFO L444 ceAbstractionStarter]: For program point L309(lines 309 413) no Hoare annotation was computed. [2019-11-26 02:45:01,429 INFO L444 ceAbstractionStarter]: For program point L179(lines 179 413) no Hoare annotation was computed. [2019-11-26 02:45:01,429 INFO L444 ceAbstractionStarter]: For program point L113(lines 113 413) no Hoare annotation was computed. [2019-11-26 02:45:01,429 INFO L444 ceAbstractionStarter]: For program point L47(lines 47 413) no Hoare annotation was computed. [2019-11-26 02:45:01,429 INFO L444 ceAbstractionStarter]: For program point L378(lines 378 413) no Hoare annotation was computed. [2019-11-26 02:45:01,429 INFO L444 ceAbstractionStarter]: For program point L380(lines 380 413) no Hoare annotation was computed. [2019-11-26 02:45:01,429 INFO L444 ceAbstractionStarter]: For program point L314(lines 314 413) no Hoare annotation was computed. [2019-11-26 02:45:01,429 INFO L444 ceAbstractionStarter]: For program point L248(lines 248 413) no Hoare annotation was computed. [2019-11-26 02:45:01,429 INFO L444 ceAbstractionStarter]: For program point L50(lines 50 413) no Hoare annotation was computed. [2019-11-26 02:45:01,429 INFO L444 ceAbstractionStarter]: For program point L185(lines 185 413) no Hoare annotation was computed. [2019-11-26 02:45:01,429 INFO L444 ceAbstractionStarter]: For program point L119(lines 119 413) no Hoare annotation was computed. [2019-11-26 02:45:01,430 INFO L444 ceAbstractionStarter]: For program point L582-1(lines 29 598) no Hoare annotation was computed. [2019-11-26 02:45:01,430 INFO L444 ceAbstractionStarter]: For program point L54(lines 54 413) no Hoare annotation was computed. [2019-11-26 02:45:01,430 INFO L444 ceAbstractionStarter]: For program point L253(lines 253 413) no Hoare annotation was computed. [2019-11-26 02:45:01,430 INFO L444 ceAbstractionStarter]: For program point L187(lines 187 413) no Hoare annotation was computed. [2019-11-26 02:45:01,430 INFO L444 ceAbstractionStarter]: For program point L585-1(lines 29 598) no Hoare annotation was computed. [2019-11-26 02:45:01,430 INFO L444 ceAbstractionStarter]: For program point L189(lines 189 413) no Hoare annotation was computed. [2019-11-26 02:45:01,430 INFO L444 ceAbstractionStarter]: For program point L123(lines 123 413) no Hoare annotation was computed. [2019-11-26 02:45:01,430 INFO L444 ceAbstractionStarter]: For program point L586(line 586) no Hoare annotation was computed. [2019-11-26 02:45:01,430 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-26 02:45:01,431 INFO L444 ceAbstractionStarter]: For program point L389(lines 389 413) no Hoare annotation was computed. [2019-11-26 02:45:01,431 INFO L444 ceAbstractionStarter]: For program point L191(lines 191 413) no Hoare annotation was computed. [2019-11-26 02:45:01,431 INFO L444 ceAbstractionStarter]: For program point L59(lines 59 413) no Hoare annotation was computed. [2019-11-26 02:45:01,431 INFO L444 ceAbstractionStarter]: For program point L259(lines 259 413) no Hoare annotation was computed. [2019-11-26 02:45:01,431 INFO L444 ceAbstractionStarter]: For program point L194(lines 194 413) no Hoare annotation was computed. [2019-11-26 02:45:01,431 INFO L444 ceAbstractionStarter]: For program point L261(lines 261 413) no Hoare annotation was computed. [2019-11-26 02:45:01,431 INFO L444 ceAbstractionStarter]: For program point L394(lines 394 413) no Hoare annotation was computed. [2019-11-26 02:45:01,431 INFO L444 ceAbstractionStarter]: For program point L328(lines 328 413) no Hoare annotation was computed. [2019-11-26 02:45:01,431 INFO L444 ceAbstractionStarter]: For program point L130(lines 130 413) no Hoare annotation was computed. [2019-11-26 02:45:01,431 INFO L444 ceAbstractionStarter]: For program point L65(lines 65 413) no Hoare annotation was computed. [2019-11-26 02:45:01,432 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 586) no Hoare annotation was computed. [2019-11-26 02:45:01,432 INFO L444 ceAbstractionStarter]: For program point L198(lines 198 413) no Hoare annotation was computed. [2019-11-26 02:45:01,432 INFO L444 ceAbstractionStarter]: For program point L331(lines 331 413) no Hoare annotation was computed. [2019-11-26 02:45:01,432 INFO L444 ceAbstractionStarter]: For program point L398(lines 398 413) no Hoare annotation was computed. [2019-11-26 02:45:01,432 INFO L444 ceAbstractionStarter]: For program point L134(lines 134 413) no Hoare annotation was computed. [2019-11-26 02:45:01,433 INFO L440 ceAbstractionStarter]: At program point L597(lines 29 598) the Hoare annotation is: (let ((.cse1 (= ~a25~0 1))) (let ((.cse3 (not .cse1)) (.cse4 (not (= ~a11~0 1))) (.cse0 (not (= ~a28~0 8))) (.cse5 (= ~a19~0 1)) (.cse2 (not (= ~a28~0 11)))) (or (and (= ~a17~0 7) .cse0 .cse1 .cse2) (and .cse3 .cse4) (and (<= 10 ~a28~0) .cse3) (and (= ~a28~0 10) .cse4) (and .cse5 .cse4) (and .cse0 .cse5 .cse2) (and (<= ~a11~0 0) (not (= ~a28~0 9)) .cse2) (= ~a28~0 7) (and .cse5 .cse1 .cse2)))) [2019-11-26 02:45:01,433 INFO L444 ceAbstractionStarter]: For program point L69(lines 69 413) no Hoare annotation was computed. [2019-11-26 02:45:01,433 INFO L444 ceAbstractionStarter]: For program point L202(lines 202 413) no Hoare annotation was computed. [2019-11-26 02:45:01,433 INFO L447 ceAbstractionStarter]: At program point L600(lines 600 617) the Hoare annotation is: true [2019-11-26 02:45:01,433 INFO L444 ceAbstractionStarter]: For program point L402(lines 402 413) no Hoare annotation was computed. [2019-11-26 02:45:01,433 INFO L444 ceAbstractionStarter]: For program point L337(lines 337 413) no Hoare annotation was computed. [2019-11-26 02:45:01,433 INFO L444 ceAbstractionStarter]: For program point L139(lines 139 413) no Hoare annotation was computed. [2019-11-26 02:45:01,433 INFO L444 ceAbstractionStarter]: For program point L404(lines 404 413) no Hoare annotation was computed. [2019-11-26 02:45:01,433 INFO L444 ceAbstractionStarter]: For program point L74(lines 74 413) no Hoare annotation was computed. [2019-11-26 02:45:01,433 INFO L444 ceAbstractionStarter]: For program point L407(lines 407 413) no Hoare annotation was computed. [2019-11-26 02:45:01,434 INFO L444 ceAbstractionStarter]: For program point L143(lines 143 413) no Hoare annotation was computed. [2019-11-26 02:45:01,434 INFO L440 ceAbstractionStarter]: At program point L606-2(lines 606 616) the Hoare annotation is: (let ((.cse1 (= ~a25~0 1))) (let ((.cse3 (not .cse1)) (.cse4 (not (= ~a11~0 1))) (.cse0 (not (= ~a28~0 8))) (.cse5 (= ~a19~0 1)) (.cse2 (not (= ~a28~0 11)))) (or (and (= ~a17~0 7) .cse0 .cse1 .cse2) (and .cse3 .cse4) (and (<= 10 ~a28~0) .cse3) (and (= ~a28~0 10) .cse4) (and .cse5 .cse4) (and .cse0 .cse5 .cse2) (and (<= ~a11~0 0) (not (= ~a28~0 9)) .cse2) (= ~a28~0 7) (and .cse5 .cse1 .cse2)))) [2019-11-26 02:45:01,434 INFO L444 ceAbstractionStarter]: For program point L276(lines 276 413) no Hoare annotation was computed. [2019-11-26 02:45:01,434 INFO L444 ceAbstractionStarter]: For program point L409(lines 409 413) no Hoare annotation was computed. [2019-11-26 02:45:01,439 INFO L444 ceAbstractionStarter]: For program point L212(lines 212 413) no Hoare annotation was computed. [2019-11-26 02:45:01,439 INFO L444 ceAbstractionStarter]: For program point L280(lines 280 413) no Hoare annotation was computed. [2019-11-26 02:45:01,440 INFO L444 ceAbstractionStarter]: For program point L148(lines 148 413) no Hoare annotation was computed. [2019-11-26 02:45:01,440 INFO L444 ceAbstractionStarter]: For program point L82(lines 82 413) no Hoare annotation was computed. [2019-11-26 02:45:01,440 INFO L444 ceAbstractionStarter]: For program point L611(line 611) no Hoare annotation was computed. [2019-11-26 02:45:01,440 INFO L444 ceAbstractionStarter]: For program point L215(lines 215 413) no Hoare annotation was computed. [2019-11-26 02:45:01,440 INFO L444 ceAbstractionStarter]: For program point L349(lines 349 413) no Hoare annotation was computed. [2019-11-26 02:45:01,440 INFO L444 ceAbstractionStarter]: For program point L283(lines 283 413) no Hoare annotation was computed. [2019-11-26 02:45:01,440 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-26 02:45:01,441 INFO L444 ceAbstractionStarter]: For program point L218(lines 218 413) no Hoare annotation was computed. [2019-11-26 02:45:01,441 INFO L444 ceAbstractionStarter]: For program point L286(lines 286 413) no Hoare annotation was computed. [2019-11-26 02:45:01,441 INFO L444 ceAbstractionStarter]: For program point L154(lines 154 413) no Hoare annotation was computed. [2019-11-26 02:45:01,441 INFO L444 ceAbstractionStarter]: For program point L354(lines 354 413) no Hoare annotation was computed. [2019-11-26 02:45:01,441 INFO L444 ceAbstractionStarter]: For program point L223(lines 223 413) no Hoare annotation was computed. [2019-11-26 02:45:01,441 INFO L444 ceAbstractionStarter]: For program point L91(lines 91 413) no Hoare annotation was computed. [2019-11-26 02:45:01,442 INFO L444 ceAbstractionStarter]: For program point L291(lines 291 413) no Hoare annotation was computed. [2019-11-26 02:45:01,442 INFO L444 ceAbstractionStarter]: For program point L225(lines 225 413) no Hoare annotation was computed. [2019-11-26 02:45:01,442 INFO L444 ceAbstractionStarter]: For program point L159(lines 159 413) no Hoare annotation was computed. [2019-11-26 02:45:01,442 INFO L444 ceAbstractionStarter]: For program point L293(lines 293 413) no Hoare annotation was computed. [2019-11-26 02:45:01,442 INFO L444 ceAbstractionStarter]: For program point L95(lines 95 413) no Hoare annotation was computed. [2019-11-26 02:45:01,442 INFO L444 ceAbstractionStarter]: For program point L30(lines 30 413) no Hoare annotation was computed. [2019-11-26 02:45:01,442 INFO L444 ceAbstractionStarter]: For program point L361(lines 361 413) no Hoare annotation was computed. [2019-11-26 02:45:01,443 INFO L444 ceAbstractionStarter]: For program point L297(lines 297 413) no Hoare annotation was computed. [2019-11-26 02:45:01,443 INFO L444 ceAbstractionStarter]: For program point L165(lines 165 413) no Hoare annotation was computed. [2019-11-26 02:45:01,443 INFO L444 ceAbstractionStarter]: For program point L99(lines 99 413) no Hoare annotation was computed. [2019-11-26 02:45:01,443 INFO L444 ceAbstractionStarter]: For program point L232(lines 232 413) no Hoare annotation was computed. [2019-11-26 02:45:01,443 INFO L444 ceAbstractionStarter]: For program point L35(lines 35 413) no Hoare annotation was computed. [2019-11-26 02:45:01,476 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.11 02:45:01 BoogieIcfgContainer [2019-11-26 02:45:01,476 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-26 02:45:01,477 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-26 02:45:01,477 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-26 02:45:01,477 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-26 02:45:01,478 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 02:44:53" (3/4) ... [2019-11-26 02:45:01,481 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-26 02:45:01,510 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 110 nodes and edges [2019-11-26 02:45:01,512 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2019-11-26 02:45:01,513 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2019-11-26 02:45:01,515 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-11-26 02:45:01,682 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_dc426aaf-4cd1-4066-b8bb-6bda8865c6ec/bin/utaipan/witness.graphml [2019-11-26 02:45:01,682 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-26 02:45:01,683 INFO L168 Benchmark]: Toolchain (without parser) took 10970.34 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 263.7 MB). Free memory was 939.3 MB in the beginning and 861.9 MB in the end (delta: 77.5 MB). Peak memory consumption was 341.2 MB. Max. memory is 11.5 GB. [2019-11-26 02:45:01,684 INFO L168 Benchmark]: CDTParser took 0.26 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:45:01,684 INFO L168 Benchmark]: CACSL2BoogieTranslator took 673.34 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.4 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -169.7 MB). Peak memory consumption was 23.9 MB. Max. memory is 11.5 GB. [2019-11-26 02:45:01,684 INFO L168 Benchmark]: Boogie Procedure Inliner took 95.19 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:45:01,685 INFO L168 Benchmark]: Boogie Preprocessor took 62.20 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:45:01,685 INFO L168 Benchmark]: RCFGBuilder took 2318.38 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 876.9 MB in the end (delta: 221.5 MB). Peak memory consumption was 221.5 MB. Max. memory is 11.5 GB. [2019-11-26 02:45:01,686 INFO L168 Benchmark]: TraceAbstraction took 7610.85 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 126.4 MB). Free memory was 876.9 MB in the beginning and 881.0 MB in the end (delta: -4.2 MB). Peak memory consumption was 122.2 MB. Max. memory is 11.5 GB. [2019-11-26 02:45:01,686 INFO L168 Benchmark]: Witness Printer took 205.22 ms. Allocated memory is still 1.3 GB. Free memory was 881.0 MB in the beginning and 861.9 MB in the end (delta: 19.2 MB). Peak memory consumption was 19.2 MB. Max. memory is 11.5 GB. [2019-11-26 02:45:01,688 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.26 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 673.34 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.4 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -169.7 MB). Peak memory consumption was 23.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 95.19 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 62.20 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 2318.38 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 876.9 MB in the end (delta: 221.5 MB). Peak memory consumption was 221.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 7610.85 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 126.4 MB). Free memory was 876.9 MB in the beginning and 881.0 MB in the end (delta: -4.2 MB). Peak memory consumption was 122.2 MB. Max. memory is 11.5 GB. * Witness Printer took 205.22 ms. Allocated memory is still 1.3 GB. Free memory was 881.0 MB in the beginning and 861.9 MB in the end (delta: 19.2 MB). Peak memory consumption was 19.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 586]: 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: 600]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 606]: Loop Invariant Derived loop invariant: ((((((((((a17 == 7 && !(a28 == 8)) && a25 == 1) && !(a28 == 11)) || (!(a25 == 1) && !(a11 == 1))) || (10 <= a28 && !(a25 == 1))) || (a28 == 10 && !(a11 == 1))) || (a19 == 1 && !(a11 == 1))) || ((!(a28 == 8) && a19 == 1) && !(a28 == 11))) || ((a11 <= 0 && !(a28 == 9)) && !(a28 == 11))) || a28 == 7) || ((a19 == 1 && a25 == 1) && !(a28 == 11)) - InvariantResult [Line: 29]: Loop Invariant Derived loop invariant: ((((((((((a17 == 7 && !(a28 == 8)) && a25 == 1) && !(a28 == 11)) || (!(a25 == 1) && !(a11 == 1))) || (10 <= a28 && !(a25 == 1))) || (a28 == 10 && !(a11 == 1))) || (a19 == 1 && !(a11 == 1))) || ((!(a28 == 8) && a19 == 1) && !(a28 == 11))) || ((a11 <= 0 && !(a28 == 9)) && !(a28 == 11))) || a28 == 7) || ((a19 == 1 && a25 == 1) && !(a28 == 11)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 85 locations, 1 error locations. Result: SAFE, OverallTime: 7.4s, OverallIterations: 9, TraceHistogramMax: 5, AutomataDifference: 5.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.6s, HoareTripleCheckerStatistics: 694 SDtfs, 1037 SDslu, 110 SDs, 0 SdLazy, 3251 SolverSat, 739 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 33 GetRequests, 14 SyntacticMatches, 4 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1523occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 9 MinimizatonAttempts, 1440 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 57 NumberOfFragments, 175 HoareAnnotationTreeSize, 3 FomulaSimplifications, 1680 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 3 FomulaSimplificationsInter, 860 FormulaSimplificationTreeSizeReductionInter, 0.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 1184 NumberOfCodeBlocks, 1184 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 1175 ConstructedInterpolants, 0 QuantifiedInterpolants, 327698 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 692/692 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...