./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem01_label18.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_979646be-47ab-40cc-b9d8-ac529ca9a89d/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_979646be-47ab-40cc-b9d8-ac529ca9a89d/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_979646be-47ab-40cc-b9d8-ac529ca9a89d/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_979646be-47ab-40cc-b9d8-ac529ca9a89d/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem01_label18.c -s /tmp/vcloud-vcloud-master/worker/run_dir_979646be-47ab-40cc-b9d8-ac529ca9a89d/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_979646be-47ab-40cc-b9d8-ac529ca9a89d/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 eb8eeb6e67f290f9d56e698aa8c9c7a779115813 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:56:41,913 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-26 02:56:41,914 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-26 02:56:41,929 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-26 02:56:41,929 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-26 02:56:41,930 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-26 02:56:41,932 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-26 02:56:41,940 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-26 02:56:41,944 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-26 02:56:41,948 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-26 02:56:41,949 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-26 02:56:41,950 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-26 02:56:41,950 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-26 02:56:41,953 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-26 02:56:41,954 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-26 02:56:41,955 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-26 02:56:41,956 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-26 02:56:41,956 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-26 02:56:41,959 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-26 02:56:41,962 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-26 02:56:41,965 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-26 02:56:41,968 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-26 02:56:41,969 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-26 02:56:41,970 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-26 02:56:41,973 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-26 02:56:41,974 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-26 02:56:41,974 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-26 02:56:41,976 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-26 02:56:41,976 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-26 02:56:41,977 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-26 02:56:41,977 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-26 02:56:41,978 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-26 02:56:41,978 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-26 02:56:41,979 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-26 02:56:41,980 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-26 02:56:41,980 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-26 02:56:41,980 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-26 02:56:41,981 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-26 02:56:41,981 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-26 02:56:41,981 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-26 02:56:41,983 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-26 02:56:41,983 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_979646be-47ab-40cc-b9d8-ac529ca9a89d/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-11-26 02:56:42,002 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-26 02:56:42,009 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-26 02:56:42,009 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-26 02:56:42,010 INFO L138 SettingsManager]: * User list type=DISABLED [2019-11-26 02:56:42,010 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-11-26 02:56:42,010 INFO L138 SettingsManager]: * Explicit value domain=true [2019-11-26 02:56:42,010 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-11-26 02:56:42,010 INFO L138 SettingsManager]: * Octagon Domain=false [2019-11-26 02:56:42,010 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-11-26 02:56:42,011 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-11-26 02:56:42,011 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-11-26 02:56:42,011 INFO L138 SettingsManager]: * Interval Domain=false [2019-11-26 02:56:42,011 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-11-26 02:56:42,011 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-11-26 02:56:42,012 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-11-26 02:56:42,012 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-26 02:56:42,012 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-26 02:56:42,012 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-26 02:56:42,013 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-26 02:56:42,013 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-26 02:56:42,013 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-26 02:56:42,013 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-26 02:56:42,013 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-26 02:56:42,014 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-26 02:56:42,014 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-26 02:56:42,014 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-26 02:56:42,014 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-26 02:56:42,014 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-26 02:56:42,014 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-26 02:56:42,015 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-26 02:56:42,015 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-26 02:56:42,015 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-26 02:56:42,015 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-26 02:56:42,015 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-11-26 02:56:42,016 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-26 02:56:42,016 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-26 02:56:42,016 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-26 02:56:42,016 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_979646be-47ab-40cc-b9d8-ac529ca9a89d/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 -> eb8eeb6e67f290f9d56e698aa8c9c7a779115813 [2019-11-26 02:56:42,147 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-26 02:56:42,161 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-26 02:56:42,164 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-26 02:56:42,166 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-26 02:56:42,166 INFO L275 PluginConnector]: CDTParser initialized [2019-11-26 02:56:42,167 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_979646be-47ab-40cc-b9d8-ac529ca9a89d/bin/utaipan/../../sv-benchmarks/c/eca-rers2012/Problem01_label18.c [2019-11-26 02:56:42,221 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_979646be-47ab-40cc-b9d8-ac529ca9a89d/bin/utaipan/data/01b8f6d87/95b1a46627ad4faca99a64eec7b1f1f0/FLAGf95c30568 [2019-11-26 02:56:42,752 INFO L306 CDTParser]: Found 1 translation units. [2019-11-26 02:56:42,752 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_979646be-47ab-40cc-b9d8-ac529ca9a89d/sv-benchmarks/c/eca-rers2012/Problem01_label18.c [2019-11-26 02:56:42,764 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_979646be-47ab-40cc-b9d8-ac529ca9a89d/bin/utaipan/data/01b8f6d87/95b1a46627ad4faca99a64eec7b1f1f0/FLAGf95c30568 [2019-11-26 02:56:43,235 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_979646be-47ab-40cc-b9d8-ac529ca9a89d/bin/utaipan/data/01b8f6d87/95b1a46627ad4faca99a64eec7b1f1f0 [2019-11-26 02:56:43,237 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-26 02:56:43,238 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-26 02:56:43,239 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-26 02:56:43,239 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-26 02:56:43,243 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-26 02:56:43,243 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 02:56:43" (1/1) ... [2019-11-26 02:56:43,246 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35ac5180 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:56:43, skipping insertion in model container [2019-11-26 02:56:43,246 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 02:56:43" (1/1) ... [2019-11-26 02:56:43,253 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-26 02:56:43,306 INFO L179 MainTranslator]: Built tables and reachable declarations [2019-11-26 02:56:43,698 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-26 02:56:43,702 INFO L201 MainTranslator]: Completed pre-run [2019-11-26 02:56:43,821 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-26 02:56:43,841 INFO L205 MainTranslator]: Completed translation [2019-11-26 02:56:43,842 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:56:43 WrapperNode [2019-11-26 02:56:43,842 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-26 02:56:43,843 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-26 02:56:43,843 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-26 02:56:43,843 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-26 02:56:43,851 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:56:43" (1/1) ... [2019-11-26 02:56:43,877 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:56:43" (1/1) ... [2019-11-26 02:56:43,930 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-26 02:56:43,930 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-26 02:56:43,930 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-26 02:56:43,930 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-26 02:56:43,940 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:56:43" (1/1) ... [2019-11-26 02:56:43,940 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:56:43" (1/1) ... [2019-11-26 02:56:43,947 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:56:43" (1/1) ... [2019-11-26 02:56:43,948 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:56:43" (1/1) ... [2019-11-26 02:56:43,978 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:56:43" (1/1) ... [2019-11-26 02:56:44,000 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:56:43" (1/1) ... [2019-11-26 02:56:44,005 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:56:43" (1/1) ... [2019-11-26 02:56:44,011 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-26 02:56:44,012 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-26 02:56:44,012 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-26 02:56:44,012 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-26 02:56:44,013 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:56:43" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_979646be-47ab-40cc-b9d8-ac529ca9a89d/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:56:44,078 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-26 02:56:44,080 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-26 02:56:45,992 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-26 02:56:45,992 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-26 02:56:45,994 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 02:56:45 BoogieIcfgContainer [2019-11-26 02:56:45,994 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-26 02:56:45,995 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-26 02:56:45,995 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-26 02:56:45,998 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-26 02:56:45,998 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.11 02:56:43" (1/3) ... [2019-11-26 02:56:45,999 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b3ea82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 02:56:45, skipping insertion in model container [2019-11-26 02:56:45,999 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:56:43" (2/3) ... [2019-11-26 02:56:45,999 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b3ea82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 02:56:45, skipping insertion in model container [2019-11-26 02:56:46,000 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 02:56:45" (3/3) ... [2019-11-26 02:56:46,002 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem01_label18.c [2019-11-26 02:56:46,011 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-26 02:56:46,017 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-26 02:56:46,028 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-26 02:56:46,056 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-26 02:56:46,057 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-26 02:56:46,057 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-26 02:56:46,057 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-26 02:56:46,057 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-26 02:56:46,057 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-26 02:56:46,058 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-26 02:56:46,058 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-26 02:56:46,078 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states. [2019-11-26 02:56:46,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-11-26 02:56:46,088 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:56:46,089 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:56:46,090 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:56:46,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:56:46,095 INFO L82 PathProgramCache]: Analyzing trace with hash -1323242527, now seen corresponding path program 1 times [2019-11-26 02:56:46,105 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:56:46,105 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401542265] [2019-11-26 02:56:46,106 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:56:46,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:56:46,564 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:56:46,565 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401542265] [2019-11-26 02:56:46,566 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:56:46,566 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 02:56:46,568 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108419361] [2019-11-26 02:56:46,574 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:56:46,574 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:56:46,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:56:46,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:56:46,590 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 4 states. [2019-11-26 02:56:47,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:56:47,465 INFO L93 Difference]: Finished difference Result 297 states and 569 transitions. [2019-11-26 02:56:47,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:56:47,467 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 71 [2019-11-26 02:56:47,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:56:47,481 INFO L225 Difference]: With dead ends: 297 [2019-11-26 02:56:47,481 INFO L226 Difference]: Without dead ends: 216 [2019-11-26 02:56:47,485 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:56:47,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2019-11-26 02:56:47,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 145. [2019-11-26 02:56:47,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2019-11-26 02:56:47,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 259 transitions. [2019-11-26 02:56:47,538 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 259 transitions. Word has length 71 [2019-11-26 02:56:47,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:56:47,539 INFO L462 AbstractCegarLoop]: Abstraction has 145 states and 259 transitions. [2019-11-26 02:56:47,539 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:56:47,539 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 259 transitions. [2019-11-26 02:56:47,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-11-26 02:56:47,542 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:56:47,543 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:56:47,543 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:56:47,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:56:47,543 INFO L82 PathProgramCache]: Analyzing trace with hash -1048395148, now seen corresponding path program 1 times [2019-11-26 02:56:47,543 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:56:47,544 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116256419] [2019-11-26 02:56:47,544 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:56:47,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:56:47,608 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:56:47,610 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116256419] [2019-11-26 02:56:47,610 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:56:47,610 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 02:56:47,611 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153219805] [2019-11-26 02:56:47,613 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:56:47,614 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:56:47,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:56:47,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:56:47,615 INFO L87 Difference]: Start difference. First operand 145 states and 259 transitions. Second operand 4 states. [2019-11-26 02:56:48,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:56:48,252 INFO L93 Difference]: Finished difference Result 573 states and 1031 transitions. [2019-11-26 02:56:48,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:56:48,252 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 77 [2019-11-26 02:56:48,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:56:48,257 INFO L225 Difference]: With dead ends: 573 [2019-11-26 02:56:48,257 INFO L226 Difference]: Without dead ends: 429 [2019-11-26 02:56:48,258 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:56:48,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2019-11-26 02:56:48,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 429. [2019-11-26 02:56:48,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 429 states. [2019-11-26 02:56:48,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 707 transitions. [2019-11-26 02:56:48,302 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 707 transitions. Word has length 77 [2019-11-26 02:56:48,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:56:48,302 INFO L462 AbstractCegarLoop]: Abstraction has 429 states and 707 transitions. [2019-11-26 02:56:48,302 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:56:48,302 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 707 transitions. [2019-11-26 02:56:48,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-11-26 02:56:48,308 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:56:48,308 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:56:48,308 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:56:48,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:56:48,309 INFO L82 PathProgramCache]: Analyzing trace with hash -2123299820, now seen corresponding path program 1 times [2019-11-26 02:56:48,309 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:56:48,309 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27408749] [2019-11-26 02:56:48,313 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:56:48,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:56:48,455 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-26 02:56:48,456 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27408749] [2019-11-26 02:56:48,457 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:56:48,457 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-26 02:56:48,457 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565634335] [2019-11-26 02:56:48,458 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-26 02:56:48,458 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:56:48,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-26 02:56:48,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:56:48,458 INFO L87 Difference]: Start difference. First operand 429 states and 707 transitions. Second operand 3 states. [2019-11-26 02:56:48,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:56:48,839 INFO L93 Difference]: Finished difference Result 1212 states and 1980 transitions. [2019-11-26 02:56:48,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 02:56:48,839 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 78 [2019-11-26 02:56:48,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:56:48,844 INFO L225 Difference]: With dead ends: 1212 [2019-11-26 02:56:48,845 INFO L226 Difference]: Without dead ends: 784 [2019-11-26 02:56:48,849 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:56:48,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 784 states. [2019-11-26 02:56:48,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 784 to 642. [2019-11-26 02:56:48,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 642 states. [2019-11-26 02:56:48,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 955 transitions. [2019-11-26 02:56:48,901 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 955 transitions. Word has length 78 [2019-11-26 02:56:48,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:56:48,903 INFO L462 AbstractCegarLoop]: Abstraction has 642 states and 955 transitions. [2019-11-26 02:56:48,904 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-26 02:56:48,904 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 955 transitions. [2019-11-26 02:56:48,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-11-26 02:56:48,918 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:56:48,919 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:56:48,919 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:56:48,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:56:48,920 INFO L82 PathProgramCache]: Analyzing trace with hash 2133654126, now seen corresponding path program 1 times [2019-11-26 02:56:48,920 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:56:48,920 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754701739] [2019-11-26 02:56:48,920 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:56:48,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:56:48,996 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-26 02:56:48,997 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754701739] [2019-11-26 02:56:48,998 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:56:48,998 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-26 02:56:48,998 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441787368] [2019-11-26 02:56:48,999 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-26 02:56:49,000 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:56:49,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-26 02:56:49,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:56:49,001 INFO L87 Difference]: Start difference. First operand 642 states and 955 transitions. Second operand 3 states. [2019-11-26 02:56:49,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:56:49,387 INFO L93 Difference]: Finished difference Result 1496 states and 2249 transitions. [2019-11-26 02:56:49,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 02:56:49,388 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 94 [2019-11-26 02:56:49,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:56:49,393 INFO L225 Difference]: With dead ends: 1496 [2019-11-26 02:56:49,393 INFO L226 Difference]: Without dead ends: 855 [2019-11-26 02:56:49,395 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:56:49,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 855 states. [2019-11-26 02:56:49,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 855 to 713. [2019-11-26 02:56:49,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 713 states. [2019-11-26 02:56:49,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 713 states to 713 states and 1057 transitions. [2019-11-26 02:56:49,429 INFO L78 Accepts]: Start accepts. Automaton has 713 states and 1057 transitions. Word has length 94 [2019-11-26 02:56:49,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:56:49,430 INFO L462 AbstractCegarLoop]: Abstraction has 713 states and 1057 transitions. [2019-11-26 02:56:49,430 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-26 02:56:49,431 INFO L276 IsEmpty]: Start isEmpty. Operand 713 states and 1057 transitions. [2019-11-26 02:56:49,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-11-26 02:56:49,436 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:56:49,436 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:56:49,436 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:56:49,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:56:49,437 INFO L82 PathProgramCache]: Analyzing trace with hash 501973457, now seen corresponding path program 1 times [2019-11-26 02:56:49,437 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:56:49,437 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104341319] [2019-11-26 02:56:49,437 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:56:49,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:56:49,512 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-11-26 02:56:49,512 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104341319] [2019-11-26 02:56:49,513 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:56:49,513 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-26 02:56:49,513 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603626122] [2019-11-26 02:56:49,513 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-26 02:56:49,514 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:56:49,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-26 02:56:49,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:56:49,514 INFO L87 Difference]: Start difference. First operand 713 states and 1057 transitions. Second operand 3 states. [2019-11-26 02:56:49,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:56:49,956 INFO L93 Difference]: Finished difference Result 1780 states and 2618 transitions. [2019-11-26 02:56:49,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 02:56:49,956 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 105 [2019-11-26 02:56:49,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:56:49,962 INFO L225 Difference]: With dead ends: 1780 [2019-11-26 02:56:49,962 INFO L226 Difference]: Without dead ends: 1068 [2019-11-26 02:56:49,964 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:56:49,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1068 states. [2019-11-26 02:56:49,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1068 to 855. [2019-11-26 02:56:49,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 855 states. [2019-11-26 02:56:49,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 855 states to 855 states and 1241 transitions. [2019-11-26 02:56:49,991 INFO L78 Accepts]: Start accepts. Automaton has 855 states and 1241 transitions. Word has length 105 [2019-11-26 02:56:49,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:56:49,991 INFO L462 AbstractCegarLoop]: Abstraction has 855 states and 1241 transitions. [2019-11-26 02:56:49,991 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-26 02:56:49,991 INFO L276 IsEmpty]: Start isEmpty. Operand 855 states and 1241 transitions. [2019-11-26 02:56:49,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-11-26 02:56:49,994 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:56:49,994 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 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:56:49,994 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:56:49,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:56:49,994 INFO L82 PathProgramCache]: Analyzing trace with hash -1784768667, now seen corresponding path program 1 times [2019-11-26 02:56:49,994 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:56:49,995 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663167872] [2019-11-26 02:56:49,995 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:56:50,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:56:50,104 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-11-26 02:56:50,107 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663167872] [2019-11-26 02:56:50,108 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:56:50,108 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 02:56:50,108 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773650792] [2019-11-26 02:56:50,108 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:56:50,109 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:56:50,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:56:50,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:56:50,110 INFO L87 Difference]: Start difference. First operand 855 states and 1241 transitions. Second operand 4 states. [2019-11-26 02:56:50,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:56:50,611 INFO L93 Difference]: Finished difference Result 1809 states and 2593 transitions. [2019-11-26 02:56:50,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-26 02:56:50,612 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 113 [2019-11-26 02:56:50,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:56:50,617 INFO L225 Difference]: With dead ends: 1809 [2019-11-26 02:56:50,617 INFO L226 Difference]: Without dead ends: 955 [2019-11-26 02:56:50,618 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:56:50,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 955 states. [2019-11-26 02:56:50,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 955 to 926. [2019-11-26 02:56:50,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 926 states. [2019-11-26 02:56:50,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 926 states to 926 states and 1318 transitions. [2019-11-26 02:56:50,647 INFO L78 Accepts]: Start accepts. Automaton has 926 states and 1318 transitions. Word has length 113 [2019-11-26 02:56:50,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:56:50,650 INFO L462 AbstractCegarLoop]: Abstraction has 926 states and 1318 transitions. [2019-11-26 02:56:50,651 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:56:50,651 INFO L276 IsEmpty]: Start isEmpty. Operand 926 states and 1318 transitions. [2019-11-26 02:56:50,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-11-26 02:56:50,653 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:56:50,654 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 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:56:50,654 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:56:50,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:56:50,655 INFO L82 PathProgramCache]: Analyzing trace with hash 509269917, now seen corresponding path program 1 times [2019-11-26 02:56:50,655 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:56:50,656 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351448249] [2019-11-26 02:56:50,663 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:56:50,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:56:50,748 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-11-26 02:56:50,748 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351448249] [2019-11-26 02:56:50,749 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:56:50,749 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 02:56:50,749 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442412497] [2019-11-26 02:56:50,749 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:56:50,750 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:56:50,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:56:50,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:56:50,751 INFO L87 Difference]: Start difference. First operand 926 states and 1318 transitions. Second operand 4 states. [2019-11-26 02:56:51,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:56:51,258 INFO L93 Difference]: Finished difference Result 1780 states and 2558 transitions. [2019-11-26 02:56:51,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:56:51,259 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 117 [2019-11-26 02:56:51,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:56:51,264 INFO L225 Difference]: With dead ends: 1780 [2019-11-26 02:56:51,264 INFO L226 Difference]: Without dead ends: 926 [2019-11-26 02:56:51,265 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:56:51,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 926 states. [2019-11-26 02:56:51,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 926 to 926. [2019-11-26 02:56:51,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 926 states. [2019-11-26 02:56:51,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 926 states to 926 states and 1312 transitions. [2019-11-26 02:56:51,289 INFO L78 Accepts]: Start accepts. Automaton has 926 states and 1312 transitions. Word has length 117 [2019-11-26 02:56:51,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:56:51,290 INFO L462 AbstractCegarLoop]: Abstraction has 926 states and 1312 transitions. [2019-11-26 02:56:51,290 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:56:51,290 INFO L276 IsEmpty]: Start isEmpty. Operand 926 states and 1312 transitions. [2019-11-26 02:56:51,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-11-26 02:56:51,295 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:56:51,295 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:51,295 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:56:51,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:56:51,296 INFO L82 PathProgramCache]: Analyzing trace with hash 1638316384, now seen corresponding path program 1 times [2019-11-26 02:56:51,296 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:56:51,296 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043718606] [2019-11-26 02:56:51,296 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:56:51,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:56:51,454 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2019-11-26 02:56:51,454 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043718606] [2019-11-26 02:56:51,454 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:56:51,454 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-26 02:56:51,455 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187337989] [2019-11-26 02:56:51,455 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-26 02:56:51,455 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:56:51,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-26 02:56:51,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-26 02:56:51,456 INFO L87 Difference]: Start difference. First operand 926 states and 1312 transitions. Second operand 6 states. [2019-11-26 02:56:52,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:56:52,207 INFO L93 Difference]: Finished difference Result 2067 states and 2917 transitions. [2019-11-26 02:56:52,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-26 02:56:52,207 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 131 [2019-11-26 02:56:52,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:56:52,213 INFO L225 Difference]: With dead ends: 2067 [2019-11-26 02:56:52,214 INFO L226 Difference]: Without dead ends: 1213 [2019-11-26 02:56:52,215 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-11-26 02:56:52,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1213 states. [2019-11-26 02:56:52,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1213 to 1068. [2019-11-26 02:56:52,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1068 states. [2019-11-26 02:56:52,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1068 states to 1068 states and 1466 transitions. [2019-11-26 02:56:52,246 INFO L78 Accepts]: Start accepts. Automaton has 1068 states and 1466 transitions. Word has length 131 [2019-11-26 02:56:52,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:56:52,247 INFO L462 AbstractCegarLoop]: Abstraction has 1068 states and 1466 transitions. [2019-11-26 02:56:52,247 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-26 02:56:52,247 INFO L276 IsEmpty]: Start isEmpty. Operand 1068 states and 1466 transitions. [2019-11-26 02:56:52,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-11-26 02:56:52,250 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:56:52,251 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 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] [2019-11-26 02:56:52,251 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:56:52,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:56:52,252 INFO L82 PathProgramCache]: Analyzing trace with hash 1291918939, now seen corresponding path program 1 times [2019-11-26 02:56:52,252 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:56:52,252 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991116487] [2019-11-26 02:56:52,252 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:56:52,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:56:52,353 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-11-26 02:56:52,353 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991116487] [2019-11-26 02:56:52,353 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:56:52,353 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-26 02:56:52,354 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864599381] [2019-11-26 02:56:52,354 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:56:52,354 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:56:52,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:56:52,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:56:52,355 INFO L87 Difference]: Start difference. First operand 1068 states and 1466 transitions. Second operand 4 states. [2019-11-26 02:56:52,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:56:52,849 INFO L93 Difference]: Finished difference Result 2845 states and 3883 transitions. [2019-11-26 02:56:52,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:56:52,849 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 134 [2019-11-26 02:56:52,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:56:52,855 INFO L225 Difference]: With dead ends: 2845 [2019-11-26 02:56:52,856 INFO L226 Difference]: Without dead ends: 1352 [2019-11-26 02:56:52,857 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:56:52,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1352 states. [2019-11-26 02:56:52,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1352 to 1139. [2019-11-26 02:56:52,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1139 states. [2019-11-26 02:56:52,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1139 states to 1139 states and 1313 transitions. [2019-11-26 02:56:52,887 INFO L78 Accepts]: Start accepts. Automaton has 1139 states and 1313 transitions. Word has length 134 [2019-11-26 02:56:52,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:56:52,887 INFO L462 AbstractCegarLoop]: Abstraction has 1139 states and 1313 transitions. [2019-11-26 02:56:52,887 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:56:52,887 INFO L276 IsEmpty]: Start isEmpty. Operand 1139 states and 1313 transitions. [2019-11-26 02:56:52,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-11-26 02:56:52,890 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:56:52,891 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:56:52,891 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:56:52,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:56:52,891 INFO L82 PathProgramCache]: Analyzing trace with hash 2055474000, now seen corresponding path program 1 times [2019-11-26 02:56:52,891 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:56:52,892 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345634075] [2019-11-26 02:56:52,892 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:56:52,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:56:53,030 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 139 proven. 27 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-26 02:56:53,031 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345634075] [2019-11-26 02:56:53,031 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [599492692] [2019-11-26 02:56:53,031 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_979646be-47ab-40cc-b9d8-ac529ca9a89d/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:56:53,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:56:53,134 INFO L255 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-26 02:56:53,143 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 02:56:53,202 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 92 proven. 0 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2019-11-26 02:56:53,202 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 02:56:53,240 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 92 proven. 0 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2019-11-26 02:56:53,241 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-11-26 02:56:53,241 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [5] total 7 [2019-11-26 02:56:53,241 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060676774] [2019-11-26 02:56:53,242 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-26 02:56:53,243 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:56:53,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-26 02:56:53,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-11-26 02:56:53,244 INFO L87 Difference]: Start difference. First operand 1139 states and 1313 transitions. Second operand 3 states. [2019-11-26 02:56:53,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:56:53,510 INFO L93 Difference]: Finished difference Result 1141 states and 1314 transitions. [2019-11-26 02:56:53,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 02:56:53,510 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 164 [2019-11-26 02:56:53,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:56:53,516 INFO L225 Difference]: With dead ends: 1141 [2019-11-26 02:56:53,516 INFO L226 Difference]: Without dead ends: 1139 [2019-11-26 02:56:53,517 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 333 GetRequests, 326 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:56:53,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1139 states. [2019-11-26 02:56:53,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1139 to 997. [2019-11-26 02:56:53,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 997 states. [2019-11-26 02:56:53,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 997 states to 997 states and 1130 transitions. [2019-11-26 02:56:53,546 INFO L78 Accepts]: Start accepts. Automaton has 997 states and 1130 transitions. Word has length 164 [2019-11-26 02:56:53,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:56:53,546 INFO L462 AbstractCegarLoop]: Abstraction has 997 states and 1130 transitions. [2019-11-26 02:56:53,546 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-26 02:56:53,546 INFO L276 IsEmpty]: Start isEmpty. Operand 997 states and 1130 transitions. [2019-11-26 02:56:53,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2019-11-26 02:56:53,550 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:56:53,550 INFO L410 BasicCegarLoop]: trace histogram [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, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:56:53,766 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-26 02:56:53,766 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:56:53,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:56:53,767 INFO L82 PathProgramCache]: Analyzing trace with hash 317706789, now seen corresponding path program 1 times [2019-11-26 02:56:53,767 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:56:53,767 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758637306] [2019-11-26 02:56:53,767 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:56:53,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:56:54,636 INFO L134 CoverageAnalysis]: Checked inductivity of 227 backedges. 216 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-26 02:56:54,636 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758637306] [2019-11-26 02:56:54,636 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:56:54,636 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-11-26 02:56:54,636 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145049216] [2019-11-26 02:56:54,637 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-26 02:56:54,637 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:56:54,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-26 02:56:54,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=77, Unknown=0, NotChecked=0, Total=132 [2019-11-26 02:56:54,637 INFO L87 Difference]: Start difference. First operand 997 states and 1130 transitions. Second operand 12 states. [2019-11-26 02:56:55,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:56:55,509 INFO L93 Difference]: Finished difference Result 2051 states and 2348 transitions. [2019-11-26 02:56:55,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-26 02:56:55,509 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 206 [2019-11-26 02:56:55,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:56:55,515 INFO L225 Difference]: With dead ends: 2051 [2019-11-26 02:56:55,515 INFO L226 Difference]: Without dead ends: 1126 [2019-11-26 02:56:55,517 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=115, Invalid=157, Unknown=0, NotChecked=0, Total=272 [2019-11-26 02:56:55,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1126 states. [2019-11-26 02:56:55,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1126 to 1055. [2019-11-26 02:56:55,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1055 states. [2019-11-26 02:56:55,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1055 states to 1055 states and 1191 transitions. [2019-11-26 02:56:55,544 INFO L78 Accepts]: Start accepts. Automaton has 1055 states and 1191 transitions. Word has length 206 [2019-11-26 02:56:55,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:56:55,544 INFO L462 AbstractCegarLoop]: Abstraction has 1055 states and 1191 transitions. [2019-11-26 02:56:55,544 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-26 02:56:55,545 INFO L276 IsEmpty]: Start isEmpty. Operand 1055 states and 1191 transitions. [2019-11-26 02:56:55,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2019-11-26 02:56:55,548 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:56:55,549 INFO L410 BasicCegarLoop]: trace histogram [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, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:56:55,549 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:56:55,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:56:55,550 INFO L82 PathProgramCache]: Analyzing trace with hash 408539634, now seen corresponding path program 1 times [2019-11-26 02:56:55,550 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:56:55,550 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067111185] [2019-11-26 02:56:55,550 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:56:55,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:56:55,737 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 219 proven. 0 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2019-11-26 02:56:55,738 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067111185] [2019-11-26 02:56:55,738 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:56:55,738 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-26 02:56:55,738 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947468218] [2019-11-26 02:56:55,738 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-26 02:56:55,739 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:56:55,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-26 02:56:55,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-26 02:56:55,739 INFO L87 Difference]: Start difference. First operand 1055 states and 1191 transitions. Second operand 6 states. [2019-11-26 02:56:56,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:56:56,211 INFO L93 Difference]: Finished difference Result 2218 states and 2512 transitions. [2019-11-26 02:56:56,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-26 02:56:56,212 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 233 [2019-11-26 02:56:56,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:56:56,218 INFO L225 Difference]: With dead ends: 2218 [2019-11-26 02:56:56,218 INFO L226 Difference]: Without dead ends: 1235 [2019-11-26 02:56:56,219 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:56:56,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1235 states. [2019-11-26 02:56:56,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1235 to 1126. [2019-11-26 02:56:56,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1126 states. [2019-11-26 02:56:56,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1126 states to 1126 states and 1257 transitions. [2019-11-26 02:56:56,246 INFO L78 Accepts]: Start accepts. Automaton has 1126 states and 1257 transitions. Word has length 233 [2019-11-26 02:56:56,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:56:56,247 INFO L462 AbstractCegarLoop]: Abstraction has 1126 states and 1257 transitions. [2019-11-26 02:56:56,247 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-26 02:56:56,247 INFO L276 IsEmpty]: Start isEmpty. Operand 1126 states and 1257 transitions. [2019-11-26 02:56:56,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2019-11-26 02:56:56,251 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:56:56,255 INFO L410 BasicCegarLoop]: trace histogram [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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:56:56,256 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:56:56,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:56:56,256 INFO L82 PathProgramCache]: Analyzing trace with hash 1767805751, now seen corresponding path program 1 times [2019-11-26 02:56:56,256 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:56:56,257 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828663106] [2019-11-26 02:56:56,257 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:56:56,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:56:56,439 INFO L134 CoverageAnalysis]: Checked inductivity of 327 backedges. 172 proven. 0 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2019-11-26 02:56:56,439 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828663106] [2019-11-26 02:56:56,439 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:56:56,440 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-26 02:56:56,440 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607370849] [2019-11-26 02:56:56,440 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:56:56,441 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:56:56,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:56:56,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:56:56,445 INFO L87 Difference]: Start difference. First operand 1126 states and 1257 transitions. Second operand 4 states. [2019-11-26 02:56:56,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:56:56,789 INFO L93 Difference]: Finished difference Result 2249 states and 2526 transitions. [2019-11-26 02:56:56,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 02:56:56,790 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 244 [2019-11-26 02:56:56,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:56:56,791 INFO L225 Difference]: With dead ends: 2249 [2019-11-26 02:56:56,791 INFO L226 Difference]: Without dead ends: 0 [2019-11-26 02:56:56,793 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:56:56,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-26 02:56:56,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-26 02:56:56,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-26 02:56:56,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-26 02:56:56,793 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 244 [2019-11-26 02:56:56,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:56:56,794 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-26 02:56:56,794 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:56:56,794 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-26 02:56:56,794 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-26 02:56:56,798 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-26 02:56:56,924 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 170 DAG size of output: 90 [2019-11-26 02:56:57,094 WARN L192 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 174 DAG size of output: 89 [2019-11-26 02:56:57,335 WARN L192 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 36 [2019-11-26 02:56:57,593 WARN L192 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 36 [2019-11-26 02:56:57,595 INFO L444 ceAbstractionStarter]: For program point L333(lines 333 390) no Hoare annotation was computed. [2019-11-26 02:56:57,595 INFO L444 ceAbstractionStarter]: For program point L102(lines 102 390) no Hoare annotation was computed. [2019-11-26 02:56:57,596 INFO L444 ceAbstractionStarter]: For program point L268(lines 268 390) no Hoare annotation was computed. [2019-11-26 02:56:57,596 INFO L444 ceAbstractionStarter]: For program point L136(lines 136 390) no Hoare annotation was computed. [2019-11-26 02:56:57,596 INFO L444 ceAbstractionStarter]: For program point L203(lines 203 390) no Hoare annotation was computed. [2019-11-26 02:56:57,596 INFO L444 ceAbstractionStarter]: For program point L72(lines 72 390) no Hoare annotation was computed. [2019-11-26 02:56:57,596 INFO L444 ceAbstractionStarter]: For program point L337(lines 337 390) no Hoare annotation was computed. [2019-11-26 02:56:57,596 INFO L444 ceAbstractionStarter]: For program point L238(lines 238 390) no Hoare annotation was computed. [2019-11-26 02:56:57,596 INFO L444 ceAbstractionStarter]: For program point L173(lines 173 390) no Hoare annotation was computed. [2019-11-26 02:56:57,596 INFO L444 ceAbstractionStarter]: For program point L140(lines 140 390) no Hoare annotation was computed. [2019-11-26 02:56:57,596 INFO L444 ceAbstractionStarter]: For program point L372(lines 372 390) no Hoare annotation was computed. [2019-11-26 02:56:57,596 INFO L444 ceAbstractionStarter]: For program point L306(lines 306 390) no Hoare annotation was computed. [2019-11-26 02:56:57,596 INFO L444 ceAbstractionStarter]: For program point L273(lines 273 390) no Hoare annotation was computed. [2019-11-26 02:56:57,596 INFO L444 ceAbstractionStarter]: For program point L108(lines 108 390) no Hoare annotation was computed. [2019-11-26 02:56:57,596 INFO L444 ceAbstractionStarter]: For program point L472-1(lines 30 575) no Hoare annotation was computed. [2019-11-26 02:56:57,597 INFO L444 ceAbstractionStarter]: For program point L208(lines 208 390) no Hoare annotation was computed. [2019-11-26 02:56:57,597 INFO L444 ceAbstractionStarter]: For program point L43(lines 43 390) no Hoare annotation was computed. [2019-11-26 02:56:57,597 INFO L444 ceAbstractionStarter]: For program point L144(lines 144 390) no Hoare annotation was computed. [2019-11-26 02:56:57,597 INFO L440 ceAbstractionStarter]: At program point L574(lines 30 575) the Hoare annotation is: (let ((.cse6 (= 15 ~a8~0))) (let ((.cse2 (<= ~a17~0 0)) (.cse7 (= 13 ~a8~0)) (.cse1 (not (= ~a16~0 6))) (.cse0 (not .cse6)) (.cse8 (= ~a20~0 1)) (.cse4 (not (= 1 ~a7~0))) (.cse9 (= ~a17~0 1)) (.cse5 (= ~a12~0 8)) (.cse3 (= ~a21~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse2 .cse3 .cse6) (and .cse1 .cse2 .cse5 .cse3) (and .cse7 .cse8) (and .cse0 .cse4 .cse3 (= ~a16~0 5)) (and .cse7 .cse1 .cse9 .cse5) (and .cse0 .cse3 .cse8) (and .cse4 .cse9 .cse5 .cse3 .cse6)))) [2019-11-26 02:56:57,597 INFO L444 ceAbstractionStarter]: For program point L475-1(lines 30 575) no Hoare annotation was computed. [2019-11-26 02:56:57,597 INFO L444 ceAbstractionStarter]: For program point L178(lines 178 390) no Hoare annotation was computed. [2019-11-26 02:56:57,597 INFO L444 ceAbstractionStarter]: For program point L476(line 476) no Hoare annotation was computed. [2019-11-26 02:56:57,599 INFO L444 ceAbstractionStarter]: For program point L377(lines 377 390) no Hoare annotation was computed. [2019-11-26 02:56:57,599 INFO L444 ceAbstractionStarter]: For program point L278(lines 278 390) no Hoare annotation was computed. [2019-11-26 02:56:57,599 INFO L444 ceAbstractionStarter]: For program point L245(lines 245 390) no Hoare annotation was computed. [2019-11-26 02:56:57,600 INFO L444 ceAbstractionStarter]: For program point L80(lines 80 390) no Hoare annotation was computed. [2019-11-26 02:56:57,600 INFO L444 ceAbstractionStarter]: For program point L345(lines 345 390) no Hoare annotation was computed. [2019-11-26 02:56:57,600 INFO L444 ceAbstractionStarter]: For program point L312(lines 312 390) no Hoare annotation was computed. [2019-11-26 02:56:57,600 INFO L444 ceAbstractionStarter]: For program point L114(lines 114 390) no Hoare annotation was computed. [2019-11-26 02:56:57,600 INFO L447 ceAbstractionStarter]: At program point L577(lines 577 594) the Hoare annotation is: true [2019-11-26 02:56:57,600 INFO L444 ceAbstractionStarter]: For program point L214(lines 214 390) no Hoare annotation was computed. [2019-11-26 02:56:57,601 INFO L444 ceAbstractionStarter]: For program point L148(lines 148 390) no Hoare annotation was computed. [2019-11-26 02:56:57,601 INFO L444 ceAbstractionStarter]: For program point L49(lines 49 390) no Hoare annotation was computed. [2019-11-26 02:56:57,601 INFO L444 ceAbstractionStarter]: For program point L84(lines 84 390) no Hoare annotation was computed. [2019-11-26 02:56:57,601 INFO L444 ceAbstractionStarter]: For program point L382(lines 382 390) no Hoare annotation was computed. [2019-11-26 02:56:57,601 INFO L444 ceAbstractionStarter]: For program point L316(lines 316 390) no Hoare annotation was computed. [2019-11-26 02:56:57,601 INFO L444 ceAbstractionStarter]: For program point L250(lines 250 390) no Hoare annotation was computed. [2019-11-26 02:56:57,601 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-26 02:56:57,601 INFO L444 ceAbstractionStarter]: For program point L218(lines 218 390) no Hoare annotation was computed. [2019-11-26 02:56:57,602 INFO L444 ceAbstractionStarter]: For program point L152(lines 152 390) no Hoare annotation was computed. [2019-11-26 02:56:57,602 INFO L444 ceAbstractionStarter]: For program point L119(lines 119 390) no Hoare annotation was computed. [2019-11-26 02:56:57,602 INFO L444 ceAbstractionStarter]: For program point L318(lines 318 390) no Hoare annotation was computed. [2019-11-26 02:56:57,602 INFO L444 ceAbstractionStarter]: For program point L186(lines 186 390) no Hoare annotation was computed. [2019-11-26 02:56:57,602 INFO L444 ceAbstractionStarter]: For program point L54(lines 54 390) no Hoare annotation was computed. [2019-11-26 02:56:57,603 INFO L440 ceAbstractionStarter]: At program point L583-2(lines 583 593) the Hoare annotation is: (let ((.cse6 (= 15 ~a8~0))) (let ((.cse2 (<= ~a17~0 0)) (.cse7 (= 13 ~a8~0)) (.cse1 (not (= ~a16~0 6))) (.cse0 (not .cse6)) (.cse8 (= ~a20~0 1)) (.cse4 (not (= 1 ~a7~0))) (.cse9 (= ~a17~0 1)) (.cse5 (= ~a12~0 8)) (.cse3 (= ~a21~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse2 .cse3 .cse6) (and .cse1 .cse2 .cse5 .cse3) (and .cse7 .cse8) (and .cse0 .cse4 .cse3 (= ~a16~0 5)) (and .cse7 .cse1 .cse9 .cse5) (and .cse0 .cse3 .cse8) (and .cse4 .cse9 .cse5 .cse3 .cse6)))) [2019-11-26 02:56:57,603 INFO L444 ceAbstractionStarter]: For program point L286(lines 286 390) no Hoare annotation was computed. [2019-11-26 02:56:57,603 INFO L444 ceAbstractionStarter]: For program point L353(lines 353 390) no Hoare annotation was computed. [2019-11-26 02:56:57,603 INFO L444 ceAbstractionStarter]: For program point L189(lines 189 390) no Hoare annotation was computed. [2019-11-26 02:56:57,603 INFO L444 ceAbstractionStarter]: For program point L355(lines 355 390) no Hoare annotation was computed. [2019-11-26 02:56:57,603 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-26 02:56:57,603 INFO L444 ceAbstractionStarter]: For program point L256(lines 256 390) no Hoare annotation was computed. [2019-11-26 02:56:57,604 INFO L444 ceAbstractionStarter]: For program point L223(lines 223 390) no Hoare annotation was computed. [2019-11-26 02:56:57,604 INFO L444 ceAbstractionStarter]: For program point L124(lines 124 390) no Hoare annotation was computed. [2019-11-26 02:56:57,604 INFO L444 ceAbstractionStarter]: For program point L92(lines 92 390) no Hoare annotation was computed. [2019-11-26 02:56:57,604 INFO L444 ceAbstractionStarter]: For program point L588(line 588) no Hoare annotation was computed. [2019-11-26 02:56:57,604 INFO L444 ceAbstractionStarter]: For program point L324(lines 324 390) no Hoare annotation was computed. [2019-11-26 02:56:57,604 INFO L444 ceAbstractionStarter]: For program point L292(lines 292 390) no Hoare annotation was computed. [2019-11-26 02:56:57,604 INFO L444 ceAbstractionStarter]: For program point L160(lines 160 390) no Hoare annotation was computed. [2019-11-26 02:56:57,605 INFO L444 ceAbstractionStarter]: For program point L194(lines 194 390) no Hoare annotation was computed. [2019-11-26 02:56:57,605 INFO L444 ceAbstractionStarter]: For program point L62(lines 62 390) no Hoare annotation was computed. [2019-11-26 02:56:57,605 INFO L444 ceAbstractionStarter]: For program point L261(lines 261 390) no Hoare annotation was computed. [2019-11-26 02:56:57,605 INFO L444 ceAbstractionStarter]: For program point L129(lines 129 390) no Hoare annotation was computed. [2019-11-26 02:56:57,605 INFO L444 ceAbstractionStarter]: For program point L361(lines 361 390) no Hoare annotation was computed. [2019-11-26 02:56:57,605 INFO L444 ceAbstractionStarter]: For program point L97(lines 97 390) no Hoare annotation was computed. [2019-11-26 02:56:57,605 INFO L444 ceAbstractionStarter]: For program point L31(lines 31 390) no Hoare annotation was computed. [2019-11-26 02:56:57,605 INFO L444 ceAbstractionStarter]: For program point L329(lines 329 390) no Hoare annotation was computed. [2019-11-26 02:56:57,606 INFO L444 ceAbstractionStarter]: For program point L197(lines 197 390) no Hoare annotation was computed. [2019-11-26 02:56:57,606 INFO L444 ceAbstractionStarter]: For program point L65(lines 65 390) no Hoare annotation was computed. [2019-11-26 02:56:57,606 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 476) no Hoare annotation was computed. [2019-11-26 02:56:57,606 INFO L444 ceAbstractionStarter]: For program point L363(lines 363 390) no Hoare annotation was computed. [2019-11-26 02:56:57,607 INFO L444 ceAbstractionStarter]: For program point L231(lines 231 390) no Hoare annotation was computed. [2019-11-26 02:56:57,607 INFO L444 ceAbstractionStarter]: For program point L165(lines 165 390) no Hoare annotation was computed. [2019-11-26 02:56:57,607 INFO L444 ceAbstractionStarter]: For program point L265(lines 265 390) no Hoare annotation was computed. [2019-11-26 02:56:57,607 INFO L444 ceAbstractionStarter]: For program point L365(lines 365 390) no Hoare annotation was computed. [2019-11-26 02:56:57,607 INFO L444 ceAbstractionStarter]: For program point L299(lines 299 390) no Hoare annotation was computed. [2019-11-26 02:56:57,607 INFO L444 ceAbstractionStarter]: For program point L35(lines 35 390) no Hoare annotation was computed. [2019-11-26 02:56:57,641 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.11 02:56:57 BoogieIcfgContainer [2019-11-26 02:56:57,641 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-26 02:56:57,642 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-26 02:56:57,642 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-26 02:56:57,642 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-26 02:56:57,643 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 02:56:45" (3/4) ... [2019-11-26 02:56:57,646 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-26 02:56:57,674 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 99 nodes and edges [2019-11-26 02:56:57,676 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2019-11-26 02:56:57,677 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2019-11-26 02:56:57,678 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-11-26 02:56:57,847 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_979646be-47ab-40cc-b9d8-ac529ca9a89d/bin/utaipan/witness.graphml [2019-11-26 02:56:57,848 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-26 02:56:57,849 INFO L168 Benchmark]: Toolchain (without parser) took 14610.60 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 421.5 MB). Free memory was 939.3 MB in the beginning and 1.3 GB in the end (delta: -324.8 MB). Peak memory consumption was 96.7 MB. Max. memory is 11.5 GB. [2019-11-26 02:56:57,849 INFO L168 Benchmark]: CDTParser took 0.27 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:56:57,850 INFO L168 Benchmark]: CACSL2BoogieTranslator took 603.19 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.6 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -155.0 MB). Peak memory consumption was 18.7 MB. Max. memory is 11.5 GB. [2019-11-26 02:56:57,850 INFO L168 Benchmark]: Boogie Procedure Inliner took 87.21 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: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-11-26 02:56:57,850 INFO L168 Benchmark]: Boogie Preprocessor took 81.07 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-26 02:56:57,850 INFO L168 Benchmark]: RCFGBuilder took 1982.47 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 878.2 MB in the end (delta: 209.5 MB). Peak memory consumption was 209.5 MB. Max. memory is 11.5 GB. [2019-11-26 02:56:57,851 INFO L168 Benchmark]: TraceAbstraction took 11646.57 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 289.9 MB). Free memory was 878.2 MB in the beginning and 1.3 GB in the end (delta: -414.0 MB). Peak memory consumption was 369.7 MB. Max. memory is 11.5 GB. [2019-11-26 02:56:57,851 INFO L168 Benchmark]: Witness Printer took 206.03 ms. Allocated memory is still 1.5 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 28.1 MB). Peak memory consumption was 28.1 MB. Max. memory is 11.5 GB. [2019-11-26 02:56:57,853 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.27 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 603.19 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.6 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -155.0 MB). Peak memory consumption was 18.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 87.21 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: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 81.07 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 1982.47 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 878.2 MB in the end (delta: 209.5 MB). Peak memory consumption was 209.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 11646.57 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 289.9 MB). Free memory was 878.2 MB in the beginning and 1.3 GB in the end (delta: -414.0 MB). Peak memory consumption was 369.7 MB. Max. memory is 11.5 GB. * Witness Printer took 206.03 ms. Allocated memory is still 1.5 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 28.1 MB). Peak memory consumption was 28.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 476]: 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: (((((((((!(15 == a8) && !(a16 == 6)) && a17 <= 0) && a21 == 1) || ((((!(1 == a7) && a12 == 8) && a17 <= 0) && a21 == 1) && 15 == a8)) || (((!(a16 == 6) && a17 <= 0) && a12 == 8) && a21 == 1)) || (13 == a8 && a20 == 1)) || (((!(15 == a8) && !(1 == a7)) && a21 == 1) && a16 == 5)) || (((13 == a8 && !(a16 == 6)) && a17 == 1) && a12 == 8)) || ((!(15 == a8) && a21 == 1) && a20 == 1)) || ((((!(1 == a7) && a17 == 1) && a12 == 8) && a21 == 1) && 15 == a8) - InvariantResult [Line: 577]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 583]: Loop Invariant Derived loop invariant: (((((((((!(15 == a8) && !(a16 == 6)) && a17 <= 0) && a21 == 1) || ((((!(1 == a7) && a12 == 8) && a17 <= 0) && a21 == 1) && 15 == a8)) || (((!(a16 == 6) && a17 <= 0) && a12 == 8) && a21 == 1)) || (13 == a8 && a20 == 1)) || (((!(15 == a8) && !(1 == a7)) && a21 == 1) && a16 == 5)) || (((13 == a8 && !(a16 == 6)) && a17 == 1) && a12 == 8)) || ((!(15 == a8) && a21 == 1) && a20 == 1)) || ((((!(1 == a7) && a17 == 1) && a12 == 8) && a21 == 1) && 15 == a8) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 76 locations, 1 error locations. Result: SAFE, OverallTime: 11.5s, OverallIterations: 13, TraceHistogramMax: 5, AutomataDifference: 7.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.7s, HoareTripleCheckerStatistics: 656 SDtfs, 1898 SDslu, 109 SDs, 0 SdLazy, 4294 SolverSat, 989 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 404 GetRequests, 348 SyntacticMatches, 10 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1139occurred in iteration=9, 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, 13 MinimizatonAttempts, 1277 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 52 NumberOfFragments, 223 HoareAnnotationTreeSize, 3 FomulaSimplifications, 12104 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 3 FomulaSimplificationsInter, 971 FormulaSimplificationTreeSizeReductionInter, 0.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 1931 NumberOfCodeBlocks, 1931 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 2080 ConstructedInterpolants, 0 QuantifiedInterpolants, 1239981 SizeOfPredicates, 1 NumberOfNonLiveVariables, 370 ConjunctsInSsa, 2 ConjunctsInUnsatCore, 15 InterpolantComputations, 14 PerfectInterpolantSequences, 1868/1895 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...