./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/loop-invgen/SpamAssassin-loop_true-unreach-call.i.v+cfa-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_c72add44-7054-424f-b174-d8517459e773/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_c72add44-7054-424f-b174-d8517459e773/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_c72add44-7054-424f-b174-d8517459e773/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_c72add44-7054-424f-b174-d8517459e773/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/loop-invgen/SpamAssassin-loop_true-unreach-call.i.v+cfa-reducer.c -s /tmp/vcloud-vcloud-master/worker/working_dir_c72add44-7054-424f-b174-d8517459e773/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_c72add44-7054-424f-b174-d8517459e773/bin-2019/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 5daa60820c0033439eb2fc136c4a16d466a909bc ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-02 07:35:02,993 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 07:35:02,994 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 07:35:03,002 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 07:35:03,002 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 07:35:03,002 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 07:35:03,003 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 07:35:03,004 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 07:35:03,005 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 07:35:03,006 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 07:35:03,007 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 07:35:03,007 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 07:35:03,007 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 07:35:03,008 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 07:35:03,009 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 07:35:03,009 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 07:35:03,010 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 07:35:03,011 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 07:35:03,013 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 07:35:03,014 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 07:35:03,014 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 07:35:03,015 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 07:35:03,017 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 07:35:03,017 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 07:35:03,017 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 07:35:03,018 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 07:35:03,018 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 07:35:03,019 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 07:35:03,020 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 07:35:03,020 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 07:35:03,021 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 07:35:03,021 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 07:35:03,021 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 07:35:03,021 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 07:35:03,022 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 07:35:03,022 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 07:35:03,023 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_c72add44-7054-424f-b174-d8517459e773/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-02 07:35:03,033 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 07:35:03,033 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 07:35:03,034 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-02 07:35:03,034 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-02 07:35:03,034 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-02 07:35:03,034 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-02 07:35:03,034 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-02 07:35:03,035 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-02 07:35:03,035 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-02 07:35:03,035 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-02 07:35:03,035 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-02 07:35:03,035 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-02 07:35:03,035 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-02 07:35:03,035 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 07:35:03,036 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-02 07:35:03,036 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 07:35:03,036 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-02 07:35:03,036 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 07:35:03,036 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-02 07:35:03,036 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-02 07:35:03,036 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-02 07:35:03,037 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-02 07:35:03,037 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-02 07:35:03,037 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-02 07:35:03,037 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 07:35:03,037 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 07:35:03,037 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-02 07:35:03,037 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-02 07:35:03,038 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 07:35:03,038 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 07:35:03,038 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-02 07:35:03,038 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-02 07:35:03,038 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-02 07:35:03,038 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-02 07:35:03,038 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-02 07:35:03,038 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-02 07:35:03,038 INFO L133 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/working_dir_c72add44-7054-424f-b174-d8517459e773/bin-2019/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 -> 5daa60820c0033439eb2fc136c4a16d466a909bc [2018-12-02 07:35:03,061 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 07:35:03,070 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 07:35:03,072 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 07:35:03,073 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 07:35:03,074 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 07:35:03,074 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_c72add44-7054-424f-b174-d8517459e773/bin-2019/utaipan/../../sv-benchmarks/c/loop-invgen/SpamAssassin-loop_true-unreach-call.i.v+cfa-reducer.c [2018-12-02 07:35:03,120 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c72add44-7054-424f-b174-d8517459e773/bin-2019/utaipan/data/825cb0cfa/819d786b554b42aa9fa5f1cbc484d22e/FLAG99cf9c7e7 [2018-12-02 07:35:03,520 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 07:35:03,520 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_c72add44-7054-424f-b174-d8517459e773/sv-benchmarks/c/loop-invgen/SpamAssassin-loop_true-unreach-call.i.v+cfa-reducer.c [2018-12-02 07:35:03,524 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c72add44-7054-424f-b174-d8517459e773/bin-2019/utaipan/data/825cb0cfa/819d786b554b42aa9fa5f1cbc484d22e/FLAG99cf9c7e7 [2018-12-02 07:35:03,532 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_c72add44-7054-424f-b174-d8517459e773/bin-2019/utaipan/data/825cb0cfa/819d786b554b42aa9fa5f1cbc484d22e [2018-12-02 07:35:03,533 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 07:35:03,534 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 07:35:03,535 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 07:35:03,535 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 07:35:03,537 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 07:35:03,537 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 07:35:03" (1/1) ... [2018-12-02 07:35:03,539 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2817da2a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:35:03, skipping insertion in model container [2018-12-02 07:35:03,539 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 07:35:03" (1/1) ... [2018-12-02 07:35:03,543 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 07:35:03,556 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 07:35:03,651 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 07:35:03,653 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 07:35:03,671 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 07:35:03,679 INFO L195 MainTranslator]: Completed translation [2018-12-02 07:35:03,679 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:35:03 WrapperNode [2018-12-02 07:35:03,679 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 07:35:03,680 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 07:35:03,680 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 07:35:03,680 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 07:35:03,685 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:35:03" (1/1) ... [2018-12-02 07:35:03,688 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:35:03" (1/1) ... [2018-12-02 07:35:03,692 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 07:35:03,693 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 07:35:03,693 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 07:35:03,693 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 07:35:03,727 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:35:03" (1/1) ... [2018-12-02 07:35:03,727 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:35:03" (1/1) ... [2018-12-02 07:35:03,728 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:35:03" (1/1) ... [2018-12-02 07:35:03,728 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:35:03" (1/1) ... [2018-12-02 07:35:03,733 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:35:03" (1/1) ... [2018-12-02 07:35:03,736 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:35:03" (1/1) ... [2018-12-02 07:35:03,737 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:35:03" (1/1) ... [2018-12-02 07:35:03,739 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 07:35:03,739 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 07:35:03,739 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 07:35:03,739 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 07:35:03,740 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:35:03" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c72add44-7054-424f-b174-d8517459e773/bin-2019/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 [2018-12-02 07:35:03,773 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-02 07:35:03,773 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-02 07:35:03,773 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 07:35:03,773 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 07:35:03,773 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-02 07:35:03,773 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-02 07:35:03,947 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 07:35:03,947 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-12-02 07:35:03,947 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 07:35:03 BoogieIcfgContainer [2018-12-02 07:35:03,947 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 07:35:03,948 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-02 07:35:03,948 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-02 07:35:03,951 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-02 07:35:03,951 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 07:35:03" (1/3) ... [2018-12-02 07:35:03,952 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e324b03 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 07:35:03, skipping insertion in model container [2018-12-02 07:35:03,952 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:35:03" (2/3) ... [2018-12-02 07:35:03,952 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e324b03 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 07:35:03, skipping insertion in model container [2018-12-02 07:35:03,952 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 07:35:03" (3/3) ... [2018-12-02 07:35:03,953 INFO L112 eAbstractionObserver]: Analyzing ICFG SpamAssassin-loop_true-unreach-call.i.v+cfa-reducer.c [2018-12-02 07:35:03,962 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-02 07:35:03,968 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 16 error locations. [2018-12-02 07:35:03,981 INFO L257 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2018-12-02 07:35:04,000 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-02 07:35:04,000 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-02 07:35:04,001 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-02 07:35:04,001 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 07:35:04,001 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 07:35:04,001 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-02 07:35:04,001 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 07:35:04,001 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-02 07:35:04,012 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states. [2018-12-02 07:35:04,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-02 07:35:04,016 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 07:35:04,016 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 07:35:04,018 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 07:35:04,021 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:35:04,021 INFO L82 PathProgramCache]: Analyzing trace with hash -1118366569, now seen corresponding path program 1 times [2018-12-02 07:35:04,022 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 07:35:04,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:35:04,051 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:35:04,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:35:04,051 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 07:35:04,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:35:04,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 07:35:04,112 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 07:35:04,112 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 07:35:04,112 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 07:35:04,115 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 07:35:04,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 07:35:04,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 07:35:04,125 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 3 states. [2018-12-02 07:35:04,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:35:04,143 INFO L93 Difference]: Finished difference Result 88 states and 116 transitions. [2018-12-02 07:35:04,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 07:35:04,144 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-12-02 07:35:04,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 07:35:04,150 INFO L225 Difference]: With dead ends: 88 [2018-12-02 07:35:04,150 INFO L226 Difference]: Without dead ends: 76 [2018-12-02 07:35:04,152 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 07:35:04,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-12-02 07:35:04,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 59. [2018-12-02 07:35:04,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-12-02 07:35:04,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 63 transitions. [2018-12-02 07:35:04,174 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 63 transitions. Word has length 13 [2018-12-02 07:35:04,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 07:35:04,174 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 63 transitions. [2018-12-02 07:35:04,174 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 07:35:04,175 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 63 transitions. [2018-12-02 07:35:04,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-02 07:35:04,175 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 07:35:04,175 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 07:35:04,175 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 07:35:04,176 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:35:04,176 INFO L82 PathProgramCache]: Analyzing trace with hash -306453431, now seen corresponding path program 1 times [2018-12-02 07:35:04,176 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 07:35:04,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:35:04,177 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:35:04,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:35:04,177 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 07:35:04,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:35:04,207 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 07:35:04,208 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 07:35:04,208 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 07:35:04,208 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 07:35:04,209 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 07:35:04,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 07:35:04,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 07:35:04,209 INFO L87 Difference]: Start difference. First operand 59 states and 63 transitions. Second operand 4 states. [2018-12-02 07:35:04,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:35:04,253 INFO L93 Difference]: Finished difference Result 153 states and 168 transitions. [2018-12-02 07:35:04,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 07:35:04,253 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-12-02 07:35:04,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 07:35:04,254 INFO L225 Difference]: With dead ends: 153 [2018-12-02 07:35:04,254 INFO L226 Difference]: Without dead ends: 101 [2018-12-02 07:35:04,255 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 07:35:04,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-12-02 07:35:04,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 58. [2018-12-02 07:35:04,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-12-02 07:35:04,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 62 transitions. [2018-12-02 07:35:04,259 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 62 transitions. Word has length 14 [2018-12-02 07:35:04,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 07:35:04,259 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 62 transitions. [2018-12-02 07:35:04,259 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 07:35:04,259 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 62 transitions. [2018-12-02 07:35:04,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-02 07:35:04,260 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 07:35:04,260 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 07:35:04,260 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 07:35:04,260 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:35:04,260 INFO L82 PathProgramCache]: Analyzing trace with hash -309622200, now seen corresponding path program 1 times [2018-12-02 07:35:04,260 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 07:35:04,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:35:04,261 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:35:04,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:35:04,261 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 07:35:04,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:35:04,291 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 07:35:04,291 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 07:35:04,291 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 07:35:04,291 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 07:35:04,291 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 07:35:04,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 07:35:04,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-02 07:35:04,292 INFO L87 Difference]: Start difference. First operand 58 states and 62 transitions. Second operand 5 states. [2018-12-02 07:35:04,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:35:04,336 INFO L93 Difference]: Finished difference Result 75 states and 82 transitions. [2018-12-02 07:35:04,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 07:35:04,336 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-12-02 07:35:04,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 07:35:04,337 INFO L225 Difference]: With dead ends: 75 [2018-12-02 07:35:04,337 INFO L226 Difference]: Without dead ends: 73 [2018-12-02 07:35:04,337 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-12-02 07:35:04,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-12-02 07:35:04,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 56. [2018-12-02 07:35:04,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-12-02 07:35:04,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 60 transitions. [2018-12-02 07:35:04,341 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 60 transitions. Word has length 14 [2018-12-02 07:35:04,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 07:35:04,341 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 60 transitions. [2018-12-02 07:35:04,341 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 07:35:04,341 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 60 transitions. [2018-12-02 07:35:04,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-02 07:35:04,341 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 07:35:04,341 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 07:35:04,342 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 07:35:04,342 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:35:04,342 INFO L82 PathProgramCache]: Analyzing trace with hash -910118681, now seen corresponding path program 1 times [2018-12-02 07:35:04,342 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 07:35:04,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:35:04,343 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:35:04,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:35:04,343 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 07:35:04,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:35:04,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 07:35:04,377 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 07:35:04,377 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 07:35:04,377 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 07:35:04,378 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 07:35:04,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 07:35:04,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-02 07:35:04,378 INFO L87 Difference]: Start difference. First operand 56 states and 60 transitions. Second operand 6 states. [2018-12-02 07:35:04,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:35:04,460 INFO L93 Difference]: Finished difference Result 98 states and 106 transitions. [2018-12-02 07:35:04,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 07:35:04,461 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2018-12-02 07:35:04,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 07:35:04,462 INFO L225 Difference]: With dead ends: 98 [2018-12-02 07:35:04,462 INFO L226 Difference]: Without dead ends: 96 [2018-12-02 07:35:04,462 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2018-12-02 07:35:04,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-12-02 07:35:04,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 54. [2018-12-02 07:35:04,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-12-02 07:35:04,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 58 transitions. [2018-12-02 07:35:04,468 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 58 transitions. Word has length 15 [2018-12-02 07:35:04,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 07:35:04,468 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 58 transitions. [2018-12-02 07:35:04,468 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 07:35:04,468 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2018-12-02 07:35:04,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-02 07:35:04,469 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 07:35:04,469 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 07:35:04,469 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 07:35:04,470 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:35:04,470 INFO L82 PathProgramCache]: Analyzing trace with hash 1851095055, now seen corresponding path program 1 times [2018-12-02 07:35:04,470 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 07:35:04,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:35:04,471 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:35:04,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:35:04,471 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 07:35:04,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:35:04,521 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 07:35:04,521 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 07:35:04,522 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-02 07:35:04,522 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 07:35:04,522 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-02 07:35:04,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-02 07:35:04,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-12-02 07:35:04,522 INFO L87 Difference]: Start difference. First operand 54 states and 58 transitions. Second operand 8 states. [2018-12-02 07:35:04,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:35:04,652 INFO L93 Difference]: Finished difference Result 97 states and 105 transitions. [2018-12-02 07:35:04,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-02 07:35:04,653 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-12-02 07:35:04,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 07:35:04,653 INFO L225 Difference]: With dead ends: 97 [2018-12-02 07:35:04,653 INFO L226 Difference]: Without dead ends: 95 [2018-12-02 07:35:04,654 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2018-12-02 07:35:04,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-12-02 07:35:04,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 52. [2018-12-02 07:35:04,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-12-02 07:35:04,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 56 transitions. [2018-12-02 07:35:04,658 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 56 transitions. Word has length 16 [2018-12-02 07:35:04,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 07:35:04,658 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 56 transitions. [2018-12-02 07:35:04,658 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-02 07:35:04,658 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2018-12-02 07:35:04,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-02 07:35:04,658 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 07:35:04,658 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 07:35:04,659 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 07:35:04,659 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:35:04,659 INFO L82 PathProgramCache]: Analyzing trace with hash -1194066488, now seen corresponding path program 1 times [2018-12-02 07:35:04,659 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 07:35:04,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:35:04,660 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:35:04,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:35:04,660 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 07:35:04,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:35:04,682 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 07:35:04,682 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 07:35:04,682 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 07:35:04,682 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 07:35:04,682 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 07:35:04,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 07:35:04,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-02 07:35:04,683 INFO L87 Difference]: Start difference. First operand 52 states and 56 transitions. Second operand 5 states. [2018-12-02 07:35:04,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:35:04,739 INFO L93 Difference]: Finished difference Result 83 states and 91 transitions. [2018-12-02 07:35:04,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 07:35:04,740 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2018-12-02 07:35:04,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 07:35:04,740 INFO L225 Difference]: With dead ends: 83 [2018-12-02 07:35:04,740 INFO L226 Difference]: Without dead ends: 81 [2018-12-02 07:35:04,741 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-12-02 07:35:04,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-12-02 07:35:04,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 50. [2018-12-02 07:35:04,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-12-02 07:35:04,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2018-12-02 07:35:04,746 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 16 [2018-12-02 07:35:04,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 07:35:04,747 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2018-12-02 07:35:04,747 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 07:35:04,747 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2018-12-02 07:35:04,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-02 07:35:04,748 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 07:35:04,748 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 07:35:04,748 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 07:35:04,748 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:35:04,748 INFO L82 PathProgramCache]: Analyzing trace with hash 1549374957, now seen corresponding path program 1 times [2018-12-02 07:35:04,749 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 07:35:04,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:35:04,749 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:35:04,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:35:04,750 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 07:35:04,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:35:04,784 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 07:35:04,785 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 07:35:04,785 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 07:35:04,785 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 07:35:04,785 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 07:35:04,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 07:35:04,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-02 07:35:04,786 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand 6 states. [2018-12-02 07:35:04,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:35:04,871 INFO L93 Difference]: Finished difference Result 93 states and 101 transitions. [2018-12-02 07:35:04,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 07:35:04,871 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2018-12-02 07:35:04,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 07:35:04,872 INFO L225 Difference]: With dead ends: 93 [2018-12-02 07:35:04,872 INFO L226 Difference]: Without dead ends: 91 [2018-12-02 07:35:04,872 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2018-12-02 07:35:04,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-12-02 07:35:04,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 48. [2018-12-02 07:35:04,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-12-02 07:35:04,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 52 transitions. [2018-12-02 07:35:04,876 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 52 transitions. Word has length 17 [2018-12-02 07:35:04,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 07:35:04,876 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 52 transitions. [2018-12-02 07:35:04,877 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 07:35:04,877 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 52 transitions. [2018-12-02 07:35:04,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-02 07:35:04,877 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 07:35:04,877 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 07:35:04,877 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 07:35:04,877 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:35:04,878 INFO L82 PathProgramCache]: Analyzing trace with hash 1638647651, now seen corresponding path program 1 times [2018-12-02 07:35:04,878 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 07:35:04,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:35:04,878 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:35:04,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:35:04,878 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 07:35:04,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:35:04,907 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 07:35:04,908 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 07:35:04,908 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 07:35:04,908 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 07:35:04,908 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 07:35:04,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 07:35:04,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 07:35:04,909 INFO L87 Difference]: Start difference. First operand 48 states and 52 transitions. Second operand 5 states. [2018-12-02 07:35:04,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:35:04,979 INFO L93 Difference]: Finished difference Result 73 states and 84 transitions. [2018-12-02 07:35:04,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 07:35:04,979 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-12-02 07:35:04,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 07:35:04,980 INFO L225 Difference]: With dead ends: 73 [2018-12-02 07:35:04,980 INFO L226 Difference]: Without dead ends: 71 [2018-12-02 07:35:04,980 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-12-02 07:35:04,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-12-02 07:35:04,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 46. [2018-12-02 07:35:04,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-12-02 07:35:04,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 50 transitions. [2018-12-02 07:35:04,984 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 50 transitions. Word has length 17 [2018-12-02 07:35:04,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 07:35:04,984 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 50 transitions. [2018-12-02 07:35:04,984 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 07:35:04,985 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 50 transitions. [2018-12-02 07:35:04,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-02 07:35:04,985 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 07:35:04,985 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 07:35:04,985 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 07:35:04,986 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:35:04,986 INFO L82 PathProgramCache]: Analyzing trace with hash -741527250, now seen corresponding path program 1 times [2018-12-02 07:35:04,986 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 07:35:04,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:35:04,987 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:35:04,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:35:04,987 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 07:35:04,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:35:05,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 07:35:05,016 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 07:35:05,016 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 07:35:05,016 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 07:35:05,016 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 07:35:05,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 07:35:05,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-02 07:35:05,017 INFO L87 Difference]: Start difference. First operand 46 states and 50 transitions. Second operand 6 states. [2018-12-02 07:35:05,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:35:05,090 INFO L93 Difference]: Finished difference Result 71 states and 79 transitions. [2018-12-02 07:35:05,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 07:35:05,091 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2018-12-02 07:35:05,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 07:35:05,091 INFO L225 Difference]: With dead ends: 71 [2018-12-02 07:35:05,091 INFO L226 Difference]: Without dead ends: 69 [2018-12-02 07:35:05,092 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2018-12-02 07:35:05,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-12-02 07:35:05,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 44. [2018-12-02 07:35:05,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-12-02 07:35:05,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 48 transitions. [2018-12-02 07:35:05,095 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 48 transitions. Word has length 18 [2018-12-02 07:35:05,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 07:35:05,095 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 48 transitions. [2018-12-02 07:35:05,095 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 07:35:05,096 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 48 transitions. [2018-12-02 07:35:05,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-02 07:35:05,096 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 07:35:05,096 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 07:35:05,096 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 07:35:05,096 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:35:05,096 INFO L82 PathProgramCache]: Analyzing trace with hash -1512505143, now seen corresponding path program 1 times [2018-12-02 07:35:05,097 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 07:35:05,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:35:05,097 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:35:05,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:35:05,097 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 07:35:05,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:35:05,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 07:35:05,117 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 07:35:05,117 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 07:35:05,118 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 07:35:05,118 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 07:35:05,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 07:35:05,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-02 07:35:05,118 INFO L87 Difference]: Start difference. First operand 44 states and 48 transitions. Second operand 5 states. [2018-12-02 07:35:05,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:35:05,161 INFO L93 Difference]: Finished difference Result 71 states and 82 transitions. [2018-12-02 07:35:05,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 07:35:05,161 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2018-12-02 07:35:05,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 07:35:05,161 INFO L225 Difference]: With dead ends: 71 [2018-12-02 07:35:05,161 INFO L226 Difference]: Without dead ends: 69 [2018-12-02 07:35:05,162 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-12-02 07:35:05,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-12-02 07:35:05,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 42. [2018-12-02 07:35:05,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-12-02 07:35:05,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2018-12-02 07:35:05,165 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 46 transitions. Word has length 19 [2018-12-02 07:35:05,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 07:35:05,165 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 46 transitions. [2018-12-02 07:35:05,165 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 07:35:05,165 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2018-12-02 07:35:05,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-02 07:35:05,166 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 07:35:05,166 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 07:35:05,166 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 07:35:05,166 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:35:05,166 INFO L82 PathProgramCache]: Analyzing trace with hash 356983956, now seen corresponding path program 1 times [2018-12-02 07:35:05,166 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 07:35:05,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:35:05,167 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:35:05,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:35:05,167 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 07:35:05,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:35:05,186 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 07:35:05,186 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 07:35:05,186 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 07:35:05,186 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 07:35:05,187 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 07:35:05,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 07:35:05,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-02 07:35:05,187 INFO L87 Difference]: Start difference. First operand 42 states and 46 transitions. Second operand 5 states. [2018-12-02 07:35:05,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:35:05,234 INFO L93 Difference]: Finished difference Result 69 states and 77 transitions. [2018-12-02 07:35:05,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 07:35:05,234 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-12-02 07:35:05,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 07:35:05,234 INFO L225 Difference]: With dead ends: 69 [2018-12-02 07:35:05,234 INFO L226 Difference]: Without dead ends: 67 [2018-12-02 07:35:05,235 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-12-02 07:35:05,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-12-02 07:35:05,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 40. [2018-12-02 07:35:05,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-12-02 07:35:05,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2018-12-02 07:35:05,239 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 20 [2018-12-02 07:35:05,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 07:35:05,239 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions. [2018-12-02 07:35:05,239 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 07:35:05,239 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2018-12-02 07:35:05,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-02 07:35:05,239 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 07:35:05,239 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 07:35:05,240 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 07:35:05,240 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:35:05,240 INFO L82 PathProgramCache]: Analyzing trace with hash -1818396113, now seen corresponding path program 1 times [2018-12-02 07:35:05,240 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 07:35:05,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:35:05,240 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:35:05,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:35:05,241 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 07:35:05,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:35:05,268 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 07:35:05,268 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 07:35:05,268 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 07:35:05,268 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 07:35:05,268 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 07:35:05,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 07:35:05,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-02 07:35:05,269 INFO L87 Difference]: Start difference. First operand 40 states and 44 transitions. Second operand 6 states. [2018-12-02 07:35:05,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:35:05,350 INFO L93 Difference]: Finished difference Result 89 states and 103 transitions. [2018-12-02 07:35:05,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 07:35:05,351 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2018-12-02 07:35:05,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 07:35:05,351 INFO L225 Difference]: With dead ends: 89 [2018-12-02 07:35:05,351 INFO L226 Difference]: Without dead ends: 87 [2018-12-02 07:35:05,351 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2018-12-02 07:35:05,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-12-02 07:35:05,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 38. [2018-12-02 07:35:05,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-12-02 07:35:05,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2018-12-02 07:35:05,355 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 21 [2018-12-02 07:35:05,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 07:35:05,355 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2018-12-02 07:35:05,355 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 07:35:05,355 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2018-12-02 07:35:05,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-02 07:35:05,356 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 07:35:05,356 INFO L402 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] [2018-12-02 07:35:05,356 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 07:35:05,356 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:35:05,356 INFO L82 PathProgramCache]: Analyzing trace with hash -535701510, now seen corresponding path program 1 times [2018-12-02 07:35:05,357 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 07:35:05,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:35:05,357 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:35:05,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:35:05,357 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 07:35:05,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:35:05,401 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 07:35:05,401 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 07:35:05,401 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 07:35:05,401 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 07:35:05,401 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 07:35:05,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 07:35:05,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-12-02 07:35:05,401 INFO L87 Difference]: Start difference. First operand 38 states and 42 transitions. Second operand 7 states. [2018-12-02 07:35:05,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:35:05,497 INFO L93 Difference]: Finished difference Result 72 states and 83 transitions. [2018-12-02 07:35:05,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-02 07:35:05,497 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2018-12-02 07:35:05,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 07:35:05,498 INFO L225 Difference]: With dead ends: 72 [2018-12-02 07:35:05,498 INFO L226 Difference]: Without dead ends: 70 [2018-12-02 07:35:05,498 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2018-12-02 07:35:05,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-12-02 07:35:05,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 36. [2018-12-02 07:35:05,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-12-02 07:35:05,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2018-12-02 07:35:05,501 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 40 transitions. Word has length 22 [2018-12-02 07:35:05,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 07:35:05,501 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 40 transitions. [2018-12-02 07:35:05,502 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 07:35:05,502 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2018-12-02 07:35:05,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-02 07:35:05,502 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 07:35:05,502 INFO L402 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] [2018-12-02 07:35:05,502 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 07:35:05,503 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:35:05,503 INFO L82 PathProgramCache]: Analyzing trace with hash 573125525, now seen corresponding path program 1 times [2018-12-02 07:35:05,503 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 07:35:05,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:35:05,504 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:35:05,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:35:05,504 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 07:35:05,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:35:05,533 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 07:35:05,533 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 07:35:05,533 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 07:35:05,533 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 07:35:05,533 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 07:35:05,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 07:35:05,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-02 07:35:05,534 INFO L87 Difference]: Start difference. First operand 36 states and 40 transitions. Second operand 6 states. [2018-12-02 07:35:05,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:35:05,622 INFO L93 Difference]: Finished difference Result 105 states and 124 transitions. [2018-12-02 07:35:05,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 07:35:05,622 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2018-12-02 07:35:05,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 07:35:05,622 INFO L225 Difference]: With dead ends: 105 [2018-12-02 07:35:05,622 INFO L226 Difference]: Without dead ends: 103 [2018-12-02 07:35:05,623 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2018-12-02 07:35:05,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-12-02 07:35:05,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 34. [2018-12-02 07:35:05,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-12-02 07:35:05,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2018-12-02 07:35:05,626 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 23 [2018-12-02 07:35:05,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 07:35:05,626 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2018-12-02 07:35:05,626 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 07:35:05,626 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2018-12-02 07:35:05,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-02 07:35:05,627 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 07:35:05,627 INFO L402 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] [2018-12-02 07:35:05,627 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 07:35:05,627 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:35:05,627 INFO L82 PathProgramCache]: Analyzing trace with hash 587025248, now seen corresponding path program 1 times [2018-12-02 07:35:05,627 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 07:35:05,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:35:05,628 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:35:05,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:35:05,628 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 07:35:05,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:35:05,655 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 07:35:05,655 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 07:35:05,655 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 07:35:05,656 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 07:35:05,656 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 07:35:05,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 07:35:05,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-12-02 07:35:05,656 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand 7 states. [2018-12-02 07:35:05,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:35:05,753 INFO L93 Difference]: Finished difference Result 70 states and 81 transitions. [2018-12-02 07:35:05,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-02 07:35:05,753 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2018-12-02 07:35:05,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 07:35:05,754 INFO L225 Difference]: With dead ends: 70 [2018-12-02 07:35:05,754 INFO L226 Difference]: Without dead ends: 68 [2018-12-02 07:35:05,754 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2018-12-02 07:35:05,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-12-02 07:35:05,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 32. [2018-12-02 07:35:05,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-12-02 07:35:05,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2018-12-02 07:35:05,758 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 24 [2018-12-02 07:35:05,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 07:35:05,758 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2018-12-02 07:35:05,759 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 07:35:05,759 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2018-12-02 07:35:05,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-02 07:35:05,759 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 07:35:05,759 INFO L402 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] [2018-12-02 07:35:05,759 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 07:35:05,759 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:35:05,759 INFO L82 PathProgramCache]: Analyzing trace with hash 1017916667, now seen corresponding path program 1 times [2018-12-02 07:35:05,759 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 07:35:05,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:35:05,760 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:35:05,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:35:05,760 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 07:35:05,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:35:05,781 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 07:35:05,781 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 07:35:05,781 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 07:35:05,781 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 07:35:05,781 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 07:35:05,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 07:35:05,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-02 07:35:05,782 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand 6 states. [2018-12-02 07:35:05,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:35:05,862 INFO L93 Difference]: Finished difference Result 85 states and 100 transitions. [2018-12-02 07:35:05,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 07:35:05,863 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2018-12-02 07:35:05,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 07:35:05,863 INFO L225 Difference]: With dead ends: 85 [2018-12-02 07:35:05,863 INFO L226 Difference]: Without dead ends: 0 [2018-12-02 07:35:05,864 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2018-12-02 07:35:05,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-02 07:35:05,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-02 07:35:05,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-02 07:35:05,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-02 07:35:05,865 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 25 [2018-12-02 07:35:05,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 07:35:05,865 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-02 07:35:05,865 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 07:35:05,865 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-02 07:35:05,865 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-02 07:35:05,868 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-02 07:35:05,880 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 07:35:05,979 WARN L180 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 63 [2018-12-02 07:35:05,987 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 07:35:06,092 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 07:35:06,095 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 07:35:06,097 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 07:35:06,244 WARN L180 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 9 [2018-12-02 07:35:06,438 WARN L180 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 33 [2018-12-02 07:35:06,647 WARN L180 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 18 [2018-12-02 07:35:06,649 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-12-02 07:35:06,649 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2018-12-02 07:35:06,649 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-12-02 07:35:06,649 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-12-02 07:35:06,649 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-12-02 07:35:06,649 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-12-02 07:35:06,649 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-12-02 07:35:06,649 INFO L448 ceAbstractionStarter]: For program point L93(lines 93 120) no Hoare annotation was computed. [2018-12-02 07:35:06,649 INFO L448 ceAbstractionStarter]: For program point L250(lines 250 260) no Hoare annotation was computed. [2018-12-02 07:35:06,649 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 8 308) no Hoare annotation was computed. [2018-12-02 07:35:06,649 INFO L448 ceAbstractionStarter]: For program point mainErr14ASSERT_VIOLATIONERROR_FUNCTION(line 240) no Hoare annotation was computed. [2018-12-02 07:35:06,649 INFO L448 ceAbstractionStarter]: For program point L52(lines 52 281) no Hoare annotation was computed. [2018-12-02 07:35:06,649 INFO L448 ceAbstractionStarter]: For program point L69(lines 69 124) no Hoare annotation was computed. [2018-12-02 07:35:06,650 INFO L444 ceAbstractionStarter]: At program point L259(lines 26 301) the Hoare annotation is: (let ((.cse2 (<= (+ main_~main__j~0 4) main_~main__bufsize~0))) (let ((.cse0 (<= (+ main_~main__limit~0 4) main_~main__bufsize~0)) (.cse1 (and (<= 1 main_~main__j~0) (let ((.cse3 (<= 1 main_~main__i~0))) (or (and .cse3 (not (= 0 main_~__VERIFIER_assert__cond~12))) (and .cse3 .cse2)))))) (or (and .cse0 .cse1 (not (= 0 main_~__VERIFIER_assert__cond~14))) (and (and .cse0 (and (< main_~main__i~0 main_~main__len~0) (<= 0 main_~main__i~0))) (<= 0 main_~main__j~0)) (and .cse0 .cse1 .cse2)))) [2018-12-02 07:35:06,650 INFO L448 ceAbstractionStarter]: For program point L160(line 160) no Hoare annotation was computed. [2018-12-02 07:35:06,650 INFO L448 ceAbstractionStarter]: For program point L61(lines 61 280) no Hoare annotation was computed. [2018-12-02 07:35:06,650 INFO L448 ceAbstractionStarter]: For program point mainErr5ASSERT_VIOLATIONERROR_FUNCTION(line 107) no Hoare annotation was computed. [2018-12-02 07:35:06,650 INFO L448 ceAbstractionStarter]: For program point mainErr11ASSERT_VIOLATIONERROR_FUNCTION(line 200) no Hoare annotation was computed. [2018-12-02 07:35:06,650 INFO L448 ceAbstractionStarter]: For program point mainErr1ASSERT_VIOLATIONERROR_FUNCTION(line 54) no Hoare annotation was computed. [2018-12-02 07:35:06,650 INFO L448 ceAbstractionStarter]: For program point L210(lines 210 266) no Hoare annotation was computed. [2018-12-02 07:35:06,650 INFO L448 ceAbstractionStarter]: For program point mainErr6ASSERT_VIOLATIONERROR_FUNCTION(line 136) no Hoare annotation was computed. [2018-12-02 07:35:06,650 INFO L448 ceAbstractionStarter]: For program point L136(line 136) no Hoare annotation was computed. [2018-12-02 07:35:06,650 INFO L448 ceAbstractionStarter]: For program point L95(line 95) no Hoare annotation was computed. [2018-12-02 07:35:06,650 INFO L448 ceAbstractionStarter]: For program point L252(line 252) no Hoare annotation was computed. [2018-12-02 07:35:06,650 INFO L448 ceAbstractionStarter]: For program point L186(lines 186 270) no Hoare annotation was computed. [2018-12-02 07:35:06,650 INFO L448 ceAbstractionStarter]: For program point L54(line 54) no Hoare annotation was computed. [2018-12-02 07:35:06,650 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 8 308) no Hoare annotation was computed. [2018-12-02 07:35:06,650 INFO L448 ceAbstractionStarter]: For program point L170(lines 170 272) no Hoare annotation was computed. [2018-12-02 07:35:06,650 INFO L448 ceAbstractionStarter]: For program point L71(line 71) no Hoare annotation was computed. [2018-12-02 07:35:06,650 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 8 308) the Hoare annotation is: true [2018-12-02 07:35:06,650 INFO L448 ceAbstractionStarter]: For program point mainErr4ASSERT_VIOLATIONERROR_FUNCTION(line 95) no Hoare annotation was computed. [2018-12-02 07:35:06,650 INFO L448 ceAbstractionStarter]: For program point mainErr3ASSERT_VIOLATIONERROR_FUNCTION(line 83) no Hoare annotation was computed. [2018-12-02 07:35:06,651 INFO L448 ceAbstractionStarter]: For program point L212(line 212) no Hoare annotation was computed. [2018-12-02 07:35:06,651 INFO L448 ceAbstractionStarter]: For program point L146(lines 146 276) no Hoare annotation was computed. [2018-12-02 07:35:06,651 INFO L448 ceAbstractionStarter]: For program point L105(lines 105 118) no Hoare annotation was computed. [2018-12-02 07:35:06,651 INFO L448 ceAbstractionStarter]: For program point L31(lines 31 295) no Hoare annotation was computed. [2018-12-02 07:35:06,651 INFO L448 ceAbstractionStarter]: For program point L188(line 188) no Hoare annotation was computed. [2018-12-02 07:35:06,651 INFO L448 ceAbstractionStarter]: For program point L81(lines 81 122) no Hoare annotation was computed. [2018-12-02 07:35:06,651 INFO L448 ceAbstractionStarter]: For program point L15(lines 15 307) no Hoare annotation was computed. [2018-12-02 07:35:06,651 INFO L448 ceAbstractionStarter]: For program point L238(lines 238 262) no Hoare annotation was computed. [2018-12-02 07:35:06,651 INFO L448 ceAbstractionStarter]: For program point L172(line 172) no Hoare annotation was computed. [2018-12-02 07:35:06,651 INFO L448 ceAbstractionStarter]: For program point L40(lines 40 283) no Hoare annotation was computed. [2018-12-02 07:35:06,651 INFO L444 ceAbstractionStarter]: At program point L288(lines 33 289) the Hoare annotation is: (and (< main_~main__i~0 main_~main__len~0) (<= (+ main_~main__j~0 5) main_~main__bufsize~0) (<= 0 main_~main__i~0) (<= (+ main_~main__limit~0 4) main_~main__bufsize~0) (<= 0 main_~main__j~0)) [2018-12-02 07:35:06,651 INFO L448 ceAbstractionStarter]: For program point L222(lines 222 264) no Hoare annotation was computed. [2018-12-02 07:35:06,651 INFO L448 ceAbstractionStarter]: For program point L148(line 148) no Hoare annotation was computed. [2018-12-02 07:35:06,651 INFO L448 ceAbstractionStarter]: For program point mainErr13ASSERT_VIOLATIONERROR_FUNCTION(line 224) no Hoare annotation was computed. [2018-12-02 07:35:06,651 INFO L448 ceAbstractionStarter]: For program point L107(line 107) no Hoare annotation was computed. [2018-12-02 07:35:06,651 INFO L448 ceAbstractionStarter]: For program point mainErr2ASSERT_VIOLATIONERROR_FUNCTION(line 71) no Hoare annotation was computed. [2018-12-02 07:35:06,651 INFO L448 ceAbstractionStarter]: For program point L198(lines 198 268) no Hoare annotation was computed. [2018-12-02 07:35:06,651 INFO L448 ceAbstractionStarter]: For program point mainErr8ASSERT_VIOLATIONERROR_FUNCTION(line 160) no Hoare annotation was computed. [2018-12-02 07:35:06,651 INFO L448 ceAbstractionStarter]: For program point L33(lines 33 289) no Hoare annotation was computed. [2018-12-02 07:35:06,651 INFO L448 ceAbstractionStarter]: For program point mainErr9ASSERT_VIOLATIONERROR_FUNCTION(line 172) no Hoare annotation was computed. [2018-12-02 07:35:06,651 INFO L448 ceAbstractionStarter]: For program point mainErr10ASSERT_VIOLATIONERROR_FUNCTION(line 188) no Hoare annotation was computed. [2018-12-02 07:35:06,652 INFO L448 ceAbstractionStarter]: For program point L83(line 83) no Hoare annotation was computed. [2018-12-02 07:35:06,652 INFO L448 ceAbstractionStarter]: For program point L240(line 240) no Hoare annotation was computed. [2018-12-02 07:35:06,652 INFO L448 ceAbstractionStarter]: For program point mainErr7ASSERT_VIOLATIONERROR_FUNCTION(line 148) no Hoare annotation was computed. [2018-12-02 07:35:06,652 INFO L448 ceAbstractionStarter]: For program point L42(line 42) no Hoare annotation was computed. [2018-12-02 07:35:06,652 INFO L448 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 42) no Hoare annotation was computed. [2018-12-02 07:35:06,652 INFO L448 ceAbstractionStarter]: For program point L224(line 224) no Hoare annotation was computed. [2018-12-02 07:35:06,652 INFO L448 ceAbstractionStarter]: For program point L158(lines 158 274) no Hoare annotation was computed. [2018-12-02 07:35:06,652 INFO L448 ceAbstractionStarter]: For program point mainErr12ASSERT_VIOLATIONERROR_FUNCTION(line 212) no Hoare annotation was computed. [2018-12-02 07:35:06,652 INFO L444 ceAbstractionStarter]: At program point L299(lines 20 307) the Hoare annotation is: (and (<= 0 main_~main__i~0) (<= (+ main_~main__limit~0 4) main_~main__bufsize~0)) [2018-12-02 07:35:06,652 INFO L448 ceAbstractionStarter]: For program point L200(line 200) no Hoare annotation was computed. [2018-12-02 07:35:06,652 INFO L448 ceAbstractionStarter]: For program point mainErr15ASSERT_VIOLATIONERROR_FUNCTION(line 252) no Hoare annotation was computed. [2018-12-02 07:35:06,652 INFO L448 ceAbstractionStarter]: For program point L134(lines 134 278) no Hoare annotation was computed. [2018-12-02 07:35:06,661 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 07:35:06 BoogieIcfgContainer [2018-12-02 07:35:06,661 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-02 07:35:06,661 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-02 07:35:06,661 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-02 07:35:06,662 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-02 07:35:06,662 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 07:35:03" (3/4) ... [2018-12-02 07:35:06,664 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-02 07:35:06,668 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-12-02 07:35:06,668 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-12-02 07:35:06,671 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2018-12-02 07:35:06,672 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2018-12-02 07:35:06,708 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_c72add44-7054-424f-b174-d8517459e773/bin-2019/utaipan/witness.graphml [2018-12-02 07:35:06,708 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-02 07:35:06,708 INFO L168 Benchmark]: Toolchain (without parser) took 3174.71 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 287.8 MB). Free memory was 953.5 MB in the beginning and 1.3 GB in the end (delta: -320.2 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 07:35:06,709 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 973.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 07:35:06,709 INFO L168 Benchmark]: CACSL2BoogieTranslator took 144.38 ms. Allocated memory is still 1.0 GB. Free memory was 953.5 MB in the beginning and 937.4 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2018-12-02 07:35:06,709 INFO L168 Benchmark]: Boogie Procedure Inliner took 12.98 ms. Allocated memory is still 1.0 GB. Free memory is still 937.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 07:35:06,709 INFO L168 Benchmark]: Boogie Preprocessor took 46.00 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 151.0 MB). Free memory was 937.4 MB in the beginning and 1.1 GB in the end (delta: -205.9 MB). Peak memory consumption was 13.0 MB. Max. memory is 11.5 GB. [2018-12-02 07:35:06,709 INFO L168 Benchmark]: RCFGBuilder took 208.47 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: 24.1 MB). Peak memory consumption was 24.1 MB. Max. memory is 11.5 GB. [2018-12-02 07:35:06,710 INFO L168 Benchmark]: TraceAbstraction took 2713.33 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 136.8 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -165.4 MB). Peak memory consumption was 363.7 MB. Max. memory is 11.5 GB. [2018-12-02 07:35:06,710 INFO L168 Benchmark]: Witness Printer took 46.60 ms. Allocated memory is still 1.3 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 10.9 MB). Peak memory consumption was 10.9 MB. Max. memory is 11.5 GB. [2018-12-02 07:35:06,711 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 973.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 144.38 ms. Allocated memory is still 1.0 GB. Free memory was 953.5 MB in the beginning and 937.4 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 12.98 ms. Allocated memory is still 1.0 GB. Free memory is still 937.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 46.00 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 151.0 MB). Free memory was 937.4 MB in the beginning and 1.1 GB in the end (delta: -205.9 MB). Peak memory consumption was 13.0 MB. Max. memory is 11.5 GB. * RCFGBuilder took 208.47 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: 24.1 MB). Peak memory consumption was 24.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 2713.33 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 136.8 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -165.4 MB). Peak memory consumption was 363.7 MB. Max. memory is 11.5 GB. * Witness Printer took 46.60 ms. Allocated memory is still 1.3 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 10.9 MB). Peak memory consumption was 10.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 54]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 252]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 71]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 172]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 83]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 95]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 188]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 240]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 107]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 200]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 212]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 160]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 224]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 136]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 148]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 42]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 16 specifications checked. All of them hold - InvariantResult [Line: 20]: Loop Invariant Derived loop invariant: 0 <= main__i && main__limit + 4 <= main__bufsize - InvariantResult [Line: 26]: Loop Invariant Derived loop invariant: (((main__limit + 4 <= main__bufsize && 1 <= main__j && ((1 <= main__i && !(0 == __VERIFIER_assert__cond)) || (1 <= main__i && main__j + 4 <= main__bufsize))) && !(0 == __VERIFIER_assert__cond)) || ((main__limit + 4 <= main__bufsize && main__i < main__len && 0 <= main__i) && 0 <= main__j)) || ((main__limit + 4 <= main__bufsize && 1 <= main__j && ((1 <= main__i && !(0 == __VERIFIER_assert__cond)) || (1 <= main__i && main__j + 4 <= main__bufsize))) && main__j + 4 <= main__bufsize) - InvariantResult [Line: 33]: Loop Invariant Derived loop invariant: (((main__i < main__len && main__j + 5 <= main__bufsize) && 0 <= main__i) && main__limit + 4 <= main__bufsize) && 0 <= main__j - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 65 locations, 16 error locations. SAFE Result, 2.6s OverallTime, 16 OverallIterations, 1 TraceHistogramMax, 1.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.7s HoareAnnotationTime, HoareTripleCheckerStatistics: 917 SDtfs, 1559 SDslu, 1120 SDs, 0 SdLazy, 1186 SolverSat, 144 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 151 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=65occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 16 MinimizatonAttempts, 528 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 23 NumberOfFragments, 118 HoareAnnotationTreeSize, 7 FomulaSimplifications, 1474945965 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 7 FomulaSimplificationsInter, 1237784 FormulaSimplificationTreeSizeReductionInter, 0.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 294 NumberOfCodeBlocks, 294 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 278 ConstructedInterpolants, 0 QuantifiedInterpolants, 14171 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...