./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/locks/test_locks_12_true-unreach-call_true-valid-memsafety_false-termination.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_40d12c16-5225-490a-977c-c807ca323f09/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_40d12c16-5225-490a-977c-c807ca323f09/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_40d12c16-5225-490a-977c-c807ca323f09/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_40d12c16-5225-490a-977c-c807ca323f09/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/locks/test_locks_12_true-unreach-call_true-valid-memsafety_false-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_40d12c16-5225-490a-977c-c807ca323f09/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_40d12c16-5225-490a-977c-c807ca323f09/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 16b9ec98922e529d9b7488fe4b8a5dfd7426fa85 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 14:20:02,490 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 14:20:02,491 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 14:20:02,497 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 14:20:02,497 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 14:20:02,497 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 14:20:02,498 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 14:20:02,499 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 14:20:02,500 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 14:20:02,500 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 14:20:02,500 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 14:20:02,501 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 14:20:02,501 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 14:20:02,501 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 14:20:02,502 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 14:20:02,502 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 14:20:02,503 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 14:20:02,503 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 14:20:02,504 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 14:20:02,505 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 14:20:02,505 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 14:20:02,506 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 14:20:02,507 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 14:20:02,507 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 14:20:02,507 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 14:20:02,508 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 14:20:02,508 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 14:20:02,508 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 14:20:02,509 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 14:20:02,509 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 14:20:02,509 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 14:20:02,510 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 14:20:02,510 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 14:20:02,510 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 14:20:02,510 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 14:20:02,511 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 14:20:02,511 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_40d12c16-5225-490a-977c-c807ca323f09/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-02 14:20:02,518 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 14:20:02,518 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 14:20:02,518 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-02 14:20:02,519 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-02 14:20:02,519 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-02 14:20:02,519 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-02 14:20:02,519 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-02 14:20:02,519 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-02 14:20:02,519 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-02 14:20:02,519 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-02 14:20:02,519 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-02 14:20:02,519 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-02 14:20:02,519 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-02 14:20:02,520 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 14:20:02,520 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-02 14:20:02,520 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 14:20:02,520 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-02 14:20:02,520 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 14:20:02,520 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-02 14:20:02,520 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-02 14:20:02,520 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-02 14:20:02,520 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-02 14:20:02,521 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-02 14:20:02,521 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-02 14:20:02,521 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 14:20:02,521 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 14:20:02,521 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-02 14:20:02,521 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-02 14:20:02,521 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 14:20:02,521 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 14:20:02,521 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-02 14:20:02,521 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-02 14:20:02,521 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-02 14:20:02,522 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-02 14:20:02,522 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-02 14:20:02,522 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-02 14:20:02,522 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_40d12c16-5225-490a-977c-c807ca323f09/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 -> 16b9ec98922e529d9b7488fe4b8a5dfd7426fa85 [2018-12-02 14:20:02,539 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 14:20:02,548 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 14:20:02,551 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 14:20:02,552 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 14:20:02,552 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 14:20:02,553 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_40d12c16-5225-490a-977c-c807ca323f09/bin-2019/utaipan/../../sv-benchmarks/c/locks/test_locks_12_true-unreach-call_true-valid-memsafety_false-termination.c [2018-12-02 14:20:02,595 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_40d12c16-5225-490a-977c-c807ca323f09/bin-2019/utaipan/data/7e00434ac/1b2589d8ac7d4eea9fb69915c904def0/FLAG89a7dfa63 [2018-12-02 14:20:03,013 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 14:20:03,014 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_40d12c16-5225-490a-977c-c807ca323f09/sv-benchmarks/c/locks/test_locks_12_true-unreach-call_true-valid-memsafety_false-termination.c [2018-12-02 14:20:03,019 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_40d12c16-5225-490a-977c-c807ca323f09/bin-2019/utaipan/data/7e00434ac/1b2589d8ac7d4eea9fb69915c904def0/FLAG89a7dfa63 [2018-12-02 14:20:03,027 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_40d12c16-5225-490a-977c-c807ca323f09/bin-2019/utaipan/data/7e00434ac/1b2589d8ac7d4eea9fb69915c904def0 [2018-12-02 14:20:03,029 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 14:20:03,030 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 14:20:03,031 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 14:20:03,031 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 14:20:03,033 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 14:20:03,033 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 02:20:03" (1/1) ... [2018-12-02 14:20:03,035 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54724d61 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:20:03, skipping insertion in model container [2018-12-02 14:20:03,035 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 02:20:03" (1/1) ... [2018-12-02 14:20:03,039 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 14:20:03,050 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 14:20:03,141 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 14:20:03,143 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 14:20:03,158 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 14:20:03,166 INFO L195 MainTranslator]: Completed translation [2018-12-02 14:20:03,167 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:20:03 WrapperNode [2018-12-02 14:20:03,167 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 14:20:03,167 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 14:20:03,167 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 14:20:03,167 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 14:20:03,172 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:20:03" (1/1) ... [2018-12-02 14:20:03,175 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:20:03" (1/1) ... [2018-12-02 14:20:03,179 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 14:20:03,179 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 14:20:03,179 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 14:20:03,179 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 14:20:03,184 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:20:03" (1/1) ... [2018-12-02 14:20:03,185 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:20:03" (1/1) ... [2018-12-02 14:20:03,185 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:20:03" (1/1) ... [2018-12-02 14:20:03,185 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:20:03" (1/1) ... [2018-12-02 14:20:03,188 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:20:03" (1/1) ... [2018-12-02 14:20:03,222 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:20:03" (1/1) ... [2018-12-02 14:20:03,223 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:20:03" (1/1) ... [2018-12-02 14:20:03,224 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 14:20:03,225 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 14:20:03,225 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 14:20:03,225 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 14:20:03,226 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:20:03" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_40d12c16-5225-490a-977c-c807ca323f09/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 14:20:03,258 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-02 14:20:03,258 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-02 14:20:03,258 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 14:20:03,258 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 14:20:03,258 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-02 14:20:03,258 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-02 14:20:03,422 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 14:20:03,422 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-02 14:20:03,422 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 02:20:03 BoogieIcfgContainer [2018-12-02 14:20:03,423 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 14:20:03,423 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-02 14:20:03,423 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-02 14:20:03,425 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-02 14:20:03,425 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 02:20:03" (1/3) ... [2018-12-02 14:20:03,425 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24105b4a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 02:20:03, skipping insertion in model container [2018-12-02 14:20:03,425 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:20:03" (2/3) ... [2018-12-02 14:20:03,425 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24105b4a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 02:20:03, skipping insertion in model container [2018-12-02 14:20:03,426 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 02:20:03" (3/3) ... [2018-12-02 14:20:03,426 INFO L112 eAbstractionObserver]: Analyzing ICFG test_locks_12_true-unreach-call_true-valid-memsafety_false-termination.c [2018-12-02 14:20:03,432 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-02 14:20:03,436 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-02 14:20:03,445 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-02 14:20:03,464 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-02 14:20:03,464 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-02 14:20:03,464 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-02 14:20:03,464 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 14:20:03,464 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 14:20:03,464 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-02 14:20:03,464 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 14:20:03,464 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-02 14:20:03,475 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states. [2018-12-02 14:20:03,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-02 14:20:03,478 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:20:03,479 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 14:20:03,480 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 14:20:03,483 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:20:03,483 INFO L82 PathProgramCache]: Analyzing trace with hash -1339057171, now seen corresponding path program 1 times [2018-12-02 14:20:03,485 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:20:03,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:20:03,512 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:20:03,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:20:03,513 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:20:03,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:20:03,586 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 14:20:03,587 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 14:20:03,587 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 14:20:03,587 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 14:20:03,590 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 14:20:03,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 14:20:03,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 14:20:03,599 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 3 states. [2018-12-02 14:20:03,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:20:03,639 INFO L93 Difference]: Finished difference Result 99 states and 174 transitions. [2018-12-02 14:20:03,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 14:20:03,640 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-12-02 14:20:03,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:20:03,647 INFO L225 Difference]: With dead ends: 99 [2018-12-02 14:20:03,647 INFO L226 Difference]: Without dead ends: 84 [2018-12-02 14:20:03,648 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 14:20:03,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-12-02 14:20:03,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 58. [2018-12-02 14:20:03,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-12-02 14:20:03,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 105 transitions. [2018-12-02 14:20:03,672 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 105 transitions. Word has length 22 [2018-12-02 14:20:03,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:20:03,673 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 105 transitions. [2018-12-02 14:20:03,673 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 14:20:03,673 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 105 transitions. [2018-12-02 14:20:03,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-02 14:20:03,673 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:20:03,673 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 14:20:03,674 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 14:20:03,674 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:20:03,674 INFO L82 PathProgramCache]: Analyzing trace with hash 1676046447, now seen corresponding path program 1 times [2018-12-02 14:20:03,674 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:20:03,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:20:03,675 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:20:03,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:20:03,675 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:20:03,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:20:03,704 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 14:20:03,704 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 14:20:03,704 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 14:20:03,704 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 14:20:03,705 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 14:20:03,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 14:20:03,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 14:20:03,705 INFO L87 Difference]: Start difference. First operand 58 states and 105 transitions. Second operand 3 states. [2018-12-02 14:20:03,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:20:03,723 INFO L93 Difference]: Finished difference Result 137 states and 252 transitions. [2018-12-02 14:20:03,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 14:20:03,723 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-12-02 14:20:03,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:20:03,724 INFO L225 Difference]: With dead ends: 137 [2018-12-02 14:20:03,724 INFO L226 Difference]: Without dead ends: 84 [2018-12-02 14:20:03,725 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 14:20:03,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-12-02 14:20:03,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 82. [2018-12-02 14:20:03,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-12-02 14:20:03,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 149 transitions. [2018-12-02 14:20:03,730 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 149 transitions. Word has length 22 [2018-12-02 14:20:03,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:20:03,730 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 149 transitions. [2018-12-02 14:20:03,730 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 14:20:03,730 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 149 transitions. [2018-12-02 14:20:03,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-02 14:20:03,731 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:20:03,731 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 14:20:03,731 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 14:20:03,731 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:20:03,731 INFO L82 PathProgramCache]: Analyzing trace with hash 1439113391, now seen corresponding path program 1 times [2018-12-02 14:20:03,731 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:20:03,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:20:03,732 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:20:03,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:20:03,732 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:20:03,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:20:03,755 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 14:20:03,755 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 14:20:03,755 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 14:20:03,756 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 14:20:03,756 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 14:20:03,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 14:20:03,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 14:20:03,756 INFO L87 Difference]: Start difference. First operand 82 states and 149 transitions. Second operand 3 states. [2018-12-02 14:20:03,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:20:03,767 INFO L93 Difference]: Finished difference Result 126 states and 225 transitions. [2018-12-02 14:20:03,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 14:20:03,767 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-12-02 14:20:03,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:20:03,768 INFO L225 Difference]: With dead ends: 126 [2018-12-02 14:20:03,768 INFO L226 Difference]: Without dead ends: 87 [2018-12-02 14:20:03,768 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 14:20:03,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-12-02 14:20:03,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 85. [2018-12-02 14:20:03,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-12-02 14:20:03,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 151 transitions. [2018-12-02 14:20:03,773 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 151 transitions. Word has length 23 [2018-12-02 14:20:03,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:20:03,773 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 151 transitions. [2018-12-02 14:20:03,773 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 14:20:03,773 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 151 transitions. [2018-12-02 14:20:03,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-02 14:20:03,773 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:20:03,773 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 14:20:03,774 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 14:20:03,774 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:20:03,774 INFO L82 PathProgramCache]: Analyzing trace with hash 418045037, now seen corresponding path program 1 times [2018-12-02 14:20:03,774 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:20:03,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:20:03,774 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:20:03,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:20:03,775 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:20:03,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:20:03,792 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 14:20:03,793 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 14:20:03,793 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 14:20:03,793 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 14:20:03,793 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 14:20:03,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 14:20:03,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 14:20:03,793 INFO L87 Difference]: Start difference. First operand 85 states and 151 transitions. Second operand 3 states. [2018-12-02 14:20:03,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:20:03,803 INFO L93 Difference]: Finished difference Result 160 states and 288 transitions. [2018-12-02 14:20:03,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 14:20:03,803 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-12-02 14:20:03,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:20:03,804 INFO L225 Difference]: With dead ends: 160 [2018-12-02 14:20:03,804 INFO L226 Difference]: Without dead ends: 158 [2018-12-02 14:20:03,804 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 14:20:03,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-12-02 14:20:03,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 112. [2018-12-02 14:20:03,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-12-02 14:20:03,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 200 transitions. [2018-12-02 14:20:03,810 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 200 transitions. Word has length 23 [2018-12-02 14:20:03,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:20:03,810 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 200 transitions. [2018-12-02 14:20:03,810 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 14:20:03,810 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 200 transitions. [2018-12-02 14:20:03,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-02 14:20:03,811 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:20:03,811 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 14:20:03,811 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 14:20:03,811 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:20:03,811 INFO L82 PathProgramCache]: Analyzing trace with hash -861818641, now seen corresponding path program 1 times [2018-12-02 14:20:03,811 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:20:03,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:20:03,812 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:20:03,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:20:03,812 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:20:03,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:20:03,831 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 14:20:03,831 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 14:20:03,831 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 14:20:03,831 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 14:20:03,831 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 14:20:03,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 14:20:03,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 14:20:03,832 INFO L87 Difference]: Start difference. First operand 112 states and 200 transitions. Second operand 3 states. [2018-12-02 14:20:03,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:20:03,841 INFO L93 Difference]: Finished difference Result 264 states and 478 transitions. [2018-12-02 14:20:03,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 14:20:03,842 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-12-02 14:20:03,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:20:03,842 INFO L225 Difference]: With dead ends: 264 [2018-12-02 14:20:03,842 INFO L226 Difference]: Without dead ends: 160 [2018-12-02 14:20:03,843 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 14:20:03,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2018-12-02 14:20:03,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 158. [2018-12-02 14:20:03,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-12-02 14:20:03,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 282 transitions. [2018-12-02 14:20:03,849 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 282 transitions. Word has length 23 [2018-12-02 14:20:03,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:20:03,849 INFO L480 AbstractCegarLoop]: Abstraction has 158 states and 282 transitions. [2018-12-02 14:20:03,849 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 14:20:03,849 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 282 transitions. [2018-12-02 14:20:03,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-02 14:20:03,849 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:20:03,850 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 14:20:03,850 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 14:20:03,850 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:20:03,850 INFO L82 PathProgramCache]: Analyzing trace with hash 74707332, now seen corresponding path program 1 times [2018-12-02 14:20:03,850 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:20:03,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:20:03,851 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:20:03,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:20:03,851 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:20:03,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:20:03,871 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 14:20:03,872 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 14:20:03,872 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 14:20:03,872 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 14:20:03,872 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 14:20:03,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 14:20:03,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 14:20:03,873 INFO L87 Difference]: Start difference. First operand 158 states and 282 transitions. Second operand 3 states. [2018-12-02 14:20:03,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:20:03,881 INFO L93 Difference]: Finished difference Result 237 states and 421 transitions. [2018-12-02 14:20:03,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 14:20:03,882 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-12-02 14:20:03,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:20:03,882 INFO L225 Difference]: With dead ends: 237 [2018-12-02 14:20:03,882 INFO L226 Difference]: Without dead ends: 162 [2018-12-02 14:20:03,883 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 14:20:03,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2018-12-02 14:20:03,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 160. [2018-12-02 14:20:03,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2018-12-02 14:20:03,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 282 transitions. [2018-12-02 14:20:03,888 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 282 transitions. Word has length 24 [2018-12-02 14:20:03,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:20:03,888 INFO L480 AbstractCegarLoop]: Abstraction has 160 states and 282 transitions. [2018-12-02 14:20:03,888 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 14:20:03,888 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 282 transitions. [2018-12-02 14:20:03,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-02 14:20:03,889 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:20:03,889 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 14:20:03,889 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 14:20:03,889 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:20:03,889 INFO L82 PathProgramCache]: Analyzing trace with hash -946361022, now seen corresponding path program 1 times [2018-12-02 14:20:03,889 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:20:03,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:20:03,890 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:20:03,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:20:03,890 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:20:03,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:20:03,905 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 14:20:03,905 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 14:20:03,905 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 14:20:03,905 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 14:20:03,905 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 14:20:03,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 14:20:03,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 14:20:03,906 INFO L87 Difference]: Start difference. First operand 160 states and 282 transitions. Second operand 3 states. [2018-12-02 14:20:03,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:20:03,919 INFO L93 Difference]: Finished difference Result 300 states and 536 transitions. [2018-12-02 14:20:03,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 14:20:03,919 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-12-02 14:20:03,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:20:03,920 INFO L225 Difference]: With dead ends: 300 [2018-12-02 14:20:03,920 INFO L226 Difference]: Without dead ends: 298 [2018-12-02 14:20:03,921 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 14:20:03,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2018-12-02 14:20:03,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 216. [2018-12-02 14:20:03,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2018-12-02 14:20:03,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 378 transitions. [2018-12-02 14:20:03,930 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 378 transitions. Word has length 24 [2018-12-02 14:20:03,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:20:03,930 INFO L480 AbstractCegarLoop]: Abstraction has 216 states and 378 transitions. [2018-12-02 14:20:03,930 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 14:20:03,930 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 378 transitions. [2018-12-02 14:20:03,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-02 14:20:03,931 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:20:03,931 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 14:20:03,931 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 14:20:03,931 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:20:03,931 INFO L82 PathProgramCache]: Analyzing trace with hash 2068742596, now seen corresponding path program 1 times [2018-12-02 14:20:03,932 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:20:03,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:20:03,932 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:20:03,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:20:03,932 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:20:03,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:20:03,951 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 14:20:03,952 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 14:20:03,952 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 14:20:03,952 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 14:20:03,952 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 14:20:03,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 14:20:03,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 14:20:03,952 INFO L87 Difference]: Start difference. First operand 216 states and 378 transitions. Second operand 3 states. [2018-12-02 14:20:03,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:20:03,963 INFO L93 Difference]: Finished difference Result 512 states and 904 transitions. [2018-12-02 14:20:03,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 14:20:03,963 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-12-02 14:20:03,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:20:03,964 INFO L225 Difference]: With dead ends: 512 [2018-12-02 14:20:03,964 INFO L226 Difference]: Without dead ends: 306 [2018-12-02 14:20:03,964 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 14:20:03,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2018-12-02 14:20:03,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 304. [2018-12-02 14:20:03,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 304 states. [2018-12-02 14:20:03,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 530 transitions. [2018-12-02 14:20:03,970 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 530 transitions. Word has length 24 [2018-12-02 14:20:03,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:20:03,970 INFO L480 AbstractCegarLoop]: Abstraction has 304 states and 530 transitions. [2018-12-02 14:20:03,970 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 14:20:03,971 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 530 transitions. [2018-12-02 14:20:03,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-02 14:20:03,971 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:20:03,971 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 14:20:03,971 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 14:20:03,972 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:20:03,972 INFO L82 PathProgramCache]: Analyzing trace with hash 727792804, now seen corresponding path program 1 times [2018-12-02 14:20:03,972 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:20:03,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:20:03,972 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:20:03,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:20:03,972 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:20:03,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:20:03,984 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 14:20:03,984 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 14:20:03,984 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 14:20:03,984 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 14:20:03,984 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 14:20:03,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 14:20:03,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 14:20:03,984 INFO L87 Difference]: Start difference. First operand 304 states and 530 transitions. Second operand 3 states. [2018-12-02 14:20:03,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:20:03,998 INFO L93 Difference]: Finished difference Result 456 states and 792 transitions. [2018-12-02 14:20:03,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 14:20:03,998 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-12-02 14:20:03,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:20:03,999 INFO L225 Difference]: With dead ends: 456 [2018-12-02 14:20:03,999 INFO L226 Difference]: Without dead ends: 310 [2018-12-02 14:20:04,000 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 14:20:04,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2018-12-02 14:20:04,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 308. [2018-12-02 14:20:04,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 308 states. [2018-12-02 14:20:04,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 530 transitions. [2018-12-02 14:20:04,008 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 530 transitions. Word has length 25 [2018-12-02 14:20:04,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:20:04,009 INFO L480 AbstractCegarLoop]: Abstraction has 308 states and 530 transitions. [2018-12-02 14:20:04,009 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 14:20:04,009 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 530 transitions. [2018-12-02 14:20:04,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-02 14:20:04,010 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:20:04,010 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 14:20:04,010 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 14:20:04,010 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:20:04,010 INFO L82 PathProgramCache]: Analyzing trace with hash -293275550, now seen corresponding path program 1 times [2018-12-02 14:20:04,010 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:20:04,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:20:04,011 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:20:04,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:20:04,011 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:20:04,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:20:04,028 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 14:20:04,029 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 14:20:04,029 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 14:20:04,029 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 14:20:04,029 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 14:20:04,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 14:20:04,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 14:20:04,030 INFO L87 Difference]: Start difference. First operand 308 states and 530 transitions. Second operand 3 states. [2018-12-02 14:20:04,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:20:04,047 INFO L93 Difference]: Finished difference Result 572 states and 1000 transitions. [2018-12-02 14:20:04,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 14:20:04,047 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-12-02 14:20:04,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:20:04,049 INFO L225 Difference]: With dead ends: 572 [2018-12-02 14:20:04,050 INFO L226 Difference]: Without dead ends: 570 [2018-12-02 14:20:04,050 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 14:20:04,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2018-12-02 14:20:04,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 424. [2018-12-02 14:20:04,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 424 states. [2018-12-02 14:20:04,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 424 states and 718 transitions. [2018-12-02 14:20:04,061 INFO L78 Accepts]: Start accepts. Automaton has 424 states and 718 transitions. Word has length 25 [2018-12-02 14:20:04,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:20:04,061 INFO L480 AbstractCegarLoop]: Abstraction has 424 states and 718 transitions. [2018-12-02 14:20:04,061 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 14:20:04,061 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 718 transitions. [2018-12-02 14:20:04,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-02 14:20:04,062 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:20:04,062 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 14:20:04,062 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 14:20:04,062 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:20:04,062 INFO L82 PathProgramCache]: Analyzing trace with hash -1573139228, now seen corresponding path program 1 times [2018-12-02 14:20:04,062 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:20:04,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:20:04,063 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:20:04,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:20:04,063 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:20:04,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:20:04,076 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 14:20:04,076 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 14:20:04,077 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 14:20:04,077 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 14:20:04,077 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 14:20:04,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 14:20:04,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 14:20:04,078 INFO L87 Difference]: Start difference. First operand 424 states and 718 transitions. Second operand 3 states. [2018-12-02 14:20:04,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:20:04,100 INFO L93 Difference]: Finished difference Result 1004 states and 1712 transitions. [2018-12-02 14:20:04,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 14:20:04,101 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-12-02 14:20:04,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:20:04,103 INFO L225 Difference]: With dead ends: 1004 [2018-12-02 14:20:04,103 INFO L226 Difference]: Without dead ends: 594 [2018-12-02 14:20:04,104 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 14:20:04,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2018-12-02 14:20:04,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 592. [2018-12-02 14:20:04,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 592 states. [2018-12-02 14:20:04,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 998 transitions. [2018-12-02 14:20:04,118 INFO L78 Accepts]: Start accepts. Automaton has 592 states and 998 transitions. Word has length 25 [2018-12-02 14:20:04,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:20:04,118 INFO L480 AbstractCegarLoop]: Abstraction has 592 states and 998 transitions. [2018-12-02 14:20:04,118 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 14:20:04,118 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 998 transitions. [2018-12-02 14:20:04,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-02 14:20:04,119 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:20:04,119 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, 1] [2018-12-02 14:20:04,119 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 14:20:04,119 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:20:04,119 INFO L82 PathProgramCache]: Analyzing trace with hash -501393703, now seen corresponding path program 1 times [2018-12-02 14:20:04,119 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:20:04,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:20:04,120 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:20:04,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:20:04,120 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:20:04,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:20:04,133 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 14:20:04,133 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 14:20:04,133 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 14:20:04,133 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 14:20:04,134 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 14:20:04,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 14:20:04,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 14:20:04,134 INFO L87 Difference]: Start difference. First operand 592 states and 998 transitions. Second operand 3 states. [2018-12-02 14:20:04,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:20:04,153 INFO L93 Difference]: Finished difference Result 888 states and 1492 transitions. [2018-12-02 14:20:04,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 14:20:04,153 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-12-02 14:20:04,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:20:04,155 INFO L225 Difference]: With dead ends: 888 [2018-12-02 14:20:04,155 INFO L226 Difference]: Without dead ends: 602 [2018-12-02 14:20:04,156 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 14:20:04,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2018-12-02 14:20:04,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 600. [2018-12-02 14:20:04,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 600 states. [2018-12-02 14:20:04,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 998 transitions. [2018-12-02 14:20:04,173 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 998 transitions. Word has length 26 [2018-12-02 14:20:04,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:20:04,174 INFO L480 AbstractCegarLoop]: Abstraction has 600 states and 998 transitions. [2018-12-02 14:20:04,174 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 14:20:04,174 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 998 transitions. [2018-12-02 14:20:04,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-02 14:20:04,175 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:20:04,175 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, 1] [2018-12-02 14:20:04,175 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 14:20:04,175 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:20:04,175 INFO L82 PathProgramCache]: Analyzing trace with hash -1522462057, now seen corresponding path program 1 times [2018-12-02 14:20:04,175 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:20:04,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:20:04,176 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:20:04,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:20:04,177 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:20:04,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:20:04,192 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 14:20:04,192 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 14:20:04,192 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 14:20:04,192 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 14:20:04,193 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 14:20:04,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 14:20:04,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 14:20:04,193 INFO L87 Difference]: Start difference. First operand 600 states and 998 transitions. Second operand 3 states. [2018-12-02 14:20:04,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:20:04,222 INFO L93 Difference]: Finished difference Result 1100 states and 1864 transitions. [2018-12-02 14:20:04,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 14:20:04,223 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-12-02 14:20:04,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:20:04,226 INFO L225 Difference]: With dead ends: 1100 [2018-12-02 14:20:04,226 INFO L226 Difference]: Without dead ends: 1098 [2018-12-02 14:20:04,227 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 14:20:04,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1098 states. [2018-12-02 14:20:04,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1098 to 840. [2018-12-02 14:20:04,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 840 states. [2018-12-02 14:20:04,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 840 states to 840 states and 1366 transitions. [2018-12-02 14:20:04,253 INFO L78 Accepts]: Start accepts. Automaton has 840 states and 1366 transitions. Word has length 26 [2018-12-02 14:20:04,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:20:04,253 INFO L480 AbstractCegarLoop]: Abstraction has 840 states and 1366 transitions. [2018-12-02 14:20:04,253 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 14:20:04,253 INFO L276 IsEmpty]: Start isEmpty. Operand 840 states and 1366 transitions. [2018-12-02 14:20:04,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-02 14:20:04,254 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:20:04,255 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, 1] [2018-12-02 14:20:04,255 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 14:20:04,255 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:20:04,255 INFO L82 PathProgramCache]: Analyzing trace with hash 1492641561, now seen corresponding path program 1 times [2018-12-02 14:20:04,255 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:20:04,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:20:04,256 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:20:04,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:20:04,256 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:20:04,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:20:04,272 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 14:20:04,272 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 14:20:04,273 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 14:20:04,273 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 14:20:04,273 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 14:20:04,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 14:20:04,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 14:20:04,273 INFO L87 Difference]: Start difference. First operand 840 states and 1366 transitions. Second operand 3 states. [2018-12-02 14:20:04,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:20:04,305 INFO L93 Difference]: Finished difference Result 1980 states and 3240 transitions. [2018-12-02 14:20:04,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 14:20:04,306 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-12-02 14:20:04,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:20:04,309 INFO L225 Difference]: With dead ends: 1980 [2018-12-02 14:20:04,309 INFO L226 Difference]: Without dead ends: 1162 [2018-12-02 14:20:04,311 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 14:20:04,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1162 states. [2018-12-02 14:20:04,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1162 to 1160. [2018-12-02 14:20:04,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1160 states. [2018-12-02 14:20:04,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1160 states to 1160 states and 1878 transitions. [2018-12-02 14:20:04,336 INFO L78 Accepts]: Start accepts. Automaton has 1160 states and 1878 transitions. Word has length 26 [2018-12-02 14:20:04,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:20:04,336 INFO L480 AbstractCegarLoop]: Abstraction has 1160 states and 1878 transitions. [2018-12-02 14:20:04,336 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 14:20:04,336 INFO L276 IsEmpty]: Start isEmpty. Operand 1160 states and 1878 transitions. [2018-12-02 14:20:04,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-02 14:20:04,337 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:20:04,337 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, 1, 1] [2018-12-02 14:20:04,338 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 14:20:04,338 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:20:04,338 INFO L82 PathProgramCache]: Analyzing trace with hash 48530585, now seen corresponding path program 1 times [2018-12-02 14:20:04,338 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:20:04,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:20:04,338 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:20:04,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:20:04,338 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:20:04,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:20:04,353 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 14:20:04,353 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 14:20:04,353 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 14:20:04,353 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 14:20:04,353 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 14:20:04,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 14:20:04,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 14:20:04,354 INFO L87 Difference]: Start difference. First operand 1160 states and 1878 transitions. Second operand 3 states. [2018-12-02 14:20:04,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:20:04,384 INFO L93 Difference]: Finished difference Result 1740 states and 2808 transitions. [2018-12-02 14:20:04,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 14:20:04,385 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-12-02 14:20:04,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:20:04,388 INFO L225 Difference]: With dead ends: 1740 [2018-12-02 14:20:04,388 INFO L226 Difference]: Without dead ends: 1178 [2018-12-02 14:20:04,390 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 14:20:04,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1178 states. [2018-12-02 14:20:04,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1178 to 1176. [2018-12-02 14:20:04,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1176 states. [2018-12-02 14:20:04,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1176 states to 1176 states and 1878 transitions. [2018-12-02 14:20:04,420 INFO L78 Accepts]: Start accepts. Automaton has 1176 states and 1878 transitions. Word has length 27 [2018-12-02 14:20:04,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:20:04,420 INFO L480 AbstractCegarLoop]: Abstraction has 1176 states and 1878 transitions. [2018-12-02 14:20:04,421 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 14:20:04,421 INFO L276 IsEmpty]: Start isEmpty. Operand 1176 states and 1878 transitions. [2018-12-02 14:20:04,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-02 14:20:04,421 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:20:04,422 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, 1, 1] [2018-12-02 14:20:04,422 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 14:20:04,422 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:20:04,422 INFO L82 PathProgramCache]: Analyzing trace with hash -972537769, now seen corresponding path program 1 times [2018-12-02 14:20:04,422 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:20:04,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:20:04,423 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:20:04,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:20:04,423 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:20:04,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:20:04,436 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 14:20:04,437 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 14:20:04,437 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 14:20:04,437 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 14:20:04,437 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 14:20:04,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 14:20:04,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 14:20:04,438 INFO L87 Difference]: Start difference. First operand 1176 states and 1878 transitions. Second operand 3 states. [2018-12-02 14:20:04,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:20:04,474 INFO L93 Difference]: Finished difference Result 2124 states and 3464 transitions. [2018-12-02 14:20:04,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 14:20:04,475 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-12-02 14:20:04,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:20:04,481 INFO L225 Difference]: With dead ends: 2124 [2018-12-02 14:20:04,481 INFO L226 Difference]: Without dead ends: 2122 [2018-12-02 14:20:04,482 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 14:20:04,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2122 states. [2018-12-02 14:20:04,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2122 to 1672. [2018-12-02 14:20:04,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1672 states. [2018-12-02 14:20:04,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1672 states to 1672 states and 2598 transitions. [2018-12-02 14:20:04,526 INFO L78 Accepts]: Start accepts. Automaton has 1672 states and 2598 transitions. Word has length 27 [2018-12-02 14:20:04,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:20:04,527 INFO L480 AbstractCegarLoop]: Abstraction has 1672 states and 2598 transitions. [2018-12-02 14:20:04,527 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 14:20:04,527 INFO L276 IsEmpty]: Start isEmpty. Operand 1672 states and 2598 transitions. [2018-12-02 14:20:04,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-02 14:20:04,528 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:20:04,528 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, 1, 1] [2018-12-02 14:20:04,529 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 14:20:04,529 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:20:04,529 INFO L82 PathProgramCache]: Analyzing trace with hash 2042565849, now seen corresponding path program 1 times [2018-12-02 14:20:04,529 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:20:04,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:20:04,530 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:20:04,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:20:04,530 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:20:04,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:20:04,539 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 14:20:04,539 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 14:20:04,539 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 14:20:04,539 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 14:20:04,540 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 14:20:04,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 14:20:04,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 14:20:04,540 INFO L87 Difference]: Start difference. First operand 1672 states and 2598 transitions. Second operand 3 states. [2018-12-02 14:20:04,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:20:04,587 INFO L93 Difference]: Finished difference Result 3916 states and 6120 transitions. [2018-12-02 14:20:04,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 14:20:04,587 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-12-02 14:20:04,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:20:04,593 INFO L225 Difference]: With dead ends: 3916 [2018-12-02 14:20:04,594 INFO L226 Difference]: Without dead ends: 2282 [2018-12-02 14:20:04,596 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 14:20:04,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2282 states. [2018-12-02 14:20:04,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2282 to 2280. [2018-12-02 14:20:04,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2280 states. [2018-12-02 14:20:04,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2280 states to 2280 states and 3526 transitions. [2018-12-02 14:20:04,650 INFO L78 Accepts]: Start accepts. Automaton has 2280 states and 3526 transitions. Word has length 27 [2018-12-02 14:20:04,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:20:04,650 INFO L480 AbstractCegarLoop]: Abstraction has 2280 states and 3526 transitions. [2018-12-02 14:20:04,651 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 14:20:04,651 INFO L276 IsEmpty]: Start isEmpty. Operand 2280 states and 3526 transitions. [2018-12-02 14:20:04,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-02 14:20:04,652 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:20:04,652 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, 1, 1, 1] [2018-12-02 14:20:04,652 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 14:20:04,653 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:20:04,653 INFO L82 PathProgramCache]: Analyzing trace with hash -83685330, now seen corresponding path program 1 times [2018-12-02 14:20:04,653 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:20:04,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:20:04,653 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:20:04,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:20:04,654 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:20:04,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:20:04,662 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 14:20:04,662 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 14:20:04,662 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 14:20:04,662 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 14:20:04,663 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 14:20:04,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 14:20:04,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 14:20:04,663 INFO L87 Difference]: Start difference. First operand 2280 states and 3526 transitions. Second operand 3 states. [2018-12-02 14:20:04,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:20:04,704 INFO L93 Difference]: Finished difference Result 3420 states and 5272 transitions. [2018-12-02 14:20:04,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 14:20:04,705 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-12-02 14:20:04,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:20:04,711 INFO L225 Difference]: With dead ends: 3420 [2018-12-02 14:20:04,711 INFO L226 Difference]: Without dead ends: 2314 [2018-12-02 14:20:04,713 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 14:20:04,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2314 states. [2018-12-02 14:20:04,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2314 to 2312. [2018-12-02 14:20:04,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2312 states. [2018-12-02 14:20:04,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2312 states to 2312 states and 3526 transitions. [2018-12-02 14:20:04,770 INFO L78 Accepts]: Start accepts. Automaton has 2312 states and 3526 transitions. Word has length 28 [2018-12-02 14:20:04,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:20:04,770 INFO L480 AbstractCegarLoop]: Abstraction has 2312 states and 3526 transitions. [2018-12-02 14:20:04,770 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 14:20:04,770 INFO L276 IsEmpty]: Start isEmpty. Operand 2312 states and 3526 transitions. [2018-12-02 14:20:04,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-02 14:20:04,772 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:20:04,772 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, 1, 1, 1] [2018-12-02 14:20:04,773 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 14:20:04,773 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:20:04,773 INFO L82 PathProgramCache]: Analyzing trace with hash -1104753684, now seen corresponding path program 1 times [2018-12-02 14:20:04,773 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:20:04,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:20:04,774 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:20:04,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:20:04,774 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:20:04,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:20:04,782 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 14:20:04,783 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 14:20:04,783 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 14:20:04,783 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 14:20:04,783 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 14:20:04,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 14:20:04,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 14:20:04,784 INFO L87 Difference]: Start difference. First operand 2312 states and 3526 transitions. Second operand 3 states. [2018-12-02 14:20:04,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:20:04,845 INFO L93 Difference]: Finished difference Result 4108 states and 6408 transitions. [2018-12-02 14:20:04,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 14:20:04,845 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-12-02 14:20:04,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:20:04,853 INFO L225 Difference]: With dead ends: 4108 [2018-12-02 14:20:04,853 INFO L226 Difference]: Without dead ends: 4106 [2018-12-02 14:20:04,854 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 14:20:04,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4106 states. [2018-12-02 14:20:04,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4106 to 3336. [2018-12-02 14:20:04,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3336 states. [2018-12-02 14:20:04,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3336 states to 3336 states and 4934 transitions. [2018-12-02 14:20:04,905 INFO L78 Accepts]: Start accepts. Automaton has 3336 states and 4934 transitions. Word has length 28 [2018-12-02 14:20:04,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:20:04,906 INFO L480 AbstractCegarLoop]: Abstraction has 3336 states and 4934 transitions. [2018-12-02 14:20:04,906 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 14:20:04,906 INFO L276 IsEmpty]: Start isEmpty. Operand 3336 states and 4934 transitions. [2018-12-02 14:20:04,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-02 14:20:04,908 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:20:04,908 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, 1, 1, 1] [2018-12-02 14:20:04,909 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 14:20:04,909 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:20:04,909 INFO L82 PathProgramCache]: Analyzing trace with hash 1910349934, now seen corresponding path program 1 times [2018-12-02 14:20:04,909 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:20:04,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:20:04,910 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:20:04,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:20:04,910 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:20:04,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:20:04,919 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 14:20:04,919 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 14:20:04,919 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 14:20:04,920 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 14:20:04,920 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 14:20:04,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 14:20:04,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 14:20:04,920 INFO L87 Difference]: Start difference. First operand 3336 states and 4934 transitions. Second operand 3 states. [2018-12-02 14:20:04,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:20:04,974 INFO L93 Difference]: Finished difference Result 7756 states and 11528 transitions. [2018-12-02 14:20:04,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 14:20:04,974 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-12-02 14:20:04,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:20:04,985 INFO L225 Difference]: With dead ends: 7756 [2018-12-02 14:20:04,985 INFO L226 Difference]: Without dead ends: 4490 [2018-12-02 14:20:04,990 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 14:20:04,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4490 states. [2018-12-02 14:20:05,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4490 to 4488. [2018-12-02 14:20:05,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4488 states. [2018-12-02 14:20:05,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4488 states to 4488 states and 6598 transitions. [2018-12-02 14:20:05,077 INFO L78 Accepts]: Start accepts. Automaton has 4488 states and 6598 transitions. Word has length 28 [2018-12-02 14:20:05,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:20:05,078 INFO L480 AbstractCegarLoop]: Abstraction has 4488 states and 6598 transitions. [2018-12-02 14:20:05,078 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 14:20:05,078 INFO L276 IsEmpty]: Start isEmpty. Operand 4488 states and 6598 transitions. [2018-12-02 14:20:05,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-12-02 14:20:05,080 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:20:05,080 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, 1, 1, 1, 1] [2018-12-02 14:20:05,080 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 14:20:05,080 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:20:05,080 INFO L82 PathProgramCache]: Analyzing trace with hash 112588942, now seen corresponding path program 1 times [2018-12-02 14:20:05,080 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:20:05,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:20:05,081 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:20:05,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:20:05,081 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:20:05,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:20:05,088 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 14:20:05,088 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 14:20:05,088 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 14:20:05,088 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 14:20:05,088 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 14:20:05,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 14:20:05,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 14:20:05,089 INFO L87 Difference]: Start difference. First operand 4488 states and 6598 transitions. Second operand 3 states. [2018-12-02 14:20:05,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:20:05,157 INFO L93 Difference]: Finished difference Result 6732 states and 9864 transitions. [2018-12-02 14:20:05,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 14:20:05,157 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-12-02 14:20:05,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:20:05,164 INFO L225 Difference]: With dead ends: 6732 [2018-12-02 14:20:05,164 INFO L226 Difference]: Without dead ends: 4554 [2018-12-02 14:20:05,166 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 14:20:05,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4554 states. [2018-12-02 14:20:05,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4554 to 4552. [2018-12-02 14:20:05,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4552 states. [2018-12-02 14:20:05,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4552 states to 4552 states and 6598 transitions. [2018-12-02 14:20:05,229 INFO L78 Accepts]: Start accepts. Automaton has 4552 states and 6598 transitions. Word has length 29 [2018-12-02 14:20:05,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:20:05,229 INFO L480 AbstractCegarLoop]: Abstraction has 4552 states and 6598 transitions. [2018-12-02 14:20:05,229 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 14:20:05,229 INFO L276 IsEmpty]: Start isEmpty. Operand 4552 states and 6598 transitions. [2018-12-02 14:20:05,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-12-02 14:20:05,232 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:20:05,232 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, 1, 1, 1, 1] [2018-12-02 14:20:05,232 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 14:20:05,232 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:20:05,232 INFO L82 PathProgramCache]: Analyzing trace with hash -908479412, now seen corresponding path program 1 times [2018-12-02 14:20:05,232 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:20:05,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:20:05,233 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:20:05,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:20:05,233 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:20:05,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:20:05,243 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 14:20:05,243 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 14:20:05,243 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 14:20:05,243 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 14:20:05,243 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 14:20:05,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 14:20:05,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 14:20:05,244 INFO L87 Difference]: Start difference. First operand 4552 states and 6598 transitions. Second operand 3 states. [2018-12-02 14:20:05,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:20:05,358 INFO L93 Difference]: Finished difference Result 13260 states and 19016 transitions. [2018-12-02 14:20:05,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 14:20:05,359 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-12-02 14:20:05,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:20:05,374 INFO L225 Difference]: With dead ends: 13260 [2018-12-02 14:20:05,374 INFO L226 Difference]: Without dead ends: 8842 [2018-12-02 14:20:05,381 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 14:20:05,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8842 states. [2018-12-02 14:20:05,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8842 to 8840. [2018-12-02 14:20:05,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8840 states. [2018-12-02 14:20:05,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8840 states to 8840 states and 12422 transitions. [2018-12-02 14:20:05,495 INFO L78 Accepts]: Start accepts. Automaton has 8840 states and 12422 transitions. Word has length 29 [2018-12-02 14:20:05,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:20:05,495 INFO L480 AbstractCegarLoop]: Abstraction has 8840 states and 12422 transitions. [2018-12-02 14:20:05,495 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 14:20:05,495 INFO L276 IsEmpty]: Start isEmpty. Operand 8840 states and 12422 transitions. [2018-12-02 14:20:05,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-12-02 14:20:05,499 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:20:05,499 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, 1, 1, 1, 1] [2018-12-02 14:20:05,500 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 14:20:05,500 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:20:05,500 INFO L82 PathProgramCache]: Analyzing trace with hash 371384266, now seen corresponding path program 1 times [2018-12-02 14:20:05,500 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:20:05,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:20:05,501 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:20:05,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:20:05,501 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:20:05,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:20:05,509 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 14:20:05,509 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 14:20:05,509 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 14:20:05,509 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 14:20:05,509 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 14:20:05,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 14:20:05,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 14:20:05,510 INFO L87 Difference]: Start difference. First operand 8840 states and 12422 transitions. Second operand 3 states. [2018-12-02 14:20:05,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:20:05,642 INFO L93 Difference]: Finished difference Result 10124 states and 14728 transitions. [2018-12-02 14:20:05,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 14:20:05,643 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-12-02 14:20:05,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:20:05,655 INFO L225 Difference]: With dead ends: 10124 [2018-12-02 14:20:05,655 INFO L226 Difference]: Without dead ends: 10122 [2018-12-02 14:20:05,657 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 14:20:05,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10122 states. [2018-12-02 14:20:05,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10122 to 8840. [2018-12-02 14:20:05,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8840 states. [2018-12-02 14:20:05,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8840 states to 8840 states and 12294 transitions. [2018-12-02 14:20:05,796 INFO L78 Accepts]: Start accepts. Automaton has 8840 states and 12294 transitions. Word has length 29 [2018-12-02 14:20:05,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:20:05,796 INFO L480 AbstractCegarLoop]: Abstraction has 8840 states and 12294 transitions. [2018-12-02 14:20:05,796 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 14:20:05,797 INFO L276 IsEmpty]: Start isEmpty. Operand 8840 states and 12294 transitions. [2018-12-02 14:20:05,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-02 14:20:05,801 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:20:05,801 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, 1, 1, 1, 1, 1] [2018-12-02 14:20:05,801 INFO L423 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 14:20:05,801 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:20:05,801 INFO L82 PathProgramCache]: Analyzing trace with hash 1902124419, now seen corresponding path program 1 times [2018-12-02 14:20:05,801 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:20:05,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:20:05,802 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:20:05,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:20:05,802 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:20:05,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:20:05,815 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 14:20:05,815 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 14:20:05,815 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 14:20:05,815 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 14:20:05,815 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 14:20:05,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 14:20:05,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 14:20:05,816 INFO L87 Difference]: Start difference. First operand 8840 states and 12294 transitions. Second operand 3 states. [2018-12-02 14:20:05,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:20:05,972 INFO L93 Difference]: Finished difference Result 15244 states and 21640 transitions. [2018-12-02 14:20:05,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 14:20:05,973 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-12-02 14:20:05,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:20:05,996 INFO L225 Difference]: With dead ends: 15244 [2018-12-02 14:20:05,996 INFO L226 Difference]: Without dead ends: 15242 [2018-12-02 14:20:06,000 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 14:20:06,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15242 states. [2018-12-02 14:20:06,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15242 to 13192. [2018-12-02 14:20:06,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13192 states. [2018-12-02 14:20:06,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13192 states to 13192 states and 17798 transitions. [2018-12-02 14:20:06,159 INFO L78 Accepts]: Start accepts. Automaton has 13192 states and 17798 transitions. Word has length 30 [2018-12-02 14:20:06,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:20:06,159 INFO L480 AbstractCegarLoop]: Abstraction has 13192 states and 17798 transitions. [2018-12-02 14:20:06,159 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 14:20:06,159 INFO L276 IsEmpty]: Start isEmpty. Operand 13192 states and 17798 transitions. [2018-12-02 14:20:06,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-02 14:20:06,167 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:20:06,167 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, 1, 1, 1, 1, 1] [2018-12-02 14:20:06,167 INFO L423 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 14:20:06,167 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:20:06,167 INFO L82 PathProgramCache]: Analyzing trace with hash 622260741, now seen corresponding path program 1 times [2018-12-02 14:20:06,167 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:20:06,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:20:06,168 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:20:06,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:20:06,168 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:20:06,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:20:06,177 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 14:20:06,177 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 14:20:06,177 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 14:20:06,177 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 14:20:06,177 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 14:20:06,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 14:20:06,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 14:20:06,178 INFO L87 Difference]: Start difference. First operand 13192 states and 17798 transitions. Second operand 3 states. [2018-12-02 14:20:06,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:20:06,344 INFO L93 Difference]: Finished difference Result 30348 states and 41096 transitions. [2018-12-02 14:20:06,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 14:20:06,344 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-12-02 14:20:06,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:20:06,358 INFO L225 Difference]: With dead ends: 30348 [2018-12-02 14:20:06,358 INFO L226 Difference]: Without dead ends: 17290 [2018-12-02 14:20:06,367 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 14:20:06,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17290 states. [2018-12-02 14:20:06,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17290 to 17288. [2018-12-02 14:20:06,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17288 states. [2018-12-02 14:20:06,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17288 states to 17288 states and 23046 transitions. [2018-12-02 14:20:06,559 INFO L78 Accepts]: Start accepts. Automaton has 17288 states and 23046 transitions. Word has length 30 [2018-12-02 14:20:06,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:20:06,559 INFO L480 AbstractCegarLoop]: Abstraction has 17288 states and 23046 transitions. [2018-12-02 14:20:06,559 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 14:20:06,559 INFO L276 IsEmpty]: Start isEmpty. Operand 17288 states and 23046 transitions. [2018-12-02 14:20:06,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-02 14:20:06,565 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:20:06,565 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, 1, 1, 1, 1, 1, 1] [2018-12-02 14:20:06,565 INFO L423 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 14:20:06,565 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:20:06,565 INFO L82 PathProgramCache]: Analyzing trace with hash -1163469695, now seen corresponding path program 1 times [2018-12-02 14:20:06,566 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:20:06,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:20:06,566 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:20:06,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:20:06,566 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:20:06,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:20:06,577 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 14:20:06,577 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 14:20:06,577 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 14:20:06,577 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 14:20:06,577 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 14:20:06,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 14:20:06,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 14:20:06,577 INFO L87 Difference]: Start difference. First operand 17288 states and 23046 transitions. Second operand 3 states. [2018-12-02 14:20:06,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:20:06,714 INFO L93 Difference]: Finished difference Result 26124 states and 34824 transitions. [2018-12-02 14:20:06,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 14:20:06,714 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-12-02 14:20:06,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:20:06,726 INFO L225 Difference]: With dead ends: 26124 [2018-12-02 14:20:06,726 INFO L226 Difference]: Without dead ends: 17674 [2018-12-02 14:20:06,734 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 14:20:06,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17674 states. [2018-12-02 14:20:06,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17674 to 17672. [2018-12-02 14:20:06,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17672 states. [2018-12-02 14:20:06,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17672 states to 17672 states and 23302 transitions. [2018-12-02 14:20:06,965 INFO L78 Accepts]: Start accepts. Automaton has 17672 states and 23302 transitions. Word has length 31 [2018-12-02 14:20:06,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:20:06,965 INFO L480 AbstractCegarLoop]: Abstraction has 17672 states and 23302 transitions. [2018-12-02 14:20:06,965 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 14:20:06,965 INFO L276 IsEmpty]: Start isEmpty. Operand 17672 states and 23302 transitions. [2018-12-02 14:20:06,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-02 14:20:06,971 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:20:06,971 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, 1, 1, 1, 1, 1, 1] [2018-12-02 14:20:06,971 INFO L423 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 14:20:06,971 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:20:06,971 INFO L82 PathProgramCache]: Analyzing trace with hash 2110429247, now seen corresponding path program 1 times [2018-12-02 14:20:06,971 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:20:06,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:20:06,972 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:20:06,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:20:06,972 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:20:06,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:20:06,991 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 14:20:06,991 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 14:20:06,991 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 14:20:06,991 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 14:20:06,992 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 14:20:06,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 14:20:06,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 14:20:06,992 INFO L87 Difference]: Start difference. First operand 17672 states and 23302 transitions. Second operand 3 states. [2018-12-02 14:20:07,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:20:07,198 INFO L93 Difference]: Finished difference Result 29708 states and 39688 transitions. [2018-12-02 14:20:07,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 14:20:07,198 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-12-02 14:20:07,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:20:07,216 INFO L225 Difference]: With dead ends: 29708 [2018-12-02 14:20:07,216 INFO L226 Difference]: Without dead ends: 29706 [2018-12-02 14:20:07,221 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 14:20:07,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29706 states. [2018-12-02 14:20:07,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29706 to 26632. [2018-12-02 14:20:07,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26632 states. [2018-12-02 14:20:07,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26632 states to 26632 states and 34054 transitions. [2018-12-02 14:20:07,540 INFO L78 Accepts]: Start accepts. Automaton has 26632 states and 34054 transitions. Word has length 31 [2018-12-02 14:20:07,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:20:07,540 INFO L480 AbstractCegarLoop]: Abstraction has 26632 states and 34054 transitions. [2018-12-02 14:20:07,540 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 14:20:07,540 INFO L276 IsEmpty]: Start isEmpty. Operand 26632 states and 34054 transitions. [2018-12-02 14:20:07,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-02 14:20:07,551 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:20:07,551 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, 1, 1, 1, 1, 1, 1] [2018-12-02 14:20:07,552 INFO L423 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 14:20:07,552 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:20:07,552 INFO L82 PathProgramCache]: Analyzing trace with hash 830565569, now seen corresponding path program 1 times [2018-12-02 14:20:07,552 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:20:07,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:20:07,552 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:20:07,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:20:07,552 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:20:07,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:20:07,575 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 14:20:07,575 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 14:20:07,575 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 14:20:07,575 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 14:20:07,575 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 14:20:07,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 14:20:07,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 14:20:07,576 INFO L87 Difference]: Start difference. First operand 26632 states and 34054 transitions. Second operand 3 states. [2018-12-02 14:20:07,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:20:07,836 INFO L93 Difference]: Finished difference Result 60428 states and 77064 transitions. [2018-12-02 14:20:07,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 14:20:07,837 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-12-02 14:20:07,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:20:07,858 INFO L225 Difference]: With dead ends: 60428 [2018-12-02 14:20:07,859 INFO L226 Difference]: Without dead ends: 34314 [2018-12-02 14:20:07,878 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 14:20:07,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34314 states. [2018-12-02 14:20:08,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34314 to 34312. [2018-12-02 14:20:08,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34312 states. [2018-12-02 14:20:08,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34312 states to 34312 states and 43014 transitions. [2018-12-02 14:20:08,357 INFO L78 Accepts]: Start accepts. Automaton has 34312 states and 43014 transitions. Word has length 31 [2018-12-02 14:20:08,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:20:08,357 INFO L480 AbstractCegarLoop]: Abstraction has 34312 states and 43014 transitions. [2018-12-02 14:20:08,358 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 14:20:08,358 INFO L276 IsEmpty]: Start isEmpty. Operand 34312 states and 43014 transitions. [2018-12-02 14:20:08,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-02 14:20:08,367 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:20:08,367 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, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 14:20:08,367 INFO L423 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 14:20:08,367 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:20:08,367 INFO L82 PathProgramCache]: Analyzing trace with hash 999013018, now seen corresponding path program 1 times [2018-12-02 14:20:08,367 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:20:08,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:20:08,368 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:20:08,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:20:08,368 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:20:08,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:20:08,387 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 14:20:08,387 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 14:20:08,387 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 14:20:08,387 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 14:20:08,387 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 14:20:08,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 14:20:08,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 14:20:08,388 INFO L87 Difference]: Start difference. First operand 34312 states and 43014 transitions. Second operand 3 states. [2018-12-02 14:20:08,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:20:08,646 INFO L93 Difference]: Finished difference Result 51468 states and 64264 transitions. [2018-12-02 14:20:08,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 14:20:08,647 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-12-02 14:20:08,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:20:08,670 INFO L225 Difference]: With dead ends: 51468 [2018-12-02 14:20:08,670 INFO L226 Difference]: Without dead ends: 34826 [2018-12-02 14:20:08,684 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 14:20:08,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34826 states. [2018-12-02 14:20:09,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34826 to 34824. [2018-12-02 14:20:09,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34824 states. [2018-12-02 14:20:09,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34824 states to 34824 states and 43014 transitions. [2018-12-02 14:20:09,128 INFO L78 Accepts]: Start accepts. Automaton has 34824 states and 43014 transitions. Word has length 32 [2018-12-02 14:20:09,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:20:09,128 INFO L480 AbstractCegarLoop]: Abstraction has 34824 states and 43014 transitions. [2018-12-02 14:20:09,128 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 14:20:09,128 INFO L276 IsEmpty]: Start isEmpty. Operand 34824 states and 43014 transitions. [2018-12-02 14:20:09,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-02 14:20:09,137 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:20:09,137 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, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 14:20:09,138 INFO L423 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 14:20:09,138 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:20:09,138 INFO L82 PathProgramCache]: Analyzing trace with hash -22055336, now seen corresponding path program 1 times [2018-12-02 14:20:09,138 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:20:09,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:20:09,138 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:20:09,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:20:09,139 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:20:09,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:20:09,147 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 14:20:09,147 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 14:20:09,147 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 14:20:09,147 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 14:20:09,147 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 14:20:09,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 14:20:09,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 14:20:09,147 INFO L87 Difference]: Start difference. First operand 34824 states and 43014 transitions. Second operand 3 states. [2018-12-02 14:20:09,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:20:09,572 INFO L93 Difference]: Finished difference Result 57356 states and 71176 transitions. [2018-12-02 14:20:09,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 14:20:09,573 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-12-02 14:20:09,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:20:09,609 INFO L225 Difference]: With dead ends: 57356 [2018-12-02 14:20:09,609 INFO L226 Difference]: Without dead ends: 57354 [2018-12-02 14:20:09,617 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 14:20:09,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57354 states. [2018-12-02 14:20:10,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57354 to 53256. [2018-12-02 14:20:10,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53256 states. [2018-12-02 14:20:10,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53256 states to 53256 states and 64006 transitions. [2018-12-02 14:20:10,266 INFO L78 Accepts]: Start accepts. Automaton has 53256 states and 64006 transitions. Word has length 32 [2018-12-02 14:20:10,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:20:10,266 INFO L480 AbstractCegarLoop]: Abstraction has 53256 states and 64006 transitions. [2018-12-02 14:20:10,267 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 14:20:10,267 INFO L276 IsEmpty]: Start isEmpty. Operand 53256 states and 64006 transitions. [2018-12-02 14:20:10,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-02 14:20:10,288 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:20:10,288 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, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 14:20:10,288 INFO L423 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 14:20:10,289 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:20:10,289 INFO L82 PathProgramCache]: Analyzing trace with hash -1301919014, now seen corresponding path program 1 times [2018-12-02 14:20:10,289 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:20:10,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:20:10,289 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:20:10,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:20:10,289 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:20:10,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:20:10,299 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 14:20:10,299 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 14:20:10,300 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 14:20:10,300 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 14:20:10,300 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 14:20:10,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 14:20:10,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 14:20:10,300 INFO L87 Difference]: Start difference. First operand 53256 states and 64006 transitions. Second operand 3 states. [2018-12-02 14:20:10,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:20:10,872 INFO L93 Difference]: Finished difference Result 119820 states and 142856 transitions. [2018-12-02 14:20:10,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 14:20:10,873 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-12-02 14:20:10,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:20:10,928 INFO L225 Difference]: With dead ends: 119820 [2018-12-02 14:20:10,928 INFO L226 Difference]: Without dead ends: 67594 [2018-12-02 14:20:10,963 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 14:20:10,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67594 states. [2018-12-02 14:20:11,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67594 to 67592. [2018-12-02 14:20:11,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67592 states. [2018-12-02 14:20:11,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67592 states to 67592 states and 78854 transitions. [2018-12-02 14:20:11,911 INFO L78 Accepts]: Start accepts. Automaton has 67592 states and 78854 transitions. Word has length 32 [2018-12-02 14:20:11,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:20:11,911 INFO L480 AbstractCegarLoop]: Abstraction has 67592 states and 78854 transitions. [2018-12-02 14:20:11,911 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 14:20:11,911 INFO L276 IsEmpty]: Start isEmpty. Operand 67592 states and 78854 transitions. [2018-12-02 14:20:11,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-12-02 14:20:11,933 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:20:11,933 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 14:20:11,933 INFO L423 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 14:20:11,933 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:20:11,933 INFO L82 PathProgramCache]: Analyzing trace with hash -683499274, now seen corresponding path program 1 times [2018-12-02 14:20:11,933 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:20:11,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:20:11,934 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:20:11,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:20:11,934 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:20:11,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:20:11,953 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 14:20:11,953 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 14:20:11,953 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 14:20:11,953 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 14:20:11,954 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 14:20:11,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 14:20:11,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 14:20:11,954 INFO L87 Difference]: Start difference. First operand 67592 states and 78854 transitions. Second operand 3 states. [2018-12-02 14:20:12,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:20:12,625 INFO L93 Difference]: Finished difference Result 101388 states and 117768 transitions. [2018-12-02 14:20:12,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 14:20:12,625 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2018-12-02 14:20:12,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:20:12,667 INFO L225 Difference]: With dead ends: 101388 [2018-12-02 14:20:12,668 INFO L226 Difference]: Without dead ends: 68618 [2018-12-02 14:20:12,686 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 14:20:12,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68618 states. [2018-12-02 14:20:13,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68618 to 68616. [2018-12-02 14:20:13,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68616 states. [2018-12-02 14:20:13,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68616 states to 68616 states and 78854 transitions. [2018-12-02 14:20:13,573 INFO L78 Accepts]: Start accepts. Automaton has 68616 states and 78854 transitions. Word has length 33 [2018-12-02 14:20:13,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:20:13,573 INFO L480 AbstractCegarLoop]: Abstraction has 68616 states and 78854 transitions. [2018-12-02 14:20:13,573 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 14:20:13,573 INFO L276 IsEmpty]: Start isEmpty. Operand 68616 states and 78854 transitions. [2018-12-02 14:20:13,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-12-02 14:20:13,595 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:20:13,596 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 14:20:13,596 INFO L423 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 14:20:13,596 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:20:13,596 INFO L82 PathProgramCache]: Analyzing trace with hash -1704567628, now seen corresponding path program 1 times [2018-12-02 14:20:13,596 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:20:13,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:20:13,596 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:20:13,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:20:13,597 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:20:13,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:20:13,611 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 14:20:13,611 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 14:20:13,611 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 14:20:13,611 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 14:20:13,612 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 14:20:13,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 14:20:13,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 14:20:13,612 INFO L87 Difference]: Start difference. First operand 68616 states and 78854 transitions. Second operand 3 states. [2018-12-02 14:20:14,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:20:14,586 INFO L93 Difference]: Finished difference Result 110602 states and 125959 transitions. [2018-12-02 14:20:14,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 14:20:14,587 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2018-12-02 14:20:14,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:20:14,657 INFO L225 Difference]: With dead ends: 110602 [2018-12-02 14:20:14,658 INFO L226 Difference]: Without dead ends: 110600 [2018-12-02 14:20:14,668 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 14:20:14,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110600 states. [2018-12-02 14:20:15,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110600 to 106504. [2018-12-02 14:20:15,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106504 states. [2018-12-02 14:20:15,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106504 states to 106504 states and 119814 transitions. [2018-12-02 14:20:15,979 INFO L78 Accepts]: Start accepts. Automaton has 106504 states and 119814 transitions. Word has length 33 [2018-12-02 14:20:15,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:20:15,979 INFO L480 AbstractCegarLoop]: Abstraction has 106504 states and 119814 transitions. [2018-12-02 14:20:15,979 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 14:20:15,979 INFO L276 IsEmpty]: Start isEmpty. Operand 106504 states and 119814 transitions. [2018-12-02 14:20:16,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-12-02 14:20:16,023 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:20:16,023 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 14:20:16,023 INFO L423 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 14:20:16,023 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:20:16,023 INFO L82 PathProgramCache]: Analyzing trace with hash 1310535990, now seen corresponding path program 1 times [2018-12-02 14:20:16,024 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:20:16,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:20:16,024 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:20:16,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:20:16,024 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:20:16,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:20:16,032 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 14:20:16,033 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 14:20:16,033 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 14:20:16,033 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 14:20:16,033 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 14:20:16,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 14:20:16,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 14:20:16,033 INFO L87 Difference]: Start difference. First operand 106504 states and 119814 transitions. Second operand 3 states. [2018-12-02 14:20:17,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:20:17,319 INFO L93 Difference]: Finished difference Result 237576 states and 263174 transitions. [2018-12-02 14:20:17,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 14:20:17,319 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2018-12-02 14:20:17,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:20:17,319 INFO L225 Difference]: With dead ends: 237576 [2018-12-02 14:20:17,319 INFO L226 Difference]: Without dead ends: 0 [2018-12-02 14:20:17,413 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 14:20:17,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-02 14:20:17,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-02 14:20:17,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-02 14:20:17,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-02 14:20:17,413 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 33 [2018-12-02 14:20:17,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:20:17,414 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-02 14:20:17,414 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 14:20:17,414 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-02 14:20:17,414 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-02 14:20:17,417 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-02 14:20:17,447 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-12-02 14:20:17,447 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-12-02 14:20:17,447 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-12-02 14:20:17,447 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-12-02 14:20:17,447 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-12-02 14:20:17,447 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-12-02 14:20:17,447 INFO L448 ceAbstractionStarter]: For program point L126-1(lines 45 186) no Hoare annotation was computed. [2018-12-02 14:20:17,447 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 4 191) no Hoare annotation was computed. [2018-12-02 14:20:17,447 INFO L448 ceAbstractionStarter]: For program point L151-1(lines 45 186) no Hoare annotation was computed. [2018-12-02 14:20:17,447 INFO L448 ceAbstractionStarter]: For program point L176-1(lines 45 186) no Hoare annotation was computed. [2018-12-02 14:20:17,447 INFO L448 ceAbstractionStarter]: For program point L127(line 127) no Hoare annotation was computed. [2018-12-02 14:20:17,447 INFO L448 ceAbstractionStarter]: For program point L152(line 152) no Hoare annotation was computed. [2018-12-02 14:20:17,447 INFO L448 ceAbstractionStarter]: For program point L177(line 177) no Hoare annotation was computed. [2018-12-02 14:20:17,448 INFO L448 ceAbstractionStarter]: For program point L136-1(lines 45 186) no Hoare annotation was computed. [2018-12-02 14:20:17,448 INFO L448 ceAbstractionStarter]: For program point L161-1(lines 45 186) no Hoare annotation was computed. [2018-12-02 14:20:17,448 INFO L448 ceAbstractionStarter]: For program point L120-1(lines 45 186) no Hoare annotation was computed. [2018-12-02 14:20:17,448 INFO L448 ceAbstractionStarter]: For program point L112-1(lines 45 186) no Hoare annotation was computed. [2018-12-02 14:20:17,448 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 4 191) no Hoare annotation was computed. [2018-12-02 14:20:17,448 INFO L448 ceAbstractionStarter]: For program point L137(line 137) no Hoare annotation was computed. [2018-12-02 14:20:17,448 INFO L448 ceAbstractionStarter]: For program point L104-1(lines 45 186) no Hoare annotation was computed. [2018-12-02 14:20:17,448 INFO L448 ceAbstractionStarter]: For program point L162(line 162) no Hoare annotation was computed. [2018-12-02 14:20:17,448 INFO L448 ceAbstractionStarter]: For program point L96-1(lines 45 186) no Hoare annotation was computed. [2018-12-02 14:20:17,448 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 4 191) the Hoare annotation is: true [2018-12-02 14:20:17,448 INFO L451 ceAbstractionStarter]: At program point L187(lines 5 191) the Hoare annotation is: true [2018-12-02 14:20:17,448 INFO L448 ceAbstractionStarter]: For program point L88-1(lines 45 186) no Hoare annotation was computed. [2018-12-02 14:20:17,448 INFO L448 ceAbstractionStarter]: For program point L146-1(lines 45 186) no Hoare annotation was computed. [2018-12-02 14:20:17,448 INFO L448 ceAbstractionStarter]: For program point L47(lines 47 49) no Hoare annotation was computed. [2018-12-02 14:20:17,448 INFO L448 ceAbstractionStarter]: For program point L80-1(lines 45 186) no Hoare annotation was computed. [2018-12-02 14:20:17,448 INFO L448 ceAbstractionStarter]: For program point L171-1(lines 45 186) no Hoare annotation was computed. [2018-12-02 14:20:17,448 INFO L448 ceAbstractionStarter]: For program point L147(line 147) no Hoare annotation was computed. [2018-12-02 14:20:17,448 INFO L448 ceAbstractionStarter]: For program point L172(line 172) no Hoare annotation was computed. [2018-12-02 14:20:17,448 INFO L448 ceAbstractionStarter]: For program point L131-1(lines 45 186) no Hoare annotation was computed. [2018-12-02 14:20:17,448 INFO L448 ceAbstractionStarter]: For program point L156-1(lines 45 186) no Hoare annotation was computed. [2018-12-02 14:20:17,448 INFO L451 ceAbstractionStarter]: At program point L181-1(lines 45 186) the Hoare annotation is: true [2018-12-02 14:20:17,448 INFO L448 ceAbstractionStarter]: For program point L132(line 132) no Hoare annotation was computed. [2018-12-02 14:20:17,449 INFO L448 ceAbstractionStarter]: For program point L157(line 157) no Hoare annotation was computed. [2018-12-02 14:20:17,449 INFO L448 ceAbstractionStarter]: For program point L182(line 182) no Hoare annotation was computed. [2018-12-02 14:20:17,449 INFO L444 ceAbstractionStarter]: At program point L182-1(lines 5 191) the Hoare annotation is: false [2018-12-02 14:20:17,449 INFO L448 ceAbstractionStarter]: For program point L116-1(lines 45 186) no Hoare annotation was computed. [2018-12-02 14:20:17,449 INFO L448 ceAbstractionStarter]: For program point L141-1(lines 45 186) no Hoare annotation was computed. [2018-12-02 14:20:17,449 INFO L448 ceAbstractionStarter]: For program point L108-1(lines 45 186) no Hoare annotation was computed. [2018-12-02 14:20:17,449 INFO L448 ceAbstractionStarter]: For program point L166-1(lines 45 186) no Hoare annotation was computed. [2018-12-02 14:20:17,449 INFO L448 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 189) no Hoare annotation was computed. [2018-12-02 14:20:17,449 INFO L448 ceAbstractionStarter]: For program point L100-1(lines 45 186) no Hoare annotation was computed. [2018-12-02 14:20:17,449 INFO L448 ceAbstractionStarter]: For program point L92-1(lines 45 186) no Hoare annotation was computed. [2018-12-02 14:20:17,449 INFO L448 ceAbstractionStarter]: For program point L84-1(lines 45 186) no Hoare annotation was computed. [2018-12-02 14:20:17,449 INFO L448 ceAbstractionStarter]: For program point L142(line 142) no Hoare annotation was computed. [2018-12-02 14:20:17,449 INFO L448 ceAbstractionStarter]: For program point L76(lines 76 78) no Hoare annotation was computed. [2018-12-02 14:20:17,449 INFO L448 ceAbstractionStarter]: For program point L76-2(lines 45 186) no Hoare annotation was computed. [2018-12-02 14:20:17,449 INFO L448 ceAbstractionStarter]: For program point L167(line 167) no Hoare annotation was computed. [2018-12-02 14:20:17,453 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 02:20:17 BoogieIcfgContainer [2018-12-02 14:20:17,453 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-02 14:20:17,454 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-02 14:20:17,454 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-02 14:20:17,454 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-02 14:20:17,454 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 02:20:03" (3/4) ... [2018-12-02 14:20:17,456 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-02 14:20:17,461 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-12-02 14:20:17,461 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-12-02 14:20:17,464 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2018-12-02 14:20:17,464 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-12-02 14:20:17,465 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-12-02 14:20:17,500 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_40d12c16-5225-490a-977c-c807ca323f09/bin-2019/utaipan/witness.graphml [2018-12-02 14:20:17,500 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-02 14:20:17,500 INFO L168 Benchmark]: Toolchain (without parser) took 14470.87 ms. Allocated memory was 1.0 GB in the beginning and 2.7 GB in the end (delta: 1.6 GB). Free memory was 950.8 MB in the beginning and 699.7 MB in the end (delta: 251.0 MB). Peak memory consumption was 1.9 GB. Max. memory is 11.5 GB. [2018-12-02 14:20:17,501 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 976.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 14:20:17,501 INFO L168 Benchmark]: CACSL2BoogieTranslator took 136.39 ms. Allocated memory is still 1.0 GB. Free memory was 950.8 MB in the beginning and 939.0 MB in the end (delta: 11.8 MB). Peak memory consumption was 11.8 MB. Max. memory is 11.5 GB. [2018-12-02 14:20:17,502 INFO L168 Benchmark]: Boogie Procedure Inliner took 11.62 ms. Allocated memory is still 1.0 GB. Free memory was 939.0 MB in the beginning and 936.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-12-02 14:20:17,502 INFO L168 Benchmark]: Boogie Preprocessor took 45.71 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 101.2 MB). Free memory was 936.3 MB in the beginning and 1.1 GB in the end (delta: -165.5 MB). Peak memory consumption was 13.3 MB. Max. memory is 11.5 GB. [2018-12-02 14:20:17,502 INFO L168 Benchmark]: RCFGBuilder took 197.75 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 22.4 MB). Peak memory consumption was 22.4 MB. Max. memory is 11.5 GB. [2018-12-02 14:20:17,502 INFO L168 Benchmark]: TraceAbstraction took 14030.54 ms. Allocated memory was 1.1 GB in the beginning and 2.7 GB in the end (delta: 1.5 GB). Free memory was 1.1 GB in the beginning and 700.3 MB in the end (delta: 376.4 MB). Peak memory consumption was 1.9 GB. Max. memory is 11.5 GB. [2018-12-02 14:20:17,502 INFO L168 Benchmark]: Witness Printer took 46.15 ms. Allocated memory is still 2.7 GB. Free memory was 700.3 MB in the beginning and 699.7 MB in the end (delta: 511.5 kB). Peak memory consumption was 511.5 kB. Max. memory is 11.5 GB. [2018-12-02 14:20:17,503 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.16 ms. Allocated memory is still 1.0 GB. Free memory is still 976.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 136.39 ms. Allocated memory is still 1.0 GB. Free memory was 950.8 MB in the beginning and 939.0 MB in the end (delta: 11.8 MB). Peak memory consumption was 11.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 11.62 ms. Allocated memory is still 1.0 GB. Free memory was 939.0 MB in the beginning and 936.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 45.71 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 101.2 MB). Free memory was 936.3 MB in the beginning and 1.1 GB in the end (delta: -165.5 MB). Peak memory consumption was 13.3 MB. Max. memory is 11.5 GB. * RCFGBuilder took 197.75 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 22.4 MB). Peak memory consumption was 22.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 14030.54 ms. Allocated memory was 1.1 GB in the beginning and 2.7 GB in the end (delta: 1.5 GB). Free memory was 1.1 GB in the beginning and 700.3 MB in the end (delta: 376.4 MB). Peak memory consumption was 1.9 GB. Max. memory is 11.5 GB. * Witness Printer took 46.15 ms. Allocated memory is still 2.7 GB. Free memory was 700.3 MB in the beginning and 699.7 MB in the end (delta: 511.5 kB). Peak memory consumption was 511.5 kB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 189]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 45]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 50 locations, 1 error locations. SAFE Result, 13.9s OverallTime, 34 OverallIterations, 1 TraceHistogramMax, 6.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 3416 SDtfs, 1682 SDslu, 2343 SDs, 0 SdLazy, 181 SolverSat, 34 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 102 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=106504occurred in iteration=33, 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: 6.4s AutomataMinimizationTime, 34 MinimizatonAttempts, 16420 StatesRemovedByMinimization, 33 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 4106 NumberOfFragments, 7 HoareAnnotationTreeSize, 7 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 938 NumberOfCodeBlocks, 938 NumberOfCodeBlocksAsserted, 34 NumberOfCheckSat, 904 ConstructedInterpolants, 0 QuantifiedInterpolants, 49976 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 34 InterpolantComputations, 34 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...