./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem01_label43.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_76d27141-aaa9-4ab7-a47e-17b1e7fb1a25/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_76d27141-aaa9-4ab7-a47e-17b1e7fb1a25/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_76d27141-aaa9-4ab7-a47e-17b1e7fb1a25/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_76d27141-aaa9-4ab7-a47e-17b1e7fb1a25/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem01_label43.c -s /tmp/vcloud-vcloud-master/worker/run_dir_76d27141-aaa9-4ab7-a47e-17b1e7fb1a25/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_76d27141-aaa9-4ab7-a47e-17b1e7fb1a25/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 5c739325db675539f25b419a33c8766e100c13e7 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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:46:18,880 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-26 02:46:18,883 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-26 02:46:18,903 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-26 02:46:18,903 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-26 02:46:18,905 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-26 02:46:18,907 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-26 02:46:18,922 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-26 02:46:18,925 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-26 02:46:18,925 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-26 02:46:18,928 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-26 02:46:18,930 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-26 02:46:18,930 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-26 02:46:18,931 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-26 02:46:18,932 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-26 02:46:18,934 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-26 02:46:18,935 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-26 02:46:18,936 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-26 02:46:18,938 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-26 02:46:18,940 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-26 02:46:18,942 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-26 02:46:18,943 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-26 02:46:18,945 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-26 02:46:18,946 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-26 02:46:18,949 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-26 02:46:18,949 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-26 02:46:18,949 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-26 02:46:18,950 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-26 02:46:18,951 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-26 02:46:18,952 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-26 02:46:18,952 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-26 02:46:18,953 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-26 02:46:18,954 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-26 02:46:18,954 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-26 02:46:18,956 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-26 02:46:18,956 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-26 02:46:18,957 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-26 02:46:18,957 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-26 02:46:18,957 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-26 02:46:18,958 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-26 02:46:18,959 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-26 02:46:18,960 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_76d27141-aaa9-4ab7-a47e-17b1e7fb1a25/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-11-26 02:46:18,979 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-26 02:46:18,979 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-26 02:46:18,980 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-26 02:46:18,980 INFO L138 SettingsManager]: * User list type=DISABLED [2019-11-26 02:46:18,981 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-11-26 02:46:18,981 INFO L138 SettingsManager]: * Explicit value domain=true [2019-11-26 02:46:18,981 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-11-26 02:46:18,981 INFO L138 SettingsManager]: * Octagon Domain=false [2019-11-26 02:46:18,982 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-11-26 02:46:18,982 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-11-26 02:46:18,982 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-11-26 02:46:18,982 INFO L138 SettingsManager]: * Interval Domain=false [2019-11-26 02:46:18,983 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-11-26 02:46:18,983 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-11-26 02:46:18,983 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-11-26 02:46:18,984 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-26 02:46:18,984 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-26 02:46:18,984 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-26 02:46:18,985 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-26 02:46:18,985 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-26 02:46:18,985 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-26 02:46:18,985 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-26 02:46:18,986 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-26 02:46:18,986 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-26 02:46:18,986 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-26 02:46:18,986 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-26 02:46:18,987 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-26 02:46:18,987 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-26 02:46:18,987 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-26 02:46:18,987 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-26 02:46:18,988 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-26 02:46:18,988 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-26 02:46:18,988 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-26 02:46:18,988 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-11-26 02:46:18,989 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-26 02:46:18,989 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-26 02:46:18,989 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-26 02:46:18,989 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_76d27141-aaa9-4ab7-a47e-17b1e7fb1a25/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 -> 5c739325db675539f25b419a33c8766e100c13e7 [2019-11-26 02:46:19,205 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-26 02:46:19,218 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-26 02:46:19,222 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-26 02:46:19,224 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-26 02:46:19,224 INFO L275 PluginConnector]: CDTParser initialized [2019-11-26 02:46:19,225 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_76d27141-aaa9-4ab7-a47e-17b1e7fb1a25/bin/utaipan/../../sv-benchmarks/c/eca-rers2012/Problem01_label43.c [2019-11-26 02:46:19,288 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_76d27141-aaa9-4ab7-a47e-17b1e7fb1a25/bin/utaipan/data/223aa1060/16db2e417d584292a3b67769e4c3e82a/FLAGce5ac4f2b [2019-11-26 02:46:19,867 INFO L306 CDTParser]: Found 1 translation units. [2019-11-26 02:46:19,868 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_76d27141-aaa9-4ab7-a47e-17b1e7fb1a25/sv-benchmarks/c/eca-rers2012/Problem01_label43.c [2019-11-26 02:46:19,883 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_76d27141-aaa9-4ab7-a47e-17b1e7fb1a25/bin/utaipan/data/223aa1060/16db2e417d584292a3b67769e4c3e82a/FLAGce5ac4f2b [2019-11-26 02:46:20,076 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_76d27141-aaa9-4ab7-a47e-17b1e7fb1a25/bin/utaipan/data/223aa1060/16db2e417d584292a3b67769e4c3e82a [2019-11-26 02:46:20,079 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-26 02:46:20,081 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-26 02:46:20,082 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-26 02:46:20,082 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-26 02:46:20,086 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-26 02:46:20,087 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 02:46:20" (1/1) ... [2019-11-26 02:46:20,090 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@747bdf1d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:46:20, skipping insertion in model container [2019-11-26 02:46:20,090 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 02:46:20" (1/1) ... [2019-11-26 02:46:20,098 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-26 02:46:20,158 INFO L179 MainTranslator]: Built tables and reachable declarations [2019-11-26 02:46:20,630 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-26 02:46:20,635 INFO L201 MainTranslator]: Completed pre-run [2019-11-26 02:46:20,779 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-26 02:46:20,794 INFO L205 MainTranslator]: Completed translation [2019-11-26 02:46:20,794 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:46:20 WrapperNode [2019-11-26 02:46:20,794 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-26 02:46:20,795 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-26 02:46:20,795 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-26 02:46:20,795 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-26 02:46:20,803 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:46:20" (1/1) ... [2019-11-26 02:46:20,819 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:46:20" (1/1) ... [2019-11-26 02:46:20,879 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-26 02:46:20,880 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-26 02:46:20,880 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-26 02:46:20,880 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-26 02:46:20,888 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:46:20" (1/1) ... [2019-11-26 02:46:20,889 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:46:20" (1/1) ... [2019-11-26 02:46:20,893 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:46:20" (1/1) ... [2019-11-26 02:46:20,893 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:46:20" (1/1) ... [2019-11-26 02:46:20,913 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:46:20" (1/1) ... [2019-11-26 02:46:20,922 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:46:20" (1/1) ... [2019-11-26 02:46:20,929 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:46:20" (1/1) ... [2019-11-26 02:46:20,937 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-26 02:46:20,937 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-26 02:46:20,937 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-26 02:46:20,938 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-26 02:46:20,938 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:46:20" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_76d27141-aaa9-4ab7-a47e-17b1e7fb1a25/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:46:21,027 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-26 02:46:21,030 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-26 02:46:22,972 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-26 02:46:22,972 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-26 02:46:22,973 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 02:46:22 BoogieIcfgContainer [2019-11-26 02:46:22,973 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-26 02:46:22,975 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-26 02:46:22,975 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-26 02:46:22,978 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-26 02:46:22,978 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.11 02:46:20" (1/3) ... [2019-11-26 02:46:22,979 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c3e4229 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 02:46:22, skipping insertion in model container [2019-11-26 02:46:22,979 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:46:20" (2/3) ... [2019-11-26 02:46:22,980 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c3e4229 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 02:46:22, skipping insertion in model container [2019-11-26 02:46:22,980 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 02:46:22" (3/3) ... [2019-11-26 02:46:22,982 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem01_label43.c [2019-11-26 02:46:22,990 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-26 02:46:22,996 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-26 02:46:23,006 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-26 02:46:23,035 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-26 02:46:23,036 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-26 02:46:23,036 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-26 02:46:23,036 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-26 02:46:23,036 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-26 02:46:23,036 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-26 02:46:23,036 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-26 02:46:23,037 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-26 02:46:23,055 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states. [2019-11-26 02:46:23,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-11-26 02:46:23,064 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:46:23,065 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:46:23,065 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:46:23,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:46:23,071 INFO L82 PathProgramCache]: Analyzing trace with hash -1323229593, now seen corresponding path program 1 times [2019-11-26 02:46:23,079 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:46:23,080 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372026259] [2019-11-26 02:46:23,080 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:46:23,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:46:23,570 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:46:23,572 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372026259] [2019-11-26 02:46:23,573 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:46:23,574 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 02:46:23,575 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426150951] [2019-11-26 02:46:23,583 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:46:23,583 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:46:23,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:46:23,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:46:23,602 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 4 states. [2019-11-26 02:46:24,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:46:24,621 INFO L93 Difference]: Finished difference Result 297 states and 569 transitions. [2019-11-26 02:46:24,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:46:24,623 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 71 [2019-11-26 02:46:24,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:46:24,639 INFO L225 Difference]: With dead ends: 297 [2019-11-26 02:46:24,640 INFO L226 Difference]: Without dead ends: 216 [2019-11-26 02:46:24,644 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:46:24,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2019-11-26 02:46:24,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 216. [2019-11-26 02:46:24,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2019-11-26 02:46:24,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 378 transitions. [2019-11-26 02:46:24,703 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 378 transitions. Word has length 71 [2019-11-26 02:46:24,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:46:24,704 INFO L462 AbstractCegarLoop]: Abstraction has 216 states and 378 transitions. [2019-11-26 02:46:24,704 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:46:24,704 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 378 transitions. [2019-11-26 02:46:24,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-11-26 02:46:24,712 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:46:24,712 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:46:24,712 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:46:24,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:46:24,713 INFO L82 PathProgramCache]: Analyzing trace with hash 585788127, now seen corresponding path program 1 times [2019-11-26 02:46:24,713 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:46:24,713 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624767148] [2019-11-26 02:46:24,713 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:46:24,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:46:24,786 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:46:24,786 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624767148] [2019-11-26 02:46:24,786 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:46:24,787 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 02:46:24,787 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938209782] [2019-11-26 02:46:24,791 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:46:24,791 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:46:24,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:46:24,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:46:24,792 INFO L87 Difference]: Start difference. First operand 216 states and 378 transitions. Second operand 4 states. [2019-11-26 02:46:25,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:46:25,264 INFO L93 Difference]: Finished difference Result 644 states and 1131 transitions. [2019-11-26 02:46:25,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 02:46:25,265 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2019-11-26 02:46:25,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:46:25,269 INFO L225 Difference]: With dead ends: 644 [2019-11-26 02:46:25,269 INFO L226 Difference]: Without dead ends: 429 [2019-11-26 02:46:25,271 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:46:25,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2019-11-26 02:46:25,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 429. [2019-11-26 02:46:25,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 429 states. [2019-11-26 02:46:25,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 705 transitions. [2019-11-26 02:46:25,304 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 705 transitions. Word has length 76 [2019-11-26 02:46:25,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:46:25,304 INFO L462 AbstractCegarLoop]: Abstraction has 429 states and 705 transitions. [2019-11-26 02:46:25,304 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:46:25,304 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 705 transitions. [2019-11-26 02:46:25,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-11-26 02:46:25,311 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:46:25,312 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:46:25,312 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:46:25,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:46:25,312 INFO L82 PathProgramCache]: Analyzing trace with hash 928595433, now seen corresponding path program 1 times [2019-11-26 02:46:25,313 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:46:25,313 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288255501] [2019-11-26 02:46:25,313 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:46:25,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:46:25,377 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:46:25,377 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288255501] [2019-11-26 02:46:25,378 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:46:25,378 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-26 02:46:25,378 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52897298] [2019-11-26 02:46:25,378 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-26 02:46:25,379 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:46:25,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-26 02:46:25,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:46:25,379 INFO L87 Difference]: Start difference. First operand 429 states and 705 transitions. Second operand 3 states. [2019-11-26 02:46:25,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:46:25,756 INFO L93 Difference]: Finished difference Result 1070 states and 1785 transitions. [2019-11-26 02:46:25,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 02:46:25,757 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 97 [2019-11-26 02:46:25,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:46:25,761 INFO L225 Difference]: With dead ends: 1070 [2019-11-26 02:46:25,761 INFO L226 Difference]: Without dead ends: 642 [2019-11-26 02:46:25,764 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:46:25,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 642 states. [2019-11-26 02:46:25,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 642 to 500. [2019-11-26 02:46:25,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 500 states. [2019-11-26 02:46:25,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 825 transitions. [2019-11-26 02:46:25,800 INFO L78 Accepts]: Start accepts. Automaton has 500 states and 825 transitions. Word has length 97 [2019-11-26 02:46:25,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:46:25,804 INFO L462 AbstractCegarLoop]: Abstraction has 500 states and 825 transitions. [2019-11-26 02:46:25,804 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-26 02:46:25,804 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 825 transitions. [2019-11-26 02:46:25,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-11-26 02:46:25,812 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:46:25,812 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:46:25,813 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:46:25,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:46:25,813 INFO L82 PathProgramCache]: Analyzing trace with hash -1330788852, now seen corresponding path program 1 times [2019-11-26 02:46:25,813 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:46:25,813 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576226634] [2019-11-26 02:46:25,813 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:46:25,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:46:25,948 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:46:25,948 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576226634] [2019-11-26 02:46:25,949 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:46:25,949 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-26 02:46:25,949 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621496045] [2019-11-26 02:46:25,949 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-26 02:46:25,950 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:46:25,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-26 02:46:25,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:46:25,950 INFO L87 Difference]: Start difference. First operand 500 states and 825 transitions. Second operand 3 states. [2019-11-26 02:46:26,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:46:26,276 INFO L93 Difference]: Finished difference Result 1212 states and 1976 transitions. [2019-11-26 02:46:26,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 02:46:26,277 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 133 [2019-11-26 02:46:26,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:46:26,281 INFO L225 Difference]: With dead ends: 1212 [2019-11-26 02:46:26,281 INFO L226 Difference]: Without dead ends: 713 [2019-11-26 02:46:26,282 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:46:26,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 713 states. [2019-11-26 02:46:26,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 713 to 642. [2019-11-26 02:46:26,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 642 states. [2019-11-26 02:46:26,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 985 transitions. [2019-11-26 02:46:26,307 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 985 transitions. Word has length 133 [2019-11-26 02:46:26,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:46:26,309 INFO L462 AbstractCegarLoop]: Abstraction has 642 states and 985 transitions. [2019-11-26 02:46:26,309 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-26 02:46:26,309 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 985 transitions. [2019-11-26 02:46:26,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-11-26 02:46:26,314 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:46:26,315 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:46:26,315 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:46:26,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:46:26,315 INFO L82 PathProgramCache]: Analyzing trace with hash -573606496, now seen corresponding path program 1 times [2019-11-26 02:46:26,316 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:46:26,316 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265583423] [2019-11-26 02:46:26,316 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:46:26,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:46:26,461 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2019-11-26 02:46:26,462 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265583423] [2019-11-26 02:46:26,462 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:46:26,462 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 02:46:26,462 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180420353] [2019-11-26 02:46:26,463 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:46:26,463 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:46:26,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:46:26,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:46:26,464 INFO L87 Difference]: Start difference. First operand 642 states and 985 transitions. Second operand 4 states. [2019-11-26 02:46:26,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:46:26,940 INFO L93 Difference]: Finished difference Result 1371 states and 2075 transitions. [2019-11-26 02:46:26,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-26 02:46:26,941 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 141 [2019-11-26 02:46:26,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:46:26,946 INFO L225 Difference]: With dead ends: 1371 [2019-11-26 02:46:26,946 INFO L226 Difference]: Without dead ends: 730 [2019-11-26 02:46:26,948 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-26 02:46:26,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 730 states. [2019-11-26 02:46:26,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 730 to 713. [2019-11-26 02:46:26,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 713 states. [2019-11-26 02:46:26,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 713 states to 713 states and 1062 transitions. [2019-11-26 02:46:26,979 INFO L78 Accepts]: Start accepts. Automaton has 713 states and 1062 transitions. Word has length 141 [2019-11-26 02:46:26,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:46:26,980 INFO L462 AbstractCegarLoop]: Abstraction has 713 states and 1062 transitions. [2019-11-26 02:46:26,980 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:46:26,980 INFO L276 IsEmpty]: Start isEmpty. Operand 713 states and 1062 transitions. [2019-11-26 02:46:26,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-11-26 02:46:26,983 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:46:26,983 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:46:26,983 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:46:26,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:46:26,984 INFO L82 PathProgramCache]: Analyzing trace with hash 925217240, now seen corresponding path program 1 times [2019-11-26 02:46:26,984 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:46:26,984 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447763508] [2019-11-26 02:46:26,985 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:46:27,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:46:27,076 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 101 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2019-11-26 02:46:27,077 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447763508] [2019-11-26 02:46:27,077 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:46:27,077 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 02:46:27,077 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137910058] [2019-11-26 02:46:27,078 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:46:27,078 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:46:27,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:46:27,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:46:27,079 INFO L87 Difference]: Start difference. First operand 713 states and 1062 transitions. Second operand 4 states. [2019-11-26 02:46:27,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:46:27,783 INFO L93 Difference]: Finished difference Result 1638 states and 2462 transitions. [2019-11-26 02:46:27,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:46:27,784 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 145 [2019-11-26 02:46:27,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:46:27,789 INFO L225 Difference]: With dead ends: 1638 [2019-11-26 02:46:27,789 INFO L226 Difference]: Without dead ends: 997 [2019-11-26 02:46:27,790 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:46:27,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 997 states. [2019-11-26 02:46:27,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 997 to 784. [2019-11-26 02:46:27,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 784 states. [2019-11-26 02:46:27,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 784 states to 784 states and 1138 transitions. [2019-11-26 02:46:27,809 INFO L78 Accepts]: Start accepts. Automaton has 784 states and 1138 transitions. Word has length 145 [2019-11-26 02:46:27,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:46:27,810 INFO L462 AbstractCegarLoop]: Abstraction has 784 states and 1138 transitions. [2019-11-26 02:46:27,810 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:46:27,810 INFO L276 IsEmpty]: Start isEmpty. Operand 784 states and 1138 transitions. [2019-11-26 02:46:27,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-11-26 02:46:27,812 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:46:27,813 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:46:27,813 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:46:27,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:46:27,813 INFO L82 PathProgramCache]: Analyzing trace with hash -1683939045, now seen corresponding path program 1 times [2019-11-26 02:46:27,813 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:46:27,814 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098725800] [2019-11-26 02:46:27,814 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:46:27,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:46:27,977 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:46:27,978 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098725800] [2019-11-26 02:46:27,978 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:46:27,978 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-26 02:46:27,979 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257185121] [2019-11-26 02:46:27,979 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-26 02:46:27,979 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:46:27,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-26 02:46:27,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-11-26 02:46:27,980 INFO L87 Difference]: Start difference. First operand 784 states and 1138 transitions. Second operand 8 states. [2019-11-26 02:46:28,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:46:28,731 INFO L93 Difference]: Finished difference Result 1742 states and 2534 transitions. [2019-11-26 02:46:28,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-26 02:46:28,731 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 159 [2019-11-26 02:46:28,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:46:28,737 INFO L225 Difference]: With dead ends: 1742 [2019-11-26 02:46:28,737 INFO L226 Difference]: Without dead ends: 1030 [2019-11-26 02:46:28,738 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-11-26 02:46:28,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1030 states. [2019-11-26 02:46:28,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1030 to 926. [2019-11-26 02:46:28,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 926 states. [2019-11-26 02:46:28,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 926 states to 926 states and 1316 transitions. [2019-11-26 02:46:28,762 INFO L78 Accepts]: Start accepts. Automaton has 926 states and 1316 transitions. Word has length 159 [2019-11-26 02:46:28,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:46:28,764 INFO L462 AbstractCegarLoop]: Abstraction has 926 states and 1316 transitions. [2019-11-26 02:46:28,764 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-26 02:46:28,764 INFO L276 IsEmpty]: Start isEmpty. Operand 926 states and 1316 transitions. [2019-11-26 02:46:28,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-11-26 02:46:28,767 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:46:28,767 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:46:28,768 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:46:28,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:46:28,768 INFO L82 PathProgramCache]: Analyzing trace with hash 311594902, now seen corresponding path program 1 times [2019-11-26 02:46:28,768 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:46:28,769 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633575532] [2019-11-26 02:46:28,769 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:46:28,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:46:28,883 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 114 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2019-11-26 02:46:28,884 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633575532] [2019-11-26 02:46:28,884 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:46:28,884 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-26 02:46:28,884 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951736349] [2019-11-26 02:46:28,885 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:46:28,885 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:46:28,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:46:28,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:46:28,886 INFO L87 Difference]: Start difference. First operand 926 states and 1316 transitions. Second operand 4 states. [2019-11-26 02:46:29,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:46:29,444 INFO L93 Difference]: Finished difference Result 2277 states and 3219 transitions. [2019-11-26 02:46:29,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:46:29,444 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 162 [2019-11-26 02:46:29,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:46:29,450 INFO L225 Difference]: With dead ends: 2277 [2019-11-26 02:46:29,450 INFO L226 Difference]: Without dead ends: 1068 [2019-11-26 02:46:29,453 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:46:29,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1068 states. [2019-11-26 02:46:29,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1068 to 926. [2019-11-26 02:46:29,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 926 states. [2019-11-26 02:46:29,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 926 states to 926 states and 1072 transitions. [2019-11-26 02:46:29,476 INFO L78 Accepts]: Start accepts. Automaton has 926 states and 1072 transitions. Word has length 162 [2019-11-26 02:46:29,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:46:29,477 INFO L462 AbstractCegarLoop]: Abstraction has 926 states and 1072 transitions. [2019-11-26 02:46:29,477 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:46:29,477 INFO L276 IsEmpty]: Start isEmpty. Operand 926 states and 1072 transitions. [2019-11-26 02:46:29,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-11-26 02:46:29,480 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:46:29,480 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:46:29,481 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:46:29,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:46:29,481 INFO L82 PathProgramCache]: Analyzing trace with hash -114218229, now seen corresponding path program 1 times [2019-11-26 02:46:29,481 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:46:29,482 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282143310] [2019-11-26 02:46:29,482 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:46:29,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:46:29,678 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 205 proven. 27 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-11-26 02:46:29,679 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282143310] [2019-11-26 02:46:29,682 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [417687174] [2019-11-26 02:46:29,683 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_76d27141-aaa9-4ab7-a47e-17b1e7fb1a25/bin/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-26 02:46:29,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:46:29,806 INFO L255 TraceCheckSpWp]: Trace formula consists of 448 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-26 02:46:29,824 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 02:46:29,897 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 184 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-11-26 02:46:29,897 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 02:46:29,956 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 184 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-11-26 02:46:29,956 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-11-26 02:46:29,957 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [5] total 7 [2019-11-26 02:46:29,957 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404841815] [2019-11-26 02:46:29,958 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-26 02:46:29,958 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:46:29,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-26 02:46:29,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-11-26 02:46:29,958 INFO L87 Difference]: Start difference. First operand 926 states and 1072 transitions. Second operand 3 states. [2019-11-26 02:46:30,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:46:30,195 INFO L93 Difference]: Finished difference Result 926 states and 1072 transitions. [2019-11-26 02:46:30,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 02:46:30,195 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 192 [2019-11-26 02:46:30,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:46:30,196 INFO L225 Difference]: With dead ends: 926 [2019-11-26 02:46:30,196 INFO L226 Difference]: Without dead ends: 0 [2019-11-26 02:46:30,197 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 389 GetRequests, 382 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-11-26 02:46:30,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-26 02:46:30,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-26 02:46:30,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-26 02:46:30,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-26 02:46:30,198 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 192 [2019-11-26 02:46:30,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:46:30,198 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-26 02:46:30,198 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-26 02:46:30,198 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-26 02:46:30,199 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-26 02:46:30,405 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-26 02:46:30,414 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-26 02:46:30,708 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 23 [2019-11-26 02:46:30,819 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 23 [2019-11-26 02:46:30,821 INFO L444 ceAbstractionStarter]: For program point L333(lines 333 390) no Hoare annotation was computed. [2019-11-26 02:46:30,822 INFO L444 ceAbstractionStarter]: For program point L102(lines 102 390) no Hoare annotation was computed. [2019-11-26 02:46:30,822 INFO L444 ceAbstractionStarter]: For program point L268(lines 268 390) no Hoare annotation was computed. [2019-11-26 02:46:30,822 INFO L444 ceAbstractionStarter]: For program point L136(lines 136 390) no Hoare annotation was computed. [2019-11-26 02:46:30,822 INFO L444 ceAbstractionStarter]: For program point L203(lines 203 390) no Hoare annotation was computed. [2019-11-26 02:46:30,822 INFO L444 ceAbstractionStarter]: For program point L72(lines 72 390) no Hoare annotation was computed. [2019-11-26 02:46:30,822 INFO L444 ceAbstractionStarter]: For program point L337(lines 337 390) no Hoare annotation was computed. [2019-11-26 02:46:30,822 INFO L444 ceAbstractionStarter]: For program point L238(lines 238 390) no Hoare annotation was computed. [2019-11-26 02:46:30,822 INFO L444 ceAbstractionStarter]: For program point L173(lines 173 390) no Hoare annotation was computed. [2019-11-26 02:46:30,822 INFO L444 ceAbstractionStarter]: For program point L140(lines 140 390) no Hoare annotation was computed. [2019-11-26 02:46:30,823 INFO L444 ceAbstractionStarter]: For program point L372(lines 372 390) no Hoare annotation was computed. [2019-11-26 02:46:30,823 INFO L444 ceAbstractionStarter]: For program point L306(lines 306 390) no Hoare annotation was computed. [2019-11-26 02:46:30,823 INFO L444 ceAbstractionStarter]: For program point L273(lines 273 390) no Hoare annotation was computed. [2019-11-26 02:46:30,823 INFO L444 ceAbstractionStarter]: For program point L108(lines 108 390) no Hoare annotation was computed. [2019-11-26 02:46:30,823 INFO L444 ceAbstractionStarter]: For program point L208(lines 208 390) no Hoare annotation was computed. [2019-11-26 02:46:30,823 INFO L444 ceAbstractionStarter]: For program point L43(lines 43 390) no Hoare annotation was computed. [2019-11-26 02:46:30,823 INFO L444 ceAbstractionStarter]: For program point L144(lines 144 390) no Hoare annotation was computed. [2019-11-26 02:46:30,824 INFO L440 ceAbstractionStarter]: At program point L574(lines 30 575) the Hoare annotation is: (let ((.cse0 (= ~a21~0 1))) (or (and (<= ~a21~0 0) (= 13 ~a8~0)) (and (not (= ~a16~0 6)) .cse0) (and .cse0 (= 15 ~a8~0)) (and (= ~a17~0 1) .cse0 (= ~a20~0 1)))) [2019-11-26 02:46:30,824 INFO L444 ceAbstractionStarter]: For program point L178(lines 178 390) no Hoare annotation was computed. [2019-11-26 02:46:30,824 INFO L444 ceAbstractionStarter]: For program point L377(lines 377 390) no Hoare annotation was computed. [2019-11-26 02:46:30,824 INFO L444 ceAbstractionStarter]: For program point L278(lines 278 390) no Hoare annotation was computed. [2019-11-26 02:46:30,824 INFO L444 ceAbstractionStarter]: For program point L245(lines 245 390) no Hoare annotation was computed. [2019-11-26 02:46:30,824 INFO L444 ceAbstractionStarter]: For program point L80(lines 80 390) no Hoare annotation was computed. [2019-11-26 02:46:30,824 INFO L444 ceAbstractionStarter]: For program point L345(lines 345 390) no Hoare annotation was computed. [2019-11-26 02:46:30,824 INFO L444 ceAbstractionStarter]: For program point L312(lines 312 390) no Hoare annotation was computed. [2019-11-26 02:46:30,824 INFO L444 ceAbstractionStarter]: For program point L114(lines 114 390) no Hoare annotation was computed. [2019-11-26 02:46:30,825 INFO L447 ceAbstractionStarter]: At program point L577(lines 577 594) the Hoare annotation is: true [2019-11-26 02:46:30,825 INFO L444 ceAbstractionStarter]: For program point L214(lines 214 390) no Hoare annotation was computed. [2019-11-26 02:46:30,825 INFO L444 ceAbstractionStarter]: For program point L148(lines 148 390) no Hoare annotation was computed. [2019-11-26 02:46:30,825 INFO L444 ceAbstractionStarter]: For program point L49(lines 49 390) no Hoare annotation was computed. [2019-11-26 02:46:30,825 INFO L444 ceAbstractionStarter]: For program point L84(lines 84 390) no Hoare annotation was computed. [2019-11-26 02:46:30,825 INFO L444 ceAbstractionStarter]: For program point L382(lines 382 390) no Hoare annotation was computed. [2019-11-26 02:46:30,825 INFO L444 ceAbstractionStarter]: For program point L316(lines 316 390) no Hoare annotation was computed. [2019-11-26 02:46:30,825 INFO L444 ceAbstractionStarter]: For program point L250(lines 250 390) no Hoare annotation was computed. [2019-11-26 02:46:30,825 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-26 02:46:30,825 INFO L444 ceAbstractionStarter]: For program point L218(lines 218 390) no Hoare annotation was computed. [2019-11-26 02:46:30,826 INFO L444 ceAbstractionStarter]: For program point L152(lines 152 390) no Hoare annotation was computed. [2019-11-26 02:46:30,826 INFO L444 ceAbstractionStarter]: For program point L119(lines 119 390) no Hoare annotation was computed. [2019-11-26 02:46:30,826 INFO L444 ceAbstractionStarter]: For program point L318(lines 318 390) no Hoare annotation was computed. [2019-11-26 02:46:30,826 INFO L444 ceAbstractionStarter]: For program point L186(lines 186 390) no Hoare annotation was computed. [2019-11-26 02:46:30,826 INFO L444 ceAbstractionStarter]: For program point L54(lines 54 390) no Hoare annotation was computed. [2019-11-26 02:46:30,826 INFO L440 ceAbstractionStarter]: At program point L583-2(lines 583 593) the Hoare annotation is: (let ((.cse0 (= ~a21~0 1))) (or (and (<= ~a21~0 0) (= 13 ~a8~0)) (and (not (= ~a16~0 6)) .cse0) (and .cse0 (= 15 ~a8~0)) (and (= ~a17~0 1) .cse0 (= ~a20~0 1)))) [2019-11-26 02:46:30,826 INFO L444 ceAbstractionStarter]: For program point L286(lines 286 390) no Hoare annotation was computed. [2019-11-26 02:46:30,826 INFO L444 ceAbstractionStarter]: For program point L353(lines 353 390) no Hoare annotation was computed. [2019-11-26 02:46:30,827 INFO L444 ceAbstractionStarter]: For program point L189(lines 189 390) no Hoare annotation was computed. [2019-11-26 02:46:30,827 INFO L444 ceAbstractionStarter]: For program point L355(lines 355 390) no Hoare annotation was computed. [2019-11-26 02:46:30,827 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-26 02:46:30,827 INFO L444 ceAbstractionStarter]: For program point L256(lines 256 390) no Hoare annotation was computed. [2019-11-26 02:46:30,827 INFO L444 ceAbstractionStarter]: For program point L223(lines 223 390) no Hoare annotation was computed. [2019-11-26 02:46:30,827 INFO L444 ceAbstractionStarter]: For program point L124(lines 124 390) no Hoare annotation was computed. [2019-11-26 02:46:30,827 INFO L444 ceAbstractionStarter]: For program point L92(lines 92 390) no Hoare annotation was computed. [2019-11-26 02:46:30,827 INFO L444 ceAbstractionStarter]: For program point L588(line 588) no Hoare annotation was computed. [2019-11-26 02:46:30,827 INFO L444 ceAbstractionStarter]: For program point L324(lines 324 390) no Hoare annotation was computed. [2019-11-26 02:46:30,827 INFO L444 ceAbstractionStarter]: For program point L556-1(lines 30 575) no Hoare annotation was computed. [2019-11-26 02:46:30,828 INFO L444 ceAbstractionStarter]: For program point L292(lines 292 390) no Hoare annotation was computed. [2019-11-26 02:46:30,828 INFO L444 ceAbstractionStarter]: For program point L160(lines 160 390) no Hoare annotation was computed. [2019-11-26 02:46:30,828 INFO L444 ceAbstractionStarter]: For program point L194(lines 194 390) no Hoare annotation was computed. [2019-11-26 02:46:30,828 INFO L444 ceAbstractionStarter]: For program point L62(lines 62 390) no Hoare annotation was computed. [2019-11-26 02:46:30,828 INFO L444 ceAbstractionStarter]: For program point L261(lines 261 390) no Hoare annotation was computed. [2019-11-26 02:46:30,835 INFO L444 ceAbstractionStarter]: For program point L129(lines 129 390) no Hoare annotation was computed. [2019-11-26 02:46:30,835 INFO L444 ceAbstractionStarter]: For program point L559-1(lines 30 575) no Hoare annotation was computed. [2019-11-26 02:46:30,835 INFO L444 ceAbstractionStarter]: For program point L361(lines 361 390) no Hoare annotation was computed. [2019-11-26 02:46:30,835 INFO L444 ceAbstractionStarter]: For program point L97(lines 97 390) no Hoare annotation was computed. [2019-11-26 02:46:30,836 INFO L444 ceAbstractionStarter]: For program point L31(lines 31 390) no Hoare annotation was computed. [2019-11-26 02:46:30,836 INFO L444 ceAbstractionStarter]: For program point L560(line 560) no Hoare annotation was computed. [2019-11-26 02:46:30,836 INFO L444 ceAbstractionStarter]: For program point L329(lines 329 390) no Hoare annotation was computed. [2019-11-26 02:46:30,836 INFO L444 ceAbstractionStarter]: For program point L197(lines 197 390) no Hoare annotation was computed. [2019-11-26 02:46:30,836 INFO L444 ceAbstractionStarter]: For program point L65(lines 65 390) no Hoare annotation was computed. [2019-11-26 02:46:30,836 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 560) no Hoare annotation was computed. [2019-11-26 02:46:30,837 INFO L444 ceAbstractionStarter]: For program point L363(lines 363 390) no Hoare annotation was computed. [2019-11-26 02:46:30,837 INFO L444 ceAbstractionStarter]: For program point L231(lines 231 390) no Hoare annotation was computed. [2019-11-26 02:46:30,837 INFO L444 ceAbstractionStarter]: For program point L165(lines 165 390) no Hoare annotation was computed. [2019-11-26 02:46:30,837 INFO L444 ceAbstractionStarter]: For program point L265(lines 265 390) no Hoare annotation was computed. [2019-11-26 02:46:30,837 INFO L444 ceAbstractionStarter]: For program point L365(lines 365 390) no Hoare annotation was computed. [2019-11-26 02:46:30,837 INFO L444 ceAbstractionStarter]: For program point L299(lines 299 390) no Hoare annotation was computed. [2019-11-26 02:46:30,837 INFO L444 ceAbstractionStarter]: For program point L35(lines 35 390) no Hoare annotation was computed. [2019-11-26 02:46:30,862 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.11 02:46:30 BoogieIcfgContainer [2019-11-26 02:46:30,862 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-26 02:46:30,862 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-26 02:46:30,862 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-26 02:46:30,863 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-26 02:46:30,863 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 02:46:22" (3/4) ... [2019-11-26 02:46:30,866 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-26 02:46:30,893 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 99 nodes and edges [2019-11-26 02:46:30,894 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 19 nodes and edges [2019-11-26 02:46:30,896 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2019-11-26 02:46:30,898 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-11-26 02:46:31,055 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_76d27141-aaa9-4ab7-a47e-17b1e7fb1a25/bin/utaipan/witness.graphml [2019-11-26 02:46:31,056 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-26 02:46:31,057 INFO L168 Benchmark]: Toolchain (without parser) took 10976.52 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 286.8 MB). Free memory was 939.3 MB in the beginning and 858.4 MB in the end (delta: 81.0 MB). Peak memory consumption was 367.8 MB. Max. memory is 11.5 GB. [2019-11-26 02:46:31,058 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-26 02:46:31,058 INFO L168 Benchmark]: CACSL2BoogieTranslator took 712.55 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.2 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -177.5 MB). Peak memory consumption was 18.7 MB. Max. memory is 11.5 GB. [2019-11-26 02:46:31,058 INFO L168 Benchmark]: Boogie Procedure Inliner took 84.64 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:46:31,059 INFO L168 Benchmark]: Boogie Preprocessor took 57.16 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:46:31,059 INFO L168 Benchmark]: RCFGBuilder took 2036.24 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 893.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:46:31,059 INFO L168 Benchmark]: TraceAbstraction took 7886.58 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 141.6 MB). Free memory was 893.8 MB in the beginning and 878.5 MB in the end (delta: 15.3 MB). Peak memory consumption was 156.8 MB. Max. memory is 11.5 GB. [2019-11-26 02:46:31,060 INFO L168 Benchmark]: Witness Printer took 193.59 ms. Allocated memory is still 1.3 GB. Free memory was 878.5 MB in the beginning and 858.4 MB in the end (delta: 20.1 MB). Peak memory consumption was 20.1 MB. Max. memory is 11.5 GB. [2019-11-26 02:46:31,062 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.21 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 712.55 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.2 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -177.5 MB). Peak memory consumption was 18.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 84.64 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 57.16 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 2036.24 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 893.8 MB in the end (delta: 212.3 MB). Peak memory consumption was 212.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 7886.58 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 141.6 MB). Free memory was 893.8 MB in the beginning and 878.5 MB in the end (delta: 15.3 MB). Peak memory consumption was 156.8 MB. Max. memory is 11.5 GB. * Witness Printer took 193.59 ms. Allocated memory is still 1.3 GB. Free memory was 878.5 MB in the beginning and 858.4 MB in the end (delta: 20.1 MB). Peak memory consumption was 20.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 560]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 30]: Loop Invariant Derived loop invariant: (((a21 <= 0 && 13 == a8) || (!(a16 == 6) && a21 == 1)) || (a21 == 1 && 15 == a8)) || ((a17 == 1 && a21 == 1) && a20 == 1) - InvariantResult [Line: 577]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 583]: Loop Invariant Derived loop invariant: (((a21 <= 0 && 13 == a8) || (!(a16 == 6) && a21 == 1)) || (a21 == 1 && 15 == a8)) || ((a17 == 1 && a21 == 1) && a20 == 1) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 76 locations, 1 error locations. Result: SAFE, OverallTime: 7.8s, OverallIterations: 9, TraceHistogramMax: 6, AutomataDifference: 5.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.4s, HoareTripleCheckerStatistics: 519 SDtfs, 1137 SDslu, 80 SDs, 0 SdLazy, 2986 SolverSat, 744 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 419 GetRequests, 391 SyntacticMatches, 4 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=926occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 9 MinimizatonAttempts, 689 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 42 NumberOfFragments, 67 HoareAnnotationTreeSize, 3 FomulaSimplifications, 8683 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 3 FomulaSimplificationsInter, 582 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 1368 NumberOfCodeBlocks, 1368 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 1549 ConstructedInterpolants, 0 QuantifiedInterpolants, 536643 SizeOfPredicates, 1 NumberOfNonLiveVariables, 448 ConjunctsInSsa, 2 ConjunctsInUnsatCore, 11 InterpolantComputations, 10 PerfectInterpolantSequences, 1736/1763 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...