./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_cf1fcc48-056f-424d-841f-6e532fd20f23/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_cf1fcc48-056f-424d-841f-6e532fd20f23/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_cf1fcc48-056f-424d-841f-6e532fd20f23/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_cf1fcc48-056f-424d-841f-6e532fd20f23/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_cf1fcc48-056f-424d-841f-6e532fd20f23/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_cf1fcc48-056f-424d-841f-6e532fd20f23/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-08 23:59:27,392 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-08 23:59:27,393 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-08 23:59:27,399 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-08 23:59:27,399 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-08 23:59:27,400 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-08 23:59:27,401 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-08 23:59:27,401 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-08 23:59:27,402 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-08 23:59:27,403 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-08 23:59:27,403 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-08 23:59:27,403 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-08 23:59:27,404 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-08 23:59:27,404 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-08 23:59:27,405 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-08 23:59:27,405 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-08 23:59:27,406 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-08 23:59:27,407 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-08 23:59:27,408 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-08 23:59:27,409 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-08 23:59:27,409 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-08 23:59:27,410 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-08 23:59:27,411 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-08 23:59:27,411 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-08 23:59:27,411 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-08 23:59:27,412 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-08 23:59:27,412 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-08 23:59:27,413 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-08 23:59:27,413 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-08 23:59:27,414 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-08 23:59:27,414 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-08 23:59:27,414 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-08 23:59:27,414 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-08 23:59:27,415 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-08 23:59:27,415 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-08 23:59:27,415 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-08 23:59:27,416 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_cf1fcc48-056f-424d-841f-6e532fd20f23/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-08 23:59:27,423 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-08 23:59:27,423 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-08 23:59:27,423 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-08 23:59:27,424 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-08 23:59:27,424 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-08 23:59:27,424 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-08 23:59:27,424 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-08 23:59:27,424 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-08 23:59:27,424 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-08 23:59:27,424 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-08 23:59:27,424 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-08 23:59:27,425 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-08 23:59:27,425 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-08 23:59:27,425 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-08 23:59:27,425 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-08 23:59:27,425 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-08 23:59:27,425 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-08 23:59:27,426 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-08 23:59:27,426 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-08 23:59:27,426 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-08 23:59:27,426 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-08 23:59:27,426 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-08 23:59:27,426 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-08 23:59:27,426 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-08 23:59:27,426 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-08 23:59:27,427 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-08 23:59:27,427 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-08 23:59:27,427 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-08 23:59:27,427 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-08 23:59:27,427 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-08 23:59:27,427 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-08 23:59:27,427 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-08 23:59:27,427 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-08 23:59:27,428 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-08 23:59:27,428 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-08 23:59:27,428 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-08 23:59:27,428 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_cf1fcc48-056f-424d-841f-6e532fd20f23/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-08 23:59:27,445 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-08 23:59:27,452 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-08 23:59:27,454 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-08 23:59:27,455 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-08 23:59:27,455 INFO L276 PluginConnector]: CDTParser initialized [2018-12-08 23:59:27,455 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_cf1fcc48-056f-424d-841f-6e532fd20f23/bin-2019/utaipan/../../sv-benchmarks/c/locks/test_locks_13_true-unreach-call_true-valid-memsafety_false-termination.c [2018-12-08 23:59:27,491 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_cf1fcc48-056f-424d-841f-6e532fd20f23/bin-2019/utaipan/data/dc9e42f50/97e4a51d9192465e9375c1093dae8458/FLAGffdd96bea [2018-12-08 23:59:27,925 INFO L307 CDTParser]: Found 1 translation units. [2018-12-08 23:59:27,925 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_cf1fcc48-056f-424d-841f-6e532fd20f23/sv-benchmarks/c/locks/test_locks_13_true-unreach-call_true-valid-memsafety_false-termination.c [2018-12-08 23:59:27,929 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_cf1fcc48-056f-424d-841f-6e532fd20f23/bin-2019/utaipan/data/dc9e42f50/97e4a51d9192465e9375c1093dae8458/FLAGffdd96bea [2018-12-08 23:59:27,937 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_cf1fcc48-056f-424d-841f-6e532fd20f23/bin-2019/utaipan/data/dc9e42f50/97e4a51d9192465e9375c1093dae8458 [2018-12-08 23:59:27,938 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-08 23:59:27,939 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-08 23:59:27,940 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-08 23:59:27,940 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-08 23:59:27,942 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-08 23:59:27,942 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 11:59:27" (1/1) ... [2018-12-08 23:59:27,944 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2caf47c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 11:59:27, skipping insertion in model container [2018-12-08 23:59:27,944 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 11:59:27" (1/1) ... [2018-12-08 23:59:27,948 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-08 23:59:27,959 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-08 23:59:28,049 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 23:59:28,052 INFO L191 MainTranslator]: Completed pre-run [2018-12-08 23:59:28,068 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 23:59:28,076 INFO L195 MainTranslator]: Completed translation [2018-12-08 23:59:28,076 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 11:59:28 WrapperNode [2018-12-08 23:59:28,076 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-08 23:59:28,077 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-08 23:59:28,077 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-08 23:59:28,077 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-08 23:59:28,082 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 11:59:28" (1/1) ... [2018-12-08 23:59:28,086 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 11:59:28" (1/1) ... [2018-12-08 23:59:28,089 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-08 23:59:28,089 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-08 23:59:28,090 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-08 23:59:28,090 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-08 23:59:28,124 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 11:59:28" (1/1) ... [2018-12-08 23:59:28,124 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 11:59:28" (1/1) ... [2018-12-08 23:59:28,125 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 11:59:28" (1/1) ... [2018-12-08 23:59:28,125 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 11:59:28" (1/1) ... [2018-12-08 23:59:28,129 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 11:59:28" (1/1) ... [2018-12-08 23:59:28,134 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 11:59:28" (1/1) ... [2018-12-08 23:59:28,135 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 11:59:28" (1/1) ... [2018-12-08 23:59:28,136 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-08 23:59:28,136 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-08 23:59:28,136 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-08 23:59:28,136 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-08 23:59:28,137 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 11:59:28" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_cf1fcc48-056f-424d-841f-6e532fd20f23/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-08 23:59:28,169 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-08 23:59:28,170 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-08 23:59:28,170 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-08 23:59:28,170 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-08 23:59:28,170 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-08 23:59:28,170 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-08 23:59:28,318 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-08 23:59:28,318 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-08 23:59:28,318 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 11:59:28 BoogieIcfgContainer [2018-12-08 23:59:28,318 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-08 23:59:28,319 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-08 23:59:28,319 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-08 23:59:28,321 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-08 23:59:28,321 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.12 11:59:27" (1/3) ... [2018-12-08 23:59:28,321 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2af48ab0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.12 11:59:28, skipping insertion in model container [2018-12-08 23:59:28,321 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 11:59:28" (2/3) ... [2018-12-08 23:59:28,322 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2af48ab0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.12 11:59:28, skipping insertion in model container [2018-12-08 23:59:28,322 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 11:59:28" (3/3) ... [2018-12-08 23:59:28,323 INFO L112 eAbstractionObserver]: Analyzing ICFG test_locks_13_true-unreach-call_true-valid-memsafety_false-termination.c [2018-12-08 23:59:28,329 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-08 23:59:28,333 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-08 23:59:28,343 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-08 23:59:28,363 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-08 23:59:28,363 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-08 23:59:28,363 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-08 23:59:28,364 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-08 23:59:28,364 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-08 23:59:28,364 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-08 23:59:28,364 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-08 23:59:28,364 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-08 23:59:28,375 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states. [2018-12-08 23:59:28,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-08 23:59:28,378 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 23:59:28,379 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-08 23:59:28,380 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 23:59:28,384 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 23:59:28,384 INFO L82 PathProgramCache]: Analyzing trace with hash 2062980600, now seen corresponding path program 1 times [2018-12-08 23:59:28,385 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 23:59:28,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 23:59:28,413 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 23:59:28,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 23:59:28,414 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 23:59:28,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 23:59:28,491 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-08 23:59:28,493 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 23:59:28,493 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 23:59:28,493 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 23:59:28,497 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 23:59:28,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 23:59:28,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 23:59:28,509 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 3 states. [2018-12-08 23:59:28,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 23:59:28,539 INFO L93 Difference]: Finished difference Result 105 states and 186 transitions. [2018-12-08 23:59:28,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 23:59:28,540 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-12-08 23:59:28,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 23:59:28,546 INFO L225 Difference]: With dead ends: 105 [2018-12-08 23:59:28,546 INFO L226 Difference]: Without dead ends: 90 [2018-12-08 23:59:28,548 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-08 23:59:28,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-12-08 23:59:28,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 62. [2018-12-08 23:59:28,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-12-08 23:59:28,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 113 transitions. [2018-12-08 23:59:28,572 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 113 transitions. Word has length 23 [2018-12-08 23:59:28,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 23:59:28,572 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 113 transitions. [2018-12-08 23:59:28,572 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 23:59:28,573 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 113 transitions. [2018-12-08 23:59:28,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-08 23:59:28,573 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 23:59:28,573 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-08 23:59:28,573 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 23:59:28,573 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 23:59:28,574 INFO L82 PathProgramCache]: Analyzing trace with hash 1041912246, now seen corresponding path program 1 times [2018-12-08 23:59:28,574 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 23:59:28,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 23:59:28,574 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 23:59:28,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 23:59:28,574 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 23:59:28,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 23:59:28,613 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-08 23:59:28,613 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 23:59:28,614 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 23:59:28,614 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 23:59:28,615 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 23:59:28,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 23:59:28,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 23:59:28,615 INFO L87 Difference]: Start difference. First operand 62 states and 113 transitions. Second operand 3 states. [2018-12-08 23:59:28,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 23:59:28,637 INFO L93 Difference]: Finished difference Result 147 states and 272 transitions. [2018-12-08 23:59:28,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 23:59:28,638 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-12-08 23:59:28,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 23:59:28,639 INFO L225 Difference]: With dead ends: 147 [2018-12-08 23:59:28,639 INFO L226 Difference]: Without dead ends: 90 [2018-12-08 23:59:28,640 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-08 23:59:28,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-12-08 23:59:28,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 88. [2018-12-08 23:59:28,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-12-08 23:59:28,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 161 transitions. [2018-12-08 23:59:28,648 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 161 transitions. Word has length 23 [2018-12-08 23:59:28,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 23:59:28,649 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 161 transitions. [2018-12-08 23:59:28,649 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 23:59:28,649 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 161 transitions. [2018-12-08 23:59:28,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-08 23:59:28,649 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 23:59:28,650 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-08 23:59:28,650 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 23:59:28,650 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 23:59:28,650 INFO L82 PathProgramCache]: Analyzing trace with hash -471898432, now seen corresponding path program 1 times [2018-12-08 23:59:28,650 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 23:59:28,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 23:59:28,651 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 23:59:28,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 23:59:28,651 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 23:59:28,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 23:59:28,683 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-08 23:59:28,683 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 23:59:28,683 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 23:59:28,683 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 23:59:28,684 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 23:59:28,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 23:59:28,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 23:59:28,684 INFO L87 Difference]: Start difference. First operand 88 states and 161 transitions. Second operand 3 states. [2018-12-08 23:59:28,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 23:59:28,699 INFO L93 Difference]: Finished difference Result 135 states and 243 transitions. [2018-12-08 23:59:28,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 23:59:28,699 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-12-08 23:59:28,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 23:59:28,700 INFO L225 Difference]: With dead ends: 135 [2018-12-08 23:59:28,700 INFO L226 Difference]: Without dead ends: 93 [2018-12-08 23:59:28,700 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-08 23:59:28,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-12-08 23:59:28,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 91. [2018-12-08 23:59:28,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-12-08 23:59:28,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 163 transitions. [2018-12-08 23:59:28,706 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 163 transitions. Word has length 24 [2018-12-08 23:59:28,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 23:59:28,706 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 163 transitions. [2018-12-08 23:59:28,706 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 23:59:28,706 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 163 transitions. [2018-12-08 23:59:28,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-08 23:59:28,707 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 23:59:28,707 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-08 23:59:28,707 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 23:59:28,707 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 23:59:28,707 INFO L82 PathProgramCache]: Analyzing trace with hash -2060246334, now seen corresponding path program 1 times [2018-12-08 23:59:28,707 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 23:59:28,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 23:59:28,708 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 23:59:28,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 23:59:28,708 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 23:59:28,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 23:59:28,737 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-08 23:59:28,737 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 23:59:28,737 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 23:59:28,737 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 23:59:28,738 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 23:59:28,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 23:59:28,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 23:59:28,738 INFO L87 Difference]: Start difference. First operand 91 states and 163 transitions. Second operand 3 states. [2018-12-08 23:59:28,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 23:59:28,754 INFO L93 Difference]: Finished difference Result 172 states and 312 transitions. [2018-12-08 23:59:28,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 23:59:28,754 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-12-08 23:59:28,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 23:59:28,755 INFO L225 Difference]: With dead ends: 172 [2018-12-08 23:59:28,756 INFO L226 Difference]: Without dead ends: 170 [2018-12-08 23:59:28,756 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-08 23:59:28,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2018-12-08 23:59:28,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 120. [2018-12-08 23:59:28,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-12-08 23:59:28,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 216 transitions. [2018-12-08 23:59:28,761 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 216 transitions. Word has length 24 [2018-12-08 23:59:28,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 23:59:28,761 INFO L480 AbstractCegarLoop]: Abstraction has 120 states and 216 transitions. [2018-12-08 23:59:28,761 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 23:59:28,762 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 216 transitions. [2018-12-08 23:59:28,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-08 23:59:28,762 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 23:59:28,762 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-08 23:59:28,762 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 23:59:28,762 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 23:59:28,762 INFO L82 PathProgramCache]: Analyzing trace with hash 1213652608, now seen corresponding path program 1 times [2018-12-08 23:59:28,762 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 23:59:28,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 23:59:28,763 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 23:59:28,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 23:59:28,763 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 23:59:28,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 23:59:28,784 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 23:59:28,784 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 23:59:28,784 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 23:59:28,784 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 23:59:28,784 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 23:59:28,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 23:59:28,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 23:59:28,785 INFO L87 Difference]: Start difference. First operand 120 states and 216 transitions. Second operand 3 states. [2018-12-08 23:59:28,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 23:59:28,794 INFO L93 Difference]: Finished difference Result 284 states and 518 transitions. [2018-12-08 23:59:28,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 23:59:28,794 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-12-08 23:59:28,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 23:59:28,795 INFO L225 Difference]: With dead ends: 284 [2018-12-08 23:59:28,795 INFO L226 Difference]: Without dead ends: 172 [2018-12-08 23:59:28,796 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-08 23:59:28,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2018-12-08 23:59:28,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 170. [2018-12-08 23:59:28,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2018-12-08 23:59:28,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 306 transitions. [2018-12-08 23:59:28,801 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 306 transitions. Word has length 24 [2018-12-08 23:59:28,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 23:59:28,801 INFO L480 AbstractCegarLoop]: Abstraction has 170 states and 306 transitions. [2018-12-08 23:59:28,801 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 23:59:28,802 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 306 transitions. [2018-12-08 23:59:28,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-08 23:59:28,802 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 23:59:28,802 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-08 23:59:28,802 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 23:59:28,802 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 23:59:28,802 INFO L82 PathProgramCache]: Analyzing trace with hash 557085835, now seen corresponding path program 1 times [2018-12-08 23:59:28,802 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 23:59:28,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 23:59:28,803 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 23:59:28,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 23:59:28,803 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 23:59:28,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 23:59:28,831 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 23:59:28,831 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 23:59:28,831 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 23:59:28,831 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 23:59:28,831 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 23:59:28,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 23:59:28,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 23:59:28,832 INFO L87 Difference]: Start difference. First operand 170 states and 306 transitions. Second operand 3 states. [2018-12-08 23:59:28,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 23:59:28,845 INFO L93 Difference]: Finished difference Result 255 states and 457 transitions. [2018-12-08 23:59:28,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 23:59:28,846 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-12-08 23:59:28,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 23:59:28,847 INFO L225 Difference]: With dead ends: 255 [2018-12-08 23:59:28,847 INFO L226 Difference]: Without dead ends: 174 [2018-12-08 23:59:28,848 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-08 23:59:28,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2018-12-08 23:59:28,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 172. [2018-12-08 23:59:28,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2018-12-08 23:59:28,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 306 transitions. [2018-12-08 23:59:28,856 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 306 transitions. Word has length 25 [2018-12-08 23:59:28,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 23:59:28,856 INFO L480 AbstractCegarLoop]: Abstraction has 172 states and 306 transitions. [2018-12-08 23:59:28,856 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 23:59:28,856 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 306 transitions. [2018-12-08 23:59:28,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-08 23:59:28,857 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 23:59:28,857 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-08 23:59:28,858 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 23:59:28,858 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 23:59:28,858 INFO L82 PathProgramCache]: Analyzing trace with hash -1031262067, now seen corresponding path program 1 times [2018-12-08 23:59:28,858 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 23:59:28,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 23:59:28,859 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 23:59:28,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 23:59:28,859 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 23:59:28,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 23:59:28,884 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-08 23:59:28,884 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 23:59:28,884 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 23:59:28,884 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 23:59:28,884 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 23:59:28,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 23:59:28,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 23:59:28,885 INFO L87 Difference]: Start difference. First operand 172 states and 306 transitions. Second operand 3 states. [2018-12-08 23:59:28,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 23:59:28,897 INFO L93 Difference]: Finished difference Result 324 states and 584 transitions. [2018-12-08 23:59:28,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 23:59:28,897 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-12-08 23:59:28,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 23:59:28,898 INFO L225 Difference]: With dead ends: 324 [2018-12-08 23:59:28,899 INFO L226 Difference]: Without dead ends: 322 [2018-12-08 23:59:28,899 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-08 23:59:28,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2018-12-08 23:59:28,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 232. [2018-12-08 23:59:28,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2018-12-08 23:59:28,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 410 transitions. [2018-12-08 23:59:28,909 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 410 transitions. Word has length 25 [2018-12-08 23:59:28,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 23:59:28,909 INFO L480 AbstractCegarLoop]: Abstraction has 232 states and 410 transitions. [2018-12-08 23:59:28,909 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 23:59:28,909 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 410 transitions. [2018-12-08 23:59:28,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-08 23:59:28,910 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 23:59:28,911 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-08 23:59:28,911 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 23:59:28,911 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 23:59:28,911 INFO L82 PathProgramCache]: Analyzing trace with hash -2052330421, now seen corresponding path program 1 times [2018-12-08 23:59:28,911 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 23:59:28,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 23:59:28,912 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 23:59:28,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 23:59:28,912 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 23:59:28,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 23:59:28,927 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-08 23:59:28,927 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 23:59:28,927 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 23:59:28,927 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 23:59:28,928 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 23:59:28,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 23:59:28,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 23:59:28,928 INFO L87 Difference]: Start difference. First operand 232 states and 410 transitions. Second operand 3 states. [2018-12-08 23:59:28,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 23:59:28,945 INFO L93 Difference]: Finished difference Result 552 states and 984 transitions. [2018-12-08 23:59:28,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 23:59:28,946 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-12-08 23:59:28,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 23:59:28,947 INFO L225 Difference]: With dead ends: 552 [2018-12-08 23:59:28,947 INFO L226 Difference]: Without dead ends: 330 [2018-12-08 23:59:28,948 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-08 23:59:28,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2018-12-08 23:59:28,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 328. [2018-12-08 23:59:28,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 328 states. [2018-12-08 23:59:28,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 578 transitions. [2018-12-08 23:59:28,958 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 578 transitions. Word has length 25 [2018-12-08 23:59:28,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 23:59:28,958 INFO L480 AbstractCegarLoop]: Abstraction has 328 states and 578 transitions. [2018-12-08 23:59:28,958 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 23:59:28,959 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 578 transitions. [2018-12-08 23:59:28,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-08 23:59:28,959 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 23:59:28,960 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-08 23:59:28,960 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 23:59:28,960 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 23:59:28,960 INFO L82 PathProgramCache]: Analyzing trace with hash -1904139915, now seen corresponding path program 1 times [2018-12-08 23:59:28,960 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 23:59:28,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 23:59:28,961 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 23:59:28,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 23:59:28,961 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 23:59:28,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 23:59:28,980 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-08 23:59:28,980 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 23:59:28,981 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 23:59:28,981 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 23:59:28,981 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 23:59:28,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 23:59:28,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 23:59:28,981 INFO L87 Difference]: Start difference. First operand 328 states and 578 transitions. Second operand 3 states. [2018-12-08 23:59:28,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 23:59:28,996 INFO L93 Difference]: Finished difference Result 492 states and 864 transitions. [2018-12-08 23:59:28,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 23:59:28,996 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-12-08 23:59:28,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 23:59:28,998 INFO L225 Difference]: With dead ends: 492 [2018-12-08 23:59:28,998 INFO L226 Difference]: Without dead ends: 334 [2018-12-08 23:59:28,998 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-08 23:59:28,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2018-12-08 23:59:29,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 332. [2018-12-08 23:59:29,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 332 states. [2018-12-08 23:59:29,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 578 transitions. [2018-12-08 23:59:29,007 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 578 transitions. Word has length 26 [2018-12-08 23:59:29,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 23:59:29,007 INFO L480 AbstractCegarLoop]: Abstraction has 332 states and 578 transitions. [2018-12-08 23:59:29,007 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 23:59:29,007 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 578 transitions. [2018-12-08 23:59:29,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-08 23:59:29,008 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 23:59:29,008 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-08 23:59:29,008 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 23:59:29,008 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 23:59:29,008 INFO L82 PathProgramCache]: Analyzing trace with hash 802479479, now seen corresponding path program 1 times [2018-12-08 23:59:29,008 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 23:59:29,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 23:59:29,009 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 23:59:29,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 23:59:29,009 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 23:59:29,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 23:59:29,023 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-08 23:59:29,023 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 23:59:29,023 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 23:59:29,023 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 23:59:29,024 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 23:59:29,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 23:59:29,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 23:59:29,024 INFO L87 Difference]: Start difference. First operand 332 states and 578 transitions. Second operand 3 states. [2018-12-08 23:59:29,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 23:59:29,039 INFO L93 Difference]: Finished difference Result 620 states and 1096 transitions. [2018-12-08 23:59:29,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 23:59:29,040 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-12-08 23:59:29,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 23:59:29,042 INFO L225 Difference]: With dead ends: 620 [2018-12-08 23:59:29,042 INFO L226 Difference]: Without dead ends: 618 [2018-12-08 23:59:29,042 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-08 23:59:29,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states. [2018-12-08 23:59:29,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 456. [2018-12-08 23:59:29,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 456 states. [2018-12-08 23:59:29,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 456 states and 782 transitions. [2018-12-08 23:59:29,057 INFO L78 Accepts]: Start accepts. Automaton has 456 states and 782 transitions. Word has length 26 [2018-12-08 23:59:29,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 23:59:29,057 INFO L480 AbstractCegarLoop]: Abstraction has 456 states and 782 transitions. [2018-12-08 23:59:29,057 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 23:59:29,057 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 782 transitions. [2018-12-08 23:59:29,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-08 23:59:29,058 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 23:59:29,058 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-08 23:59:29,058 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 23:59:29,059 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 23:59:29,059 INFO L82 PathProgramCache]: Analyzing trace with hash -218588875, now seen corresponding path program 1 times [2018-12-08 23:59:29,059 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 23:59:29,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 23:59:29,060 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 23:59:29,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 23:59:29,060 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 23:59:29,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 23:59:29,076 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 23:59:29,076 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 23:59:29,077 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 23:59:29,077 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 23:59:29,077 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 23:59:29,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 23:59:29,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 23:59:29,078 INFO L87 Difference]: Start difference. First operand 456 states and 782 transitions. Second operand 3 states. [2018-12-08 23:59:29,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 23:59:29,100 INFO L93 Difference]: Finished difference Result 1084 states and 1872 transitions. [2018-12-08 23:59:29,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 23:59:29,100 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-12-08 23:59:29,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 23:59:29,102 INFO L225 Difference]: With dead ends: 1084 [2018-12-08 23:59:29,102 INFO L226 Difference]: Without dead ends: 642 [2018-12-08 23:59:29,103 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-08 23:59:29,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 642 states. [2018-12-08 23:59:29,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 642 to 640. [2018-12-08 23:59:29,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 640 states. [2018-12-08 23:59:29,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 640 states to 640 states and 1094 transitions. [2018-12-08 23:59:29,121 INFO L78 Accepts]: Start accepts. Automaton has 640 states and 1094 transitions. Word has length 26 [2018-12-08 23:59:29,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 23:59:29,122 INFO L480 AbstractCegarLoop]: Abstraction has 640 states and 1094 transitions. [2018-12-08 23:59:29,122 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 23:59:29,122 INFO L276 IsEmpty]: Start isEmpty. Operand 640 states and 1094 transitions. [2018-12-08 23:59:29,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-08 23:59:29,123 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 23:59:29,123 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-08 23:59:29,123 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 23:59:29,123 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 23:59:29,124 INFO L82 PathProgramCache]: Analyzing trace with hash -892726496, now seen corresponding path program 1 times [2018-12-08 23:59:29,124 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 23:59:29,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 23:59:29,125 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 23:59:29,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 23:59:29,125 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 23:59:29,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 23:59:29,144 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 23:59:29,144 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 23:59:29,144 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 23:59:29,144 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 23:59:29,145 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 23:59:29,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 23:59:29,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 23:59:29,145 INFO L87 Difference]: Start difference. First operand 640 states and 1094 transitions. Second operand 3 states. [2018-12-08 23:59:29,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 23:59:29,167 INFO L93 Difference]: Finished difference Result 960 states and 1636 transitions. [2018-12-08 23:59:29,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 23:59:29,167 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-12-08 23:59:29,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 23:59:29,169 INFO L225 Difference]: With dead ends: 960 [2018-12-08 23:59:29,170 INFO L226 Difference]: Without dead ends: 650 [2018-12-08 23:59:29,170 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-08 23:59:29,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 650 states. [2018-12-08 23:59:29,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 650 to 648. [2018-12-08 23:59:29,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 648 states. [2018-12-08 23:59:29,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 648 states to 648 states and 1094 transitions. [2018-12-08 23:59:29,188 INFO L78 Accepts]: Start accepts. Automaton has 648 states and 1094 transitions. Word has length 27 [2018-12-08 23:59:29,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 23:59:29,189 INFO L480 AbstractCegarLoop]: Abstraction has 648 states and 1094 transitions. [2018-12-08 23:59:29,189 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 23:59:29,189 INFO L276 IsEmpty]: Start isEmpty. Operand 648 states and 1094 transitions. [2018-12-08 23:59:29,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-08 23:59:29,190 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 23:59:29,190 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-08 23:59:29,190 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 23:59:29,190 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 23:59:29,190 INFO L82 PathProgramCache]: Analyzing trace with hash 1813892898, now seen corresponding path program 1 times [2018-12-08 23:59:29,191 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 23:59:29,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 23:59:29,191 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 23:59:29,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 23:59:29,191 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 23:59:29,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 23:59:29,208 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-08 23:59:29,209 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 23:59:29,209 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 23:59:29,209 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 23:59:29,209 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 23:59:29,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 23:59:29,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 23:59:29,210 INFO L87 Difference]: Start difference. First operand 648 states and 1094 transitions. Second operand 3 states. [2018-12-08 23:59:29,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 23:59:29,232 INFO L93 Difference]: Finished difference Result 1196 states and 2056 transitions. [2018-12-08 23:59:29,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 23:59:29,232 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-12-08 23:59:29,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 23:59:29,236 INFO L225 Difference]: With dead ends: 1196 [2018-12-08 23:59:29,236 INFO L226 Difference]: Without dead ends: 1194 [2018-12-08 23:59:29,236 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-08 23:59:29,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1194 states. [2018-12-08 23:59:29,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1194 to 904. [2018-12-08 23:59:29,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 904 states. [2018-12-08 23:59:29,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 904 states to 904 states and 1494 transitions. [2018-12-08 23:59:29,256 INFO L78 Accepts]: Start accepts. Automaton has 904 states and 1494 transitions. Word has length 27 [2018-12-08 23:59:29,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 23:59:29,256 INFO L480 AbstractCegarLoop]: Abstraction has 904 states and 1494 transitions. [2018-12-08 23:59:29,256 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 23:59:29,256 INFO L276 IsEmpty]: Start isEmpty. Operand 904 states and 1494 transitions. [2018-12-08 23:59:29,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-08 23:59:29,257 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 23:59:29,257 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-08 23:59:29,258 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 23:59:29,258 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 23:59:29,258 INFO L82 PathProgramCache]: Analyzing trace with hash 792824544, now seen corresponding path program 1 times [2018-12-08 23:59:29,258 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 23:59:29,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 23:59:29,259 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 23:59:29,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 23:59:29,259 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 23:59:29,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 23:59:29,271 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-08 23:59:29,272 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 23:59:29,272 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 23:59:29,272 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 23:59:29,272 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 23:59:29,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 23:59:29,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 23:59:29,273 INFO L87 Difference]: Start difference. First operand 904 states and 1494 transitions. Second operand 3 states. [2018-12-08 23:59:29,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 23:59:29,305 INFO L93 Difference]: Finished difference Result 2140 states and 3560 transitions. [2018-12-08 23:59:29,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 23:59:29,306 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-12-08 23:59:29,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 23:59:29,309 INFO L225 Difference]: With dead ends: 2140 [2018-12-08 23:59:29,309 INFO L226 Difference]: Without dead ends: 1258 [2018-12-08 23:59:29,311 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 23:59:29,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1258 states. [2018-12-08 23:59:29,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1258 to 1256. [2018-12-08 23:59:29,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1256 states. [2018-12-08 23:59:29,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1256 states to 1256 states and 2070 transitions. [2018-12-08 23:59:29,342 INFO L78 Accepts]: Start accepts. Automaton has 1256 states and 2070 transitions. Word has length 27 [2018-12-08 23:59:29,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 23:59:29,342 INFO L480 AbstractCegarLoop]: Abstraction has 1256 states and 2070 transitions. [2018-12-08 23:59:29,342 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 23:59:29,342 INFO L276 IsEmpty]: Start isEmpty. Operand 1256 states and 2070 transitions. [2018-12-08 23:59:29,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-08 23:59:29,343 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 23:59:29,343 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-08 23:59:29,344 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 23:59:29,344 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 23:59:29,344 INFO L82 PathProgramCache]: Analyzing trace with hash 396318762, now seen corresponding path program 1 times [2018-12-08 23:59:29,344 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 23:59:29,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 23:59:29,345 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 23:59:29,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 23:59:29,345 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 23:59:29,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 23:59:29,356 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-08 23:59:29,356 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 23:59:29,356 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 23:59:29,356 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 23:59:29,356 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 23:59:29,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 23:59:29,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 23:59:29,357 INFO L87 Difference]: Start difference. First operand 1256 states and 2070 transitions. Second operand 3 states. [2018-12-08 23:59:29,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 23:59:29,384 INFO L93 Difference]: Finished difference Result 1884 states and 3096 transitions. [2018-12-08 23:59:29,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 23:59:29,384 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-12-08 23:59:29,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 23:59:29,388 INFO L225 Difference]: With dead ends: 1884 [2018-12-08 23:59:29,388 INFO L226 Difference]: Without dead ends: 1274 [2018-12-08 23:59:29,389 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-08 23:59:29,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1274 states. [2018-12-08 23:59:29,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1274 to 1272. [2018-12-08 23:59:29,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1272 states. [2018-12-08 23:59:29,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1272 states to 1272 states and 2070 transitions. [2018-12-08 23:59:29,417 INFO L78 Accepts]: Start accepts. Automaton has 1272 states and 2070 transitions. Word has length 28 [2018-12-08 23:59:29,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 23:59:29,417 INFO L480 AbstractCegarLoop]: Abstraction has 1272 states and 2070 transitions. [2018-12-08 23:59:29,417 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 23:59:29,417 INFO L276 IsEmpty]: Start isEmpty. Operand 1272 states and 2070 transitions. [2018-12-08 23:59:29,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-08 23:59:29,418 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 23:59:29,419 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-08 23:59:29,419 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 23:59:29,419 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 23:59:29,419 INFO L82 PathProgramCache]: Analyzing trace with hash -1192029140, now seen corresponding path program 1 times [2018-12-08 23:59:29,419 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 23:59:29,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 23:59:29,420 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 23:59:29,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 23:59:29,420 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 23:59:29,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 23:59:29,431 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-08 23:59:29,431 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 23:59:29,431 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 23:59:29,431 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 23:59:29,432 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 23:59:29,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 23:59:29,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 23:59:29,432 INFO L87 Difference]: Start difference. First operand 1272 states and 2070 transitions. Second operand 3 states. [2018-12-08 23:59:29,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 23:59:29,466 INFO L93 Difference]: Finished difference Result 2316 states and 3848 transitions. [2018-12-08 23:59:29,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 23:59:29,467 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-12-08 23:59:29,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 23:59:29,470 INFO L225 Difference]: With dead ends: 2316 [2018-12-08 23:59:29,470 INFO L226 Difference]: Without dead ends: 2314 [2018-12-08 23:59:29,471 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-08 23:59:29,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2314 states. [2018-12-08 23:59:29,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2314 to 1800. [2018-12-08 23:59:29,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1800 states. [2018-12-08 23:59:29,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1800 states to 1800 states and 2854 transitions. [2018-12-08 23:59:29,499 INFO L78 Accepts]: Start accepts. Automaton has 1800 states and 2854 transitions. Word has length 28 [2018-12-08 23:59:29,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 23:59:29,499 INFO L480 AbstractCegarLoop]: Abstraction has 1800 states and 2854 transitions. [2018-12-08 23:59:29,499 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 23:59:29,499 INFO L276 IsEmpty]: Start isEmpty. Operand 1800 states and 2854 transitions. [2018-12-08 23:59:29,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-08 23:59:29,501 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 23:59:29,501 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-08 23:59:29,501 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 23:59:29,501 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 23:59:29,501 INFO L82 PathProgramCache]: Analyzing trace with hash 2081869802, now seen corresponding path program 1 times [2018-12-08 23:59:29,501 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 23:59:29,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 23:59:29,502 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 23:59:29,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 23:59:29,502 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 23:59:29,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 23:59:29,510 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-08 23:59:29,511 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 23:59:29,511 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 23:59:29,511 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 23:59:29,511 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 23:59:29,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 23:59:29,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 23:59:29,511 INFO L87 Difference]: Start difference. First operand 1800 states and 2854 transitions. Second operand 3 states. [2018-12-08 23:59:29,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 23:59:29,544 INFO L93 Difference]: Finished difference Result 4236 states and 6760 transitions. [2018-12-08 23:59:29,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 23:59:29,544 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-12-08 23:59:29,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 23:59:29,548 INFO L225 Difference]: With dead ends: 4236 [2018-12-08 23:59:29,548 INFO L226 Difference]: Without dead ends: 2474 [2018-12-08 23:59:29,550 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-08 23:59:29,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2474 states. [2018-12-08 23:59:29,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2474 to 2472. [2018-12-08 23:59:29,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2472 states. [2018-12-08 23:59:29,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2472 states to 2472 states and 3910 transitions. [2018-12-08 23:59:29,588 INFO L78 Accepts]: Start accepts. Automaton has 2472 states and 3910 transitions. Word has length 28 [2018-12-08 23:59:29,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 23:59:29,588 INFO L480 AbstractCegarLoop]: Abstraction has 2472 states and 3910 transitions. [2018-12-08 23:59:29,588 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 23:59:29,588 INFO L276 IsEmpty]: Start isEmpty. Operand 2472 states and 3910 transitions. [2018-12-08 23:59:29,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-12-08 23:59:29,590 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 23:59:29,590 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-08 23:59:29,590 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 23:59:29,590 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 23:59:29,590 INFO L82 PathProgramCache]: Analyzing trace with hash 1702016437, now seen corresponding path program 1 times [2018-12-08 23:59:29,590 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 23:59:29,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 23:59:29,591 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 23:59:29,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 23:59:29,591 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 23:59:29,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 23:59:29,603 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-08 23:59:29,604 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 23:59:29,604 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 23:59:29,604 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 23:59:29,604 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 23:59:29,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 23:59:29,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 23:59:29,605 INFO L87 Difference]: Start difference. First operand 2472 states and 3910 transitions. Second operand 3 states. [2018-12-08 23:59:29,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 23:59:29,648 INFO L93 Difference]: Finished difference Result 3708 states and 5848 transitions. [2018-12-08 23:59:29,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 23:59:29,648 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-12-08 23:59:29,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 23:59:29,655 INFO L225 Difference]: With dead ends: 3708 [2018-12-08 23:59:29,655 INFO L226 Difference]: Without dead ends: 2506 [2018-12-08 23:59:29,657 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 23:59:29,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2506 states. [2018-12-08 23:59:29,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2506 to 2504. [2018-12-08 23:59:29,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2504 states. [2018-12-08 23:59:29,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2504 states to 2504 states and 3910 transitions. [2018-12-08 23:59:29,716 INFO L78 Accepts]: Start accepts. Automaton has 2504 states and 3910 transitions. Word has length 29 [2018-12-08 23:59:29,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 23:59:29,716 INFO L480 AbstractCegarLoop]: Abstraction has 2504 states and 3910 transitions. [2018-12-08 23:59:29,716 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 23:59:29,716 INFO L276 IsEmpty]: Start isEmpty. Operand 2504 states and 3910 transitions. [2018-12-08 23:59:29,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-12-08 23:59:29,719 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 23:59:29,719 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-08 23:59:29,719 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 23:59:29,719 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 23:59:29,719 INFO L82 PathProgramCache]: Analyzing trace with hash 113668535, now seen corresponding path program 1 times [2018-12-08 23:59:29,719 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 23:59:29,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 23:59:29,720 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 23:59:29,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 23:59:29,720 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 23:59:29,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 23:59:29,732 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-08 23:59:29,732 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 23:59:29,733 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 23:59:29,733 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 23:59:29,733 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 23:59:29,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 23:59:29,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 23:59:29,733 INFO L87 Difference]: Start difference. First operand 2504 states and 3910 transitions. Second operand 3 states. [2018-12-08 23:59:29,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 23:59:29,782 INFO L93 Difference]: Finished difference Result 4492 states and 7176 transitions. [2018-12-08 23:59:29,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 23:59:29,782 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-12-08 23:59:29,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 23:59:29,789 INFO L225 Difference]: With dead ends: 4492 [2018-12-08 23:59:29,789 INFO L226 Difference]: Without dead ends: 4490 [2018-12-08 23:59:29,791 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-08 23:59:29,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4490 states. [2018-12-08 23:59:29,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4490 to 3592. [2018-12-08 23:59:29,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3592 states. [2018-12-08 23:59:29,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3592 states to 3592 states and 5446 transitions. [2018-12-08 23:59:29,843 INFO L78 Accepts]: Start accepts. Automaton has 3592 states and 5446 transitions. Word has length 29 [2018-12-08 23:59:29,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 23:59:29,843 INFO L480 AbstractCegarLoop]: Abstraction has 3592 states and 5446 transitions. [2018-12-08 23:59:29,843 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 23:59:29,843 INFO L276 IsEmpty]: Start isEmpty. Operand 3592 states and 5446 transitions. [2018-12-08 23:59:29,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-12-08 23:59:29,845 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 23:59:29,845 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-08 23:59:29,846 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 23:59:29,846 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 23:59:29,846 INFO L82 PathProgramCache]: Analyzing trace with hash -907399819, now seen corresponding path program 1 times [2018-12-08 23:59:29,846 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 23:59:29,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 23:59:29,846 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 23:59:29,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 23:59:29,846 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 23:59:29,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 23:59:29,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-08 23:59:29,855 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 23:59:29,855 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 23:59:29,855 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 23:59:29,855 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 23:59:29,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 23:59:29,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 23:59:29,855 INFO L87 Difference]: Start difference. First operand 3592 states and 5446 transitions. Second operand 3 states. [2018-12-08 23:59:29,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 23:59:29,908 INFO L93 Difference]: Finished difference Result 8396 states and 12808 transitions. [2018-12-08 23:59:29,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 23:59:29,909 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-12-08 23:59:29,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 23:59:29,921 INFO L225 Difference]: With dead ends: 8396 [2018-12-08 23:59:29,922 INFO L226 Difference]: Without dead ends: 4874 [2018-12-08 23:59:29,926 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-08 23:59:29,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4874 states. [2018-12-08 23:59:30,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4874 to 4872. [2018-12-08 23:59:30,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4872 states. [2018-12-08 23:59:30,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4872 states to 4872 states and 7366 transitions. [2018-12-08 23:59:30,008 INFO L78 Accepts]: Start accepts. Automaton has 4872 states and 7366 transitions. Word has length 29 [2018-12-08 23:59:30,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 23:59:30,008 INFO L480 AbstractCegarLoop]: Abstraction has 4872 states and 7366 transitions. [2018-12-08 23:59:30,008 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 23:59:30,008 INFO L276 IsEmpty]: Start isEmpty. Operand 4872 states and 7366 transitions. [2018-12-08 23:59:30,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-08 23:59:30,011 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 23:59:30,011 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-08 23:59:30,011 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 23:59:30,011 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 23:59:30,011 INFO L82 PathProgramCache]: Analyzing trace with hash -771028257, now seen corresponding path program 1 times [2018-12-08 23:59:30,011 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 23:59:30,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 23:59:30,012 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 23:59:30,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 23:59:30,012 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 23:59:30,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 23:59:30,035 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-08 23:59:30,035 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 23:59:30,035 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 23:59:30,035 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 23:59:30,036 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 23:59:30,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 23:59:30,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 23:59:30,036 INFO L87 Difference]: Start difference. First operand 4872 states and 7366 transitions. Second operand 3 states. [2018-12-08 23:59:30,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 23:59:30,098 INFO L93 Difference]: Finished difference Result 7308 states and 11016 transitions. [2018-12-08 23:59:30,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 23:59:30,099 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-12-08 23:59:30,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 23:59:30,108 INFO L225 Difference]: With dead ends: 7308 [2018-12-08 23:59:30,109 INFO L226 Difference]: Without dead ends: 4938 [2018-12-08 23:59:30,113 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-08 23:59:30,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4938 states. [2018-12-08 23:59:30,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4938 to 4936. [2018-12-08 23:59:30,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4936 states. [2018-12-08 23:59:30,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4936 states to 4936 states and 7366 transitions. [2018-12-08 23:59:30,194 INFO L78 Accepts]: Start accepts. Automaton has 4936 states and 7366 transitions. Word has length 30 [2018-12-08 23:59:30,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 23:59:30,194 INFO L480 AbstractCegarLoop]: Abstraction has 4936 states and 7366 transitions. [2018-12-08 23:59:30,194 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 23:59:30,195 INFO L276 IsEmpty]: Start isEmpty. Operand 4936 states and 7366 transitions. [2018-12-08 23:59:30,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-08 23:59:30,197 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 23:59:30,197 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-08 23:59:30,198 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 23:59:30,198 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 23:59:30,198 INFO L82 PathProgramCache]: Analyzing trace with hash 1935591137, now seen corresponding path program 1 times [2018-12-08 23:59:30,198 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 23:59:30,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 23:59:30,199 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 23:59:30,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 23:59:30,199 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 23:59:30,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 23:59:30,208 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-08 23:59:30,208 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 23:59:30,208 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 23:59:30,208 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 23:59:30,208 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 23:59:30,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 23:59:30,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 23:59:30,208 INFO L87 Difference]: Start difference. First operand 4936 states and 7366 transitions. Second operand 3 states. [2018-12-08 23:59:30,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 23:59:30,286 INFO L93 Difference]: Finished difference Result 14412 states and 21320 transitions. [2018-12-08 23:59:30,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 23:59:30,287 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-12-08 23:59:30,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 23:59:30,296 INFO L225 Difference]: With dead ends: 14412 [2018-12-08 23:59:30,297 INFO L226 Difference]: Without dead ends: 9610 [2018-12-08 23:59:30,302 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-08 23:59:30,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9610 states. [2018-12-08 23:59:30,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9610 to 9608. [2018-12-08 23:59:30,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9608 states. [2018-12-08 23:59:30,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9608 states to 9608 states and 13958 transitions. [2018-12-08 23:59:30,430 INFO L78 Accepts]: Start accepts. Automaton has 9608 states and 13958 transitions. Word has length 30 [2018-12-08 23:59:30,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 23:59:30,430 INFO L480 AbstractCegarLoop]: Abstraction has 9608 states and 13958 transitions. [2018-12-08 23:59:30,430 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 23:59:30,430 INFO L276 IsEmpty]: Start isEmpty. Operand 9608 states and 13958 transitions. [2018-12-08 23:59:30,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-08 23:59:30,435 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 23:59:30,435 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-08 23:59:30,435 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 23:59:30,435 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 23:59:30,435 INFO L82 PathProgramCache]: Analyzing trace with hash -1338307805, now seen corresponding path program 1 times [2018-12-08 23:59:30,435 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 23:59:30,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 23:59:30,436 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 23:59:30,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 23:59:30,436 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 23:59:30,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 23:59:30,448 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-08 23:59:30,448 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 23:59:30,449 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 23:59:30,449 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 23:59:30,449 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 23:59:30,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 23:59:30,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 23:59:30,449 INFO L87 Difference]: Start difference. First operand 9608 states and 13958 transitions. Second operand 3 states. [2018-12-08 23:59:30,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 23:59:30,564 INFO L93 Difference]: Finished difference Result 11148 states and 16776 transitions. [2018-12-08 23:59:30,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 23:59:30,564 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-12-08 23:59:30,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 23:59:30,583 INFO L225 Difference]: With dead ends: 11148 [2018-12-08 23:59:30,584 INFO L226 Difference]: Without dead ends: 11146 [2018-12-08 23:59:30,587 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-08 23:59:30,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11146 states. [2018-12-08 23:59:30,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11146 to 9608. [2018-12-08 23:59:30,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9608 states. [2018-12-08 23:59:30,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9608 states to 9608 states and 13830 transitions. [2018-12-08 23:59:30,726 INFO L78 Accepts]: Start accepts. Automaton has 9608 states and 13830 transitions. Word has length 30 [2018-12-08 23:59:30,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 23:59:30,726 INFO L480 AbstractCegarLoop]: Abstraction has 9608 states and 13830 transitions. [2018-12-08 23:59:30,726 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 23:59:30,726 INFO L276 IsEmpty]: Start isEmpty. Operand 9608 states and 13830 transitions. [2018-12-08 23:59:30,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-08 23:59:30,731 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 23:59:30,731 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 23:59:30,731 INFO L423 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 23:59:30,731 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 23:59:30,732 INFO L82 PathProgramCache]: Analyzing trace with hash -126002102, now seen corresponding path program 1 times [2018-12-08 23:59:30,732 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 23:59:30,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 23:59:30,732 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 23:59:30,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 23:59:30,733 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 23:59:30,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 23:59:30,744 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-08 23:59:30,744 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 23:59:30,744 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 23:59:30,744 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 23:59:30,744 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 23:59:30,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 23:59:30,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 23:59:30,745 INFO L87 Difference]: Start difference. First operand 9608 states and 13830 transitions. Second operand 3 states. [2018-12-08 23:59:30,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 23:59:30,888 INFO L93 Difference]: Finished difference Result 16780 states and 24712 transitions. [2018-12-08 23:59:30,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 23:59:30,889 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-12-08 23:59:30,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 23:59:30,905 INFO L225 Difference]: With dead ends: 16780 [2018-12-08 23:59:30,905 INFO L226 Difference]: Without dead ends: 16778 [2018-12-08 23:59:30,909 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-08 23:59:30,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16778 states. [2018-12-08 23:59:31,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16778 to 14216. [2018-12-08 23:59:31,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14216 states. [2018-12-08 23:59:31,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14216 states to 14216 states and 19846 transitions. [2018-12-08 23:59:31,080 INFO L78 Accepts]: Start accepts. Automaton has 14216 states and 19846 transitions. Word has length 31 [2018-12-08 23:59:31,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 23:59:31,080 INFO L480 AbstractCegarLoop]: Abstraction has 14216 states and 19846 transitions. [2018-12-08 23:59:31,080 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 23:59:31,081 INFO L276 IsEmpty]: Start isEmpty. Operand 14216 states and 19846 transitions. [2018-12-08 23:59:31,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-08 23:59:31,090 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 23:59:31,091 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-08 23:59:31,091 INFO L423 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 23:59:31,091 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 23:59:31,091 INFO L82 PathProgramCache]: Analyzing trace with hash -1147070456, now seen corresponding path program 1 times [2018-12-08 23:59:31,091 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 23:59:31,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 23:59:31,092 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 23:59:31,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 23:59:31,092 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 23:59:31,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 23:59:31,120 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-08 23:59:31,120 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 23:59:31,121 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 23:59:31,121 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 23:59:31,121 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 23:59:31,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 23:59:31,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 23:59:31,121 INFO L87 Difference]: Start difference. First operand 14216 states and 19846 transitions. Second operand 3 states. [2018-12-08 23:59:31,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 23:59:31,263 INFO L93 Difference]: Finished difference Result 32908 states and 46216 transitions. [2018-12-08 23:59:31,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 23:59:31,263 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-12-08 23:59:31,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 23:59:31,281 INFO L225 Difference]: With dead ends: 32908 [2018-12-08 23:59:31,281 INFO L226 Difference]: Without dead ends: 18826 [2018-12-08 23:59:31,292 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-08 23:59:31,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18826 states. [2018-12-08 23:59:31,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18826 to 18824. [2018-12-08 23:59:31,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18824 states. [2018-12-08 23:59:31,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18824 states to 18824 states and 26118 transitions. [2018-12-08 23:59:31,516 INFO L78 Accepts]: Start accepts. Automaton has 18824 states and 26118 transitions. Word has length 31 [2018-12-08 23:59:31,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 23:59:31,517 INFO L480 AbstractCegarLoop]: Abstraction has 18824 states and 26118 transitions. [2018-12-08 23:59:31,517 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 23:59:31,517 INFO L276 IsEmpty]: Start isEmpty. Operand 18824 states and 26118 transitions. [2018-12-08 23:59:31,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-08 23:59:31,523 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 23:59:31,524 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-08 23:59:31,524 INFO L423 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 23:59:31,524 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 23:59:31,524 INFO L82 PathProgramCache]: Analyzing trace with hash 389117270, now seen corresponding path program 1 times [2018-12-08 23:59:31,524 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 23:59:31,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 23:59:31,525 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 23:59:31,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 23:59:31,525 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 23:59:31,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 23:59:31,544 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-08 23:59:31,544 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 23:59:31,544 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 23:59:31,544 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 23:59:31,545 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 23:59:31,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 23:59:31,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 23:59:31,545 INFO L87 Difference]: Start difference. First operand 18824 states and 26118 transitions. Second operand 3 states. [2018-12-08 23:59:31,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 23:59:31,695 INFO L93 Difference]: Finished difference Result 28428 states and 39432 transitions. [2018-12-08 23:59:31,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 23:59:31,695 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-12-08 23:59:31,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 23:59:31,711 INFO L225 Difference]: With dead ends: 28428 [2018-12-08 23:59:31,711 INFO L226 Difference]: Without dead ends: 19210 [2018-12-08 23:59:31,750 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-08 23:59:31,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19210 states. [2018-12-08 23:59:31,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19210 to 19208. [2018-12-08 23:59:31,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19208 states. [2018-12-08 23:59:31,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19208 states to 19208 states and 26374 transitions. [2018-12-08 23:59:31,962 INFO L78 Accepts]: Start accepts. Automaton has 19208 states and 26374 transitions. Word has length 32 [2018-12-08 23:59:31,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 23:59:31,962 INFO L480 AbstractCegarLoop]: Abstraction has 19208 states and 26374 transitions. [2018-12-08 23:59:31,962 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 23:59:31,962 INFO L276 IsEmpty]: Start isEmpty. Operand 19208 states and 26374 transitions. [2018-12-08 23:59:31,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-08 23:59:31,969 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 23:59:31,969 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-08 23:59:31,969 INFO L423 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 23:59:31,970 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 23:59:31,970 INFO L82 PathProgramCache]: Analyzing trace with hash -1199230632, now seen corresponding path program 1 times [2018-12-08 23:59:31,970 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 23:59:31,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 23:59:31,971 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 23:59:31,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 23:59:31,971 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 23:59:31,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 23:59:31,984 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 23:59:31,984 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 23:59:31,984 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 23:59:31,984 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 23:59:31,984 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 23:59:31,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 23:59:31,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 23:59:31,984 INFO L87 Difference]: Start difference. First operand 19208 states and 26374 transitions. Second operand 3 states. [2018-12-08 23:59:32,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 23:59:32,216 INFO L93 Difference]: Finished difference Result 32780 states and 45832 transitions. [2018-12-08 23:59:32,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 23:59:32,217 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-12-08 23:59:32,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 23:59:32,237 INFO L225 Difference]: With dead ends: 32780 [2018-12-08 23:59:32,237 INFO L226 Difference]: Without dead ends: 32778 [2018-12-08 23:59:32,243 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-08 23:59:32,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32778 states. [2018-12-08 23:59:32,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32778 to 28680. [2018-12-08 23:59:32,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28680 states. [2018-12-08 23:59:32,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28680 states to 28680 states and 38150 transitions. [2018-12-08 23:59:32,557 INFO L78 Accepts]: Start accepts. Automaton has 28680 states and 38150 transitions. Word has length 32 [2018-12-08 23:59:32,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 23:59:32,558 INFO L480 AbstractCegarLoop]: Abstraction has 28680 states and 38150 transitions. [2018-12-08 23:59:32,558 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 23:59:32,558 INFO L276 IsEmpty]: Start isEmpty. Operand 28680 states and 38150 transitions. [2018-12-08 23:59:32,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-08 23:59:32,569 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 23:59:32,569 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-08 23:59:32,569 INFO L423 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 23:59:32,569 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 23:59:32,569 INFO L82 PathProgramCache]: Analyzing trace with hash 2074668310, now seen corresponding path program 1 times [2018-12-08 23:59:32,569 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 23:59:32,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 23:59:32,570 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 23:59:32,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 23:59:32,570 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 23:59:32,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 23:59:32,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-08 23:59:32,582 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 23:59:32,583 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 23:59:32,583 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 23:59:32,583 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 23:59:32,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 23:59:32,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 23:59:32,583 INFO L87 Difference]: Start difference. First operand 28680 states and 38150 transitions. Second operand 3 states. [2018-12-08 23:59:32,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 23:59:32,892 INFO L93 Difference]: Finished difference Result 65548 states and 87304 transitions. [2018-12-08 23:59:32,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 23:59:32,893 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-12-08 23:59:32,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 23:59:32,921 INFO L225 Difference]: With dead ends: 65548 [2018-12-08 23:59:32,921 INFO L226 Difference]: Without dead ends: 37386 [2018-12-08 23:59:32,957 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-08 23:59:32,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37386 states. [2018-12-08 23:59:33,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37386 to 37384. [2018-12-08 23:59:33,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37384 states. [2018-12-08 23:59:33,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37384 states to 37384 states and 49158 transitions. [2018-12-08 23:59:33,441 INFO L78 Accepts]: Start accepts. Automaton has 37384 states and 49158 transitions. Word has length 32 [2018-12-08 23:59:33,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 23:59:33,441 INFO L480 AbstractCegarLoop]: Abstraction has 37384 states and 49158 transitions. [2018-12-08 23:59:33,441 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 23:59:33,441 INFO L276 IsEmpty]: Start isEmpty. Operand 37384 states and 49158 transitions. [2018-12-08 23:59:33,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-12-08 23:59:33,451 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 23:59:33,451 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-08 23:59:33,451 INFO L423 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 23:59:33,451 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 23:59:33,451 INFO L82 PathProgramCache]: Analyzing trace with hash 1478771549, now seen corresponding path program 1 times [2018-12-08 23:59:33,452 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 23:59:33,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 23:59:33,452 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 23:59:33,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 23:59:33,452 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 23:59:33,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 23:59:33,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-08 23:59:33,471 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 23:59:33,471 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 23:59:33,471 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 23:59:33,471 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 23:59:33,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 23:59:33,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 23:59:33,472 INFO L87 Difference]: Start difference. First operand 37384 states and 49158 transitions. Second operand 3 states. [2018-12-08 23:59:33,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 23:59:33,740 INFO L93 Difference]: Finished difference Result 56076 states and 73480 transitions. [2018-12-08 23:59:33,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 23:59:33,741 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2018-12-08 23:59:33,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 23:59:33,766 INFO L225 Difference]: With dead ends: 56076 [2018-12-08 23:59:33,767 INFO L226 Difference]: Without dead ends: 37898 [2018-12-08 23:59:33,780 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-08 23:59:33,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37898 states. [2018-12-08 23:59:34,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37898 to 37896. [2018-12-08 23:59:34,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37896 states. [2018-12-08 23:59:34,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37896 states to 37896 states and 49158 transitions. [2018-12-08 23:59:34,273 INFO L78 Accepts]: Start accepts. Automaton has 37896 states and 49158 transitions. Word has length 33 [2018-12-08 23:59:34,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 23:59:34,273 INFO L480 AbstractCegarLoop]: Abstraction has 37896 states and 49158 transitions. [2018-12-08 23:59:34,273 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 23:59:34,273 INFO L276 IsEmpty]: Start isEmpty. Operand 37896 states and 49158 transitions. [2018-12-08 23:59:34,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-12-08 23:59:34,284 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 23:59:34,284 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-08 23:59:34,285 INFO L423 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 23:59:34,285 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 23:59:34,285 INFO L82 PathProgramCache]: Analyzing trace with hash -109576353, now seen corresponding path program 1 times [2018-12-08 23:59:34,285 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 23:59:34,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 23:59:34,285 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 23:59:34,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 23:59:34,286 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 23:59:34,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 23:59:34,311 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-08 23:59:34,311 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 23:59:34,311 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 23:59:34,311 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 23:59:34,312 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 23:59:34,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 23:59:34,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 23:59:34,312 INFO L87 Difference]: Start difference. First operand 37896 states and 49158 transitions. Second operand 3 states. [2018-12-08 23:59:34,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 23:59:34,759 INFO L93 Difference]: Finished difference Result 63500 states and 83464 transitions. [2018-12-08 23:59:34,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 23:59:34,759 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2018-12-08 23:59:34,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 23:59:34,801 INFO L225 Difference]: With dead ends: 63500 [2018-12-08 23:59:34,801 INFO L226 Difference]: Without dead ends: 63498 [2018-12-08 23:59:34,810 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-08 23:59:34,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63498 states. [2018-12-08 23:59:35,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63498 to 57352. [2018-12-08 23:59:35,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57352 states. [2018-12-08 23:59:35,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57352 states to 57352 states and 72198 transitions. [2018-12-08 23:59:35,478 INFO L78 Accepts]: Start accepts. Automaton has 57352 states and 72198 transitions. Word has length 33 [2018-12-08 23:59:35,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 23:59:35,478 INFO L480 AbstractCegarLoop]: Abstraction has 57352 states and 72198 transitions. [2018-12-08 23:59:35,478 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 23:59:35,478 INFO L276 IsEmpty]: Start isEmpty. Operand 57352 states and 72198 transitions. [2018-12-08 23:59:35,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-12-08 23:59:35,500 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 23:59:35,501 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-08 23:59:35,501 INFO L423 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 23:59:35,501 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 23:59:35,501 INFO L82 PathProgramCache]: Analyzing trace with hash -1130644707, now seen corresponding path program 1 times [2018-12-08 23:59:35,501 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 23:59:35,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 23:59:35,502 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 23:59:35,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 23:59:35,502 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 23:59:35,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 23:59:35,515 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-08 23:59:35,515 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 23:59:35,515 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 23:59:35,515 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 23:59:35,515 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 23:59:35,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 23:59:35,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 23:59:35,516 INFO L87 Difference]: Start difference. First operand 57352 states and 72198 transitions. Second operand 3 states. [2018-12-08 23:59:36,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 23:59:36,123 INFO L93 Difference]: Finished difference Result 130060 states and 163336 transitions. [2018-12-08 23:59:36,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 23:59:36,124 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2018-12-08 23:59:36,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 23:59:36,295 INFO L225 Difference]: With dead ends: 130060 [2018-12-08 23:59:36,295 INFO L226 Difference]: Without dead ends: 73738 [2018-12-08 23:59:36,314 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-08 23:59:36,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73738 states. [2018-12-08 23:59:37,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73738 to 73736. [2018-12-08 23:59:37,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73736 states. [2018-12-08 23:59:37,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73736 states to 73736 states and 91142 transitions. [2018-12-08 23:59:37,160 INFO L78 Accepts]: Start accepts. Automaton has 73736 states and 91142 transitions. Word has length 33 [2018-12-08 23:59:37,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 23:59:37,161 INFO L480 AbstractCegarLoop]: Abstraction has 73736 states and 91142 transitions. [2018-12-08 23:59:37,161 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 23:59:37,161 INFO L276 IsEmpty]: Start isEmpty. Operand 73736 states and 91142 transitions. [2018-12-08 23:59:37,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-08 23:59:37,183 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 23:59:37,183 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-08 23:59:37,184 INFO L423 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 23:59:37,184 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 23:59:37,184 INFO L82 PathProgramCache]: Analyzing trace with hash 898316171, now seen corresponding path program 1 times [2018-12-08 23:59:37,184 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 23:59:37,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 23:59:37,184 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 23:59:37,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 23:59:37,185 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 23:59:37,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 23:59:37,193 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-08 23:59:37,193 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 23:59:37,193 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 23:59:37,193 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 23:59:37,193 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 23:59:37,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 23:59:37,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 23:59:37,193 INFO L87 Difference]: Start difference. First operand 73736 states and 91142 transitions. Second operand 3 states. [2018-12-08 23:59:37,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 23:59:37,876 INFO L93 Difference]: Finished difference Result 110604 states and 136200 transitions. [2018-12-08 23:59:37,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 23:59:37,876 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-12-08 23:59:37,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 23:59:37,925 INFO L225 Difference]: With dead ends: 110604 [2018-12-08 23:59:37,925 INFO L226 Difference]: Without dead ends: 74762 [2018-12-08 23:59:37,948 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-08 23:59:37,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74762 states. [2018-12-08 23:59:38,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74762 to 74760. [2018-12-08 23:59:38,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74760 states. [2018-12-08 23:59:38,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74760 states to 74760 states and 91142 transitions. [2018-12-08 23:59:38,859 INFO L78 Accepts]: Start accepts. Automaton has 74760 states and 91142 transitions. Word has length 34 [2018-12-08 23:59:38,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 23:59:38,859 INFO L480 AbstractCegarLoop]: Abstraction has 74760 states and 91142 transitions. [2018-12-08 23:59:38,859 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 23:59:38,859 INFO L276 IsEmpty]: Start isEmpty. Operand 74760 states and 91142 transitions. [2018-12-08 23:59:38,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-08 23:59:38,882 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 23:59:38,882 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-08 23:59:38,883 INFO L423 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 23:59:38,883 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 23:59:38,883 INFO L82 PathProgramCache]: Analyzing trace with hash -690031731, now seen corresponding path program 1 times [2018-12-08 23:59:38,883 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 23:59:38,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 23:59:38,883 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 23:59:38,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 23:59:38,884 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 23:59:38,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 23:59:38,891 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-08 23:59:38,891 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 23:59:38,891 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 23:59:38,891 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 23:59:38,891 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 23:59:38,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 23:59:38,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 23:59:38,892 INFO L87 Difference]: Start difference. First operand 74760 states and 91142 transitions. Second operand 3 states. [2018-12-08 23:59:39,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 23:59:39,913 INFO L93 Difference]: Finished difference Result 122892 states and 150536 transitions. [2018-12-08 23:59:39,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 23:59:39,913 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-12-08 23:59:39,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 23:59:39,990 INFO L225 Difference]: With dead ends: 122892 [2018-12-08 23:59:39,990 INFO L226 Difference]: Without dead ends: 122890 [2018-12-08 23:59:40,006 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-08 23:59:40,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122890 states. [2018-12-08 23:59:41,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122890 to 114696. [2018-12-08 23:59:41,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114696 states. [2018-12-08 23:59:41,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114696 states to 114696 states and 136198 transitions. [2018-12-08 23:59:41,353 INFO L78 Accepts]: Start accepts. Automaton has 114696 states and 136198 transitions. Word has length 34 [2018-12-08 23:59:41,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 23:59:41,353 INFO L480 AbstractCegarLoop]: Abstraction has 114696 states and 136198 transitions. [2018-12-08 23:59:41,354 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 23:59:41,354 INFO L276 IsEmpty]: Start isEmpty. Operand 114696 states and 136198 transitions. [2018-12-08 23:59:41,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-08 23:59:41,397 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 23:59:41,397 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-08 23:59:41,397 INFO L423 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 23:59:41,397 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 23:59:41,397 INFO L82 PathProgramCache]: Analyzing trace with hash -1711100085, now seen corresponding path program 1 times [2018-12-08 23:59:41,398 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 23:59:41,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 23:59:41,398 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 23:59:41,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 23:59:41,398 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 23:59:41,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 23:59:41,407 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-08 23:59:41,407 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 23:59:41,407 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 23:59:41,407 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 23:59:41,407 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 23:59:41,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 23:59:41,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 23:59:41,408 INFO L87 Difference]: Start difference. First operand 114696 states and 136198 transitions. Second operand 3 states. [2018-12-08 23:59:42,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 23:59:42,715 INFO L93 Difference]: Finished difference Result 258060 states and 304136 transitions. [2018-12-08 23:59:42,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 23:59:42,715 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-12-08 23:59:42,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 23:59:42,825 INFO L225 Difference]: With dead ends: 258060 [2018-12-08 23:59:42,826 INFO L226 Difference]: Without dead ends: 145418 [2018-12-08 23:59:42,897 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-08 23:59:42,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145418 states. [2018-12-08 23:59:44,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145418 to 145416. [2018-12-08 23:59:44,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145416 states. [2018-12-08 23:59:44,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145416 states to 145416 states and 167942 transitions. [2018-12-08 23:59:44,862 INFO L78 Accepts]: Start accepts. Automaton has 145416 states and 167942 transitions. Word has length 34 [2018-12-08 23:59:44,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 23:59:44,862 INFO L480 AbstractCegarLoop]: Abstraction has 145416 states and 167942 transitions. [2018-12-08 23:59:44,862 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 23:59:44,862 INFO L276 IsEmpty]: Start isEmpty. Operand 145416 states and 167942 transitions. [2018-12-08 23:59:44,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-12-08 23:59:44,911 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 23:59:44,911 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-08 23:59:44,912 INFO L423 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 23:59:44,912 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 23:59:44,912 INFO L82 PathProgramCache]: Analyzing trace with hash 84068978, now seen corresponding path program 1 times [2018-12-08 23:59:44,912 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 23:59:44,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 23:59:44,912 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 23:59:44,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 23:59:44,913 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 23:59:44,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 23:59:44,925 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-08 23:59:44,925 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 23:59:44,925 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 23:59:44,925 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 23:59:44,926 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 23:59:44,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 23:59:44,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 23:59:44,926 INFO L87 Difference]: Start difference. First operand 145416 states and 167942 transitions. Second operand 3 states. [2018-12-08 23:59:47,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 23:59:47,041 INFO L93 Difference]: Finished difference Result 218124 states and 250888 transitions. [2018-12-08 23:59:47,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 23:59:47,041 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2018-12-08 23:59:47,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 23:59:47,144 INFO L225 Difference]: With dead ends: 218124 [2018-12-08 23:59:47,145 INFO L226 Difference]: Without dead ends: 147466 [2018-12-08 23:59:47,184 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-08 23:59:47,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147466 states. [2018-12-08 23:59:48,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147466 to 147464. [2018-12-08 23:59:48,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147464 states. [2018-12-08 23:59:49,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147464 states to 147464 states and 167942 transitions. [2018-12-08 23:59:49,095 INFO L78 Accepts]: Start accepts. Automaton has 147464 states and 167942 transitions. Word has length 35 [2018-12-08 23:59:49,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 23:59:49,095 INFO L480 AbstractCegarLoop]: Abstraction has 147464 states and 167942 transitions. [2018-12-08 23:59:49,095 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 23:59:49,095 INFO L276 IsEmpty]: Start isEmpty. Operand 147464 states and 167942 transitions. [2018-12-08 23:59:49,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-12-08 23:59:49,146 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 23:59:49,146 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-08 23:59:49,146 INFO L423 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 23:59:49,146 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 23:59:49,146 INFO L82 PathProgramCache]: Analyzing trace with hash -1504278924, now seen corresponding path program 1 times [2018-12-08 23:59:49,146 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 23:59:49,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 23:59:49,147 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 23:59:49,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 23:59:49,147 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 23:59:49,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 23:59:49,163 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-08 23:59:49,163 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 23:59:49,163 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 23:59:49,163 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 23:59:49,164 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 23:59:49,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 23:59:49,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 23:59:49,164 INFO L87 Difference]: Start difference. First operand 147464 states and 167942 transitions. Second operand 3 states. [2018-12-08 23:59:51,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 23:59:51,416 INFO L93 Difference]: Finished difference Result 237578 states and 268295 transitions. [2018-12-08 23:59:51,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 23:59:51,417 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2018-12-08 23:59:51,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 23:59:51,601 INFO L225 Difference]: With dead ends: 237578 [2018-12-08 23:59:51,601 INFO L226 Difference]: Without dead ends: 237576 [2018-12-08 23:59:51,627 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-08 23:59:51,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237576 states. [2018-12-08 23:59:54,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237576 to 229384. [2018-12-08 23:59:54,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229384 states. [2018-12-08 23:59:54,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229384 states to 229384 states and 256006 transitions. [2018-12-08 23:59:54,319 INFO L78 Accepts]: Start accepts. Automaton has 229384 states and 256006 transitions. Word has length 35 [2018-12-08 23:59:54,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 23:59:54,319 INFO L480 AbstractCegarLoop]: Abstraction has 229384 states and 256006 transitions. [2018-12-08 23:59:54,319 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 23:59:54,319 INFO L276 IsEmpty]: Start isEmpty. Operand 229384 states and 256006 transitions. [2018-12-08 23:59:54,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-12-08 23:59:54,429 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 23:59:54,429 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-08 23:59:54,429 INFO L423 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 23:59:54,429 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 23:59:54,429 INFO L82 PathProgramCache]: Analyzing trace with hash 1769620018, now seen corresponding path program 1 times [2018-12-08 23:59:54,429 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 23:59:54,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 23:59:54,430 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 23:59:54,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 23:59:54,430 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 23:59:54,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 23:59:54,450 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-08 23:59:54,450 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 23:59:54,450 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 23:59:54,450 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 23:59:54,450 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 23:59:54,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 23:59:54,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 23:59:54,451 INFO L87 Difference]: Start difference. First operand 229384 states and 256006 transitions. Second operand 3 states. [2018-12-08 23:59:57,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 23:59:57,423 INFO L93 Difference]: Finished difference Result 512008 states and 563206 transitions. [2018-12-08 23:59:57,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 23:59:57,423 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2018-12-08 23:59:57,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 23:59:57,424 INFO L225 Difference]: With dead ends: 512008 [2018-12-08 23:59:57,424 INFO L226 Difference]: Without dead ends: 0 [2018-12-08 23:59:57,558 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-08 23:59:57,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-08 23:59:57,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-08 23:59:57,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-08 23:59:57,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-08 23:59:57,558 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 35 [2018-12-08 23:59:57,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 23:59:57,558 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-08 23:59:57,559 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 23:59:57,559 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-08 23:59:57,559 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-08 23:59:57,562 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-08 23:59:57,601 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-12-08 23:59:57,601 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-12-08 23:59:57,601 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-12-08 23:59:57,601 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-12-08 23:59:57,601 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-12-08 23:59:57,601 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-12-08 23:59:57,601 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 4 205) no Hoare annotation was computed. [2018-12-08 23:59:57,601 INFO L448 ceAbstractionStarter]: For program point L151(line 151) no Hoare annotation was computed. [2018-12-08 23:59:57,601 INFO L448 ceAbstractionStarter]: For program point L85-1(lines 48 200) no Hoare annotation was computed. [2018-12-08 23:59:57,601 INFO L451 ceAbstractionStarter]: At program point L201(lines 5 205) the Hoare annotation is: true [2018-12-08 23:59:57,601 INFO L448 ceAbstractionStarter]: For program point L135-1(lines 48 200) no Hoare annotation was computed. [2018-12-08 23:59:57,601 INFO L448 ceAbstractionStarter]: For program point L185-1(lines 48 200) no Hoare annotation was computed. [2018-12-08 23:59:57,601 INFO L448 ceAbstractionStarter]: For program point L136(line 136) no Hoare annotation was computed. [2018-12-08 23:59:57,601 INFO L448 ceAbstractionStarter]: For program point L186(line 186) no Hoare annotation was computed. [2018-12-08 23:59:57,601 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 4 205) no Hoare annotation was computed. [2018-12-08 23:59:57,601 INFO L448 ceAbstractionStarter]: For program point L170-1(lines 48 200) no Hoare annotation was computed. [2018-12-08 23:59:57,602 INFO L448 ceAbstractionStarter]: For program point L121-1(lines 48 200) no Hoare annotation was computed. [2018-12-08 23:59:57,602 INFO L448 ceAbstractionStarter]: For program point L171(line 171) no Hoare annotation was computed. [2018-12-08 23:59:57,602 INFO L448 ceAbstractionStarter]: For program point L105-1(lines 48 200) no Hoare annotation was computed. [2018-12-08 23:59:57,602 INFO L448 ceAbstractionStarter]: For program point L155-1(lines 48 200) no Hoare annotation was computed. [2018-12-08 23:59:57,602 INFO L448 ceAbstractionStarter]: For program point L89-1(lines 48 200) no Hoare annotation was computed. [2018-12-08 23:59:57,602 INFO L448 ceAbstractionStarter]: For program point L156(line 156) no Hoare annotation was computed. [2018-12-08 23:59:57,602 INFO L448 ceAbstractionStarter]: For program point L140-1(lines 48 200) no Hoare annotation was computed. [2018-12-08 23:59:57,602 INFO L448 ceAbstractionStarter]: For program point L190-1(lines 48 200) no Hoare annotation was computed. [2018-12-08 23:59:57,602 INFO L448 ceAbstractionStarter]: For program point L141(line 141) no Hoare annotation was computed. [2018-12-08 23:59:57,602 INFO L448 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 203) no Hoare annotation was computed. [2018-12-08 23:59:57,602 INFO L448 ceAbstractionStarter]: For program point L191(line 191) no Hoare annotation was computed. [2018-12-08 23:59:57,602 INFO L448 ceAbstractionStarter]: For program point L125-1(lines 48 200) no Hoare annotation was computed. [2018-12-08 23:59:57,602 INFO L448 ceAbstractionStarter]: For program point L175-1(lines 48 200) no Hoare annotation was computed. [2018-12-08 23:59:57,602 INFO L448 ceAbstractionStarter]: For program point L109-1(lines 48 200) no Hoare annotation was computed. [2018-12-08 23:59:57,602 INFO L448 ceAbstractionStarter]: For program point L93-1(lines 48 200) no Hoare annotation was computed. [2018-12-08 23:59:57,602 INFO L448 ceAbstractionStarter]: For program point L176(line 176) no Hoare annotation was computed. [2018-12-08 23:59:57,602 INFO L448 ceAbstractionStarter]: For program point L160-1(lines 48 200) no Hoare annotation was computed. [2018-12-08 23:59:57,602 INFO L448 ceAbstractionStarter]: For program point L161(line 161) no Hoare annotation was computed. [2018-12-08 23:59:57,603 INFO L448 ceAbstractionStarter]: For program point L145-1(lines 48 200) no Hoare annotation was computed. [2018-12-08 23:59:57,603 INFO L451 ceAbstractionStarter]: At program point L195-1(lines 48 200) the Hoare annotation is: true [2018-12-08 23:59:57,603 INFO L448 ceAbstractionStarter]: For program point L129-1(lines 48 200) no Hoare annotation was computed. [2018-12-08 23:59:57,603 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 4 205) the Hoare annotation is: true [2018-12-08 23:59:57,603 INFO L448 ceAbstractionStarter]: For program point L146(line 146) no Hoare annotation was computed. [2018-12-08 23:59:57,603 INFO L448 ceAbstractionStarter]: For program point L113-1(lines 48 200) no Hoare annotation was computed. [2018-12-08 23:59:57,603 INFO L448 ceAbstractionStarter]: For program point L196(line 196) no Hoare annotation was computed. [2018-12-08 23:59:57,603 INFO L444 ceAbstractionStarter]: At program point L196-1(lines 5 205) the Hoare annotation is: false [2018-12-08 23:59:57,603 INFO L448 ceAbstractionStarter]: For program point L97-1(lines 48 200) no Hoare annotation was computed. [2018-12-08 23:59:57,603 INFO L448 ceAbstractionStarter]: For program point L180-1(lines 48 200) no Hoare annotation was computed. [2018-12-08 23:59:57,603 INFO L448 ceAbstractionStarter]: For program point L81(lines 81 83) no Hoare annotation was computed. [2018-12-08 23:59:57,603 INFO L448 ceAbstractionStarter]: For program point L81-2(lines 48 200) no Hoare annotation was computed. [2018-12-08 23:59:57,603 INFO L448 ceAbstractionStarter]: For program point L181(line 181) no Hoare annotation was computed. [2018-12-08 23:59:57,603 INFO L448 ceAbstractionStarter]: For program point L165-1(lines 48 200) no Hoare annotation was computed. [2018-12-08 23:59:57,603 INFO L448 ceAbstractionStarter]: For program point L50(lines 50 52) no Hoare annotation was computed. [2018-12-08 23:59:57,603 INFO L448 ceAbstractionStarter]: For program point L166(line 166) no Hoare annotation was computed. [2018-12-08 23:59:57,603 INFO L448 ceAbstractionStarter]: For program point L150-1(lines 48 200) no Hoare annotation was computed. [2018-12-08 23:59:57,603 INFO L448 ceAbstractionStarter]: For program point L117-1(lines 48 200) no Hoare annotation was computed. [2018-12-08 23:59:57,603 INFO L448 ceAbstractionStarter]: For program point L101-1(lines 48 200) no Hoare annotation was computed. [2018-12-08 23:59:57,608 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.12 11:59:57 BoogieIcfgContainer [2018-12-08 23:59:57,608 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-08 23:59:57,608 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-08 23:59:57,608 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-08 23:59:57,609 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-08 23:59:57,609 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 11:59:28" (3/4) ... [2018-12-08 23:59:57,612 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-08 23:59:57,616 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-12-08 23:59:57,617 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-12-08 23:59:57,620 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2018-12-08 23:59:57,620 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-12-08 23:59:57,621 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-12-08 23:59:57,655 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_cf1fcc48-056f-424d-841f-6e532fd20f23/bin-2019/utaipan/witness.graphml [2018-12-08 23:59:57,655 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-08 23:59:57,656 INFO L168 Benchmark]: Toolchain (without parser) took 29717.21 ms. Allocated memory was 1.0 GB in the beginning and 5.0 GB in the end (delta: 4.0 GB). Free memory was 958.8 MB in the beginning and 3.4 GB in the end (delta: -2.5 GB). Peak memory consumption was 1.5 GB. Max. memory is 11.5 GB. [2018-12-08 23:59:57,657 INFO L168 Benchmark]: CDTParser took 0.11 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-08 23:59:57,657 INFO L168 Benchmark]: CACSL2BoogieTranslator took 136.53 ms. Allocated memory is still 1.0 GB. Free memory was 958.8 MB in the beginning and 948.1 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-12-08 23:59:57,657 INFO L168 Benchmark]: Boogie Procedure Inliner took 12.68 ms. Allocated memory is still 1.0 GB. Free memory was 948.1 MB in the beginning and 942.7 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-12-08 23:59:57,657 INFO L168 Benchmark]: Boogie Preprocessor took 46.44 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 90.7 MB). Free memory was 942.7 MB in the beginning and 1.1 GB in the end (delta: -143.3 MB). Peak memory consumption was 13.0 MB. Max. memory is 11.5 GB. [2018-12-08 23:59:57,657 INFO L168 Benchmark]: RCFGBuilder took 182.28 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.7 MB). Peak memory consumption was 19.7 MB. Max. memory is 11.5 GB. [2018-12-08 23:59:57,658 INFO L168 Benchmark]: TraceAbstraction took 29289.46 ms. Allocated memory was 1.1 GB in the beginning and 5.0 GB in the end (delta: 3.9 GB). Free memory was 1.1 GB in the beginning and 3.4 GB in the end (delta: -2.3 GB). Peak memory consumption was 1.5 GB. Max. memory is 11.5 GB. [2018-12-08 23:59:57,658 INFO L168 Benchmark]: Witness Printer took 47.05 ms. Allocated memory is still 5.0 GB. Free memory was 3.4 GB in the beginning and 3.4 GB in the end (delta: 1.0 MB). Peak memory consumption was 1.0 MB. Max. memory is 11.5 GB. [2018-12-08 23:59:57,659 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.11 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 136.53 ms. Allocated memory is still 1.0 GB. Free memory was 958.8 MB in the beginning and 948.1 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 12.68 ms. Allocated memory is still 1.0 GB. Free memory was 948.1 MB in the beginning and 942.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 46.44 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 90.7 MB). Free memory was 942.7 MB in the beginning and 1.1 GB in the end (delta: -143.3 MB). Peak memory consumption was 13.0 MB. Max. memory is 11.5 GB. * RCFGBuilder took 182.28 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.7 MB). Peak memory consumption was 19.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 29289.46 ms. Allocated memory was 1.1 GB in the beginning and 5.0 GB in the end (delta: 3.9 GB). Free memory was 1.1 GB in the beginning and 3.4 GB in the end (delta: -2.3 GB). Peak memory consumption was 1.5 GB. Max. memory is 11.5 GB. * Witness Printer took 47.05 ms. Allocated memory is still 5.0 GB. Free memory was 3.4 GB in the beginning and 3.4 GB in the end (delta: 1.0 MB). Peak memory consumption was 1.0 MB. 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.2s OverallTime, 37 OverallIterations, 1 TraceHistogramMax, 14.8s 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.2s 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: 13.0s 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...