./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/locks/test_locks_13_true-unreach-call_true-valid-memsafety_false-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_9b0f295e-e803-4f34-a73b-9a854e8f46ab/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_9b0f295e-e803-4f34-a73b-9a854e8f46ab/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_9b0f295e-e803-4f34-a73b-9a854e8f46ab/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_9b0f295e-e803-4f34-a73b-9a854e8f46ab/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/locks/test_locks_13_true-unreach-call_true-valid-memsafety_false-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_9b0f295e-e803-4f34-a73b-9a854e8f46ab/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_9b0f295e-e803-4f34-a73b-9a854e8f46ab/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 87288fc43230a9d3829930d8a140fe9b3ddaa0e7 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-02 15:48:53,728 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 15:48:53,729 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 15:48:53,738 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 15:48:53,738 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 15:48:53,739 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 15:48:53,739 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 15:48:53,741 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 15:48:53,742 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 15:48:53,743 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 15:48:53,743 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 15:48:53,743 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 15:48:53,744 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 15:48:53,745 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 15:48:53,746 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 15:48:53,746 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 15:48:53,747 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 15:48:53,748 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 15:48:53,749 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 15:48:53,750 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 15:48:53,751 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 15:48:53,752 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 15:48:53,754 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 15:48:53,754 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 15:48:53,754 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 15:48:53,755 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 15:48:53,756 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 15:48:53,756 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 15:48:53,757 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 15:48:53,758 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 15:48:53,758 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 15:48:53,758 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 15:48:53,759 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 15:48:53,759 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 15:48:53,759 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 15:48:53,760 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 15:48:53,760 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_9b0f295e-e803-4f34-a73b-9a854e8f46ab/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-02 15:48:53,770 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 15:48:53,770 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 15:48:53,771 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-02 15:48:53,771 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-02 15:48:53,771 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-02 15:48:53,771 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-02 15:48:53,771 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-02 15:48:53,771 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-02 15:48:53,771 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-02 15:48:53,771 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-02 15:48:53,772 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-02 15:48:53,772 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-02 15:48:53,772 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-02 15:48:53,772 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 15:48:53,772 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-02 15:48:53,772 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 15:48:53,773 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-02 15:48:53,773 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 15:48:53,773 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-02 15:48:53,773 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-02 15:48:53,773 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-02 15:48:53,773 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-02 15:48:53,773 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-02 15:48:53,774 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-02 15:48:53,774 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 15:48:53,774 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 15:48:53,774 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-02 15:48:53,774 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-02 15:48:53,774 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 15:48:53,774 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 15:48:53,774 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-02 15:48:53,774 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-02 15:48:53,774 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-02 15:48:53,774 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-02 15:48:53,774 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-02 15:48:53,775 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-02 15:48:53,775 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_9b0f295e-e803-4f34-a73b-9a854e8f46ab/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 -> 87288fc43230a9d3829930d8a140fe9b3ddaa0e7 [2018-12-02 15:48:53,798 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 15:48:53,806 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 15:48:53,809 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 15:48:53,810 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 15:48:53,810 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 15:48:53,811 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_9b0f295e-e803-4f34-a73b-9a854e8f46ab/bin-2019/utaipan/../../sv-benchmarks/c/locks/test_locks_13_true-unreach-call_true-valid-memsafety_false-termination.c [2018-12-02 15:48:53,853 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_9b0f295e-e803-4f34-a73b-9a854e8f46ab/bin-2019/utaipan/data/579c112e3/750e35775efe4b1da20b0b285f401df9/FLAGb3e64c227 [2018-12-02 15:48:54,241 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 15:48:54,241 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_9b0f295e-e803-4f34-a73b-9a854e8f46ab/sv-benchmarks/c/locks/test_locks_13_true-unreach-call_true-valid-memsafety_false-termination.c [2018-12-02 15:48:54,245 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_9b0f295e-e803-4f34-a73b-9a854e8f46ab/bin-2019/utaipan/data/579c112e3/750e35775efe4b1da20b0b285f401df9/FLAGb3e64c227 [2018-12-02 15:48:54,253 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_9b0f295e-e803-4f34-a73b-9a854e8f46ab/bin-2019/utaipan/data/579c112e3/750e35775efe4b1da20b0b285f401df9 [2018-12-02 15:48:54,255 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 15:48:54,256 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 15:48:54,256 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 15:48:54,256 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 15:48:54,258 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 15:48:54,259 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 03:48:54" (1/1) ... [2018-12-02 15:48:54,260 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2fcf5689 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:48:54, skipping insertion in model container [2018-12-02 15:48:54,260 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 03:48:54" (1/1) ... [2018-12-02 15:48:54,264 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 15:48:54,276 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 15:48:54,365 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 15:48:54,368 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 15:48:54,384 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 15:48:54,391 INFO L195 MainTranslator]: Completed translation [2018-12-02 15:48:54,391 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:48:54 WrapperNode [2018-12-02 15:48:54,392 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 15:48:54,392 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 15:48:54,392 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 15:48:54,392 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 15:48:54,397 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:48:54" (1/1) ... [2018-12-02 15:48:54,400 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:48:54" (1/1) ... [2018-12-02 15:48:54,404 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 15:48:54,404 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 15:48:54,404 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 15:48:54,404 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 15:48:54,439 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:48:54" (1/1) ... [2018-12-02 15:48:54,439 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:48:54" (1/1) ... [2018-12-02 15:48:54,441 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:48:54" (1/1) ... [2018-12-02 15:48:54,441 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:48:54" (1/1) ... [2018-12-02 15:48:54,446 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:48:54" (1/1) ... [2018-12-02 15:48:54,451 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:48:54" (1/1) ... [2018-12-02 15:48:54,452 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:48:54" (1/1) ... [2018-12-02 15:48:54,454 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 15:48:54,454 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 15:48:54,454 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 15:48:54,454 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 15:48:54,455 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:48:54" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9b0f295e-e803-4f34-a73b-9a854e8f46ab/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 15:48:54,487 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-02 15:48:54,488 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-02 15:48:54,488 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 15:48:54,488 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 15:48:54,488 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-02 15:48:54,488 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-02 15:48:54,649 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 15:48:54,649 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-02 15:48:54,649 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 03:48:54 BoogieIcfgContainer [2018-12-02 15:48:54,649 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 15:48:54,650 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-02 15:48:54,650 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-02 15:48:54,652 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-02 15:48:54,652 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 03:48:54" (1/3) ... [2018-12-02 15:48:54,653 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7bdcfd1c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 03:48:54, skipping insertion in model container [2018-12-02 15:48:54,653 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:48:54" (2/3) ... [2018-12-02 15:48:54,653 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7bdcfd1c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 03:48:54, skipping insertion in model container [2018-12-02 15:48:54,654 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 03:48:54" (3/3) ... [2018-12-02 15:48:54,655 INFO L112 eAbstractionObserver]: Analyzing ICFG test_locks_13_true-unreach-call_true-valid-memsafety_false-termination.c [2018-12-02 15:48:54,663 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-02 15:48:54,670 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-02 15:48:54,686 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-02 15:48:54,712 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-02 15:48:54,712 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-02 15:48:54,712 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-02 15:48:54,712 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 15:48:54,712 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 15:48:54,712 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-02 15:48:54,713 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 15:48:54,713 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-02 15:48:54,727 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states. [2018-12-02 15:48:54,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-02 15:48:54,732 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 15:48:54,732 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 15:48:54,734 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 15:48:54,738 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:48:54,738 INFO L82 PathProgramCache]: Analyzing trace with hash 2062980600, now seen corresponding path program 1 times [2018-12-02 15:48:54,740 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 15:48:54,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:48:54,773 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:48:54,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:48:54,773 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 15:48:54,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:48:54,852 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 15:48:54,854 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 15:48:54,854 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 15:48:54,854 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 15:48:54,857 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 15:48:54,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 15:48:54,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 15:48:54,866 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 3 states. [2018-12-02 15:48:54,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 15:48:54,898 INFO L93 Difference]: Finished difference Result 105 states and 186 transitions. [2018-12-02 15:48:54,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 15:48:54,899 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-12-02 15:48:54,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 15:48:54,905 INFO L225 Difference]: With dead ends: 105 [2018-12-02 15:48:54,905 INFO L226 Difference]: Without dead ends: 90 [2018-12-02 15:48:54,907 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 15:48:54,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-12-02 15:48:54,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 62. [2018-12-02 15:48:54,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-12-02 15:48:54,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 113 transitions. [2018-12-02 15:48:54,931 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 113 transitions. Word has length 23 [2018-12-02 15:48:54,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 15:48:54,931 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 113 transitions. [2018-12-02 15:48:54,931 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 15:48:54,931 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 113 transitions. [2018-12-02 15:48:54,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-02 15:48:54,931 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 15:48:54,932 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 15:48:54,932 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 15:48:54,932 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:48:54,932 INFO L82 PathProgramCache]: Analyzing trace with hash 1041912246, now seen corresponding path program 1 times [2018-12-02 15:48:54,932 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 15:48:54,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:48:54,933 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:48:54,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:48:54,933 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 15:48:54,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:48:54,959 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 15:48:54,960 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 15:48:54,960 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 15:48:54,960 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 15:48:54,961 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 15:48:54,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 15:48:54,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 15:48:54,961 INFO L87 Difference]: Start difference. First operand 62 states and 113 transitions. Second operand 3 states. [2018-12-02 15:48:54,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 15:48:54,982 INFO L93 Difference]: Finished difference Result 147 states and 272 transitions. [2018-12-02 15:48:54,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 15:48:54,983 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-12-02 15:48:54,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 15:48:54,983 INFO L225 Difference]: With dead ends: 147 [2018-12-02 15:48:54,984 INFO L226 Difference]: Without dead ends: 90 [2018-12-02 15:48:54,984 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 15:48:54,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-12-02 15:48:54,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 88. [2018-12-02 15:48:54,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-12-02 15:48:54,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 161 transitions. [2018-12-02 15:48:54,990 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 161 transitions. Word has length 23 [2018-12-02 15:48:54,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 15:48:54,990 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 161 transitions. [2018-12-02 15:48:54,990 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 15:48:54,990 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 161 transitions. [2018-12-02 15:48:54,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-02 15:48:54,991 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 15:48:54,991 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 15:48:54,991 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 15:48:54,991 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:48:54,991 INFO L82 PathProgramCache]: Analyzing trace with hash -471898432, now seen corresponding path program 1 times [2018-12-02 15:48:54,991 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 15:48:54,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:48:54,992 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:48:54,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:48:54,992 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 15:48:55,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:48:55,018 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 15:48:55,018 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 15:48:55,019 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 15:48:55,019 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 15:48:55,019 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 15:48:55,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 15:48:55,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 15:48:55,019 INFO L87 Difference]: Start difference. First operand 88 states and 161 transitions. Second operand 3 states. [2018-12-02 15:48:55,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 15:48:55,030 INFO L93 Difference]: Finished difference Result 135 states and 243 transitions. [2018-12-02 15:48:55,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 15:48:55,031 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-12-02 15:48:55,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 15:48:55,031 INFO L225 Difference]: With dead ends: 135 [2018-12-02 15:48:55,031 INFO L226 Difference]: Without dead ends: 93 [2018-12-02 15:48:55,031 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 15:48:55,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-12-02 15:48:55,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 91. [2018-12-02 15:48:55,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-12-02 15:48:55,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 163 transitions. [2018-12-02 15:48:55,036 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 163 transitions. Word has length 24 [2018-12-02 15:48:55,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 15:48:55,037 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 163 transitions. [2018-12-02 15:48:55,037 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 15:48:55,037 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 163 transitions. [2018-12-02 15:48:55,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-02 15:48:55,037 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 15:48:55,037 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 15:48:55,037 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 15:48:55,038 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:48:55,038 INFO L82 PathProgramCache]: Analyzing trace with hash -2060246334, now seen corresponding path program 1 times [2018-12-02 15:48:55,038 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 15:48:55,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:48:55,038 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:48:55,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:48:55,038 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 15:48:55,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:48:55,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 15:48:55,065 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 15:48:55,065 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 15:48:55,065 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 15:48:55,065 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 15:48:55,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 15:48:55,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 15:48:55,066 INFO L87 Difference]: Start difference. First operand 91 states and 163 transitions. Second operand 3 states. [2018-12-02 15:48:55,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 15:48:55,076 INFO L93 Difference]: Finished difference Result 172 states and 312 transitions. [2018-12-02 15:48:55,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 15:48:55,077 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-12-02 15:48:55,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 15:48:55,077 INFO L225 Difference]: With dead ends: 172 [2018-12-02 15:48:55,077 INFO L226 Difference]: Without dead ends: 170 [2018-12-02 15:48:55,078 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 15:48:55,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2018-12-02 15:48:55,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 120. [2018-12-02 15:48:55,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-12-02 15:48:55,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 216 transitions. [2018-12-02 15:48:55,083 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 216 transitions. Word has length 24 [2018-12-02 15:48:55,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 15:48:55,084 INFO L480 AbstractCegarLoop]: Abstraction has 120 states and 216 transitions. [2018-12-02 15:48:55,084 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 15:48:55,084 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 216 transitions. [2018-12-02 15:48:55,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-02 15:48:55,084 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 15:48:55,084 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 15:48:55,084 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 15:48:55,084 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:48:55,085 INFO L82 PathProgramCache]: Analyzing trace with hash 1213652608, now seen corresponding path program 1 times [2018-12-02 15:48:55,085 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 15:48:55,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:48:55,085 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:48:55,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:48:55,085 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 15:48:55,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:48:55,102 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 15:48:55,102 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 15:48:55,102 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 15:48:55,102 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 15:48:55,103 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 15:48:55,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 15:48:55,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 15:48:55,103 INFO L87 Difference]: Start difference. First operand 120 states and 216 transitions. Second operand 3 states. [2018-12-02 15:48:55,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 15:48:55,113 INFO L93 Difference]: Finished difference Result 284 states and 518 transitions. [2018-12-02 15:48:55,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 15:48:55,113 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-12-02 15:48:55,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 15:48:55,114 INFO L225 Difference]: With dead ends: 284 [2018-12-02 15:48:55,114 INFO L226 Difference]: Without dead ends: 172 [2018-12-02 15:48:55,114 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 15:48:55,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2018-12-02 15:48:55,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 170. [2018-12-02 15:48:55,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2018-12-02 15:48:55,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 306 transitions. [2018-12-02 15:48:55,123 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 306 transitions. Word has length 24 [2018-12-02 15:48:55,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 15:48:55,123 INFO L480 AbstractCegarLoop]: Abstraction has 170 states and 306 transitions. [2018-12-02 15:48:55,123 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 15:48:55,123 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 306 transitions. [2018-12-02 15:48:55,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-02 15:48:55,124 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 15:48:55,124 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 15:48:55,124 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 15:48:55,124 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:48:55,124 INFO L82 PathProgramCache]: Analyzing trace with hash 557085835, now seen corresponding path program 1 times [2018-12-02 15:48:55,124 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 15:48:55,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:48:55,125 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:48:55,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:48:55,125 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 15:48:55,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:48:55,146 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 15:48:55,146 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 15:48:55,146 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 15:48:55,146 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 15:48:55,147 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 15:48:55,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 15:48:55,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 15:48:55,147 INFO L87 Difference]: Start difference. First operand 170 states and 306 transitions. Second operand 3 states. [2018-12-02 15:48:55,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 15:48:55,159 INFO L93 Difference]: Finished difference Result 255 states and 457 transitions. [2018-12-02 15:48:55,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 15:48:55,159 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-12-02 15:48:55,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 15:48:55,160 INFO L225 Difference]: With dead ends: 255 [2018-12-02 15:48:55,160 INFO L226 Difference]: Without dead ends: 174 [2018-12-02 15:48:55,160 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 15:48:55,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2018-12-02 15:48:55,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 172. [2018-12-02 15:48:55,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2018-12-02 15:48:55,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 306 transitions. [2018-12-02 15:48:55,166 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 306 transitions. Word has length 25 [2018-12-02 15:48:55,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 15:48:55,166 INFO L480 AbstractCegarLoop]: Abstraction has 172 states and 306 transitions. [2018-12-02 15:48:55,166 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 15:48:55,166 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 306 transitions. [2018-12-02 15:48:55,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-02 15:48:55,167 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 15:48:55,167 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 15:48:55,167 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 15:48:55,167 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:48:55,167 INFO L82 PathProgramCache]: Analyzing trace with hash -1031262067, now seen corresponding path program 1 times [2018-12-02 15:48:55,167 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 15:48:55,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:48:55,168 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:48:55,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:48:55,168 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 15:48:55,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:48:55,182 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 15:48:55,183 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 15:48:55,183 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 15:48:55,183 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 15:48:55,183 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 15:48:55,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 15:48:55,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 15:48:55,184 INFO L87 Difference]: Start difference. First operand 172 states and 306 transitions. Second operand 3 states. [2018-12-02 15:48:55,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 15:48:55,194 INFO L93 Difference]: Finished difference Result 324 states and 584 transitions. [2018-12-02 15:48:55,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 15:48:55,194 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-12-02 15:48:55,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 15:48:55,195 INFO L225 Difference]: With dead ends: 324 [2018-12-02 15:48:55,195 INFO L226 Difference]: Without dead ends: 322 [2018-12-02 15:48:55,195 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 15:48:55,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2018-12-02 15:48:55,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 232. [2018-12-02 15:48:55,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2018-12-02 15:48:55,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 410 transitions. [2018-12-02 15:48:55,202 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 410 transitions. Word has length 25 [2018-12-02 15:48:55,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 15:48:55,202 INFO L480 AbstractCegarLoop]: Abstraction has 232 states and 410 transitions. [2018-12-02 15:48:55,202 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 15:48:55,202 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 410 transitions. [2018-12-02 15:48:55,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-02 15:48:55,203 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 15:48:55,203 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 15:48:55,203 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 15:48:55,203 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:48:55,204 INFO L82 PathProgramCache]: Analyzing trace with hash -2052330421, now seen corresponding path program 1 times [2018-12-02 15:48:55,204 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 15:48:55,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:48:55,204 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:48:55,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:48:55,205 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 15:48:55,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:48:55,217 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 15:48:55,217 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 15:48:55,218 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 15:48:55,218 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 15:48:55,218 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 15:48:55,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 15:48:55,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 15:48:55,219 INFO L87 Difference]: Start difference. First operand 232 states and 410 transitions. Second operand 3 states. [2018-12-02 15:48:55,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 15:48:55,239 INFO L93 Difference]: Finished difference Result 552 states and 984 transitions. [2018-12-02 15:48:55,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 15:48:55,240 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-12-02 15:48:55,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 15:48:55,241 INFO L225 Difference]: With dead ends: 552 [2018-12-02 15:48:55,241 INFO L226 Difference]: Without dead ends: 330 [2018-12-02 15:48:55,241 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 15:48:55,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2018-12-02 15:48:55,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 328. [2018-12-02 15:48:55,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 328 states. [2018-12-02 15:48:55,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 578 transitions. [2018-12-02 15:48:55,249 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 578 transitions. Word has length 25 [2018-12-02 15:48:55,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 15:48:55,249 INFO L480 AbstractCegarLoop]: Abstraction has 328 states and 578 transitions. [2018-12-02 15:48:55,249 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 15:48:55,249 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 578 transitions. [2018-12-02 15:48:55,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-02 15:48:55,250 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 15:48:55,251 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 15:48:55,251 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 15:48:55,251 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:48:55,251 INFO L82 PathProgramCache]: Analyzing trace with hash -1904139915, now seen corresponding path program 1 times [2018-12-02 15:48:55,251 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 15:48:55,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:48:55,252 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:48:55,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:48:55,252 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 15:48:55,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:48:55,273 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 15:48:55,273 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 15:48:55,273 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 15:48:55,273 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 15:48:55,273 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 15:48:55,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 15:48:55,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 15:48:55,274 INFO L87 Difference]: Start difference. First operand 328 states and 578 transitions. Second operand 3 states. [2018-12-02 15:48:55,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 15:48:55,287 INFO L93 Difference]: Finished difference Result 492 states and 864 transitions. [2018-12-02 15:48:55,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 15:48:55,287 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-12-02 15:48:55,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 15:48:55,288 INFO L225 Difference]: With dead ends: 492 [2018-12-02 15:48:55,288 INFO L226 Difference]: Without dead ends: 334 [2018-12-02 15:48:55,289 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 15:48:55,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2018-12-02 15:48:55,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 332. [2018-12-02 15:48:55,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 332 states. [2018-12-02 15:48:55,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 578 transitions. [2018-12-02 15:48:55,299 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 578 transitions. Word has length 26 [2018-12-02 15:48:55,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 15:48:55,299 INFO L480 AbstractCegarLoop]: Abstraction has 332 states and 578 transitions. [2018-12-02 15:48:55,299 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 15:48:55,299 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 578 transitions. [2018-12-02 15:48:55,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-02 15:48:55,300 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 15:48:55,300 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 15:48:55,301 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 15:48:55,301 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:48:55,301 INFO L82 PathProgramCache]: Analyzing trace with hash 802479479, now seen corresponding path program 1 times [2018-12-02 15:48:55,301 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 15:48:55,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:48:55,302 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:48:55,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:48:55,302 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 15:48:55,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:48:55,323 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 15:48:55,323 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 15:48:55,323 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 15:48:55,323 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 15:48:55,323 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 15:48:55,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 15:48:55,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 15:48:55,324 INFO L87 Difference]: Start difference. First operand 332 states and 578 transitions. Second operand 3 states. [2018-12-02 15:48:55,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 15:48:55,345 INFO L93 Difference]: Finished difference Result 620 states and 1096 transitions. [2018-12-02 15:48:55,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 15:48:55,346 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-12-02 15:48:55,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 15:48:55,348 INFO L225 Difference]: With dead ends: 620 [2018-12-02 15:48:55,348 INFO L226 Difference]: Without dead ends: 618 [2018-12-02 15:48:55,349 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 15:48:55,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states. [2018-12-02 15:48:55,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 456. [2018-12-02 15:48:55,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 456 states. [2018-12-02 15:48:55,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 456 states and 782 transitions. [2018-12-02 15:48:55,363 INFO L78 Accepts]: Start accepts. Automaton has 456 states and 782 transitions. Word has length 26 [2018-12-02 15:48:55,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 15:48:55,363 INFO L480 AbstractCegarLoop]: Abstraction has 456 states and 782 transitions. [2018-12-02 15:48:55,363 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 15:48:55,363 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 782 transitions. [2018-12-02 15:48:55,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-02 15:48:55,364 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 15:48:55,365 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 15:48:55,365 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 15:48:55,365 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:48:55,365 INFO L82 PathProgramCache]: Analyzing trace with hash -218588875, now seen corresponding path program 1 times [2018-12-02 15:48:55,365 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 15:48:55,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:48:55,366 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:48:55,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:48:55,366 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 15:48:55,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:48:55,382 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 15:48:55,382 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 15:48:55,382 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 15:48:55,382 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 15:48:55,383 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 15:48:55,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 15:48:55,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 15:48:55,383 INFO L87 Difference]: Start difference. First operand 456 states and 782 transitions. Second operand 3 states. [2018-12-02 15:48:55,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 15:48:55,404 INFO L93 Difference]: Finished difference Result 1084 states and 1872 transitions. [2018-12-02 15:48:55,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 15:48:55,405 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-12-02 15:48:55,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 15:48:55,407 INFO L225 Difference]: With dead ends: 1084 [2018-12-02 15:48:55,407 INFO L226 Difference]: Without dead ends: 642 [2018-12-02 15:48:55,408 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 15:48:55,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 642 states. [2018-12-02 15:48:55,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 642 to 640. [2018-12-02 15:48:55,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 640 states. [2018-12-02 15:48:55,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 640 states to 640 states and 1094 transitions. [2018-12-02 15:48:55,427 INFO L78 Accepts]: Start accepts. Automaton has 640 states and 1094 transitions. Word has length 26 [2018-12-02 15:48:55,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 15:48:55,427 INFO L480 AbstractCegarLoop]: Abstraction has 640 states and 1094 transitions. [2018-12-02 15:48:55,427 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 15:48:55,427 INFO L276 IsEmpty]: Start isEmpty. Operand 640 states and 1094 transitions. [2018-12-02 15:48:55,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-02 15:48:55,428 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 15:48:55,428 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 15:48:55,429 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 15:48:55,429 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:48:55,429 INFO L82 PathProgramCache]: Analyzing trace with hash -892726496, now seen corresponding path program 1 times [2018-12-02 15:48:55,429 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 15:48:55,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:48:55,430 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:48:55,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:48:55,430 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 15:48:55,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:48:55,445 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 15:48:55,445 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 15:48:55,446 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 15:48:55,446 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 15:48:55,446 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 15:48:55,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 15:48:55,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 15:48:55,447 INFO L87 Difference]: Start difference. First operand 640 states and 1094 transitions. Second operand 3 states. [2018-12-02 15:48:55,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 15:48:55,467 INFO L93 Difference]: Finished difference Result 960 states and 1636 transitions. [2018-12-02 15:48:55,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 15:48:55,467 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-12-02 15:48:55,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 15:48:55,469 INFO L225 Difference]: With dead ends: 960 [2018-12-02 15:48:55,469 INFO L226 Difference]: Without dead ends: 650 [2018-12-02 15:48:55,470 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 15:48:55,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 650 states. [2018-12-02 15:48:55,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 650 to 648. [2018-12-02 15:48:55,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 648 states. [2018-12-02 15:48:55,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 648 states to 648 states and 1094 transitions. [2018-12-02 15:48:55,488 INFO L78 Accepts]: Start accepts. Automaton has 648 states and 1094 transitions. Word has length 27 [2018-12-02 15:48:55,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 15:48:55,488 INFO L480 AbstractCegarLoop]: Abstraction has 648 states and 1094 transitions. [2018-12-02 15:48:55,489 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 15:48:55,489 INFO L276 IsEmpty]: Start isEmpty. Operand 648 states and 1094 transitions. [2018-12-02 15:48:55,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-02 15:48:55,490 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 15:48:55,490 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 15:48:55,490 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 15:48:55,490 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:48:55,490 INFO L82 PathProgramCache]: Analyzing trace with hash 1813892898, now seen corresponding path program 1 times [2018-12-02 15:48:55,490 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 15:48:55,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:48:55,491 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:48:55,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:48:55,492 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 15:48:55,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:48:55,508 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 15:48:55,509 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 15:48:55,509 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 15:48:55,509 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 15:48:55,509 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 15:48:55,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 15:48:55,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 15:48:55,510 INFO L87 Difference]: Start difference. First operand 648 states and 1094 transitions. Second operand 3 states. [2018-12-02 15:48:55,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 15:48:55,532 INFO L93 Difference]: Finished difference Result 1196 states and 2056 transitions. [2018-12-02 15:48:55,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 15:48:55,533 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-12-02 15:48:55,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 15:48:55,537 INFO L225 Difference]: With dead ends: 1196 [2018-12-02 15:48:55,537 INFO L226 Difference]: Without dead ends: 1194 [2018-12-02 15:48:55,537 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 15:48:55,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1194 states. [2018-12-02 15:48:55,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1194 to 904. [2018-12-02 15:48:55,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 904 states. [2018-12-02 15:48:55,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 904 states to 904 states and 1494 transitions. [2018-12-02 15:48:55,562 INFO L78 Accepts]: Start accepts. Automaton has 904 states and 1494 transitions. Word has length 27 [2018-12-02 15:48:55,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 15:48:55,563 INFO L480 AbstractCegarLoop]: Abstraction has 904 states and 1494 transitions. [2018-12-02 15:48:55,563 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 15:48:55,563 INFO L276 IsEmpty]: Start isEmpty. Operand 904 states and 1494 transitions. [2018-12-02 15:48:55,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-02 15:48:55,564 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 15:48:55,564 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 15:48:55,564 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 15:48:55,565 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:48:55,565 INFO L82 PathProgramCache]: Analyzing trace with hash 792824544, now seen corresponding path program 1 times [2018-12-02 15:48:55,565 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 15:48:55,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:48:55,566 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:48:55,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:48:55,566 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 15:48:55,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:48:55,582 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 15:48:55,582 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 15:48:55,582 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 15:48:55,582 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 15:48:55,583 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 15:48:55,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 15:48:55,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 15:48:55,583 INFO L87 Difference]: Start difference. First operand 904 states and 1494 transitions. Second operand 3 states. [2018-12-02 15:48:55,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 15:48:55,612 INFO L93 Difference]: Finished difference Result 2140 states and 3560 transitions. [2018-12-02 15:48:55,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 15:48:55,612 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-12-02 15:48:55,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 15:48:55,616 INFO L225 Difference]: With dead ends: 2140 [2018-12-02 15:48:55,616 INFO L226 Difference]: Without dead ends: 1258 [2018-12-02 15:48:55,617 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 15:48:55,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1258 states. [2018-12-02 15:48:55,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1258 to 1256. [2018-12-02 15:48:55,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1256 states. [2018-12-02 15:48:55,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1256 states to 1256 states and 2070 transitions. [2018-12-02 15:48:55,652 INFO L78 Accepts]: Start accepts. Automaton has 1256 states and 2070 transitions. Word has length 27 [2018-12-02 15:48:55,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 15:48:55,652 INFO L480 AbstractCegarLoop]: Abstraction has 1256 states and 2070 transitions. [2018-12-02 15:48:55,652 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 15:48:55,652 INFO L276 IsEmpty]: Start isEmpty. Operand 1256 states and 2070 transitions. [2018-12-02 15:48:55,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-02 15:48:55,654 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 15:48:55,654 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 15:48:55,654 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 15:48:55,654 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:48:55,654 INFO L82 PathProgramCache]: Analyzing trace with hash 396318762, now seen corresponding path program 1 times [2018-12-02 15:48:55,654 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 15:48:55,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:48:55,655 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:48:55,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:48:55,655 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 15:48:55,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:48:55,668 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 15:48:55,668 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 15:48:55,668 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 15:48:55,669 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 15:48:55,669 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 15:48:55,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 15:48:55,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 15:48:55,669 INFO L87 Difference]: Start difference. First operand 1256 states and 2070 transitions. Second operand 3 states. [2018-12-02 15:48:55,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 15:48:55,696 INFO L93 Difference]: Finished difference Result 1884 states and 3096 transitions. [2018-12-02 15:48:55,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 15:48:55,697 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-12-02 15:48:55,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 15:48:55,700 INFO L225 Difference]: With dead ends: 1884 [2018-12-02 15:48:55,701 INFO L226 Difference]: Without dead ends: 1274 [2018-12-02 15:48:55,702 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 15:48:55,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1274 states. [2018-12-02 15:48:55,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1274 to 1272. [2018-12-02 15:48:55,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1272 states. [2018-12-02 15:48:55,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1272 states to 1272 states and 2070 transitions. [2018-12-02 15:48:55,727 INFO L78 Accepts]: Start accepts. Automaton has 1272 states and 2070 transitions. Word has length 28 [2018-12-02 15:48:55,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 15:48:55,728 INFO L480 AbstractCegarLoop]: Abstraction has 1272 states and 2070 transitions. [2018-12-02 15:48:55,728 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 15:48:55,728 INFO L276 IsEmpty]: Start isEmpty. Operand 1272 states and 2070 transitions. [2018-12-02 15:48:55,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-02 15:48:55,729 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 15:48:55,729 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 15:48:55,729 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 15:48:55,729 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:48:55,729 INFO L82 PathProgramCache]: Analyzing trace with hash -1192029140, now seen corresponding path program 1 times [2018-12-02 15:48:55,729 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 15:48:55,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:48:55,730 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:48:55,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:48:55,730 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 15:48:55,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:48:55,745 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 15:48:55,745 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 15:48:55,746 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 15:48:55,746 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 15:48:55,746 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 15:48:55,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 15:48:55,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 15:48:55,746 INFO L87 Difference]: Start difference. First operand 1272 states and 2070 transitions. Second operand 3 states. [2018-12-02 15:48:55,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 15:48:55,781 INFO L93 Difference]: Finished difference Result 2316 states and 3848 transitions. [2018-12-02 15:48:55,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 15:48:55,782 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-12-02 15:48:55,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 15:48:55,788 INFO L225 Difference]: With dead ends: 2316 [2018-12-02 15:48:55,788 INFO L226 Difference]: Without dead ends: 2314 [2018-12-02 15:48:55,789 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 15:48:55,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2314 states. [2018-12-02 15:48:55,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2314 to 1800. [2018-12-02 15:48:55,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1800 states. [2018-12-02 15:48:55,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1800 states to 1800 states and 2854 transitions. [2018-12-02 15:48:55,838 INFO L78 Accepts]: Start accepts. Automaton has 1800 states and 2854 transitions. Word has length 28 [2018-12-02 15:48:55,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 15:48:55,839 INFO L480 AbstractCegarLoop]: Abstraction has 1800 states and 2854 transitions. [2018-12-02 15:48:55,839 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 15:48:55,839 INFO L276 IsEmpty]: Start isEmpty. Operand 1800 states and 2854 transitions. [2018-12-02 15:48:55,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-02 15:48:55,841 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 15:48:55,841 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 15:48:55,841 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 15:48:55,842 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:48:55,842 INFO L82 PathProgramCache]: Analyzing trace with hash 2081869802, now seen corresponding path program 1 times [2018-12-02 15:48:55,842 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 15:48:55,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:48:55,842 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:48:55,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:48:55,843 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 15:48:55,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:48:55,855 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 15:48:55,856 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 15:48:55,856 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 15:48:55,856 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 15:48:55,856 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 15:48:55,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 15:48:55,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 15:48:55,857 INFO L87 Difference]: Start difference. First operand 1800 states and 2854 transitions. Second operand 3 states. [2018-12-02 15:48:55,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 15:48:55,891 INFO L93 Difference]: Finished difference Result 4236 states and 6760 transitions. [2018-12-02 15:48:55,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 15:48:55,892 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-12-02 15:48:55,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 15:48:55,896 INFO L225 Difference]: With dead ends: 4236 [2018-12-02 15:48:55,896 INFO L226 Difference]: Without dead ends: 2474 [2018-12-02 15:48:55,898 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 15:48:55,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2474 states. [2018-12-02 15:48:55,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2474 to 2472. [2018-12-02 15:48:55,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2472 states. [2018-12-02 15:48:55,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2472 states to 2472 states and 3910 transitions. [2018-12-02 15:48:55,955 INFO L78 Accepts]: Start accepts. Automaton has 2472 states and 3910 transitions. Word has length 28 [2018-12-02 15:48:55,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 15:48:55,956 INFO L480 AbstractCegarLoop]: Abstraction has 2472 states and 3910 transitions. [2018-12-02 15:48:55,956 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 15:48:55,956 INFO L276 IsEmpty]: Start isEmpty. Operand 2472 states and 3910 transitions. [2018-12-02 15:48:55,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-12-02 15:48:55,958 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 15:48:55,958 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 15:48:55,958 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 15:48:55,958 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:48:55,958 INFO L82 PathProgramCache]: Analyzing trace with hash 1702016437, now seen corresponding path program 1 times [2018-12-02 15:48:55,958 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 15:48:55,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:48:55,959 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:48:55,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:48:55,959 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 15:48:55,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:48:55,973 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 15:48:55,973 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 15:48:55,973 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 15:48:55,974 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 15:48:55,974 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 15:48:55,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 15:48:55,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 15:48:55,974 INFO L87 Difference]: Start difference. First operand 2472 states and 3910 transitions. Second operand 3 states. [2018-12-02 15:48:56,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 15:48:56,013 INFO L93 Difference]: Finished difference Result 3708 states and 5848 transitions. [2018-12-02 15:48:56,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 15:48:56,013 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-12-02 15:48:56,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 15:48:56,017 INFO L225 Difference]: With dead ends: 3708 [2018-12-02 15:48:56,017 INFO L226 Difference]: Without dead ends: 2506 [2018-12-02 15:48:56,019 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 15:48:56,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2506 states. [2018-12-02 15:48:56,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2506 to 2504. [2018-12-02 15:48:56,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2504 states. [2018-12-02 15:48:56,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2504 states to 2504 states and 3910 transitions. [2018-12-02 15:48:56,055 INFO L78 Accepts]: Start accepts. Automaton has 2504 states and 3910 transitions. Word has length 29 [2018-12-02 15:48:56,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 15:48:56,055 INFO L480 AbstractCegarLoop]: Abstraction has 2504 states and 3910 transitions. [2018-12-02 15:48:56,055 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 15:48:56,055 INFO L276 IsEmpty]: Start isEmpty. Operand 2504 states and 3910 transitions. [2018-12-02 15:48:56,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-12-02 15:48:56,056 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 15:48:56,056 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 15:48:56,056 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 15:48:56,057 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:48:56,057 INFO L82 PathProgramCache]: Analyzing trace with hash 113668535, now seen corresponding path program 1 times [2018-12-02 15:48:56,057 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 15:48:56,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:48:56,057 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:48:56,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:48:56,058 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 15:48:56,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:48:56,067 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 15:48:56,067 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 15:48:56,067 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 15:48:56,067 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 15:48:56,068 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 15:48:56,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 15:48:56,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 15:48:56,068 INFO L87 Difference]: Start difference. First operand 2504 states and 3910 transitions. Second operand 3 states. [2018-12-02 15:48:56,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 15:48:56,106 INFO L93 Difference]: Finished difference Result 4492 states and 7176 transitions. [2018-12-02 15:48:56,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 15:48:56,107 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-12-02 15:48:56,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 15:48:56,114 INFO L225 Difference]: With dead ends: 4492 [2018-12-02 15:48:56,114 INFO L226 Difference]: Without dead ends: 4490 [2018-12-02 15:48:56,115 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 15:48:56,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4490 states. [2018-12-02 15:48:56,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4490 to 3592. [2018-12-02 15:48:56,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3592 states. [2018-12-02 15:48:56,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3592 states to 3592 states and 5446 transitions. [2018-12-02 15:48:56,168 INFO L78 Accepts]: Start accepts. Automaton has 3592 states and 5446 transitions. Word has length 29 [2018-12-02 15:48:56,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 15:48:56,168 INFO L480 AbstractCegarLoop]: Abstraction has 3592 states and 5446 transitions. [2018-12-02 15:48:56,168 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 15:48:56,169 INFO L276 IsEmpty]: Start isEmpty. Operand 3592 states and 5446 transitions. [2018-12-02 15:48:56,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-12-02 15:48:56,171 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 15:48:56,171 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 15:48:56,171 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 15:48:56,171 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:48:56,171 INFO L82 PathProgramCache]: Analyzing trace with hash -907399819, now seen corresponding path program 1 times [2018-12-02 15:48:56,171 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 15:48:56,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:48:56,172 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:48:56,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:48:56,172 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 15:48:56,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:48:56,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-12-02 15:48:56,180 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 15:48:56,180 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 15:48:56,180 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 15:48:56,181 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 15:48:56,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 15:48:56,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 15:48:56,181 INFO L87 Difference]: Start difference. First operand 3592 states and 5446 transitions. Second operand 3 states. [2018-12-02 15:48:56,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 15:48:56,254 INFO L93 Difference]: Finished difference Result 8396 states and 12808 transitions. [2018-12-02 15:48:56,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 15:48:56,255 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-12-02 15:48:56,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 15:48:56,267 INFO L225 Difference]: With dead ends: 8396 [2018-12-02 15:48:56,267 INFO L226 Difference]: Without dead ends: 4874 [2018-12-02 15:48:56,272 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 15:48:56,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4874 states. [2018-12-02 15:48:56,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4874 to 4872. [2018-12-02 15:48:56,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4872 states. [2018-12-02 15:48:56,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4872 states to 4872 states and 7366 transitions. [2018-12-02 15:48:56,357 INFO L78 Accepts]: Start accepts. Automaton has 4872 states and 7366 transitions. Word has length 29 [2018-12-02 15:48:56,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 15:48:56,357 INFO L480 AbstractCegarLoop]: Abstraction has 4872 states and 7366 transitions. [2018-12-02 15:48:56,357 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 15:48:56,357 INFO L276 IsEmpty]: Start isEmpty. Operand 4872 states and 7366 transitions. [2018-12-02 15:48:56,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-02 15:48:56,360 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 15:48:56,360 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 15:48:56,360 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 15:48:56,360 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:48:56,360 INFO L82 PathProgramCache]: Analyzing trace with hash -771028257, now seen corresponding path program 1 times [2018-12-02 15:48:56,360 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 15:48:56,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:48:56,361 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:48:56,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:48:56,361 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 15:48:56,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:48:56,373 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 15:48:56,374 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 15:48:56,374 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 15:48:56,374 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 15:48:56,374 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 15:48:56,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 15:48:56,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 15:48:56,374 INFO L87 Difference]: Start difference. First operand 4872 states and 7366 transitions. Second operand 3 states. [2018-12-02 15:48:56,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 15:48:56,448 INFO L93 Difference]: Finished difference Result 7308 states and 11016 transitions. [2018-12-02 15:48:56,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 15:48:56,448 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-12-02 15:48:56,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 15:48:56,457 INFO L225 Difference]: With dead ends: 7308 [2018-12-02 15:48:56,458 INFO L226 Difference]: Without dead ends: 4938 [2018-12-02 15:48:56,461 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 15:48:56,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4938 states. [2018-12-02 15:48:56,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4938 to 4936. [2018-12-02 15:48:56,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4936 states. [2018-12-02 15:48:56,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4936 states to 4936 states and 7366 transitions. [2018-12-02 15:48:56,534 INFO L78 Accepts]: Start accepts. Automaton has 4936 states and 7366 transitions. Word has length 30 [2018-12-02 15:48:56,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 15:48:56,535 INFO L480 AbstractCegarLoop]: Abstraction has 4936 states and 7366 transitions. [2018-12-02 15:48:56,535 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 15:48:56,535 INFO L276 IsEmpty]: Start isEmpty. Operand 4936 states and 7366 transitions. [2018-12-02 15:48:56,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-02 15:48:56,537 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 15:48:56,537 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 15:48:56,537 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 15:48:56,538 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:48:56,538 INFO L82 PathProgramCache]: Analyzing trace with hash 1935591137, now seen corresponding path program 1 times [2018-12-02 15:48:56,538 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 15:48:56,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:48:56,538 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:48:56,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:48:56,538 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 15:48:56,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:48:56,550 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 15:48:56,550 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 15:48:56,551 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 15:48:56,551 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 15:48:56,551 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 15:48:56,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 15:48:56,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 15:48:56,551 INFO L87 Difference]: Start difference. First operand 4936 states and 7366 transitions. Second operand 3 states. [2018-12-02 15:48:56,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 15:48:56,650 INFO L93 Difference]: Finished difference Result 14412 states and 21320 transitions. [2018-12-02 15:48:56,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 15:48:56,651 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-12-02 15:48:56,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 15:48:56,661 INFO L225 Difference]: With dead ends: 14412 [2018-12-02 15:48:56,662 INFO L226 Difference]: Without dead ends: 9610 [2018-12-02 15:48:56,667 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 15:48:56,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9610 states. [2018-12-02 15:48:56,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9610 to 9608. [2018-12-02 15:48:56,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9608 states. [2018-12-02 15:48:56,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9608 states to 9608 states and 13958 transitions. [2018-12-02 15:48:56,803 INFO L78 Accepts]: Start accepts. Automaton has 9608 states and 13958 transitions. Word has length 30 [2018-12-02 15:48:56,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 15:48:56,803 INFO L480 AbstractCegarLoop]: Abstraction has 9608 states and 13958 transitions. [2018-12-02 15:48:56,803 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 15:48:56,803 INFO L276 IsEmpty]: Start isEmpty. Operand 9608 states and 13958 transitions. [2018-12-02 15:48:56,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-02 15:48:56,807 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 15:48:56,807 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 15:48:56,808 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 15:48:56,808 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:48:56,808 INFO L82 PathProgramCache]: Analyzing trace with hash -1338307805, now seen corresponding path program 1 times [2018-12-02 15:48:56,808 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 15:48:56,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:48:56,808 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:48:56,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:48:56,809 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 15:48:56,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:48:56,817 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 15:48:56,817 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 15:48:56,817 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 15:48:56,817 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 15:48:56,817 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 15:48:56,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 15:48:56,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 15:48:56,817 INFO L87 Difference]: Start difference. First operand 9608 states and 13958 transitions. Second operand 3 states. [2018-12-02 15:48:56,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 15:48:56,893 INFO L93 Difference]: Finished difference Result 11148 states and 16776 transitions. [2018-12-02 15:48:56,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 15:48:56,894 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-12-02 15:48:56,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 15:48:56,905 INFO L225 Difference]: With dead ends: 11148 [2018-12-02 15:48:56,905 INFO L226 Difference]: Without dead ends: 11146 [2018-12-02 15:48:56,907 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 15:48:56,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11146 states. [2018-12-02 15:48:57,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11146 to 9608. [2018-12-02 15:48:57,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9608 states. [2018-12-02 15:48:57,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9608 states to 9608 states and 13830 transitions. [2018-12-02 15:48:57,013 INFO L78 Accepts]: Start accepts. Automaton has 9608 states and 13830 transitions. Word has length 30 [2018-12-02 15:48:57,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 15:48:57,013 INFO L480 AbstractCegarLoop]: Abstraction has 9608 states and 13830 transitions. [2018-12-02 15:48:57,013 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 15:48:57,013 INFO L276 IsEmpty]: Start isEmpty. Operand 9608 states and 13830 transitions. [2018-12-02 15:48:57,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-02 15:48:57,017 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 15:48:57,017 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 15:48:57,017 INFO L423 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 15:48:57,017 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:48:57,017 INFO L82 PathProgramCache]: Analyzing trace with hash -126002102, now seen corresponding path program 1 times [2018-12-02 15:48:57,017 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 15:48:57,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:48:57,017 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:48:57,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:48:57,018 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 15:48:57,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:48:57,029 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 15:48:57,030 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 15:48:57,030 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 15:48:57,030 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 15:48:57,030 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 15:48:57,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 15:48:57,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 15:48:57,030 INFO L87 Difference]: Start difference. First operand 9608 states and 13830 transitions. Second operand 3 states. [2018-12-02 15:48:57,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 15:48:57,141 INFO L93 Difference]: Finished difference Result 16780 states and 24712 transitions. [2018-12-02 15:48:57,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 15:48:57,142 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-12-02 15:48:57,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 15:48:57,153 INFO L225 Difference]: With dead ends: 16780 [2018-12-02 15:48:57,153 INFO L226 Difference]: Without dead ends: 16778 [2018-12-02 15:48:57,156 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 15:48:57,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16778 states. [2018-12-02 15:48:57,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16778 to 14216. [2018-12-02 15:48:57,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14216 states. [2018-12-02 15:48:57,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14216 states to 14216 states and 19846 transitions. [2018-12-02 15:48:57,318 INFO L78 Accepts]: Start accepts. Automaton has 14216 states and 19846 transitions. Word has length 31 [2018-12-02 15:48:57,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 15:48:57,318 INFO L480 AbstractCegarLoop]: Abstraction has 14216 states and 19846 transitions. [2018-12-02 15:48:57,318 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 15:48:57,318 INFO L276 IsEmpty]: Start isEmpty. Operand 14216 states and 19846 transitions. [2018-12-02 15:48:57,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-02 15:48:57,326 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 15:48:57,326 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 15:48:57,326 INFO L423 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 15:48:57,326 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:48:57,326 INFO L82 PathProgramCache]: Analyzing trace with hash -1147070456, now seen corresponding path program 1 times [2018-12-02 15:48:57,326 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 15:48:57,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:48:57,327 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:48:57,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:48:57,327 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 15:48:57,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:48:57,337 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 15:48:57,337 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 15:48:57,337 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 15:48:57,337 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 15:48:57,338 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 15:48:57,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 15:48:57,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 15:48:57,338 INFO L87 Difference]: Start difference. First operand 14216 states and 19846 transitions. Second operand 3 states. [2018-12-02 15:48:57,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 15:48:57,517 INFO L93 Difference]: Finished difference Result 32908 states and 46216 transitions. [2018-12-02 15:48:57,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 15:48:57,518 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-12-02 15:48:57,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 15:48:57,531 INFO L225 Difference]: With dead ends: 32908 [2018-12-02 15:48:57,531 INFO L226 Difference]: Without dead ends: 18826 [2018-12-02 15:48:57,545 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 15:48:57,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18826 states. [2018-12-02 15:48:57,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18826 to 18824. [2018-12-02 15:48:57,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18824 states. [2018-12-02 15:48:57,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18824 states to 18824 states and 26118 transitions. [2018-12-02 15:48:57,785 INFO L78 Accepts]: Start accepts. Automaton has 18824 states and 26118 transitions. Word has length 31 [2018-12-02 15:48:57,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 15:48:57,786 INFO L480 AbstractCegarLoop]: Abstraction has 18824 states and 26118 transitions. [2018-12-02 15:48:57,786 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 15:48:57,786 INFO L276 IsEmpty]: Start isEmpty. Operand 18824 states and 26118 transitions. [2018-12-02 15:48:57,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-02 15:48:57,792 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 15:48:57,792 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 15:48:57,792 INFO L423 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 15:48:57,792 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:48:57,792 INFO L82 PathProgramCache]: Analyzing trace with hash 389117270, now seen corresponding path program 1 times [2018-12-02 15:48:57,792 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 15:48:57,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:48:57,793 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:48:57,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:48:57,793 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 15:48:57,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:48:57,804 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 15:48:57,805 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 15:48:57,805 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 15:48:57,805 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 15:48:57,805 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 15:48:57,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 15:48:57,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 15:48:57,806 INFO L87 Difference]: Start difference. First operand 18824 states and 26118 transitions. Second operand 3 states. [2018-12-02 15:48:57,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 15:48:57,961 INFO L93 Difference]: Finished difference Result 28428 states and 39432 transitions. [2018-12-02 15:48:57,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 15:48:57,962 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-12-02 15:48:57,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 15:48:57,975 INFO L225 Difference]: With dead ends: 28428 [2018-12-02 15:48:57,975 INFO L226 Difference]: Without dead ends: 19210 [2018-12-02 15:48:57,983 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 15:48:57,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19210 states. [2018-12-02 15:48:58,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19210 to 19208. [2018-12-02 15:48:58,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19208 states. [2018-12-02 15:48:58,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19208 states to 19208 states and 26374 transitions. [2018-12-02 15:48:58,222 INFO L78 Accepts]: Start accepts. Automaton has 19208 states and 26374 transitions. Word has length 32 [2018-12-02 15:48:58,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 15:48:58,223 INFO L480 AbstractCegarLoop]: Abstraction has 19208 states and 26374 transitions. [2018-12-02 15:48:58,223 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 15:48:58,223 INFO L276 IsEmpty]: Start isEmpty. Operand 19208 states and 26374 transitions. [2018-12-02 15:48:58,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-02 15:48:58,228 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 15:48:58,228 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 15:48:58,229 INFO L423 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 15:48:58,229 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:48:58,229 INFO L82 PathProgramCache]: Analyzing trace with hash -1199230632, now seen corresponding path program 1 times [2018-12-02 15:48:58,229 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 15:48:58,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:48:58,229 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:48:58,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:48:58,229 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 15:48:58,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:48:58,237 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 15:48:58,237 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 15:48:58,237 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 15:48:58,237 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 15:48:58,238 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 15:48:58,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 15:48:58,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 15:48:58,238 INFO L87 Difference]: Start difference. First operand 19208 states and 26374 transitions. Second operand 3 states. [2018-12-02 15:48:58,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 15:48:58,445 INFO L93 Difference]: Finished difference Result 32780 states and 45832 transitions. [2018-12-02 15:48:58,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 15:48:58,446 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-12-02 15:48:58,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 15:48:58,466 INFO L225 Difference]: With dead ends: 32780 [2018-12-02 15:48:58,466 INFO L226 Difference]: Without dead ends: 32778 [2018-12-02 15:48:58,472 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 15:48:58,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32778 states. [2018-12-02 15:48:58,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32778 to 28680. [2018-12-02 15:48:58,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28680 states. [2018-12-02 15:48:58,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28680 states to 28680 states and 38150 transitions. [2018-12-02 15:48:58,787 INFO L78 Accepts]: Start accepts. Automaton has 28680 states and 38150 transitions. Word has length 32 [2018-12-02 15:48:58,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 15:48:58,787 INFO L480 AbstractCegarLoop]: Abstraction has 28680 states and 38150 transitions. [2018-12-02 15:48:58,787 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 15:48:58,787 INFO L276 IsEmpty]: Start isEmpty. Operand 28680 states and 38150 transitions. [2018-12-02 15:48:58,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-02 15:48:58,804 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 15:48:58,804 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 15:48:58,804 INFO L423 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 15:48:58,805 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:48:58,805 INFO L82 PathProgramCache]: Analyzing trace with hash 2074668310, now seen corresponding path program 1 times [2018-12-02 15:48:58,805 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 15:48:58,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:48:58,805 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:48:58,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:48:58,806 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 15:48:58,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:48:58,829 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 15:48:58,830 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 15:48:58,830 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 15:48:58,830 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 15:48:58,830 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 15:48:58,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 15:48:58,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 15:48:58,830 INFO L87 Difference]: Start difference. First operand 28680 states and 38150 transitions. Second operand 3 states. [2018-12-02 15:48:59,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 15:48:59,145 INFO L93 Difference]: Finished difference Result 65548 states and 87304 transitions. [2018-12-02 15:48:59,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 15:48:59,145 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-12-02 15:48:59,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 15:48:59,168 INFO L225 Difference]: With dead ends: 65548 [2018-12-02 15:48:59,168 INFO L226 Difference]: Without dead ends: 37386 [2018-12-02 15:48:59,187 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 15:48:59,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37386 states. [2018-12-02 15:48:59,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37386 to 37384. [2018-12-02 15:48:59,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37384 states. [2018-12-02 15:48:59,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37384 states to 37384 states and 49158 transitions. [2018-12-02 15:48:59,630 INFO L78 Accepts]: Start accepts. Automaton has 37384 states and 49158 transitions. Word has length 32 [2018-12-02 15:48:59,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 15:48:59,630 INFO L480 AbstractCegarLoop]: Abstraction has 37384 states and 49158 transitions. [2018-12-02 15:48:59,630 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 15:48:59,631 INFO L276 IsEmpty]: Start isEmpty. Operand 37384 states and 49158 transitions. [2018-12-02 15:48:59,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-12-02 15:48:59,642 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 15:48:59,642 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 15:48:59,642 INFO L423 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 15:48:59,642 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:48:59,643 INFO L82 PathProgramCache]: Analyzing trace with hash 1478771549, now seen corresponding path program 1 times [2018-12-02 15:48:59,643 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 15:48:59,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:48:59,643 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:48:59,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:48:59,643 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 15:48:59,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:48:59,652 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 15:48:59,652 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 15:48:59,652 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 15:48:59,652 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 15:48:59,652 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 15:48:59,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 15:48:59,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 15:48:59,653 INFO L87 Difference]: Start difference. First operand 37384 states and 49158 transitions. Second operand 3 states. [2018-12-02 15:48:59,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 15:48:59,956 INFO L93 Difference]: Finished difference Result 56076 states and 73480 transitions. [2018-12-02 15:48:59,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 15:48:59,956 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2018-12-02 15:48:59,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 15:48:59,982 INFO L225 Difference]: With dead ends: 56076 [2018-12-02 15:48:59,982 INFO L226 Difference]: Without dead ends: 37898 [2018-12-02 15:48:59,995 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 15:49:00,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37898 states. [2018-12-02 15:49:00,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37898 to 37896. [2018-12-02 15:49:00,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37896 states. [2018-12-02 15:49:00,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37896 states to 37896 states and 49158 transitions. [2018-12-02 15:49:00,444 INFO L78 Accepts]: Start accepts. Automaton has 37896 states and 49158 transitions. Word has length 33 [2018-12-02 15:49:00,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 15:49:00,444 INFO L480 AbstractCegarLoop]: Abstraction has 37896 states and 49158 transitions. [2018-12-02 15:49:00,444 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 15:49:00,444 INFO L276 IsEmpty]: Start isEmpty. Operand 37896 states and 49158 transitions. [2018-12-02 15:49:00,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-12-02 15:49:00,456 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 15:49:00,456 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 15:49:00,456 INFO L423 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 15:49:00,456 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:49:00,456 INFO L82 PathProgramCache]: Analyzing trace with hash -109576353, now seen corresponding path program 1 times [2018-12-02 15:49:00,456 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 15:49:00,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:49:00,457 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:49:00,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:49:00,457 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 15:49:00,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:49:00,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-12-02 15:49:00,471 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 15:49:00,471 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 15:49:00,471 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 15:49:00,471 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 15:49:00,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 15:49:00,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 15:49:00,471 INFO L87 Difference]: Start difference. First operand 37896 states and 49158 transitions. Second operand 3 states. [2018-12-02 15:49:01,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 15:49:01,035 INFO L93 Difference]: Finished difference Result 63500 states and 83464 transitions. [2018-12-02 15:49:01,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 15:49:01,036 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2018-12-02 15:49:01,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 15:49:01,071 INFO L225 Difference]: With dead ends: 63500 [2018-12-02 15:49:01,071 INFO L226 Difference]: Without dead ends: 63498 [2018-12-02 15:49:01,076 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 15:49:01,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63498 states. [2018-12-02 15:49:01,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63498 to 57352. [2018-12-02 15:49:01,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57352 states. [2018-12-02 15:49:01,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57352 states to 57352 states and 72198 transitions. [2018-12-02 15:49:01,701 INFO L78 Accepts]: Start accepts. Automaton has 57352 states and 72198 transitions. Word has length 33 [2018-12-02 15:49:01,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 15:49:01,701 INFO L480 AbstractCegarLoop]: Abstraction has 57352 states and 72198 transitions. [2018-12-02 15:49:01,701 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 15:49:01,701 INFO L276 IsEmpty]: Start isEmpty. Operand 57352 states and 72198 transitions. [2018-12-02 15:49:01,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-12-02 15:49:01,723 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 15:49:01,723 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 15:49:01,723 INFO L423 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 15:49:01,724 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:49:01,724 INFO L82 PathProgramCache]: Analyzing trace with hash -1130644707, now seen corresponding path program 1 times [2018-12-02 15:49:01,724 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 15:49:01,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:49:01,724 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:49:01,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:49:01,724 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 15:49:01,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:49:01,749 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 15:49:01,749 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 15:49:01,749 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 15:49:01,749 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 15:49:01,749 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 15:49:01,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 15:49:01,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 15:49:01,749 INFO L87 Difference]: Start difference. First operand 57352 states and 72198 transitions. Second operand 3 states. [2018-12-02 15:49:02,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 15:49:02,404 INFO L93 Difference]: Finished difference Result 130060 states and 163336 transitions. [2018-12-02 15:49:02,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 15:49:02,404 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2018-12-02 15:49:02,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 15:49:02,449 INFO L225 Difference]: With dead ends: 130060 [2018-12-02 15:49:02,449 INFO L226 Difference]: Without dead ends: 73738 [2018-12-02 15:49:02,479 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 15:49:02,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73738 states. [2018-12-02 15:49:03,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73738 to 73736. [2018-12-02 15:49:03,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73736 states. [2018-12-02 15:49:03,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73736 states to 73736 states and 91142 transitions. [2018-12-02 15:49:03,391 INFO L78 Accepts]: Start accepts. Automaton has 73736 states and 91142 transitions. Word has length 33 [2018-12-02 15:49:03,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 15:49:03,392 INFO L480 AbstractCegarLoop]: Abstraction has 73736 states and 91142 transitions. [2018-12-02 15:49:03,392 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 15:49:03,392 INFO L276 IsEmpty]: Start isEmpty. Operand 73736 states and 91142 transitions. [2018-12-02 15:49:03,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-02 15:49:03,426 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 15:49:03,427 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 15:49:03,427 INFO L423 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 15:49:03,427 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:49:03,427 INFO L82 PathProgramCache]: Analyzing trace with hash 898316171, now seen corresponding path program 1 times [2018-12-02 15:49:03,427 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 15:49:03,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:49:03,428 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:49:03,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:49:03,428 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 15:49:03,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:49:03,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 15:49:03,453 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 15:49:03,454 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 15:49:03,454 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 15:49:03,454 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 15:49:03,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 15:49:03,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 15:49:03,454 INFO L87 Difference]: Start difference. First operand 73736 states and 91142 transitions. Second operand 3 states. [2018-12-02 15:49:04,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 15:49:04,085 INFO L93 Difference]: Finished difference Result 110604 states and 136200 transitions. [2018-12-02 15:49:04,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 15:49:04,086 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-12-02 15:49:04,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 15:49:04,139 INFO L225 Difference]: With dead ends: 110604 [2018-12-02 15:49:04,139 INFO L226 Difference]: Without dead ends: 74762 [2018-12-02 15:49:04,168 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 15:49:04,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74762 states. [2018-12-02 15:49:05,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74762 to 74760. [2018-12-02 15:49:05,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74760 states. [2018-12-02 15:49:05,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74760 states to 74760 states and 91142 transitions. [2018-12-02 15:49:05,213 INFO L78 Accepts]: Start accepts. Automaton has 74760 states and 91142 transitions. Word has length 34 [2018-12-02 15:49:05,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 15:49:05,213 INFO L480 AbstractCegarLoop]: Abstraction has 74760 states and 91142 transitions. [2018-12-02 15:49:05,213 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 15:49:05,213 INFO L276 IsEmpty]: Start isEmpty. Operand 74760 states and 91142 transitions. [2018-12-02 15:49:05,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-02 15:49:05,234 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 15:49:05,235 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 15:49:05,235 INFO L423 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 15:49:05,235 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:49:05,235 INFO L82 PathProgramCache]: Analyzing trace with hash -690031731, now seen corresponding path program 1 times [2018-12-02 15:49:05,235 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 15:49:05,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:49:05,236 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:49:05,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:49:05,236 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 15:49:05,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:49:05,250 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 15:49:05,250 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 15:49:05,250 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 15:49:05,251 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 15:49:05,251 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 15:49:05,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 15:49:05,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 15:49:05,251 INFO L87 Difference]: Start difference. First operand 74760 states and 91142 transitions. Second operand 3 states. [2018-12-02 15:49:06,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 15:49:06,243 INFO L93 Difference]: Finished difference Result 122892 states and 150536 transitions. [2018-12-02 15:49:06,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 15:49:06,243 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-12-02 15:49:06,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 15:49:06,335 INFO L225 Difference]: With dead ends: 122892 [2018-12-02 15:49:06,335 INFO L226 Difference]: Without dead ends: 122890 [2018-12-02 15:49:06,359 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 15:49:06,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122890 states. [2018-12-02 15:49:07,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122890 to 114696. [2018-12-02 15:49:07,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114696 states. [2018-12-02 15:49:07,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114696 states to 114696 states and 136198 transitions. [2018-12-02 15:49:07,762 INFO L78 Accepts]: Start accepts. Automaton has 114696 states and 136198 transitions. Word has length 34 [2018-12-02 15:49:07,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 15:49:07,762 INFO L480 AbstractCegarLoop]: Abstraction has 114696 states and 136198 transitions. [2018-12-02 15:49:07,762 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 15:49:07,762 INFO L276 IsEmpty]: Start isEmpty. Operand 114696 states and 136198 transitions. [2018-12-02 15:49:07,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-02 15:49:07,809 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 15:49:07,809 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 15:49:07,810 INFO L423 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 15:49:07,810 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:49:07,810 INFO L82 PathProgramCache]: Analyzing trace with hash -1711100085, now seen corresponding path program 1 times [2018-12-02 15:49:07,810 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 15:49:07,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:49:07,810 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:49:07,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:49:07,811 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 15:49:07,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:49:07,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-12-02 15:49:07,821 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 15:49:07,822 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 15:49:07,822 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 15:49:07,822 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 15:49:07,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 15:49:07,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 15:49:07,822 INFO L87 Difference]: Start difference. First operand 114696 states and 136198 transitions. Second operand 3 states. [2018-12-02 15:49:09,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 15:49:09,245 INFO L93 Difference]: Finished difference Result 258060 states and 304136 transitions. [2018-12-02 15:49:09,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 15:49:09,245 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-12-02 15:49:09,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 15:49:09,356 INFO L225 Difference]: With dead ends: 258060 [2018-12-02 15:49:09,356 INFO L226 Difference]: Without dead ends: 145418 [2018-12-02 15:49:09,418 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 15:49:09,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145418 states. [2018-12-02 15:49:11,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145418 to 145416. [2018-12-02 15:49:11,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145416 states. [2018-12-02 15:49:11,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145416 states to 145416 states and 167942 transitions. [2018-12-02 15:49:11,314 INFO L78 Accepts]: Start accepts. Automaton has 145416 states and 167942 transitions. Word has length 34 [2018-12-02 15:49:11,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 15:49:11,315 INFO L480 AbstractCegarLoop]: Abstraction has 145416 states and 167942 transitions. [2018-12-02 15:49:11,315 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 15:49:11,315 INFO L276 IsEmpty]: Start isEmpty. Operand 145416 states and 167942 transitions. [2018-12-02 15:49:11,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-12-02 15:49:11,377 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 15:49:11,377 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 15:49:11,377 INFO L423 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 15:49:11,377 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:49:11,377 INFO L82 PathProgramCache]: Analyzing trace with hash 84068978, now seen corresponding path program 1 times [2018-12-02 15:49:11,377 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 15:49:11,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:49:11,378 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:49:11,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:49:11,378 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 15:49:11,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:49:11,389 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 15:49:11,389 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 15:49:11,389 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 15:49:11,389 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 15:49:11,390 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 15:49:11,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 15:49:11,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 15:49:11,390 INFO L87 Difference]: Start difference. First operand 145416 states and 167942 transitions. Second operand 3 states. [2018-12-02 15:49:12,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 15:49:12,766 INFO L93 Difference]: Finished difference Result 218124 states and 250888 transitions. [2018-12-02 15:49:12,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 15:49:12,767 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2018-12-02 15:49:12,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 15:49:12,879 INFO L225 Difference]: With dead ends: 218124 [2018-12-02 15:49:12,879 INFO L226 Difference]: Without dead ends: 147466 [2018-12-02 15:49:12,932 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 15:49:12,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147466 states. [2018-12-02 15:49:15,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147466 to 147464. [2018-12-02 15:49:15,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147464 states. [2018-12-02 15:49:16,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147464 states to 147464 states and 167942 transitions. [2018-12-02 15:49:16,021 INFO L78 Accepts]: Start accepts. Automaton has 147464 states and 167942 transitions. Word has length 35 [2018-12-02 15:49:16,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 15:49:16,021 INFO L480 AbstractCegarLoop]: Abstraction has 147464 states and 167942 transitions. [2018-12-02 15:49:16,021 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 15:49:16,021 INFO L276 IsEmpty]: Start isEmpty. Operand 147464 states and 167942 transitions. [2018-12-02 15:49:16,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-12-02 15:49:16,072 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 15:49:16,072 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 15:49:16,072 INFO L423 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 15:49:16,072 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:49:16,072 INFO L82 PathProgramCache]: Analyzing trace with hash -1504278924, now seen corresponding path program 1 times [2018-12-02 15:49:16,072 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 15:49:16,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:49:16,073 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:49:16,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:49:16,073 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 15:49:16,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:49:16,081 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 15:49:16,081 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 15:49:16,081 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 15:49:16,081 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 15:49:16,081 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 15:49:16,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 15:49:16,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 15:49:16,082 INFO L87 Difference]: Start difference. First operand 147464 states and 167942 transitions. Second operand 3 states. [2018-12-02 15:49:18,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 15:49:18,197 INFO L93 Difference]: Finished difference Result 237578 states and 268295 transitions. [2018-12-02 15:49:18,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 15:49:18,197 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2018-12-02 15:49:18,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 15:49:18,407 INFO L225 Difference]: With dead ends: 237578 [2018-12-02 15:49:18,407 INFO L226 Difference]: Without dead ends: 237576 [2018-12-02 15:49:18,453 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 15:49:18,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237576 states. [2018-12-02 15:49:20,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237576 to 229384. [2018-12-02 15:49:20,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229384 states. [2018-12-02 15:49:21,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229384 states to 229384 states and 256006 transitions. [2018-12-02 15:49:21,194 INFO L78 Accepts]: Start accepts. Automaton has 229384 states and 256006 transitions. Word has length 35 [2018-12-02 15:49:21,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 15:49:21,194 INFO L480 AbstractCegarLoop]: Abstraction has 229384 states and 256006 transitions. [2018-12-02 15:49:21,194 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 15:49:21,194 INFO L276 IsEmpty]: Start isEmpty. Operand 229384 states and 256006 transitions. [2018-12-02 15:49:21,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-12-02 15:49:21,297 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 15:49:21,297 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 15:49:21,297 INFO L423 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 15:49:21,297 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:49:21,298 INFO L82 PathProgramCache]: Analyzing trace with hash 1769620018, now seen corresponding path program 1 times [2018-12-02 15:49:21,298 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 15:49:21,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:49:21,298 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:49:21,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:49:21,298 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 15:49:21,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:49:21,308 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 15:49:21,308 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 15:49:21,308 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 15:49:21,308 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 15:49:21,309 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 15:49:21,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 15:49:21,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 15:49:21,309 INFO L87 Difference]: Start difference. First operand 229384 states and 256006 transitions. Second operand 3 states. [2018-12-02 15:49:24,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 15:49:24,222 INFO L93 Difference]: Finished difference Result 512008 states and 563206 transitions. [2018-12-02 15:49:24,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 15:49:24,223 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2018-12-02 15:49:24,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 15:49:24,223 INFO L225 Difference]: With dead ends: 512008 [2018-12-02 15:49:24,223 INFO L226 Difference]: Without dead ends: 0 [2018-12-02 15:49:24,405 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 15:49:24,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-02 15:49:24,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-02 15:49:24,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-02 15:49:24,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-02 15:49:24,406 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 35 [2018-12-02 15:49:24,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 15:49:24,406 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-02 15:49:24,406 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 15:49:24,406 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-02 15:49:24,406 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-02 15:49:24,411 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-02 15:49:24,438 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-12-02 15:49:24,438 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-12-02 15:49:24,439 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-12-02 15:49:24,439 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-12-02 15:49:24,439 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-12-02 15:49:24,439 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-12-02 15:49:24,439 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 4 205) no Hoare annotation was computed. [2018-12-02 15:49:24,439 INFO L448 ceAbstractionStarter]: For program point L151(line 151) no Hoare annotation was computed. [2018-12-02 15:49:24,439 INFO L448 ceAbstractionStarter]: For program point L85-1(lines 48 200) no Hoare annotation was computed. [2018-12-02 15:49:24,439 INFO L451 ceAbstractionStarter]: At program point L201(lines 5 205) the Hoare annotation is: true [2018-12-02 15:49:24,439 INFO L448 ceAbstractionStarter]: For program point L135-1(lines 48 200) no Hoare annotation was computed. [2018-12-02 15:49:24,439 INFO L448 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 203) no Hoare annotation was computed. [2018-12-02 15:49:24,439 INFO L448 ceAbstractionStarter]: For program point L185-1(lines 48 200) no Hoare annotation was computed. [2018-12-02 15:49:24,440 INFO L448 ceAbstractionStarter]: For program point L136(line 136) no Hoare annotation was computed. [2018-12-02 15:49:24,440 INFO L448 ceAbstractionStarter]: For program point L186(line 186) no Hoare annotation was computed. [2018-12-02 15:49:24,440 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 4 205) no Hoare annotation was computed. [2018-12-02 15:49:24,440 INFO L448 ceAbstractionStarter]: For program point L170-1(lines 48 200) no Hoare annotation was computed. [2018-12-02 15:49:24,440 INFO L448 ceAbstractionStarter]: For program point L121-1(lines 48 200) no Hoare annotation was computed. [2018-12-02 15:49:24,440 INFO L448 ceAbstractionStarter]: For program point L171(line 171) no Hoare annotation was computed. [2018-12-02 15:49:24,440 INFO L448 ceAbstractionStarter]: For program point L105-1(lines 48 200) no Hoare annotation was computed. [2018-12-02 15:49:24,440 INFO L448 ceAbstractionStarter]: For program point L155-1(lines 48 200) no Hoare annotation was computed. [2018-12-02 15:49:24,440 INFO L448 ceAbstractionStarter]: For program point L89-1(lines 48 200) no Hoare annotation was computed. [2018-12-02 15:49:24,440 INFO L448 ceAbstractionStarter]: For program point L156(line 156) no Hoare annotation was computed. [2018-12-02 15:49:24,440 INFO L448 ceAbstractionStarter]: For program point L140-1(lines 48 200) no Hoare annotation was computed. [2018-12-02 15:49:24,440 INFO L448 ceAbstractionStarter]: For program point L190-1(lines 48 200) no Hoare annotation was computed. [2018-12-02 15:49:24,440 INFO L448 ceAbstractionStarter]: For program point L141(line 141) no Hoare annotation was computed. [2018-12-02 15:49:24,441 INFO L448 ceAbstractionStarter]: For program point L191(line 191) no Hoare annotation was computed. [2018-12-02 15:49:24,441 INFO L448 ceAbstractionStarter]: For program point L125-1(lines 48 200) no Hoare annotation was computed. [2018-12-02 15:49:24,441 INFO L448 ceAbstractionStarter]: For program point L175-1(lines 48 200) no Hoare annotation was computed. [2018-12-02 15:49:24,441 INFO L448 ceAbstractionStarter]: For program point L109-1(lines 48 200) no Hoare annotation was computed. [2018-12-02 15:49:24,441 INFO L448 ceAbstractionStarter]: For program point L93-1(lines 48 200) no Hoare annotation was computed. [2018-12-02 15:49:24,441 INFO L448 ceAbstractionStarter]: For program point L176(line 176) no Hoare annotation was computed. [2018-12-02 15:49:24,441 INFO L448 ceAbstractionStarter]: For program point L160-1(lines 48 200) no Hoare annotation was computed. [2018-12-02 15:49:24,441 INFO L448 ceAbstractionStarter]: For program point L161(line 161) no Hoare annotation was computed. [2018-12-02 15:49:24,441 INFO L448 ceAbstractionStarter]: For program point L145-1(lines 48 200) no Hoare annotation was computed. [2018-12-02 15:49:24,441 INFO L451 ceAbstractionStarter]: At program point L195-1(lines 48 200) the Hoare annotation is: true [2018-12-02 15:49:24,441 INFO L448 ceAbstractionStarter]: For program point L129-1(lines 48 200) no Hoare annotation was computed. [2018-12-02 15:49:24,441 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 4 205) the Hoare annotation is: true [2018-12-02 15:49:24,441 INFO L448 ceAbstractionStarter]: For program point L146(line 146) no Hoare annotation was computed. [2018-12-02 15:49:24,442 INFO L448 ceAbstractionStarter]: For program point L113-1(lines 48 200) no Hoare annotation was computed. [2018-12-02 15:49:24,442 INFO L448 ceAbstractionStarter]: For program point L196(line 196) no Hoare annotation was computed. [2018-12-02 15:49:24,442 INFO L444 ceAbstractionStarter]: At program point L196-1(lines 5 205) the Hoare annotation is: false [2018-12-02 15:49:24,442 INFO L448 ceAbstractionStarter]: For program point L97-1(lines 48 200) no Hoare annotation was computed. [2018-12-02 15:49:24,442 INFO L448 ceAbstractionStarter]: For program point L180-1(lines 48 200) no Hoare annotation was computed. [2018-12-02 15:49:24,442 INFO L448 ceAbstractionStarter]: For program point L81(lines 81 83) no Hoare annotation was computed. [2018-12-02 15:49:24,442 INFO L448 ceAbstractionStarter]: For program point L81-2(lines 48 200) no Hoare annotation was computed. [2018-12-02 15:49:24,442 INFO L448 ceAbstractionStarter]: For program point L181(line 181) no Hoare annotation was computed. [2018-12-02 15:49:24,442 INFO L448 ceAbstractionStarter]: For program point L165-1(lines 48 200) no Hoare annotation was computed. [2018-12-02 15:49:24,442 INFO L448 ceAbstractionStarter]: For program point L50(lines 50 52) no Hoare annotation was computed. [2018-12-02 15:49:24,442 INFO L448 ceAbstractionStarter]: For program point L166(line 166) no Hoare annotation was computed. [2018-12-02 15:49:24,442 INFO L448 ceAbstractionStarter]: For program point L150-1(lines 48 200) no Hoare annotation was computed. [2018-12-02 15:49:24,443 INFO L448 ceAbstractionStarter]: For program point L117-1(lines 48 200) no Hoare annotation was computed. [2018-12-02 15:49:24,443 INFO L448 ceAbstractionStarter]: For program point L101-1(lines 48 200) no Hoare annotation was computed. [2018-12-02 15:49:24,449 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 03:49:24 BoogieIcfgContainer [2018-12-02 15:49:24,449 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-02 15:49:24,449 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-02 15:49:24,449 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-02 15:49:24,449 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-02 15:49:24,450 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 03:48:54" (3/4) ... [2018-12-02 15:49:24,453 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-02 15:49:24,460 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-12-02 15:49:24,460 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-12-02 15:49:24,466 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2018-12-02 15:49:24,466 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-12-02 15:49:24,466 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-12-02 15:49:24,503 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_9b0f295e-e803-4f34-a73b-9a854e8f46ab/bin-2019/utaipan/witness.graphml [2018-12-02 15:49:24,503 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-02 15:49:24,504 INFO L168 Benchmark]: Toolchain (without parser) took 30248.50 ms. Allocated memory was 1.0 GB in the beginning and 5.4 GB in the end (delta: 4.3 GB). Free memory was 957.8 MB in the beginning and 2.9 GB in the end (delta: -1.9 GB). Peak memory consumption was 2.4 GB. Max. memory is 11.5 GB. [2018-12-02 15:49:24,505 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 15:49:24,505 INFO L168 Benchmark]: CACSL2BoogieTranslator took 135.64 ms. Allocated memory is still 1.0 GB. Free memory was 957.8 MB in the beginning and 947.0 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-12-02 15:49:24,505 INFO L168 Benchmark]: Boogie Procedure Inliner took 11.95 ms. Allocated memory is still 1.0 GB. Free memory was 947.0 MB in the beginning and 941.7 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-12-02 15:49:24,505 INFO L168 Benchmark]: Boogie Preprocessor took 49.77 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 158.3 MB). Free memory was 941.7 MB in the beginning and 1.2 GB in the end (delta: -208.7 MB). Peak memory consumption was 13.1 MB. Max. memory is 11.5 GB. [2018-12-02 15:49:24,505 INFO L168 Benchmark]: RCFGBuilder took 195.15 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 24.4 MB). Peak memory consumption was 24.4 MB. Max. memory is 11.5 GB. [2018-12-02 15:49:24,506 INFO L168 Benchmark]: TraceAbstraction took 29799.20 ms. Allocated memory was 1.2 GB in the beginning and 5.4 GB in the end (delta: 4.2 GB). Free memory was 1.1 GB in the beginning and 2.9 GB in the end (delta: -1.8 GB). Peak memory consumption was 2.4 GB. Max. memory is 11.5 GB. [2018-12-02 15:49:24,506 INFO L168 Benchmark]: Witness Printer took 54.01 ms. Allocated memory is still 5.4 GB. Free memory was 2.9 GB in the beginning and 2.9 GB in the end (delta: 24 B). Peak memory consumption was 24 B. Max. memory is 11.5 GB. [2018-12-02 15:49:24,507 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.14 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 135.64 ms. Allocated memory is still 1.0 GB. Free memory was 957.8 MB in the beginning and 947.0 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 11.95 ms. Allocated memory is still 1.0 GB. Free memory was 947.0 MB in the beginning and 941.7 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 49.77 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 158.3 MB). Free memory was 941.7 MB in the beginning and 1.2 GB in the end (delta: -208.7 MB). Peak memory consumption was 13.1 MB. Max. memory is 11.5 GB. * RCFGBuilder took 195.15 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 24.4 MB). Peak memory consumption was 24.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 29799.20 ms. Allocated memory was 1.2 GB in the beginning and 5.4 GB in the end (delta: 4.2 GB). Free memory was 1.1 GB in the beginning and 2.9 GB in the end (delta: -1.8 GB). Peak memory consumption was 2.4 GB. Max. memory is 11.5 GB. * Witness Printer took 54.01 ms. Allocated memory is still 5.4 GB. Free memory was 2.9 GB in the beginning and 2.9 GB in the end (delta: 24 B). Peak memory consumption was 24 B. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 203]: 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: 48]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 53 locations, 1 error locations. SAFE Result, 29.7s OverallTime, 37 OverallIterations, 1 TraceHistogramMax, 14.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 4001 SDtfs, 1984 SDslu, 2752 SDs, 0 SdLazy, 197 SolverSat, 37 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 111 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=229384occurred in iteration=36, 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: 14.3s AutomataMinimizationTime, 37 MinimizatonAttempts, 32808 StatesRemovedByMinimization, 36 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 8202 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.4s InterpolantComputationTime, 1077 NumberOfCodeBlocks, 1077 NumberOfCodeBlocksAsserted, 37 NumberOfCheckSat, 1040 ConstructedInterpolants, 0 QuantifiedInterpolants, 61562 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 37 InterpolantComputations, 37 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...