./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem01_label40.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_bfd4705e-b258-49c1-a8b7-83273e6f36d5/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_bfd4705e-b258-49c1-a8b7-83273e6f36d5/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_bfd4705e-b258-49c1-a8b7-83273e6f36d5/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_bfd4705e-b258-49c1-a8b7-83273e6f36d5/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem01_label40.c -s /tmp/vcloud-vcloud-master/worker/run_dir_bfd4705e-b258-49c1-a8b7-83273e6f36d5/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_bfd4705e-b258-49c1-a8b7-83273e6f36d5/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 d2268b9dd6959c9e4f82beab56974646f066475d ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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:31:34,659 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-26 02:31:34,662 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-26 02:31:34,676 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-26 02:31:34,676 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-26 02:31:34,678 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-26 02:31:34,680 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-26 02:31:34,688 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-26 02:31:34,693 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-26 02:31:34,696 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-26 02:31:34,697 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-26 02:31:34,698 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-26 02:31:34,699 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-26 02:31:34,701 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-26 02:31:34,702 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-26 02:31:34,703 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-26 02:31:34,704 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-26 02:31:34,705 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-26 02:31:34,707 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-26 02:31:34,711 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-26 02:31:34,714 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-26 02:31:34,717 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-26 02:31:34,718 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-26 02:31:34,719 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-26 02:31:34,723 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-26 02:31:34,723 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-26 02:31:34,724 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-26 02:31:34,725 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-26 02:31:34,725 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-26 02:31:34,726 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-26 02:31:34,726 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-26 02:31:34,727 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-26 02:31:34,728 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-26 02:31:34,729 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-26 02:31:34,729 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-26 02:31:34,730 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-26 02:31:34,730 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-26 02:31:34,730 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-26 02:31:34,731 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-26 02:31:34,731 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-26 02:31:34,733 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-26 02:31:34,733 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_bfd4705e-b258-49c1-a8b7-83273e6f36d5/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-11-26 02:31:34,758 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-26 02:31:34,768 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-26 02:31:34,768 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-26 02:31:34,769 INFO L138 SettingsManager]: * User list type=DISABLED [2019-11-26 02:31:34,769 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-11-26 02:31:34,769 INFO L138 SettingsManager]: * Explicit value domain=true [2019-11-26 02:31:34,769 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-11-26 02:31:34,769 INFO L138 SettingsManager]: * Octagon Domain=false [2019-11-26 02:31:34,769 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-11-26 02:31:34,769 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-11-26 02:31:34,769 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-11-26 02:31:34,770 INFO L138 SettingsManager]: * Interval Domain=false [2019-11-26 02:31:34,770 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-11-26 02:31:34,770 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-11-26 02:31:34,770 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-11-26 02:31:34,770 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-26 02:31:34,770 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-26 02:31:34,771 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-26 02:31:34,771 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-26 02:31:34,771 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-26 02:31:34,771 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-26 02:31:34,771 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-26 02:31:34,771 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-26 02:31:34,771 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-26 02:31:34,771 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-26 02:31:34,772 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-26 02:31:34,772 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-26 02:31:34,772 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-26 02:31:34,772 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-26 02:31:34,772 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-26 02:31:34,773 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-26 02:31:34,773 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-26 02:31:34,773 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-26 02:31:34,773 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-11-26 02:31:34,773 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-26 02:31:34,773 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-26 02:31:34,774 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-26 02:31:34,774 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_bfd4705e-b258-49c1-a8b7-83273e6f36d5/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 -> d2268b9dd6959c9e4f82beab56974646f066475d [2019-11-26 02:31:34,907 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-26 02:31:34,917 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-26 02:31:34,920 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-26 02:31:34,921 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-26 02:31:34,922 INFO L275 PluginConnector]: CDTParser initialized [2019-11-26 02:31:34,922 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_bfd4705e-b258-49c1-a8b7-83273e6f36d5/bin/utaipan/../../sv-benchmarks/c/eca-rers2012/Problem01_label40.c [2019-11-26 02:31:34,984 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_bfd4705e-b258-49c1-a8b7-83273e6f36d5/bin/utaipan/data/18ae1e861/e853989b49d24c4cb4fb62365f113bfd/FLAGa76ab2d37 [2019-11-26 02:31:35,483 INFO L306 CDTParser]: Found 1 translation units. [2019-11-26 02:31:35,483 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_bfd4705e-b258-49c1-a8b7-83273e6f36d5/sv-benchmarks/c/eca-rers2012/Problem01_label40.c [2019-11-26 02:31:35,495 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_bfd4705e-b258-49c1-a8b7-83273e6f36d5/bin/utaipan/data/18ae1e861/e853989b49d24c4cb4fb62365f113bfd/FLAGa76ab2d37 [2019-11-26 02:31:35,992 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_bfd4705e-b258-49c1-a8b7-83273e6f36d5/bin/utaipan/data/18ae1e861/e853989b49d24c4cb4fb62365f113bfd [2019-11-26 02:31:35,995 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-26 02:31:35,996 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-26 02:31:35,997 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-26 02:31:35,997 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-26 02:31:36,000 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-26 02:31:36,001 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 02:31:35" (1/1) ... [2019-11-26 02:31:36,003 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c72a30b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:31:36, skipping insertion in model container [2019-11-26 02:31:36,003 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 02:31:35" (1/1) ... [2019-11-26 02:31:36,010 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-26 02:31:36,047 INFO L179 MainTranslator]: Built tables and reachable declarations [2019-11-26 02:31:36,474 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-26 02:31:36,478 INFO L201 MainTranslator]: Completed pre-run [2019-11-26 02:31:36,620 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-26 02:31:36,648 INFO L205 MainTranslator]: Completed translation [2019-11-26 02:31:36,648 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:31:36 WrapperNode [2019-11-26 02:31:36,649 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-26 02:31:36,649 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-26 02:31:36,650 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-26 02:31:36,650 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-26 02:31:36,658 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:31:36" (1/1) ... [2019-11-26 02:31:36,677 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:31:36" (1/1) ... [2019-11-26 02:31:36,726 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-26 02:31:36,726 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-26 02:31:36,726 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-26 02:31:36,727 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-26 02:31:36,735 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:31:36" (1/1) ... [2019-11-26 02:31:36,736 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:31:36" (1/1) ... [2019-11-26 02:31:36,740 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:31:36" (1/1) ... [2019-11-26 02:31:36,740 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:31:36" (1/1) ... [2019-11-26 02:31:36,760 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:31:36" (1/1) ... [2019-11-26 02:31:36,769 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:31:36" (1/1) ... [2019-11-26 02:31:36,792 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:31:36" (1/1) ... [2019-11-26 02:31:36,798 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-26 02:31:36,799 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-26 02:31:36,799 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-26 02:31:36,799 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-26 02:31:36,800 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:31:36" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_bfd4705e-b258-49c1-a8b7-83273e6f36d5/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:31:36,858 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-26 02:31:36,858 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-26 02:31:38,731 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-26 02:31:38,731 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-26 02:31:38,732 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 02:31:38 BoogieIcfgContainer [2019-11-26 02:31:38,733 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-26 02:31:38,734 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-26 02:31:38,734 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-26 02:31:38,736 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-26 02:31:38,737 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.11 02:31:35" (1/3) ... [2019-11-26 02:31:38,737 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a7b0791 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 02:31:38, skipping insertion in model container [2019-11-26 02:31:38,738 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:31:36" (2/3) ... [2019-11-26 02:31:38,738 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a7b0791 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 02:31:38, skipping insertion in model container [2019-11-26 02:31:38,738 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 02:31:38" (3/3) ... [2019-11-26 02:31:38,740 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem01_label40.c [2019-11-26 02:31:38,749 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-26 02:31:38,755 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-26 02:31:38,762 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-26 02:31:38,784 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-26 02:31:38,784 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-26 02:31:38,784 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-26 02:31:38,784 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-26 02:31:38,785 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-26 02:31:38,785 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-26 02:31:38,785 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-26 02:31:38,785 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-26 02:31:38,802 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states. [2019-11-26 02:31:38,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-11-26 02:31:38,810 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:31:38,811 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:31:38,811 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:31:38,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:31:38,817 INFO L82 PathProgramCache]: Analyzing trace with hash -1323245855, now seen corresponding path program 1 times [2019-11-26 02:31:38,824 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:31:38,825 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234325532] [2019-11-26 02:31:38,825 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:31:38,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:31:39,206 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:31:39,207 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234325532] [2019-11-26 02:31:39,207 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:31:39,208 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 02:31:39,209 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837812137] [2019-11-26 02:31:39,214 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:31:39,214 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:31:39,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:31:39,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:31:39,229 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 4 states. [2019-11-26 02:31:39,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:31:39,945 INFO L93 Difference]: Finished difference Result 297 states and 569 transitions. [2019-11-26 02:31:39,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:31:39,948 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 71 [2019-11-26 02:31:39,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:31:39,966 INFO L225 Difference]: With dead ends: 297 [2019-11-26 02:31:39,966 INFO L226 Difference]: Without dead ends: 216 [2019-11-26 02:31:39,970 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:31:39,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2019-11-26 02:31:40,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 145. [2019-11-26 02:31:40,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2019-11-26 02:31:40,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 259 transitions. [2019-11-26 02:31:40,026 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 259 transitions. Word has length 71 [2019-11-26 02:31:40,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:31:40,027 INFO L462 AbstractCegarLoop]: Abstraction has 145 states and 259 transitions. [2019-11-26 02:31:40,027 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:31:40,028 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 259 transitions. [2019-11-26 02:31:40,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-11-26 02:31:40,031 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:31:40,031 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:31:40,032 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:31:40,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:31:40,032 INFO L82 PathProgramCache]: Analyzing trace with hash -1048398476, now seen corresponding path program 1 times [2019-11-26 02:31:40,032 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:31:40,033 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188715609] [2019-11-26 02:31:40,033 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:31:40,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:31:40,099 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:31:40,099 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188715609] [2019-11-26 02:31:40,100 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:31:40,100 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 02:31:40,101 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315632197] [2019-11-26 02:31:40,103 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:31:40,103 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:31:40,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:31:40,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:31:40,104 INFO L87 Difference]: Start difference. First operand 145 states and 259 transitions. Second operand 4 states. [2019-11-26 02:31:40,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:31:40,761 INFO L93 Difference]: Finished difference Result 573 states and 1031 transitions. [2019-11-26 02:31:40,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:31:40,761 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 77 [2019-11-26 02:31:40,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:31:40,765 INFO L225 Difference]: With dead ends: 573 [2019-11-26 02:31:40,765 INFO L226 Difference]: Without dead ends: 429 [2019-11-26 02:31:40,767 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:31:40,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2019-11-26 02:31:40,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 429. [2019-11-26 02:31:40,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 429 states. [2019-11-26 02:31:40,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 705 transitions. [2019-11-26 02:31:40,801 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 705 transitions. Word has length 77 [2019-11-26 02:31:40,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:31:40,801 INFO L462 AbstractCegarLoop]: Abstraction has 429 states and 705 transitions. [2019-11-26 02:31:40,801 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:31:40,801 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 705 transitions. [2019-11-26 02:31:40,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-11-26 02:31:40,808 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:31:40,808 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:31:40,808 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:31:40,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:31:40,809 INFO L82 PathProgramCache]: Analyzing trace with hash 928579171, now seen corresponding path program 1 times [2019-11-26 02:31:40,809 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:31:40,809 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442889748] [2019-11-26 02:31:40,810 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:31:40,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:31:40,866 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-26 02:31:40,866 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442889748] [2019-11-26 02:31:40,866 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:31:40,867 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-26 02:31:40,867 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610374410] [2019-11-26 02:31:40,867 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-26 02:31:40,868 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:31:40,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-26 02:31:40,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:31:40,869 INFO L87 Difference]: Start difference. First operand 429 states and 705 transitions. Second operand 3 states. [2019-11-26 02:31:41,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:31:41,249 INFO L93 Difference]: Finished difference Result 999 states and 1678 transitions. [2019-11-26 02:31:41,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 02:31:41,250 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 97 [2019-11-26 02:31:41,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:31:41,253 INFO L225 Difference]: With dead ends: 999 [2019-11-26 02:31:41,253 INFO L226 Difference]: Without dead ends: 571 [2019-11-26 02:31:41,256 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:31:41,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2019-11-26 02:31:41,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 500. [2019-11-26 02:31:41,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 500 states. [2019-11-26 02:31:41,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 825 transitions. [2019-11-26 02:31:41,300 INFO L78 Accepts]: Start accepts. Automaton has 500 states and 825 transitions. Word has length 97 [2019-11-26 02:31:41,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:31:41,301 INFO L462 AbstractCegarLoop]: Abstraction has 500 states and 825 transitions. [2019-11-26 02:31:41,301 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-26 02:31:41,301 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 825 transitions. [2019-11-26 02:31:41,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-11-26 02:31:41,315 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:31:41,315 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:31:41,316 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:31:41,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:31:41,316 INFO L82 PathProgramCache]: Analyzing trace with hash -1330805114, now seen corresponding path program 1 times [2019-11-26 02:31:41,317 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:31:41,317 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371622506] [2019-11-26 02:31:41,317 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:31:41,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:31:41,405 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2019-11-26 02:31:41,406 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371622506] [2019-11-26 02:31:41,406 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:31:41,406 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-26 02:31:41,406 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567932218] [2019-11-26 02:31:41,407 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-26 02:31:41,407 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:31:41,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-26 02:31:41,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:31:41,408 INFO L87 Difference]: Start difference. First operand 500 states and 825 transitions. Second operand 3 states. [2019-11-26 02:31:41,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:31:41,757 INFO L93 Difference]: Finished difference Result 1212 states and 1976 transitions. [2019-11-26 02:31:41,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 02:31:41,758 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 133 [2019-11-26 02:31:41,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:31:41,762 INFO L225 Difference]: With dead ends: 1212 [2019-11-26 02:31:41,762 INFO L226 Difference]: Without dead ends: 713 [2019-11-26 02:31:41,763 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:31:41,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 713 states. [2019-11-26 02:31:41,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 713 to 642. [2019-11-26 02:31:41,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 642 states. [2019-11-26 02:31:41,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 967 transitions. [2019-11-26 02:31:41,786 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 967 transitions. Word has length 133 [2019-11-26 02:31:41,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:31:41,786 INFO L462 AbstractCegarLoop]: Abstraction has 642 states and 967 transitions. [2019-11-26 02:31:41,786 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-26 02:31:41,786 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 967 transitions. [2019-11-26 02:31:41,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-11-26 02:31:41,789 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:31:41,789 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:31:41,789 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:31:41,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:31:41,790 INFO L82 PathProgramCache]: Analyzing trace with hash -211735786, now seen corresponding path program 1 times [2019-11-26 02:31:41,790 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:31:41,790 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532381703] [2019-11-26 02:31:41,791 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:31:41,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:31:41,856 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 86 proven. 0 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2019-11-26 02:31:41,857 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532381703] [2019-11-26 02:31:41,857 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:31:41,857 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-26 02:31:41,857 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479037991] [2019-11-26 02:31:41,858 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-26 02:31:41,858 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:31:41,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-26 02:31:41,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:31:41,859 INFO L87 Difference]: Start difference. First operand 642 states and 967 transitions. Second operand 3 states. [2019-11-26 02:31:42,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:31:42,212 INFO L93 Difference]: Finished difference Result 1709 states and 2563 transitions. [2019-11-26 02:31:42,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 02:31:42,213 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 152 [2019-11-26 02:31:42,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:31:42,219 INFO L225 Difference]: With dead ends: 1709 [2019-11-26 02:31:42,219 INFO L226 Difference]: Without dead ends: 1068 [2019-11-26 02:31:42,220 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:31:42,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1068 states. [2019-11-26 02:31:42,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1068 to 855. [2019-11-26 02:31:42,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 855 states. [2019-11-26 02:31:42,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 855 states to 855 states and 1269 transitions. [2019-11-26 02:31:42,254 INFO L78 Accepts]: Start accepts. Automaton has 855 states and 1269 transitions. Word has length 152 [2019-11-26 02:31:42,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:31:42,254 INFO L462 AbstractCegarLoop]: Abstraction has 855 states and 1269 transitions. [2019-11-26 02:31:42,254 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-26 02:31:42,254 INFO L276 IsEmpty]: Start isEmpty. Operand 855 states and 1269 transitions. [2019-11-26 02:31:42,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-11-26 02:31:42,257 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:31:42,258 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:31:42,258 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:31:42,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:31:42,258 INFO L82 PathProgramCache]: Analyzing trace with hash 1004824413, now seen corresponding path program 1 times [2019-11-26 02:31:42,259 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:31:42,259 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055406587] [2019-11-26 02:31:42,259 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:31:42,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:31:42,339 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2019-11-26 02:31:42,339 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055406587] [2019-11-26 02:31:42,339 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:31:42,340 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-26 02:31:42,340 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711979281] [2019-11-26 02:31:42,340 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-26 02:31:42,341 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:31:42,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-26 02:31:42,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:31:42,341 INFO L87 Difference]: Start difference. First operand 855 states and 1269 transitions. Second operand 3 states. [2019-11-26 02:31:42,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:31:42,746 INFO L93 Difference]: Finished difference Result 1851 states and 2733 transitions. [2019-11-26 02:31:42,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 02:31:42,747 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 155 [2019-11-26 02:31:42,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:31:42,752 INFO L225 Difference]: With dead ends: 1851 [2019-11-26 02:31:42,752 INFO L226 Difference]: Without dead ends: 997 [2019-11-26 02:31:42,753 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:31:42,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 997 states. [2019-11-26 02:31:42,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 997 to 997. [2019-11-26 02:31:42,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 997 states. [2019-11-26 02:31:42,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 997 states to 997 states and 1429 transitions. [2019-11-26 02:31:42,779 INFO L78 Accepts]: Start accepts. Automaton has 997 states and 1429 transitions. Word has length 155 [2019-11-26 02:31:42,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:31:42,780 INFO L462 AbstractCegarLoop]: Abstraction has 997 states and 1429 transitions. [2019-11-26 02:31:42,780 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-26 02:31:42,780 INFO L276 IsEmpty]: Start isEmpty. Operand 997 states and 1429 transitions. [2019-11-26 02:31:42,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-11-26 02:31:42,783 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:31:42,783 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:31:42,784 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:31:42,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:31:42,784 INFO L82 PathProgramCache]: Analyzing trace with hash -1683955307, now seen corresponding path program 1 times [2019-11-26 02:31:42,784 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:31:42,785 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820614541] [2019-11-26 02:31:42,785 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:31:42,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:31:42,994 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2019-11-26 02:31:42,994 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820614541] [2019-11-26 02:31:42,994 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:31:42,994 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-26 02:31:42,995 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38877141] [2019-11-26 02:31:42,995 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-26 02:31:42,995 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:31:42,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-26 02:31:42,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-11-26 02:31:42,997 INFO L87 Difference]: Start difference. First operand 997 states and 1429 transitions. Second operand 8 states. [2019-11-26 02:31:43,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:31:43,775 INFO L93 Difference]: Finished difference Result 2100 states and 2970 transitions. [2019-11-26 02:31:43,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-26 02:31:43,776 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 159 [2019-11-26 02:31:43,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:31:43,782 INFO L225 Difference]: With dead ends: 2100 [2019-11-26 02:31:43,782 INFO L226 Difference]: Without dead ends: 1104 [2019-11-26 02:31:43,784 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-11-26 02:31:43,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1104 states. [2019-11-26 02:31:43,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1104 to 997. [2019-11-26 02:31:43,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 997 states. [2019-11-26 02:31:43,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 997 states to 997 states and 1417 transitions. [2019-11-26 02:31:43,812 INFO L78 Accepts]: Start accepts. Automaton has 997 states and 1417 transitions. Word has length 159 [2019-11-26 02:31:43,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:31:43,813 INFO L462 AbstractCegarLoop]: Abstraction has 997 states and 1417 transitions. [2019-11-26 02:31:43,813 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-26 02:31:43,813 INFO L276 IsEmpty]: Start isEmpty. Operand 997 states and 1417 transitions. [2019-11-26 02:31:43,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-11-26 02:31:43,817 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:31:43,817 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:31:43,817 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:31:43,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:31:43,818 INFO L82 PathProgramCache]: Analyzing trace with hash -114234491, now seen corresponding path program 1 times [2019-11-26 02:31:43,818 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:31:43,818 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444317453] [2019-11-26 02:31:43,818 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:31:43,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:31:43,942 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 205 proven. 0 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2019-11-26 02:31:43,943 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444317453] [2019-11-26 02:31:43,943 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:31:43,943 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-26 02:31:43,943 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473236619] [2019-11-26 02:31:43,943 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:31:43,944 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:31:43,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:31:43,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:31:43,944 INFO L87 Difference]: Start difference. First operand 997 states and 1417 transitions. Second operand 4 states. [2019-11-26 02:31:44,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:31:44,514 INFO L93 Difference]: Finished difference Result 2135 states and 3035 transitions. [2019-11-26 02:31:44,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:31:44,517 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 192 [2019-11-26 02:31:44,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:31:44,522 INFO L225 Difference]: With dead ends: 2135 [2019-11-26 02:31:44,523 INFO L226 Difference]: Without dead ends: 1139 [2019-11-26 02:31:44,524 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:31:44,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1139 states. [2019-11-26 02:31:44,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1139 to 1068. [2019-11-26 02:31:44,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1068 states. [2019-11-26 02:31:44,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1068 states to 1068 states and 1422 transitions. [2019-11-26 02:31:44,550 INFO L78 Accepts]: Start accepts. Automaton has 1068 states and 1422 transitions. Word has length 192 [2019-11-26 02:31:44,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:31:44,550 INFO L462 AbstractCegarLoop]: Abstraction has 1068 states and 1422 transitions. [2019-11-26 02:31:44,550 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:31:44,551 INFO L276 IsEmpty]: Start isEmpty. Operand 1068 states and 1422 transitions. [2019-11-26 02:31:44,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2019-11-26 02:31:44,554 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:31:44,555 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31:44,555 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:31:44,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:31:44,556 INFO L82 PathProgramCache]: Analyzing trace with hash 1171741241, now seen corresponding path program 1 times [2019-11-26 02:31:44,556 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:31:44,556 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723660727] [2019-11-26 02:31:44,556 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:31:44,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:31:44,677 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 246 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2019-11-26 02:31:44,678 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723660727] [2019-11-26 02:31:44,678 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:31:44,678 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-26 02:31:44,678 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761253904] [2019-11-26 02:31:44,679 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:31:44,679 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:31:44,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:31:44,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:31:44,680 INFO L87 Difference]: Start difference. First operand 1068 states and 1422 transitions. Second operand 4 states. [2019-11-26 02:31:45,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:31:45,108 INFO L93 Difference]: Finished difference Result 2419 states and 3181 transitions. [2019-11-26 02:31:45,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:31:45,109 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 218 [2019-11-26 02:31:45,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:31:45,116 INFO L225 Difference]: With dead ends: 2419 [2019-11-26 02:31:45,116 INFO L226 Difference]: Without dead ends: 1352 [2019-11-26 02:31:45,117 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:31:45,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1352 states. [2019-11-26 02:31:45,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1352 to 1068. [2019-11-26 02:31:45,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1068 states. [2019-11-26 02:31:45,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1068 states to 1068 states and 1410 transitions. [2019-11-26 02:31:45,142 INFO L78 Accepts]: Start accepts. Automaton has 1068 states and 1410 transitions. Word has length 218 [2019-11-26 02:31:45,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:31:45,143 INFO L462 AbstractCegarLoop]: Abstraction has 1068 states and 1410 transitions. [2019-11-26 02:31:45,143 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:31:45,143 INFO L276 IsEmpty]: Start isEmpty. Operand 1068 states and 1410 transitions. [2019-11-26 02:31:45,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2019-11-26 02:31:45,147 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:31:45,148 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 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, 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] [2019-11-26 02:31:45,148 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:31:45,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:31:45,148 INFO L82 PathProgramCache]: Analyzing trace with hash 39381252, now seen corresponding path program 1 times [2019-11-26 02:31:45,148 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:31:45,149 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379186371] [2019-11-26 02:31:45,149 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:31:45,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:31:45,338 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 275 proven. 0 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2019-11-26 02:31:45,338 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379186371] [2019-11-26 02:31:45,338 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:31:45,338 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-26 02:31:45,339 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304368439] [2019-11-26 02:31:45,339 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-26 02:31:45,339 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:31:45,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-26 02:31:45,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-26 02:31:45,340 INFO L87 Difference]: Start difference. First operand 1068 states and 1410 transitions. Second operand 6 states. [2019-11-26 02:31:45,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:31:45,882 INFO L93 Difference]: Finished difference Result 2244 states and 2934 transitions. [2019-11-26 02:31:45,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-26 02:31:45,882 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 239 [2019-11-26 02:31:45,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:31:45,888 INFO L225 Difference]: With dead ends: 2244 [2019-11-26 02:31:45,888 INFO L226 Difference]: Without dead ends: 1177 [2019-11-26 02:31:45,890 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-26 02:31:45,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1177 states. [2019-11-26 02:31:45,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1177 to 997. [2019-11-26 02:31:45,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 997 states. [2019-11-26 02:31:45,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 997 states to 997 states and 1261 transitions. [2019-11-26 02:31:45,920 INFO L78 Accepts]: Start accepts. Automaton has 997 states and 1261 transitions. Word has length 239 [2019-11-26 02:31:45,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:31:45,921 INFO L462 AbstractCegarLoop]: Abstraction has 997 states and 1261 transitions. [2019-11-26 02:31:45,921 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-26 02:31:45,921 INFO L276 IsEmpty]: Start isEmpty. Operand 997 states and 1261 transitions. [2019-11-26 02:31:45,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2019-11-26 02:31:45,926 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:31:45,927 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 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, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:31:45,927 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:31:45,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:31:45,928 INFO L82 PathProgramCache]: Analyzing trace with hash 1839440731, now seen corresponding path program 1 times [2019-11-26 02:31:45,928 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:31:45,928 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845872486] [2019-11-26 02:31:45,928 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:31:46,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:31:46,803 INFO L134 CoverageAnalysis]: Checked inductivity of 467 backedges. 374 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2019-11-26 02:31:46,803 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845872486] [2019-11-26 02:31:46,804 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:31:46,804 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-11-26 02:31:46,804 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45292256] [2019-11-26 02:31:46,804 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-26 02:31:46,804 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:31:46,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-26 02:31:46,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=102, Unknown=0, NotChecked=0, Total=182 [2019-11-26 02:31:46,805 INFO L87 Difference]: Start difference. First operand 997 states and 1261 transitions. Second operand 14 states. [2019-11-26 02:31:48,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:31:48,044 INFO L93 Difference]: Finished difference Result 2252 states and 2825 transitions. [2019-11-26 02:31:48,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-26 02:31:48,044 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 261 [2019-11-26 02:31:48,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:31:48,045 INFO L225 Difference]: With dead ends: 2252 [2019-11-26 02:31:48,045 INFO L226 Difference]: Without dead ends: 0 [2019-11-26 02:31:48,047 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=150, Invalid=192, Unknown=0, NotChecked=0, Total=342 [2019-11-26 02:31:48,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-26 02:31:48,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-26 02:31:48,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-26 02:31:48,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-26 02:31:48,048 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 261 [2019-11-26 02:31:48,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:31:48,048 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-26 02:31:48,048 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-26 02:31:48,048 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-26 02:31:48,048 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-26 02:31:48,053 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-26 02:31:48,168 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 149 DAG size of output: 102 [2019-11-26 02:31:48,277 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 99 [2019-11-26 02:31:48,747 WARN L192 SmtUtils]: Spent 467.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 49 [2019-11-26 02:31:49,135 WARN L192 SmtUtils]: Spent 386.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 49 [2019-11-26 02:31:49,137 INFO L444 ceAbstractionStarter]: For program point L333(lines 333 390) no Hoare annotation was computed. [2019-11-26 02:31:49,138 INFO L444 ceAbstractionStarter]: For program point L102(lines 102 390) no Hoare annotation was computed. [2019-11-26 02:31:49,138 INFO L444 ceAbstractionStarter]: For program point L433-1(lines 30 575) no Hoare annotation was computed. [2019-11-26 02:31:49,138 INFO L444 ceAbstractionStarter]: For program point L268(lines 268 390) no Hoare annotation was computed. [2019-11-26 02:31:49,138 INFO L444 ceAbstractionStarter]: For program point L136(lines 136 390) no Hoare annotation was computed. [2019-11-26 02:31:49,138 INFO L444 ceAbstractionStarter]: For program point L203(lines 203 390) no Hoare annotation was computed. [2019-11-26 02:31:49,138 INFO L444 ceAbstractionStarter]: For program point L72(lines 72 390) no Hoare annotation was computed. [2019-11-26 02:31:49,138 INFO L444 ceAbstractionStarter]: For program point L436-1(lines 30 575) no Hoare annotation was computed. [2019-11-26 02:31:49,138 INFO L444 ceAbstractionStarter]: For program point L337(lines 337 390) no Hoare annotation was computed. [2019-11-26 02:31:49,138 INFO L444 ceAbstractionStarter]: For program point L238(lines 238 390) no Hoare annotation was computed. [2019-11-26 02:31:49,138 INFO L444 ceAbstractionStarter]: For program point L437(line 437) no Hoare annotation was computed. [2019-11-26 02:31:49,138 INFO L444 ceAbstractionStarter]: For program point L173(lines 173 390) no Hoare annotation was computed. [2019-11-26 02:31:49,138 INFO L444 ceAbstractionStarter]: For program point L140(lines 140 390) no Hoare annotation was computed. [2019-11-26 02:31:49,138 INFO L444 ceAbstractionStarter]: For program point L372(lines 372 390) no Hoare annotation was computed. [2019-11-26 02:31:49,139 INFO L444 ceAbstractionStarter]: For program point L306(lines 306 390) no Hoare annotation was computed. [2019-11-26 02:31:49,139 INFO L444 ceAbstractionStarter]: For program point L273(lines 273 390) no Hoare annotation was computed. [2019-11-26 02:31:49,139 INFO L444 ceAbstractionStarter]: For program point L108(lines 108 390) no Hoare annotation was computed. [2019-11-26 02:31:49,139 INFO L444 ceAbstractionStarter]: For program point L208(lines 208 390) no Hoare annotation was computed. [2019-11-26 02:31:49,139 INFO L444 ceAbstractionStarter]: For program point L43(lines 43 390) no Hoare annotation was computed. [2019-11-26 02:31:49,139 INFO L444 ceAbstractionStarter]: For program point L144(lines 144 390) no Hoare annotation was computed. [2019-11-26 02:31:49,139 INFO L440 ceAbstractionStarter]: At program point L574(lines 30 575) the Hoare annotation is: (let ((.cse6 (= 1 ~a7~0)) (.cse3 (= ~a16~0 6)) (.cse2 (= ~a21~0 1)) (.cse7 (= 13 ~a8~0))) (let ((.cse4 (not .cse7)) (.cse5 (not .cse2)) (.cse10 (<= ~a17~0 0)) (.cse8 (not .cse3)) (.cse0 (not .cse6)) (.cse12 (= ~a16~0 4)) (.cse9 (= ~a17~0 1)) (.cse1 (= ~a12~0 8)) (.cse11 (= ~a20~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse1 .cse2 .cse4 (= ~a16~0 5)) (and .cse5 .cse6 .cse7 .cse8 .cse9 .cse1) (and .cse5 .cse6 .cse7 .cse1 .cse10 .cse11 (or (= 2 ULTIMATE.start_calculate_output_~input) (= 4 ULTIMATE.start_calculate_output_~input) (= 6 ULTIMATE.start_calculate_output_~input) (= 1 ULTIMATE.start_calculate_output_~input) (= 5 ULTIMATE.start_calculate_output_~input)) .cse3) (and .cse6 .cse7 .cse12 .cse1 .cse10) (and .cse8 .cse1 .cse0 .cse9 .cse2) (and .cse12 .cse1 .cse2 (not .cse9)) (and .cse9 .cse1 .cse2 .cse11)))) [2019-11-26 02:31:49,139 INFO L444 ceAbstractionStarter]: For program point L178(lines 178 390) no Hoare annotation was computed. [2019-11-26 02:31:49,139 INFO L444 ceAbstractionStarter]: For program point L377(lines 377 390) no Hoare annotation was computed. [2019-11-26 02:31:49,140 INFO L444 ceAbstractionStarter]: For program point L278(lines 278 390) no Hoare annotation was computed. [2019-11-26 02:31:49,140 INFO L444 ceAbstractionStarter]: For program point L245(lines 245 390) no Hoare annotation was computed. [2019-11-26 02:31:49,140 INFO L444 ceAbstractionStarter]: For program point L80(lines 80 390) no Hoare annotation was computed. [2019-11-26 02:31:49,140 INFO L444 ceAbstractionStarter]: For program point L345(lines 345 390) no Hoare annotation was computed. [2019-11-26 02:31:49,140 INFO L444 ceAbstractionStarter]: For program point L312(lines 312 390) no Hoare annotation was computed. [2019-11-26 02:31:49,140 INFO L444 ceAbstractionStarter]: For program point L114(lines 114 390) no Hoare annotation was computed. [2019-11-26 02:31:49,140 INFO L447 ceAbstractionStarter]: At program point L577(lines 577 594) the Hoare annotation is: true [2019-11-26 02:31:49,140 INFO L444 ceAbstractionStarter]: For program point L214(lines 214 390) no Hoare annotation was computed. [2019-11-26 02:31:49,140 INFO L444 ceAbstractionStarter]: For program point L148(lines 148 390) no Hoare annotation was computed. [2019-11-26 02:31:49,140 INFO L444 ceAbstractionStarter]: For program point L49(lines 49 390) no Hoare annotation was computed. [2019-11-26 02:31:49,140 INFO L444 ceAbstractionStarter]: For program point L84(lines 84 390) no Hoare annotation was computed. [2019-11-26 02:31:49,141 INFO L444 ceAbstractionStarter]: For program point L382(lines 382 390) no Hoare annotation was computed. [2019-11-26 02:31:49,141 INFO L444 ceAbstractionStarter]: For program point L316(lines 316 390) no Hoare annotation was computed. [2019-11-26 02:31:49,141 INFO L444 ceAbstractionStarter]: For program point L250(lines 250 390) no Hoare annotation was computed. [2019-11-26 02:31:49,141 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-26 02:31:49,141 INFO L444 ceAbstractionStarter]: For program point L218(lines 218 390) no Hoare annotation was computed. [2019-11-26 02:31:49,141 INFO L444 ceAbstractionStarter]: For program point L152(lines 152 390) no Hoare annotation was computed. [2019-11-26 02:31:49,141 INFO L444 ceAbstractionStarter]: For program point L119(lines 119 390) no Hoare annotation was computed. [2019-11-26 02:31:49,141 INFO L444 ceAbstractionStarter]: For program point L318(lines 318 390) no Hoare annotation was computed. [2019-11-26 02:31:49,141 INFO L444 ceAbstractionStarter]: For program point L186(lines 186 390) no Hoare annotation was computed. [2019-11-26 02:31:49,141 INFO L444 ceAbstractionStarter]: For program point L54(lines 54 390) no Hoare annotation was computed. [2019-11-26 02:31:49,142 INFO L440 ceAbstractionStarter]: At program point L583-2(lines 583 593) the Hoare annotation is: (let ((.cse6 (= 1 ~a7~0)) (.cse3 (= ~a16~0 6)) (.cse2 (= ~a21~0 1)) (.cse7 (= 13 ~a8~0))) (let ((.cse4 (not .cse7)) (.cse5 (not .cse2)) (.cse10 (<= ~a17~0 0)) (.cse12 (= ~a16~0 4)) (.cse8 (not .cse3)) (.cse0 (not .cse6)) (.cse9 (= ~a17~0 1)) (.cse1 (= ~a12~0 8)) (.cse11 (= ~a20~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse1 .cse2 .cse4 (= ~a16~0 5)) (and .cse5 .cse6 .cse7 .cse8 .cse9 .cse1) (and .cse5 .cse6 .cse7 .cse1 .cse10 .cse11 (or (= 2 ULTIMATE.start_calculate_output_~input) (= 4 ULTIMATE.start_calculate_output_~input) (= 6 ULTIMATE.start_calculate_output_~input) (= 1 ULTIMATE.start_calculate_output_~input) (= 5 ULTIMATE.start_calculate_output_~input)) .cse3) (and .cse6 .cse7 .cse12 .cse1 .cse10) (and .cse12 .cse1 .cse2 (not .cse9)) (and .cse8 .cse1 .cse0 .cse9 .cse2) (and .cse9 .cse1 .cse2 .cse11)))) [2019-11-26 02:31:49,142 INFO L444 ceAbstractionStarter]: For program point L286(lines 286 390) no Hoare annotation was computed. [2019-11-26 02:31:49,142 INFO L444 ceAbstractionStarter]: For program point L353(lines 353 390) no Hoare annotation was computed. [2019-11-26 02:31:49,142 INFO L444 ceAbstractionStarter]: For program point L189(lines 189 390) no Hoare annotation was computed. [2019-11-26 02:31:49,142 INFO L444 ceAbstractionStarter]: For program point L355(lines 355 390) no Hoare annotation was computed. [2019-11-26 02:31:49,142 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-26 02:31:49,142 INFO L444 ceAbstractionStarter]: For program point L256(lines 256 390) no Hoare annotation was computed. [2019-11-26 02:31:49,142 INFO L444 ceAbstractionStarter]: For program point L223(lines 223 390) no Hoare annotation was computed. [2019-11-26 02:31:49,142 INFO L444 ceAbstractionStarter]: For program point L124(lines 124 390) no Hoare annotation was computed. [2019-11-26 02:31:49,142 INFO L444 ceAbstractionStarter]: For program point L92(lines 92 390) no Hoare annotation was computed. [2019-11-26 02:31:49,142 INFO L444 ceAbstractionStarter]: For program point L588(line 588) no Hoare annotation was computed. [2019-11-26 02:31:49,142 INFO L444 ceAbstractionStarter]: For program point L324(lines 324 390) no Hoare annotation was computed. [2019-11-26 02:31:49,143 INFO L444 ceAbstractionStarter]: For program point L292(lines 292 390) no Hoare annotation was computed. [2019-11-26 02:31:49,143 INFO L444 ceAbstractionStarter]: For program point L160(lines 160 390) no Hoare annotation was computed. [2019-11-26 02:31:49,143 INFO L444 ceAbstractionStarter]: For program point L194(lines 194 390) no Hoare annotation was computed. [2019-11-26 02:31:49,143 INFO L444 ceAbstractionStarter]: For program point L62(lines 62 390) no Hoare annotation was computed. [2019-11-26 02:31:49,143 INFO L444 ceAbstractionStarter]: For program point L261(lines 261 390) no Hoare annotation was computed. [2019-11-26 02:31:49,143 INFO L444 ceAbstractionStarter]: For program point L129(lines 129 390) no Hoare annotation was computed. [2019-11-26 02:31:49,143 INFO L444 ceAbstractionStarter]: For program point L361(lines 361 390) no Hoare annotation was computed. [2019-11-26 02:31:49,143 INFO L444 ceAbstractionStarter]: For program point L97(lines 97 390) no Hoare annotation was computed. [2019-11-26 02:31:49,143 INFO L444 ceAbstractionStarter]: For program point L31(lines 31 390) no Hoare annotation was computed. [2019-11-26 02:31:49,143 INFO L444 ceAbstractionStarter]: For program point L329(lines 329 390) no Hoare annotation was computed. [2019-11-26 02:31:49,143 INFO L444 ceAbstractionStarter]: For program point L197(lines 197 390) no Hoare annotation was computed. [2019-11-26 02:31:49,143 INFO L444 ceAbstractionStarter]: For program point L65(lines 65 390) no Hoare annotation was computed. [2019-11-26 02:31:49,144 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 437) no Hoare annotation was computed. [2019-11-26 02:31:49,144 INFO L444 ceAbstractionStarter]: For program point L363(lines 363 390) no Hoare annotation was computed. [2019-11-26 02:31:49,144 INFO L444 ceAbstractionStarter]: For program point L231(lines 231 390) no Hoare annotation was computed. [2019-11-26 02:31:49,144 INFO L444 ceAbstractionStarter]: For program point L165(lines 165 390) no Hoare annotation was computed. [2019-11-26 02:31:49,144 INFO L444 ceAbstractionStarter]: For program point L265(lines 265 390) no Hoare annotation was computed. [2019-11-26 02:31:49,144 INFO L444 ceAbstractionStarter]: For program point L365(lines 365 390) no Hoare annotation was computed. [2019-11-26 02:31:49,144 INFO L444 ceAbstractionStarter]: For program point L299(lines 299 390) no Hoare annotation was computed. [2019-11-26 02:31:49,144 INFO L444 ceAbstractionStarter]: For program point L35(lines 35 390) no Hoare annotation was computed. [2019-11-26 02:31:49,169 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.11 02:31:49 BoogieIcfgContainer [2019-11-26 02:31:49,169 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-26 02:31:49,169 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-26 02:31:49,169 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-26 02:31:49,170 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-26 02:31:49,170 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 02:31:38" (3/4) ... [2019-11-26 02:31:49,173 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-26 02:31:49,193 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 99 nodes and edges [2019-11-26 02:31:49,195 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 19 nodes and edges [2019-11-26 02:31:49,197 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2019-11-26 02:31:49,198 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-11-26 02:31:49,353 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_bfd4705e-b258-49c1-a8b7-83273e6f36d5/bin/utaipan/witness.graphml [2019-11-26 02:31:49,354 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-26 02:31:49,355 INFO L168 Benchmark]: Toolchain (without parser) took 13359.47 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 422.6 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -150.4 MB). Peak memory consumption was 272.2 MB. Max. memory is 11.5 GB. [2019-11-26 02:31:49,355 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-26 02:31:49,356 INFO L168 Benchmark]: CACSL2BoogieTranslator took 652.41 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.0 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -161.2 MB). Peak memory consumption was 24.2 MB. Max. memory is 11.5 GB. [2019-11-26 02:31:49,356 INFO L168 Benchmark]: Boogie Procedure Inliner took 76.66 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:31:49,357 INFO L168 Benchmark]: Boogie Preprocessor took 72.17 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:31:49,357 INFO L168 Benchmark]: RCFGBuilder took 1934.02 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 882.8 MB in the end (delta: 212.3 MB). Peak memory consumption was 212.3 MB. Max. memory is 11.5 GB. [2019-11-26 02:31:49,358 INFO L168 Benchmark]: TraceAbstraction took 10435.30 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 293.6 MB). Free memory was 877.5 MB in the beginning and 1.1 GB in the end (delta: -233.0 MB). Peak memory consumption was 60.6 MB. Max. memory is 11.5 GB. [2019-11-26 02:31:49,358 INFO L168 Benchmark]: Witness Printer took 184.56 ms. Allocated memory is still 1.5 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 15.4 MB). Peak memory consumption was 15.4 MB. Max. memory is 11.5 GB. [2019-11-26 02:31:49,361 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.22 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 652.41 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.0 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -161.2 MB). Peak memory consumption was 24.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 76.66 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 72.17 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 1934.02 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 882.8 MB in the end (delta: 212.3 MB). Peak memory consumption was 212.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 10435.30 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 293.6 MB). Free memory was 877.5 MB in the beginning and 1.1 GB in the end (delta: -233.0 MB). Peak memory consumption was 60.6 MB. Max. memory is 11.5 GB. * Witness Printer took 184.56 ms. Allocated memory is still 1.5 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 15.4 MB). Peak memory consumption was 15.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 437]: 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) && a12 == 8) && a21 == 1) && a16 == 6) && !(13 == a8)) || (((a12 == 8 && a21 == 1) && !(13 == a8)) && a16 == 5)) || (((((!(a21 == 1) && 1 == a7) && 13 == a8) && !(a16 == 6)) && a17 == 1) && a12 == 8)) || (((((((!(a21 == 1) && 1 == a7) && 13 == a8) && a12 == 8) && a17 <= 0) && a20 == 1) && ((((2 == input || 4 == input) || 6 == input) || 1 == input) || 5 == input)) && a16 == 6)) || ((((1 == a7 && 13 == a8) && a16 == 4) && a12 == 8) && a17 <= 0)) || ((((!(a16 == 6) && a12 == 8) && !(1 == a7)) && a17 == 1) && a21 == 1)) || (((a16 == 4 && a12 == 8) && a21 == 1) && !(a17 == 1))) || (((a17 == 1 && a12 == 8) && a21 == 1) && a20 == 1) - InvariantResult [Line: 577]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 583]: Loop Invariant Derived loop invariant: ((((((((((!(1 == a7) && a12 == 8) && a21 == 1) && a16 == 6) && !(13 == a8)) || (((a12 == 8 && a21 == 1) && !(13 == a8)) && a16 == 5)) || (((((!(a21 == 1) && 1 == a7) && 13 == a8) && !(a16 == 6)) && a17 == 1) && a12 == 8)) || (((((((!(a21 == 1) && 1 == a7) && 13 == a8) && a12 == 8) && a17 <= 0) && a20 == 1) && ((((2 == input || 4 == input) || 6 == input) || 1 == input) || 5 == input)) && a16 == 6)) || ((((1 == a7 && 13 == a8) && a16 == 4) && a12 == 8) && a17 <= 0)) || (((a16 == 4 && a12 == 8) && a21 == 1) && !(a17 == 1))) || ((((!(a16 == 6) && a12 == 8) && !(1 == a7)) && a17 == 1) && a21 == 1)) || (((a17 == 1 && a12 == 8) && a21 == 1) && a20 == 1) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 76 locations, 1 error locations. Result: SAFE, OverallTime: 10.3s, OverallIterations: 11, TraceHistogramMax: 7, AutomataDifference: 6.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.0s, HoareTripleCheckerStatistics: 556 SDtfs, 1666 SDslu, 100 SDs, 0 SdLazy, 4218 SolverSat, 1076 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 64 GetRequests, 20 SyntacticMatches, 5 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1068occurred in iteration=8, 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, 11 MinimizatonAttempts, 1068 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 42 NumberOfFragments, 309 HoareAnnotationTreeSize, 3 FomulaSimplifications, 15014 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 3 FomulaSimplificationsInter, 5314 FormulaSimplificationTreeSizeReductionInter, 0.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 1754 NumberOfCodeBlocks, 1754 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 1743 ConstructedInterpolants, 0 QuantifiedInterpolants, 1290399 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 2253/2253 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...