./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/locks/test_locks_14_true-unreach-call_true-valid-memsafety_false-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5842f4b8 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_ba25ec5e-94f4-43d0-b92d-84845720934e/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_ba25ec5e-94f4-43d0-b92d-84845720934e/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_ba25ec5e-94f4-43d0-b92d-84845720934e/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_ba25ec5e-94f4-43d0-b92d-84845720934e/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/locks/test_locks_14_true-unreach-call_true-valid-memsafety_false-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_ba25ec5e-94f4-43d0-b92d-84845720934e/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_ba25ec5e-94f4-43d0-b92d-84845720934e/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 c5a3d22d49117f02662b197492bc1b16616a2878 ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-5842f4b [2018-11-18 17:13:09,495 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 17:13:09,496 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 17:13:09,504 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 17:13:09,505 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 17:13:09,505 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 17:13:09,506 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 17:13:09,507 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 17:13:09,508 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 17:13:09,509 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 17:13:09,509 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 17:13:09,510 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 17:13:09,510 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 17:13:09,511 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 17:13:09,512 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 17:13:09,512 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 17:13:09,513 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 17:13:09,514 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 17:13:09,515 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 17:13:09,516 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 17:13:09,517 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 17:13:09,518 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 17:13:09,519 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 17:13:09,520 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 17:13:09,520 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 17:13:09,520 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 17:13:09,521 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 17:13:09,521 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 17:13:09,522 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 17:13:09,523 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 17:13:09,523 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 17:13:09,523 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 17:13:09,523 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 17:13:09,524 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 17:13:09,524 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 17:13:09,525 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 17:13:09,525 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_ba25ec5e-94f4-43d0-b92d-84845720934e/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-11-18 17:13:09,535 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 17:13:09,535 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 17:13:09,536 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-18 17:13:09,536 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-18 17:13:09,536 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-18 17:13:09,536 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-18 17:13:09,536 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-18 17:13:09,537 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-18 17:13:09,537 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-18 17:13:09,537 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-18 17:13:09,537 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-18 17:13:09,537 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-18 17:13:09,537 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-18 17:13:09,538 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 17:13:09,538 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 17:13:09,538 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 17:13:09,538 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 17:13:09,538 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 17:13:09,539 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-18 17:13:09,539 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-18 17:13:09,539 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-18 17:13:09,539 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 17:13:09,539 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 17:13:09,539 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 17:13:09,540 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-18 17:13:09,540 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 17:13:09,540 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 17:13:09,540 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-18 17:13:09,540 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-18 17:13:09,540 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 17:13:09,540 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 17:13:09,541 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-18 17:13:09,541 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-18 17:13:09,541 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-18 17:13:09,541 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-18 17:13:09,541 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-18 17:13:09,541 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-18 17:13:09,542 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_ba25ec5e-94f4-43d0-b92d-84845720934e/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 -> c5a3d22d49117f02662b197492bc1b16616a2878 [2018-11-18 17:13:09,565 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 17:13:09,575 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 17:13:09,577 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 17:13:09,579 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 17:13:09,579 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 17:13:09,579 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_ba25ec5e-94f4-43d0-b92d-84845720934e/bin-2019/utaipan/../../sv-benchmarks/c/locks/test_locks_14_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-18 17:13:09,624 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_ba25ec5e-94f4-43d0-b92d-84845720934e/bin-2019/utaipan/data/5d3c8e45e/c2a0520dac6045259839951dfe740bea/FLAG3e6074542 [2018-11-18 17:13:09,959 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 17:13:09,959 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_ba25ec5e-94f4-43d0-b92d-84845720934e/sv-benchmarks/c/locks/test_locks_14_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-18 17:13:09,964 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_ba25ec5e-94f4-43d0-b92d-84845720934e/bin-2019/utaipan/data/5d3c8e45e/c2a0520dac6045259839951dfe740bea/FLAG3e6074542 [2018-11-18 17:13:10,384 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_ba25ec5e-94f4-43d0-b92d-84845720934e/bin-2019/utaipan/data/5d3c8e45e/c2a0520dac6045259839951dfe740bea [2018-11-18 17:13:10,386 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 17:13:10,387 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-18 17:13:10,388 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 17:13:10,388 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 17:13:10,390 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 17:13:10,390 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 05:13:10" (1/1) ... [2018-11-18 17:13:10,392 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@644a6f8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:13:10, skipping insertion in model container [2018-11-18 17:13:10,392 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 05:13:10" (1/1) ... [2018-11-18 17:13:10,400 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 17:13:10,415 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 17:13:10,537 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 17:13:10,539 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 17:13:10,559 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 17:13:10,566 INFO L195 MainTranslator]: Completed translation [2018-11-18 17:13:10,567 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:13:10 WrapperNode [2018-11-18 17:13:10,567 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 17:13:10,567 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-18 17:13:10,567 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-18 17:13:10,567 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-18 17:13:10,572 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:13:10" (1/1) ... [2018-11-18 17:13:10,575 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:13:10" (1/1) ... [2018-11-18 17:13:10,579 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-18 17:13:10,579 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 17:13:10,579 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 17:13:10,579 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 17:13:10,584 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:13:10" (1/1) ... [2018-11-18 17:13:10,584 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:13:10" (1/1) ... [2018-11-18 17:13:10,585 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:13:10" (1/1) ... [2018-11-18 17:13:10,586 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:13:10" (1/1) ... [2018-11-18 17:13:10,590 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:13:10" (1/1) ... [2018-11-18 17:13:10,596 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:13:10" (1/1) ... [2018-11-18 17:13:10,597 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:13:10" (1/1) ... [2018-11-18 17:13:10,598 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 17:13:10,599 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 17:13:10,599 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 17:13:10,599 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 17:13:10,600 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:13:10" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ba25ec5e-94f4-43d0-b92d-84845720934e/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-11-18 17:13:10,668 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-18 17:13:10,668 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-18 17:13:10,668 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 17:13:10,668 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 17:13:10,669 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-18 17:13:10,669 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-18 17:13:10,889 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 17:13:10,889 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 05:13:10 BoogieIcfgContainer [2018-11-18 17:13:10,889 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 17:13:10,890 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-18 17:13:10,890 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-18 17:13:10,892 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-18 17:13:10,893 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 05:13:10" (1/3) ... [2018-11-18 17:13:10,893 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28b76d93 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 05:13:10, skipping insertion in model container [2018-11-18 17:13:10,893 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:13:10" (2/3) ... [2018-11-18 17:13:10,894 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28b76d93 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 05:13:10, skipping insertion in model container [2018-11-18 17:13:10,894 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 05:13:10" (3/3) ... [2018-11-18 17:13:10,895 INFO L112 eAbstractionObserver]: Analyzing ICFG test_locks_14_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-18 17:13:10,900 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-18 17:13:10,905 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-18 17:13:10,913 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-18 17:13:10,932 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-18 17:13:10,932 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-18 17:13:10,932 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-18 17:13:10,932 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 17:13:10,932 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 17:13:10,932 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-18 17:13:10,932 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 17:13:10,932 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-18 17:13:10,944 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states. [2018-11-18 17:13:10,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-18 17:13:10,948 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:13:10,948 INFO L375 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-11-18 17:13:10,950 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:13:10,953 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:13:10,953 INFO L82 PathProgramCache]: Analyzing trace with hash 1553015003, now seen corresponding path program 1 times [2018-11-18 17:13:10,954 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 17:13:10,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:13:10,981 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:13:10,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:13:10,982 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 17:13:11,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:13:11,075 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 17:13:11,076 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 17:13:11,077 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 17:13:11,077 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 17:13:11,080 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 17:13:11,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 17:13:11,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 17:13:11,089 INFO L87 Difference]: Start difference. First operand 57 states. Second operand 3 states. [2018-11-18 17:13:11,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:13:11,123 INFO L93 Difference]: Finished difference Result 113 states and 200 transitions. [2018-11-18 17:13:11,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 17:13:11,124 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-18 17:13:11,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:13:11,130 INFO L225 Difference]: With dead ends: 113 [2018-11-18 17:13:11,130 INFO L226 Difference]: Without dead ends: 98 [2018-11-18 17:13:11,132 INFO L604 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-11-18 17:13:11,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-11-18 17:13:11,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 67. [2018-11-18 17:13:11,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-11-18 17:13:11,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 122 transitions. [2018-11-18 17:13:11,163 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 122 transitions. Word has length 25 [2018-11-18 17:13:11,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:13:11,163 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 122 transitions. [2018-11-18 17:13:11,163 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 17:13:11,163 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 122 transitions. [2018-11-18 17:13:11,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-18 17:13:11,164 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:13:11,164 INFO L375 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-11-18 17:13:11,164 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:13:11,165 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:13:11,165 INFO L82 PathProgramCache]: Analyzing trace with hash -35332899, now seen corresponding path program 1 times [2018-11-18 17:13:11,165 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 17:13:11,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:13:11,166 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:13:11,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:13:11,166 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 17:13:11,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:13:11,206 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 17:13:11,206 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 17:13:11,207 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 17:13:11,207 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 17:13:11,208 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 17:13:11,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 17:13:11,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 17:13:11,209 INFO L87 Difference]: Start difference. First operand 67 states and 122 transitions. Second operand 3 states. [2018-11-18 17:13:11,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:13:11,236 INFO L93 Difference]: Finished difference Result 160 states and 295 transitions. [2018-11-18 17:13:11,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 17:13:11,236 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-18 17:13:11,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:13:11,237 INFO L225 Difference]: With dead ends: 160 [2018-11-18 17:13:11,237 INFO L226 Difference]: Without dead ends: 98 [2018-11-18 17:13:11,238 INFO L604 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-11-18 17:13:11,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-11-18 17:13:11,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 96. [2018-11-18 17:13:11,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-11-18 17:13:11,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 175 transitions. [2018-11-18 17:13:11,245 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 175 transitions. Word has length 25 [2018-11-18 17:13:11,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:13:11,245 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 175 transitions. [2018-11-18 17:13:11,245 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 17:13:11,245 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 175 transitions. [2018-11-18 17:13:11,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-18 17:13:11,246 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:13:11,246 INFO L375 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-11-18 17:13:11,246 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:13:11,247 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:13:11,247 INFO L82 PathProgramCache]: Analyzing trace with hash 899036922, now seen corresponding path program 1 times [2018-11-18 17:13:11,247 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 17:13:11,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:13:11,248 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:13:11,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:13:11,248 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 17:13:11,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:13:11,291 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 17:13:11,291 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 17:13:11,291 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 17:13:11,291 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 17:13:11,292 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 17:13:11,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 17:13:11,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 17:13:11,292 INFO L87 Difference]: Start difference. First operand 96 states and 175 transitions. Second operand 3 states. [2018-11-18 17:13:11,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:13:11,312 INFO L93 Difference]: Finished difference Result 148 states and 265 transitions. [2018-11-18 17:13:11,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 17:13:11,313 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-11-18 17:13:11,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:13:11,314 INFO L225 Difference]: With dead ends: 148 [2018-11-18 17:13:11,314 INFO L226 Difference]: Without dead ends: 102 [2018-11-18 17:13:11,314 INFO L604 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-11-18 17:13:11,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-11-18 17:13:11,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 100. [2018-11-18 17:13:11,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-11-18 17:13:11,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 178 transitions. [2018-11-18 17:13:11,322 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 178 transitions. Word has length 26 [2018-11-18 17:13:11,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:13:11,322 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 178 transitions. [2018-11-18 17:13:11,322 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 17:13:11,322 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 178 transitions. [2018-11-18 17:13:11,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-18 17:13:11,323 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:13:11,323 INFO L375 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-11-18 17:13:11,323 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:13:11,324 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:13:11,324 INFO L82 PathProgramCache]: Analyzing trace with hash -1095107784, now seen corresponding path program 1 times [2018-11-18 17:13:11,324 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 17:13:11,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:13:11,325 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:13:11,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:13:11,325 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 17:13:11,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:13:11,362 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 17:13:11,363 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 17:13:11,363 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 17:13:11,363 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 17:13:11,363 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 17:13:11,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 17:13:11,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 17:13:11,364 INFO L87 Difference]: Start difference. First operand 100 states and 178 transitions. Second operand 3 states. [2018-11-18 17:13:11,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:13:11,382 INFO L93 Difference]: Finished difference Result 189 states and 341 transitions. [2018-11-18 17:13:11,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 17:13:11,383 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-11-18 17:13:11,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:13:11,384 INFO L225 Difference]: With dead ends: 189 [2018-11-18 17:13:11,384 INFO L226 Difference]: Without dead ends: 187 [2018-11-18 17:13:11,384 INFO L604 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-11-18 17:13:11,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2018-11-18 17:13:11,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 131. [2018-11-18 17:13:11,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-11-18 17:13:11,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 235 transitions. [2018-11-18 17:13:11,394 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 235 transitions. Word has length 26 [2018-11-18 17:13:11,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:13:11,394 INFO L480 AbstractCegarLoop]: Abstraction has 131 states and 235 transitions. [2018-11-18 17:13:11,394 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 17:13:11,394 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 235 transitions. [2018-11-18 17:13:11,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-18 17:13:11,395 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:13:11,395 INFO L375 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-11-18 17:13:11,395 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:13:11,395 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:13:11,395 INFO L82 PathProgramCache]: Analyzing trace with hash 1611511610, now seen corresponding path program 1 times [2018-11-18 17:13:11,396 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 17:13:11,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:13:11,396 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:13:11,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:13:11,397 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 17:13:11,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:13:11,444 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 17:13:11,444 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 17:13:11,444 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 17:13:11,444 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 17:13:11,444 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 17:13:11,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 17:13:11,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 17:13:11,445 INFO L87 Difference]: Start difference. First operand 131 states and 235 transitions. Second operand 3 states. [2018-11-18 17:13:11,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:13:11,465 INFO L93 Difference]: Finished difference Result 311 states and 565 transitions. [2018-11-18 17:13:11,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 17:13:11,465 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-11-18 17:13:11,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:13:11,466 INFO L225 Difference]: With dead ends: 311 [2018-11-18 17:13:11,466 INFO L226 Difference]: Without dead ends: 189 [2018-11-18 17:13:11,466 INFO L604 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-11-18 17:13:11,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2018-11-18 17:13:11,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 187. [2018-11-18 17:13:11,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2018-11-18 17:13:11,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 335 transitions. [2018-11-18 17:13:11,476 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 335 transitions. Word has length 26 [2018-11-18 17:13:11,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:13:11,476 INFO L480 AbstractCegarLoop]: Abstraction has 187 states and 335 transitions. [2018-11-18 17:13:11,476 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 17:13:11,476 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 335 transitions. [2018-11-18 17:13:11,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-18 17:13:11,477 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:13:11,477 INFO L375 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-11-18 17:13:11,477 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:13:11,477 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:13:11,478 INFO L82 PathProgramCache]: Analyzing trace with hash 411609490, now seen corresponding path program 1 times [2018-11-18 17:13:11,478 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 17:13:11,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:13:11,478 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:13:11,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:13:11,479 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 17:13:11,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:13:11,503 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 17:13:11,503 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 17:13:11,504 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 17:13:11,504 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 17:13:11,504 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 17:13:11,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 17:13:11,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 17:13:11,505 INFO L87 Difference]: Start difference. First operand 187 states and 335 transitions. Second operand 3 states. [2018-11-18 17:13:11,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:13:11,515 INFO L93 Difference]: Finished difference Result 280 states and 500 transitions. [2018-11-18 17:13:11,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 17:13:11,516 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-18 17:13:11,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:13:11,517 INFO L225 Difference]: With dead ends: 280 [2018-11-18 17:13:11,517 INFO L226 Difference]: Without dead ends: 191 [2018-11-18 17:13:11,517 INFO L604 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-11-18 17:13:11,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2018-11-18 17:13:11,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 189. [2018-11-18 17:13:11,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2018-11-18 17:13:11,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 335 transitions. [2018-11-18 17:13:11,525 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 335 transitions. Word has length 27 [2018-11-18 17:13:11,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:13:11,525 INFO L480 AbstractCegarLoop]: Abstraction has 189 states and 335 transitions. [2018-11-18 17:13:11,525 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 17:13:11,526 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 335 transitions. [2018-11-18 17:13:11,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-18 17:13:11,526 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:13:11,526 INFO L375 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-11-18 17:13:11,527 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:13:11,527 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:13:11,527 INFO L82 PathProgramCache]: Analyzing trace with hash -1582535216, now seen corresponding path program 1 times [2018-11-18 17:13:11,527 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 17:13:11,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:13:11,528 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:13:11,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:13:11,528 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 17:13:11,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:13:11,556 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 17:13:11,556 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 17:13:11,556 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 17:13:11,556 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 17:13:11,556 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 17:13:11,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 17:13:11,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 17:13:11,556 INFO L87 Difference]: Start difference. First operand 189 states and 335 transitions. Second operand 3 states. [2018-11-18 17:13:11,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:13:11,576 INFO L93 Difference]: Finished difference Result 357 states and 641 transitions. [2018-11-18 17:13:11,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 17:13:11,576 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-18 17:13:11,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:13:11,577 INFO L225 Difference]: With dead ends: 357 [2018-11-18 17:13:11,577 INFO L226 Difference]: Without dead ends: 355 [2018-11-18 17:13:11,578 INFO L604 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-11-18 17:13:11,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2018-11-18 17:13:11,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 253. [2018-11-18 17:13:11,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253 states. [2018-11-18 17:13:11,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 447 transitions. [2018-11-18 17:13:11,586 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 447 transitions. Word has length 27 [2018-11-18 17:13:11,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:13:11,587 INFO L480 AbstractCegarLoop]: Abstraction has 253 states and 447 transitions. [2018-11-18 17:13:11,587 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 17:13:11,587 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 447 transitions. [2018-11-18 17:13:11,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-18 17:13:11,588 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:13:11,588 INFO L375 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-11-18 17:13:11,588 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:13:11,588 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:13:11,589 INFO L82 PathProgramCache]: Analyzing trace with hash 1124084178, now seen corresponding path program 1 times [2018-11-18 17:13:11,589 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 17:13:11,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:13:11,589 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:13:11,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:13:11,590 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 17:13:11,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:13:11,623 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 17:13:11,623 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 17:13:11,623 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 17:13:11,623 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 17:13:11,623 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 17:13:11,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 17:13:11,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 17:13:11,624 INFO L87 Difference]: Start difference. First operand 253 states and 447 transitions. Second operand 3 states. [2018-11-18 17:13:11,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:13:11,644 INFO L93 Difference]: Finished difference Result 605 states and 1077 transitions. [2018-11-18 17:13:11,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 17:13:11,644 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-18 17:13:11,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:13:11,645 INFO L225 Difference]: With dead ends: 605 [2018-11-18 17:13:11,645 INFO L226 Difference]: Without dead ends: 363 [2018-11-18 17:13:11,647 INFO L604 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-11-18 17:13:11,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2018-11-18 17:13:11,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 361. [2018-11-18 17:13:11,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 361 states. [2018-11-18 17:13:11,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 635 transitions. [2018-11-18 17:13:11,657 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 635 transitions. Word has length 27 [2018-11-18 17:13:11,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:13:11,657 INFO L480 AbstractCegarLoop]: Abstraction has 361 states and 635 transitions. [2018-11-18 17:13:11,657 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 17:13:11,657 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 635 transitions. [2018-11-18 17:13:11,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-18 17:13:11,658 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:13:11,658 INFO L375 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-11-18 17:13:11,659 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:13:11,659 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:13:11,659 INFO L82 PathProgramCache]: Analyzing trace with hash -1813738673, now seen corresponding path program 1 times [2018-11-18 17:13:11,659 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 17:13:11,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:13:11,660 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:13:11,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:13:11,660 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 17:13:11,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:13:11,687 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 17:13:11,688 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 17:13:11,688 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 17:13:11,688 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 17:13:11,688 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 17:13:11,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 17:13:11,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 17:13:11,689 INFO L87 Difference]: Start difference. First operand 361 states and 635 transitions. Second operand 3 states. [2018-11-18 17:13:11,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:13:11,707 INFO L93 Difference]: Finished difference Result 541 states and 949 transitions. [2018-11-18 17:13:11,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 17:13:11,708 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-11-18 17:13:11,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:13:11,709 INFO L225 Difference]: With dead ends: 541 [2018-11-18 17:13:11,709 INFO L226 Difference]: Without dead ends: 367 [2018-11-18 17:13:11,710 INFO L604 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-11-18 17:13:11,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2018-11-18 17:13:11,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 365. [2018-11-18 17:13:11,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 365 states. [2018-11-18 17:13:11,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 635 transitions. [2018-11-18 17:13:11,717 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 635 transitions. Word has length 28 [2018-11-18 17:13:11,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:13:11,718 INFO L480 AbstractCegarLoop]: Abstraction has 365 states and 635 transitions. [2018-11-18 17:13:11,718 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 17:13:11,718 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 635 transitions. [2018-11-18 17:13:11,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-18 17:13:11,719 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:13:11,719 INFO L375 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-11-18 17:13:11,719 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:13:11,719 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:13:11,719 INFO L82 PathProgramCache]: Analyzing trace with hash 487083917, now seen corresponding path program 1 times [2018-11-18 17:13:11,720 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 17:13:11,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:13:11,720 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:13:11,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:13:11,721 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 17:13:11,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:13:11,743 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 17:13:11,743 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 17:13:11,744 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 17:13:11,744 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 17:13:11,744 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 17:13:11,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 17:13:11,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 17:13:11,744 INFO L87 Difference]: Start difference. First operand 365 states and 635 transitions. Second operand 3 states. [2018-11-18 17:13:11,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:13:11,777 INFO L93 Difference]: Finished difference Result 685 states and 1209 transitions. [2018-11-18 17:13:11,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 17:13:11,777 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-11-18 17:13:11,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:13:11,780 INFO L225 Difference]: With dead ends: 685 [2018-11-18 17:13:11,780 INFO L226 Difference]: Without dead ends: 683 [2018-11-18 17:13:11,781 INFO L604 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-11-18 17:13:11,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 683 states. [2018-11-18 17:13:11,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 683 to 497. [2018-11-18 17:13:11,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 497 states. [2018-11-18 17:13:11,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 497 states to 497 states and 855 transitions. [2018-11-18 17:13:11,797 INFO L78 Accepts]: Start accepts. Automaton has 497 states and 855 transitions. Word has length 28 [2018-11-18 17:13:11,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:13:11,797 INFO L480 AbstractCegarLoop]: Abstraction has 497 states and 855 transitions. [2018-11-18 17:13:11,797 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 17:13:11,797 INFO L276 IsEmpty]: Start isEmpty. Operand 497 states and 855 transitions. [2018-11-18 17:13:11,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-18 17:13:11,799 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:13:11,799 INFO L375 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-11-18 17:13:11,799 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:13:11,799 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:13:11,799 INFO L82 PathProgramCache]: Analyzing trace with hash -1101263985, now seen corresponding path program 1 times [2018-11-18 17:13:11,799 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 17:13:11,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:13:11,800 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:13:11,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:13:11,800 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 17:13:11,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:13:11,821 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 17:13:11,821 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 17:13:11,821 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 17:13:11,821 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 17:13:11,821 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 17:13:11,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 17:13:11,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 17:13:11,822 INFO L87 Difference]: Start difference. First operand 497 states and 855 transitions. Second operand 3 states. [2018-11-18 17:13:11,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:13:11,863 INFO L93 Difference]: Finished difference Result 1189 states and 2057 transitions. [2018-11-18 17:13:11,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 17:13:11,863 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-11-18 17:13:11,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:13:11,866 INFO L225 Difference]: With dead ends: 1189 [2018-11-18 17:13:11,866 INFO L226 Difference]: Without dead ends: 707 [2018-11-18 17:13:11,867 INFO L604 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-11-18 17:13:11,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 707 states. [2018-11-18 17:13:11,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 707 to 705. [2018-11-18 17:13:11,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 705 states. [2018-11-18 17:13:11,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 705 states to 705 states and 1207 transitions. [2018-11-18 17:13:11,885 INFO L78 Accepts]: Start accepts. Automaton has 705 states and 1207 transitions. Word has length 28 [2018-11-18 17:13:11,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:13:11,886 INFO L480 AbstractCegarLoop]: Abstraction has 705 states and 1207 transitions. [2018-11-18 17:13:11,886 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 17:13:11,886 INFO L276 IsEmpty]: Start isEmpty. Operand 705 states and 1207 transitions. [2018-11-18 17:13:11,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-18 17:13:11,887 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:13:11,887 INFO L375 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-11-18 17:13:11,887 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:13:11,887 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:13:11,887 INFO L82 PathProgramCache]: Analyzing trace with hash -2080054649, now seen corresponding path program 1 times [2018-11-18 17:13:11,887 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 17:13:11,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:13:11,888 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:13:11,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:13:11,888 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 17:13:11,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:13:11,903 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 17:13:11,904 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 17:13:11,904 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 17:13:11,904 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 17:13:11,904 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 17:13:11,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 17:13:11,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 17:13:11,905 INFO L87 Difference]: Start difference. First operand 705 states and 1207 transitions. Second operand 3 states. [2018-11-18 17:13:11,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:13:11,931 INFO L93 Difference]: Finished difference Result 1057 states and 1805 transitions. [2018-11-18 17:13:11,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 17:13:11,931 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-11-18 17:13:11,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:13:11,933 INFO L225 Difference]: With dead ends: 1057 [2018-11-18 17:13:11,934 INFO L226 Difference]: Without dead ends: 715 [2018-11-18 17:13:11,934 INFO L604 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-11-18 17:13:11,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 715 states. [2018-11-18 17:13:11,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 715 to 713. [2018-11-18 17:13:11,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 713 states. [2018-11-18 17:13:11,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 713 states to 713 states and 1207 transitions. [2018-11-18 17:13:11,954 INFO L78 Accepts]: Start accepts. Automaton has 713 states and 1207 transitions. Word has length 29 [2018-11-18 17:13:11,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:13:11,954 INFO L480 AbstractCegarLoop]: Abstraction has 713 states and 1207 transitions. [2018-11-18 17:13:11,954 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 17:13:11,954 INFO L276 IsEmpty]: Start isEmpty. Operand 713 states and 1207 transitions. [2018-11-18 17:13:11,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-18 17:13:11,955 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:13:11,955 INFO L375 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-11-18 17:13:11,956 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:13:11,956 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:13:11,956 INFO L82 PathProgramCache]: Analyzing trace with hash 220767941, now seen corresponding path program 1 times [2018-11-18 17:13:11,956 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 17:13:11,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:13:11,957 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:13:11,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:13:11,957 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 17:13:11,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:13:11,979 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 17:13:11,980 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 17:13:11,980 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 17:13:11,980 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 17:13:11,980 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 17:13:11,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 17:13:11,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 17:13:11,981 INFO L87 Difference]: Start difference. First operand 713 states and 1207 transitions. Second operand 3 states. [2018-11-18 17:13:12,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:13:12,009 INFO L93 Difference]: Finished difference Result 2077 states and 3513 transitions. [2018-11-18 17:13:12,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 17:13:12,010 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-11-18 17:13:12,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:13:12,014 INFO L225 Difference]: With dead ends: 2077 [2018-11-18 17:13:12,014 INFO L226 Difference]: Without dead ends: 1387 [2018-11-18 17:13:12,016 INFO L604 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-11-18 17:13:12,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1387 states. [2018-11-18 17:13:12,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1387 to 1385. [2018-11-18 17:13:12,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1385 states. [2018-11-18 17:13:12,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1385 states to 1385 states and 2311 transitions. [2018-11-18 17:13:12,051 INFO L78 Accepts]: Start accepts. Automaton has 1385 states and 2311 transitions. Word has length 29 [2018-11-18 17:13:12,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:13:12,051 INFO L480 AbstractCegarLoop]: Abstraction has 1385 states and 2311 transitions. [2018-11-18 17:13:12,051 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 17:13:12,052 INFO L276 IsEmpty]: Start isEmpty. Operand 1385 states and 2311 transitions. [2018-11-18 17:13:12,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-18 17:13:12,053 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:13:12,053 INFO L375 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-11-18 17:13:12,053 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:13:12,053 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:13:12,053 INFO L82 PathProgramCache]: Analyzing trace with hash 1809115843, now seen corresponding path program 1 times [2018-11-18 17:13:12,054 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 17:13:12,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:13:12,054 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:13:12,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:13:12,055 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 17:13:12,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:13:12,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-11-18 17:13:12,076 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 17:13:12,076 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 17:13:12,076 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 17:13:12,077 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 17:13:12,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 17:13:12,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 17:13:12,077 INFO L87 Difference]: Start difference. First operand 1385 states and 2311 transitions. Second operand 3 states. [2018-11-18 17:13:12,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:13:12,105 INFO L93 Difference]: Finished difference Result 1725 states and 2937 transitions. [2018-11-18 17:13:12,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 17:13:12,106 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-11-18 17:13:12,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:13:12,111 INFO L225 Difference]: With dead ends: 1725 [2018-11-18 17:13:12,111 INFO L226 Difference]: Without dead ends: 1723 [2018-11-18 17:13:12,112 INFO L604 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-11-18 17:13:12,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1723 states. [2018-11-18 17:13:12,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1723 to 1385. [2018-11-18 17:13:12,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1385 states. [2018-11-18 17:13:12,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1385 states to 1385 states and 2295 transitions. [2018-11-18 17:13:12,151 INFO L78 Accepts]: Start accepts. Automaton has 1385 states and 2295 transitions. Word has length 29 [2018-11-18 17:13:12,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:13:12,151 INFO L480 AbstractCegarLoop]: Abstraction has 1385 states and 2295 transitions. [2018-11-18 17:13:12,151 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 17:13:12,151 INFO L276 IsEmpty]: Start isEmpty. Operand 1385 states and 2295 transitions. [2018-11-18 17:13:12,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-18 17:13:12,153 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:13:12,153 INFO L375 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-11-18 17:13:12,153 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:13:12,153 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:13:12,154 INFO L82 PathProgramCache]: Analyzing trace with hash -1745914972, now seen corresponding path program 1 times [2018-11-18 17:13:12,154 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 17:13:12,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:13:12,154 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:13:12,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:13:12,155 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 17:13:12,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:13:12,180 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 17:13:12,180 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 17:13:12,180 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 17:13:12,180 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 17:13:12,181 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 17:13:12,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 17:13:12,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 17:13:12,181 INFO L87 Difference]: Start difference. First operand 1385 states and 2295 transitions. Second operand 3 states. [2018-11-18 17:13:12,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:13:12,220 INFO L93 Difference]: Finished difference Result 2557 states and 4313 transitions. [2018-11-18 17:13:12,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 17:13:12,220 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-11-18 17:13:12,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:13:12,228 INFO L225 Difference]: With dead ends: 2557 [2018-11-18 17:13:12,228 INFO L226 Difference]: Without dead ends: 2555 [2018-11-18 17:13:12,229 INFO L604 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-11-18 17:13:12,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2555 states. [2018-11-18 17:13:12,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2555 to 1945. [2018-11-18 17:13:12,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1945 states. [2018-11-18 17:13:12,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1945 states to 1945 states and 3159 transitions. [2018-11-18 17:13:12,281 INFO L78 Accepts]: Start accepts. Automaton has 1945 states and 3159 transitions. Word has length 30 [2018-11-18 17:13:12,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:13:12,281 INFO L480 AbstractCegarLoop]: Abstraction has 1945 states and 3159 transitions. [2018-11-18 17:13:12,281 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 17:13:12,281 INFO L276 IsEmpty]: Start isEmpty. Operand 1945 states and 3159 transitions. [2018-11-18 17:13:12,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-18 17:13:12,284 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:13:12,284 INFO L375 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-11-18 17:13:12,284 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:13:12,284 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:13:12,284 INFO L82 PathProgramCache]: Analyzing trace with hash 960704422, now seen corresponding path program 1 times [2018-11-18 17:13:12,284 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 17:13:12,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:13:12,285 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:13:12,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:13:12,285 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 17:13:12,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:13:12,305 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 17:13:12,305 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 17:13:12,305 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 17:13:12,305 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 17:13:12,306 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 17:13:12,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 17:13:12,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 17:13:12,306 INFO L87 Difference]: Start difference. First operand 1945 states and 3159 transitions. Second operand 3 states. [2018-11-18 17:13:12,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:13:12,374 INFO L93 Difference]: Finished difference Result 4637 states and 7577 transitions. [2018-11-18 17:13:12,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 17:13:12,374 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-11-18 17:13:12,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:13:12,382 INFO L225 Difference]: With dead ends: 4637 [2018-11-18 17:13:12,382 INFO L226 Difference]: Without dead ends: 2715 [2018-11-18 17:13:12,386 INFO L604 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-11-18 17:13:12,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2715 states. [2018-11-18 17:13:12,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2715 to 2713. [2018-11-18 17:13:12,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2713 states. [2018-11-18 17:13:12,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2713 states to 2713 states and 4391 transitions. [2018-11-18 17:13:12,490 INFO L78 Accepts]: Start accepts. Automaton has 2713 states and 4391 transitions. Word has length 30 [2018-11-18 17:13:12,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:13:12,490 INFO L480 AbstractCegarLoop]: Abstraction has 2713 states and 4391 transitions. [2018-11-18 17:13:12,490 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 17:13:12,490 INFO L276 IsEmpty]: Start isEmpty. Operand 2713 states and 4391 transitions. [2018-11-18 17:13:12,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-18 17:13:12,492 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:13:12,493 INFO L375 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-11-18 17:13:12,493 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:13:12,493 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:13:12,493 INFO L82 PathProgramCache]: Analyzing trace with hash 1711424506, now seen corresponding path program 1 times [2018-11-18 17:13:12,493 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 17:13:12,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:13:12,494 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:13:12,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:13:12,494 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 17:13:12,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:13:12,528 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 17:13:12,528 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 17:13:12,528 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 17:13:12,528 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 17:13:12,528 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 17:13:12,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 17:13:12,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 17:13:12,529 INFO L87 Difference]: Start difference. First operand 2713 states and 4391 transitions. Second operand 3 states. [2018-11-18 17:13:12,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:13:12,589 INFO L93 Difference]: Finished difference Result 4093 states and 6617 transitions. [2018-11-18 17:13:12,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 17:13:12,589 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-11-18 17:13:12,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:13:12,596 INFO L225 Difference]: With dead ends: 4093 [2018-11-18 17:13:12,596 INFO L226 Difference]: Without dead ends: 2763 [2018-11-18 17:13:12,599 INFO L604 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-11-18 17:13:12,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2763 states. [2018-11-18 17:13:12,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2763 to 2761. [2018-11-18 17:13:12,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2761 states. [2018-11-18 17:13:12,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2761 states to 2761 states and 4423 transitions. [2018-11-18 17:13:12,663 INFO L78 Accepts]: Start accepts. Automaton has 2761 states and 4423 transitions. Word has length 31 [2018-11-18 17:13:12,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:13:12,663 INFO L480 AbstractCegarLoop]: Abstraction has 2761 states and 4423 transitions. [2018-11-18 17:13:12,663 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 17:13:12,663 INFO L276 IsEmpty]: Start isEmpty. Operand 2761 states and 4423 transitions. [2018-11-18 17:13:12,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-18 17:13:12,665 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:13:12,666 INFO L375 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-11-18 17:13:12,666 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:13:12,666 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:13:12,666 INFO L82 PathProgramCache]: Analyzing trace with hash -282720200, now seen corresponding path program 1 times [2018-11-18 17:13:12,666 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 17:13:12,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:13:12,667 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:13:12,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:13:12,667 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 17:13:12,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:13:12,700 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 17:13:12,701 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 17:13:12,701 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 17:13:12,701 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 17:13:12,701 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 17:13:12,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 17:13:12,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 17:13:12,701 INFO L87 Difference]: Start difference. First operand 2761 states and 4423 transitions. Second operand 3 states. [2018-11-18 17:13:12,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:13:12,760 INFO L93 Difference]: Finished difference Result 5005 states and 8169 transitions. [2018-11-18 17:13:12,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 17:13:12,761 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-11-18 17:13:12,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:13:12,775 INFO L225 Difference]: With dead ends: 5005 [2018-11-18 17:13:12,775 INFO L226 Difference]: Without dead ends: 5003 [2018-11-18 17:13:12,777 INFO L604 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-11-18 17:13:12,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5003 states. [2018-11-18 17:13:12,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5003 to 3913. [2018-11-18 17:13:12,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3913 states. [2018-11-18 17:13:12,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3913 states to 3913 states and 6119 transitions. [2018-11-18 17:13:12,867 INFO L78 Accepts]: Start accepts. Automaton has 3913 states and 6119 transitions. Word has length 31 [2018-11-18 17:13:12,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:13:12,867 INFO L480 AbstractCegarLoop]: Abstraction has 3913 states and 6119 transitions. [2018-11-18 17:13:12,867 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 17:13:12,867 INFO L276 IsEmpty]: Start isEmpty. Operand 3913 states and 6119 transitions. [2018-11-18 17:13:12,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-18 17:13:12,871 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:13:12,871 INFO L375 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-11-18 17:13:12,871 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:13:12,871 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:13:12,871 INFO L82 PathProgramCache]: Analyzing trace with hash -1871068102, now seen corresponding path program 1 times [2018-11-18 17:13:12,871 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 17:13:12,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:13:12,872 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:13:12,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:13:12,872 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 17:13:12,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:13:12,887 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 17:13:12,887 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 17:13:12,887 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 17:13:12,887 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 17:13:12,888 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 17:13:12,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 17:13:12,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 17:13:12,888 INFO L87 Difference]: Start difference. First operand 3913 states and 6119 transitions. Second operand 3 states. [2018-11-18 17:13:12,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:13:12,972 INFO L93 Difference]: Finished difference Result 9229 states and 14505 transitions. [2018-11-18 17:13:12,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 17:13:12,972 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-11-18 17:13:12,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:13:12,987 INFO L225 Difference]: With dead ends: 9229 [2018-11-18 17:13:12,987 INFO L226 Difference]: Without dead ends: 5387 [2018-11-18 17:13:12,993 INFO L604 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-11-18 17:13:12,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5387 states. [2018-11-18 17:13:13,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5387 to 5385. [2018-11-18 17:13:13,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5385 states. [2018-11-18 17:13:13,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5385 states to 5385 states and 8391 transitions. [2018-11-18 17:13:13,122 INFO L78 Accepts]: Start accepts. Automaton has 5385 states and 8391 transitions. Word has length 31 [2018-11-18 17:13:13,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:13:13,122 INFO L480 AbstractCegarLoop]: Abstraction has 5385 states and 8391 transitions. [2018-11-18 17:13:13,122 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 17:13:13,122 INFO L276 IsEmpty]: Start isEmpty. Operand 5385 states and 8391 transitions. [2018-11-18 17:13:13,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-18 17:13:13,126 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:13:13,126 INFO L375 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-11-18 17:13:13,126 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:13:13,127 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:13:13,127 INFO L82 PathProgramCache]: Analyzing trace with hash -174177477, now seen corresponding path program 1 times [2018-11-18 17:13:13,127 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 17:13:13,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:13:13,127 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:13:13,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:13:13,128 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 17:13:13,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:13:13,144 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 17:13:13,144 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 17:13:13,144 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 17:13:13,144 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 17:13:13,144 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 17:13:13,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 17:13:13,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 17:13:13,145 INFO L87 Difference]: Start difference. First operand 5385 states and 8391 transitions. Second operand 3 states. [2018-11-18 17:13:13,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:13:13,218 INFO L93 Difference]: Finished difference Result 8077 states and 12553 transitions. [2018-11-18 17:13:13,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 17:13:13,219 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-11-18 17:13:13,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:13:13,236 INFO L225 Difference]: With dead ends: 8077 [2018-11-18 17:13:13,236 INFO L226 Difference]: Without dead ends: 5451 [2018-11-18 17:13:13,241 INFO L604 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-11-18 17:13:13,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5451 states. [2018-11-18 17:13:13,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5451 to 5449. [2018-11-18 17:13:13,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5449 states. [2018-11-18 17:13:13,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5449 states to 5449 states and 8391 transitions. [2018-11-18 17:13:13,349 INFO L78 Accepts]: Start accepts. Automaton has 5449 states and 8391 transitions. Word has length 32 [2018-11-18 17:13:13,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:13:13,349 INFO L480 AbstractCegarLoop]: Abstraction has 5449 states and 8391 transitions. [2018-11-18 17:13:13,349 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 17:13:13,350 INFO L276 IsEmpty]: Start isEmpty. Operand 5449 states and 8391 transitions. [2018-11-18 17:13:13,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-18 17:13:13,353 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:13:13,353 INFO L375 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-11-18 17:13:13,354 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:13:13,354 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:13:13,354 INFO L82 PathProgramCache]: Analyzing trace with hash 2126645113, now seen corresponding path program 1 times [2018-11-18 17:13:13,354 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 17:13:13,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:13:13,355 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:13:13,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:13:13,355 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 17:13:13,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:13:13,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-11-18 17:13:13,387 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 17:13:13,387 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 17:13:13,388 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 17:13:13,388 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 17:13:13,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 17:13:13,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 17:13:13,388 INFO L87 Difference]: Start difference. First operand 5449 states and 8391 transitions. Second operand 3 states. [2018-11-18 17:13:13,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:13:13,508 INFO L93 Difference]: Finished difference Result 9741 states and 15305 transitions. [2018-11-18 17:13:13,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 17:13:13,508 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-11-18 17:13:13,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:13:13,525 INFO L225 Difference]: With dead ends: 9741 [2018-11-18 17:13:13,525 INFO L226 Difference]: Without dead ends: 9739 [2018-11-18 17:13:13,528 INFO L604 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-11-18 17:13:13,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9739 states. [2018-11-18 17:13:13,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9739 to 7817. [2018-11-18 17:13:13,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7817 states. [2018-11-18 17:13:13,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7817 states to 7817 states and 11719 transitions. [2018-11-18 17:13:13,720 INFO L78 Accepts]: Start accepts. Automaton has 7817 states and 11719 transitions. Word has length 32 [2018-11-18 17:13:13,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:13:13,721 INFO L480 AbstractCegarLoop]: Abstraction has 7817 states and 11719 transitions. [2018-11-18 17:13:13,721 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 17:13:13,721 INFO L276 IsEmpty]: Start isEmpty. Operand 7817 states and 11719 transitions. [2018-11-18 17:13:13,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-18 17:13:13,727 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:13:13,727 INFO L375 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-11-18 17:13:13,727 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:13:13,728 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:13:13,728 INFO L82 PathProgramCache]: Analyzing trace with hash 538297211, now seen corresponding path program 1 times [2018-11-18 17:13:13,728 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 17:13:13,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:13:13,728 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:13:13,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:13:13,729 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 17:13:13,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:13:13,751 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 17:13:13,751 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 17:13:13,751 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 17:13:13,752 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 17:13:13,752 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 17:13:13,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 17:13:13,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 17:13:13,752 INFO L87 Difference]: Start difference. First operand 7817 states and 11719 transitions. Second operand 3 states. [2018-11-18 17:13:13,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:13:13,882 INFO L93 Difference]: Finished difference Result 18317 states and 27593 transitions. [2018-11-18 17:13:13,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 17:13:13,883 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-11-18 17:13:13,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:13:13,897 INFO L225 Difference]: With dead ends: 18317 [2018-11-18 17:13:13,897 INFO L226 Difference]: Without dead ends: 10635 [2018-11-18 17:13:13,908 INFO L604 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-11-18 17:13:13,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10635 states. [2018-11-18 17:13:14,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10635 to 10633. [2018-11-18 17:13:14,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10633 states. [2018-11-18 17:13:14,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10633 states to 10633 states and 15879 transitions. [2018-11-18 17:13:14,099 INFO L78 Accepts]: Start accepts. Automaton has 10633 states and 15879 transitions. Word has length 32 [2018-11-18 17:13:14,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:13:14,099 INFO L480 AbstractCegarLoop]: Abstraction has 10633 states and 15879 transitions. [2018-11-18 17:13:14,099 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 17:13:14,099 INFO L276 IsEmpty]: Start isEmpty. Operand 10633 states and 15879 transitions. [2018-11-18 17:13:14,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-18 17:13:14,107 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:13:14,107 INFO L375 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-11-18 17:13:14,107 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:13:14,107 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:13:14,108 INFO L82 PathProgramCache]: Analyzing trace with hash 1501703535, now seen corresponding path program 1 times [2018-11-18 17:13:14,108 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 17:13:14,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:13:14,108 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:13:14,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:13:14,108 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 17:13:14,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:13:14,131 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 17:13:14,131 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 17:13:14,131 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 17:13:14,132 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 17:13:14,132 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 17:13:14,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 17:13:14,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 17:13:14,132 INFO L87 Difference]: Start difference. First operand 10633 states and 15879 transitions. Second operand 3 states. [2018-11-18 17:13:14,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:13:14,245 INFO L93 Difference]: Finished difference Result 15949 states and 23753 transitions. [2018-11-18 17:13:14,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 17:13:14,245 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2018-11-18 17:13:14,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:13:14,259 INFO L225 Difference]: With dead ends: 15949 [2018-11-18 17:13:14,260 INFO L226 Difference]: Without dead ends: 10763 [2018-11-18 17:13:14,267 INFO L604 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-11-18 17:13:14,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10763 states. [2018-11-18 17:13:14,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10763 to 10761. [2018-11-18 17:13:14,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10761 states. [2018-11-18 17:13:14,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10761 states to 10761 states and 15879 transitions. [2018-11-18 17:13:14,436 INFO L78 Accepts]: Start accepts. Automaton has 10761 states and 15879 transitions. Word has length 33 [2018-11-18 17:13:14,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:13:14,436 INFO L480 AbstractCegarLoop]: Abstraction has 10761 states and 15879 transitions. [2018-11-18 17:13:14,436 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 17:13:14,436 INFO L276 IsEmpty]: Start isEmpty. Operand 10761 states and 15879 transitions. [2018-11-18 17:13:14,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-18 17:13:14,442 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:13:14,442 INFO L375 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-11-18 17:13:14,442 INFO L423 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:13:14,442 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:13:14,442 INFO L82 PathProgramCache]: Analyzing trace with hash -492441171, now seen corresponding path program 1 times [2018-11-18 17:13:14,442 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 17:13:14,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:13:14,443 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:13:14,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:13:14,443 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 17:13:14,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:13:14,471 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 17:13:14,471 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 17:13:14,472 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 17:13:14,472 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 17:13:14,472 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 17:13:14,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 17:13:14,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 17:13:14,472 INFO L87 Difference]: Start difference. First operand 10761 states and 15879 transitions. Second operand 3 states. [2018-11-18 17:13:14,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:13:14,612 INFO L93 Difference]: Finished difference Result 18957 states and 28553 transitions. [2018-11-18 17:13:14,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 17:13:14,613 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2018-11-18 17:13:14,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:13:14,631 INFO L225 Difference]: With dead ends: 18957 [2018-11-18 17:13:14,631 INFO L226 Difference]: Without dead ends: 18955 [2018-11-18 17:13:14,635 INFO L604 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-11-18 17:13:14,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18955 states. [2018-11-18 17:13:14,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18955 to 15625. [2018-11-18 17:13:14,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15625 states. [2018-11-18 17:13:14,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15625 states to 15625 states and 22407 transitions. [2018-11-18 17:13:14,829 INFO L78 Accepts]: Start accepts. Automaton has 15625 states and 22407 transitions. Word has length 33 [2018-11-18 17:13:14,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:13:14,829 INFO L480 AbstractCegarLoop]: Abstraction has 15625 states and 22407 transitions. [2018-11-18 17:13:14,829 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 17:13:14,829 INFO L276 IsEmpty]: Start isEmpty. Operand 15625 states and 22407 transitions. [2018-11-18 17:13:14,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-18 17:13:14,836 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:13:14,836 INFO L375 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-11-18 17:13:14,836 INFO L423 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:13:14,836 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:13:14,836 INFO L82 PathProgramCache]: Analyzing trace with hash -2080789073, now seen corresponding path program 1 times [2018-11-18 17:13:14,837 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 17:13:14,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:13:14,837 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:13:14,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:13:14,837 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 17:13:14,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:13:14,859 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 17:13:14,859 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 17:13:14,860 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 17:13:14,860 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 17:13:14,860 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 17:13:14,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 17:13:14,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 17:13:14,860 INFO L87 Difference]: Start difference. First operand 15625 states and 22407 transitions. Second operand 3 states. [2018-11-18 17:13:15,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:13:15,000 INFO L93 Difference]: Finished difference Result 36365 states and 52361 transitions. [2018-11-18 17:13:15,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 17:13:15,001 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2018-11-18 17:13:15,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:13:15,026 INFO L225 Difference]: With dead ends: 36365 [2018-11-18 17:13:15,027 INFO L226 Difference]: Without dead ends: 21003 [2018-11-18 17:13:15,045 INFO L604 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-11-18 17:13:15,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21003 states. [2018-11-18 17:13:15,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21003 to 21001. [2018-11-18 17:13:15,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21001 states. [2018-11-18 17:13:15,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21001 states to 21001 states and 29959 transitions. [2018-11-18 17:13:15,309 INFO L78 Accepts]: Start accepts. Automaton has 21001 states and 29959 transitions. Word has length 33 [2018-11-18 17:13:15,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:13:15,309 INFO L480 AbstractCegarLoop]: Abstraction has 21001 states and 29959 transitions. [2018-11-18 17:13:15,309 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 17:13:15,310 INFO L276 IsEmpty]: Start isEmpty. Operand 21001 states and 29959 transitions. [2018-11-18 17:13:15,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-18 17:13:15,319 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:13:15,319 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 17:13:15,319 INFO L423 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:13:15,320 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:13:15,320 INFO L82 PathProgramCache]: Analyzing trace with hash 1914407696, now seen corresponding path program 1 times [2018-11-18 17:13:15,320 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 17:13:15,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:13:15,320 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:13:15,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:13:15,321 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 17:13:15,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:13:15,335 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 17:13:15,335 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 17:13:15,335 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 17:13:15,336 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 17:13:15,336 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 17:13:15,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 17:13:15,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 17:13:15,336 INFO L87 Difference]: Start difference. First operand 21001 states and 29959 transitions. Second operand 3 states. [2018-11-18 17:13:15,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:13:15,537 INFO L93 Difference]: Finished difference Result 31501 states and 44809 transitions. [2018-11-18 17:13:15,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 17:13:15,537 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-11-18 17:13:15,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:13:15,560 INFO L225 Difference]: With dead ends: 31501 [2018-11-18 17:13:15,561 INFO L226 Difference]: Without dead ends: 21259 [2018-11-18 17:13:15,571 INFO L604 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-11-18 17:13:15,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21259 states. [2018-11-18 17:13:15,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21259 to 21257. [2018-11-18 17:13:15,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21257 states. [2018-11-18 17:13:15,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21257 states to 21257 states and 29959 transitions. [2018-11-18 17:13:15,818 INFO L78 Accepts]: Start accepts. Automaton has 21257 states and 29959 transitions. Word has length 34 [2018-11-18 17:13:15,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:13:15,818 INFO L480 AbstractCegarLoop]: Abstraction has 21257 states and 29959 transitions. [2018-11-18 17:13:15,818 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 17:13:15,818 INFO L276 IsEmpty]: Start isEmpty. Operand 21257 states and 29959 transitions. [2018-11-18 17:13:15,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-18 17:13:15,824 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:13:15,825 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 17:13:15,825 INFO L423 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:13:15,825 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:13:15,825 INFO L82 PathProgramCache]: Analyzing trace with hash -79737010, now seen corresponding path program 1 times [2018-11-18 17:13:15,825 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 17:13:15,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:13:15,825 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:13:15,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:13:15,825 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 17:13:15,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:13:15,837 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 17:13:15,837 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 17:13:15,837 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 17:13:15,837 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 17:13:15,837 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 17:13:15,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 17:13:15,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 17:13:15,838 INFO L87 Difference]: Start difference. First operand 21257 states and 29959 transitions. Second operand 3 states. [2018-11-18 17:13:16,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:13:16,078 INFO L93 Difference]: Finished difference Result 36877 states and 53001 transitions. [2018-11-18 17:13:16,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 17:13:16,078 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-11-18 17:13:16,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:13:16,103 INFO L225 Difference]: With dead ends: 36877 [2018-11-18 17:13:16,103 INFO L226 Difference]: Without dead ends: 36875 [2018-11-18 17:13:16,109 INFO L604 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-11-18 17:13:16,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36875 states. [2018-11-18 17:13:16,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36875 to 31241. [2018-11-18 17:13:16,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31241 states. [2018-11-18 17:13:16,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31241 states to 31241 states and 42759 transitions. [2018-11-18 17:13:16,570 INFO L78 Accepts]: Start accepts. Automaton has 31241 states and 42759 transitions. Word has length 34 [2018-11-18 17:13:16,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:13:16,570 INFO L480 AbstractCegarLoop]: Abstraction has 31241 states and 42759 transitions. [2018-11-18 17:13:16,570 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 17:13:16,570 INFO L276 IsEmpty]: Start isEmpty. Operand 31241 states and 42759 transitions. [2018-11-18 17:13:16,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-18 17:13:16,582 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:13:16,582 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 17:13:16,582 INFO L423 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:13:16,582 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:13:16,583 INFO L82 PathProgramCache]: Analyzing trace with hash -1668084912, now seen corresponding path program 1 times [2018-11-18 17:13:16,583 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 17:13:16,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:13:16,583 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:13:16,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:13:16,584 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 17:13:16,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:13:16,599 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 17:13:16,599 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 17:13:16,599 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 17:13:16,599 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 17:13:16,600 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 17:13:16,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 17:13:16,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 17:13:16,600 INFO L87 Difference]: Start difference. First operand 31241 states and 42759 transitions. Second operand 3 states. [2018-11-18 17:13:16,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:13:16,934 INFO L93 Difference]: Finished difference Result 72205 states and 99081 transitions. [2018-11-18 17:13:16,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 17:13:16,934 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-11-18 17:13:16,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:13:16,967 INFO L225 Difference]: With dead ends: 72205 [2018-11-18 17:13:16,967 INFO L226 Difference]: Without dead ends: 41483 [2018-11-18 17:13:16,987 INFO L604 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-11-18 17:13:17,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41483 states. [2018-11-18 17:13:17,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41483 to 41481. [2018-11-18 17:13:17,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41481 states. [2018-11-18 17:13:17,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41481 states to 41481 states and 56327 transitions. [2018-11-18 17:13:17,509 INFO L78 Accepts]: Start accepts. Automaton has 41481 states and 56327 transitions. Word has length 34 [2018-11-18 17:13:17,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:13:17,509 INFO L480 AbstractCegarLoop]: Abstraction has 41481 states and 56327 transitions. [2018-11-18 17:13:17,509 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 17:13:17,509 INFO L276 IsEmpty]: Start isEmpty. Operand 41481 states and 56327 transitions. [2018-11-18 17:13:17,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-18 17:13:17,519 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:13:17,519 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 17:13:17,519 INFO L423 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:13:17,519 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:13:17,519 INFO L82 PathProgramCache]: Analyzing trace with hash 1823335140, now seen corresponding path program 1 times [2018-11-18 17:13:17,520 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 17:13:17,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:13:17,520 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:13:17,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:13:17,520 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 17:13:17,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:13:17,536 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 17:13:17,536 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 17:13:17,536 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 17:13:17,536 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 17:13:17,536 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 17:13:17,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 17:13:17,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 17:13:17,537 INFO L87 Difference]: Start difference. First operand 41481 states and 56327 transitions. Second operand 3 states. [2018-11-18 17:13:17,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:13:17,937 INFO L93 Difference]: Finished difference Result 62221 states and 84233 transitions. [2018-11-18 17:13:17,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 17:13:17,942 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2018-11-18 17:13:17,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:13:17,976 INFO L225 Difference]: With dead ends: 62221 [2018-11-18 17:13:17,976 INFO L226 Difference]: Without dead ends: 41995 [2018-11-18 17:13:17,991 INFO L604 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-11-18 17:13:18,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41995 states. [2018-11-18 17:13:18,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41995 to 41993. [2018-11-18 17:13:18,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41993 states. [2018-11-18 17:13:18,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41993 states to 41993 states and 56327 transitions. [2018-11-18 17:13:18,443 INFO L78 Accepts]: Start accepts. Automaton has 41993 states and 56327 transitions. Word has length 35 [2018-11-18 17:13:18,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:13:18,443 INFO L480 AbstractCegarLoop]: Abstraction has 41993 states and 56327 transitions. [2018-11-18 17:13:18,443 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 17:13:18,443 INFO L276 IsEmpty]: Start isEmpty. Operand 41993 states and 56327 transitions. [2018-11-18 17:13:18,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-18 17:13:18,461 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:13:18,461 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 17:13:18,461 INFO L423 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:13:18,461 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:13:18,462 INFO L82 PathProgramCache]: Analyzing trace with hash -170809566, now seen corresponding path program 1 times [2018-11-18 17:13:18,462 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 17:13:18,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:13:18,462 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:13:18,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:13:18,462 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 17:13:18,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:13:18,492 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 17:13:18,492 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 17:13:18,493 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 17:13:18,493 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 17:13:18,493 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 17:13:18,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 17:13:18,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 17:13:18,493 INFO L87 Difference]: Start difference. First operand 41993 states and 56327 transitions. Second operand 3 states. [2018-11-18 17:13:19,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:13:19,162 INFO L93 Difference]: Finished difference Result 71693 states and 97801 transitions. [2018-11-18 17:13:19,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 17:13:19,163 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2018-11-18 17:13:19,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:13:19,221 INFO L225 Difference]: With dead ends: 71693 [2018-11-18 17:13:19,221 INFO L226 Difference]: Without dead ends: 71691 [2018-11-18 17:13:19,231 INFO L604 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-11-18 17:13:19,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71691 states. [2018-11-18 17:13:19,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71691 to 62473. [2018-11-18 17:13:19,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62473 states. [2018-11-18 17:13:19,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62473 states to 62473 states and 81415 transitions. [2018-11-18 17:13:19,956 INFO L78 Accepts]: Start accepts. Automaton has 62473 states and 81415 transitions. Word has length 35 [2018-11-18 17:13:19,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:13:19,956 INFO L480 AbstractCegarLoop]: Abstraction has 62473 states and 81415 transitions. [2018-11-18 17:13:19,956 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 17:13:19,957 INFO L276 IsEmpty]: Start isEmpty. Operand 62473 states and 81415 transitions. [2018-11-18 17:13:19,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-18 17:13:19,987 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:13:19,987 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 17:13:19,987 INFO L423 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:13:19,988 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:13:19,988 INFO L82 PathProgramCache]: Analyzing trace with hash -1759157468, now seen corresponding path program 1 times [2018-11-18 17:13:19,988 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 17:13:19,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:13:19,988 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:13:19,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:13:19,988 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 17:13:19,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:13:20,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-11-18 17:13:20,028 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 17:13:20,028 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 17:13:20,028 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 17:13:20,028 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 17:13:20,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 17:13:20,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 17:13:20,029 INFO L87 Difference]: Start difference. First operand 62473 states and 81415 transitions. Second operand 3 states. [2018-11-18 17:13:20,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:13:20,812 INFO L93 Difference]: Finished difference Result 143373 states and 186889 transitions. [2018-11-18 17:13:20,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 17:13:20,812 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2018-11-18 17:13:20,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:13:20,862 INFO L225 Difference]: With dead ends: 143373 [2018-11-18 17:13:20,862 INFO L226 Difference]: Without dead ends: 81931 [2018-11-18 17:13:20,896 INFO L604 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-11-18 17:13:20,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81931 states. [2018-11-18 17:13:21,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81931 to 81929. [2018-11-18 17:13:21,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81929 states. [2018-11-18 17:13:21,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81929 states to 81929 states and 105479 transitions. [2018-11-18 17:13:21,800 INFO L78 Accepts]: Start accepts. Automaton has 81929 states and 105479 transitions. Word has length 35 [2018-11-18 17:13:21,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:13:21,800 INFO L480 AbstractCegarLoop]: Abstraction has 81929 states and 105479 transitions. [2018-11-18 17:13:21,800 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 17:13:21,800 INFO L276 IsEmpty]: Start isEmpty. Operand 81929 states and 105479 transitions. [2018-11-18 17:13:21,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-18 17:13:21,831 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:13:21,831 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 17:13:21,831 INFO L423 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:13:21,831 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:13:21,832 INFO L82 PathProgramCache]: Analyzing trace with hash -999913755, now seen corresponding path program 1 times [2018-11-18 17:13:21,832 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 17:13:21,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:13:21,832 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:13:21,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:13:21,832 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 17:13:21,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:13:21,848 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 17:13:21,849 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 17:13:21,849 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 17:13:21,849 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 17:13:21,849 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 17:13:21,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 17:13:21,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 17:13:21,850 INFO L87 Difference]: Start difference. First operand 81929 states and 105479 transitions. Second operand 3 states. [2018-11-18 17:13:22,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:13:22,705 INFO L93 Difference]: Finished difference Result 122893 states and 157705 transitions. [2018-11-18 17:13:22,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 17:13:22,706 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2018-11-18 17:13:22,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:13:22,759 INFO L225 Difference]: With dead ends: 122893 [2018-11-18 17:13:22,759 INFO L226 Difference]: Without dead ends: 82955 [2018-11-18 17:13:22,782 INFO L604 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-11-18 17:13:22,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82955 states. [2018-11-18 17:13:23,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82955 to 82953. [2018-11-18 17:13:23,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82953 states. [2018-11-18 17:13:23,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82953 states to 82953 states and 105479 transitions. [2018-11-18 17:13:23,668 INFO L78 Accepts]: Start accepts. Automaton has 82953 states and 105479 transitions. Word has length 36 [2018-11-18 17:13:23,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:13:23,668 INFO L480 AbstractCegarLoop]: Abstraction has 82953 states and 105479 transitions. [2018-11-18 17:13:23,668 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 17:13:23,668 INFO L276 IsEmpty]: Start isEmpty. Operand 82953 states and 105479 transitions. [2018-11-18 17:13:23,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-18 17:13:23,692 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:13:23,692 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 17:13:23,692 INFO L423 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:13:23,692 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:13:23,692 INFO L82 PathProgramCache]: Analyzing trace with hash 1300908835, now seen corresponding path program 1 times [2018-11-18 17:13:23,692 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 17:13:23,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:13:23,693 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:13:23,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:13:23,693 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 17:13:23,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:13:23,710 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 17:13:23,710 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 17:13:23,710 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 17:13:23,711 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 17:13:23,711 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 17:13:23,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 17:13:23,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 17:13:23,711 INFO L87 Difference]: Start difference. First operand 82953 states and 105479 transitions. Second operand 3 states. [2018-11-18 17:13:24,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:13:24,959 INFO L93 Difference]: Finished difference Result 139277 states and 179209 transitions. [2018-11-18 17:13:24,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 17:13:24,960 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2018-11-18 17:13:24,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:13:25,053 INFO L225 Difference]: With dead ends: 139277 [2018-11-18 17:13:25,053 INFO L226 Difference]: Without dead ends: 139275 [2018-11-18 17:13:25,069 INFO L604 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-11-18 17:13:25,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139275 states. [2018-11-18 17:13:26,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139275 to 124937. [2018-11-18 17:13:26,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124937 states. [2018-11-18 17:13:28,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124937 states to 124937 states and 154631 transitions. [2018-11-18 17:13:28,275 INFO L78 Accepts]: Start accepts. Automaton has 124937 states and 154631 transitions. Word has length 36 [2018-11-18 17:13:28,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:13:28,275 INFO L480 AbstractCegarLoop]: Abstraction has 124937 states and 154631 transitions. [2018-11-18 17:13:28,275 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 17:13:28,275 INFO L276 IsEmpty]: Start isEmpty. Operand 124937 states and 154631 transitions. [2018-11-18 17:13:28,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-18 17:13:28,324 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:13:28,324 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 17:13:28,324 INFO L423 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:13:28,324 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:13:28,324 INFO L82 PathProgramCache]: Analyzing trace with hash -287439067, now seen corresponding path program 1 times [2018-11-18 17:13:28,324 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 17:13:28,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:13:28,325 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:13:28,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:13:28,325 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 17:13:28,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:13:28,349 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 17:13:28,349 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 17:13:28,349 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 17:13:28,349 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 17:13:28,349 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 17:13:28,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 17:13:28,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 17:13:28,349 INFO L87 Difference]: Start difference. First operand 124937 states and 154631 transitions. Second operand 3 states. [2018-11-18 17:13:29,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:13:29,719 INFO L93 Difference]: Finished difference Result 284685 states and 351241 transitions. [2018-11-18 17:13:29,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 17:13:29,719 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2018-11-18 17:13:29,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:13:29,835 INFO L225 Difference]: With dead ends: 284685 [2018-11-18 17:13:29,835 INFO L226 Difference]: Without dead ends: 161803 [2018-11-18 17:13:29,904 INFO L604 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-11-18 17:13:29,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161803 states. [2018-11-18 17:13:31,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161803 to 161801. [2018-11-18 17:13:31,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161801 states. [2018-11-18 17:13:31,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161801 states to 161801 states and 196615 transitions. [2018-11-18 17:13:31,945 INFO L78 Accepts]: Start accepts. Automaton has 161801 states and 196615 transitions. Word has length 36 [2018-11-18 17:13:31,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:13:31,946 INFO L480 AbstractCegarLoop]: Abstraction has 161801 states and 196615 transitions. [2018-11-18 17:13:31,946 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 17:13:31,946 INFO L276 IsEmpty]: Start isEmpty. Operand 161801 states and 196615 transitions. [2018-11-18 17:13:31,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-18 17:13:31,999 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:13:31,999 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 17:13:32,000 INFO L423 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:13:32,000 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:13:32,000 INFO L82 PathProgramCache]: Analyzing trace with hash 1673684057, now seen corresponding path program 1 times [2018-11-18 17:13:32,000 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 17:13:32,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:13:32,001 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:13:32,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:13:32,001 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 17:13:32,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:13:32,039 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 17:13:32,039 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 17:13:32,039 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 17:13:32,039 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 17:13:32,040 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 17:13:32,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 17:13:32,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 17:13:32,040 INFO L87 Difference]: Start difference. First operand 161801 states and 196615 transitions. Second operand 3 states. [2018-11-18 17:13:33,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:13:33,328 INFO L93 Difference]: Finished difference Result 242701 states and 293897 transitions. [2018-11-18 17:13:33,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 17:13:33,328 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2018-11-18 17:13:33,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:13:33,452 INFO L225 Difference]: With dead ends: 242701 [2018-11-18 17:13:33,453 INFO L226 Difference]: Without dead ends: 163851 [2018-11-18 17:13:33,504 INFO L604 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-11-18 17:13:33,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163851 states. [2018-11-18 17:13:35,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163851 to 163849. [2018-11-18 17:13:35,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163849 states. [2018-11-18 17:13:35,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163849 states to 163849 states and 196615 transitions. [2018-11-18 17:13:35,772 INFO L78 Accepts]: Start accepts. Automaton has 163849 states and 196615 transitions. Word has length 37 [2018-11-18 17:13:35,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:13:35,772 INFO L480 AbstractCegarLoop]: Abstraction has 163849 states and 196615 transitions. [2018-11-18 17:13:35,772 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 17:13:35,772 INFO L276 IsEmpty]: Start isEmpty. Operand 163849 states and 196615 transitions. [2018-11-18 17:13:35,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-18 17:13:35,826 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:13:35,826 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 17:13:35,826 INFO L423 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:13:35,826 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:13:35,827 INFO L82 PathProgramCache]: Analyzing trace with hash -320460649, now seen corresponding path program 1 times [2018-11-18 17:13:35,827 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 17:13:35,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:13:35,827 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:13:35,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:13:35,828 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 17:13:35,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:13:35,859 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 17:13:35,859 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 17:13:35,859 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 17:13:35,859 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 17:13:35,859 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 17:13:35,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 17:13:35,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 17:13:35,860 INFO L87 Difference]: Start difference. First operand 163849 states and 196615 transitions. Second operand 3 states. [2018-11-18 17:13:38,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:13:38,711 INFO L93 Difference]: Finished difference Result 479245 states and 565257 transitions. [2018-11-18 17:13:38,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 17:13:38,712 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2018-11-18 17:13:38,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:13:38,948 INFO L225 Difference]: With dead ends: 479245 [2018-11-18 17:13:38,948 INFO L226 Difference]: Without dead ends: 319499 [2018-11-18 17:13:39,027 INFO L604 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-11-18 17:13:39,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319499 states. [2018-11-18 17:13:43,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319499 to 319497. [2018-11-18 17:13:43,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 319497 states. [2018-11-18 17:13:43,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319497 states to 319497 states and 368647 transitions. [2018-11-18 17:13:43,413 INFO L78 Accepts]: Start accepts. Automaton has 319497 states and 368647 transitions. Word has length 37 [2018-11-18 17:13:43,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:13:43,413 INFO L480 AbstractCegarLoop]: Abstraction has 319497 states and 368647 transitions. [2018-11-18 17:13:43,413 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 17:13:43,413 INFO L276 IsEmpty]: Start isEmpty. Operand 319497 states and 368647 transitions. [2018-11-18 17:13:43,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-18 17:13:43,523 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:13:43,523 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 17:13:43,524 INFO L423 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:13:43,524 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:13:43,524 INFO L82 PathProgramCache]: Analyzing trace with hash 1267887253, now seen corresponding path program 1 times [2018-11-18 17:13:43,524 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 17:13:43,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:13:43,525 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:13:43,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:13:43,525 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 17:13:43,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:13:43,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-11-18 17:13:43,539 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 17:13:43,539 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 17:13:43,539 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 17:13:43,539 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 17:13:43,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 17:13:43,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 17:13:43,540 INFO L87 Difference]: Start difference. First operand 319497 states and 368647 transitions. Second operand 3 states. [2018-11-18 17:13:48,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:13:48,969 INFO L93 Difference]: Finished difference Result 339981 states and 397321 transitions. [2018-11-18 17:13:48,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 17:13:48,969 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2018-11-18 17:13:48,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:13:49,215 INFO L225 Difference]: With dead ends: 339981 [2018-11-18 17:13:49,215 INFO L226 Difference]: Without dead ends: 339979 [2018-11-18 17:13:49,252 INFO L604 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-11-18 17:13:49,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339979 states. [2018-11-18 17:13:53,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339979 to 319497. [2018-11-18 17:13:53,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 319497 states. [2018-11-18 17:13:53,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319497 states to 319497 states and 364551 transitions. [2018-11-18 17:13:53,346 INFO L78 Accepts]: Start accepts. Automaton has 319497 states and 364551 transitions. Word has length 37 [2018-11-18 17:13:53,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:13:53,346 INFO L480 AbstractCegarLoop]: Abstraction has 319497 states and 364551 transitions. [2018-11-18 17:13:53,346 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 17:13:53,346 INFO L276 IsEmpty]: Start isEmpty. Operand 319497 states and 364551 transitions. [2018-11-18 17:13:53,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-11-18 17:13:53,461 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:13:53,461 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 17:13:53,461 INFO L423 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:13:53,461 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:13:53,461 INFO L82 PathProgramCache]: Analyzing trace with hash -1344129350, now seen corresponding path program 1 times [2018-11-18 17:13:53,461 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 17:13:53,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:13:53,462 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:13:53,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:13:53,462 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 17:13:53,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:13:53,475 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 17:13:53,475 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 17:13:53,475 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 17:13:53,475 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 17:13:53,475 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 17:13:53,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 17:13:53,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 17:13:53,476 INFO L87 Difference]: Start difference. First operand 319497 states and 364551 transitions. Second operand 3 states. [2018-11-18 17:13:58,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:13:58,287 INFO L93 Difference]: Finished difference Result 520203 states and 589832 transitions. [2018-11-18 17:13:58,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 17:13:58,288 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 38 [2018-11-18 17:13:58,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:13:58,667 INFO L225 Difference]: With dead ends: 520203 [2018-11-18 17:13:58,667 INFO L226 Difference]: Without dead ends: 520201 [2018-11-18 17:13:58,722 INFO L604 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-11-18 17:13:58,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 520201 states. [2018-11-18 17:14:04,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 520201 to 495625. [2018-11-18 17:14:04,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 495625 states. [2018-11-18 17:14:04,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495625 states to 495625 states and 557063 transitions. [2018-11-18 17:14:04,469 INFO L78 Accepts]: Start accepts. Automaton has 495625 states and 557063 transitions. Word has length 38 [2018-11-18 17:14:04,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:14:04,469 INFO L480 AbstractCegarLoop]: Abstraction has 495625 states and 557063 transitions. [2018-11-18 17:14:04,469 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 17:14:04,469 INFO L276 IsEmpty]: Start isEmpty. Operand 495625 states and 557063 transitions. [2018-11-18 17:14:04,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-11-18 17:14:04,693 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:14:04,693 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 17:14:04,693 INFO L423 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:14:04,693 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:14:04,693 INFO L82 PathProgramCache]: Analyzing trace with hash 1362490044, now seen corresponding path program 1 times [2018-11-18 17:14:04,693 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 17:14:04,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:14:04,694 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:14:04,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:14:04,694 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 17:14:04,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:14:04,739 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 17:14:04,739 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 17:14:04,739 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 17:14:04,739 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 17:14:04,740 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 17:14:04,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 17:14:04,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 17:14:04,740 INFO L87 Difference]: Start difference. First operand 495625 states and 557063 transitions. Second operand 3 states. [2018-11-18 17:14:13,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:14:13,437 INFO L93 Difference]: Finished difference Result 1118217 states and 1245191 transitions. [2018-11-18 17:14:13,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 17:14:13,438 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 38 [2018-11-18 17:14:13,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:14:13,438 INFO L225 Difference]: With dead ends: 1118217 [2018-11-18 17:14:13,438 INFO L226 Difference]: Without dead ends: 0 [2018-11-18 17:14:13,968 INFO L604 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-11-18 17:14:13,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-18 17:14:13,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-18 17:14:13,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-18 17:14:13,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-18 17:14:13,968 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 38 [2018-11-18 17:14:13,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:14:13,968 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 17:14:13,968 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 17:14:13,968 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-18 17:14:13,968 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 17:14:13,971 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-18 17:14:14,015 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-18 17:14:14,015 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-18 17:14:14,015 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-18 17:14:14,015 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-18 17:14:14,015 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-18 17:14:14,015 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-18 17:14:14,015 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 4 219) no Hoare annotation was computed. [2018-11-18 17:14:14,016 INFO L425 ceAbstractionStarter]: For program point L184-1(lines 51 214) no Hoare annotation was computed. [2018-11-18 17:14:14,016 INFO L425 ceAbstractionStarter]: For program point L118-1(lines 51 214) no Hoare annotation was computed. [2018-11-18 17:14:14,016 INFO L425 ceAbstractionStarter]: For program point L102-1(lines 51 214) no Hoare annotation was computed. [2018-11-18 17:14:14,016 INFO L425 ceAbstractionStarter]: For program point L185(line 185) no Hoare annotation was computed. [2018-11-18 17:14:14,016 INFO L425 ceAbstractionStarter]: For program point L86(lines 86 88) no Hoare annotation was computed. [2018-11-18 17:14:14,016 INFO L425 ceAbstractionStarter]: For program point L53(lines 53 55) no Hoare annotation was computed. [2018-11-18 17:14:14,016 INFO L425 ceAbstractionStarter]: For program point L86-2(lines 51 214) no Hoare annotation was computed. [2018-11-18 17:14:14,016 INFO L425 ceAbstractionStarter]: For program point L169-1(lines 51 214) no Hoare annotation was computed. [2018-11-18 17:14:14,016 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 4 219) no Hoare annotation was computed. [2018-11-18 17:14:14,016 INFO L425 ceAbstractionStarter]: For program point L170(line 170) no Hoare annotation was computed. [2018-11-18 17:14:14,016 INFO L425 ceAbstractionStarter]: For program point L154-1(lines 51 214) no Hoare annotation was computed. [2018-11-18 17:14:14,016 INFO L425 ceAbstractionStarter]: For program point L204-1(lines 51 214) no Hoare annotation was computed. [2018-11-18 17:14:14,016 INFO L425 ceAbstractionStarter]: For program point L138-1(lines 51 214) no Hoare annotation was computed. [2018-11-18 17:14:14,016 INFO L425 ceAbstractionStarter]: For program point L155(line 155) no Hoare annotation was computed. [2018-11-18 17:14:14,017 INFO L425 ceAbstractionStarter]: For program point L122-1(lines 51 214) no Hoare annotation was computed. [2018-11-18 17:14:14,017 INFO L425 ceAbstractionStarter]: For program point L205(line 205) no Hoare annotation was computed. [2018-11-18 17:14:14,017 INFO L425 ceAbstractionStarter]: For program point L106-1(lines 51 214) no Hoare annotation was computed. [2018-11-18 17:14:14,017 INFO L425 ceAbstractionStarter]: For program point L189-1(lines 51 214) no Hoare annotation was computed. [2018-11-18 17:14:14,017 INFO L425 ceAbstractionStarter]: For program point L90-1(lines 51 214) no Hoare annotation was computed. [2018-11-18 17:14:14,017 INFO L425 ceAbstractionStarter]: For program point L190(line 190) no Hoare annotation was computed. [2018-11-18 17:14:14,017 INFO L425 ceAbstractionStarter]: For program point L174-1(lines 51 214) no Hoare annotation was computed. [2018-11-18 17:14:14,017 INFO L425 ceAbstractionStarter]: For program point L175(line 175) no Hoare annotation was computed. [2018-11-18 17:14:14,017 INFO L425 ceAbstractionStarter]: For program point L159-1(lines 51 214) no Hoare annotation was computed. [2018-11-18 17:14:14,017 INFO L425 ceAbstractionStarter]: For program point L126-1(lines 51 214) no Hoare annotation was computed. [2018-11-18 17:14:14,017 INFO L428 ceAbstractionStarter]: At program point L209-1(lines 51 214) the Hoare annotation is: true [2018-11-18 17:14:14,017 INFO L425 ceAbstractionStarter]: For program point L110-1(lines 51 214) no Hoare annotation was computed. [2018-11-18 17:14:14,017 INFO L425 ceAbstractionStarter]: For program point L160(line 160) no Hoare annotation was computed. [2018-11-18 17:14:14,017 INFO L425 ceAbstractionStarter]: For program point L94-1(lines 51 214) no Hoare annotation was computed. [2018-11-18 17:14:14,018 INFO L425 ceAbstractionStarter]: For program point L210(line 210) no Hoare annotation was computed. [2018-11-18 17:14:14,018 INFO L421 ceAbstractionStarter]: At program point L210-1(lines 5 219) the Hoare annotation is: false [2018-11-18 17:14:14,018 INFO L425 ceAbstractionStarter]: For program point L144-1(lines 51 214) no Hoare annotation was computed. [2018-11-18 17:14:14,018 INFO L425 ceAbstractionStarter]: For program point L194-1(lines 51 214) no Hoare annotation was computed. [2018-11-18 17:14:14,018 INFO L425 ceAbstractionStarter]: For program point L145(line 145) no Hoare annotation was computed. [2018-11-18 17:14:14,018 INFO L425 ceAbstractionStarter]: For program point L195(line 195) no Hoare annotation was computed. [2018-11-18 17:14:14,018 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 4 219) the Hoare annotation is: true [2018-11-18 17:14:14,018 INFO L425 ceAbstractionStarter]: For program point L179-1(lines 51 214) no Hoare annotation was computed. [2018-11-18 17:14:14,018 INFO L425 ceAbstractionStarter]: For program point L130-1(lines 51 214) no Hoare annotation was computed. [2018-11-18 17:14:14,018 INFO L425 ceAbstractionStarter]: For program point L180(line 180) no Hoare annotation was computed. [2018-11-18 17:14:14,018 INFO L425 ceAbstractionStarter]: For program point L114-1(lines 51 214) no Hoare annotation was computed. [2018-11-18 17:14:14,018 INFO L425 ceAbstractionStarter]: For program point L164-1(lines 51 214) no Hoare annotation was computed. [2018-11-18 17:14:14,018 INFO L425 ceAbstractionStarter]: For program point L98-1(lines 51 214) no Hoare annotation was computed. [2018-11-18 17:14:14,019 INFO L425 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 217) no Hoare annotation was computed. [2018-11-18 17:14:14,019 INFO L425 ceAbstractionStarter]: For program point L165(line 165) no Hoare annotation was computed. [2018-11-18 17:14:14,019 INFO L428 ceAbstractionStarter]: At program point L215(lines 5 219) the Hoare annotation is: true [2018-11-18 17:14:14,019 INFO L425 ceAbstractionStarter]: For program point L149-1(lines 51 214) no Hoare annotation was computed. [2018-11-18 17:14:14,019 INFO L425 ceAbstractionStarter]: For program point L199-1(lines 51 214) no Hoare annotation was computed. [2018-11-18 17:14:14,019 INFO L425 ceAbstractionStarter]: For program point L150(line 150) no Hoare annotation was computed. [2018-11-18 17:14:14,019 INFO L425 ceAbstractionStarter]: For program point L51-1(lines 51 214) no Hoare annotation was computed. [2018-11-18 17:14:14,019 INFO L425 ceAbstractionStarter]: For program point L200(line 200) no Hoare annotation was computed. [2018-11-18 17:14:14,019 INFO L425 ceAbstractionStarter]: For program point L134-1(lines 51 214) no Hoare annotation was computed. [2018-11-18 17:14:14,024 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 05:14:14 BoogieIcfgContainer [2018-11-18 17:14:14,024 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-18 17:14:14,025 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 17:14:14,025 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 17:14:14,025 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 17:14:14,025 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 05:13:10" (3/4) ... [2018-11-18 17:14:14,028 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-18 17:14:14,033 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-18 17:14:14,034 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-18 17:14:14,039 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2018-11-18 17:14:14,039 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-11-18 17:14:14,039 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-18 17:14:14,088 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_ba25ec5e-94f4-43d0-b92d-84845720934e/bin-2019/utaipan/witness.graphml [2018-11-18 17:14:14,089 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 17:14:14,089 INFO L168 Benchmark]: Toolchain (without parser) took 63702.73 ms. Allocated memory was 1.0 GB in the beginning and 6.4 GB in the end (delta: 5.4 GB). Free memory was 958.1 MB in the beginning and 4.8 GB in the end (delta: -3.8 GB). Peak memory consumption was 1.5 GB. Max. memory is 11.5 GB. [2018-11-18 17:14:14,091 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 17:14:14,091 INFO L168 Benchmark]: CACSL2BoogieTranslator took 179.25 ms. Allocated memory is still 1.0 GB. Free memory was 958.1 MB in the beginning and 944.6 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. [2018-11-18 17:14:14,092 INFO L168 Benchmark]: Boogie Procedure Inliner took 11.54 ms. Allocated memory is still 1.0 GB. Free memory is still 944.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 17:14:14,092 INFO L168 Benchmark]: Boogie Preprocessor took 19.55 ms. Allocated memory is still 1.0 GB. Free memory was 944.6 MB in the beginning and 941.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-18 17:14:14,092 INFO L168 Benchmark]: RCFGBuilder took 290.76 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 153.6 MB). Free memory was 941.9 MB in the beginning and 1.1 GB in the end (delta: -182.5 MB). Peak memory consumption was 14.8 MB. Max. memory is 11.5 GB. [2018-11-18 17:14:14,092 INFO L168 Benchmark]: TraceAbstraction took 63134.30 ms. Allocated memory was 1.2 GB in the beginning and 6.4 GB in the end (delta: 5.2 GB). Free memory was 1.1 GB in the beginning and 4.8 GB in the end (delta: -3.7 GB). Peak memory consumption was 1.5 GB. Max. memory is 11.5 GB. [2018-11-18 17:14:14,093 INFO L168 Benchmark]: Witness Printer took 63.95 ms. Allocated memory is still 6.4 GB. Free memory was 4.8 GB in the beginning and 4.8 GB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 11.5 GB. [2018-11-18 17:14:14,094 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.17 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 179.25 ms. Allocated memory is still 1.0 GB. Free memory was 958.1 MB in the beginning and 944.6 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 11.54 ms. Allocated memory is still 1.0 GB. Free memory is still 944.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 19.55 ms. Allocated memory is still 1.0 GB. Free memory was 944.6 MB in the beginning and 941.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 290.76 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 153.6 MB). Free memory was 941.9 MB in the beginning and 1.1 GB in the end (delta: -182.5 MB). Peak memory consumption was 14.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 63134.30 ms. Allocated memory was 1.2 GB in the beginning and 6.4 GB in the end (delta: 5.2 GB). Free memory was 1.1 GB in the beginning and 4.8 GB in the end (delta: -3.7 GB). Peak memory consumption was 1.5 GB. Max. memory is 11.5 GB. * Witness Printer took 63.95 ms. Allocated memory is still 6.4 GB. Free memory was 4.8 GB in the beginning and 4.8 GB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 217]: 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: 0 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 51]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 57 locations, 1 error locations. SAFE Result, 63.0s OverallTime, 39 OverallIterations, 1 TraceHistogramMax, 33.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 4609 SDtfs, 2290 SDslu, 3157 SDs, 0 SdLazy, 207 SolverSat, 39 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 117 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=495625occurred in iteration=38, 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: 27.7s AutomataMinimizationTime, 39 MinimizatonAttempts, 81961 StatesRemovedByMinimization, 38 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 16394 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.8s InterpolantComputationTime, 1230 NumberOfCodeBlocks, 1230 NumberOfCodeBlocksAsserted, 39 NumberOfCheckSat, 1191 ConstructedInterpolants, 0 QuantifiedInterpolants, 75887 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 39 InterpolantComputations, 39 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...